DataStructure

Level:-Basic
Q(1)	Key value pair is usually seen in _______.
A	Hash tables
B	Heaps
C	Skip list
D	Both A and B
Q(2)	The linked list can be implemented using arrays.
A	True
B	False
Level:-Intermediate
Q(1)	The array that represents a binary max-heap is _______.
A	{25, 12, 16, 13, 10, 8, 14}
B	{25, 14, 16, 13, 10, 8, 12}
C	{25, 14, 12, 13, 10, 8, 16}
D	{25, 14, 13, 16, 10, 8, 12}
Q(2)	In tree construction, which is the suitable efficient data structure?
A	Array
B	Linked list
C	Stack
D	Queue
Level:-Expert
Q(1)	Merge sort uses ______.
A	Divide and conquer strategy
B	Heuristic search
C	Backtracking approach
D	Greedy approach
Q(2)	Sparse matrices have ________.
A	no zero
B	many zero
C	higher dimenstion
D	none of these

BACK REGISTER NOW

#Newsletter

Join the community of BrightBrains^TM

A Product that bridges the Academia-to-Industry gap, helps as a Self Assessment tool for competency checks, and assists in candidates filtering in the Software Industry.

SITEMAP

INFORMATION

CONTACT US

+91 265 2324495

2nd Floor, Sakar Complex, Opp. ABS Tower, Malhar Point, Old Padra Road Vadodara-390007 Gujarat

support@brightbrains.in

DataStructure

Join the community of BrightBrainsTM

SITEMAP

INFORMATION

CONTACT US

Join the community of BrightBrains^TM