UNIVERSITY OF MADRAS
B.Sc. DEGREE COURSE IN SOFTWARE ENGINEERING
SEMESTER SYSTEM WITH CREDITS
(Effective from the Academic Year 2003-2004)

SYLLABUS

Semester IV - BSE 210 - Practical III - Data Structures Using C++

Lecture Per Week: 6 hrs
Duration of Examination: 3 hrs
Maximum Marks: 100
Credits: 4

1. Implements PUSH, POP operations of stack using arrays.
2. Implements PUSH, POP operations of stack using pointers.
3. Implement add, delete operations of a queue using arrays.
4. Implement add, delete operations of queue using pointers.
5. Conversion of infix to postfix using stack operations.
6. Posffix expression evaluation.
7. Addition of two polynomials using Arrays and Pointers.
8. Polynomial multiplication using singly linked list.
9. Creation, Insertion and deletion in doubly linked list.
10. Binary tree traversals (inorder, preorder and post order) using linked list and recursion.
11. Non-recursive inorder traversal.
12. Non-recursive preorder traversal.
13. Non-recursive postorder traversal.
14. Depth first search for graphs using recursion
15. Breadth first search for graphs.