Table of Content

UGC NET Computer Science : June 2012 - Paper 3 (Solved Papers)


Question 1
Number of binary trees formed with 5 nodes are
A
32
B
120
C
42
D
36
Question 2
Are we building the right product ? This statement refers to -
A
Verification
B
Software quality assurance
C
Validation
D
Testing
Question 3
The following postfix expression is evaluated using a stack 
823^/23* + 51* –
The top two elements of the stack after first * is evaluated
A
3, 2
B
6, 1
C
5, 7
D
1, 5
Question 4
The following CFG - 
S®aB|bA, A®a|as|bAA, B®b|bs|aBB
generates strings of terminals that have
A
odd number of a’s and odd number of b’s
B
not equal number of a’s and b’s
C
equal number of a’s and b’s
D
even number of a’s and even number of b’s
Question 5
Consider the following pseudo-code : 
If (A > B) and (C > D) then
   A = A + 1
   B = B + 1
Endif
The cyclomatic complexity of the pseudo-code is
A
3
B
2
C
5
D
4

Pages: Page 1, Page 2, Page 3, Page 4, Page 5, Page 6, Page 7, Page 8, Page 9, Page 10, Page 11, Page 12, Page 13, Page 14, Page 15