CS2208-DATA STRUCTURES LAB-ANNA UNIVERSITY SYLLABUS for CSE
CS 2208 DATA STRUCTURES LAB L T P C
0 0 3 2
AIM:
To develop programming skills in design and implementation of data structures and their applications.
1. Implement singly and doubly linked lists.
2. Represent
a
polynomial as
a
linked
list and
write
functions
for
polynomial
addition.
3. Implement stack and use it to convert infix to postfix expression
4. Implement a double-ended queue (dequeue) where insertion and deletion
operations are possible at both the ends.
5. Implement an expression tree. Produce its pre-order, in-order, and post-
order traversals.
6. Implement binary search tree.
7. Implement insertion in AVL trees.
8. Implement priority queue using binary heaps
9. Implement hashing with open addressing.
10. Implement Prim's algorithm using priority queues to find MST of an
undirected graph.
TOTAL: 45 PERIODS
List of Equipments and components for A Batch of
30
students (1 per batch)
1.
|
SOFTWARE REQUIRED
|
– TURBOC version 3 or GCC version 3.3.4.
|
2.
|
OPERATING SYSTEM
|
– WINDOWS 2000 / XP / NT OR LINUX
|
3.
|
COMPUTERS REQUIRED
|
– 30 Nos.
(Minimum Requirement : Pentium III or
|
Pentium IV with 256 RAM and 40 GB harddisk)
0 comments:
Post a Comment