MCQs

Disclaimer:

Educational Use Only:

The website links provided are to be used strictly for educational and knowledge-gaining purposes only.

No Misuse:

Do not misuse the links or the information contained therein for any commercial, illegal, or unethical activities.

Respect for Websites and Businesses:

Respect the intellectual property and business interests of the websites and their owners. Do not attempt to alter, copy, or redistribute content without proper authorization.

Acknowledge Value of Knowledge:

Recognize and value the knowledge and resources shared by these websites. Use the information responsibly and ethically.

No Endorsement:

The provision of these links does not imply endorsement of the linked sites, their content, or their products and services. Users are responsible for evaluating the suitability and accuracy of the information.

User Responsibility:

By accessing these links, you agree to use the information at your own risk and to comply with all applicable laws and website terms of use.

Overall MCQs for Reference

Depth First Search is equivalent to which traversal in binary trees?
a. Pre-order Traversal
b. Post-order Traversal
c. Level-order Traversal
d. In-order Traversal
Answer: asanfoundry
The time complexity of DFS for a graph with vertices (V) and edges (E) is:
a. O(V + E)
b. O(V)
c. O(E)
d. O(V*E)
Answer: asanfoundry
The primary data structure used in implementing DFS is:
a. Stack
b. Queue
c. Linked List
d. Tree
Answer: asanfoundry
DFS explores as far as possible along each branch before:
a. Backtracking
b. Halting
c. Skipping
d. Restarting
Answer: atestbook
DFS can be used to:
a. Detect cycles in graphs
b. Calculate shortest path in unweighted graphs
c. Build a heap
d. Sort arrays
Answer: ainterviewkickstart
In DFS, what is used to keep track of recursion calls?
a. Stack
b. Queue
c. Deque
d. Heap
Answer: ainterviewkickstart
For an adjacency matrix, the tightest upper bound for DFS running time is:
a. O(n^2)
b. O(n)
c. O(log n)
d. O(n^3)
Answer: atestbook
DFS can help in which graph application?
a. Topological sorting
b. Huffman Coding
c. Hashing
d. Dijkstra’s Algorithm
Answer: ainterviewkickstart
Which traversal is NOT depth-first?
a. Inorder
b. Preorder
c. Level order
d. Postorder
Answer: csanfoundry
DFS on an undirected cyclic graph, visiting nodes twice (excluding parents), helps to:
a. Detect cycles
b. Minimize paths
c. Assign weights
d. Color the graph
Answer: ainterviewkickstart
The recursive nature of DFS is due to:
a. Implicit stack
b. Input array
c. Queue structure
d. Priority queue
Answer: ainterviewkickstart
DFS starts at a vertex and explores its:
a. Neighbors recursively
b. Immediate parent
c. Siblings only
d. Leaves only
Answer: ainterviewkickstart
The result of DFS traversal in a graph is affected by:
a. Adjacency list order
b. Graph color
c. Number of leaves
d. Input alphabet
Answer: atestbook
Which is not a valid DFS traversal order for a sample graph with vertices (a–g)?
a. abcghf
b. abfchg
c. abfhgc
d. afghbc
Answer: btestbook+1
The primary application of DFS in AI is:
a. Exploring all solution paths
b. Heuristic optimization
c. Linear regression
d. Shuffling datasets
Answer: ainterviewkickstart
What structure represents graph connections in DFS frequently?
a. Adjacency matrix
b. Circular buffer
c. Min heap
d. Huffman tree
Answer: ascribd
DFS is commonly used in machine learning for:
a. Feature extraction in graphs
b. Batch normalization
c. Activation function customizations
d. Training neural nets
Answer: ainterviewkickstart
Minimum spanning tree algorithms (like Kruskal’s) are typically associated with:
a. Greedy method
b. Stack overflow
c. Divide and conquer
d. Backtracking
Answer: atestbook
Which is NOT a step in DFS?
a. Visiting adjacent node
b. Returning to previous node (backtracking)
c. Visiting only root
d. Marking node as visited
Answer: cinterviewkickstart
To check if there’s a path between two vertices in an undirected graph, which can be used?
a. DFS
b. Huffman encoding
c. Quick sort
d. Merge sort
Answer: ainterviewkickstart
When can DFS NOT guarantee finding the shortest path in an unweighted graph?
a. Always
b. Never
c. Only for even paths
d. Only for DAGs
Answer: ainterviewkickstart
DFS traversal always visits:
a. All reachable nodes from the start node
b. Sorted nodes
c. Smallest value node first
d. Every node twice
Answer: asanfoundry+1
What’s required to avoid infinite loops in DFS on cyclic graphs?
a. Visited node tracker
b. Sorting
c. Reversing edges
d. Coloring
Answer: ainterviewkickstart
DFS is related to which algorithmic paradigm?
a. Backtracking
b. Dynamic programming
c. Hashing
d. Greedy
Answer: atestbook
Which is a valid use of DFS in tree structures?
a. Finding tree’s height
b. Counting array elements
c. Training support vector machines
d. Feature scaling
Answer: asanfoundry+1
In which representation does traversing all adjacency lists take O(V+E) time in DFS?
a. Adjacency list
b. Linked list
c. Deque
d. Set
Answer: asanfoundry
Which search strategy uses a stack for node management?
a. DFS
b. BFS
c. Uniform cost search
d. A* search
Answer: awayground
In graph applications, DFS cannot:
a. Guarantee shortest path
b. Find cycles
c. Traverse all nodes
d. Work recursively
Answer: ainterviewkickstart
Which is not an application of DFS?
a. Sorting arrays
b. Pathfinding
c. Topological sorting
d. Cycle detection
Answer: ainterviewkickstart
Recursion in DFS is similar in effect to using a:
a. Stack
b. Queue
c. Array
d. Binary heap
Answer: asanfoundry+1
DFS is preferred to BFS when:
a. Solution is deep
b. Solution is shallow
c. No cycles are possible
d. We need shortest path
Answer: ainterviewkickstart
Which of the following uses backtracking inherently?
a. DFS
b. Bubble sort
c. BFS
d. Linear search
Answer: atestbook
What happens if DFS visits a node that has already been visited?
a. Ignore node
b. Restart traversal
c. Backtrack and return
d. Skip edge
Answer: ainterviewkickstart
Which structure cannot be used to implement DFS?
a. Queue
b. Stack
c. Recursion
d. Explicit array-based stack
Answer: awayground+1
When DFS is applied to an unweighted, connected, undirected graph, how many edges are in the DFS tree?
a. V-1
b. E
c. 2E
d. V
Answer: asanfoundry+1
To traverse repeated edges only once in DFS, we use:
a. Visited flags
b. Array index
c. Priority queue
d. Edge hash
Answer: ainterviewkickstart
Applications of DFS include all EXCEPT:
a. Encoding data for transmission
b. Maze solving
c. Connected component search
d. Strongly connected components
Answer: asanfoundry+1
DFS on directed acyclic graphs is vital for:
a. Topological sorting
b. Minimum spanning tree
c. Shortest path
d. Compression
Answer: ainterviewkickstart
What is the role of recursion or stack in DFS?
a. To remember previous nodes
b. To color the nodes
c. To reduce space complexity
d. To randomize node order
Answer: ainterviewkickstart
The space complexity of DFS for a binary tree of height h is:
a. O(h)
b. O(n)
c. O(log n)
d. O(1)
Answer: ainterviewkickstart
Which graph class always allows returning to the starting vertex as per DFS traversal?
a. Cyclic graph
b. Acyclic graph
c. Tree
d. Weighted graph
Answer: ainterviewkickstart
Select which statement is TRUE regarding DFS:
a. Can be implemented recursively or with a stack
b. Always finds the least cost path
c. Is memory-intensive compared to BFS
d. Can only be used on tree structures
Answer: ainterviewkickstart
Which traversal order does DFS NOT necessarily produce?
a. Level-order
b. Pre-order
c. Post-order
d. In-order
Answer: asanfoundry+1
What should you avoid in DFS to prevent stack overflow?
a. Infinite cycles
b. Using adjacency list
c. Using arrays
d. Unweighted graphs
Answer: ainterviewkickstart
DFS is likely to find a goal node quickly if:
a. Goal is deep in the tree
b. Goal is near the start node
c. Graph is unweighted
d. No cycles exist
Answer: ainterviewkickstart
Which scenario is DFS NOT ideal for?
a. Finding all paths
b. Finding shortest path in unweighted graph
c. Path existence checking
d. Detecting cycles
Answer: binterviewkickstart
Which is a necessary component for recursive DFS?
a. Base case (termination)
b. Node coloring
c. Leaf counting
d. Heapification
Answer: ainterviewkickstart
When using DFS for connected components in a graph, which is marked for each node?
a. Visited status
b. Weight
c. Key value
d. Traversal time
Answer: asanfoundry+1
DFS is LEAST useful for:
a. Finding strongly connected components
b. Topological sorting
c. Maze traversal
d. Sorting arrays
Answer: dsanfoundry+1
The order that vertices are pushed/popped in the stack/recursion for DFS depends on:
a. Adjacency structure
b. Node weights
c. Graph coloring
d. Edge direction only
Answer: atestbook+1

Blog

Systemethic Technologies

Leave a Reply Cancel reply

Useful links

Other Terms & Policies

Contact Info