Question # 1 of 10 ( Start time: 11:31:18 AM ) Total Marks: 1
The main reason of using heap in priority queue is
Select correct option:
improve performance ok
code is readable
less code
heap can't be used in priority queues
Question # 2 of 10 ( Start time: 11:32:17 AM ) Total Marks: 1
Which of the following is NOT an implementation of Table ADT?
Select correct option:
Sorted Sequential Array
Stack ok
Linked List
Skip List
Question # 3 of 10 ( Start time: 11:32:44 AM ) Total Marks: 1
Sorting procedure normally takes ________ time.
Select correct option:
NLogN
2N
N*N*N
N
Question # 4 of 10 ( Start time: 11:34:15 AM ) Total Marks: 1
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 ?
Select correct option:
1
2
3 ok
4
Question # 5 of 10 ( Start time: 11:34:55 AM ) Total Marks: 1
Which property of equivalence relation is satisfied if we say: Ahmad is cousin of Ali and Ali is also cousin of Ahmad
Select correct option:
Reflexivity
Symmetry ok
Transitivity
All of the above
Question # 6 of 10 ( Start time: 11:35:34 AM ) Total Marks: 1
Which property of equivalence relation is satisfied if we say: Ahmad R(is related to) Ahmad
Select correct option:
Reflexivity
Symmetry ok
Transitivity
All of the above
Question # 7 of 10 ( Start time: 11:36:34 AM ) 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. ok
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 # 8 of 10 ( Start time: 11:38:08 AM ) Total Marks: 1
Which one of the following is NOT true regarding the skip list?
Select correct option:
Each list Si contains the special keys + infinity and - infinity
List S0 contains the keys of S in non-decreasing order
List Sh contains only the n special keys ok
Each list is a subsequence of the previous one
Question # 9 of 10 ( Start time: 11:38:54 AM ) Total Marks: 1
A simple sorting algorithm like selection sort or bubble sort has a worst-case of
Select correct option:
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(n^2) 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. ok
O(n^2) time, because the worst case has really random input which takes longer to sort.
Question # 10 of 10 ( Start time: 11:39:15 AM ) Total Marks: 1
Which one of the following is NOT the property of equivalence relation?
Select correct option:
Reflexive
Symmetric
Transitive
Associative ok
