Question 1

Which of the following is a linear data structure?

Accepted Answer

Array

Answer

Stack

Answer

Hash Table

Answer

Binary Tree

Question 2

Which of the following is a non-linear data structure?

Accepted Answer

Binary Tree

Answer

Linked List

Answer

Queue

Answer

Array

Question 3

Which of the following memory allocation is performed at compile-time?

Accepted Answer

Static Memory Allocation

Answer

Heap Memory Allocation

Answer

Dynamic Memory Allocation

Answer

Garbage Collection

Question 4

Which of the following memory allocation is performed at runtime?

Accepted Answer

Dynamic Memory Allocation

Answer

Heap Memory Allocation

Answer

Static Memory Allocation

Answer

Stack Memory Allocation

Question 5

Which of the following is an example of a static data structure?

Accepted Answer

Array

Answer

Hash Map

Answer

Linked List

Answer

Stack

Question 6

Which of the following is an example of a dynamic data structure?

Accepted Answer

Linked List

Answer

Queue

Answer

Hash Table

Answer

Array

Question 7

Which of the following is not a linear data structure?

Accepted Answer

Binary Tree

Answer

Linked List

Answer

Array

Answer

Stack

Question 8

Which of the following is a static memory allocation?

Accepted Answer

Global Variables

Answer

Malloc Function

Answer

Dynamic Memory Allocation

Answer

Stack Memory Allocation

Question 9

Which of the following is a dynamic memory allocation?

Accepted Answer

Malloc Function

Answer

Static Memory Allocation

Answer

Global Variables

Answer

Heap Memory Allocation

Question 10

Which of the following is an example of a non-linear data structure?

Accepted Answer

Graph

Answer

Stack

Answer

Queue

Answer

Heap

Question 11

In a linked list, which operation is used to insert a node at the beginning?

Accepted Answer

Insertion at the beginning

Answer

Deletion at the beginning

Answer

Insertion at the end

Answer

Insertion at a specific position

Question 12

In a linked list, which operation is used to delete the last node?

Accepted Answer

Deletion at the end

Answer

Insertion at the end

Answer

Deletion at the beginning

Answer

Deletion at a specific position

Question 13

In a linked list, which operation is used to insert a node at a specific position?

Accepted Answer

Insertion at a specific position

Answer

Deletion at a specific position

Answer

Insertion at the end

Answer

Insertion at the beginning

Question 14

In a linked list, which operation is used to delete a node at a specific position?

Accepted Answer

Deletion at a specific position

Answer

Deletion at the beginning

Answer

Insertion at a specific position

Answer

Deletion at the end

Question 15

In a linked list, which operation is used to delete a node with a specific value?

Accepted Answer

Deletion by value

Answer

Deletion at the beginning

Answer

Deletion at the end

Answer

Insertion at a specific position

Question 16

In a linked list, which operation is used to find the length of the list?

Accepted Answer

Traversal

Answer

Deletion at the end

Answer

Insertion at the beginning

Answer

Deletion at a specific position

Question 17

What steps are needed to insert a value at the beginning of a linked list?

Accepted Answer

Create a new node, assign the value to the new node, point the next pointer of the new node to the current head node, update the head pointer to point to the new node

Answer

Create a new node, assign the value to the new node, point the next pointer of the new node to NULL, update the head pointer to point to the new node

Answer

Traverse the entire linked list to find the last node, create a new node after the last node, assign the value to the new node, point the next pointer of the last node to the new node

Answer

Create a new node, assign the value to the new node, point the next pointer of the new node to NULL, point the next pointer of the last node to the new node

Question 18

What steps are needed to insert a value at the end of a linked list?

Accepted Answer

Create a new node, assign the value to the new node, point the next pointer of the last node to the new node, update the last pointer to point to the new node

Answer

Create a new node, assign the value to the new node, point the next pointer of the new node to NULL, update the last pointer to point to the new node

Answer

Traverse the entire linked list to find the last node, create a new node after the last node, assign the value to the new node, point the next pointer of the last node to the new node

Answer

Create a new node, assign the value to the new node, point the next pointer of the new node to NULL, point the next pointer of the last node to the new node

Question 19

What steps are needed to insert a value at a specific position in a linked list?

Accepted Answer

