ISRO CSE 2014


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.
A
0
B
1
C
2
D
3
   
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?
A
m \times 2^{n}
B
2^{m+n}
C
2^{m n}
D
m+n
Theory of Computation   Finite Automata


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;
}
A
14
B
36
C
18
D
20
C Programming   Arithmetic Operation
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?
A
2
B
3
C
4
D
5
Software Engg   
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
A
10
B
12
C
15
D
16
Compiler Design   Parsing




There are 5 questions to complete.

Leave a Comment