Custom Search

Anna University CAMPUS Placement cognizant 2013 passing Out students

Anna University Dec 2012 Maths 3 m3 Reexam issue full Details

Anna University Nov/Dec 2012 3rd,5th,7th semester result Tentative dates

GATE 2013 HALL TICKET DOWNLOAD AND EXAM TIME TABLE

TN +2 october 2012 results

TIPS FOR ANNA UNIVERSITY STUDENTS TO GET PASS MARK EASILY

TN HSC 12TH MARCH 2013 TIME TABLE Announced Download soon

TN SAMACHEERKALVI 10TH March/April 2013 TIME TABLE Announced Download soon

ANNA UNIVERSITY MAY/JUNE REVALUATION REVIEW PROCEDURE, LAST DATE, APPLICATION FEE, REFUND PROCEDURE

ANNA UNIVERSITY MAY/JUNE 2012 REVALUATION RESULTS for 2nd,4th,6th,8th SEMESTER AVAILABLE HERE

ANNA UNIVERSITY FIRST SEMESTER BE/BTECH QUESTION BANK

GATE 2013 APPLY ONLINE AND KNOW MORE ABOUT NEW 2013 GATE

ANNA UNIVERSITY NOV/DEC 2012 TIME TABLE FOR 3RD,5TH,7TH SEMESTER

ANNA UNIVERSITY MAY/JUNE 2012 REVALUATION LAST DATE AUGUST 29, REVALUATION PROCEDURE,RESULT

ANNA UNIVERSITY MAY/JUNE 2012 RESULTS announced

ANNA UNIVERSITY TANCA ME/MTECH RANK LIST AND COUNSELLING SCHEDULE ANNOUNCED CLICK HERE

ANNA UNIVERSITY MAY/JUNE 2012 2ND,4TH,6TH,8TH SEMESTER RESULT DATE ANNOUNCED CLICK HERE

ANNA UNIVERSITY IMPORTANT INFORMATION FOR FIRST YEAR 2012-2013 STUDENTS

UNIVERSITY DEPARTMENTS AU:ANNA UNIVERSITY PART TIME BE/BTECH MAY/JUNE 2012 RESULTS ANNOUNCED CLICK HERE

TNEA 2012 TODAY'S VACANCY POSITION CHECK SOON

ANNA UNIVERSITY 8TH SEMESTER MAY/JUNE 2012 RESULTS ANNOUNCED CHECK SOON

ANNA UNIVERSITY 2ND SEMESTER JUNE 2012 RESULTS DATE FOR ALL COLLEGES TENTATIVE

ANNA UNIVERSITY CHENNAI 4TH SEMESTER,6TH SEMESTER MAY/JUNE 2012 RESULTS INCLUDING ARREARS ANNOUNCED CHECK SOON

ANNA UNIVERSITY OF TECHNOLOGY CHENNAI 4TH SEMESTER,6TH SEMESTER MAY/JUNE 2012 RESULTS INCLUDING ARREARS ANNOUNCED CHECK SOON

ANNA UNIVERSITY OF TECHNOLOGY TRICHY 4TH SEMESTER,6TH SEMESTER MAY/JUNE 2012 RESULTS INCLUDING ARREARS ANNOUNCED CHECK SOON

ANNA UNIVERSITY COIMBATORE 4TH SEMESTER,6TH SEMESTER MAY/JUNE 2012 RESULTS INCLUDING ARREARS ANNOUNCED CHECK SOON

ANNA UNIVERSITY TIRUNELVELI 4TH SEMESTER,6TH SEMESTER MAY/JUNE 2012 RESULTS INCLUDING ARREARS ANNOUNCED CHECK SOON

ANNA UNIVERSITY MADURAI 4TH SEMESTER,6TH SEMESTER MAY/JUNE 2012 RESULTS INCLUDING ARREARS ANNOUNCED CHECK SOON

TAMILNADU ENGINEERING ADMISSIONS 2012 TNEA 2012 VACANCY POSITION

TAMILNADU ENGINEERING ADMISSIONS 2012 TNEA 2012 RANK LIST ANNOUNCED CHECK SOON

TAMILNADU ENGINEERING ADMISSIONS 2012 COUNSELLING SCHEDULE, IMPORTANT DATES CHECK SOON

TAMILNADU ENGINEERING ADMISSIONS 2012 COUNSELLING CALCULATE CUT OFF MARK CLICK HERE

ANDHRA PRADESH AP SSC RESULTS OUT TODAY CHECK SOON

CBSE SSLC CLASS 10TH RESULTS TODAY CHECK SOON

KARNATAKA PUC (2ND) RESULTS ANNOUNCED CHECK SOON

RAJASTHAN 12TH COMMERCE RESULTS TO BE ANNOUNCED TODAY 12TH MAY 2012 CLICK HERE (BSER 12TH RESULTS)

MEGHALAYA HSSLC 2012 RESULTS CLICK HERE

KERALA SSLC/10TH 2012 RESULTS CLICK HERE

AP INTER 2ND YEAR RESULTS 2012 ANNOUNCED CLICK HERE

