UTpaper

Free mock tests & test series

CIL MT · Topic-wise previous year questions

Computer Science Previous Year Questions (page 3)

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.

  • 299 questions
  • 10 topics
  • Official answer key
  • Free
Attempt CIL MT papers →

Practise by topic

Data Structures 56DBMS & SQL 53Theory of Computation & Compilers 27Digital Logic & Number Systems 26Computer Networks 22Operating Systems 21Algorithms 16Computer Organization & Architecture 16Programming in C/C++ 11Discrete Mathematics 10
Q101CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following statements is TRUE?
  1. AThe cardinality ratio for a binary relationship specifies the maximum number of relationship instances that an entity can participate in.
  2. BThe cardinality ratio for a binary relationship specifies the minimum number of relationship instances that an entity can participate in.
  3. CThe partial participation constraint is also called existence dependency.
  4. DThe cardinality ratio for a binary relationship specifies the average number of relationship instances that an entity can participate in.
Show answerHide answer

Correct answer: (A) The cardinality ratio for a binary relationship specifies the maximum number of relationship instances that an entity can participate in.

Q102CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following represents the function of a Multiplexer?
  1. AY = A + B
  2. BY = A | B
  3. CY = A & B
  4. DY = S ? A : B
Show answerHide answer

Correct answer: (D) Y = S ? A : B

Q103CIL MT Systems, 26 Mar 2017 (12:30 PM)
The prefix equivalent of the following infix expression is: a / b − c + d * e − a * c
  1. A− + − / a b c * d e * a c
  2. B+ − − / a b c * d e * a c
  3. C− + / a b c − * d e * a c
  4. D− − + / a b c * d e * a c
Show answerHide answer

Correct answer: (A) − + − / a b c * d e * a c

Q104CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following file-type arguments is used in fopen() library function to open a new file for both reading and writing, and destroys the file if a file with the specified file-name already exists in the current directory?
  1. A"w"
  2. B"w+"
  3. C"a+"
  4. D"r+"
Show answerHide answer

Correct answer: (B) "w+"

Q105CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following statements about IPv6 is FALSE?
  1. AIPSec support is an integral part of IPv6.
  2. BIPv6 has no way to distinguish delay-sensitive packets from bulk data transfers.
  3. CIn comparison to IPv4, IPv6 has improved header structure with less processing overhead.
  4. DIPv6 routers no longer have to fragment packets.
Show answerHide answer

Correct answer: (B) IPv6 has no way to distinguish delay-sensitive packets from bulk data transfers.

Q106CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following does not represent the total number of multiplications for multiplying four matrices of orders 20 × 2, 2 × 30, 30 × 12 and 12 × 8?
  1. A1232
  2. B3680
  3. C10320
  4. D8850
Show answerHide answer

Correct answer: (D) 8850

Q107CIL MT Systems, 26 Mar 2017 (12:30 PM)
Two schedules are said to be ______, if the order of any two conflicting operations is same in both the schedules.
  1. Aconflict equivalent
  2. Bschema equivalent
  3. Cresult equivalent
  4. Dview equivalent
Show answerHide answer

Correct answer: (A) conflict equivalent

Q108CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following data structures allows both addition and deletion of items from either end?
  1. ADouble Ended Queue
  2. BQueue
  3. CPriority Queue
  4. DStack
Show answerHide answer

Correct answer: (A) Double Ended Queue

Q109CIL MT Systems, 26 Mar 2017 (12:30 PM)
Considering the relation schemas R (A, B, C, D) and S (C, D, E, F), what will be the degree of the resultant relation of the following Relational Algebra expression, where "*" represents the "natural join" operation? (σc1(ΠA,B,C(R))) * (σc2(ΠC,D,E(S)))
  1. A3
  2. B4
  3. C6
  4. D5
Show answerHide answer

Correct answer: (D) 5

Q110CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following will be the encoding of string "aabaabaca" using Huffman's coding?
  1. A110111011001
  2. B110111011111
  3. C110111111001
  4. D110011011011
Show answerHide answer

Correct answer: (A) 110111011001

Q111CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following is the time complexity of dynamic programming algorithm to compute the Binomial coefficient nCk?
  1. AΘ(nk)
  2. BΘ(kⁿ)
  3. CΘ(nᵏ)
  4. DΘ(n + k)
Show answerHide answer

Correct answer: (A) Θ(nk)

Q112CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following constraints enforces that the value of the primary key cannot be Null?
  1. AKey constraint
  2. BForeign key constraint
  3. CEntity integrity constraint
  4. DDomain constraint
