Data Structures and Algorithms - Important Questions - Anna University

Unit-I

• Analysis of Algorithm
• Asymptotic Notation

Unit-II

• Array and Structures
• Stack (Definition,Representation,Operation,Example,Application)
• Queue (Definition,Representation,Operation,Example,Application)
• Linke list (Definition,Representation,Operation,Example,Application)

Unit - III

• Binary Tree and Tree Traversal
• Binary Tree Representation - Internal and External Nodes, Array representation
• Huffman Algorithm
• Binary Search Tree
• Hashing
• Heap Sort

Unit - IV

• Representation of Graph (DFS, BFS) - Graph Traversal
• Warshall's Algorithm
• Shortest path Algorithm [Flow Problem]
• Dijikstra's Algorithm
• Kruskal and Prim's Algorithm (MST)

Unit - V

• Linked List
• Automatic List Management
• Reference count method
• Garbage Collections

Abbreviation

• DFS - Depth First Search
• BFS - Breadth First Search
• MST - Minimal Spaning Tree
• BST - Binary Search Tree

Get Related News: Anna University, Exam Questions, Interview Questions, Tutorials