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.

28Papers
18Years
82Questions
1Topics

Graph Algorithms question pattern

Every graph below is calculated only from this selection.

Questions by year

Compare question counts across years.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 58 70.7%
Easy 24 29.3%

Question type distribution

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

MCQ 46 56.1%
Numerical Answer Type (NAT) 27 32.9%
MSQ 9 11%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
82 Qs

Most asked topics

Top topics across the included previous year papers.

Algorithms
82 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Graph Algorithms
82 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
Computer Science & Information Technology (CS) 2011
2 Qs
Computer Science & Information Technology (CS) 2010
3 Qs
Computer Science & Information Technology (CS) 2009
3 Qs
Computer Science & Information Technology (CS) 2008
5 Qs
Computer Science & Information Technology (CS) 2007
3 Qs

Included previous year papers

Newest papers appear first. Search these papers or sort by year and name.

Paper nameYearPDFAttempt
Computer Science and Information Technology (CS) 20262026
6 questions in this view		2026
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science and Information Technology (CS) 20262026
2 questions in this view		2026
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2025 [Session 1]2025
3 questions in this view		2025
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2025 [Session 2]2025
3 questions in this view		2025
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2024 [Session 1]2024
3 questions in this view		2024
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2024 [Session 2]2024
2 questions in this view		2024
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2023 [Session 2]2023
2 questions in this view		2023
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2022 [Session 2]2022
3 questions in this view		2022
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2021 [Session 1]2021
2 questions in this view		2021
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2021 [Session 2]2021
2 questions in this view		2021
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2020 [Session 2]2020
4 questions in this view		2020
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2019 [Session 2]2019
2 questions in this view		2019
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2018 [Session 2]2018
4 questions in this view		2018
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2017 [Session 2]2017
2 questions in this view		2017
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2016 [Session 1]2016
5 questions in this view		2016
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2016 [Session 2]2016
4 questions in this view		2016
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2014 [Session 1]2014
5 questions in this view		2014
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2014 [Session 2]2014
3 questions in this view		2014
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2014 [Session 3]2014
3 questions in this view		2014
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2013 [Session 1]2013
1 questions in this view		2013
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2013 [Session 2]2013
2 questions in this view		2013
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2013 [Session 3]2013
1 questions in this view		2013
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2013 [Session 4]2013
2 questions in this view		2013
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 20112011
2 questions in this view		2011
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 20102010
3 questions in this view		2010
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 20092009
3 questions in this view		2009
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 20082008
5 questions in this view		2008
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 20072007
3 questions in this view		2007
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download

All Graph Algorithms previous year questions

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

1
2007 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2007
Consider the DAG with \( V = \{1,2,3,4,5,6\} \), shown below.
[Image of a DAG]
Which of the following is NOT a topological ordering?

Question diagram

Open complete paper
2
2007 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2007

In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity, by

Open complete paper
3
2007 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2007

Let w be the minimum weight among all edge weights in an undirected connected graph. Let e be a specific edge of weight w. Which of the following is FALSE?

Open complete paper
4
2008 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2008

The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity

Open complete paper
5
2008 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2008

The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes of the following graph is

Question diagram

Open complete paper
6
2008 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2008
Which of the following statements is true for every planar graph on $n$ vertices?
Open complete paper
7
2008 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2008
G is a graph on $n$ vertices and $2n-2$ edges. The edges of G can be partitioned into two edge-disjoint spanning trees. Which of the following is NOT true for G?
Open complete paper
8
2008 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2008
Dijkstra's single source shortest path algorithm when run from vertex $a$ in the above graph, computes the correct shortest path distance to

Question diagram

Open complete paper
9
2009 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2009
What is the chromatic number of an \(n\)-vertex simple connected graph which does not contain any odd length cycle ? Assume \(n \geq 2\).
Open complete paper
10
2009 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2009
Which of the following statement(s) is/are correct regarding Bellman-Ford shortest path algorithm ?
P. Always finds a negative weighted cycle, if one exists.
Q. Finds whether any negative weighted cycle is reachable from the source.
Open complete paper
11
2009 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2009
Consider the following graph :

Which one of the following is NOT the sequence of edges added to the minimum spanning tree using Kruskal's algorithm ?

Question diagram

Open complete paper
12
2010 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2010
Let \(G = (V, E)\) be a graph. Define \(\xi(G) = \sum\limits_d i_d * d\), where \(i_d\) is the number of vertices of degree \(d\) in \(G\). If \(S\) and \(T\) are two different trees with \(\xi(S) = \xi(T)\), then
Open complete paper
13
2010 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2010
What is the minimum possible weight of a spanning tree \(T\) in this graph such that vertex 0 is a leaf node in the tree \(T\)?

Question diagram

Open complete paper
14
2010 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2010
What is the minimum possible weight of a path \(P\) from vertex 1 to vertex 2 in this graph such that \(P\) contains at most 3 edges?
Open complete paper
15
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
16
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
17
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
18
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
19
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
20
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

Showing 20 of 81 questions