Moodle2WordQuestions – English template

[22AM302-DS-I-FA12]

Question 01 (MC)
[101] [SO1] [60]
In a doubly linked list, how many pointers does each node contain? MC
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
ID number:
# Answers Feedback Grade
A. One 0

B. Two 100

C. Three 0

D. Four 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

1
Question 02 (MC)
[102] [SO1] [60]
Which of the following statements is true about a circular linked list? MC
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. The last node points to NULL 0

The last node points to the first

B. 100
node
C. Every node has a NULL pointer 0

D. It is a type of doubly linked list 0

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

2
Question 03 (MC)
[103][SO1][90]
What does a node in a doubly linked list contain? MC
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Data and one pointer 0

B. Data and two pointers 100

C. Data and three pointers 0

D. Only data 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

3
Question 04 (MC)
[104][SO1][90]
What is the main advantage of a circular linked list over a regular linked list? MC
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Less memory usage 0

B. No NULL pointers 0

Easy traversal to the start from the

C. 100
end
D. Fixed size 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

4
Question 05(MC)
[105][SO1][90]
Which operation is more efficient in a doubly linked list compared to a singly linked
MC
list?
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Traversal 0

B. Insertion at the end 0

C. Deletion from the middle 100

D. Searching 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct responses
No
(Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

5
Question 06(MC)
[106][SO1][90]
In a doubly linked list, how many pointers need to be updated when inserting a new
MC
node between two existing nodes?
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. One 0

B. Two 100

C. Three 0

D. Four 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct responses
No
(Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

6
Question 07 (MC)
[107][SO1][60]
Which of the following is not an advantage of using a circular linked list? MC
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
ID number:
# Answers Feedback Grade
A. No need to use NULL at the end 0

Ability to traverse the list

B. 0
indefinitely
Constant-time insertion at both
C. 0
ends
D. Easier to find the middle element 100
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

7
Question 08 (MC)
[108][SO1][60]
In a doubly linked list, which node does the previous pointer in the first node point
MC
to?
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. NULL 100

B. Itself 0

C. The last node 0

D. The next node 0

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

8
Question 09 (MC)
[109][SO1][60]
Which of the following is true for a doubly circular linked list? MC
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
The first node's previous pointer
A. 100
points to the last node
The last node's next pointer points
B. 0
to NULL
There are no NULL pointers in the
C. 0
list
D. The list contains exactly two nodes 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

9
Question 10 (MC)
[110][SO1][60]
What is the time complexity of inserting a node at the front of a doubly linked list? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. O(1) 100

B. O(log n) 0

C. O(n) 0

D. O(n^2) 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

10
Question 11 (MC)
[111] [SO1] [60]
In a circular linked list, how do you know you've reached the end of the list during
MC
traversal?
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
ID number:
# Answers Feedback Grade
The current node's next pointer is
A. 0
NULL
The current node's next pointer
B. 100
points to the head node
The current node's previous pointer
C. 0
is NULL
D. The current node contains a flag 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

11
Question 12 (MC)
[112] [SO1] [60]
Which of the following data structures allows constant-time insertion and deletion
MC
from both ends?
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Singly Linked List 0

B. Doubly Linked List 0

C. Circular Linked List 0

D. Both b) and c) 100

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

12
Question 13 (MC)
[113][SO1][90]
How is the last node identified in a doubly circular linked list? MC
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Its next pointer is NULL 0

Its next pointer points to the first

B. 100
node
Its previous pointer points to the
C. 0
first node
D. None of the above 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

13
Question 14 (MC)
[114][SO1][90]
In a circular linked list, which operation is more efficient compared to a regular
MC
singly linked list?
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Finding the middle element 0

B. Traversing from the end to the start 100

C. Accessing an element by index 0

D. Inserting an element in the middle 0

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

14
Question 15(MC)
[115][SO1][90]
Which of the following operations requires updating both pointers in a doubly linked
list? MC
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Inserting at the head 0

B. Deleting from the middle 100

C. Traversing the list 0

