This quiz consists of the UGC NET questions of paper 2 of Computer Science and Applications conducted on 28 Aug 2016. This quiz is helpful for aspiring candidates of UGC NET and other competitive exams.
Congratulations - you have completed .
You scored %%SCORE%% out of %%TOTAL%%.
Your performance has been rated as %%RATING%%
MVI A, 35H MOV B, A STC CMC RAR XRA B
Replace P + P by 2 * P or Replace 3 + 4 by 7.
Replace P * 32 by P << 5
Replace P * 0 by 0
Replace (P <<4) – P by P * 15
I. Resolve external references among separately compiled program units.
II. Translate assembly language to machine code.
III. Relocate code and data relative to the beginning of the program.
IV. Enforce access-control restrictions on system libraries.
I and II
I and III
II and III
I and IV
The grammar S→aS|aSbS|∈, where S is the only non-terminal symbol, and ∈ is the null string, is ambiguous.
An unambiguous grammar has same left most and right most derivation.
An ambiguous grammar can never be LR(k) for any k.
Recursive descent parser is a top-down parser.
- process A holds R and wants T
- process B holds nothing but wants T
- process C holds nothing but wants S
- process D holds U and wants S & T
- process E holds T and wants V
- process F holds W and wants S
- process G holds V and wants U
Yes, A, B, C
Yes, D, E, G
Yes, A, B, F
B, A, D, E, C
C, E, D, B, A
E, D, C, B, A
C, B, A, E, D
Part 1 Part 2 Part 3 Part 5