Question # 1 of 10 ( Start time: 06:36:57 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 # 2 of 10 ( Start time: 06:37:27 PM ) Total Marks: 1
If a tree has 20 edges/links, then the total number of nodes in the tree will be :
Select correct option:
19
20
21
Can't be determined
Question # 3 of 10 ( Start time: 06:37:29 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 # 4 of 10 ( Start time: 06:39:11 PM ) Total Marks: 1
The worst case of building a heap of N keys is _______ .
Select correct option:
N
N^2
NlogN
2^N
Question # 5 of 10 ( Start time: 06:40:03 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: 06:40:39 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
Which of the following is NOT an implementation of Table ADT?
Select correct option:
Sorted Sequential Array
Stack
Linked List
Skip List
Question # 2 of 10 ( Start time: 06:37:27 PM ) Total Marks: 1
If a tree has 20 edges/links, then the total number of nodes in the tree will be :
Select correct option:
19
20
21
Can't be determined
Question # 3 of 10 ( Start time: 06:37:29 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 # 4 of 10 ( Start time: 06:39:11 PM ) Total Marks: 1
The worst case of building a heap of N keys is _______ .
Select correct option:
N
N^2
NlogN
2^N
Question # 5 of 10 ( Start time: 06:40:03 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: 06:40:39 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
Comments
Post a Comment
Please give us your feedback & help us to improve this site.