Our website is made possible by displaying online advertisements to our visitors. Please consider supporting us by whitelisting our website.

» High Performance Computing (HPC) solved MCQs

Which of the following is an primary goal of HTC paradigm___________?

Question:

Which of the following is an primary goal of HTC paradigm___________?

A.

high ratio identification

B.

low-flux computing

C.

high-flux computing

D.

computer utilities

Answer» c. high-flux computing

Note: The above multiple-choice question is for all general and Competitive Exams in India

Which of the following is an primary goal of HTC paradigm___________? Read More »

» High Performance Computing (HPC) solved MCQs

Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)

Question:

Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)

A.

o(v + e)

B.

o(v)

C.

o(e)

D.

o(v*e)

Answer» a. o(v + e)

Note: The above multiple-choice question is for all general and Competitive Exams in India

Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges) Read More »

» High Performance Computing (HPC) solved MCQs

Breadth First Search is equivalent to which of the traversal in the Binary Trees?

Question:

Breadth First Search is equivalent to which of the traversal in the Binary Trees?

A.

pre-order traversal

B.

post-order traversal

C.

level-order traversal

D.

in-order traversal

Answer» c. level-order traversal

Note: The above multiple-choice question is for all general and Competitive Exams in India

Breadth First Search is equivalent to which of the traversal in the Binary Trees? Read More »

» High Performance Computing (HPC) solved MCQs

Which of the following is not an application of Breadth First Search?

Question:

Which of the following is not an application of Breadth First Search?

A.

when the graph is a binary tree

B.

when the graph is a linked list

C.

when the graph is a n-ary tree

D.

when the graph is a ternary tree

Answer» b. when the graph is a linked list

Note: The above multiple-choice question is for all general and Competitive Exams in India

Which of the following is not an application of Breadth First Search? Read More »

» High Performance Computing (HPC) solved MCQs