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 grammar G:
E → T E'
E' → + T E' ε
T → F T'
T' → * F T' ε
F → (E) id
Which of the following statements about top-down parsing of grammar G is true?
AThe grammar is not left-recursive and can be parsed using a predictive (LL(1)) parser.
BThe grammar requires backtracking since FIRST and FOLLOW sets of E’ overlap.
CThe grammar is left-recursive and hence cannot be used for top-down parsing.
DThe grammar is suitable for LL(1) (predictive) parsing and does not require backtracking.
Show answerHide answer
Correct answer: (D) The grammar is suitable for LL(1) (predictive) parsing and does not require backtracking.
Which of the following statements best reflects a comprehensive layered design issue in computer networks?
AEach layer must handle key issues like addressing, error control, flow control, sequencing and data direction, ensuring reliable communication between entities without breaking layer abstraction.
BThe design issues of addressing and error control are handled exclusively by the network layer, while flow control and sequencing are managed solely by the transport layer.
CLayered design primarily concerns selecting the physical transmission medium and ensuring minimal propagation delay across all layers.
DOnce error control and sequencing are implemented at the data link layer, upper layers are exempt from such design considerations.
Show answerHide answer
Correct answer: (A) Each layer must handle key issues like addressing, error control, flow control, sequencing and data direction, ensuring reliable communication between entities without breaking layer abstraction.
Which of the following statements best distinguishes the relationship between a service and a protocol in a layered network architecture?
ABoth services and protocols define the message formats and meanings used between the same layer entities, but at different abstraction levels.
BA service specifies what operations a layer offers to the layer above, whereas a protocol defines how peer entities within the same layer communicate to provide that service.
CA service is the physical implementation of a protocol; thus, changing the protocol automatically changes the provided service.
DA protocol defines the interface between two adjacent layers, while a service specifies the message exchange rules between peer entities.
Show answerHide answer
Correct answer: (B) A service specifies what operations a layer offers to the layer above, whereas a protocol defines how peer entities within the same layer communicate to provide that service.
During a content search operation in associative memory, which register temporarily holds the key used to compare against all stored memory words simultaneously?
Consider a finite state transducer (FST) with Q = {q₀, q₁}, Σ = {0, 1}, Γ = {a, b, c}, initial state q₀, and the following transitions:
δ(q₀, 0) = q₁, δ(q₀, 1) = q₀ δ(q₁, 0) = q₀, δ(q₁, 1) = q₁ and output function:
θ(q₀, 0) = a, θ(q₀, 1) = c θ(q₁, 0) = b, θ(q₁, 1) = a What will be the output string for the input 1010?
Which statement correctly defines the regular expressions?
Statement-1: Regular expressions representation doesn’t involve a combination
of strings of symbols from some alphabet ∑, parentheses and the operators +, ×, and *.
Statement-2: A regular expression is not obtained from the symbol {a, b, c},
empty string ∈, and empty-set Φ perform the operations +, × and * (union, concatenation and Kleene star).
AStatement-1 is True and Statement-2 is True
BStatement-1 is False and Statement-2 is True
CStatement-1 is False and Statement-2 is False
DStatement-1 is True and Statement-2 is False
Show answerHide answer
Correct answer: (C) Statement-1 is False and Statement-2 is False
In the context of programming languages, if a compiler can determine the scope of a declaration by examining the program text alone, the language is said to use:
ADynamic policy and lexical scope
BStatic policy and lexical scope
CStatic policy and dynamic scope
DDynamic policy and dynamic scope
Show answerHide answer
Correct answer: (B) Static policy and lexical scope
Which of the following options about non-preemptive scheduling is incorrect?
ANon-preemptive scheduling can lead to process starvation.
BIn non-preemptive scheduling, the response time and waiting time are generally not equal for all processes, and in most cases, waiting time is greater than response time.
CIn non-preemptive scheduling, the CPU is relinquished only when a process terminates or initiates an input/output operation.
DRound Robin is classified as a non-preemptive scheduling algorithm.
Show answerHide answer
Correct answer: (D) Round Robin is classified as a non-preemptive scheduling algorithm.
A team develops a text-mining tool that highlights sequences in security logs where a server's alert code is immediately followed by an IP address in the format
10.0.X.Y (where X and Y are integers). Which regular expression most efficiently
identifies these patterns without false positives?
A 32-bit IEEE 754 single-precision floating-point number is represented as:
0100 0001 0100 1001 0000 0000 0000 0000 What is the decimal value of this floating-point number?
Which of the following statements correctly differentiates connection-oriented from connectionless services?
AConnection-oriented ensures reliability and order; connectionless may not.
BConnectionless has higher overhead; connection-oriented has minimal.
CConnection-oriented sends data without a connection; connectionless requires one.
DBoth perform error checking and retransmission.
Show answerHide answer
Correct answer: (A) Connection-oriented ensures reliability and order; connectionless may not.
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.