My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Graph Algorithms - Algorithms - Computer Science & Information Technology Previous Year Questions

Practice Graph Algorithms - Algorithms - Computer Science & Information Technology previous year questions organised from real papers, with year-wise coverage and clear topic navigation.

23Papers
13Years
66Questions
1Topics

Graph Algorithms question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Graph Algorithms. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 48 72.7%
Easy 18 27.3%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 30 45.5%
Numerical Answer Type (NAT) 27 40.9%
MSQ 9 13.6%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
66 Qs

Most asked topics

Top topics across the included previous year papers.

Algorithms
66 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Graph Algorithms
66 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

Computer Science and Information Technology (CS) 2026
6 Qs
Computer Science and Information Technology (CS) 2026
2 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
5 Qs
Computer Science & Information Technology (CS) 2016 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
5 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
3 Qs
Computer Science & Information Technology (CS) 2013 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
2 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
1 Qs

Included previous year papers

Newest papers appear first. Sort by year, question coverage or name.

PaperYear / sessionQuestions in this viewOpen
Computer Science and Information Technology (CS) 202620266View paper
Computer Science and Information Technology (CS) 202620262View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20253View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20253View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20243View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20242View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20232View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20223View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20212View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20212View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20204View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20192View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20184View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20172View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20165View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20164View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20145View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20143View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20143View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 2]20132View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20132View paper

All Graph Algorithms previous year questions

Practice every matching question in batches of 20, with every available option.

1
2013 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2013 [Session 1]
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of \(n\) vertices?
Open complete paper
2
2013 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2013 [Session 2]
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of $n$ vertices?
Open complete paper
3
2013 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2013 [Session 2]
The line graph L(G) of a simple graph G is defined as follows: • There is exactly one vertex v(e) in L(G) for each edge e in G. • For any two edges e and e' in G, L(G) has an edge between v(e) and v(e'), if and only if e and e' are incident with the same vertex in G. Which of the following statements is/are TRUE? (P) The line graph of a cycle is a cycle. (Q) The line graph of a clique is a clique. (R) The line graph of a planar graph is planar. (S) The line graph of a tree is a tree.
Open complete paper
4
2013 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2013 [Session 3]

What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?

Open complete paper
5
2013 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2013 [Session 4]
Which of the following statements is/are TRUE for undirected graphs?
P: Number of odd degree vertices is even.
Q: Sum of degrees of all vertices is even.
Open complete paper
6
2014 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2014 [Session 1]
Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time of Depth First Search on G, when G is represented as an adjacency matrix?
Open complete paper
7
2014 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2014 [Session 1]
Consider the directed graph given below. Which one of the following is TRUE?

Question diagram

Open complete paper
8
2014 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2014 [Session 1]
Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i,j): 1 ≤ i ≤ 12, 1 ≤ j ≤ 12}. There is an edge between (a,b) and (c,d) if |a − c| ≤ 1 and |b − d| ≤ 1. The number of edges in this graph is ______.
Open complete paper
9
2014 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2014 [Session 1]
An ordered n-tuple (d₁, d₂, ..., dₙ) with d₁ ≥ d₂ ≥ ... ≥ dₙ is called graphic if there exists a simple undirected graph with n vertices having degrees d₁, d₂, ..., dₙ respectively. Which of the following 6-tuples is NOT graphic?
Open complete paper
10
2014 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2014 [Session 1]
Let G=(V,E) be a directed graph where V is the set of vertices and E the set of edges. Then which one of the following graphs has the same strongly connected components as G?
Open complete paper
11
2014 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2014 [Session 2]
Consider the tree arcs of a BFS traversal from a source node \(w\) in an unweighted, connected, undirected graph. The tree \(T\) formed by the tree arcs is a data structure for computing
Open complete paper
12
2014 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2014 [Session 2]
The number of distinct minimum spanning trees for the weighted graph below is _____

Question diagram

Open complete paper
13
2014 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2014 [Session 2]
The maximum number of edges in a bipartite graph on 12 vertices is _____________.
Open complete paper
14
2014 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2014 [Session 3]
Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible recursion depth (including the initial call) is ______.
Open complete paper
15
2014 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2014 [Session 3]
If \(G\) is a forest with \(n\) vertices and \(k\) connected components, how many edges does \(G\) have?
Open complete paper
16
2014 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2014 [Session 3]
Let \(\delta\) denote the minimum degree of a vertex in a graph. For all planar graphs on \(n\) vertices with \(\delta \ge 3\), which one of the following is TRUE?
Open complete paper
17
2016 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2016 [Session 1]
Consider the following directed graph: [image] The number of different topological orderings of the vertices of the graph is ________.
Open complete paper
18
2016 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2016 [Session 1]
Let \(G\) be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE?
P: Minimum spanning tree of \(G\) does not change
Q: Shortest path between any pair of vertices does not change
Open complete paper
19
2016 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2016 [Session 1]
Consider the weighted undirected graph with 4 vertices, where the weight of edge {i, j} is given by the entry Wij in the matrix W.
W = [ [0, 2, 8, 5], [2, 0, 5, 8], [8, 5, 0, x], [5, 8, x, 0] ]
The largest possible integer value of x, for which at least one shortest path between some pair of vertices will contain the edge with weight x is ______________.
Open complete paper
20
2016 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2016 [Session 1]
Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum weight spanning tree of G can have is ______________.
Open complete paper

Showing 20 of 65 questions