Question
Download Solution PDFA flow graph F with entry node (1) and exit node (11) is shown below:
How many nodes are there in the longest independent path?
Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFConcept
A linearly independent path is any path that introduces at least one new edge that is not included in any other linearly independent path.
Data
From the graph shown above, following are possible independent paths.
Path 1: 1-11
Path 2: 1-2-3-4-5-10-1-11
Path 3: 1-(2,3)-6-8-9-10-1-11
Path 4: 1-(2,3)-6-7-9-10-1-11
Each of the above path introduces a new edge. And Path 3 and Path 4 are longest independent paths with 8 nodes.
Note that, a path like 1-(2,3)-4-5-10-1-2-3-6-8-9-10-1-11 is not an independent path because it includes already specified edges and doesn’t exclusively add new edges.Last updated on Jun 12, 2025
-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.
-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.
-> The exam is conducted bi-annually - in June and December cycles.
-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions.
-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.