Home / Engineering / Data Structure (DS) / Question

M

Mr. Dubey • 51.17K Points
Coach 

Q.) If Hibbard increments (h1= 1, h2= 3, h3= 7, …, hk = 2k–1) are used in a Shell sortimplementation, then the best case time complexity will be

(A) O(nlogn)
(B) O(n)
(C) O(n2)
(D) O(logn)
Correct answer : Option (A) - O(nlogn)

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Data Structure (DS)

Q. The sequence (1,1) (2,1) (3,1) (1,2) (2,2) (3,2) . . . .represents _________.

Q. What is the extension for a Visual Basic web form code file?

Q. What is the composition of Globar rod which is used as a source in Mid IR spectroscopy?

Q. Which of the following is open cloud storage management standard by SNIA ?

Q. Your firm has purchased an injection molding machine at a cost of $100,000. The machine’s useful life is estimated at 8 years. Your accounting department has estimated the capital cost for this machine at about $25,455 per year. If your firm’s MARR is 20%, how much salvage value do you think the accounting department assumed at the end of 8 years?

Q. Object-oriented system modelling using CRC method gives

Q. Which of the following is true?

Q. How are default arguments specified in the function heading?

Q. are scheduled with the Round-Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?

Q. Search space