AP EAMCET 2012 EXAM HALL TICKET DOWNLOAD CLICK HERE

SBTET ANDHRA DIPLOMA APRIL/MAY 2012 TIME TABLE CLICK HERE

TAMIL NADU +2 RESULTS ANNOUNCED CLICK HERE

TAMIL NADU 10th SSLC SAMACHEERKALVI RESULTS ON JUNE 4TH 2012 CLICK HERE

ANNA UNIVERSITY MAY/JUNE 2012 TIME TABLE ALL UPDATES IN ONE PAGE

ANNA UNIVERSITY OF TECHNOLOGY TRICHY (2007,2008 REGULATION) MAY/JUNE 2012 REVISED TIME TABLE CLICK HERE (AFFILIATED COLLEGES AND UNIVERSITY DEPARTMENTS) FOR BE AND BTECH

ANNA UNIVERSITY OF TECHNOLOGY COIMBATORE (2007,2008 REGULATION) MAY/JUNE 2012 REVISED TIME TABLE CLICK HERE (AFFILIATED COLLEGES AND UNIVERSITY DEPARTMENTS) FOR BE AND BTECH

ANNA UNIVERSITY OF TECHNOLOGY TIRUNELVELI (2007,2008,2009,2010 REGULATION) MAY/JUNE 2012 REVISED TIME TABLE CLICK HERE (AFFILIATED COLLEGES AND UNIVERSITY DEPARTMENTS) FOR BE AND BTECH

ANNA UNIVERSITY OF TECHNOLOGY MADURAI (2010 REGULATION) MAY/JUNE 2012 REVISED TIME TABLE CLICK HERE (AFFILIATED COLLEGES AND UNIVERSITY DEPARTMENTS) FOR BE AND BTECH

ANNA UNIVERSITY OF TECHNOLOGY CHENNAI (2007,2008 REGULATION) MAY/JUNE 2012 REVISED TIME TABLE CLICK HERE (AFFILIATED COLLEGES AND UNIVERSITY DEPARTMENTS) FOR BE AND BTECH

ANNA UNIVERSITY 2ND SEMESTER MAY/JUNE 2012 REVISED TIME TABLE (APPLICABLE FOR CHENNAI, TRICHY, COIMBATORE, MADURAI, TIRUNELVELI FOR 2011 BATCHES ALSO)

ANNA UNIVERSITY RESCHEDULED EXAM DATES CLICK HERE

ANNA UNIVERSITY MAY/JUNE 2012 RESULTS ON JUNE

ANNA UNIVERSITY FIRST SEMESTER JAN 2012 REVALUATION RESULTS CLICK HERE

ANNA UNIVERSITY FIRST SEMESTER JAN 2012 BE/BTECH BSC MSC MCA MBA RESULTS ANNOUNCED

ANNA UNIVERSITY OF TECHNOLOGY THIRD SEMESTER NOV/DEC 2011 REVALUATION RESULTS ANNOUNCED CLICK HERE

ANNA UNIVERSITY COIMBATORE NOV/DEC 2011 REVALUATION RESULTS ANNOUNCED

ANNA UNIVERSITY TIRUNELVELI NOVEMBER/DECEMBER 2011 REVALUATION RESULTS

ANNA UNIVERSITY 3RD SEMESTER NOVEMBER/DECEMBER 2011 RESULTS

ANNA UNIVERSITY CHENNAI BE/BTECH, ME/MTECH, MCA, NOVEMBER/DECEMBER 2011 RESULTS

ANNA UNIVERSITY TRICHY NOVEMBER/DECEMBER 2011 RESULTS

ANNA UNIVERSITY TRICHY NOVEMBER/DECEMBER 2011 REVALUATION RESULTS

ANNA UNIVERSITY COIMBATORE NOVEMBER/DECEMBER 2011 RESULTS

ANNA UNIVERSITY TIRUNELVELI NOVEMBER/DECEMBER 2011 RESULTS

ANNA UNIVERSITY MADURAI NOVEMBER/DECEMBER 2011 RESULTS

TAMILNADU DIPLOMA APRIL/MAY 2012 RESULTS INFO CLICK HERE

TAMILNADU DIPLOMA APRIL/MAY 2012 TIME TABLE ANNOUNCED CHECK SOON

TAMILNADU DIPLOMA OCTOBER 2011 REVALUATION RESULTS ANNOUNCED CHECK SOON

GATE 2012 RESULTS ANNOUNCED CHECK SOON

TANCET 2012 RESULTS ANNOUNCED CHECK SOON CLICK HERE

TANCET 2012 RANK LIST AND CUT OFF MARKS DETAILS CLICK HERE

TANCET 2012 COUNSELLING SCHEDULE DETAILS CLICK HERE

ANNA UNIVERSITY 1ST,3RD,5TH,7TH SEMESTER SYLLABUS 2008 REGULATION

CS2201-Data Structures ANNA UNIVERSITY CSE 3RD SEMESTER QUESTION BANK DOWNLOAD

