Computer Science Study Materials for Competitive Exams

Sample Questions, Previous Year Solved Papers, Study Materials For Competitive Examinations Like UGC NET, SET And GATE Computer Science.

Thursday, 23 February 2017

UGC NET Computer Science Paper II December 2009 - Part 4 Solved Questions

31.       In an absolute loading scheme which loader function is accomplished by assembler?
(A) re-allocation
(B) allocation
(C) linking
(D) loading
Answer: A
32.       Which of the following grammar is LR (1)?
(A) A®aAb, A®bAb, A®a , A®b
(B) A®aAa, A®aAb, A®c
(C) A®A+A, A®a
(D) Both (A) and (B)
Answer: D
33.       A shift-reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of the grammar.
S®xxW[print“1”]
S®y[print“2”]
W®S2[print“3”], what is the translation of “x x x x y z z”?
(A) 1 1 2 3 1
(B) 1 1 2 3 3
(C) 2 3 1 3 1
(D) 2 3 3 2 1
Answer: C
34.       Context-free Grammar (CFG) can be recognized by
(A) Finite state automata
(B) 2-way linear bounded automata
(C) push down automata
(D) both (B) and (C)
Answer: D
35.       Synthesized attribute can be easily simulated by a
(A) LL grammar
(B) Ambiguous grammar
(C) LR grammar
(D) None of the above
Answer: C

36.       In the process management Round-robin method is essentially the pre-emptive version of …………
(A) FILO
(B) FIFO
(C) SSF
(D) Longest time first
Answer: B
37.       A page fault
(A) is an error specific page.
(B) is an access to the page not currently in memory.
(C) occur when a page program occur in a page memory.
(D) page used in the previous page reference.
Answer: B
38.       A semaphore count of negative n means (s=–n) that the queue contains ………….. waiting processes.
(A) n + 1
(B) n
(C) n – 1
(D) 0
Answer: B
39.       A program is located in the smallest available hole in the memory is ……………
(A) best – fit
(B) first – bit
(C) worst – fit
(D) buddy
Answer: A
40.    The Unix command used to find out the number of characters in a file is
(A) nc
(B) wc
(C) chcnt
(D) lc
Answer: B

Pages   2   3   4   5 

No comments:

Post a Comment