IT2201/DATA STRUCTURES AND ALGORITHMS ANNA UNIV NOV/DEC 2012 IMPORTANT QUESTIONS


Anna University, Chennai Nov/Dec 2012 Examinations
Rejinpaul.com Important Questions
IT2201/DATA STRUCTURES AND ALGORITHMS
III Sem IT
Unit I-V

1.       What is singly linked list? Explain about various operations performed on a node from a Singly Linked list
2.      What is Stack? Give the implementations of stack
3.       Discuss the operation performed in ADT. Explain them in detail
4.      Explain operations of doubly linked list and cursor based implementation in detail
5.      Explain in detail about binary search tree with necessary operations
6.      Explain the rotations operations  done in AVL-Tree (with example)
7.       Explain the tree traversals in detail
8.      Explain in detail about ADT. Explain the operation performed
9.      Explain in detail the collision resolution methods
10.   Discuss in detail open addressing and rehashing
11.   Explain in detail about DIjkstra’s Algorithm with an example  
12.   Explain in detail about DFS and BFS Techniques with an example
13.   Explain  the Kruskal’s Algorithm with an example
14.   Explain Prim’s algorithm with example
15.   Explain in detail about Backtracking Algorithm with an example
16.   Explain in detail about Dynamic Programming with an example 
17.   Explain in detail about Divide and conquer  Algorithm with an example
18.   Write Short Notes on  (i)   Asymptotic Notations  (ii) Big O Notation  (iii) Little Omega Notations (iv)Big Theta Notation            

IT2201/DATA STRUCTURES AND ALGORITHMS ANNA UNIV NOV/DEC 2012 IMPORTANT QUESTIONS Reviewed by Rejin Paul on 10:18 PM Rating: 5

Contact Form

Name

Email *

Message *

Powered by Blogger.