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.
- Find the radius of the incircle of an equilateral triangle whose height is given to be 3√3 cm.
The corresponding medians of two similar triangles are 12 cm and 15 cm. If the area of the first triangle is 288 cm, then find the area of the second tr...
A triangle and a parallelogram have the same base 42 cm and the same area. If the height of the parallelogram is 14 cm, then find the length of the alti...
The corresponding medians of two similar triangles are 16 cm and 20 cm. If the area of the first triangle is 288 cm, then find the area of the second tr...
- Determine the perpendicular drawn from a vertex to the opposite side in an equilateral triangle with side length 8√3 cm.
- Determine the inradius of an equilateral triangle if its height is 6√3 cm.
Find the altitude of an equilateral triangle whose side is 8√3 cm.
In a triangle ABC, AD is the altitude from A to BC. If AD = 12 cm, AB = 13 cm, and AC = 14 cm, find the length of BC.
If two triangles EFG and UVW are congruent, then which of the following statement(s) is/are true?
I. EF = UV
II. ∠FEG = ∠UVW
- In triangle DEF, GH is drawn parallel to side EF. If DG = 9 cm, GE = 3 cm and DH = 6 cm, find DF.
