210255: Data Structures Laboratory
Teaching SchemeExamination Scheme
Practical: 4 hrs/weekPractical: 50 marks
Term Work: 50 marks
Suggested List of Assignments
Write a menu driven program to perform following operations on singly linked list: Create, Insert, Delete, Display, Reverse
Create two doubly linked lists. Sort them after creation. Merge these two lists into one list so that the merged list is in sorted order. (No new node should be created.).
Represent polynomial as a circular linked list and write a menu driven program to perform addition, multiplication and evaluation.
Write a program to create generalized linked list and perform following operations: copy, depth, equivalence
Implement circular queue and double ended queue using linked representation
Create binary tree and perform recursive and non-recursive traversals
Create binary tree. Find height of the tree and print leaf nodes. Find mirror image, print original and mirror image using level-wise printing
Create in-order threaded binary tree and perform traversals
Represent graph using adjacency list and perform DFS and BFS
Represent graph using adjacency list or matrix and generate minimum spanning tree using Prim’s algorithm
Write a C++ program to create a text file, read it and compute frequency of vowels, count words, characters, lines and white space characters and write these results into another text file. .
Write a C++ program to implement a small database to understand persistent objects and operations on (eg library information, inventory systems, automated banking system, reservation systems etc.) For example, Write a program to create a database for reservation system using information such as Name, sex, age, starting place of journey and destination. Program should have following facilities
To display entire passenger list
To display particular record
To update record
To delete and sort record
Use for data verification
Implement simple index file
Implement direct access file. Collision handling to be done by chaining with and/or without replacement
Write a program to perform insertion and deletion of a node in a B+ tree.
Use STL for Sorting and searching with user-defined records such as Person Record (Name, birth date, telephone no), item record (item code, item name, quantity and cost)
Write a program that reads name, total marks for two divisions (A and B) from two text file and stores them in two corresponding STL list containers. Sort each list and thereafter merge into a third list container. Sorting and merging must be done using STL sort and merge.
Write a program to add binary numbers (assume one bit as one number) Use STL stack.
Implement Dqueue (Double ended queue) using STL.