Analysis of Algorithms and Computational Complexity Questions and Answers
Practice ModeShowing 10 of 239 questions
Q51
A given connected graph G is a Euler graph if and only if all vertices of G arre of
Answer: Option B
Q52
A circuit in connected graph which includes every vertex of the graph is known as
Answer: Option C
Q53
The length of a Hamiltonian path (if exist) in a connected graph of n vertices is
Answer: Option A
Q54
A simple graph in which there exists an edge between every pair of vertices is called a (an)
Answer: Option B
Q55
If B is a circuit matrix of a graph with k components, e edges and n vertices, the rank of B is
Answer: Option C
Q56
Consider a graph G having cutset matrix C(G) and incidence matrix A(G). The Rank of B is
Answer: Option A
Q57
Let X be the adjacency matrix of a graph G with no self loops. the entries along the principle diagonal of X are
Answer: Option A
Q58
Which of the following tool is used to specify lexical analyzers for variety of languages
Answer: Option A
Q59
In compilers, the syntax analysis is done by
Answer: Option C
Q60
Which of the following parsing methods handle left-recursive grammars ?
Answer: Option A