# 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.

a) O(V)

b) O(E2)

c) O(E)

d) O(V2)

a) in, out

b) out, in

c) in, total

d) total, out

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

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

c) n*(n-1)

d) 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

a) 2, 3

b) 3, 2

c) 2, 2

d) 3, 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] ]

a) 2

b) 4

c) 6

d) 8

a) x=5, y=3

b) x=3, y=5

c) x=3, y=3

d) x=5, y=5

a) True

b) False

a) 7

b) 14

c) 36

d) 49