Data Structures & Algorithms for Competitive Exam Prep

Data Structures & Algorithms

Q. Which of the following is a valid operation for a queue?

A. Push
B. Pop
C. Enqueue
D. Dequeue

Solution

In a queue, the operation to add an element is called 'enqueue', while 'dequeue' is used to remove an element.

Correct Answer: C — Enqueue

Learn More →

Q. Which of the following is a valid operation for a stack?

A. Enqueue
B. Dequeue
C. Push
D. Insert

Solution

Push is a valid operation for a stack, allowing you to add an element to the top of the stack.

Correct Answer: C — Push

Learn More →

Q. Which of the following is a valid property of AVL trees?

A. The height difference between left and right subtrees can be at most 2.
B. Every node must be black.
C. The height difference between left and right subtrees can be at most 1.
D. All leaves are red.

Solution

In AVL trees, the height difference between left and right subtrees can be at most 1.

Correct Answer: C — The height difference between left and right subtrees can be at most 1.

Learn More →

Q. Which of the following is a valid property of Red-Black trees?

A. The height of the tree is always even
B. No two red nodes can be adjacent
C. All nodes must have two children
D. The root can be red

Solution

In Red-Black trees, no two red nodes can be adjacent, which helps maintain balance and ensures that the tree does not become skewed.

Correct Answer: B — No two red nodes can be adjacent

Learn More →

Q. Which of the following is a valid sequence of colors for a Red-Black tree?

A. Red, Red, Black
B. Black, Red, Black
C. Red, Black, Red
D. Black, Black, Red

Solution

The sequence Black, Red, Black is valid as it adheres to the Red-Black tree properties.

Correct Answer: B — Black, Red, Black

Learn More →

Q. Which of the following is a valid use case for a stack?

A. Undo functionality in applications
B. Managing print jobs
C. Handling requests in a web server
D. All of the above

Solution

A stack is commonly used for undo functionality in applications.

Correct Answer: A — Undo functionality in applications

Learn More →

Q. Which of the following is a valid way to append an element to a linked list in Python?

A. list.append(value)
B. linked_list.add(value)
C. linked_list.append(value)
D. list.add(value)

Solution

In Python, a linked list typically has an append method defined, so linked_list.append(value) is correct.

Correct Answer: C — linked_list.append(value)

Learn More →

Q. Which of the following is a valid way to implement a binary tree in C++?

A. Using an array
B. Using a linked list
C. Using a struct
D. All of the above

Solution

A binary tree can be implemented using an array, a linked list, or a struct in C++. Each method has its own advantages and use cases.

Correct Answer: D — All of the above

Learn More →

Q. Which of the following is a valid way to implement a binary tree in Python?

A. Using a list
B. Using a dictionary
C. Using a class
D. All of the above

Solution

A binary tree can be implemented using various data structures in Python, including lists, dictionaries, and custom classes.

Correct Answer: D — All of the above

Learn More →

Q. Which of the following is a valid way to implement a binary tree node in C++?

A. struct Node { int data; Node* left; Node* right; };
B. class Node { int data; Node left; Node right; };
C. struct Node { int data; Node left; Node right; };
D. class Node { public: int data; Node* left; Node* right; };

Solution

The correct implementation uses pointers for left and right children, and the class should have public access for the members.

Correct Answer: D — class Node { public: int data; Node* left; Node* right; };

Learn More →

Q. Which of the following is a valid way to implement a binary tree node in Python?

A. class Node: def __init__(self, value): self.value = value
B. class Node: def __init__(self, value): self.value = value; self.left = None; self.right = None
C. class Node: def __init__(self): self.value = None
D. class Node: def __init__(self, value): self.left = None; self.right = None

Solution

A valid binary tree node implementation includes left and right pointers, allowing for the structure of a binary tree.

Correct Answer: B — class Node: def __init__(self, value): self.value = value; self.left = None; self.right = None

Learn More →

Q. Which of the following is a valid way to represent a binary tree node in C++?

A. struct Node { int data; Node* left; Node* right; };
B. class Node { int data; Node* left; Node* right; };
C. struct Node { int data; Node left; Node right; };
D. class Node { int data; Node left; Node right; };

Solution

The correct representation of a binary tree node in C++ is using a struct with pointers to the left and right children.

Correct Answer: A — struct Node { int data; Node* left; Node* right; };

Learn More →

Q. Which of the following is an application of a queue?

A. Undo functionality in text editors
B. Breadth-first search in graphs
C. Expression evaluation
D. Memory management

Solution

Queues are used in breadth-first search algorithms for traversing graphs, as they process nodes in the order they are discovered.

Correct Answer: B — Breadth-first search in graphs

Learn More →

Q. Which of the following is an application of Dijkstra's algorithm?

A. Finding the shortest route in GPS navigation
B. Sorting a list of numbers
C. Searching for an element in a binary search tree
D. Calculating the factorial of a number

Solution

Dijkstra's algorithm is commonly used in GPS navigation systems to find the shortest route between locations.

Correct Answer: A — Finding the shortest route in GPS navigation

Learn More →

Q. Which of the following is an application of queues?

A. Undo functionality in text editors
B. Breadth-first search in graphs
C. Expression evaluation
D. Memory management

Solution

Queues are used in breadth-first search algorithms for traversing graphs, as they follow the FIFO (First In, First Out) principle.

Correct Answer: B — Breadth-first search in graphs

Learn More →

