Scribd
Upload
71 views

DSA Lab

The document contains details of an examination for the subject "Data Structures & Algorithms Lab" conducted at C.Abdul Hakeem College of Engineering & Technology. It lists 15 university lab questions covering topics like linked lists, polynomials, stacks, queues, trees, graphs and algorithms. It also provides the marking scheme and internal/external examiner details.

Uploaded by

Priya Gayathri
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
71 views

DSA Lab

The document contains details of an examination for the subject "Data Structures & Algorithms Lab" conducted at C.Abdul Hakeem College of Engineering & Technology. It lists 15 university lab questions covering topics like linked lists, polynomials, stacks, queues, trees, graphs and algorithms. It also provides the marking scheme and internal/external examiner details.

Uploaded by

Priya Gayathri
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

ANNA UNIVERSITY

Practical Examination April 2013

Centre : C.Abdul Hakeem College of Engg. & Tech

College Code: 5106

Branch : Electrical and Electronics Engg.

Semester

Subject Name: Data Structures & Algorithms Lab

Subject Code: EE2209

: III

Date : 23/04/2013

University Lab Questions


1. To implement singly and doubly linked lists.
2. To represent a polynomial as a linked list and write functions for polynomial
addition.
3. To implement stack and use it to convert infix to postfix expression
4. To implement array-based circular queue and use it to simulate a producerconsumer problem.
5. To implement an expression tree. Produce its pre-order, in-order, and post-order
traversals.
6. To implement binary search tree.
7. To implement insertion in AVL trees.
8. To implement priority queue using heaps
9. To implement hashing techniques.
10. To perform topological sort on a directed graph to decide if it is acyclic.
11. To implement Dijkstra's algorithm using priority queues
12. To implement Prim's and Kruskal's algorithms
13. To implement a backtracking algorithm for Knapsack problem
14. To implement a branch and bound algorithm for traveling salesperson problem
15. To implement any randomized algorithm.

Internal Examiner

External Examiner
iner

ANNA UNIVERSITY
Practical Examinations April 2013

Centre : C.Abdul Hakeem College of Engg. & Tech

College Code: 5106

Branch : Electrical and Electronics Engg.

emester

Subject Name: Data Structures & Algorithms Lab

: III

Subject Code: EE2209

Date : 23/04/2013

Mark Allocation

Section

Internal Examiner

Marks

Aim

Algorithm

20

Program

35

Output

25

Result

Viva voce

10

Total

100

External Examiner

1. Write a C program to represent a polynomial as a linked list and write functions


for polynomial addition.
Write a C program to implement any randomized algorithm.

2. Write a C program to implement binary search tree and perform node creation,
insertion, deletion, display operations.

3. Write a C program to implement array-based circular queue and use it to simulate


a producer-consumer problem.
Write a C program to implement hashing techniques.

4. Write a C to implement priority queue using heaps.


Write a C to implement stack and use it to convert infix to postfix expression

5. Write a C to implement singly linked list. Perform node creation, insertion,


deletion operation.

You might also like