Data Structure and Algorithms

Course Description

Course Objectives

Course Contents

Laboratory Works

1. 1.Write a program to implement array as an ADT.
2. 2.Writing programs to implement stack operations
3. 3.Writing programs using stack to convert infix expression to postfix/prefix expression
4. 4.Write a program to evaluate postfix expression using stack
5. 5.Writing programs to implement primitive operation in linear and circular queue.
6. 6.Writing recursive programs to implement factorial, Fibonacci sequence, GCD, and Tower of Hanoi algorithms
7. 7.Writing programs with dynamic memory allocation and de-allocation
8. 8.Writing programs for operation of linear linked list
9. 9.Linked list implementation of stack and queue
10. 10.Writing programs to implement Binary Search Trees basic operations
11. 11.Writing programs to implement sorting algorithms; bubble, insertion, selection, merge and quick sort
12. 12.Writing programs to implement: sequential, binary search and hashing
13. 13.Writing programs to implement searching, spanning tree and shortest path algorithms in graph

Text Books

1. 1.Data structure using C and C++, Langsam, Augenstein, Tenenbaum

Reference Books

1. 1.Horowitz and Sahni, Fundamentals of Data Structures
2. 2.Aho, Hopcroft and Ullman, Data Structure and Algorithms