YCS927 DATA STRUCTURES LAB SYLLABUS | ANNA UNIVERSITY BCA 2nd SEMESTER SYLLABUS REGULATION 2010 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY SECOND SEMESTER BCA BACHELOR OF COMPUTER APPLICATIONS DEPARTMENT SYLLABUS, TEXTBOOKS, REFERENCE BOOKS,EXAM PORTIONS,QUESTION BANK,PREVIOUS YEAR QUESTION PAPERS,MODEL QUESTION PAPERS, CLASS NOTES, IMPORTANT 2 MARKS, 8 MARKS, 16 MARKS TOPICS. IT IS APPLICABLE FOR ALL STUDENTS ADMITTED IN THE YEAR 2011 2012-2013 (ANNA UNIVERSITY CHENNAI,TRICHY,MADURAI,TIRUNELVELI,COIMBATORE), 2010 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2010
Lab manual
YCS927 DATA STRUCTURES LABORATORY L T P C
0 0 3 2
LIST OF EXERCISES
Implement the following exercises using C:
1. Array implementation of List Abstract Data Type (ADT)
2. Linked list implementation of List ADT
3. Cursor implementation of List ADT
4. Array implementations of Stack ADT
5. Linked list implementations of Stack ADT
The following three exercises are to be done by implementing the following source files
(a) Program for ‘Balanced Paranthesis’
(b) Array implementation of Stack ADT
(c) Linked list implementation of Stack ADT
(d) Program for ‘Evaluating Postfix Expressions’
An appropriate header file for the Stack ADT should be #included in (a) and (d)
6. Implement the application for checking ‘Balanced Paranthesis’ using array
implementation of Stack ADT (by implementing files (a) and (b) given above)
7. Implement the application for checking ‘Balanced Paranthesis’ using linked list
implementation of Stack ADT (by using file (a) from experiment 6 and implementing file
(c))
8. Implement the application for ‘Evaluating Postfix Expressions’ using array and linked list
implementations of Stack ADT (by implementing file (d) and using file (b), and then by
using files (d) and (c))
9. Queues ADT
10. Search Tree ADT - Binary Search Tree
TOTAL: 45 PERIODS
Lab manual
YCS927 DATA STRUCTURES LABORATORY L T P C
0 0 3 2
LIST OF EXERCISES
Implement the following exercises using C:
1. Array implementation of List Abstract Data Type (ADT)
2. Linked list implementation of List ADT
3. Cursor implementation of List ADT
4. Array implementations of Stack ADT
5. Linked list implementations of Stack ADT
The following three exercises are to be done by implementing the following source files
(a) Program for ‘Balanced Paranthesis’
(b) Array implementation of Stack ADT
(c) Linked list implementation of Stack ADT
(d) Program for ‘Evaluating Postfix Expressions’
An appropriate header file for the Stack ADT should be #included in (a) and (d)
6. Implement the application for checking ‘Balanced Paranthesis’ using array
implementation of Stack ADT (by implementing files (a) and (b) given above)
7. Implement the application for checking ‘Balanced Paranthesis’ using linked list
implementation of Stack ADT (by using file (a) from experiment 6 and implementing file
(c))
8. Implement the application for ‘Evaluating Postfix Expressions’ using array and linked list
implementations of Stack ADT (by implementing file (d) and using file (b), and then by
using files (d) and (c))
9. Queues ADT
10. Search Tree ADT - Binary Search Tree
TOTAL: 45 PERIODS
No comments:
Post a Comment
Any doubt ??? Just throw it Here...