Scribd
Upload
213 views

CS2208

This lab plan outlines 15 experiments to implement various data structures and algorithms over 15 weeks. The objectives are to implement abstract data types and write programs to solve problems using them. Experiments include implementing linked lists, stacks, queues, trees, hashing, and Prim's algorithm. The plan was prepared by lecturers Ms. R. Vanaja and Ms. S. Rajalakshmi and approved by the HOD Dr. Susan Elias of the Computer Science and Engineering department at Sri Venkateswara College of Engineering.

Uploaded by

Viji Raghu
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
213 views

CS2208

This lab plan outlines 15 experiments to implement various data structures and algorithms over 15 weeks. The objectives are to implement abstract data types and write programs to solve problems using them. Experiments include implementing linked lists, stacks, queues, trees, hashing, and Prim's algorithm. The plan was prepared by lecturers Ms. R. Vanaja and Ms. S. Rajalakshmi and approved by the HOD Dr. Susan Elias of the Computer Science and Engineering department at Sri Venkateswara College of Engineering.

Uploaded by

Viji Raghu
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

LP – CS2208

LAB PLAN LP Rev. No : 00


Date : 21 - 05 - 09
Sub Code & Sub Name : CS2208 DATA STRUCTURES LAB Page 01 of 02
Branch : CSE Semester :III

Objectives
• To implement the various data structures as Abstract Data Types

• To write C programs to solve problems using the ADTs

S. No. Ex. No. Experiment Time

1 Practice Exercise (C programs based on pointers) 150m

2 1 a) Implementation of Singly Linked List 150m

3 1 b) Implementation of Doubly Linked List 150m

4 2 Represent a polynomial as a linked list and write functions for 150m


polynomial addition
5 3 Implement Stack and use it to convert infix to postfix expression 150m

6 4 Implement a dequeue where insertion and deletion operations are 150m


possible at both the ends
7 5 Implement an expression tree. Produce its pre-order, in-order and 150m
post-order traversals.
8 6 Implement Binary Search Tree 150m

9 6 Implement Binary Search Tree 150m

10 Model lab Exam 150m

11 7 Implement insertion in AVL Trees 150m

12 8 Implement Priority queue using binary heaps 150m

13 9 Implement hashing with open addressing 150m


LP – CS2208
LAB PLAN LP Rev. No : 00
Date : 21 - 05 - 09
Sub Code & Sub Name : CS2208 DATA STRUCTURES LAB Page 02 of 02

Branch : CSE Semester :III

S. No. Ex. No. Experiment Time

14 10 Implement Prim’s algorithm using priority queues to find MST of 150m


an undirected graph
15 Completion class 150m

Approved by
Prepared by
Signature

Name Ms. R. Vanaja Dr.Susan Elias


Ms. S. Rajalakshmi

Designation Lecturer, CSE HOD, Department of CSE


Date 21 - 05 - 09 29 - 06 - 09
SRI VENKATESWARA COLLEGE OF ENGINEERING
SRIPERUMBUDUR

DEPARTMENT OF COMUTER SCIENCE AND


ENGINEERING

CS2208 – DATA STRUCTURES LAB

Prepared by Approved by
Signature

Name Ms. R.Vanaja Dr.Susan Elias


Ms. S.Rajalakshmi

Designation Lecturer, CSE HOD, Department of CSE

Date 29- 06 – 09 29 - 06 - 09

You might also like