In Binary tree representation created by execution of Quick sort, Pivot is at

Home / Engineering / High Performance Computing / Question

M

Mr. Dubey • 51.43K Points
Coach

Q.) In Binary tree representation created by execution of Quick sort, Pivot is at

(A) leaf node

(B) root of tree

(C) any internal node

(D) none of the above

Correct answer : Option (B) - root of tree

Share

Discusssion

Login to discuss.

Related MCQs on High Performance Computing

Q. The content of the matrix Need is

Q. A graph has 20 vertices. The maximum number of edges it can have is? (Given it is bipartite)

Q. Point out the wrong statement.

Q. Standardisation implies that all components, physical and software ,which are used to create the IT infrastructure across the organization

Q. ______________ is used to show hierarchy in a pseudo code.

Q. Which multiple access technique is used by IEEE 802.11 standard for wireless LAN?

Q. Which of the following is/are main parameters that you should use when computing the costs of a software development project?

Q. Cost of ownership is

Q. The Advanced Encryption Standard (AES) was designed

Q. At what organisational level is it necessary to balance strategic actions with environmental and resource conditions?