Institute: Habib University
Offered in: Spring 2018
The objective of this course is to give students a programming intensive experience of commonly used data structures and algorithms to solve problems of moderate complexity. The data structures covered during the course include Stacks, Queues, Dictionaries, Trees, and Graphs. Various algorithms or algorithmic techniques are also introduced that include Searching, Sorting, Tree/Graph traversals, and Divide-and-conquer. The course also expose students to the basics of algorithmic complexity analysis and introduces O-notation and Master Theorem to assess and compare the performance of different algorithms.