ExamSIDE (Powered by ExamGOAL)
Questions
PREVIOUS NEXT
1
GATE CSE 2020
Numerical
+2
-0
Graph G is obtained by adding vertex s to K3,4 and making s adjacent to every vertex of K3,4. The minimum number of colours required to edge-colour G is _____.
Your input ____
2
GATE CSE 2019
MCQ (Single Correct Answer)
+2
-0.67

Let G be any connected, weighted, undirected graph.

I. G has a unique minimum spanning tree, if no two edges of G have the same weight.

II. G has a unique minimum spanning tree, if, for every cut of G, there is a unique minimum-weight edge crossing the cut.

Which of the above two statements is/are TRUE?

A

I only

B

II only

C

Both I and II

D

Neither I nor II

3
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+2
-0.6
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $$n$$ vertices, $$n$$ is
A
A multiple of $$4$$
B
Even
C
Odd
D
Congruent to $$0$$ $$mod$$ $$4$$, or, $$1$$ $$mod$$ $$4.$$
4
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+2
-0.6
In a connected graph, bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?
A
A tree has no bridges
B
A bridge cannot be part of a simple cycle
C
Every edge of a clique with size $$ \ge 3$$ is a bridge (A clique is any complete sub-graph of a graph )
D
A graph with bridges cannot have a cycle
PREVIOUS NEXT
GATE CSE Subjects
Theory of Computation
Finite Automata and Regular Language Push Down Automata and Context Free Language Undecidability Recursively Enumerable Language and Turing Machine
Operating Systems
Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection
Algorithms
Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method P and NP Concepts Dynamic Programming
Digital Logic
Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits
Database Management System
Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing
Data Structures
Arrays Stacks and Queues Linked List Trees Graphs Hashing
Computer Networks
Concepts of Layering Data Link Layer and Switching Network Layer Application Layer Protocol Routing Algorithm TCP UDP Sockets and Congestion Control Lan Technologies and Wi-Fi Network Security
Software Engineering
Software Engineering
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Web Technologies
Web Technologies
General Aptitude
Verbal Ability Logical Reasoning Numerical Ability
Discrete Mathematics
Set Theory & Algebra Linear Algebra Graph Theory Combinatorics Mathematical Logic Probability Calculus
Programming Languages
Basic of Programming Language Function and Recursion Pointer and Structure in C
Computer Organization
Computer Arithmetic Pipelining Machine Instructions and Addressing Modes Memory Interfacing IO Interface Alu Data Path and Control Unit Secondary Memory
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedMHT CETBITSATCOMEDKWB JEEKCETVITEEEAP EAPCETTS EAMCETIAT (IISER)
Medical
NEETAIIMSMHT CET (Biology)
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12