Data Structure - Trees, Binary Trees and Binary Search Trees

Download Link: Click Here to Download

Data Structure - AVL Tree Part 2 - AVL Rotation

Download Link: Click Here to Download

Data Structure - AVL Tree - Part 1

Download Link:Click Here to Download

Data Structure - Abstract Data Type

Download Link : Click Here to Download

Data Structure and Algorithm - Lab Manual- Updated Edition 1.0 - 2011

Whats New ?

• Binary Search Tree Program and Output Replaced.
• Algorithm changed form some Programs.
• Known certain programs error Fixed.

Download : Click Here to Download

Data Structure and Algorithm Two Marks with solution (All Units)

Thanks to :
                   Mrs.N.Amsaveni
                   Dept of CSE
                  Shri Andal Alagar College of Engineering


Download : Click Here to Download

Data Structure and Algorithm - 100 Two marks with Answeres

Thanks to :
                  NOORUL ISLAM COLLEGE OF ENGINEERING
                  Kumaracoil,Thuckalay, Kanyakumari District, Tamilnadu State, India- 629 180.     
               
Download : Click Here to Download

Data Structure and Algorithm - Two Marks with Answer

Download : Click Here to Download

Data Structure and Algorithm Lab Updated Edition

Whats New ?

• Tree Traversal Program Output Added.
• BACKTRACKING ALGORITHM Program and Output Updated.
• DIJKSTRA'S ALGORITHM Program and Output Updated.
• PRIORITY QUEUE USING HEAPS Program and Output Updated.
• Minor Mistakes changed.

Download : Click Here to Download

Back Tracking and Dijkstra Algorithm Program with output

Download : Click Here to Download

DATA STRUCTURES AND ALGORITHMS DECEMBER 2009 Question Paper

	ANNA UNIVERSITY COIMBATORE
B.E./B.Tech. DEGREE EXAMINATION:DECEMBER 2009
	REGULATION-2008
	THIRD SEMESTER
   (COMMON TO EEE/EIE/ICE)
080300003-DATA STRUCTURES AND ALGORITHMS
Time : 3 hours            Maximum : 100 marks

	Answer ALL questions.

	PART A — (20 * 2 = 40 marks)

1. What are the advantage of modularity?
2. What are the two basic operation on array?
3. Give any two example for linked list
4. What is circularly linked list?
5. Differentiate LIFO and FIFO and give typical examples of it.
6. What is a tree?why it is used.
7. What is the need for non-linear data structure?
8. What are the operation on the binary tree?
9. What is the majar drawback of sepsrste chaining hashing?
10.What is a balance factor for any node in AVL tree?
11.What is heap?
12.What is linear probing?
13.Define the following:
   (i)Graph (ii)cycle
14.What is Biconnectivity?
15.Give any tow typical application of graphs.
16.where is Huffman coding is used?
17.What is principle of divide and conquer algorithms?
18.What do you mean by best fit in Bin packing?
19.What is the principle of randomized algorithms?
20.List out any two examples for NP complete problems.

PART B — (5 * 12 = 60 marks)

21.Explain the operation of a linked list.Also compara linked list and Array
22.Explain the various traversals in binary tree with example.
23.What is AVL tree? Also write suitable rotation algorithm.
24.Expain the shortest path algorithm with diagram.
25.Expain the kruskal's algorithm with diagram.
26.Expain the concept of stack and briefed on its two functions.
27.What is hashing?list out the various techniques of hashing.
28.Write short noteson folloeing:(i)B-tree(ii)Dynamic programming

Data Structure and Algorithm - Balanced Trees Lecture Notes

Download :  Click Here to Download

         Help :  How to Download ?

Experiment No : 5 - Implementation of Tree Traversals (Data Structure and Algorithm Lab Manual)

Experiment No : 5 - Implementation of Tree Traversals (Data Structure and Algorithm Lab Manual)

Download : Click Here to Download

Data Structures and Algorithms Lecture's (36 Video's) by Dr. Naveen Garg, IIT Delhi

This video series has 36 lecture's on following Data Structure topics. 

Lecture - 1 Introduction to Data Structures and Algorithms 
  
 Lecture - 2 Stacks 
  
 Lecture - 3 Queues and Linked Lists 
  
 Lecture - 4 Dictionaries 
  
 Lecture - 5 Hashing 
  
 Lecture - 6 Trees 
  
 Lecture - 7 Tree Walks / Traversals 
  
 Lecture - 8 Ordered Dictionaries 
  
 Lecture - 9 Deletion 
  
 Lecture - 10 Quick Sort 
  
 Lecture - 11 AVL Trees 
  
 Lecture - 12 AVL Trees continue.. 
  
 Lecture - 13 Trees 
  
 Lecture - 14 Red Black Trees 
  
 Lecture - 15 Insertion in Red Black Trees 
  
 Lecture - 16 Disk Based Data Structures 
  
 Lecture - 17 Case Study: Searching for Patterns 
  
 Lecture - 18 Tries 
  
 Lecture - 19 Data Compression 
  
 Lecture - 20 Priority Queues 
  
 Lecture - 21 Binary Heaps 
  
 Lecture - 22 Why Sorting 
  
 Lecture - 23 More Sorting 
  
 Lecture - 24 Graphs 
  
 Lecture - 25 Data Structures for Graphs 
  
 Lecture - 26 Two Applications of Breadth First Search 
  
 Lecture - 27 Depth First Search 
  
 Lecture - 28 Applications of DFS 
  
 Lecture - 29 DFS in Directed Graphs 
  
 Lecture - 30 Applications of DFS in Directed Graphs 
  
 Lecture - 31 Minimum Spanning Trees 
  
 Lecture - 32 The Union 
  
 Lecture - 33 Prims Algorithm for Minimum Spanning Trees 
  
 Lecture - 34 Single Source Shortest Paths 
  
 Lecture - 35 Correctness of Dijkstras Algorithm 
  
 Lecture - 36 Single Source Shortest Paths