Türkçe | English
FACULTY of SCIENCE / DEPARTMENT of STATISTICS and COMPUTER SCIENCES

Course Catalog
http://www.ktu.edu.tr/isbb
Phone: +90 0462 +90 (462) 3773112
FENF
FACULTY of SCIENCE / DEPARTMENT of STATISTICS and COMPUTER SCIENCES /
Katalog Ana Sayfa
  Katalog Ana Sayfa  KTÜ Ana Sayfa   Katalog Ana Sayfa
 
 

IST3015Data Structures4+0+0ECTS:6
Year / SemesterFall Semester
Level of CourseFirst Cycle
Status Elective
DepartmentDEPARTMENT of STATISTICS and COMPUTER SCIENCES
Prerequisites and co-requisitesNone
Mode of DeliveryFace to face, Group study, Lab work
Contact Hours14 weeks - 4 hours of lectures per week
LecturerProf. Dr. Türkan ERBAY DALKILIÇ
Co-LecturerNone
Language of instructionTurkish
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 OutcomesCTPOTOA
Upon successful completion of the course, the students will be able to :
LO - 1 : learn basic data structures3,4,5,6,7,8,9,111,3
LO - 2 : analyse data structures according to their performance5,6,7,8,9,10,111,3
LO - 3 : learn basic characteristics of data structures3,4,5,6,7,8,9,10,111,3
LO - 4 : learn software of data structures3,4,5,6,7,8,9,10,111,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

 
Contents of the Course
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
 WeekSubjectRelated Notes / Files
 Week 1An Introduction to Collections, Generics, and the Timing Class
 Week 2Arrays and ArrayLists
 Week 3Basic Sorting Algorithms
 Week 4Basic Searching Algorithms
 Week 5Stack and Queues
 Week 6The BitArray Class
 Week 7Strings, the String Class, and the StringBuilder Class
 Week 8Pattern Matching and Text Processing
 Week 9Mid-term exam
 Week 10Building Dictionaries: The DictionaryBase Class and the SortedList Class
 Week 11Hashing and the Hashtable Class
 Week 12Linked Lists
 Week 13Binary Trees and Binary Search Trees
 Week 14Sets
 Week 15Advanced Data Structures and Algorithms for Searching
 Week 16End-of-term exam
 
Textbook / Material
1Michael McMillan, 2007, Data Structures and Algorithms Using CSHARP,Cambridge University Press
 
Recommended Reading
1M. Ümit Karakaş, 2000, Bilgisayar yazılımında veri yapıları ve algoritmalar, BETA, Istanbul
 
Method of Assessment
Type of assessmentWeek NoDate

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 workDuration (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 load139