CS2201-Data Structures ANNA UNIVERSITY CSE 3RD SEMESTER QUESTION BANK DOWNLOAD
Question Bank
CS2201-Data Structures
Unit 1
PART A
  1. Define ADT.
  2. What are the advantages of Linked List over arrays?
  3. What are the advantages of doubly Linked List over singly linked list?
  4. List the applications of List ADT.
  5. List the applications of Stack and Queue.
  6. What is Deque?
  7. Convert the infix expression (a+b*c-d)/(e*f-g)
  8. What is circular queue?
  9. Write a routine to return the top element of stack.
  10. What is the working principle of Radix sort?
  11. What is priority Queue?
  12. What do you mean by cursor implementation of List?
PART B
  1. Explain the array and linked list implementation of Stack.
  2. Explain the array and linked list implementation of Queue.
  3. What are the various linked list operations? Explain
  4. Write routines to implement addition, subtraction & differentiation of two polynomials.
  5. Explain how stack is applied for evaluating an arithmetic expression.
  6. Explain cursor implementation of list.

Unit 2
PART A
  1. Compare General tree with binary tree.
  2. Define the following terminologies.
Sibling,Parent,Depth,height,Level,leaf,Degree.
  1. What is Full and Complete binary tree?
  2. Define binary search tree.
  3. Give the array and linked list representation of tree with example.
  4. Define tree traversal.
  5. Give the preorder, inorder and post order traversal for the following graph.
  1. Draw the binary search tree for the following inputs. 70,15,29,33,44,12,79
  2. Differentiate binary tree and binary search tree.
  3. What is threaded binary tree?
  4. Show the maximum number of nodes in an binary tree of height H is 2H+1-1
  5. List the steps involved in deleting a node from a binary search tree.
  6. A full node is a node with two children. Prove that the number of full nodes plus one is equal to the number of leaves in a non empty binary tree.
  7. List the applications of tree.
PART B
  1. Write an algorithm to find an element from binary search tree.
  2. Write an algorithm to insert , delete, Find minimum and maximum element from a binary search tree.
  3. What are the tree traversal techniques? Explain with an example.
  4. Explain the operations performed on threaded binary tree in detail.
Unit 3
PART A
  1. Define AVL tree.
  2. What is binary heap?
  3. What are the 2 properties of a binary heap?
  4. Define B-tree.
  5. What is percolating Up and percolating down?
  6. What do you mean by self adjusting tree?
  7. What is splay tree?
  8. What is a balance factor?
  9. List the applications of Binary Heap.
  10. Difference between B tree and B+ tree.
  11. List the different ways of implementing priority queue.
  12. What is Min heap and Max heap?
PART B
  1. Explain the AVL rotations.
  2. Construct splay tree for the following values.
1,2,3,4,5,6,7,8,9
  1. Explain the Basic operations performed in a Binary heap.
  2. Construct a Min and MAX heap for the following values.
23,67,1,45,7,89,56,35
  1. Write a routine to perform insertion in a B-tree

Unit 4
PART A
  1. Define Equivalence relation.
  2. List the basic data structures for Disjoint Set ADT.
  3. What is path compression?
  4. Define equivalence class.
  5. Show the result of the following sequence of instructions performed by size.
Union (1,2) ,Union (3,4), Union (3,5)
  1. Define hashing.
  2. What is collision? What are the different collision resolving techniques?
  3. What is open addressing?
  4. What is extendible hashing?
  5. Write a routine to perform the hash function.
  6. What is hash table?
  7. List the applications of SET.
PART B
  1. Define Hash function. Write routines to find and insert an element in separate chaining.
  2. Explain extendible hashing to resolve collision.
  3. Explain open addressing with example.
  4. Write a note on Dynamic equivalence problem.
  5. Write short notes on Smart Union algorithm.





Unit 5
PART A
  1. Define a graph.
  2. Define path,degree,cycle,loop,directed graph, undirected graph,bigraph, weighted graph.
  3. Define topological sort.
  4. Define minimum spanning tree.
  5. What is an articulation point?
  6. When a graph is said to be bi connected?
  7. Write the routine for Depth first and breadth first traversal.
  8. List the graph traversal techniques.
  9. List the applications of depth first traversal.
  10. List the applications of graph.
  11. What is an adjacency matrix? What are the different ways for implementing it?
  12. Compare directed and undirected graph.
  13. Name and find the in degree and out degree of the following graph
PART B
  1. What is Topological sort? Write down the pseudo code to perform topological sort and apply the same to the following graph.
  1. Explain Dijistra’s algorithm and find the shortest path from a to all other vertices in a graph.
  1. Explain Prim’s and Kruskal’s algorithm. Find the minimum spanning tree for the following graph.
FEEL USEFUL PLEASE GIVE +1
Subscribe via email FREE SMS ALERTS CLICK HERE

No comments:

Post a Comment

HI FRIENDS FEEL FREE TO COMMENT IN THIS BLOG

Related Posts Plugin for WordPress, Blogger...

Subscribe via email

FREE SMS ALERTS

CLICK HERE

Custom Search