GK Question

technology medium fill_blank

A graph with no cycles is called a ________.

Answer: Tree / Acyclic Graph

A connected acyclic graph is a Tree; disconnected acyclic graph is a Forest. Cycles are paths that start and end at same node. Detecting cycles is important in dependency resolution, deadlock prevention, and network analysis. Graph theory fundamentals are tested in SSC JE and programming exams.

Topic Data Structures
Exam Relevance SSC JE, Banking IT, Railway