EE 2204 Data Structures and Algorithms 16 Marks Questions - Anna University EEE 3rd Semester dsa Questions

EE 2204 Data Structures and Algorithms 16 Marks Questions - Anna University EEE 3rd Semester dsa Questions

Anna University

Department of Electrical and Electronics Engineering

EE 2204 Data Structures and Algorithms

3rd Semester

Regulation 2008

1 . Explain linked List ADT .
2 . Explain doubly linked list ADT .
3 . Explain circular queue ADT .
4 . Explain array implementation of stack.
5. Explain Linked List Implementation o f Stack.
6. Explain Linked List Implementation o f Queue.
7. Explain Array implementation o f Queue.
8. Explain a pplications of Stack.

Unit II

1. Briefly explain the binary tree ADT and write the routines
2. Briefly explain the binary search tree ADT and write the routines
3. Briefly explain the tree traversal with algorithms.
4. How to construct the expression tree with example.
5. List the application of trees.

Unit III

1. Convert postfix expression into expression tree.
2 . Explain Hashing .
3 . Explain AVL rotation .
4. Explain Binary heap and basic operations of heap with procedure.
5. Explain the operations of B-Tree w it h examples.

Unit IV

1. Explain Graph representation, application in detail.
2. Explain Topological sort in detail.
3. Explain the method to find the shortest path in an unweighted graph with a pseudocde and an example.
4. Explain the graph traversal in details.
5. Explain Dijkstra’s algorithm to find the shortest path in a weighted graph with example.
6. Explain Prim’s algorithm to find MST of a graph with example.

Unit V

1. Explain NP completeness in detail.
2. Explain analysis of algorithms.
3. Explain greedy algorithm with example.
4. Explain dynamic programming in detail.
5. What is the use of randomized algorithm? Explain minimum cut algorithm in detail.
6. Explain divide and conquer algorithm in detail.