Scribd
Upload
56 views

Rdbms Interview Ques

The document discusses minimum spanning trees and how they differ from shortest path trees. It provides definitions for spanning tree and minimum spanning tree. It notes that while a minimum spanning tree minimizes total edge weight, it does not necessarily minimize distances between all node pairs. Another section discusses properties of different tree structures like complete binary trees for efficient operations like insertions and deletions.

Uploaded by

Gohan Kawa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
56 views

Rdbms Interview Ques

The document discusses minimum spanning trees and how they differ from shortest path trees. It provides definitions for spanning tree and minimum spanning tree. It notes that while a minimum spanning tree minimizes total edge weight, it does not necessarily minimize distances between all node pairs. Another section discusses properties of different tree structures like complete binary trees for efficient operations like insertions and deletions.

Uploaded by

Gohan Kawa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Does the minimum spanning tree of a graph give

the shortest distance


By ADMIN | Published: APRIL 1, 2010
No.
Minimal spanning tree assures that the total weight of the tree is
kept at its minimum. But it doesnt 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?


By ADMIN | Published: APRIL 1, 2010
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
By ADMIN | Published: APRIL 1, 2010
(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.
Posted in Data Structures Interview Questions | Comments closed

In RDBMS, what is the efficient data structure


used in the internal
By ADMIN | Published: APRIL 1, 2010
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
By ADMIN | Published: APRIL 1, 2010
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
By ADMIN | Published: APRIL 1, 2010
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
By ADMIN | Published: APRIL 1, 2010
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 Complete binary trees are different. All full binary trees
are complete binary trees but not vice versa.

Posted in Data Structures Interview Questions | Comments closed

What is the bucket size, when the overlapping and


collision occur at
By ADMIN | Published: APRIL 1, 2010
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?
By ADMIN | Published: APRIL 1, 2010
If the pivotal value (or the Height factor) is greater than 1 or
less than 1.

List out few of the applications that make use of


Multilinked
By ADMIN | Published: APRIL 1, 2010

Sparse matrix,
Index generation.

Posted in Data Structures Interview Questions | Comments closed

List out few of the Application of tree data-


structure?
By ADMIN | Published: APRIL 1, 2010

The manipulation of Arithmetic expression,


Symbol Table construction,
Syntax analysis.

Posted in Data Structures Interview Questions | Comments closed


Sorting is not possible by using which of the
following methods?(a)
By ADMIN | Published: APRIL 1, 2010

(d) Deletion.
Using insertion we can perform insertion sort, using selection we can
perform selection sort, using exchange we can perform the bubble sort
(and other similar sorting methods). But no sorting method can be done
just using deletion.

Posted in Data Structures Interview Questions | Comments closed

Convert the expression ((A + B) * C (D E) ^


By ADMIN | Published: APRIL 1, 2010

Prefix Notation:
^ * +ABC DE + FG Postfix Notation:
AB + C * DE - FG + ^

Posted in Data Structures Interview Questions | Comments closed

What are the notations used in Evaluation of


Arithmetic Expressions
By ADMIN | Published: APRIL 1, 2010

Polish and Reverse Polish notations.

Posted in Data Structures Interview Questions | Comments closed

What is the data structures used to perform


recursion?
By ADMIN | Published: APRIL 1, 2010

Stack. Because of its LIFO (Last In First Out) property it remembers


its caller so knows whom to return when the function has to return.
Recursion makes use of system stack for storing the return addresses
of the function calls.
Every recursive function has its equivalent iterative (non-recursive)
function. Even when such equivalent iterative procedures are written,
explicit stack is to be used.
Posted in Data Structures Interview Questions | Comments closed

Minimum number of queues needed to implement


the priority queue?
By ADMIN | Published: APRIL 1, 2010

Two. One queue is used for actual storing of data and another for
storing priorities.

Posted in Data Structures Interview Questions | Comments closed

If you are using C language to implement the


heterogeneous linked
By ADMIN | Published: MARCH 30, 2010

The heterogeneous linked list contains different data types in its


nodes and we need a link, pointer to connect them. It is not possible
to use ordinary pointers for this. So we go for void pointer. Void
pointer is capable of storing pointer to any type as it is a generic
pointer type.
Posted in Data Structures Interview Questions | Comments closed

What are the major data structures used in the


following areas :
By ADMIN | Published: MARCH 30, 2010

RDBMS Array (i.e. Array of structures)


Network data model Graph
Hierarchical data model Trees

Posted in Data Structures Interview Questi

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy