www.brightbrains.in

About Us/Home              Tests On Offer              Sample Questions              FAQ              Contact US

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
About Us/Home   Terms & Conditions   Cookies Policy   Privacy Policy   FAQ   Contact Us  
   © Copyright 2017 BrightBrains