Computer Science · Graph Theory
Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R. Assertion A: Topological sorting is strictly limited to Directed Acyclic Graphs (DAGs), making it impossible to establish such an ordering for any graph containing cycles. Reason R: A topological ordering requires a linear sequence where for every directed edge u → v, vertex u strictly comes before v, a precedence condition that cannot be satisfied if a cycle exists. In the light of the above statements, choose the most appropriate answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Both A and R are correct but R is NOT the correct explanation of A
- 2Both A and R are correct and R is the correct explanation of A✓
- 3A is correct but R is not correct
- 4A is not correct but R is correct
Correct answer
Both A and R are correct and R is the correct explanation of A
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Graph Theory MCQs →Want more practice questions on Graph Theory?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Graph Theory