Professional Documents
Culture Documents
Data Structure Mcqs
Data Structure Mcqs
Data Structure Mcqs
MCQs DATASTRUCTURE
eatvc swat #+92-3329209693
6) The average search time of hashing with linear probing will be less if
the load factor ?
is far less than one
equals one
is far greater than one
none of above
Show/Hide Answer
Answer = A
Explanation:Load factor is the ratio number of records that are currently
present and the total number of records that can be present. If the load
Show/Hide Answer
Answer = E
Explanation: N/A
5) Sparse matrix have ?
many zero entries
many non-zero entries
higher dimension
none of above
Show/Hide Answer
Answer = A
Explanation: A sparse matrix is a matrix populated primarily with zeros
6) Which of the following algorithm solves the all pair shortest path
problem ?
Dijkstra's algorithm
Floyd's algorithm
Prim's algorithm
Warshall's algorithm
Show/Hide Answer
Answer = B
Explanation: The FloydWarshall algorithm (also known as Floyd's
algorithm, RoyWarshall algorithm, RoyFloyd algorithm, or the WFI
algorithm) is a graph analysis algorithm for finding shortest paths in a
weighted graph (with positive or negative edge weights) and also for
finding transitive closure of a relation R.
7) As part of maintenance work, you are entrusted with the work of
rearranging the library books in a shelf in proper order, at the end of
each day. The ideal choice will be ?
Bubble sort
Insertion sort
Selection sort
Heap sort
Show/Hide Answer
Answer = B
Explanation:N/A
MCQs DATASTRUCTURE
eatvc swat #+92-3329209693
8) The way a card game player arranges his cards as he picks them up
one by one, is an example of ?
bubble sort
selection sort
insertion sort
merge sort
Show/Hide Answer
Answer = C
Explanation: He scans throught the rest of the cards and pick the one
with least value and places it next to the point till which he has already
sorted the cards
9) The average successful search time for sequential search on 'n'
items is ?
n/2
(n - 1)/2
(n + 2)/2
log(n) + 1
Show/Hide Answer
Answer = C
Explanation:N/A
10) Linked lists are suitable for which of the following problems ?
Insertion sort
Binary search
Radix sort
Polynomial manipulation
Show/Hide Answer
Answer = B
Explanation: Through Linked list binary search can be performed
efficiently.
- See more at: http://edugrip.blogspot.com/2012/08/datastructure-objective-type-questions.html#sthash.zJy1Jo5v.dpuf
MCQs DATASTRUCTURE
eatvc swat #+92-3329209693
Answer = A
Multiple Choice Questions On Data Structure | UGC NET
Exam 2012 Sample
Tags: Data Structure
1)What is Data Structure ?
Way to organize data
Accessing of data elements in specified manner
Organization of mathematical and logical concepts
All of Above
Show/Hide Answer
Answer = D
Explanation:A Data Structure may be organized in different ways :
The logical or mathematical model of a particular organization of
data is called Data Structure.
2) Which operation is not possible on Data Structure ?
Traversing
Insertion
Reading
Deletion
Show/Hide Answer
Answer = C
Explanation:Possible operations on the Data Structure are
Traversing, Insertion, Searching and Deletion.
3) The memory address of the first element is called ?
Floor Address
Foundation Address
First Address
Base Address
Show/Hide Answer
Answer = D
Explanation:The memory address of the first element is often
called base address in Data Structure.
4) The value of first linked list address is ?
0
-1
MCQs DATASTRUCTURE
eatvc swat #+92-3329209693
1
None of Above
Show/Hide Answer
Answer = 0
Explanation: No explanation for this question.
5) Two dimensional arrays are also called ?
Matrix Array
Table Array
Both a and b
None of the Above
Show/Hide Answer
Answer = C
Explanation:Two dimensional arrays are called as matrix array and
table arrays because they contains rows and columns.
6) The situation in linked list START=NULL is called ?
Overflow
Underflow
Both of above
None of Above
Show/Hide Answer
Answer = B
Explanation:It is the situation when we are trying to delete an item
from the empty linked list.
7) Length of the linear array can be found by using the formula ?
UB - LB + 1
LB + UB
LB - UB
LB - UB + 1
Show/Hide Answer
Answer = A
Explanation:The length of linear array can be found by using UB LB + 1 Where UB is upper Bound, LB is Lower Bound of the array.
8) The restriction while using the binary search is ?
List should be small in number
List should be large in number
-6
6
4
None
Show/Hide Answer
Answer =B
6) Determine which of the following is valid character constant ?
'//'
'\0'
'xyz'
'\052'
Show/Hide Answer
Answer = A
7) Given the statement , maruti.engine.bolts=25 . Which of the
following is true?
Structure bolts is nested within structure engine
Structure engine is nested within structure maruti
Structure maruti is nested within structure engine
Structure maruti nested within structure bolts
Show/Hide Answer
Answer =B
8) To access a structure element using a pointer, ......... operator is
used?
dot ( . )
pointer ( & )
pointer ( * )
arrow ( -> )
Show/Hide Answer
Answer =D
9) The ........ operator is a technique to forcefully convert one data
type to the other ?
Cast
Conversion
Type
Uniary
Show/Hide Answer
MCQs DATASTRUCTURE
eatvc swat #+92-3329209693
Answer = A
10) Which of the following numerical value is invalid constant ?
assignment operator
relational operator
logical operator
bitwise shift operator
Show/Hide Answer
Answer = D
A data structure is a way of organizing data that considers not only the items
stored, but also their relationship to each other. Advance knowledge about the
relationship between data items allows designing of efficient algorithms for the
manipulation of data.
2. List out the areas in which data structures are applied extensively?
1.
MCQs DATASTRUCTURE
eatvc swat #+92-3329209693
1.
Compiler Design,
2.
Operating System,
3.
4.
5.
Numerical Analysis,
6.
Graphics,
7.
Artificial Intelligence,
1.
Straight merging,
8.
Simulation
2.
Natural merging,
3.
Polyphase sort,
4.
3. What are the major data structures used in the following areas : RDBMS,
Network data model and Hierarchical data model.
1.
2.
Postfix Notation: AB + C * DE - FG + ^ -
2.
3.
2.
3.
Syntax analysis.
12. List out few of the applications that make use of Multilinked
Structures?
1.
Sparse matrix,
2.
Index generation.
MCQs DATASTRUCTURE
eatvc swat #+92-3329209693
19. 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.
14. What is the type of the algorithm used in solving the 8 Queens
problem?
Backtracking.
15. 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.
16. What is the bucket size, when the overlapping and collision occur at
same time?
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.
17. Classify the Hashing Functions based on the various methods by which
the key value is found.
1.
Direct method,
According to Access strategies Linked list is a linear one.
MCQs DATASTRUCTURE
eatvc swat #+92-3329209693
2.
Subtraction method,
3.
Modulo-Division method,
4.
Digit-Extraction method,
5.
Mid-Square method,
6.
Folding method,
7.
Pseudo-random method.
18. What are the types of Collision Resolution Techniques and the methods
used in each of the type?
1.
2.