Question # 1 of 10 ( Start time: 06:51:09 PM ) Total Marks: 1

Which of the following heap method lowers the value of key at position ‘p’ by the amount ‘delta’?

Select correct option:

increaseKey(p,delta)

decreaseKey(p,delta)**preculateDown(p,delta)**

remove(p,delta)

Question # 2 of 10 ( Start time: 06:51:48 PM ) Total Marks: 1

Which of the following statement is NOT correct regarding Table ADT?

Select correct option:

In a table, the type of information in columns may be different.**A table consists of several columns, known as entities.**

The row of a table is called a record.

A major use of table is in databases where we build and use tables for keeping information.

Question # 3 of 10 ( Start time: 06:53:30 PM ) Total Marks: 1

The total number of nodes on 10th level of a perfect binary tree are :

Select correct option:

256

512**1024**

Can't be determined

Question # 4 of 10 ( Start time: 06:54:21 PM ) Total Marks: 1

Which of the following heap method increase the value of key at position ‘p’ by the amount ‘delta’?

Select correct option:**increaseKey(p,delta)**

decreaseKey(p,delta)

preculateDown(p,delta)

remove(p,delta)

Question # 5 of 10 ( Start time: 06:54:44 PM ) Total Marks: 1

Which of the following is NOT true regarding the maze generation?

Select correct option: **Randomly remove walls until the entrance and exit cells are in the same set**.

Removing a wall is the same as doing a union operation.

Remove a randomly chosen wall if the cells it separates are already in the same set.

Do not remove a randomly chosen wall if the cells it separates a

Question # 6 of 10 ( Start time: 06:55:30 PM ) Total Marks: 1

If ahmad is boss of ehsan and ehsan is boss of umer then ahmad is also boss of umer. The above mentioned relation is _______________.

Select correct option:

Reflexive

Symmetry**Transitive**

None of given

Question # 7 of 10 ( Start time: 06:56:38 PM ) Total Marks: 1

Consider a min heap, represented by the following array: 11,22,33,44,55 After inserting a node with value 66.Which of the following is the updated min heap?

Select correct option:**11,22,33,44,55,66**

11,22,33,44,66,55

11,22,33,66,44,55

11,22,66,33,44,55

Question # 8 of 10 ( Start time: 06:57:34 PM ) Total Marks: 1

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

Select correct option:

Sorted Sequential Array

Stack

Linked List**Skip List**

Question # 9 of 10 ( Start time: 06:57:56 PM ) Total Marks: 1

If Ahmed is cousin of Ali and Ali is cousin of Asad then Ahmed is also cousin of Asad. This statement has the following property

Select correct option:

Reflexivity

Symmetry**Transitivity**

All of the above

Question # 10 of 10 ( Start time: 07:00:36 PM ) Total Marks: 1

The expression if ( ! heap->isEmpty() ) checks

Select correct option:

Heap is empty

Heap is full**Heap is not empty**

Not a valid expression

**improve performance**

code is readable

less code

heap can't be used in priority queues

**2.**

**We implement the heap by**

**____________**

Threaded Tree

AVL tree

__Complete binary tree__Expression

**O(1) time because all lists take the same amount of time to sort**

**O(n) time because it has to perform n swaps to order the list.**

__O(n2) time because sorting 1 element takes O(n) time - After 1 pass through the list,__

__either of these algorithms can guarantee that 1 element is sorted.__

**O(n3) time, because the worst case has really random input which takes longer to.**

Select correct option:

5

__25__50

**Each list Si contains the special keys + infinity and - infinity.**

**List S0 contains the keys of S in non-decreasing order.**

**Each list is a subsequence of the previous one.**

__List Sh contains only the n special keys.__**Randomly remove walls until the entrance and exit cells are in the same set.**

**Removing a wall is the same as doing a union operation.**

__Remove a randomly chosen wall if the cells it separates are already in the same set.__**Do not remove a randomly chosen wall if the cells it separates are already in the same set.**

**Symmetry**

**Transitivity**

__Not a valid expression (not confirm)__**9.**

AVL tree

**Expression**

__Complete binary tree__**Which of the following statement concerning heaps is NOT true?**

__Traversing a heap in order provides access to the data in numeric or alphabetical order.__**Removing the item at the top provides immediate access to the key value with highest (or lowest) priority.**

Inserting an item is always done at the end of the array, but requires maintaining the heap property.

A heap may be stored in an array.

Reflexivity

__Symmetry__Transitvity

All of the given

Heap can be use to implement

Stack

Link list

Queue

__Priority Queue__Which one of the following is not true regarding skip list.

Each list Si contain the special key + infinity and –infinity

List SO contain the key of S is non-decreasing order

**Each list in a sub sequence of previous list one**

__List Sh contain only the n special keys__If Ahmad is cousin of Ali and Ali is cousin of Asad then Ahmad is also cousin of Asad

the statement has the following property.

Symmetry

__Transitivity__All of the above

The expression of (! heap-> is full() ) check

Heap is empty

Heap is not empty

__Heap is not full(not conferm)__Which one of the following is not the property of equivalence relation

Reflexive

Transitive

__Associative__Which of the following is not and implementation of table ADT

Sorted sequentially array

Stack

Link list

__Skip list__Which one of the following is not an open addressing technique to resolve collection

Quadratic probing

Double hashing

__Cubic probing__Liner probing

What is the best definition of a collision on a hash table?

Two entries are identical except for their keys.

__Two entries with different data have the exact same key.__Two entries with different keys have the exact has value

Two entries with the exact same keys have different hash value.