D. Accessing an element 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct responses
No
(Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

15
Question 16(MC)
[116][SO1][90]
Which of the following data structures does not allow traversal in both directions? MC
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Doubly Linked List 0

B. Circular Linked List 0

C. Singly Linked List 100

D. Doubly Circular Linked List 0

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct responses
No
(Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

16
Question 17 (MC)
[117][SO1][60]
What is the main disadvantage of using a doubly linked list? MC
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
ID number:
# Answers Feedback Grade
A. Slow traversal 0

B. Extra memory for pointers 100

C. Fixed size 0

D. Complex implementation 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

17
Question 18 (MC)
[118][SO1][60]
In a doubly linked list, how do you traverse the list backward? MC
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Start at the head node 0

B. Use the next pointer 0

Start at the tail node and use the

C. 100
previous pointer
D. Use a stack to reverse the order 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

18
Question 19 (MC)
[119][SO1][60]
Which of the following allows constant-time insertion at the end?
MC
(1 Mark-
[An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Doubly Linked List 0

B. Singly Linked List 0

C. Circular Linked List 0

D. Both a) and c) 100

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

19
Question 20 (MC)
[120][SO1][60]
Which of the following operations takes O(n) time in a circular linked list? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Insertion at the front 0

B. Deletion from the end 0

C. Searching for an element 100

D. Traversing the list 0

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

20
Question 21 (MC)
[121][SO1][60]
What is the difference between a doubly linked list and a circular linked list? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A doubly linked list has two
A. pointers per node, while a circular 0
linked list has only one
A circular linked list has no NULL
B. pointers, while a doubly linked list 100
has NULL pointers
Doubly linked lists can only be
traversed in one direction, while
C. 0
circular linked lists can be
traversed in both directions
Circular linked lists use more
D. 0
memory than doubly linked lists
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

21
Question 22 (MC)
[122][SO1][60]
Which of the following is a valid operation in a doubly linked list? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Accessing an element by index 0

Traversing from the middle to the

B. 100
head
Inserting an element at a specific
C. 0
index in constant time
D. Sorting the list in constant time 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

22
Question 23 (MC)
[123][SO1][60]
In a doubly linked list, how is the first node identified? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. It has no previous node 100

Its previous pointer points to the

B. 0
last node
C. Its next pointer is NULL 0

D. It contains the largest value 0

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

23
Question 24 (MC)
[124][SO1][60]
Which of the following data structures is best for implementing a deque (double-
ended queue)? MC
(1 Mark-
[An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Singly Linked List 0

B. Doubly Linked List 100

C. Circular Linked List 0

D. Array 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

24
Question 25 (MC)
[125][SO1][60]
Which of the following is not an advantage of a doubly circular linked list? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Traversing in both directions 0

B. Efficient searching by index 100

C. Insertion at both ends 0

D. No NULL pointers 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

25
Question 26 (MC)
[126][SO1][60]
What is a skip list? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. A tree-based data structure 0

A type of linked list with additional

B. 100
pointers for faster access
C. A hash table with multiple levels 0

D. A list with only backward traversal 0

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

26
Question 27 (MC)
[127][SO1][60]
What is the purpose of using a skip list? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. To reduce memory usage 0

To improve search, insertion, and

B. 100
deletion times
C. To sort elements in constant time 0

D. To allow backward traversal 0

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

27
Question 28 (MC)
[128][SO1][60]
In a skip list, what are the additional pointers used for? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Deleting nodes faster 0

Linking the list to an external data

B. 0
structure
Skipping over multiple nodes to
C. 100
speed up search
D. Reversing the list 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

28
Question 29 (MC)
[129][SO1][60]
What is the time complexity of searching in a skip list? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. O(n) 0

B. O(log n) 100

C. O(1) 0

D. O(n log n) 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

29
Question 30 (MC)
[130][SO1][60]
In a skip list, which operation is performed faster compared to a regular linked list? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Searching for an element 100

B. Accessing an element by index 0

C. Reversing the list 0

D. Deleting an element 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

30
Question 31 (MC)
[131][SO1][60]
In a skip list, how are the levels organized? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. All nodes belong to every level 0

Each level skips a fixed number of

B. 0
nodes
Higher levels skip more nodes than
C. 100
lower levels
Only the first and last levels
D. 0
contain nodes
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

31
Question 32 (MC)
[132][SO1][60]
How is space complexity affected in a skip list compared to a normal linked list? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. It remains the same 0

B. It increases slightly 100

C. It decreases due to the skips 0

It depends on the number of

D. 0
elements
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

32
Question 33 (MC)
[133][SO1][60]
What is the main benefit of using a skip list over a binary search tree? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Constant time insertion 0

B. Dynamic memory allocation 0

Easier balancing without re-

C. 100
arrangement
D. No need for pointers 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

33
Question 34 (MC)
[134][SO1][60]
Which operation is not improved by using a skip list? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Insertion 0

B. Searching 0

C. Sorting 100

D. Deletion 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

34
Question 35 (MC)
[135][SO1][60]
What is the expected number of levels in a skip list with n elements? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. log n 100

B. n 0

C. n log n 0

D. n^2 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

35
Question 36 (MC)
[136][SO1][60]
In a skip list, how many nodes are typically skipped at level 1? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. One node 0

B. Two nodes 100

C. log n nodes 0

D. It depends on the structure 0

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

36
Question 37 (MC)
[137][SO1][60]
Which of the following is false about skip lists? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
They are probabilistic data
A. 0
structures
They use randomization to skip
B. 0
nodes
The worst-case search time is
C. 100
O(n^2)
The expected time complexity for
D. 0
searching is O(log n)
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

37
Question 38 (MC)
[138][SO1][60]
What type of data structure is commonly used to implement skip lists? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Arrays 0

B. Linked Lists 100

C. Trees 0

D. Graphs 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

38
Question 39 (MC)
[139][SO1][60]
Which of the following is a disadvantage of a skip list? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
More memory usage than a normal
A. 100
linked list
Slower search time than a binary
B. 0
search tree
C. Harder to traverse than an array 0

D. Complex balancing operations 0

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

39
Question 40 (MC)
[140][SO1][60]
In a skip list, if you need O(1) insertion time, which of the following must you use? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Doubly Linked List 0

B. Stacks 0

C. Hashing with Skip Lists 100

D. Fixed size arrays 0

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

40
Question 41 (MC)
[141][SO1][60]
Which of the following is a characteristic of a skip list? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Deterministic in nature 0

B. Based on randomization 100

C. Uses sorting for faster access 0

D. Uses binary search 0

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

41
Question 42 (MC)
[142][SO1][60]
Skip lists are often considered as an alternative to which other data structure? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. AVL trees 100

B. Linked lists 0

C. B-trees 0

D. Hash tables 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

42
Question 43 (MC)
[143][SO1][60]
How is a skip list balanced? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. By rotating nodes 0

B. By re-linking pointers 0

C. Through probabilistic balancing 100

D. By rearranging nodes 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

43
Question 44 (MC)
[144][SO1][60]
In a skip list, if an element is not found in a higher level, what happens next? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
It is searched at the same level
A. 0
again
The search moves to the next
B. 100
lower level
The element is skipped and
C. 0
ignored
D. The entire list is reversed 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

44
Question 45 (MC)
[145][SO1][60]
Skip lists are often used in which of the following applications? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Cache management 0

B. Priority queues 0

C. Sorting algorithms 0

D. File systems 100

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

45
46