GATE & PSUs - Computer Science & Information Technology (CS & IT)

Graph Theory (Coloring, Matching, Eulerian & Hamiltonian) question bank (Discrete Mathematics)

Practice 8 free GATE & PSUs - Computer Science & Information Technology (CS & IT) Discrete Mathematics - Graph Theory (Coloring, Matching, Eulerian & Hamiltonian) questions with answers and step-by-step solutions.

Start free Book a demo
All Hard Medium
Q1.
[Graph Theory (Coloring, Matching, Eulerian & Hamiltonian) Concept 4] A train running at $72\text{ km/h}$ crosses a stationary platform of length $250\text{ m}$ in $26\text{ seconds}$. What is the length of the train?

(A)
$270\text{ m}$
(B)
$200\text{ m}$
(C)
$300\text{ m}$
(D)
$250\text{ m}$
Show answer & solution
Verified Answer & Solution Locked
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view
Q2.
[Graph Theory (Coloring, Matching, Eulerian & Hamiltonian) Concept 8] A train running at $72\text{ km/h}$ crosses a stationary platform of length $250\text{ m}$ in $26\text{ seconds}$. What is the length of the train?

(A)
$270\text{ m}$
(B)
$200\text{ m}$
(C)
$300\text{ m}$
(D)
$250\text{ m}$
Show answer & solution
Verified Answer & Solution Locked
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view
Protected Questions

Unlock All 8 Questions in Graph Theory (Coloring, Matching, Eulerian & Hamiltonian)

Log in or sign up free to access every question with complete solutions, create chapter practice tests, and track your performance.

Sign in to unlock Create free account

Sign up free to access all 8 questions

Unlock every Graph Theory (Coloring, Matching, Eulerian & Hamiltonian) question, generate papers, and practice at your own pace.

Start free