ExamSIDE (Powered by ExamGOAL)
Questions
NEXT
1
GATE CSE 2025 Set 2
MCQ (More than One Correct Answer)
+1
-0

Which of the following statements regarding Breadth First Search (BFS) and Depth First Search (DFS) on an undirected simple graph G is/are TRUE?

A
A DFS tree of $G$ is a Shortest Path tree of $G$.
B
Every non-tree edge of $G$ with respect to a DFS tree is a forward/back edge.
C
If $(u, v)$ is a non-tree edge of $G$ with respect to a BFS tree, then the distances from the source vertex $s$ to $u$ and $v$ in the BFS tree are within $\pm 1$ of each other.
D
Both BFS and DFS can be used to find the connected components of $G$.
2
GATE CSE 2021 Set 1
Numerical
+1
-0

Consider the following undirected graph with edge weights as shown:

GATE CSE 2021 Set 1 Data Structures - Graphs Question 5 English
The number of minimum-weight spanning trees of the graph is ______

Your input ____
3
GATE CSE 2016 Set 1
Numerical
+1
-0
Consider the following directed graph: GATE CSE 2016 Set 1 Data Structures - Graphs Question 11 English

The number of different topological orderings of the vertices of the graph is ________________.

Your input ____
4
GATE CSE 2016 Set 2
Numerical
+1
-0
Breadth First Search $$(BFS)$$ is started on a binary tree beginning from the root vertex. There is a vertex $$t$$ at a distance four from the root. If t is the $$n$$-th vertex in this $$BFS$$ traversal, then the maximum possible value of $$n$$ is ___________.
Your input ____
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 Dynamic Programming P and NP Concepts
Digital Logic
K Maps Boolean Algebra Combinational Circuits Number Systems 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 AdvancedWB JEEBITSATMHT CETKCETCOMEDKVITEEEAP EAPCETTS EAMCET
Medical
NEETAIIMS
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