Interview Questions
- Interview questions
- .Net Questions
- AJAX Questions
- ASP .NET Interview Questions
- Basic Common Questions
- C# Interview Questions
- Computer Networks
- Data Structures Interview Questions
- IIS Interview Questions
- Java Interview Questions
- OOPs Questions
- RDBMS Interview Questions
- SQL Interview Questions
- Unix Commands Interview Questions
- XML Interview Questions
- Interview questions
Author Archives: Admin
Does the minimum spanning tree of a graph give the shortest distance
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 minimum.
Posted in Data Structures Interview Questions Comments closed
What is a spanning Tree?
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.
Posted in Data Structures Interview Questions Comments closed
28. Of the following tree structure, which is, efficient considering
(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 [...]
Posted in Data Structures Interview Questions Comments closed
In RDBMS, what is the efficient data structure used in the internal
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.
Posted in Data Structures Interview Questions Comments closed
What are the types of Collision Resolution Techniques and the methods
Open addressing (closed hashing),
The methods used include:
Overflow block,
Closed addressing (open hashing)
The methods used include:
Linked list,
Binary tree…
Posted in Data Structures Interview Questions Comments closed
Classify the Hashing Functions based on the various methods by which
Direct method,
Subtraction method,
Modulo-Division method,
Digit-Extraction method,
Mid-Square method,
Folding method,
Pseudo-random method.
Posted in Data Structures Interview Questions Comments closed
There are 8, 15, 13, 14 nodes were there in 4 different trees. Which
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, so rejected. With 13 nodes you can
form a complete binary tree but not a full binary tree. So the correct
answer is 15.
Note:
Full and [...]
Posted in Data Structures Interview Questions Comments closed
What is the bucket size, when the overlapping and collision occur at
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.
Posted in Data Structures Interview Questions Comments closed
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.
Posted in Data Structures Interview Questions Comments closed
Whether Linked List is linear or Non-linear data structure?