Question 1 |
Consider a 33MHz cpu based system. What is the number of wait states required if it is interfaced with a 60ns memory? Assume a maximum of 10ns delay for additional circuitry like buffering and decoding.
0 | |
1 | |
2 | |
3 |
Question 1 Explanation:
Question 2 |
The number of states required by a Finite State Machine,to simulate the behavior of a computer with a memory capable of storing 'm' words, each of length 'n' bits is?
m \times 2^{n} | |
2^{m+n} | |
2^{m n} | |
m+n |
Question 2 Explanation:
Question 3 |
What is the output of the following C program?
#include < stdio.h >
#define SQR(x) (x*x)
int main()
{
int a;
int b=4;
a=SQR(b+2);
printf("%d\n",a);
return 0;
}
14 | |
36 | |
18 | |
20 |
Question 3 Explanation:
Question 4 |
Consider the following pseudo- code
while (m < n)
if (x > y) and (a < b) then
a=a+1
y=y-1
end if
m=m+1 end while
What is cyclomatic complexity of the above pseudo -code?
2 | |
3 | |
4 | |
5 |
Question 4 Explanation:
Question 5 |
What is the number of steps required to derive the string ((() ()) ()) for the following grammar?
S \rightarrow S S
S \rightarrow(S)
S \rightarrow \varepsilon
S \rightarrow S S
S \rightarrow(S)
S \rightarrow \varepsilon
10 | |
12 | |
15 | |
16 |
Question 5 Explanation:
There are 5 questions to complete.