M

Mr. Dubey • 52.30K Points
Coach 

Q. A self – balancing binary search tree can be used to implement

(A) Priority queue
(B) Hash table
(C) Heap sort
(D) Priority queue and Heap sort
Correct : Option (A)

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Fuzzy logic is usually represented as ___________

Q. Which of the following is used to retrieve pre-enrolment data?

Q. The 4-bit 2's complement representation of ' -7 ' is

Q. The initial solution of a transportation problem can be obtained by applying any known method. But the only condition is

Q. An consists of a search-key value and pointers to one or more records with that value as their search-key value.

Q. What is the name of the computer terminal which gives paper printout?

Q. Which of the following is one of the unique attributes of Cloud Computing?

Q. Bitwise Operators Can Operate Upon?

Q. Which of the following is a natural candidates for stream ciphers?

Q. IPsec defines two protocols: _______ and ________