Become a GOLD Member and access 40+ Technology Courses...
Live Help (Start Chat)
Interview Questions and Answer
Options:
a. Constant time
b. Quadratic time
c. Logarithmic time
d. Linear time
Reveal Answer
Options:
a. Constant time
b. Quadratic time
c. Logarithmic times
d. Linear time
Reveal Answer
Options:
a. The array elements must form a heap.
b. The array must have at least 2 entries
c. The array must be stored
d. The array’s size must be a power of two.
Reveal Answer
Options:
a. Linear Search
b. Binary Search
c. Both
d. None
Reveal Answer
Options:
a. Linear Search
b. Binary Search
c. Both
d. None
Reveal Answer
Options:
a. O(n log n)sorts
b. Interchange Sorts
c. Divide-and-conquer sorts
d. Average time is quadratic
Reveal Answer
Options:
a. Each component of the array requires a large amount of memory
b. The array has only a few items out of place
c. Each component of the array requires a small amount of memory
d. The processor speed is fast
Reveal Answer
Options:
a. The pivot could be either the 7 or the 9
b. The pivot is not the 7,but it could be the 9
c. The pivot could be the 7,but it is not the 9
d. Neither the 7 nor the 9 is the pivot
Reveal Answer
Options:
a. First element of list
b. Last element of list
c. Median of list
d. Any element of list
Reveal Answer
Options:
a. Merge sort
b. Bubble sort
c. Heap sort
d. None
Reveal Answer
Options:
a. Divide and Conqueror
b. Greedy
c. Backtrack
d. Dynamic programming
Reveal Answer
Options:
a. Heap sort
b. Selection sort
c. Quick Sort
d. Bubble Sort
Reveal Answer
Options:
a. O(log2 n)
b. O(n log2 n)
c. O(n)
d. O(n2)
Reveal Answer
Options:
a. O(log2 n)
b. O(n log2 n)
c. O(n)
d. O(n2)
Reveal Answer
Options:
a. O(log2 n)
b. O(n log2 n)
c. O(n)
d. O(n2)
Reveal Answer
Options:
a. 60,80,55,30,10,15
b. 80,55,60,15,10,30
c. 80,60,55,30,10,15
d. None
Reveal Answer
Options:
a. O(log2 n)
b. O(n log2 n)
c. O(n)
d. O(n2)
Reveal Answer
Options:
a. Linked list
b. Array
c. Both
d. None
Reveal Answer
Options:
a. Bubble sort
b. Selection sort
c. Quick sort
d. None
Reveal Answer
Options:
a. Priority Queue
b. Deque
c. Linear Queue
d. None
Reveal Answer
Options:
a. Complete binary tree
b. Binary Search Tree
c. Full Binary Tree
d. None
Reveal Answer
Bestdotnet google plus