LAB PLAN

LP-IT2205
Revision No: 00

Sub Code & Sub Name : IT2205 Data Structures &

Algorithms Laboratory

Date: 26.06.09
Page 01 of

Banch: IT

01

Semester: III

Objective:
The Objective of these practical sessions is to gain knowledge about Stack, Queue and
List ADTs, Binary Search Trees and design techniques.
Session
No
1

Exercise
Exercise
No
1
Implementation of Singly Linked List

Time Allocation
150m

Implementation of Doubly Linked List

a.
b.

150m

Implementation of polynomial addition using

Linked List
Implementation of polynomial multiplication
using Linked List

150m

a.
b.

Implementation of stack using linked list

Conversion of Infix to Postfix expression

150m

a.

Implementation of circular queues using

arrays
Simulation of Producer Consumer problem
using queues

150m

b.
6

Implementation of an expression tree. Produce its

pre-order, in-order, and post-order traversals

150m

Implementation of binary search tree

150m

Implementation of Priority Queues using heaps

150m

Implementation of Hashing Techniques

150m

10

10

Implementation of dijkstras algorithm to find the

shortest path from a given source to
desitination in a directed graph

150m

11

11

Implementation of Knapsack Problem

150m

Model exam

150m

12

Prepared by

Approved by

Signature
Name

N.Devi SL/IT
R.Dhanalakshmi L/IT

Prof. G.Sumathi
HOD/IT

Date

26.06.09

26.06.09