Show answerHide answer

Correct answer: (C) Entity integrity constraint

Q113CIL MT Systems, 26 Mar 2017 (12:30 PM)
Two concurrent processes P and Q execute the following code. Process P: while(True){ W: ____ print('0'); print('0'); X: ____ } Process Q: while(True){ Y: ____ print('1'); print('1'); Z: ____ } Given S and T are binary semaphore variables, and P() and V() as standard "wait" and "signal" functions respectively. What should be the semaphore operations W, X, Y, and Z for the output string: 11001100…?
  1. AW=P(T), X=V(S), Y=P(S), Z=V(T), S=1, T=0
  2. BW=P(T), X=V(S), Y=P(S), Z=V(T), S=T=1
  3. CW=P(T), X=V(T), Y=P(S), Z=V(S), S=T=1
  4. DW=P(T), X=V(T), Y=P(S), Z=V(S), S=1, T=0
Show answerHide answer

Correct answer: (A) W=P(T), X=V(S), Y=P(S), Z=V(T), S=1, T=0

Q114CIL MT Systems, 26 Mar 2017 (12:30 PM)
The output of the following 'C' language code is: void main(){ int x=1, i, y=2; for (i=0;i<10;i++) { x << 1; y=x+i; } printf("%d,%d",x,y); }
  1. A10,11
  2. B1,1
  3. C10,1
  4. D1,10
Show answerHide answer

Correct answer: (D) 1,10

Q115CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following protocols is built on client-server architecture and uses separate control and data connections between the client and the server?
  1. AFTP
  2. BSMTP
  3. CPOP
  4. DTELNET
Show answerHide answer

Correct answer: (A) FTP

Q116CIL MT Systems, 26 Mar 2017 (12:30 PM)
An organization has a Class B Network and wishes to form subnets for 60 departments. The subnet mask would be:
  1. A255.255.64.0
  2. B255.255.0.0
  3. C255.255.252.0
  4. D255.255.255.0
Show answerHide answer

Correct answer: (C) 255.255.252.0

Q117CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following is an NP-complete problem?
  1. ATuring's Halting problem
  2. BCNF-Satisfiability problem
  3. CPresburger Arithmetic problem
  4. DNumber of Hamiltonian circuits in a complete graph of 'n' vertices with n > 2
Show answerHide answer

Correct answer: (B) CNF-Satisfiability problem

Q118CIL MT Systems, 26 Mar 2017 (12:30 PM)
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
  1. AOnly II
  2. BI, II, III and IV
  3. CII and IV
  4. DI, III and IV
Show answerHide answer

Correct answer: (A) Only II

Q119CIL MT Systems, 26 Mar 2017 (12:30 PM)
The data type of the variable "var1" declared in the following 'C' language statement is: unsigned var1;
  1. Aint
  2. Bdouble
  3. Cchar
  4. Dfloat
Show answerHide answer

Correct answer: (A) int

Q120CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following problem cannot be solved using greedy approach?
  1. A0-1 knapsack
  2. BJob scheduling
  3. CMinimum spanning tree
  4. DHuffman code
Show answerHide answer

Correct answer: (A) 0-1 knapsack

Q121CIL MT Systems, 26 Mar 2017 (12:30 PM)
The decimal number 395, when converted into binary occupies ______ binary digits, whereas when it is represented using BCD codes, occupies ______ binary digits.
  1. A12; 9
  2. B7; 12
  3. C9; 12
  4. D12; 7
Show answerHide answer

Correct answer: (C) 9; 12

Q122CIL MT Systems, 26 Mar 2017 (12:30 PM)
Match the following. List I: I) Attenuation, II) Shannon capacity, III) Nyquist bit rate, IV) Distortion List II: P) Loss of energy, Q) Changes in shape of the signal, R) Noisy channel, S) Noiseless channel
  1. AI – P, II – Q, III – R, IV – S
  2. BI – P, II – R, III – S, IV – Q
  3. CI – S, II – R, III – Q, IV – P
  4. DI – Q, II – P, III – S, IV – R
Show answerHide answer

Correct answer: (B) I – P, II – R, III – S, IV – Q

Q123CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following relation schema is always in BCNF?
  1. AR(A, B, C, D)
  2. BR(A, B, C)
  3. CR(A, B, C, D, E)
  4. DR(A, B)
Show answerHide answer

Correct answer: (D) R(A, B)

Q124CIL MT Systems, 26 Mar 2017 (12:30 PM)
Let K2,2 be a complete bipartite graph with vertices 1 and 2 on one side and vertices 3 and 4 on the other side (each of 1 and 2 is joined to both 3 and 4). Which of the following is the total number of paths of length 3 from vertex 1 to vertex 4?
  1. A2
  2. B3
  3. C4
  4. D1
