UGC-NET JULY 2016 PAPER 2 QUESTIONS

Q::31.The number of strings of length 4 that are generated by the regular expression (0|∈)1+2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is :

(1) 08                        (2) 10
(3) 11                        (4) 12

Answer::(4)

Q::32.The content of the accumulator after the execution of the following 8085 assembly language program, is :

MVI A, 42H
MVI B, 05H
UGC: ADD B
DCR B
JNZ UGC
ADI 25H
HLT

(1) 82 H                    (2) 78 H
(3) 76 H                    (4) 47 H

Answer::(3)

For Explanation Visit::
http://cbsenetmaterial.blogspot.in/2016/12/ugc-net-computer-science-july-2016_74.html

Q::33. In _______, the bodies of the two loops are merged together to form a single loop provided that they do not make any references to each other.

(1) Loop unrolling                       (2) Strength reduction
(3) Loop concatenation                (4) Loop jamming

Answer::(4)

Q::34. Which of the following is not typically a benefit of dynamic linking ?

I. Reduction in overall program execution time.

II. Reduction in overall space consumption in memory.

III. Reduction in overall space consumption on disk.

IV. Reduction in the cost of software updates.

(1) I and IV                             (2) I only
(3) II and III                           (4) IV only

Answer::(2)

Q::35. Which of the following is FALSE ?

(1) The grammar S → a Sb |bSa|SS|∈, where S is the only non-terminal symbol and ∈ is the null string, is ambiguous.

(2) SLR is powerful than LALR.

(3) An LL(1) parser is a top-down parser.

(4) YACC tool is an LALR(1) parser generator.

Answer::(2)

Q::36. Consider the reference string
                       
                       0 1 2 3 0 1 4 0 1 2 3 4

If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are _______ and ______ respectively.

(1) 10, 9                                           (2) 9, 9
(3) 10, 10                                         (4) 9, 10

Answer::(4)

Q::37. Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below :
Process Max.              Need Current              Allocation
         P1                           8                                 3
         P2                           9                                 4
         P3                           5                                 2
         P4                           3                                 1

With reference to current allocation, is system safe ? If so, what is the safe sequence ?

(1) No                                              (2) Yes, P1 P2 P3 P4
(3) Yes, P4 P3 P1 P2                           (4) Yes, P2 P1 P3 P4

Answer::(3)

Q::38. If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are :
                        98, 37, 14, 124, 65, 67

(1) 320                                                 (2) 322
(3) 321                                                 (4) 319

Answer::(3)

Q::39. In UNIX, _________ creates three subdirectories : ‘PIS’ and two subdirectories ‘progs’ and ‘data’ from just created subdirectory ‘PIS’.

(1) mkdir PIS/progs PIS/data PIS

(2) mkdir PIS progs data

(3) mkdir PIS PIS/progs PIS/data

(4) mkdir PIS/progs data

Answer::(3)

Q::40. A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler reevaluates the
process priority for every ‘T’ time units and decides next process to be scheduled. If the
process have no I/O operations and all arrive at time zero, then the scheduler implements
_________ criteria.

(1) Priority scheduling

(2) Round Robin Scheduling

(3) Shortest Job First

(4) FCFS

Answer::(2)

                                                           1 2 3 4 5