JNTU Advance Data Structure Lab Syllabus
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY
II Year B.Tech. CSE – I Sem T P C
0 3 2
ADVANCED DATA STRUCTURES LAB
To make the student learn a object oriented way of solving problems.
To make the student write ADTS for all data structures.
Recommended Systems/Software Requirements:
Intel based desktop PC with minimum of 166 MHZ or faster processor with atleast 64 MB RAM and 100 MB free disk space
C++ compiler and STL Recommended
C++ programs to implement the following using an array.
a) Stack ADT b) Queue ADT
Write C++ programs to implement the following using a singly linked list.
Stack ADT b) Queue ADT
Write C++ programs to implement the deque (double ended queue) ADT using a doubly linked list and an array.
Week 4 :
Write a C++ program to perform the following operations:
a) Insert an element into a binary search tree.
b) Delete an element from a binary search tree.
c) Search for a key element in a binary search tree.
.Write C++ programs that use non-recursive functions to traverse the given
binary tree in
a) Preorder b) inorder and c) postorder.
Write C++ programs for the implementation of bfs and dfs for a given graph.
Write C++ programs for implementing the following sorting methods:
Merge sort b) Heap sort
Write a C++ program to perform the following operations
Insertion into a B-tree b) Deletion from a B-tree
.Write a C++ program to perform the following operations
Insertion into an AVL-tree b) Deletion from an AVL-tree
Write a C++ program to implement all the functions of a dictionary (ADT)
Write a C++ program for implementing Knuth-Morris- Pratt pattern matching
Write a C++ program for implementing Boyer – Moore Patten matching
(Note: Use Class Templates in the above Programs)
TEXT BOOKS :
1. Data Structures and Algorithms in C++, Third Edition, Adam Drozdek, Thomson.
2.Data Structures using C++, D.S. Malik, Thomson