11 Programming in C/C++ (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.
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
Given a code snippet in C programming language as follows:
int a = 10;
int *p;
int **w;
p = &a;
which statement correctly assigns the address of 'p' to 'w'?
Which of the following is/are FALSE?
I) Operator precedence parser works on ambiguous grammar
II) Top-down parser works on left recursive, unambiguous and deterministic grammar
III) LL(1) is a non-recursive descent parser
IV) CLR(1) is the most powerful parser
The class of Context-free grammar is not closed under _______ operations.
AConcatenation
BIntersection
CStar
DUnion
Show answerHide answer
Correct answer: (B) Intersection
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.