|
|
| 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 | Face to face, Lab work , Practical | | Contact Hours | 14 weeks - 4 hours of lectures per week | | Lecturer | Prof. Dr. Türkan ERBAY DALKILIÇ | | 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 | 3,4,5,6,7,8,9,11 | 1,3 | | LO - 2 : | analyse data structures according to their performance | 5,6,7,8,9,10,11 | 1,3 | | LO - 3 : | learn basic characteristics of data structures | 3,4,5,6,7,8,9,10,11 | 1,3 | | LO - 4 : | learn software of data structures | 3,4,5,6,7,8,9,10,11 | 1,3 | | 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 | | |
| Recursive algorithms, recursive relations, introduction to the concept of algorithm analysis. Multidimensional/triangular/band/sparse matrix representations. Stack and queue data structures, prefix/infix/postfix expressions. Single/double (circular) linked lists. Binary tree, binary search tree, recursive and iterative binary tree traversals, generalized lists, guided binary trees. Heaps, priority queues, data structures for disjoint sets. Selection, insertion, bubble, counting, quick, merge, heap, radix sorting algorithms and their analysis. AVL trees. |
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | An Introduction to Collections, Generics, and the Timing Class | | | Week 2 | Arrays and ArrayLists | | | Week 3 | Basic Sorting Algorithms | | | Week 4 | Basic Searching Algorithms | | | Week 5 | Stack and Queues | | | Week 6 | The BitArray Class | | | Week 7 | Strings, the String Class, and the StringBuilder Class | | | Week 8 | Pattern Matching and Text Processing
| | | Week 9 | Mid-term exam | | | Week 10 | Building Dictionaries: The DictionaryBase Class and the SortedList Class | | | Week 11 | Hashing and the Hashtable Class | | | Week 12 | Linked Lists | | | Week 13 | Binary Trees and Binary Search Trees | | | Week 14 | Sets | | | Week 15 | Advanced Data Structures and Algorithms for Searching | | | Week 16 | End-of-term exam | | | |
| 1 | Michael McMillan, 2007, Data Structures and Algorithms Using CSHARP,Cambridge University Press | | | |
| 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 | 30/12/2019 | 2 | 50 | | End-of-term exam | 16 | 02/01/2020 | 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 |
|