Question
a.
S≤f+(1-f)/p
b.
S≤f/p+(1-f)
c.
S≤1/[f+(1-f)/p]
d.
S≤1/[1-f+f/p]
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Amdahl’s law states that the maximum speedup S achievable by a parallel computer with ‘p’ processors is given by:
Similar Questions
Discover Related MCQs
Q. Amongst the logic families DTL, TTL, ECL and CMOS, the family with the least power dissipation is:
View solution
Q. The characteristic equation of the D flip-flop is:
View solution
Q. Which of the following logic is the fastest ?
View solution
Q. Which of the following logic has the maximum fan out ?
View solution
Q. The first operating system of Microprocessor is ...................
View solution
Q. A half-adder is also known as :
View solution
Q. When an inverter is placed between both inputs of an S-R flip flop, the resulting flip flop is:
View solution
Q. The Register or main memory location which contains the effective address of the operand is known as:
View solution
Q. Identify the logic function performed by the circuit shown
View solution
Q. When a tri-state logic device is in the third state, then:
View solution
Q. An example of a connective which is not associative is:
View solution
Q. Essential hazards may occur in:
View solution
Q. The characteristic equation of a T flip-flop is:
(A) Qn+1=TQ’n + T’ Qn
(B) Qn+1=T+Qn
(C) Qn+1=TQn
(D) Qn+1= T’Q’n
The symbols used have the usual meaning.
View solution
Q. The maximum size of main memory of a computer is determined by:
View solution
Q. In computer terminology, POST stands for:
View solution
Q. IC 74 LS 138 is a:
View solution
Q. A hardware interface that allows for the connection of several peripheral devices to a single PCI board
View solution
Q. Simplified form of the Boolean expression Y=A’BC’D’+ABC’D’+A’BCD’+ABCD’ is:
View solution
Q. Which of the following statements are true?
(i) Every logic network is equivalent to one using just NAND gates or just NOR gates.
(ii) Boolean expressions and logic networks correspond to labelled acyclic diagraphs.
(iii) No two Boolean algebras with n atoms are isomorphic.
(iv) Non-zero elements of finite Boolean algebras are not uniquely expressible as joins of atoms.
View solution
Q. In computers, subtraction is generally carried out by
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Computer Architecture? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
