Scribd
Upload
69 views2 pages

Laboratory Plan - DS

The document outlines a laboratory plan for a Data Structures Lab course. The course aims to develop students' abilities in implementing various data structures and algorithms, including stacks, trees, graphs, hashing, and dictionaries. The plan lists 15 assignments over 15 weeks covering topics like tree and graph traversals, binary search trees, heaps, hashing techniques, and shortest path algorithms. It also includes two mock tests and a final mini project.

Uploaded by

KARANAM SANTOSH
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
69 views2 pages

Laboratory Plan - DS

The document outlines a laboratory plan for a Data Structures Lab course. The course aims to develop students' abilities in implementing various data structures and algorithms, including stacks, trees, graphs, hashing, and dictionaries. The plan lists 15 assignments over 15 weeks covering topics like tree and graph traversals, binary search trees, heaps, hashing techniques, and shortest path algorithms. It also includes two mock tests and a final mini project.

Uploaded by

KARANAM SANTOSH
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Laboratory plan

A53230-Data Structures Lab


Course Outcomes
At the end of this Data Structures Lab course, students will be able to:
1. Develop the programs on stacks and its applications
2. Demonstrate the operations on Trees
3. Code the implementation of various advanced trees
4. Design and implementation of programs on BST and Graph Traversals
5. Develop the programs on Hashing and Dictionaries

S.No Assignment CO Week


Review of Stack and Queue Operations using arrays
1 CO1 1+1/2
and Linked Lists
Program to convert infix to postfix notation
2 CO1 1
Program to evaluate postfix notations

Program to implement towers of Hanoi


3 CO1 1
Program to implement parenthesis checker

Program to illustrate tree traversals


4 CO2 1
a) In order b) Preorder c) Post order
Program to illustrate insertion, deletion and
5 CO3 1
searching in Binary Search Tree
Program to implement Heaps
6 CO2 1
a) Min Heap b) Max Heap
Program to illustrate Insertion on AVL Trees
7 Program to illustrate deletion and Rotation on AVL CO3 1+1/2
Trees
9 Mock1   1

Program to implement B-Trees


8 CO3 1
a) Insertion b) Search c) Display
Program to illustrate Graph traversals a) Breadth
9 CO4 1
First Search b) Depth First Search
Program to implement
10 CO4 1+1/2
a) Prim’s algorithm b) Kruskal’s algorithm

11 Program to Implement Dijkstra algorithm CO5 1


Program to implement Hashing and collision
12 CO5 1+1/2
resolution techniques
13 Program to implement Dictionaries CO5 1

14 Mock2   1

15 Mini project demonstration and submission   1

Course Chairperson HOD, Dept. of IT.

You might also like