What is a spanning Tree?
Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
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.
No. minimum spanning tree of a graph give the shortest distance between
any 2 specified node 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.
List out few of the applications that make use of Multilinked Structures?
a. Sparse matrix, b. Index generation.
a. Sparse matrix, b. Index generation.
In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none
(b) Linked list
(b) Linked list
Which is the simplest file structure? (a) Sequential (b) Indexed (c) Random
(a) Sequential
Whether Linked List is linear or Non-linear data structure?
According to Access strategies Linked list is a linear one. According to Storage Linked List is a Non-linear one.
Of the following tree structure, which is, efficient considering space and time complexities? (a) Incomplete Binary Tree (b) Complete Binary Tree (c) Full Binary Tree
(b) Complete Binary Tree. By the method of elimination: Full binary tree loses its nature when operations of insertions and deletions are done. For incomplete binary trees, extra storage is required and overhead of NULL node checking takes place. So complete binary tree is the better one since the property of complete binary tree is maintained even after operations like additions and deletions are done on it.
(b) Complete Binary Tree. By the method of elimination: Full binary tree loses its nature when operations of insertions and deletions are done. For incomplete binary trees, extra storage is required and overhead of NULL node checking takes place. So complete binary tree is the better one since the property of complete binary tree is maintained even after operations like additions and deletions are done on it.
In RDBMS, what is the efficient data structure used in the internal storage representation?
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.
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.
What are the types of Collision Resolution Techniques and the methods used in each of the type?
a> Open addressing (closed hashing), The methods used include: Overflow block, b> Closed addressing (open hashing) The methods used include: Linked list, Binary tree?
a> Open addressing (closed hashing), The methods used include: Overflow block, b> Closed addressing (open hashing) The methods used include: Linked list, Binary tree?
Classify the Hashing Functions based on the various methods by which the key value is found.
► Subtraction method, ► Modulo-Division method, ►Digit-Extraction method, ► Mid-Square method, ► Folding method, ► Pseudo-random method. ► Direct method,
► Subtraction method, ► Modulo-Division method, ►Digit-Extraction method, ► Mid-Square method, ► Folding method, ► Pseudo-random method. ► Direct method,
In an AVL tree, at what condition the balancing is to be done?
If the ?pivotal value? (or the ?Height factor?) is greater than 1 or less than ?1.
If the ?pivotal value? (or the ?Height factor?) is greater than 1 or less than ?1.
For more Datastructure Interview Questions and answers DOWNLOAD PDF from here.
0 comments:
Post a Comment