CUET PG 2021 — Computer PYQ

Q: How do I solve CUET PG 2021 Computer questions?

Practice CUET PG 2021 Computer previous year questions with step-by-step solutions on Mathem Solvex. Each question includes a detailed explanation and video solution to help you master the concept quickly.

Q: What is the difficulty level of CUET PG Computer questions?

CUET PG Computer questions range from moderate to advanced difficulty. Consistent practice with official previous year papers and topic-wise drills on Mathem Solvex is the most effective preparation strategy.

Q: Are CUET PG previous year papers available for free?

Yes. Mathem Solvex provides free access to CUET PG previous year question papers and topic-wise PDFs. You can download them or attempt them as timed live mock tests directly on the platform.

Question

CUET PG 2021 — Computer PYQ

CUET PG | Computer | 2021

Which of the following ways can be used to represent a graph?

Choose the correct answer:

Explanation

Maana ki hamare paas ek Graph $G = (V, E)$ hai, jahan $V$ vertices (nodes) ka set hai aur $E$ edges ka set hai.

1. Adjacency Matrix

Yeh ek 2D array hota hai jiska size $V \times V$ hota hai. Agar vertex $i$ aur $j$ ke beech edge hai, toh value $1$ hoti hai, warna $0$ .

A[i][j] = \begin{cases} 1 & \text{if edge } (i, j) \text{ exists} \\ 0 & \text{otherwise} \end{cases}

2. Adjacency List

Isme har vertex ke liye ek list (ya linked list) hoti hai jo usse jude saare padosi (neighbors) nodes ko store karti hai.

\text{Adj}[u] = \{ v \in V \mid (u, v) \in E \}

3. Incidence Matrix

Yeh ek 2D array hota hai jiska size $V \times E$ hota hai. Yeh dikhata hai ki kaunsa edge kis vertex se juda hai.

I[v][e] = \begin{cases} 1 & \text{if edge } e \text{ is incident on vertex } v \\ 0 & \text{otherwise} \end{cases}