Data Structures Section 1 - Technical Questions and Answers

Data Structures - Section 1

21.	What are the types of Collision Resolution Techniques and the methods used in each of the type?
	Answer: Open addressing (closed hashing), The methods used include: Overflow block. Closed addressing (open hashing), The methods used include: Linked list, Binary tree. Workspace Report errors ... Name : Email: View Answer

22.	In RDBMS, what is the efficient data structure used in the internal storage representation?
	Answer: B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier. This corresponds to the records that shall be stored in leaf nodes. Workspace Report errors ... Name : Email: View Answer

23.	What is a spanning Tree?
	Answer: A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized. Workspace Report errors ... Name : Email: View Answer

24.	Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
	Answer: No. The Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn't mean that the distance between any two nodes involved in the minimum-spanning tree is minimum. Workspace Report errors ... Name : Email: View Answer

25.	Which is the simplest file structure? (Sequential, Indexed, Random)
	Answer: Sequential is the simplest file structure. Workspace Report errors ... Name : Email: View Answer

26.	Whether Linked List is linear or Non-linear data structure?
	Answer: According to Access strategies Linked list is a linear one. According to Storage Linked List is a Non-linear one. Workspace Report errors ... Name : Email: View Answer

Next ›