Questions
1
Consider the following processes with time slice of 4 milliseconds (I/O requests are ignored) : Process A B C D Arrival time 0 1 2 3 CPU cycle 8 4 9 5 The average turn around time of these processes will be
Answer: Option [A]
2
A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order : ABACABDBACD Assuming that a page interrupt occurs when a new page is brought in the main memory, irrespective of whether the page is swapped out or not. The number of page interrupts in FIFO and LRU page replacement algorithms are
Answer: Option [B]
3
An operating system using banker’s algorithm for deadlock avoidance has ten dedicated devices (of same type) and has three processes P1, P2 and P3 with maximum resource requirements of 4, 5 and 8 respectively. There are two states of allocation of devices as follows : State 1 Processes P1 P2 P3 Devices allocated 2 3 4 State 2 Processes P1 P2 P3 Devices allocated 0 2 4 Which of the following is correct ?
Answer: Option [D]
4
Let the time taken to switch between user mode and kernel mode of execution be T1 while time taken to switch between two user processes be T2. Which of the following is correct ?
Answer: Option [A]
5
Working set model is used in memory management to implement the concept of
Answer: Option [B]
6
A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry ?
Answer: Option [B]
7
A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct ?
Answer: Option [B]
8
The versions of windows operating system like windows XP and window Vista uses following file system :
Answer: Option [B]
9
Which one of the following is a correct implementation of the metapredicate “not” in PROLOG (Here G represents a goal) ?
Answer: Option [B]
10
Which one of the following is not an informed search technique ?
Answer: Option [B]
11
If we convert ∃u ∀v ∀x ∃y (P(f(u),v, x, y) → Q(u,v,y)) to ∀v ∀x (P(f(a),v, x, g(v,x)) → Q(a,v,g(v,x))) This process is known as
Answer: Option [A]
12
Given two jugs of capacities 5 litres and 3 litres with no measuring markers on them. Assume that there is endless supply of water. Then the minimum number of states to measure 4 litres water will be
Answer: Option [B]
13
The map colouring problem can be solved using which of the following technique ?
Answer: Option [D]
14
The simplified function in product of sums of Boolean function F(W, X, Y, Z) = Σ(0, 1, 2, 5, 8, 9, 10) is
Answer: Option [A]
15
Which of the following is a knowledge representation technique used to represent knowledge about stereotype situation ?
Answer: Option [B]
17
Hamming distance between 100101000110 and 110111101101 is
Answer: Option [B]
18
A fuzzy set A on R is ________ iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator.
Answer: Option [B]
19
If A and B are two fuzzy sets with membership functions μA(x) = {0.6, 0.5, 0.1, 0.7, 0.8} μB(x) = {0.9, 0.2, 0.6, 0.8, 0.5} Then the value of μ––––– A ∪ B(x) will be
Answer: Option [B]
20
Consider a single perception with weights as given in the following figure :
and f (t) defined as
f (t) = ⎩ ⎪ ⎨ ⎪ ⎧
1, t > 0 0, t ≤ 0 The above perception can solve
Answer: Option [B]
