• Asymptotic performance of algorithms.

• Linear data structures and their applications such as stacks, queues and lists.

• Non-Linear data structures and their applications such as trees and graphs.

• Sorting and searching algorithms.

At the end of the course the student will be able to:

• Analyze and Compare various linear and non-linear data structures.

• Code, debug and demonstrate the working nature of different types of data structures and their applications.

• Implement, analyze and evaluate the searching and sorting algorithms.

• Choose the appropriate data structure for solving real world problems.