Question # 1 of 10 ( Start time: 08:29:53 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

Do not remove a randomly chosen wall if the cells it separates are already in the same set**None of the given**

# Vukwl- Virtual Education Solution

Question # 2 of 10 ( Start time: 08:31:02 PM ) Total Marks: 1The main reason of using heap in priority queue is

Select correct option:

**improve performance**

code is readable

less code

heap can't be used in priority queues

Question # 3 of 10 ( Start time: 08:33:57 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

Question # 4 of 10 ( Start time: 08:34:20 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 # 5 of 10 ( Start time: 08:34:42 PM ) Total Marks: 1

Consider a min heap, represented by the following array: 3,4,6,7,5,10 After inserting a node with value 1. Which of the following is the updated min heap?

Select correct option:

3,4,6,7,5,10,1

3,4,6,7,5,1,10

1,4,6,7,5,10,3

**1,4,3,7,5,10,6**

# Vukwl- Virtual Education Solution

Question # 6 of 10 ( Start time: 08:35:14 PM ) Total Marks: 1Consider 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 # 7 of 10 ( Start time: 08:35:37 PM ) Total Marks: 1

Which property of equivalence relation is satisfied if we say: Ahmad R(is related to) Ahmad

Select correct option:

**Reflexivity**

Symmetry

Transitivity

All of the above

Question # 8 of 10 ( Start time: 08:36:03 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: 08:36:24 PM ) Total Marks: 1

The expression if ( ! heap->isFull() ) check

Select correct option:

Heap is empty

Heap is full

Heap is not empty

**Heap is not full**

Question # 10 of 10 ( Start time: 08:36:54 PM ) Total Marks: 1

We are given N items to build a heap of items , this can be done with _____ successive inserts.

Select correct option:

N-1

**N**

N+1

N^2

# Vukwl- Virtual Education Solution

*1.*

*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*

**2.**

**We implement the heap by****____________***Threaded Tree*

*AVL tree*

__Complete binary tree__*Expression*

*3.*

*A simple sorting algorithm like selection sort or bubble sort has a worst-case of*

**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.***4.*

*If we want to find median of 50 elements, then after applying buildHeap method, how many times deleteMin method will be called ?*

*Select correct option:*

*5*

__25__*35*

*50*

# Vukwl- Virtual Education Solution

*5.*

*Which one of the following is NOT true regarding the skip list?*

**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.__*6.*

*Which of the following is not true regarding the maze generation?*

**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.***7.*

*Which property of equivalence relation is satisfied if we say: Ahmad R(is related to) Ahmad*

*Reflexivity*

**Symmetry****Transitivity**

*8.*

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

*Heap is empty*

*Heap is full*

*Heap is not empty*

__Not a valid expression (not confirm)__

**9.***We implement the heap by*

*Threaded Tree*

*AVL tree*

**Expression**__Complete binary tree__*10.*

**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.*

*Which property of relation is satisdied if we say: Ahmad R(is related to)Ahmad*

# Vukwl- Virtual Education Solution

*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*

__List Sh contain only the n special keys__*Each list in a sub sequence of previous list one*

*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.*

*Reflexivity*

*Symmetry*

__Transitivity__*All of the above*

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

*Heap is empty*

*Heap is full*

*Heap is not empty*

__Heap is not full(not conferm)__*Which one of the following is not the property of equivalence relation*

*Reflexive*

*Symmetric*

*Transitive*

__Associative__*Which of the following is not and implementation of table ADT*

# Vukwl- Virtual Education Solution

*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?*

# Vukwl- Virtual Education Solution

*Two entries are identical except for their keys.*

Two entries with different data have the exact same key.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.*