Scribd
Upload
77 views3 pages

Rajalakshmi Engineering College Department of Computer Science and Engineering

This document outlines the aims and experiments for a Data Structures lab course. The aim is to develop programming skills for designing and implementing data structures and their applications. There are 13 listed experiments covering common data structures like stacks, linked lists, trees, hashing, and graphs. The experiments will be conducted over two batches on different dates ranging from July to October.

Uploaded by

Aswini Jayaraman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
77 views3 pages

Rajalakshmi Engineering College Department of Computer Science and Engineering

This document outlines the aims and experiments for a Data Structures lab course. The aim is to develop programming skills for designing and implementing data structures and their applications. There are 13 listed experiments covering common data structures like stacks, linked lists, trees, hashing, and graphs. The experiments will be conducted over two batches on different dates ranging from July to October.

Uploaded by

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

RAJALAKSHMI ENGINEERING COLLEGE

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING


FACULTY NAME: P. REVATHY
SUB: CS 2208 -DATA STRUCTURES LAB
AIM:
To develop programming skills in design and implementation of data structures and their
applications.
LIST OF EXPERIMENTS
1. Implement stack using array.
2. Implement singly linked lists.
3. Implement doubly linked lists.
4. Represent a polynomial as a linked list and write functions for polynomial addition.
5. To convert infix to postfix expression
6. Implement an expression tree.
7. Implement a Input restricted Dequeue and Output restricted Dequeue.
8. Implement binary search tree.
9. Tree traversals
10. Implement insertion in AVL trees.
11. Implement hashing with open addressing.
12. Implement priority queue using binary heaps
13. Minimum spanning tree.

S.No.

List of Experiments

Batch1

Batch2

1.

Implement stack using array.

11/7/11

12/7/11

2.

Implement singly linked lists.

18/7/11

19/7/11

3.

Implement doubly linked lists.

25/7/11

26/7/11

4.

Polynomial addition.

1/8/11

2/8/11

5.

To convert infix to postfix expression

1/8/11

1/8/11

6.

Implement an expression tree


Repetition class

8/8/11
22/8/11

9/8/11
16/8/11

7.

23/8/11

8.
9.

Implement a Input restricted Dequeue and Output 29/8/11


restricted Dequeue
Implement binary search tree
5/9/11
Tree traversals
12/9/11

10.
11.
12.

Implement insertion in AVL trees


Implement hashing with open addressing
Implement priority queue using binary heaps

19/9/11
26/9/11
3/10/11

13/9/11
20/9/11
27/9/11

13.

Minimum Spanning tree


Model Exam

10/10/11
17/10/11

4/10/11
18/10/11

30/8/11
6/9/11

You might also like