Follow Us :

PREVIOUS YEAR SOLVED PAPERS - November 2017 Paper 2

Avatto > > UGC NET COMPUTER SCIENCE > > PREVIOUS YEAR SOLVED PAPERS > > November 2017 Paper 2

31. Which of the following regular expressions, each describing a language of binary numbers (MSB to LSB) that represents non-negative decimal values, does not include even values ?

  • Option : C
  • Explanation :
    Regular expression for binary numbers that represents non negative odd numbers: It's LSB must be 1. So (C) option is correct.
Cancel reply
Cancel reply

32. Which of the following statements is/are TRUE?
(i) The grammar S → SS | a is ambiguous (where S is the start symbol).
(ii) The grammar S → 0S1 | 01S | e is ambiguous (the special symbol e represents the empty string and S is the start symbol).
(iii) The grammar (where S is the start symbol).
S → T/U
T → x S y ? xy ? e
U → yT
generates a language consisting of the string yxxyy.

  • Option : D
  • Explanation :
    We can generate more than 1 parse tree for a single string from the grammars. For statement (iii)
    S → U
    U → yT
    yT → yxSy
    yxSy → yxTy
    yxTy → yxxyy
    All statement are correct. So, option (D) is correct.
Cancel reply
Cancel reply

33. Match the description of several parts of a classic optimizing compiler in List - I, with the names of those parts in List - II:

  • Option : A
  • Explanation :

    Parser is a part of compiler and responsible for syntax recognition. Scanner (or tokenization) used by lexical analyzer. In Semantic analysis consistency and definition of syntax is checked. An optimizer is used improve the IR program. So option (A) is correct.

Cancel reply
Cancel reply

34. In Distributed system, the capacity of a system to adapt the increased service load is called

  • Option : B
  • Explanation :
    Scalability is the capacity of distributed system to adopt the increased load.
    So, option (B) is correct
Cancel reply
Cancel reply

35. In __________ disk scheduling algorithm, the disk head moves from one end to other end of the disk, serving the requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without serving any requests on the return trip.

  • Option : D
  • Explanation :
    In C-SCAN disk scheduling algorithm, the disk head serve the request from one end to other end but when it reaches to other end it immediately returns to the starting of the disk without serving any request.
    So option (D) is correct.
Cancel reply
Cancel reply
Related Quiz.
November 2017 Paper 2