The runtime complexity of the quicksort algorithm is 0(n) 0(log_2n) 0(n^2) 0(n -

Question

The runtime complexity of the quicksort algorithm is 0(n) 0(log_2n) 0(n^2) 0(n - log_2n) The time factor when determining the efficiency of algorithm is measured by: Counting microseconds Counting the number of primitive operations Counting the number of statements. A Counting the kilobytes of algorithm. Suppose the queue class uses the array implementation where the maximum capacity of the array data is 42. Ten items are in the queue stored at data [2] through data [11]. Where does the enqueue number function place the next new item into the array? Data [1] data [2] data [11] data (12) Well-formed parenthesis can be checked using which following data structure? List Hash Map Stack Queue A queue is implementation using an array such that enqueue and dequeue operation are performed efficiently, which one of the following statements is correct (in refers for the number of items in the queue)? Both operations can be performed in D time At most one operation can be performed in D () time but the word case for the other operations will be Ohm The case time complexity for both operations will be Works case time complexity for both operations will be Ohm (log n) Which of the following data structure in not a linear data structure? Arrays Linked lists Both of the above None of the above In a binary where ever the root these the level of the heap is replaced by the root Why It is the possible way To make sure that is still complete tree Because left and right Money of the above If there is a path Weakly connected Strongly Connected Lightly Connected Linearly Connected

Explanation / Answer

Answer1:

(C) and (D )

Worst-Case: O(n2) so option C

Best-Case O(nlogn)  so option D

Answer 2:

(B) counting the number of primitive operation

Answer3:

(D) because data type is array its better to store the elements in contiguous memory

Answer4:

(D) for paranthisis matching stack data structure is best

Answer5:

(A) Because implementation has done efficiently so circular queue Can be implemented o(1) time

Answer6:

(D) None of above beacause array and liked list are linear data structure (any data structure that must be traversed linearly)

Answer7:

(B) To make sure that it is still complete binary tree.

Answer8:

(B) strogly connected graph

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.