CS3304 GRADED QUIZ REVIEW: DYNAMIC PROGRAMMING & BACKTRACKING CONCEPTS
QUESTIONS AND ANSWERS | 2026 UPDATE
Started on Wednesday, 15 October 2025, 7:34 PM
State Finished
Completed on Wednesday, 15 October 2025, 7:45 PM
Time taken 10 mins 22 secs
Marks 15.00/1 5.00
Grade 100.00 out of 1 00.00
Question 1
Correct
Mark 1.00 out of 1 .00
The primary structure used in the dynamic programming approach to TSP is:
A2D table with subsets and cities «
Agraph adjacency list
Abinary tree
Astack
The correct answer is: A 2D table with subsets and cities
Question 2
Correct
Mark 1.00 out of 1.00
Which data structure is commonly used to manage recursive calls in backtracking?
Stack v
Queue
@ Linked List
d Heap
The correct answer is: Stack
, Question 3
Correct
Mark 1.00 out of 1.00
What happens if no valid positions exist for a queen in the current row?
The algorithm backtracks to the previous row. «
b, The algorithm terminates.
. The algorithm skips to the next column.
4. The algorithm removes all queens from the board.
The correct answer is: The algorithm backtracks to the previous row.
Question 4
Correct
Mark 1.00 out of 1 .00
How does the backtracking algorithm start solving the 8 Queens problem?
By placing a queen in the first row and first column.
b. By randomly placing a queen on the board.
¢. Byplacingqueensin all rows simultaneously.
d. By checking all columns in the first row.
The correct answer is: By placing a queen in the first rowand first column.
Question 5
Correct
Mark 1.00 out of 1.00
What does the 'bound' in Branch and Bound refer to?
The limit or cost estimation ofa subproblem
b, The number of solutions explored
¢. The time taken to solve the problem
4. The branching factor
The correct answer is: The limit or cost estimation ofa subproblem
QUESTIONS AND ANSWERS | 2026 UPDATE
Started on Wednesday, 15 October 2025, 7:34 PM
State Finished
Completed on Wednesday, 15 October 2025, 7:45 PM
Time taken 10 mins 22 secs
Marks 15.00/1 5.00
Grade 100.00 out of 1 00.00
Question 1
Correct
Mark 1.00 out of 1 .00
The primary structure used in the dynamic programming approach to TSP is:
A2D table with subsets and cities «
Agraph adjacency list
Abinary tree
Astack
The correct answer is: A 2D table with subsets and cities
Question 2
Correct
Mark 1.00 out of 1.00
Which data structure is commonly used to manage recursive calls in backtracking?
Stack v
Queue
@ Linked List
d Heap
The correct answer is: Stack
, Question 3
Correct
Mark 1.00 out of 1.00
What happens if no valid positions exist for a queen in the current row?
The algorithm backtracks to the previous row. «
b, The algorithm terminates.
. The algorithm skips to the next column.
4. The algorithm removes all queens from the board.
The correct answer is: The algorithm backtracks to the previous row.
Question 4
Correct
Mark 1.00 out of 1 .00
How does the backtracking algorithm start solving the 8 Queens problem?
By placing a queen in the first row and first column.
b. By randomly placing a queen on the board.
¢. Byplacingqueensin all rows simultaneously.
d. By checking all columns in the first row.
The correct answer is: By placing a queen in the first rowand first column.
Question 5
Correct
Mark 1.00 out of 1.00
What does the 'bound' in Branch and Bound refer to?
The limit or cost estimation ofa subproblem
b, The number of solutions explored
¢. The time taken to solve the problem
4. The branching factor
The correct answer is: The limit or cost estimation ofa subproblem
