Hello There, Guest! RegisterLogin with Facebook
Login with Facebook

Anna University TNEA 2018 Rank List Published. Login to know your Rank.
Anna University April May 2018 Exam Results
Anna University Latest News , Updates and Announcements
>>> Anna University Sixth Semester Question Bank Collection (R2013) ECE,MECH,CSE,IT,EEE,CIVIL,EIE
>>> Anna University Study Materials for all Departments
>>> Anna University Question Papers : April May June 2015 Question Papers | Nov Dec 2014 and Jan 2015 Question Papers

Register or Login to Submit Study Materials , Shoutbox and also to access Many Features !!

Vidyarthiplus Shop :: Handwritten Premium Lecture Notes
Share your Study Materials with us
Share your Study Materials with us : Click Here

Important Questions in 141301- Data Structures
#1


Important Questions in Data Structures 141301
SECOND YEAR THIRD SEMESTER CSE Students


141301 - Data Structures

UNIT I

1. Explain the addition and deletion operation performed on a circular queue with necessary algorithm
2. Write an algorithm for push and pop operation on stack using linked list
3. Explain the complete set of stack operation
4. Write the insertion and deletion operations singly and doubly linked list

UNIT II
1. Write an algorirhm for pre-order and postorder traversal of a binary tree.
2. Describe the algorithm used to perform single and double rotation on AVL tree
3. Write an ADT binary search tree
4. Explain heap structures. How are binary heaps implemented? Give its algorithm with example

UNIT III
1. Discuss in detail the B-tree.What are its advantage.
2. Define Tree. Explain the tree traversals with algorithms and examples
3. Describe circular queue implementation in detail giving all the relevant features
4. Explain the concept of insertion and deletion of elements from a Max Heap. Illustrate with suitable algorithms

UNIT IV
1. Explain separate chaining and extensible hashing.
2. Formulate an ADT to perform for the union and find operation of disjoint set
3. Show the result of inserting keys 2,3,5,7,11,13,15,6,4 into an empty extendible hashing data structure with M=3
4. What is union by height?Write an algorithm to implement it
5. Explain path compression with an example

UNIT V
1. What is minimum spanning tree?Explain the algorithm using prim’s and kruskals with an example.
2. Write an dijkstra’s algorithm with an example.
3. Explain DFS and BFS with an example.
4. Explain topological sort with an example

“Work hard in silence, let your success be your noise...”



Possibly Related Threads...
Thread Author Replies Views Last Post
  EC2202-DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ important questions SA JANANI 0 557 06-01-2018, 12:22 PM
Last Post: SA JANANI
  EC2202-DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ two marks SA JANANI 0 178 06-01-2018, 12:17 PM
Last Post: SA JANANI
  EC2202-DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ SA JANANI 0 178 06-01-2018, 12:16 PM
Last Post: SA JANANI
  EC2202-DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ SA JANANI 0 175 06-01-2018, 12:15 PM
Last Post: SA JANANI
  EC2202-DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ SA JANANI 0 245 06-01-2018, 12:13 PM
Last Post: SA JANANI
  EE2204 Data Structures - Important Programs rajsathya 0 1,742 31-03-2013, 11:15 PM
Last Post: rajsathya
  Data Structures Important Programs - Chapter 4 - Graphs rajsathya 0 1,168 31-03-2013, 10:25 PM
Last Post: rajsathya
  Data Structures Important Programs - Chapter 2 & 3 - Trees rajsathya 0 1,202 31-03-2013, 10:10 PM
Last Post: rajsathya
  Data Structures Important Programs - Chapter 1 - Using Queue rajsathya 0 1,094 31-03-2013, 09:16 PM
Last Post: rajsathya
  Data Structures Important Programs - Chapter 1 - Using Stacks rajsathya 0 1,074 31-03-2013, 09:02 PM
Last Post: rajsathya
Reply
#2

thanks for given

venkaram92@gmail.com, proud to be a member of Vidyarthiplus.com (V+) - Online Students Community since Jun 2012.


Reply

Subscribe


Recommend on Google



Vidyarthiplus Whatsapp