ANNA UNIVERSITY : CHENNAI 600 025 B.E.DEGREE PRACTICAL EXAMINATIONS OCT/NOV 2012.

. EC 2209-DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING LAB B.E ELECTRONICS AND COMMUNICATION ENGINEERING III SEMESTER Regulations - 2008 Time: 3 Hours 1 Maximum Marks: 100

a. Develop a C++program for implementing a singly linked list data structure. 90 Perform the following operations: i. ii. Insert a node Delete a node 10

b. Viva- Voce 2

a. Develop a C++ program for implementing a circular linked list data structure. 90 Perform the following operations: i. ii. Insert a node Delete a node 10

b. Viva- Voce 3

a. Develop a C++ program for implementing linear search on an array of N 45 numbers. b. Develop a C+ program to sort an array of N numbers using bubble sort. c. Viva- Voce 45 10 45

a. Develop a C++ program for implementing binary search on a sorted array of N numbers. b. Develop a C+ program to sort an array of N numbers using bubble sort. c. Viva- Voce

45 10

a. Develop a C++ program for array implementation of a list ADT. Illustrate the operations that can be performed on the same. b. Viva- Voce

90

10 90 10 90 10 90 10 90

a. Develop a C++ program for linked list implementation of a list ADT. Illustrate the operations that can be performed on the same. b. Viva- Voce

a. Develop a C++ program for cursor implementation of a list ADT. Illustrate the operations that can be performed on the same. b. Viva- Voce

a. Develop a C++ program for linked list implementation of a Stack ADT. Illustrate the operations that can be performed on the same. b. Viva- Voce

a. Develop a C++ program for array implementation of a Stack ADT. Illustrate the operations that can be performed on the same.

b. Viva- Voce 10 a. Develop a C++ program for linked list implementation of a Queue ADT. Illustrate the operations that can be performed on the same. b. Viva- Voce 11 a. Develop a C++ program for array implementation of a Queue ADT. Illustrate the operations that can be performed on the same. b. Viva- Voce 12 a. Develop a C++ program for implementing a binary tree data structure and perform inorder, preorder and postorder traversal.

10

90 10 90 10 90

b. Viva- Voce

10

13

a. Develop a C++ program for implementing a binary search tree data structure and perform inorder, preorder and postorder traversal. b. Viva- Voce a. Develop a C++ program for constructing a binary search tree and implement insert and delete operations. b. Viva- Voce a. Develop a C++ program to perform Heap Sort on an array of N numbers.

90

10 90 10 90 10 90 10

14

15 b. Viva- Voce 16 a. Develop a C++ program to perform Quick Sort on an array of N numbers. b. Viva- Voce

17

a. Develop a C++ program for checking balanced parenthesis using linked list implementation of a Stack ADT. b. Viva- Voce

90

10 a. Develop a C++ program for checking balanced parenthesis using array implementation of a Stack ADT. b. Viva- Voce 19 a. Develop a C++ program for evaluating postfix expression using linked list implementation of a Stack ADT. 90

18

10

90 10

b. Viva- Voce a. Develop a C++ program for evaluating postfix expression using array 20 implementation of a Stack ADT. b. Viva- Voce

90 10