X hits on this document

122 views

0 shares

0 downloads

0 comments

31 / 32

210255: Data Structures Laboratory

Teaching SchemeExamination Scheme

Practical: 4 hrs/weekPractical: 50 marks

Term Work: 50 marks

Suggested List of Assignments

1.

Write a menu driven program to perform following operations on singly linked list: Create, Insert, Delete, Display, Reverse

2.

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.).

3.

Represent polynomial as a circular linked list and write a menu driven program to perform addition, multiplication and evaluation.

4.

Write a program to create generalized linked list and perform following operations: copy, depth, equivalence

5.

Implement circular queue and double ended queue using linked representation

6.

Create binary tree and perform recursive and non-recursive traversals

7.

Create binary tree. Find height of the tree and print leaf nodes. Find mirror image, print original and mirror image using level-wise printing

8.

Create in-order threaded binary tree and perform traversals

9.

Represent graph using adjacency list and perform DFS and BFS

10.

Represent graph using adjacency list or matrix and generate minimum spanning tree using Prim’s algorithm

11.

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. Use command line arguments.

12.

Write a C++ program to implement a small database mini project to understand persistent objects and operations on sequential files (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

a.

To display entire passenger list

b.

To display particular record

c.

To update record

d.

To delete and sort record

Use Exception Handling for data verification

13.

Implement simple index file

14.

Implement direct access file. Collision handling to be done by chaining with and/or without replacement

15.

Write a program to perform insertion and deletion of a node in a B+ tree.

16.

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)

17.

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.

18.

Write a program to add binary numbers (assume one bit as one number) Use STL stack.

19.

Implement Dqueue (Double ended queue) using STL.

Document info
Document views122
Page views127
Page last viewedSat Dec 10 05:37:24 UTC 2016
Pages32
Paragraphs1002
Words9463

Comments