Thursday, 3 September 2015

CBSE UGC NET Computer Science Paper II Solved June 2015 - Part 4

31.       Match the following:
List – I                                                List – II
(a) Forward Reference Table                        (i) Assembler directive
(b) Mnemonic Table                            (ii) Uses array data structure
(c) Segment Register Table               (iii) Contains machine OP code
(d) EQU                                                 (iv) Uses linked list data structure
Codes:
      (a)    (b)   (c)   (d)
(A) (ii)    (iii)   (iv)  (i)
(B) (iii)   (iv)   (ii)   (i)
(C) (iv)   (i)    (iii)   (ii)
(D) (iv)   (iii)   (ii)   (i)
Answer: D
32.       The translator which performs macro calls expansion is called :
(A) Macro processor                (B) Micro pre-processor
(C) Macro pre-processor         (D) Dynamic linker
Answer: C
33.       If all the production rules have single non - terminal symbol on the left side, the grammar defined is :
(A) context free grammar                    (B) context sensitive grammar
(C) unrestricted grammar                   (D) phrase grammar
Answer: A
34.       Which one from the following is false ?
(A) LALR parser is Bottom - Up parser
(B) A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1).
(C) LR parser is Bottom - Up parser.
(D) In LL(1), the 1 indicates that there is a one - symbol look - ahead.
Answer: B
35.       Which phase of compiler generates stream of atoms ?
(A) Syntax analysis     (B) Lexical Analysis
(C) Code generation   (D) Code optimization
Answer: A

36.       A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes 6 msec per cyclinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm?
(A) 0.984 sec                (B) 0.396 sec
(C) 0.738 sec                (D) 0.42 sec
Answer: D
37.       Let Pi and Pj be two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes Pi and Pj, which of the following conditions is not true?
(A) R(Pi)∩W(Pj)=Φ       (B) W(Pi)∩R(Pj)=Φ
(C) R(Pi)∩R(Pj)=Φ       (D) W(Pi)∩W(Pj)=Φ
Answer: C
38.       A LRU page replacement is used with four page frames and eight pages. How many page faults will occur with the reference string 0172327103 if the four frames are initially empty?
(A) 6                   (B) 7
(C) 5                   (D) 8
Answer: B
39.       What does the following command do?
grep −vn “abc” x
(A) It will print all of the lines in the file x that match the search string “abc”
(B) It will print all of the lines in file x that do not match the search string “abc”
(C) It will print total number of lines in the file x that match the search string “abc”
(D) It will print the specific line numbers of the file x in which there is a match for string “abc”
Answer: A
40.    The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user structure?
(A) File descriptor table          (B) System call state
(C) Scheduling parameters   (D) Kernel stack
Answer: C


0 comments:

Post a Comment

UGC NET Computer Science

Computer GK App