Traverse the linked list to find the node before the desired position, create a new node, assign the value to the new node, point the next pointer of the new node to the next node of the previous node, point the next pointer of the previous node to the new node

Answer

Create a new node, assign the value to the new node, point the next pointer of the new node to the next node of the previous node, update the head pointer to point to the new node

Answer

Traverse the linked list to find the node after the desired position, create a new node, assign the value to the new node, point the next pointer of the new node to the next node of the previous node, point the next pointer of the previous node to the new node

Answer

Traverse the linked list to find the desired position, create a new node, assign the value to the new node, point the next pointer of the new node to NULL, point the next pointer of the previous node to the new node

Question 20

What steps are needed to delete a node from a linked list?

Accepted Answer

Traverse the linked list to find the node to be deleted, link the previous node to the next node of the node to be deleted, free the memory occupied by the node to be deleted

Answer

Create a new node, assign the value to the new node, point the next pointer of the new node to the next node of the previous node

Answer

Traverse the linked list to find the node after the node to be deleted, link the previous node to the next node of the node to be deleted, free the memory occupied by the node to be deleted

Answer

Create a new node, assign the value to the new node, point the next pointer of the new node to NULL, link the previous node to the new node

Question 21

What is the time complexity for deleting a node from a linked list?

Accepted Answer

O(n)

Answer

O(log n)

Answer

O(n^2)

Answer

O(1)

Question 22

What is the time complexity for searching an element in a linked list?

Accepted Answer

O(n)

Answer

O(n^2)

Answer

O(log n)

Answer

O(1)

Question 23

What is the time complexity for reversing a linked list?

Accepted Answer

O(n)

Answer

O(log n)

Answer

O(1)

Answer

O(n^2)

Question 24

In what order are the nodes visited in a preorder traversal of a binary search tree?

Accepted Answer

Root, Left, Right

Answer

Left, Root, Right

Answer

Right, Left, Root

Answer

Root, Right, Left

Question 25

In what order are the nodes visited in an inorder traversal of a binary search tree?

Accepted Answer

Left, Root, Right

Answer

Root, Left, Right

Answer

Right, Left, Root

Answer

Right, Root, Left

Question 26

In what order are the nodes visited in a postorder traversal of a binary search tree?

Accepted Answer

Left, Right, Root

Answer

Root, Right, Left

Answer

Root, Left, Right

Answer

Right, Left, Root

Question 27

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?

Accepted Answer

10, 5, 3, 8, 15, 13, 18

Answer

3, 5, 8, 10, 13, 15, 18

Answer

18, 13, 15, 8, 3, 5, 10

Answer

5, 3, 8, 10, 13, 15, 18

Question 28

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?

Accepted Answer

15, 25, 40, 50, 65, 75, 90

Answer

90, 65, 75, 50, 40, 25, 15

Answer

15, 40, 25, 75, 65, 90, 50

Answer

25, 40, 50, 65, 75, 90, 15

Question 29

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?

Accepted Answer

10, 18, 15, 22, 30, 25, 20

Answer

20, 25, 30, 22, 18, 15, 10

Answer

10, 15, 18, 22, 25, 30, 20

Answer

30, 22, 25, 20, 18, 15, 10

Question 30

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?

Accepted Answer

7, 3, 2, 5, 12, 9, 16

Answer

12, 9, 2, 3, 5, 7, 16

Answer

16, 9, 12, 5, 2, 3, 7

Answer

3, 2, 5, 7, 9, 12, 16

Question 31

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?

Accepted Answer

10, 20, 25, 30, 40, 45, 50

Answer

30, 20, 25, 40, 45, 50, 10

Answer

50, 45, 40, 30, 25, 20, 10

Answer

25, 20, 40, 10, 45, 30, 50

Question 32

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?

Accepted Answer

7, 12, 9, 20, 25, 22, 14

Answer

9, 12, 7, 20, 25, 22, 14

Answer

14, 22, 25, 20, 12, 9, 7

Answer

25, 20, 22, 14, 9, 12, 7

Question 33

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?

Accepted Answer

18, 10, 5, 15, 30, 25, 35

Answer

35, 25, 30, 15, 5, 10, 18

Answer

10, 5, 18, 15, 25, 30, 35

Answer

5, 10, 15, 18, 25, 30, 35

Related quizzes

Related quizzes