Türkçe | English
OF FACULTY of TECHNOLOGY / DEPARTMENT of SOFTWARE ENGINEERING

Course Catalog
http://www.ktu.edu.tr/ofyazilim
Phone: +90 0462 3778353
OFTF
OF FACULTY of TECHNOLOGY / DEPARTMENT of SOFTWARE ENGINEERING /
Katalog Ana Sayfa
  Katalog Ana Sayfa  KTÜ Ana Sayfa   Katalog Ana Sayfa
 
 

YZM1010Data Structures2+2+0ECTS:5
Year / SemesterSpring Semester
Level of CourseFirst Cycle
Status Compulsory
DepartmentDEPARTMENT of SOFTWARE ENGINEERING
Prerequisites and co-requisitesNone
Mode of DeliveryFace to face
Contact Hours14 weeks - 2 hours of lectures and 2 hours of practicals per week
LecturerDr. Öğr. Üyesi Asuman GÜNAY YILMAZ
Co-LecturerGive information about data structures, analyse some data structures, assist on selecting the optimal data structure and introducing data structure types.
Language of instructionTurkish
Professional practise ( internship ) None
 
The aim of the course:
 
Learning OutcomesCTPOTOA
Upon successful completion of the course, the students will be able to :
LO - 1 : Define the notions of time and space complexity.4,5,121
LO - 2 : Analyze a given algorithm and determine its complexity.2,5,12,131
LO - 3 : Define abstract data structures (types) such as linked lists, stacks, queues, heaps and trees.2,3,12,131
LO - 4 : Design an algorithm to solve a given problem.2,3,4,5,12,131
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
A C++ Primer, Object-Oriented Programming, Arrays, Linked Lists, and Recursion, Analysis Tools, Stacks, Queues, and Deques, List and Iterator ADTs, Trees, Heaps and Priority Queues, Hash Tables, Maps, and Skip Lists, Search Trees, Sorting, Sets, and Selection, Strings and Dynamic Programming, Graph Algorithms, Memory Management and B-Trees.
 
Course Syllabus
 WeekSubjectRelated Notes / Files
 Week 1A C++ Primer
 Week 2Object-Oriented Programming
 Week 3Arrays, Linked Lists, and Recursion
 Week 4Analysis Tools
 Week 5Stacks, Queues, and Deques
 Week 6List and Iterator ADTs
 Week 7Trees
 Week 8Heaps and Priority Queues
 Week 9Midterm exam
 Week 10Hash Tables, Maps, and Skip Lists
 Week 11Search Trees
 Week 12Sorting, Sets, and Selection
 Week 13Strings and Dynamic Programming
 Week 14Graph Algorithms
 Week 15Memory Management and B-Trees
 Week 16End of term exam
 
Textbook / Material
1Goodrich, M. 2011; Data Structures and Algotihms in C , USA
 
Recommended Reading
 
Method of Assessment
Type of assessmentWeek NoDate

Duration (hours)Weight (%)
Mid-term exam 9 05/04/2014 1 50
End-of-term exam 16 26/05/2014 1 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
Arasınav için hazırlık 1 7 7
Arasınav 1 1 1
Dönem sonu sınavı için hazırlık 3 6 18
Dönem sonu sınavı 1 1 1
Total work load125