1
GATE CSE 1992
Fill in the Blanks
+2
-0
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edges if the edges are sorted is _______.
2
GATE CSE 1991
MCQ (More than One Correct Answer)
+2
-0
Kruskal’s algorithm for finding a minimum spanning tree of a weighted graph G with n vertices and m edges has the time complexity of:
3
GATE CSE 1991
Numerical
+2
-0
The weighted external path length of the binary tree in figure is ___________.
Your input ____
Questions Asked from Marks 2
GATE CSE 2025 Set 2 (1) GATE CSE 2025 Set 1 (1) GATE CSE 2024 Set 2 (2) GATE CSE 2021 Set 2 (1) GATE CSE 2020 (2) GATE CSE 2018 (2) GATE CSE 2016 Set 1 (2) GATE CSE 2015 Set 2 (1) GATE CSE 2015 Set 1 (1) GATE CSE 2014 Set 2 (2) GATE CSE 2012 (1) GATE CSE 2011 (2) GATE CSE 2010 (2) GATE CSE 2009 (1) GATE CSE 2008 (1) GATE CSE 2007 (4) GATE CSE 2006 (1) GATE CSE 2004 (1) GATE CSE 2003 (3) GATE CSE 2000 (1) GATE CSE 1992 (1) GATE CSE 1991 (2)
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