Tag the questions with any skills you have. Your dashboard will track each student's mastery of each skill.
Give this quiz to my class
Q 1/33
Score 0
Which of the following is a linear data structure?
30
Stack
Array
Hash Table
Binary Tree
Q 2/33
Score 0
Which of the following is a non-linear data structure?
30
Linked List
Queue
Binary Tree
Array
33 questions
Q.
Which of the following is a linear data structure?
1
30 sec
Q.
Which of the following is a non-linear data structure?
2
30 sec
Q.
Which of the following memory allocation is performed at compile-time?
3
30 sec
Q.
Which of the following memory allocation is performed at runtime?
4
30 sec
Q.
Which of the following is an example of a static data structure?
5
30 sec
Q.
Which of the following is an example of a dynamic data structure?
6
30 sec
Q.
Which of the following is not a linear data structure?
7
30 sec
Q.
Which of the following is a static memory allocation?
8
30 sec
Q.
Which of the following is a dynamic memory allocation?
9
30 sec
Q.
Which of the following is an example of a non-linear data structure?
10
30 sec
Q.
In a linked list, which operation is used to insert a node at the beginning?
11
30 sec
Q.
In a linked list, which operation is used to delete the last node?
12
30 sec
Q.
In a linked list, which operation is used to insert a node at a specific position?
13
30 sec
Q.
In a linked list, which operation is used to delete a node at a specific position?
14
30 sec
Q.
In a linked list, which operation is used to delete a node with a specific value?
15
30 sec
Q.
In a linked list, which operation is used to find the length of the list?
16
30 sec
Q.
What steps are needed to insert a value at the beginning of a linked list?
17
30 sec
Q.
What steps are needed to insert a value at the end of a linked list?
18
30 sec
Q.
What steps are needed to insert a value at a specific position in a linked list?
19
30 sec
Q.
What steps are needed to delete a node from a linked list?
20
30 sec
Q.
What is the time complexity for deleting a node from a linked list?
21
30 sec
Q.
What is the time complexity for searching an element in a linked list?
22
30 sec
Q.
What is the time complexity for reversing a linked list?
23
30 sec
Q.
In what order are the nodes visited in a preorder traversal of a binary search tree?
24
30 sec
Q.
In what order are the nodes visited in an inorder traversal of a binary search tree?
25
30 sec
Q.
In what order are the nodes visited in a postorder traversal of a binary search tree?
26
30 sec
Q.
Suppose you have a binary search tree with the following elements: 10, 5, 15, 3, 8, 13, 18. What would be the result of a preorder traversal of this tree?
27
30 sec
Q.
Suppose you have a binary search tree with the following elements: 50, 25, 75, 15, 40, 65, 90. What would be the result of an inorder traversal of this tree?
28
30 sec
Q.
Suppose you have a binary search tree with the following elements: 20, 15, 25, 10, 18, 22, 30. What would be the result of a postorder traversal of this tree?
29
30 sec
Q.
Suppose you have a binary search tree with the following elements: 7, 3, 12, 2, 5, 9, 16. What would be the result of a preorder traversal of this tree?
30
30 sec
Q.
Suppose you have a binary search tree with the following elements: 30, 20, 45, 10, 25, 40, 50. What would be the result of an inorder traversal of this tree?
31
30 sec
Q.
Suppose you have a binary search tree with the following elements: 14, 9, 22, 7, 12, 20, 25. What would be the result of a postorder traversal of this tree?
32
30 sec
Q.
Suppose you have a binary search tree with the following elements: 18, 10, 30, 5, 15, 25, 35. What would be the result of a preorder traversal of this tree?