Fresherdreamjob - interviewquestions.fresherdreamjob.com
General Information:
Latest News:
Whether Linked List is linear or Non-linear data structure? 1 Apr 2010 | 10:09 pm
According to Access strategies Linked list is a linear one. According to Storage Linked List is a Non-linear one.
Does the minimum spanning tree of a graph give the shortest distance 1 Apr 2010 | 10:09 pm
No. 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 mini...
What is a spanning Tree? 1 Apr 2010 | 10:08 pm
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 no...
28. Of the following tree structure, which is, efficient considering 1 Apr 2010 | 10:08 pm
(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 requir...
In RDBMS, what is the efficient data structure used in the internal 1 Apr 2010 | 10:07 pm
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 1 Apr 2010 | 10:07 pm
Open addressing (closed hashing), The methods used include: Overflow block, Closed addressing (open hashing) The methods used include: Linked list, Binary tree…
Classify the Hashing Functions based on the various methods by which 1 Apr 2010 | 10:06 pm
Direct method, Subtraction method, Modulo-Division method, Digit-Extraction method, Mid-Square method, Folding method, Pseudo-random method.
There are 8, 15, 13, 14 nodes were there in 4 different trees. Which 1 Apr 2010 | 10:06 pm
15. In general: There are 2n-1 nodes in a full binary tree. By the method of elimination: Full binary trees contain odd number of nodes. So there cannot be full binary trees with 8 or 14 nodes, s...
What is the bucket size, when the overlapping and collision occur at 1 Apr 2010 | 10:05 pm
One. If there is only one entry possible in the bucket, when the collision occurs, there is no way to accommodate the colliding value. This results in the overlapping of values.
In an AVL tree, at what condition the balancing is to be done? 1 Apr 2010 | 10:05 pm
If the ‘pivotal value’ (or the ‘Height factor’) is greater than 1 or less than –1.
