1
GATE CSE 2015 Set 1
Numerical
+1
-0
The output of the following C program is__________.

void f1(int a, int b) { 
int c; 
c=a; a=b; b=c; 
}

void f2(int *a, int *b) { 
int c; 
c=*a; *a=*b; *b=c; 
}

int main(){ 
int a=4, b=5, c=6; 
f1(a,b); 
f2(&b, &c); 
printf(“%d”,c-a-b); 
}
Your input ____
2
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+1
-0.3

Match the following:

List I List II
(P) Condition coverage (i) Black-box testing
(Q) Equivalence class partitioning (ii) System testing
(R) Volume testing (iii) White-box testing
(S) Alpha testing (iv) Performance testing
A
P - ii, Q - iii, R - i, S - iv
B
P - iii, Q - iv, R - ii, S - i
C
P - iii, Q - i, R - iv, S - ii
D
P - iii, Q - i, R - ii, S - iv
3
GATE CSE 2015 Set 1
Numerical
+2
-0
Consider the following C program segment.
while(first <= last) 
{ 
    if (array[middle] < search) 
        first = middle + 1; 
    else if (array[middle] == search) 
              found = TRUE; 
          else last = middle - 1; 
    middle = (first + last)/2; 
}
 if (first > last) notPresent = TRUE; 
The cyclomatic complexity of the program segment is ________.
Your input ____
4
GATE CSE 2015 Set 1
Numerical
+2
-0
GATE CSE 2015 Set 1 Theory of Computation - Finite Automata and Regular Language Question 43 English

Consider the DFAs M and N given above. The number of states in a minimal DFA that accepts the language L(M) ∩ L(N) is___________.

Your input ____
EXAM MAP