IT2205 DATA STRUCTURES AND ALGORITHMS LAB SYLLABUS | ANNA UNIVERSITY BTECH IT 3RD SEMESTER SYLLABUS REGULATION 2008 2011-2012 BELOW IS THE ANNA UNIVERSITY THIRD SEMESTER BTECH INFORMATION TECHNOLOGY DEPARTMENT SYLLABUS IT IS APPLICABLE FOR ALL STUDENTS ADMITTED IN THE YEAR 2011-2012 (ANNA UNIVERSITY CHENNAI,TRICHY,MADURAI,TIRUNELVELI,COIMBATORE), 2008 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2009
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 array-based circular queue and use it to simulate a producerconsumer
problem.
5. Implement an expression tree. Produce its pre-order, in-order, and post-order
traversals.
6. Implement binary search tree.
7. Implement priority queue using heaps
8. Implement hashing techniques.
9. Implement Dijkstra's algorithm using priority queues
10. Implement a backtracking algorithm for Knapsack problem
TOTAL: 45PERIODS
List of Equipments and components for A Batch of 30 students (1 per batch)
1. SOFTWARE REQUIRED – TURBOC version 3 or GCC version UNIT
IIIUNIT III4.
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)
No comments:
Post a Comment
Any doubt ??? Just throw it Here...