ISRO CSE 2014

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.

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?

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;
}

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?

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