Pointers, Dynamic Arrays, Lists, Stack and Queues, Trees, Recursive, Search Methods, Sort Methods, and Algorithms Analysis.
Contact hours:
Four hours lecture and two hours lab per week.Assessment:
Three to four assignments (20%), two tests (20%), final exam (60%).Prerequisite: 1.20822
Text:
Sedgewick, R., 1992, Algorithms in C++, Addison-Wesley, New York