Show answerHide answer

Correct answer: (C) 4

Q125CIL MT Systems, 26 Mar 2017 (12:30 PM)
Consider the list of numbers 1, 2, 3, …, 1000 is stored in a[0..999]. What will be the total number of comparisons to search x = 501 using the following binary search() function? int binary_search(int a[], int n, int x){ int low=0, high=n-1; while(low <= high){ int m = (low + high) / 2; if(x > a[m]) low = m + 1; else if(x < a[m]) high = m − 1; else return m; } return -1; }
  1. A2
  2. B15
  3. C17
  4. D1
Show answerHide answer

Correct answer: (C) 17

Q126CIL MT Systems, 26 Mar 2017 (12:30 PM)
Match the following. List-1: A. Moves suspended process to secondary storage, B. Loads the processes into memory for execution, C. Moves one of the processes to Running state, D. Allocates CPU to a process List-2: I. Short-Term Scheduler, II. Dispatcher, III. Medium-Term Scheduler, IV. Long-Term Scheduler
  1. AA – III, B – IV, C – I, D – II
  2. BA – II, B – I, C – IV, D – III
  3. CA – III, B – I, C – II, D – IV
  4. DA – II, B – IV, C – I, D – III
Show answerHide answer

Correct answer: (A) A – III, B – IV, C – I, D – II

Q127CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following is the Postorder traversal of the binary tree whose Inorder and Preorder traversals are as follows? In-order : OLCHJBEKNGMADFI Preorder : KHLOCBJEAGNMFDI
  1. AADFLIBNCJEMGHOK
  2. BOCLJEBGDIAFNMHK
  3. CADFLIBNMGJCEHOK
  4. DOCLJEBHNMGDIFAK
Show answerHide answer

Correct answer: (D) OCLJEBHNMGDIFAK

Q128CIL MT Systems, 26 Mar 2017 (12:30 PM)
If P is a two-dimensional array having 10 rows and 20 columns, then which of the following cannot be used to access the element in row 2 and column 5?
  1. AP[2][5]
  2. B*(*(P + 2) + 5)
  3. C*(P[2] + 5)
  4. D*(P + 2 + 5)
Show answerHide answer

Correct answer: (D) *(P + 2 + 5)

Q129CIL MT Systems, 26 Mar 2017 (12:30 PM)
Given total number of instances of a resource to be 18, three processes (P1, P2, and P3) and the resource requirement and allocation table are given below. Which of the following orders of process execution forms a safe (deadlock free) sequence? Process – Max. Need – Current Allocation P1 – 12 – 7 P2 – 10 – 5 P3 – 5 – 4
  1. A<P1, P2, P3>
  2. B<P3, P1, P2>
  3. C<P1, P3, P2>
  4. D<P2, P1, P3>
Show answerHide answer

Correct answer: (B) <P3, P1, P2>

Q130CIL MT Systems, 26 Mar 2017 (12:30 PM)
What will be the "First" and "Follow" of E and F for the following grammar? E -> TE' E' -> +TE' / ε T -> FT' T' -> *FT' / ε F -> id / (E)
  1. AFirst(E)={id, (, ε}, Follow(E)={ε, )}, First(F)={id, ), $}, Follow(F)={*, $, (}
  2. BFirst(E)={id, (}, Follow(E)={$, )}, First(F)={id, (}, Follow(F)={*, $, ), +}
  3. CFirst(E)={id, ), ε}, Follow(E)={ε, )}, First(F)={id, )}, Follow(F)={*, $, (, +}
  4. DFirst(E)={id, )}, Follow(E)={$, )}, First(F)={id, (, $}, Follow(F)={*, $, ), +}
Show answerHide answer

Correct answer: (B) First(E)={id, (}, Follow(E)={$, )}, First(F)={id, (}, Follow(F)={*, $, ), +}

Q131CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following recurrence relation can be solved using Master theorem?
  1. AT(n) = 64T(n/8) − n
  2. BT(n) = 2T(n/2) + n/(log n)
  3. CT(n) = 2ⁿT(n/2) + n
  4. DT(n) = 2T(n/2) + 1
Show answerHide answer

Correct answer: (D) T(n) = 2T(n/2) + 1