Q. Which of the following is NOT a case study where Dijkstra's algorithm is commonly applied?

A. GPS navigation systems
B. Network routing protocols
C. Social network analysis
D. Flight scheduling systems

Solution

Dijkstra's algorithm is not commonly applied in social network analysis, as it is primarily used for shortest path problems in weighted graphs.

Correct Answer: C — Social network analysis

Learn More →

Q. Which of the following is NOT a characteristic of a binary search tree (BST)?

A. Left subtree contains only nodes with values less than the parent node.
B. Right subtree contains only nodes with values greater than the parent node.
C. Both subtrees must be binary trees.
D. All nodes must have two children.

Solution

A binary search tree does not require all nodes to have two children; it can have zero, one, or two children.

Correct Answer: D — All nodes must have two children.

Learn More →

Q. Which of the following is NOT a characteristic of a binary search tree?

A. Left subtree contains only nodes with values less than the root.
B. Right subtree contains only nodes with values greater than the root.
C. Both subtrees must be binary search trees.
D. All nodes must have two children.

Solution

In a binary search tree, it is not necessary for all nodes to have two children; some nodes can have one or no children.

Correct Answer: D — All nodes must have two children.

Learn More →

Q. Which of the following is NOT a characteristic of a binary tree?

A. Each node has at most two children
B. It can be empty
C. All nodes have the same number of children
D. It has a root node

Solution

In a binary tree, not all nodes have to have the same number of children; some can have zero, one, or two children.

Correct Answer: C — All nodes have the same number of children

Learn More →

Q. Which of the following is NOT a characteristic of a stack?

A. LIFO order
B. Dynamic size
C. Random access
D. Push and pop operations

Solution

Stacks operate in a Last In First Out (LIFO) manner and do not allow random access; elements can only be accessed in the order they were added.

Correct Answer: C — Random access

Learn More →

Q. Which of the following is NOT a characteristic of arrays?

A. Fixed size
B. Random access
C. Dynamic resizing
D. Contiguous memory allocation

Solution

Arrays have a fixed size and do not support dynamic resizing; this is a characteristic of linked lists.

Correct Answer: C — Dynamic resizing

Learn More →

Q. Which of the following is NOT a characteristic of AVL trees?

A. They are height-balanced
B. They can have at most one child
C. They require rotations to maintain balance
D. They can be used to implement priority queues

Solution

AVL trees can have multiple children; they are binary trees, and the characteristic that they can have at most one child is incorrect.

Correct Answer: B — They can have at most one child

Learn More →

Q. Which of the following is NOT a characteristic of BFS?

A. Uses a queue
B. Finds the shortest path in unweighted graphs
C. Can be implemented using recursion
D. Explores all neighbors before going deeper

Solution

BFS is typically implemented using a queue, not recursion, which is a characteristic of DFS.

Correct Answer: C — Can be implemented using recursion

Learn More →

Q. Which of the following is NOT a characteristic of binary search?

A. It requires a sorted array
B. It can be implemented recursively
C. It can be implemented iteratively
D. It works on unsorted data

Solution

Binary search does not work on unsorted data; it requires the data to be sorted.

Correct Answer: D — It works on unsorted data

Learn More →

Q. Which of the following is NOT a characteristic of Depth-First Search?

A. Uses a stack
B. Can be implemented recursively
C. Finds the shortest path
D. Explores as far as possible along each branch

Solution

DFS does not guarantee the shortest path; it explores as far as possible along each branch before backtracking.

Correct Answer: C — Finds the shortest path

Learn More →

Q. Which of the following is NOT a characteristic of DFS?

A. Uses a stack data structure
B. Can be implemented recursively
C. Explores all neighbors before going deeper
D. Can find connected components

Solution

DFS explores as far as possible along each branch before backtracking, which means it does not explore all neighbors before going deeper.

Correct Answer: C — Explores all neighbors before going deeper

Learn More →

Q. Which of the following is NOT a characteristic of Dijkstra's algorithm?

A. It uses a greedy approach
B. It guarantees the shortest path
C. It can be used for negative weights
D. It requires a priority queue

Solution

Dijkstra's algorithm cannot be used for graphs with negative weights, which is a key characteristic.

Correct Answer: C — It can be used for negative weights

Learn More →

Q. Which of the following is NOT a characteristic of dynamic programming?

A. Optimal substructure
B. Greedy choice property
C. Overlapping subproblems
D. Memoization

Solution

The greedy choice property is not a characteristic of dynamic programming; it is associated with greedy algorithms, which make local optimal choices.

Correct Answer: B — Greedy choice property

Learn More →

Q. Which of the following is NOT a characteristic of problems suitable for dynamic programming?

A. Optimal substructure
B. Overlapping subproblems
C. Greedy choice property
D. All of the above

Solution

The greedy choice property is not a characteristic of problems suitable for dynamic programming; it is a characteristic of greedy algorithms.

Correct Answer: C — Greedy choice property

Learn More →

Q. Which of the following is NOT a characteristic of Quick Sort?

A. In-place sorting
B. Recursive algorithm
C. Stable sorting
D. Divide-and-conquer

Solution

Quick Sort is not a stable sorting algorithm, meaning it does not guarantee the relative order of equal elements.

Correct Answer: C — Stable sorting

Learn More →

Showing 1321 to 1350 of 1622 (55 Pages)

Data Structures & Algorithms

On a scale of 0–10, how likely are you to recommend The Soulshift Academy?