|
|
| IST3015 | Data Structures | 4+0+0 | ECTS:6 | | Year / Semester | Fall Semester | | Level of Course | First Cycle | | Status | Elective | | Department | DEPARTMENT of STATISTICS and COMPUTER SCIENCES | | Prerequisites and co-requisites | None | | Mode of Delivery | | | Contact Hours | 14 weeks - 4 hours of lectures per week | | Lecturer | Dr. Öğr. Üyesi Halil İbrahim ŞAHİN | | Co-Lecturer | None | | Language of instruction | Turkish | | Professional practise ( internship ) | None | | | | The aim of the course: | | Course aims to introduce students to the basic data types and, calculators, role in programming and system programming to explain of data types. |
| Learning Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | LO - 1 : | learn basic data structures | 5,7,9 | 1,3,4,5, | | LO - 2 : | analyse data structures according to their performance | 5,7,9 | 1,2,4,5, | | LO - 3 : | learn basic characteristics of data structures | 6,7,9 | 1,2,4, | | LO - 4 : | learn software of data structures | 5,7,9 | 1,2,4,5, | | CTPO : Contribution to programme outcomes, TOA :Type of assessment (1: written exam, 2: Oral exam, 3: Homework assignment, 4: Laboratory exercise/exam, 5: Seminar / presentation, 6: Term paper), LO : Learning Outcome | | |
| Introduction to DataStructures, Structs, Dynamic and Static Allocation, Link List, Stacks, Queues, Trees, Binary Search Trees, Heaps and Graphs
|
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | Introduction to DataStructures, Types of DataStructures | | | Week 2 | Structs and Dynamic Memory Allocation | | | Week 3 | Link Lists and Operations | | | Week 4 | Link Lists and Operations | | | Week 5 | Stack and Queues | | | Week 6 | Stack and Queues | | | Week 7 | Stack and Queues | | | Week 8 | General Trees ,Terminology and Decision Trees
| | | Week 9 | Mid-term exam | | | Week 10 | Binary Trees and Binary Search Trees | | | Week 11 | Binary Trees and Binary Search Trees | | | Week 12 | Heaps | | | Week 13 | Graphs | | | Week 14 | Graphs | | | Week 15 | Project Controls | | | Week 16 | End-of-term exam | | | |
| 1 | Seymour Liptschutcs, ,DataStructures with C, , Mcgrawgill Schaums Series, 2011,New York | | | |
| 1 | M. Ümit Karakaş, 2000, Bilgisayar yazılımında veri yapıları ve algoritmalar, BETA, Istanbul | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Project | 14-15 | 30/12/2023 | 4 | 50 | | End-of-term exam | 16 | 12/01/2024 | 2 | 50 | | |
| Student Work Load and its Distribution | | Type of work | Duration (hours pw) | No of weeks / Number of activity | Hours in total per term | | Yüz yüze eğitim | 4 | 14 | 56 | | Sınıf dışı çalışma | 3 | 14 | 42 | | Ödev | 5 | 6 | 30 | | Dönem sonu sınavı için hazırlık | 10 | 1 | 10 | | Dönem sonu sınavı | 1 | 1 | 1 | | Total work load | | | 139 |
|