ExamSIDE (Powered by ExamGOAL)
Questions
PREVIOUS
1
GATE CSE 2000
MCQ (Single Correct Answer)
+2
-0.6
Let G be an undirected connected graph with distinct edge weight. Let emax be the edge with maximum weight and emin the edge with minimum weight. Which of the following statements is false?
A
Every minimum spanning tree of G must contain emin
B
If emax is in a minimum spanning tree, then its removal must disconnect G
C
No minimum spanning tree contains emax
D
G has a unique minimum spanning tree
2
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 _______.
3
GATE CSE 1991
MCQ (More than One Correct Answer)
+2
-0.6
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:
A
$$O(n^{2})$$
B
O(mn)
C
$$O(m^2)$$
D
$$O(m \log n)$$
4
GATE CSE 1991
Numerical
+2
-0
The weighted external path length of the binary tree in figure is ___________. GATE CSE 1991 Algorithms - Greedy Method Question 12 English
Your input ____
PREVIOUS
GATE CSE Subjects
Discrete Mathematics
Graph Theory Set Theory & Algebra Combinatorics Mathematical Logic Probability Linear Algebra Calculus
Programming Languages
Basic of Programming Language Function and Recursion Pointer and Structure in C
Theory of Computation
Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine
Operating Systems
Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection
Digital Logic
K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits
Computer Organization
Computer Arithmetic Memory Interfacing Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory
Database Management System
Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing
Data Structures
Trees Hashing Arrays Linked List Graphs Stacks and Queues
Computer Networks
Concepts of Layering Lan Technologies and Wi-Fi Data Link Layer and Switching Network Layer Routing Algorithm TCP UDP Sockets and Congestion Control Application Layer Protocol Network Security
Algorithms
Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method P and NP Concepts Dynamic Programming
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Software Engineering
Software Engineering
Web Technologies
Web Technologies
General Aptitude
Numerical Ability Verbal Ability
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSATMHT CETKCETCOMEDKVITEEE
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12