50+ Adjacency Matrix MCQs with FREE PDF

We have the best collection of Adjacency Matrix MCQs and answer with FREE PDF. These Adjacency Matrix MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

Adjacency Matrix MCQs

1. The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is ____________

a) O(V)

b) O(E2)

c) O(E)

d) O(V2)

Answer: O(V2)

2. For the adjacency matrix of a directed graph the row sum is the _________ degree and the column sum is the ________ degree.

a) in, out

b) out, in

c) in, total

d) total, out

Answer: out, in

3. What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?

a) (n*(n-1))/2

b) (n*(n+1))/2

c) n*(n-1)

d) n*(n+1)

Answer: n*(n-1)

4. On which of the following statements does the time complexity of checking if an edge exists between two particular vertices is not, depends?

a) Depends on the number of edges

b) Depends on the number of vertices

c) Is independent of both the number of edges and vertices

d) It depends on both the number of edges and vertices

Answer: Is independent of both the number of edges and vertices

5. In the given connected graph G, what is the value of rad(G) and diam(G)?

a) 2, 3

b) 3, 2

c) 2, 2

d) 3, 3

Answer: 2, 3

6. Which of these adjacency matrices represents a simple graph?

a) [ [1, 0, 0], [0, 1, 0], [0, 1, 1] ]

b) [ [1, 1, 1], [1, 1, 1], [1, 1, 1] ]

c) [ [0, 0, 1], [0, 0, 0], [0, 0, 1] ]

d) [ [0, 0, 1], [1, 0, 1], [1, 0, 0] ]

Answer: [ [0, 0, 1], [1, 0, 1], [1, 0, 0] ]

7. Given an adjacency matrix A = [ [0, 1, 1], [1, 0, 1], [1, 1, 0] ], The total no. of ways in which every vertex can walk to itself using 2 edges is ________

a) 2

b) 4

c) 6

d) 8

Answer: 6

8. If A[x+3][y+5] represents an adjacency matrix, which of these could be the value of x and y.

a) x=5, y=3

b) x=3, y=5

c) x=3, y=3

d) x=5, y=5

Answer: x=5, y=3

9. Two directed graphs(G and H) are isomorphic if and only if A=PBP-1, where P and A are adjacency matrices of G and H respectively.

a) True

b) False

Answer: True

10. The number of elements in the adjacency matrix of a graph having 7 vertices is __________

a) 7

b) 14

c) 36

d) 49

Answer: 49

Adjacency Matrix MCQs PDF Download

50+ Incidence Matrix and Graph Structured Stack MCQs PDF Download
50+ Adjacency List MCQs PDF Download
50+ Undirected Graph MCQs PDF Download
50+ Directed Graph MCQs PDF Download
50+ Directed Acyclic Graph MCQs PDF Download
50+ Propositional and Directed Acyclic Word Graph MCQs PDF Download
50+ Multigraph and Hypergraph MCQs PDF Download
50+ Binary Decision Diagrams and Inverter Graph MCQs PDF Download

Comments