Course Content

Duration:   14 weeks x 2h/week Period:      March-May

Course Syllabus   CHAPTER 1 - Data types and data structures 1.1 Data types 1.2 Abstract data types 1.3 Data structures 1.4 Linked lists, stacks, and queues   CHAPTER 2 - Recursive algorithms 2.1 Recursion 2.2 Building recursive algorithms and functions 2.3 Lexical and syntactic analysis   CHAPTER 3 - Computational complexity 3.1 Time and space complexity 3.2 Worst-case analysis 3.3 P-complete and NP-complete problems   CHAPTER 4 - Sorting algorithms 4.1 Selection sort 4.2 Insertion sort 4.3 Quicksort 4.4 Mergesort   CHAPTER 5 - Searching algorithms 5.1 Binary search 5.2 Trees and binary trees 5.3 Binary search trees   CHAPTER 6 - Backtracking algorithms 5.1 Problem solving by backtracking 5.2 Exemplary problems Prerequisite:   Course UPB.12.T.01.O.001.EE