MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -A circuit is path that begins and ends at the same vertex. A circuit that doesn’t repeat vertices is called a cycle. A graph is said to be connected if any two of its vertices are joined by a path. A graph that is not connected is a disconnected graph.

Detailed explanation-2: -A Hamilton Circuit is a Hamilton Path that begins and ends at the same vertex. *Unlike Euler Paths and Circuits, there is no trick to tell if a graph has a Hamilton Path or Circuit. A Complete Graph is a graph where every pair of vertices is joined by an edge.

Detailed explanation-3: -This Euler path travels every edge once and only once and starts and ends at different vertices. This graph cannot have an Euler circuit since no Euler path can start and end at the same vertex without crossing over at least one edge more than once.

Detailed explanation-4: -A path that begins and ends at the same vertex without traversing any edge more than once is called a circuit, or a closed path. A circuit that follows each edge exactly once while visiting every vertex is known as an Eulerian circuit, and the graph is called an Eulerian graph.

Detailed explanation-5: -Statement II: Any figure which starts and ends in the same point is called a closed figure.