Q132CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following statements is TRUE for the grammar given below? S -> (L) / a L -> L,S / S
  1. AThe grammar can be parsed by LR(0) parser only
  2. BThe grammar can be parsed by LR(0) and SLR(1) parsers
  3. CThe grammar can be parsed by LL(1) parser only
  4. DThe grammar can be parsed by LL(1) and LR(0) parsers
Show answerHide answer

Correct answer: (B) The grammar can be parsed by LR(0) and SLR(1) parsers

Q133CIL MT Systems, 26 Mar 2017 (12:30 PM)
Match the following. List-1: I) Class-A IP address, II) Class-B IP address, III) Class-C IP address List-2: A) 8 bit host id and 24 bit network id, B) 16 bit host id and 16 bit network id, C) 24 bit host id and 8 bit network id
  1. AI – C, II – A, III – B
  2. BI – C, II – B, III – A
  3. CI – A, II – B, III – C
  4. DI – B, II – C, III – A
Show answerHide answer

Correct answer: (B) I – C, II – B, III – A

Q134CIL MT Systems, 26 Mar 2017 (12:30 PM)
The number of tokens in the following 'C' language statement is: printf("The number of tokens are %d", &tcount);
  1. A8
  2. B9
  3. C10
  4. D11
Show answerHide answer

Correct answer: (A) 8

Q135CIL MT Systems, 26 Mar 2017 (12:30 PM)
Suppose that we have an ordered file with r = 30000 records stored on a disk with block size B = 1024 bytes. If file records are of fixed size and are unspanned with record length R = 100 bytes, the blocking factor for the file and the number of blocks needed for the file are ______ and ______ respectively.
  1. A110, 3000
  2. B10, 3000
  3. C110, 30000
  4. D10, 300
Show answerHide answer

Correct answer: (B) 10, 3000

Q136CIL MT Systems, 26 Mar 2017 (12:30 PM)
If L = {ab, c} is a language over the set A = {a, b, c}, then L³ is:
  1. A{ababc, abcab, abc², cabab, cabc, c²ab, c³}
  2. B{ababab, ababc, abcab, abc², cabab, c²ab, c³}
  3. C{ababab, ababc, abcab, abc²abab, cabab, cabc, c²ab, c³}
  4. D{ababab, ababc, abcab, abc², cabab, cabc, c²ab, c³}
Show answerHide answer

Correct answer: (D) {ababab, ababc, abcab, abc², cabab, cabc, c²ab, c³}

Q137CIL MT Systems, 26 Mar 2017 (12:30 PM)
Consider the following Adjacency matrix corresponding to some weighted Graph 'G' (rows and columns are vertices 1 to 5). Vertex 1: 0 5 0 10 2 Vertex 2: 5 0 4 6 2 Vertex 3: 0 4 0 1 0 Vertex 4: 10 6 1 0 7 Vertex 5: 2 2 0 7 0 What is the weight of the minimum spanning tree for the graph 'G'?
  1. A11
  2. B9
  3. C10
  4. D8
Show answerHide answer

Correct answer: (B) 9

Q138CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following is used to specify whether the existence of an entity depends on its being related to another entity via the relationship type?
  1. AEntity integrity constraint
  2. BForeign key constraint
  3. CCardinality ratio
  4. DParticipation constraint
Show answerHide answer

Correct answer: (D) Participation constraint

Q139CIL MT Systems, 26 Mar 2017 (12:30 PM)
Logical data independence is the ability to change ______ schema without having to change ______ schema.
  1. Ainternal; external
  2. Bconceptual; internal
  3. Cconceptual; external
  4. Dinternal; conceptual
Show answerHide answer

Correct answer: (C) conceptual; external

Q140CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following addressing modes is more appropriate for accessing elements of an array?
  1. AIndex mode
  2. BAuto increment mode
  3. CDisplacement mode
  4. DRegister mode
Show answerHide answer

Correct answer: (A) Index mode

Q141CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following 'C' language arithmetic expressions has logical error?
  1. A-13 % -5 + 3;
  2. B4 / (-10 % -2) / 3;
  3. C3 / (-13 % -5) / 3;
  4. D-5 % 3 / 13;
Show answerHide answer

Correct answer: (B) 4 / (-10 % -2) / 3;

