Learn and practice Aptitude questions and answers with explanation for interview, competitive exam (Pariksha Corner )

Friday, January 24, 2020

The data structure useful for the breadth first search of a

The data structure useful for the breadth first search of a graph is
Astack
Bqueue
Clinked list
Ddequeue
View Answer

Merge sort uses

Merge sort uses
Agreedy methodology
Bdivide and conquer methodology
Cdynamic methodology
Dheuristics with back tracking.
View Answer

A municipality stored details about every house in its pervi

A municipality stored details about every house in its perview as a ‘structure'. each containing a large number of details. These are to be sorted. The best approach is
Asort them directly
Bstore them in an array and sort the array
Cstore pointers to them in an array and sort the array
Dstore them in a linked list and sort the linked list.
View Answer

The height of a binary tree is defined as the maximum number

The height of a binary tree is defined as the maximum number of edges in any path from the root to the leaf. The maximum number of nodes in any binary tree of height h is
A2h
B2h-1-1
C2h+1
D2h+1-1
View Answer

The principle of cache memory is primarily based on

The principle of cache memory is primarily based on
Athe principle of locality of reference
Bthe heuristic 90-10 rule
Cthe fact that the entire program is not required at once
Dthe faster memories also tend to be costlier.
View Answer

The number of data pulses required to shift one byte of data

The number of data pulses required to shift one byte of data from the input to the output of a 4 bit shift register is
A9
B12
C16
D32
View Answer

Any position independent code is best written using which of

Any position independent code is best written using which of the following addressing modes ?
AAbsolute
BDirect
CIndirect
DRelative.
View Answer

Categories