Miscellaneous On Data Structures - Practice Test

(A) Vertex with degree 1

(B) Any vertex of the graph

(C) Vertex with the highest degree

(D) Vertex with the lowest degree

(B) Any vertex of the graph

(A) Where all the vertex in the graph need to be included

(B) Where all the edges in the graph need to be included

(C) Only half edges in the graph need to be included

(D) Only half of the total vertices need to be included

(B) Where all the edges in the graph need to be included

(A) Icon

(B) Prolog

(C) Planner

(D) Fortran

(D) Fortran

(A) 1010010

(B) 1110000

(C) 1100100

(D) 1010101

(C) 1100100

(A) carom

(B) chess

(C) ludo

(D) cards

(B) chess

Miscellaneous On Data Structures - Study Mode