Q142CIL MT Systems, 26 Mar 2017 (12:30 PM)
Match the following. List-1: (I) (X')', (II) (X + Y)' = X'.Y', (III) X(X + Y) = X, (IV) X + YZ = (X + Y)(X + Z) List-2: (A) De Morgan law, (B) Involution, (C) Distributive, (D) Absorption
  1. AI – D, II – A, III – B, IV – C
  2. BI – C, II – A, III – D, IV – B
  3. CI – B, II – A, III – D, IV – C
  4. DI – B, II – D, III – A, IV – C
Show answerHide answer

Correct answer: (C) I – B, II – A, III – D, IV – C

Q143CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following statements is FALSE?
  1. AJohnson counter is a synchronous counter.
  2. BRipple counter is an asynchronous counter.
  3. CAsynchronous counters are slower than synchronous counters.
  4. DA counter may count up or count down, but cannot count both up and down.
Show answerHide answer

Correct answer: (D) A counter may count up or count down, but cannot count both up and down.

Q144CIL MT Systems, 26 Mar 2017 (12:30 PM)
Consider the following relation schema R and S along with their tuple sets. R(A, B) = {<a1, b1>, <a2, b1>, <a3, b1>, <a4, b1>, <a1, b2>, <a3, b2>, <a2, b3>, <a3, b3>, <a4, b3>, <a1, b4>, <a2, b4>, <a3, b4>} S(A) = {a1, a2, a3} What is the value of T ← R / S, where "/" represents the Relational Algebra "division" operation?
  1. AT(B) = {b1, b3}
  2. BT(B) = {b1, b2, b4}
  3. CT(B) = {b1, b4}
  4. DT(B) = {b1, b3, b4}
Show answerHide answer

Correct answer: (C) T(B) = {b1, b4}

Q145CIL MT Systems, 26 Mar 2017 (12:30 PM)
Considering the following key using a block of five characters, encryption of the message "NETWORKING" using the Transposition Cipher is: Plaintext : 5 4 3 2 1 Ciphertext : 1 2 3 4 5
  1. AGNIKROWTEN
  2. BOGWNTIEKNR
  3. COWTENGNIKR
  4. DNREKTIWNOG
Show answerHide answer

Correct answer: (C) OWTENGNIKR

Q146CIL MT Systems, 26 Mar 2017 (12:30 PM)
If every production is of the form α → β where |α| ≤ |β| or of the form α → λ, then the grammar is said to be of:
  1. AType 3
  2. BType 1
  3. CType 0
  4. DType 2
Show answerHide answer

Correct answer: (B) Type 1

Q147CIL MT Systems, 26 Mar 2017 (12:30 PM)
Assume that source S and destination D are connected through five intermediate routers R1, R2, R3, R4 and R5. Determine how many times each packet has to visit the Network layer and the Data Link layer during transmission from S to D?
  1. ANetwork Layer: 7 times, Data Link Layer: 12 times
  2. BNetwork Layer: 5 times, Data Link Layer: 12 times
  3. CNetwork Layer: 12 times, Data Link Layer: 12 times
  4. DNetwork Layer: 7 times, Data Link Layer: 7 times
Show answerHide answer

Correct answer: (A) Network Layer: 7 times, Data Link Layer: 12 times

Q148CIL MT Systems, 26 Mar 2017 (12:30 PM)
Which of the following statements about the "DELETE" command is FALSE?
  1. AIt removes tuples from a relation (table).
  2. BIt removes tuples as well as the relation (table).
  3. CA missing WHERE clause specifies that all tuples in the relation are to be deleted.
  4. DDepending on the number of tuples selected by the condition in the WHERE clause, zero, one or several tuples can be deleted by a single DELETE command.
Show answerHide answer

Correct answer: (B) It removes tuples as well as the relation (table).

Q149CIL MT Systems, 26 Mar 2017 (12:30 PM)
Given the Burst Time (BT) of 4 processes P1, P2, P3 and P4 as BT(t1, t2, t3, t4) = (4, 8, 6, 7), smoothening factor (α) = 0.5, and T1 = 10, what will be the burst time of process P5 for Shortest Job First scheduling, using the technique of exponential averaging?
  1. A6.875 unit time
  2. B6.25 unit time
  3. C5.785 unit time
  4. D5.5 unit time
Show answerHide answer

Correct answer: (A) 6.875 unit time

Q150CIL MT Systems, 26 Mar 2017 (12:30 PM)
In order to sort list of numbers using radix sort algorithm, we need to get the individual digits of each number 'n' of the list. If n is a positive decimal integer, then iᵗʰ digit, from right, of the number n is:
  1. A⌊n / 10^(i−1)⌋ % 10
  2. B⌈n / 10^i⌉ % 10
  3. C⌈n / 10^(i−1)⌉ % 10
  4. D⌊n / 10^i⌋ % 10
Show answerHide answer

Correct answer: (A) ⌊n / 10^(i−1)⌋ % 10

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.

More CIL MT subjects

English 75General Awareness 75Mathematics 75Reasoning 64