299 Computer Science questions asked in CIL MT previous year papers, each with the correct answer and explanation. Read them free on UTpaper, or attempt the full papers as timed online tests.
Consider the following table of arrival time and burst time for three processes P0, P1, P2.
P0: Arrival time 0 s, Burst time 9 s
P1: Arrival time 1 s, Burst time 4 s
P2: Arrival time 2 s, Burst time 9 s
The preemptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of process. The average waiting time for the three process is ________.
Consider the following recursive function.
int function (int x, int y) {
if (y <= 0) return x;
return function (y, x%y);
}
The above recursive function computes _______.
In RSA
1. p and q are chosen as very large prime number
2. Compute n = p * q and φ(n) = (p-1) * (q-1)
Later e encryption key chosen. How this encryption key is selected?
Ae is chosen as a relative prime to q
Be is chosen as a relative prime to p
Ce is chosen as a relative prime to φ(n)
De is chosen as a relative prime to n
Show answerHide answer
Correct answer: (C) e is chosen as a relative prime to φ(n)
Consider the following problem X
"Given a Turing Machine M over the input alphabet Σ any state q of M and word w in Σ*, does the computation of M on w visit the state q"
Which of the following X is correct?
AX is undecidable but partially decidable
BX is not a decision problem
CX is decidable
DX is undecidable but not even partially decidable
Show answerHide answer
Correct answer: (A) X is undecidable but partially decidable
Consider the following statement.
I. Packet Filter Firewall analyze network traffic at transport layer.
II. Circuit Level Firewall operate at transport and session layer of OSI Model.
From the above statement which statement/s is/are True
Consider the finite automaton with two states: the start state q0 and the final state q1. From q0, input a goes to q1 and input b loops back to q0. From q1, input a loops back to q1 and input b goes to q0. Which language is accepted by the FA?
In hashing, collision resolution is carried out by close addressing. Which of the following is close addressing technique –
I. Buckets (for contiguous storage)
II. Chains (for linked storage)
The main memory of a computer has 2cm blocks while the cache has 2c blocks. If cache uses set associative mapping scheme with two blocks per set, then the block k of the main memory maps to set:
Consider the following two statements.
1. A binary tree T is full if each node is either a leaf or possesses exactly two child nodes.
2. A binary tree T with n levels is complete if all levels except possibly the last are completely full, and the last level has all its nodes to the left side.
Which statement is/are TRUE
Consider the Unix i-node which uses 12 direct DBAs, 1 single indirect, 1 double indirect, 1 triple indirect. The disk block address requires 32 bits and disk block size is 1 KB. What is the maximum file size?
A trigger has three parts.
The ________ describes the change that activates the trigger.
The _______ is a query that is run whenever the trigger is activated.
The ______ is the procedure that is executed if the trigger is activated and the condition is true.
Consider the following statements:
Arithmetic Logic Unit (ALU)
1. Performs arithmetic operations
2. Performs comparisons.
3. Communicates with I/O devices
4. Keeps watch on the system
Which of these statements are correct?
For following logic diagram which expression is true?
Inputs A and B each pass through a NOT gate; the two inverted signals feed one AND gate. The original A and B feed a second AND gate. The outputs of the two AND gates feed an OR gate whose output is X.
A(AB) (A'B')
B((A'B').(AB))'
C((AB))' + (AB)
DA'B' . AB
Show answerHide answer
Correct answer: (B) ((A'B').(AB))'
Explanation
The circuit computes X = A'B' + AB (XNOR). The official key marks option B.
Consider a system with page fault service time (S) = 100 ns, main memory access time (M) = 20 ns, and page fault rate (P) = 65%. Calculate the effective memory access time.
Which grammar rules violate the requirement of the operator grammar? A, B, C are variables and a, b, c are terminals.
i. A → BC
ii. A → CcBb
iii. A → BaC
iv. A → ε
The following is the sequence of insertion in a binary tree.
45, 65, 35, 40, 33, 70, 60, 75, 69
How many numbers of nodes in Left Sub Tree (LST) and Right Sub Tree (RST) of Root node.
Solve the following recurrence relation
T(n) = 4T(n/2) + n
AO(n²)
BO(n/2)
CO(n)
DO(log n)
Show answerHide answer
Correct answer: (A) O(n²)
How to use these CIL MT Computer Science questions
Every question here was asked in a real CIL MT paper; the paper and shift are shown on the card, and the number opens the question on its own page. Try each one before tapping Show answer, then attempt the full CIL MT papers as timed tests to check your speed under exam conditions.