Question # 1 of 10 ( Start time: 05:19:33 PM ) 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.
O(n^2) time, because the worst case has really random input which takes longer to sort.
Question # 2 of 10 ( Start time: 05:19:33 PM ) Total Marks: 1
What is the best definition of a collision in a hash table?
Select correct option:
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 same exact has value.
Two entries with the exact same key have different hash values.
Question # 3 of 10 ( Start time: 05:19:33 PM ) Total Marks: 1
Sorting procedure normally takes ________ time.
Select correct option:
NLogN
2N
N*N*N
N
Question # 4 of 10 ( Start time: 05:19:33 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 # 5 of 10 ( Start time: 05:19:33 PM ) Total Marks: 1
Which of the following is 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
All of the given
Question # 6 of 10 ( Start time: 05:19:33 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 # 7 of 10 ( Start time: 05:19:33 PM ) Total Marks: 1
he 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 # 8 of 10 ( Start time: 05:19:33 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 # 9 of 10 ( Start time: 05:19:33 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 # 10 of 10 ( Start time: 05:19:33 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 are already in the same set.
