1
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
The Breadth First Search algorithm has been implemented using the queue data
structure. One possible order of visiting the nodes of the following graph is
2
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
The most efficient algorithm for finding the number of connected components in
an undirected graph on n vertices and m edges has time complexity
3
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
Which of the following sorting algorithms has the lowest worst-case complexity?
4
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
Consider the DAG with $$V = \{1,2,3,4,5,6\}$$, shown below.
Which of the following is NOT a topological ordering?
Which of the following is NOT a topological ordering? Questions Asked from Marks 1
GATE CSE 2025 Set 1 (1) GATE CSE 2024 Set 2 (1) GATE CSE 2021 Set 1 (1) GATE CSE 2019 (1) GATE CSE 2016 Set 2 (1) GATE CSE 2016 Set 1 (1) GATE CSE 2015 Set 3 (1) GATE CSE 2015 Set 2 (1) GATE CSE 2015 Set 1 (1) GATE CSE 2014 Set 2 (1) GATE CSE 2011 (1) GATE CSE 2009 (1) GATE CSE 2008 (2) GATE CSE 2007 (2) GATE CSE 2006 (3) GATE CSE 2004 (1) GATE CSE 2003 (1) GATE CSE 2001 (1) GATE CSE 1999 (2) GATE CSE 1998 (1) GATE CSE 1997 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization