Question
Which algorithm is best suited for finding a Hamiltonian
cycle in an undirected graph?   ÂSolution
Backtracking is a general algorithmic technique used for solving problems incrementally, such as finding a Hamiltonian cycle, where a solution is built step-by-step. Backtracking tries all possibilities and retreats when a solution is not feasible, making it ideal for problems like Hamiltonian cycles that require exhaustive search with constraints. Why Other Options are Wrong: a) DFS can traverse a graph but is not designed to find Hamiltonian cycles. b) Bellman-Ford is used for finding shortest paths, not cycles. d) Kruskal’s Algorithm is for Minimum Spanning Trees, not Hamiltonian cycles. e) Floyd-Warshall is for finding shortest paths between all pairs of nodes.
In the given Figure, Find  angle BCD. If AB is a diameter & AB is parallel to CD.
What will be circumradius of a right angle triangle whose base is 20cm & height is 21cm ?
If y = 5x + c passes through point A(5, 2), what is the value of c?
...If in a right angle triangle ABC, Angle B is a right angle. AB = 8 cm, BC= 15cm if BD is perpendicular to AC find the length of BD?Â
The perimeter of a rectangle is 100 m, and its diagonal is 41 m. Find the area of the rectangle.
Find the area of triangle having sides 20 m, 21 m, and 29 m.
The radius of a circle is 25 cm, and the length of the chord is 14 cm. Find the distance between the chord and the centre of the circle. Â
The length of the each side of an equilateral triangle is 28√3. The area of incircle, (cm 2 ) is
The ratio of curved surface area of a right circular cylinder to the total area of its two bases is 2 : 1. If the total surface area of cylinder is 2310...
