Skip to main content

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


Comments

Post a Comment

Please give us your feedback & help us to improve this site.

Popular posts from this blog

CS301 Current Finalterm Paper Spring 2014 Shared By M. Waleed

My Tday's Cs301 Paper: Mcq's Are From Moaz And Some Are From Handouts. Subjective Is From Moaz Majority One. 1- The Image Segmentation Define? 2- The Maximum Number Level Of Nodes In Binary Tree 3-The Iteration Array Have To Sort. 4- The Hapified Array Have To Solved 5- The Algorithm Of Binary Seaoh Tree 6-Sara Arrays Wala He Tha Ya Heap Wala. 7-....Wala Wala Wala...
1 comment
Read more

CS614 Quiz No.3 Shared by Students (Solved), Spring 2014

______ index stores first value in each block in the sequential file and a pointer to the block.  Select correct option:   Dense  Sparse  B-Tree  Hash In context of data parallelism, the work done by query processor should be:  Select correct option:  Almost zero  Maximum  Pipelined  Filtered across partitions The optimizer uses a hash join to join two tables if they are joined using an equijoin and  Select correct option:   Outer table has less number of rows  Inner table has less number of rows  Cardinality of tables is equal  Large amount of data needs to be joined Bitmap index is appropriate for:  Select correct option:  Low cardinality data  High cardinality data  Clustered data  Aggregated data If a task takes “T” time units to execute on a single data item, then execution of this task on “N” data items will take __...
Post a Comment
Read more

CS301 Quiz No.2 Shared by Tayyeba

Binary search algorithm can not be applied to ____ Select correct option: sorted linked list sorted binary trees        ok sorted linear array pointer array During in-order traversal using recursive calls, if we found a node is NULL. It means this node will satisfy following condition. Select correct option: It will not have left child        ok It will not have right child It will not have both left and right children None of given options Identify the data structure which allows deletions at both ends of the list but insertion at only one end. Select correct option: Input-restricted deque Output-restricted deque Priority queues        ok A BST generated from the data in ascending order is ____________. Select correct option: Linear Nonlinear Balanced        ok Un sorted In a program a reference variable, say x, can be declared as Sele...
1 comment
Read more