M

Mr. Dubey • 52.30K Points
Coach 

Q. What is Critical Path?

(A) the length of the longest path in a task dependency graph is called the critical path length.
(B) the length of the smallest path in a task dependency graph is called the critical path length.
(C) path with loop
(D) none of the mentioned.
Correct : Option (A)

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. At the end of the clock pulse the value of output Q is uncertain. The situation is referred to as?

Q. Different components of the motherboard of a PC unit are linked together by sets of parallel electrical conducting lines. What are these lines called?

Q. The marshaller used by MarshallingView belongs to one of a series of XML marshallers.

Q. What does “Every software system has an architecture” implies?

Q. Suppose that a problem A is known to have a polynomial-time verification algorithm. Which of the following statements can be deduced.

Q. TDMA allocates a single time per frame to different users.

Q. Which of the following service model is owned in terms of infrastructure by both vendor and customer?

Q. Noise is

Q. When probability of error during transmission is 0.5, it indicates that

Q. What is the result of the following operation? Top (Push (S, X))