QUESTIONS CARRY 2 MARKS EACH
Consider a 6-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is executing on this 6-stage pipeline, the speedup achieved with respect to non-pipelined execution if 25% of the instructions incur 2 pipeline stall cycles is ______________________.
-
Solution
Time without pipeline = 6 stages = 6 cycles
Time with pipeline = 1+0.25 × 2 = 1.5Speed up = 6⁄1.5 =4
QUESTIONS CARRY 2 MARKS EACH
A pennant is a sequence of numbers, each number being 1 or 2. An n-pennant is a sequence of numbers with sum equal to n. For example, (1,1,2) is a 4-pennant. The set of all possible 1-pennants is {(1)}, the set of all possible 2-pennants is {(2), (1,1)}and the set of all 3-pennants is{(2,1), (1,1,1), (1,2)}. Note that the pennant (1,2) is not the same as the pennant (2,1). The number of 10-pennants is______________.
-
Solution
QUESTIONS CARRY 2 MARKS EACH
Four fair six-sided dice are rolled. The probability that the sum of the results being 22 is \(\frac{x}{1296}\). The value of X is______ .
-
Solution
Given that four six-sided dice are rolled.
Since each dice can result 1, 2, 3, 4, 5 or 6.Total no. of outcomes = 6 × 6 × 6 × 6 = 1296
Now, we shall calculate number of favourable cases for sum of the results being 22.
We note that only two cases can result in sum 22.
QUESTIONS CARRY 2 MARKS EACH
Four 256 × 8 PROM chips are used to produce a total capacity of 1024 × 8. The address bus lines required are
-
Solution
Address line only depends on address lines Number of address line = (210) = 10
QUESTIONS CARRY 2 MARKS EACH
Which of the following is most appropriate matching for the following pairs?
List I List II
A.Indirect addressing 1.Loops
B.Immediate addressing 2.Pointers
C.Auto decrement addressing 3. Constants
QUESTIONS CARRY 2 MARKS EACH
A single instruction to clear lower four bits of the accumulator in 8085 assembly language is
-
Solution
ANI FOH is the answer. Here, each hexadecimal digit corresponds to four bits.So, the operand is actually 11110000 in binary. Because of this, lower four bits get cleared.
QUESTIONS CARRY 2 MARKS EACH
What is the distance of the following code ?
000000, 001101, 110100, 111111, 101010, 110011
QUESTIONS CARRY 2 MARKS EACH
The number of My hill-Nerode equivalence classes for the language accepted by the given DFA is _________.
-
Solution
QUESTIONS CARRY 2 MARKS EACH
Compute
Fibonacci (8) where
Fibonacci(1) : = 1;Fibonacci (2) : 1 = 1 ;
and Fibonacci (N) :
= Fibonacci (N – 1) + Fibonacci (N –2) ;
QUESTIONS CARRY 2 MARKS EACH
Using best first search for a shortest path from A to Z, the order in which nodes are considered best for the path is(Note that these are node orders, not fill paths.)