Introduction – Arrays – Structures – Stack: Definition and examples, Representing Stacks - Queues and lists: Queue and its Representation, lists – Applications of Stack, Queue and Linked Lists.

Binary Trees – Operations on binary trees - Binary Tree Representations – node representation, internal and external nodes, implicit array representation – Binary tree Traversals - Huffman Algorithm – Representing Lists as Binary Trees

General Background – Exchange sorts – Selection and Tree Sorting – Insertion Sorts – Merge and Radix Sorts – Basic Search Techniques – Tree Searching – General Search Trees – Hashing

Fundamentals of the analysis of algorithm efficiency - Asymptotic notations - Greedy method – Prim’s algorithm – Kruskal’s algorithm – Dijkstra’s algorithm – Backtracking: N-Queens problem

P & NP problems – NP-complete problems – Approximation algorithms for NP-hard problems – Traveling salesman problem – Knapsack problem