WorksheetsBTAP
Total questions: 5
Worksheet time: 3mins
Name
Class
Date
1.
Backtracking algorithm is faster than the brute force technique
a)
true
b)
false
2.
A ------------------- is a round trip path along n edges of G that visits every vertex once and return to its starting position.
a)
Minimum Spanning Tree
b)
Travelling Salesman Problem
c)
Multistage Graph
d)
Hamiltonian circuit
3.
The data structure used for Depth First Algorithm is
a)
STACK
b)
QUEUE
c)
BOTH STACK & QUEUE
d)
NONE OF THESE
4.
Which one of the following is an application of the backtracking algorithm?
a)
a) Finding the shortest path
b)
b) Finding the efficient quantity to shop
c)
c) Ludo
d)
d) Crossword
5.
in what manner is a state-space tree for a backtracking algorithm constructed?
a)
a) Depth-first search
b)
b) Breadth-first search
c)
c) Twice around the tree
d)
d) Nearest neighbour first
100 %
