Data Structures

Grade BCA

Data structures

Question Bank

• Write advantages of Hashing.
• Explain the difference between B- Tree and B+ Tree.
• Explain traversal of graph.
• What is m-way Search tree?
• What is Data structure?
• List out the areas in which data structures are applied extensively?
• Explain variable length record.
• What is topological sorting?
• What is the basic difference between direct and access and index sequential files?
• Describe two applications of general trees?
• What is B+ tree?
• What are the data structures used to perform recursion?
• What is the difference between graph and tree?
• Discuss advantages of graphs.
• Discuss major features of B-trees.
• Explain AVL Tree.
• Describe the complexity of heap sort.
• Discuss the complexity of Binary search.
• Draw all binary search trees with 5 nodes A,B,C,D and E that        

 satisfy the balance requirement of AVL trees.

• Explain Sorting.
• What is spanning tree?
• Explain File.
• Write the use and advantages of files.
• What is file organization?
• Discuss few important applications of search trees.
• What is binary search tree? Explain in detail the insertion and        deletion in a binary search tree.
• What are threaded binary trees? What are the applications?

                                         OR

     What is meant by threading? Discuss its relevance.

                                                OR

     What are threads?  What are its advantages and

     disadvantages? How threads are implemented in trees?

      Explain through an example.

• Explain the role of threads in binary search tree with suitable Example.
• What do you mean by AVL tree? How to insert node into AVL  tree? Explain.
• Discuss uses and advantages of AVL search tree with suitable   
• What uses and advantages of AVL search tree with suitable

examples.

• What is B-Tree? write an algorithm to insert a key into a B-

Tree and delete a key from B-Tree?

• Write short note on B-Tree?
• Explain B+ trees and its advantages with suitable

examples.

                                              OR

Write a short note on B+ Tree?

• Give a brief Idea about general trees?

                                                         OR

          What are general Trees? discuss the steps for conversion of

          general Trees to binary Trees?

• What are huffman‘s algorithm ?how it is useful and used?

  Discuss with Examples?

                                                   OR

Describe Huffman ‘s algorithm?

• Describe m-way search Tree?
• Describe the various operation on graph?

                                             OR

Explain the different operations performed on graph ?

• Describe Warshall algorithm for shortest path with

Example?

                                                 OR

What do you mean by shortest path? explain Warshall

algorithm for shortest path?

• Describe Dijkstra algorithm for shortest path?
• What do you mean by shortest path?
• Describe Dijkstra algorithm for shortest path with example?
• Discuss topological sorting and in the advantage with suitable example?
• Explain topological sorting?
• What is traversal of graph? How is it useful and use Explain with suitable example?
• Explain Traversal of graph?
• What do you mean by graph traversal? Explain depth first and breadth first traversal of graph.
• Explain various types of graph?
• What is the quick sort? how it is use and useful? Explain its complexity with suitable examples?
• Explain quick sort algorithm?
• Explain merge sort and its complexity with examples?
• Explain merge sort algorithm?
• Explain linear search and its advantages, disadvantages and complexity?
• Describe binary search?
• Write an algorithm to search an aliment using binary search?
• Differentiate between linear search and binary search?
• What are the differentiate between internal and external sorting?
• Which sorting algorithm is the best on the basis of complexity and why?
• Compare various sorting algorithm on basis of complexity?
• Describing merging?
• Define File. Describe constituent of a file?
• Write a short note on file operations?
• Describe various kind of operations required to maintain files briefly?
• Explain various types of file? According to function they perform?
• Discuss serial file organisation its advantages and disadvantages?
• Write a short note on sequential file organisation?
• What are the steps to access a record of a file? Also draw flow chart of this.
• What are the steps for updating a sequential file?
• Discuss the advantages and disadvantages of sequential file processing?
• Explain direct access file organisation there use and advantages?
• What do you understand by indexed by sequential file? Discuss the different technique for handling overflows in indexed sequential file?
• What is multi list file organisation? Explain by an example.
• Explain inverted list file organisation by taking examples.
• Differential between inverted list and multi list file organisation?
• Describe fixed and variable length records with examples?
• Describe primary and secondary key with Examples?
• Differentiate between fixed and variable length record?
• Explain hashing function and their relatives and merits and demerits?
• Write a short note on hashing?
• What do you understand by hashing? Explain various hashing function using suitable examples?
• What do you mean by hashing function? Describe various types of hashing function. Give suitable examples.
• What are the collisions? How are these harmful and resolved? Discuss with Examples?