The following statement describes a specific concept. What is it called? a way of representing a graph using a 2D matrix where each cell indicates whether an edge exists between two vertices.
Difficulty: Medium
About this MCQ
This Medium Data Structures question asks: The following statement describes a specific concept. What is it called? a way of representing a graph using a 2D matrix where each cell indicates whether an edge exists between two vertices. The correct choice is C. Adjacency matrix. Read the options below, commit to one, then use the explanation to see why that choice holds and why the others do not.
Data Structures items like this one are written for Pakistan exams such as CSS, FPSC, PPSC, and NTS. The difficulty label is a hint about how much of the topic the stem assumes, not a score. Tags and exam names, when they are present, tell you where else the same idea is tested. Previous and next links stay in Data Structures so you can continue the subject. Related questions point at nearby stems if you want another angle on the same idea.
Treat the explanation as part of the question, not a footnote. If you missed it, reread the stem against the correct option before you open the next Data Structures item. A timed quiz is the same pool with a clock and a score. A past paper is a full sitting rather than this single question.
- A. Hash collision
Why not A: “Hash collision” does not fit this question. The answer is Adjacency matrix.
- B. Skip list
Why not B: “Skip list” does not fit this question. The answer is Adjacency matrix.
- C. Adjacency matrix ✓
- D. Linear probing
Why not D: “Linear probing” does not fit this question. The answer is Adjacency matrix.
Correct answer
C. Adjacency matrix
Explanation
Adjacency matrix (option C) is the accepted answer to “The following statement describes a specific concept. What is it called? a way of representing a graph using a 2D matrix where each cell indicates whether an edge exists between two vertices.”. Option A (Hash collision) does not fit this question. Option B (Skip list) does not fit this question. Option D (Linear probing) does not fit this question. For this Data Structures question, the accepted answer is Adjacency matrix.
Source: Data Structures Official Reference Guide
Tags: computer science, data structures, algorithms, programming
Submitted by: MCQsHub Editorial
Related MCQs
- Which concept is defined as follows: a way of representing a graph where each vertex stores a list of its neig...
- Which term refers to a self-balancing tree data structure that maintains sorted data and allows searches, inse...
- Which statement correctly explains Sparse matrix?
- What does B-tree refer to?
- Select the correct name for: a matrix in which most of the elements are zero, often stored using specialized s...
- What is the name for a probabilistic data structure that uses multiple layers of linked lists to allow fast se...