CS301 Quiz 3 Set 2 by VU Topper RM

Q1. Vu-Topper RM (1 marks)

Suppose a hash function returns 6 for the given value. At which index of array the value will be saved?

Q2. Vu-Topper RM (1 marks)

What is a skip list?

A linked list with size value in nodes A linked list that allows slower search within an ordered sequence. A linked list that allows faster search within an ordered sequence. A tree which is in the form of linked list

Q3. Vu-Topper RM (1 marks)

Suppose there is an image segmented into pixels. Each pixel has _ neighbour(s).

Q4. Vu-Topper RM (1 marks)

56 64 78 100 If we perform 4 deleteMin operations, the last element deleted is__________.

Q5. Vu-Topper RM (1 marks)

Suppose there is an image of 7 * 7. now we will have matrix of _rows and---columns.

7, 7

49, 49 100, 100 8, 8

Q6. Vu-Topper RM (1 marks)

If we want to find 3rd minimum element from an array of elements, then after applying buildHeap method, how many times deleteMin method will be called ?

Q7. Vu-Topper RM (1 marks)

Binary Search can be categorized into which of the following?

Divide and conquer. Greedy algorithm. Dynamic programming. Brute force technique.

Q8. Vu-Topper RM (1 marks)

Which of the following properties are satisfied by Equivalence relationship?

Reflexive, symmetric Reflexive, transitive Symmetric, transitive

Reflexive, symmetric and transitive

Q9. Vu-Topper RM (1 marks)

The main reason of using heap in priority queue is

Improve performance

code is readable less code heap can't be used in priority queues.

A table consists of several columns, known as Field. File.

Entities Page 408

Folder Which of the following is NOT an implementation of Table ADT?

Stack

Skip List

If unions are done by weight (size), the depth of any element is never greater than

log2 n

Nlogn Logn*n

In 1990, Bill Pugh proposed an enhancement on linked lists and the new data structure was termed as

Skip-list

B-Tree. Spelling checker.

During the union by size method, all the array element initialized to -1 shows; Tree is complete

Initial condition of tree

None of the Every tree has two elements each.

What is the time complexity of binary search with iteration? O(nlogn) O(n2) O(n)