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

Question 1 |

Number of binary trees formed with 5 nodes are

32 | |

120 | |

42 | |

36 |

Question 2 |

Are we building the right product ?
This statement refers to -

Verification | |

Software quality assurance | |

Validation | |

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

3, 2 | |

6, 1 | |

5, 7 | |

1, 5 |

Question 4 |

The following CFG -

S®aB|bA, A®a|as|bAA, B®b|bs|aBBgenerates strings of terminals that have

odd number of a’s and odd number of b’s | |

not equal number of a’s and b’s | |

equal number of a’s and b’s | |

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 EndifThe cyclomatic complexity of the pseudo-code is

3 | |

2 | |

5 | |

4 |