CS301 Quiz No.3 Shared by Sehrish

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


Question # 2 of 10 ( Start time: 08:31:02 PM ) Total Marks: 1
The 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


Question # 6 of 10 ( Start time: 08:35:14 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 # 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