Anna University, Chennai Nov/Dec 2012
Examinations Important Questions
Subject
code & Name: EE2204 DATA STRUCTURES & ALGORITHMS
Year/Sem
: II/III
Department
of EEE
Unit I - V
1.
Explain the implementation of stack using Linked List.
2.
Explain Prefix, Infix and postfix expressions with example.
3.
Explain the operations and the implementation of list ADT.
4.
Explain the operation and implementation of Binary Heap.
5.
Explain the implementation of different Hashing techniques.
6.
Explain in detail insertion into AVL Trees
7.
Explain Prim’s & Kruskal‘s Algorithm with an example.
8.
Describe Dijkstra’s algorithm with an example
9.
Explain how to find shortest path using Dijkstra’s algorithm with an example.
10.
Explain the application of DFS.
11.
Find a minimum spanning tree for the graph using both Prim’s and Kruskal’s
algorithms.
12.
Explain in detail the simple topological sort pseudo code
13.
Explain in detail about Greedy algorithm with an example
14.
Describe the backtracking problem using knapsack problem