The aim of this course is to provide students with knowledge and abilities to design, analyze and implement basic data structures.
Classification of data structures, introduction to algorithms and their complexity, fundamental structures such as lists, stacks, queues, trees, graphs, heaps and their variations, analysis of important sorting algorithms, emphasis on writing and running programs using dynamic memory allocation, practice exercises in lab sessions, term project.
1: Lecture, 2: Question-Answer, 3: Lab, 4: Case-study
Course Evaluation Methods:
A: Testing, B: Experiment, C: Homework, D: Project