Topics

The following materials will be covered in the lectures however there may some changes in the order.

· Principles of programming and Software Engineering

· Abstract Data Types (ADT’s)

· Linked Lists.

· Problem solving using Recursion.

· Stack.

· Queues.

· Algorithm Efficiency and Complexity.

· Sorting techniques.

· Binary search trees.

· Tables and Priority queues.

· Balanced Trees.

· Hashing.

· Graphs.

· External sorting methods.