UGC NET CS 2017 Jan - III

Question 51

Consider a disk queue with I/O requests on the following cylinders in their arriving order:

6, 10, 12, 54, 97, 73, 128, 15, 44, 110, 34, 45 

The disk head is assumed to be at cylinder 23 and moving in the direction of decreasing number of cylinders. Total number of cylinders in the disk is 150. The disk head movement using SCAN-scheduling algorithm is:

• 172
• 173
• 227
• 228

Question 52

Match the following for Unix file system:

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

Question 53

Some of the criteria for calculation of priority of a process are: a. Processor utilization by an individual process. b. Weight assigned to a user or group of users. c. Processor utilization by a user or group of processes In fair share scheduler, priority is calculated based on:

• only (a) and (b)
• only (a) and (c)
• (a), (b) and (c)
• only (b) and (c)

Question 54

One of the disadvantages of user level threads compared to Kernel level threads is

• If a user-level thread of a process executes a system call, all threads in that process are blocked.
• Scheduling is application dependent.
• Thread switching doesn’t require kernel mode privileges.
• The library procedures invoked for thread management in user level threads are local procedures.

Question 55

Consider the following AO graph: Which is the best node to expand next by AO* algorithm?

• A
• B
• C
• B and C

Question 56

In Artificial Intelligence (AI), what is present in the planning graph?

• Sequence of levels
• Literals
• Variables
• Heuristic estimates

Question 57

What is the best method to go for the game playing problem?

• Optimal Search

• Random Search

• Heuristic Search

• Stratified Search

Question 58

Which of the following statements is true?

• The sentence S is a logical consequence of S₁,..., S_n if and only if S₁ ∧ S₂ ∧........ ∧ S_n → S is satisfiable.
• The sentence S is a logical consequence of S₁,..., Sn if and only if S₁ ∧ S₂ ∧........ ∧S_n → S is valid.
• The sentence S is a logical consequence of S₁,..., S_n if and only if S₁ ∧ S₂ ∧........ ∧ S_n ∧ S is consistent.
• The sentence S is a logical consequence of S₁,..., S_n if and only if S₁ ∧ S₂ ∧........ ∧ S_n ∧ S is inconsistent.

Question 59

The first order logic (FOL) statement ((R ∨ Q) ∧ (P ∨ ¬Q)) is equivalent to which of the following ?

• ((R ∨ ¬Q) ∧ (P ∨ ¬Q) ∧ (R ∨ P))
• ((R ∨ Q) ∧ (P ∨ ¬Q) ∧ (R ∨ P))
• ((R ∨ Q) ∧ (P ∨ ¬Q) ∧ (R ∨ ¬P))
• ((R ∨ Q) ∧ (P ∨ ¬Q) ∧ ( ¬R ∨ P))

Question 60

Which of the following pairs have different expressive power?

• Single-tape-turing machine and multi-dimensional turing machine.
• Multi-tape turing machine and multi-dimensional turing machine.
• Deterministic push down automata and non-deterministic pushdown automata.
• Deterministic finite automata and Non-deterministic finite automata