# Week 10 - Graded Assignment 10 > **Course:** Jan 2026 - Mathematics I > Week 10 - Graded Assignment 10 > **Last Submitted:** You have last submitted on: 2026-04-22, 19:07 IST --- ## Introduction [Click here to download the PDF version of the Questions](https://drive.google.com/file/d/1-SkYwhDmGScXJzZ0T5Hn8Blw-HWnL...

Visual strip

Relevant recall pieces for this note

Open gallery

Maths

Sets and relations

Maths Week 1: the start of the relation ladder

Maths

Limit and continuity

Maths Week 3: the spectrum from close to exact

Maths

Derivative chooser

Maths Week 5: rule selection before calculation

Week 10 - Graded Assignment 10

Course: Jan 2026 - Mathematics I

Week 10 - Graded Assignment 10

Last Submitted: You have last submitted on: 2026-04-22, 19:07 IST

Introduction

Click here to download the PDF version of the Questions**

1 MULTIPLE CHOICE QUESTIONS:

** 2 MUTIPLE SELECT QUESTIONS:

** 3 NUMERICAL ANSWER TYPE:

📎 Resource Links

📁 Click here to download the PDF version of the Questions

Question 1

The maximum number of non-zero entries in an adjacency matrix of a simple graph having

n

vertices can be

$\displaystyle{n^2}$
$\displaystyle{\frac{n(n-1)}{2}}$
$\displaystyle{\frac{n(n-1)}{4}}$
$\displaystyle{n(n-1)}$

Status: Yes, the answer is correct. Score: Score: 1

Feedback/Explanation:

\displaystyle{n(n-1)}

Accepted Answers:

\displaystyle{n(n-1)}

Question 2

We have a graph

G

with 6 vertices. We write down the degrees of all vertices in

G

in descending order. Which of the following is a possible listing of the degrees?

$6,5,4,3,2,1$
$5,5,2,2,1,1$
$5,3,3,2,2,1$
$2,1,1,1,1,1$

Feedback/Explanation:

5,3,3,2,2,1

Accepted Answers:

5,3,3,2,2,1

Question 3

We are trying to find the correct path in a maze. We start at the entrance. At some points, we have to choose a direction to explore. If we reach a dead end, we come back to the most recent intersection where we still have an unexplored direction to investigate. What is a good data structure to keep track of the intersections we have visited?

List
Stack
Queue
Array

Status: Yes, the answer is correct. Score: Score: 1

Feedback/Explanation: Stack

Accepted Answers:

Stack

Question 4

Suppose we obtain the following BFS tree rooted at node 1 for an undirected graph with vertices

(1,2,3,4,5,.....14).

Which of the following cannot be an edge in the original graph?

$(8,11)$
$(3,10)$
$(4,5)$
$(6,9)$

Status: Yes, the answer is correct. Score: Score: 1

Feedback/Explanation:

(8,11)

Accepted Answers:

(8,11)

Question 5

Which of the following graphs satisfies the below properties: 1.

|V C(G)|

3

, where

V C(G)

is the minimum vertex cover of a graph

G.

|PM(G)|

3

, where

PM(G)

is the perfect matching of a graph

G.

3. The graph is a 3-colouring.

Feedback/Explanation:

Accepted Answers:

Question 6

Which of the following statements is(are) true?

BFS can be used to identify the vertex which is at the farthest distance from $v$ in any graph, in terms of number of edges, where vertex $v$ is the starting vertex.
BFS and DFS identifies all the vertices reachable from the starting vertex $v.$
BFS cannot be used to check for cycles in the graph while DFS can be used to check for cycles in the graph.
DFS can be used to identify the shortest distance from starting vertex $v$ to every other vertex in the graph, in terms of number of edges.

Status: Yes, the answer is correct. Score: Score: 1

Feedback/Explanation: BFS can be used to identify the vertex which is at the farthest distance from

v

in any graph, in terms of number of edges, where vertex

v

is the starting vertex.

BFS and DFS identifies all the vertices reachable from the starting vertex

v.

Accepted Answers:

BFS can be used to identify the vertex which is at the farthest distance from

v

in any graph, in terms of number of edges, where vertex

v

is the starting vertex.

BFS and DFS identifies all the vertices reachable from the starting vertex

v.

Question 7

If A =

\begin{bmatrix}0 & 1 &0 & 1&0 & 0&0 \\1& 0 &1 & 1&0 & 1&0\\0 & 1 &0 & 0&0 & 0&0 \\1 & 1 &0 & 0&1 & 1&1\\0 & 0 &0 & 1&0 & 0&0\\0 & 1 &0 & 1&0 & 0&0\\0 & 0 &0 & 1&0 & 0&0\end{bmatrix}

represents adjacency matrix of a graph

G,

then the cardinality of the maximum independent set of the graph

G

Your Answer: 3

Feedback/Explanation: (Type: Numeric) 5

Accepted Answers:

(Type: Numeric) 5

Question 8

A company manufactures

10

chemicals

x_1, x_2, x_3, ....x_{10}.

Certain pairs of these chemicals are incompatible and would cause explosions if brought into contact with each other. Below graph shows the incompatibility of the chemicals, each vertex represents the chemical and each edge between a pair of chemicals represents that those two chemicals are incompatible. As a precautionary measure the company wishes to partition its warehouse into compartments, and store incompatible chemicals in different compartments. What is the least number of compartments into which the warehouse should be partitioned?

Your Answer: 3

Status: Yes, the answer is correct. Score: Score: 1

Feedback/Explanation: (Type: Numeric) 3

Accepted Answers:

(Type: Numeric) 3

Question 9

An incomplete undirected graph is given below and the numbering on each vertex denotes the colouring of the graph('

1

' denotes color 1, ‘

2

’ denotes color

2

, and ‘

3

’ denotes color

3

). Find the number of maximum edges that can be added to the given graph such that the colouring is retained and the graph is planar. NOTE: Planar graph is a graph that can be drawn on the plane in such a way that its edges intersect only at their endpoints.

Your Answer: 0

Feedback/Explanation: (Type: Numeric) 6

Accepted Answers:

(Type: Numeric) 6

Document Outline

Table of Contents

System Normal // Awaiting Context

Intelligence Hub

Navigate the knowledge graph to generate context. The Hub adapts dynamically to surface backlinks, related notes, and metadata insights.

Browse Term Schedule →Launch Assessment Engine