Important UGC NET Computer Questions Series 2

1) Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. The relationship between n1 and n2 is
(A) n1 is necessarily less than n2 
(B) n1 is necessarily equal to n2 
(C) n1 is necessarily greater than n2 
(D) None of the above

2) Which of the following statements is false ? 

(A) An unambiguous grammar has same left most and right most derivation 
(B) An LL(1) parser is a top-down parser 
(C) LALR is more powerful than SLR 
(D) An ambiguous grammar can never be LR (K) for any k

3)Type checking is normally done during

(a) Lexical analysis (b) Syntax Analysis 
(c) Syntax Directed Translation (d) Code optimization

4) A compiler that converts embedded DML statements to normal procedure calls is known as 

(A) Embedded DML precompiler (B) Embedded DML compiler (C) C++ compiler (D) DML compiler

5)  In a language processing model using compiler, the output of an Assembler is

(A) Assembly Program (B) Absolute Machine Code 
(C) Relocatable Machine Code (D) Skeletal Source program

6) Which of the following phase of the compiler facilitates retargeting i.e. Compiler for different machine can be created by attaching a back end for the new machine to the existing front end?

(A) Code generation
(B) Intermediate code generation
(C) Code optimization
(D) Semantic analysis

7) The maximum number of objects that can be presented by using the z-buffer algorithm 

(A) One (B) Infinite 
(C) Two (D) Arbitrary

8) In SQL, which command is used to add new rows to a table? 
(A) ALTER TABLE (B) ADD ROW 
(C) INSERT (D) APPEND