View Count: 0
Duration: 19 mins
Accessed date:
Not Yet Viewed
View Count: 0
Duration: 19 mins
Accessed date:
Not Yet Viewed
View Count: 0
Duration: 10 mins
Accessed date:
Not Yet Viewed
View Count: 0
Duration: 21 mins
Accessed date:
Not Yet Viewed
View Count: 0
Duration: 16 mins
Accessed date:
Not Yet Viewed
View Count: 0
Duration: 17 mins
Accessed date:
Not Yet Viewed
View Count: 0
Duration: 30 mins
Accessed date:
Not Yet Viewed
View Count: 0
Duration: 25 mins
Accessed date:
Not Yet Viewed
Post your comment / feedback here
 
 

Be the first one to comment about this video

Question No: 1 of 30
What is the Worst-case time for serial search finding a single item in an array? 
Options:
  1. Constant time
  2. Quadratic time
  3. Logarithmic time
  4. Linear time
View Answer/Explanation:
d
Explanation:

Question No: 2 of 30
What is the worst-case time for binary search finding a single item in an array? 
Options:
  1. Constant time
  2. Quadratic time
  3. Logarithmic times
  4. Linear time
View Answer/Explanation:
b
Explanation:

Question No: 3 of 30
What additional requirement is placed on an array, so that binary search may be used to locate an entry? 
Options:
  1. The array elements must form a heap.
  2. The array must have at least 2 entries
  3. The array must be stored
  4. The array’s size must be a power of two.
View Answer/Explanation:
b
Explanation:

Question No: 4 of 30
Which searching can be performed recursively? 
Options:
  1. Linear Search
  2. Binary Search
  3. Both
  4. None
View Answer/Explanation:
b
Explanation:

Question No: 5 of 30
Which searching can be performed iteratively? 
Options:
  1. Linear Search
  2. Binary Search
  3. Both
  4. None
View Answer/Explanation:
b
Explanation:

Question No: 6 of 30
In a selection sort of n element, how many times is the swap function called in the complete execution of the algorithms? 
Options:
  1. 1
  2. n2
  3. n-1
  4. logn
View Answer/Explanation:
b
Explanation:

Question No: 7 of 30
Selection sort and quick sort fall into the same category of sorting algorithms. What is the category? 
Options:
  1. O(n log n)sorts
  2. Interchange Sorts
  3. Divide-and-conquer sorts
  4. Average time is quadratic
View Answer/Explanation:
b
Explanation:

Question No: 8 of 30
Suppose that a selection sort of 100 items has completed 42 iterations of the main loop. How many items are now guaranteed to be in their final spot (never to be moved again)? 
Options:
  1. 21
  2. 41
  3. 42
  4. 43
View Answer/Explanation:
c
Explanation:

Question No: 9 of 30
When is insertion sort a good choice for sorting an array? 
Options:
  1. Each component of the array requires a large amount of memory
  2. The array has only a few items out of place
  3. Each component of the array requires a small amount of memory
  4. The processor speed is fast
View Answer/Explanation:
b
Explanation:

Question No: 10 of 30
What is the worst case time for quick sort to sort an array of n elements? 
Options:
  1. O(log n)
  2. O(n)
  3. O(n log n)
  4. O(n2)
View Answer/Explanation:
d
Explanation:

  1