II Year B.Tech. CSE /IT - I Sem ADVANCED DATA STRUCTURES LAB
Objectives:
- 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
Week1 :
C++ programs to implement the following using an array.
a) Stack ADT b) Queue ADT
Week2 :
Write C++ programs to implement the following using a singly linked list.
a) Stack ADT b) Queue ADT
Week3 :
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.
Week5 :
.Write C++ programs that use non-recursive functions to traverse the given
binary tree in
a) Preorder b) inorder and c) postorder.
Week6 :
Write C++ programs for the implementation of bfs and dfs for a given graph.
Week7 :
Write C++ programs for implementing the following sorting methods:
a) Merge sort b) Heap sort
Week8 :
Write a C++ program to perform the following operations
a) Insertion into a B-tree b) Deletion from a B-tree
Week9 :
.Write a C++ program to perform the following operations
a) Insertion into an AVL-tree b) Deletion from an AVL-tree
Week10 :
Write a C++ program to implement all the functions of a dictionary (ADT)
using hashing.
Week11 :
Write a C++ program for implementing Knuth-Morris- Pratt pattern matching
algorithm.
Week12 :
Write a C++ program for implementing Boyer – Moore Patten matching
algorithm
(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
wat hap wen u release 2nd year results