UGC NET CS 2016 July – II

Question 31

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.

• 10, 9

• 9, 9

• 10, 10

• 9,10

Question 32

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: With reference to current allocation, is system safe ? If so, what is the safe sequence ?

• No
• Yes, P₁P₂P₃P₄
• Yes, P₄P₃P₁P₂
• Yes, P₂P₁P₃P₄

Question 33

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

• 320
• 322
• 321
• 319

Question 34

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.

• Priority scheduling
• Round Robin Scheduling
• Shortest Job First
• FCFS

Question 35

If S₁ is total number of modules defined in the program architecture, S₃ is the number of modules whose correct function depends on prior processing then the number of modules not dependent on prior processing is :

• 1 + (s₃ / s₁)
• 1 - (s₃ / s₁)
• 1 + (s₁ / s₃)
• 1 - (s₁ / s₃)

Question 36

The ________ model is preferred for software development when the requirements are not clear.

• Rapid Application Development
• Rational Unified Process
• Evolutionary Model
• Waterfall Model

Question 37

Which of the following is not included in waterfall model?

• Requirement analysis
• Risk analysis
• Design
• Coding

Question 38

The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes is: (1) P + 1 (2) P – 1 (3) P – 2 (4) P + 2 Where P is number of predicate nodes in flow graph V(G).

• (1)
• (2)
• (3)
• (4)

Question 39

The extent to which a software tolerates the unexpected problems, is termed as:

• Accuracy
• Reliability
• Correctness
• Robustness

Question 40

An attacker sits between customer and Banker, and captures the information from thecustomer and retransmits to the banker by altering the information. This attack is called as ______.

• Masquerade Attack
• Replay Attack
• Passive Attack
• Denial of Service Attack