UTpaper

Free mock tests & test series

CIL MT · Topic-wise previous year questions

Computer Science Previous Year Questions (page 6)

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
Q251CIL MT Systems, 27 Feb 2020 (8:00 AM)
A ______ is the combination of one or more column values in a table that make a row of data unique within the table.
  1. Aforeign key
  2. Bnatural key
  3. Ccandidate key
  4. Dprimary key
Show answerHide answer

Correct answer: (D) primary key

Q252CIL MT Systems, 27 Feb 2020 (8:00 AM)
Write true (T) / false (F) for each of the following statements: A. Symbol table is used only in first phase of a compiler. B. A pretty printer analyses a program and prints it in such a way that the structure of the program becomes early visible. C. YACC build up LALR parsing table. D. If a grammar is LALR(1), it is not necessarily SLR(1)
  1. AT T F T
  2. BF T T T
  3. CT T T F
  4. DF T T F
Show answerHide answer

Correct answer: (D) F T T F

Q253CIL MT Systems, 27 Feb 2020 (8:00 AM)
The following grammar is: S → Aa | bAc | Bc | bBa A → d B → d
  1. ANot LR(1) but LALR(1)
  2. BNeither LR(1) nor LALR(1)
  3. CLR(1) and LALR(1)
  4. DLR(1) but not LALR(1)
Show answerHide answer

Correct answer: (D) LR(1) but not LALR(1)

Q254CIL MT Systems, 27 Feb 2020 (8:00 AM)
Let L be the set of all binary strings whose last two symbols are the same. The number of states in the minimum state deterministic finite state automation accepting language is _______.
  1. A2
  2. B5
  3. C8
  4. D3
Show answerHide answer

Correct answer: (B) 5

Q255CIL MT Systems, 27 Feb 2020 (8:00 AM)
______ is First in Last Out kind of data structure.
  1. AStack
  2. BArray
  3. CDeque
  4. DQueue
Show answerHide answer

Correct answer: (A) Stack

Q256CIL MT Systems, 27 Feb 2020 (8:00 AM)
What is mean by stable sorting algorithm?
  1. AA sorting algorithm is stable if it preserves the order of all keys
  2. BA sorting algorithm is stable if it preserves the order of non-duplicate keys
  3. CA sorting algorithm is stable if it preserves the order of duplicate keys
  4. DA sorting algorithm is stable if it doesn't preserve the order of duplicate keys
Show answerHide answer

Correct answer: (C) A sorting algorithm is stable if it preserves the order of duplicate keys

Q257CIL MT Systems, 27 Feb 2020 (8:00 AM)
Consider the following Inorder and Preorder traversal of a tree Inorder – D B E F A G H C Preorder – A B D E F C G H What is the Postorder Traversal of the same tree
  1. AD F E B H C G A
  2. BD F E B G H C A
  3. CD F E H B G C A
  4. DD F E B H G C A
Show answerHide answer

Correct answer: (D) D F E B H G C A

Q258CIL MT Systems, 27 Feb 2020 (8:00 AM)
In SQL – the function – avg, min, max, sum, count are called as _______.
  1. Aaggregate function
  2. Badjunct function
  3. Cscalar operation
  4. Dset operation
Show answerHide answer

Correct answer: (A) aggregate function

Q259CIL MT Systems, 27 Feb 2020 (8:00 AM)
What is the output of the following C program #include <stdio.h> int main( ) { int i=5; printf("%d %d %d", i++, i, ++i ); return 0; }
  1. A7 6 6
  2. B6 7 8
  3. C6 7 7
  4. D5 6 7
Show answerHide answer

Correct answer: (C) 6 7 7

Q260CIL MT Systems, 27 Feb 2020 (8:00 AM)
What is number of page faults by least recently used page replacement for a memory with 4 frames for the page reference string 2, 0, 1, 2, 4, 0, 5, 1, 4, 6, 4, 2, 1, 3, 0?
  1. A9
  2. B7
  3. C8
  4. D10
Show answerHide answer

Correct answer: (D) 10

Q261CIL MT Systems, 27 Feb 2020 (8:00 AM)
Relations and fields can be renamed in relational algebra using the renaming operator _______.
  1. Aρ (rho)
  2. Bσ (sigma)
  3. Cθ (theta)
  4. D⋈ (join)
Show answerHide answer

Correct answer: (A) ρ (rho)

Q262CIL MT Systems, 27 Feb 2020 (8:00 AM)
Consider the binary search tree with n elements. The time required to search given element is: _______
  1. AO(log n)
  2. BO(n log n)
  3. CO(n² log n)
  4. DO(n²)
Show answerHide answer

Correct answer: (A) O(log n)

Q263CIL MT Systems, 27 Feb 2020 (8:00 AM)
In Database management system ACID property refers to:
  1. AAuthenticity, Consistency, Isolation, and Durability
  2. BAtomicity, Confidentiality, Isolation, and Durability
  3. CAtomicity, Consistency, Isolation, and Durability
  4. DAtomicity, Consistency, Integrity, and Durability
Show answerHide answer

Correct answer: (C) Atomicity, Consistency, Isolation, and Durability

Q264CIL MT Systems, 27 Feb 2020 (8:00 AM)
Which of the following statement is true?
  1. AAny logic expression can be implemented using only NAND gates
  2. BAny logic expression can be implemented using only EXNOR gates
  3. CAny logic expression can be implemented using only NOT gates
  4. DAny logic expression can be implemented using only XOR gates
Show answerHide answer

Correct answer: (A) Any logic expression can be implemented using only NAND gates

Q265CIL MT Systems, 27 Feb 2020 (8:00 AM)
Mutual Exclusion Problem occurs _________.
  1. Abetween two processes that uses different resources of different machines.
  2. Bbetween two disjoint processes that do not interact
  3. Camong processes that share resources
  4. Damong processes that do not use the same resource
Show answerHide answer

Correct answer: (C) among processes that share resources

Q266CIL MT Systems, 27 Feb 2020 (8:00 AM)
The time complexity of searching an element in linked list of length n will be:
  1. AO(n log n)
  2. BO(log n)
  3. CO(n)
  4. DO(n²)
Show answerHide answer

Correct answer: (C) O(n)

Q267CIL MT Systems, 27 Feb 2020 (8:00 AM)
Consider the disk which has average seek time of 32 ns and rotational rate of 360 rpm (round per minute), Each track of the disk has 512 sectors, each of size 512 bytes. What is the time taken to read four continuous sectors? And What is the data transfer rate?
  1. A0.0443s and 936 Kbps
  2. B0.0843s and 1536 Kbps
  3. C0.1043s and 1736 Kbps
  4. D0.0943s and 1636 Kbps
Show answerHide answer

Correct answer: (B) 0.0843s and 1536 Kbps

Q268CIL MT Systems, 27 Feb 2020 (8:00 AM)
MSB stands for:
  1. AMiddle significant bit
  2. BMeasured significant bit
  3. CMaximum significant bit
  4. DMost significant bit
Show answerHide answer

Correct answer: (D) Most significant bit

Q269CIL MT Systems, 27 Feb 2020 (8:00 AM)
Which scheduling algorithm gives a minimum average waiting time?
  1. ARR
  2. BPriority
  3. CSJF
  4. DFCFS
Show answerHide answer

Correct answer: (C) SJF

Q270CIL MT Systems, 27 Feb 2020 (8:00 AM)
Consider the following statements 1. Insertion Sort and Merge Sort are stable. 2. Heap Sort is inherently unstable. 3. Selection Sort is not inherently stable, but may be coded in such a way that it is stable
  1. AOnly statement 1 is correct
  2. BAll statements are correct
  3. CStatement 3 is not correct
  4. DOnly statement 1 and 2 is correct
Show answerHide answer

Correct answer: (B) All statements are correct

Q271CIL MT Systems, 27 Feb 2020 (8:00 AM)
Which of the following statement is false?
  1. AEvery regular language is also a context free language
  2. BEvery non deterministic Turing machine can be converted to an equivalent deterministic Turing machine
  3. CEvery subset of recursively enumerable set is recursive.
  4. DEvery NFA can be converted into equivalent DFA
Show answerHide answer

Correct answer: (C) Every subset of recursively enumerable set is recursive.

Q272CIL MT Systems, 27 Feb 2020 (8:00 AM)
A Tuple Relational Calculus query is expressed as ________.
  1. A{ T | p(T) }
  2. B{ P( ) | T }
  3. C{ p(T) | T }
  4. D{ T | P() | T }
Show answerHide answer

Correct answer: (A) { T | p(T) }

Q273CIL MT Systems, 27 Feb 2020 (8:00 AM)
Consider the grammar S → AbBaCc | ε A → aAb | ba B → bBC | cb C → cCa | ac Find the First ( ) of S
  1. A{a, b, ε}
  2. B{ε}
  3. C{a, ε}
  4. D{a, b, c, ε}
Show answerHide answer

Correct answer: (A) {a, b, ε}

Q274CIL MT Systems, 27 Feb 2020 (8:00 AM)
Calculate the link utilization (throughput) for stop and wait flow control mechanism if the frame size is 4800 bits, bit rate is 9600 bps, and distance between the devices is 2000 km. Given propagation speed is 200000 km/s.
  1. A0.92
  2. B0.82
  3. C0.96
  4. D0.86
Show answerHide answer

Correct answer: (C) 0.96

Q275CIL MT Systems, 27 Feb 2020 (8:00 AM)
Which is the correct method to obtained 10's compliment of a decimal number?
  1. AThe minuend is added to the 10's complement of the subtrahend and carry is dropped
  2. BThe 10's complement of a decimal number is equal to 9's complement of given number minus one
  3. CThe subtrahend is added to the 10's complement of the minuend and carry is dropped
  4. DThe 10's complement of a decimal number is equal to 9's complement of given number plus one
Show answerHide answer

Correct answer: (D) The 10's complement of a decimal number is equal to 9's complement of given number plus one

Q276CIL MT Systems, 27 Feb 2020 (8:00 AM)
Maximum throughput of slotted ALOHA network is:
  1. A18.4%
  2. B36.8%
  3. C50%
  4. D35.8%
Show answerHide answer

Correct answer: (B) 36.8%

Q277CIL MT Systems, 27 Feb 2020 (8:00 AM)
Which one of the following is True?
  1. AEvery regular grammar is LL(1) and every regular set does not have an LR(1) grammar
  2. BEvery regular grammar is not LL(1) and every regular set does not have an LR(1) grammar
  3. CEvery regular grammar is LL(1) and every regular has an LR(1) grammar
  4. DEvery regular grammar is not LL(1) and every regular set has an LR(1) grammar
Show answerHide answer

Correct answer: (D) Every regular grammar is not LL(1) and every regular set has an LR(1) grammar

Q278CIL MT Systems, 27 Feb 2020 (8:00 AM)
A computer uses RAM chips of 1024 x 1 capacity. How many chips are needed to provide memory capacity of 16K bytes?
  1. A8
  2. B1024
  3. C16
  4. D128
Show answerHide answer

Correct answer: (D) 128

Q279CIL MT Systems, 27 Feb 2020 (8:00 AM)
Number of states in DFA accepting the following language is: L = { a^n b^(2m) | n, m ≥ 1 }
  1. Am
  2. Bn
  3. C5
  4. D2
Show answerHide answer

Correct answer: (C) 5

Q280CIL MT Systems, 27 Feb 2020 (8:00 AM)
Which of the following has lowest access time?
  1. AMain Memory
  2. BOptical disk
  3. CCache
  4. DRegisters
Show answerHide answer

Correct answer: (D) Registers

Q281CIL MT Systems, 27 Feb 2020 (8:00 AM)
Which of the following is equivalent of the Boolean expression given below? A + A'·B + A·B'
  1. AA + B
  2. BA + B'
  3. CB + A'
  4. DB' + A'
Show answerHide answer

Correct answer: (A) A + B

Q282CIL MT Systems, 27 Feb 2020 (8:00 AM)
Which of the following is / are correct I. A language is context free if and only if it is accepted by PDA II. PDA is a finite automata with push down stack
  1. AOnly II is true
  2. BBoth I and II are false
  3. CBoth I and II are true
  4. DOnly I is true
Show answerHide answer

Correct answer: (C) Both I and II are true

Q283CIL MT Systems, 27 Feb 2020 (8:00 AM)
With respect to deque which of the following is true?
  1. AInsertion is done only from front end
  2. BInsertion and deletion can be done at front and rear ends
  3. CDeletion is done only from rear end
  4. DInsertion is done only from rear end
Show answerHide answer

Correct answer: (B) Insertion and deletion can be done at front and rear ends

Q284CIL MT Systems, 27 Feb 2020 (8:00 AM)
A negative edge triggered flip flop transfers data from input to output on the:
  1. ALOW to HIGH transition of clock pulse
  2. BBEFORE transition of clock pulse
  3. CHIGH to LOW transition of clock pulse
  4. DWITHOUT transition of clock pulse
Show answerHide answer

Correct answer: (C) HIGH to LOW transition of clock pulse

Q285CIL MT Systems, 27 Feb 2020 (8:00 AM)
Consider the following relational schema Sailors(sid, sname, rating, age) Reserves(sid, bid, day) Boats(bid, bname, color) What is the equivalent of following relational algebra query in SQL query π_sname ((σ_color='red' Boats) ⋈ Reserves ⋈ Sailors)
  1. ASELECT S.sname, S.rating FROM Sailors S, Reserves R WHERE S.sid = R.sid AND R.bid = B.bid AND B.color = 'red'
  2. BSELECT S.sname FROM Sailors S, Reserves R, Boats B WHERE S.sid = R.sid AND R.bid = B.bid AND B.color = 'red'
  3. CSELECT S.sname FROM Sailors S, Reserves R, Boats B WHERE S.sid = R.sid AND B.color = 'red'
  4. DSELECT S.sname FROM Sailors S, Reserves R, Boats B WHERE R.bid = B.bid AND B.color = 'red'
Show answerHide answer

Correct answer: (B) SELECT S.sname FROM Sailors S, Reserves R, Boats B WHERE S.sid = R.sid AND R.bid = B.bid AND B.color = 'red'

Q286CIL MT Systems, 27 Feb 2020 (8:00 AM)
What is the complexity of Merge Sort?
  1. AO(n)
  2. BO(n² log n)
  3. CO(n log n)
  4. DO(n²)
Show answerHide answer

Correct answer: (C) O(n log n)

Q287CIL MT Systems, 27 Feb 2020 (8:00 AM)
_______ of graph is a vertex whose removal disconnects graph.
  1. AStart vertex
  2. BMiddle point
  3. CTerminal Vertex
  4. DArticulation point / Cut vertex
Show answerHide answer

Correct answer: (D) Articulation point / Cut vertex

Q288CIL MT Systems, 27 Feb 2020 (8:00 AM)
Canonical SOP form of logic expression consists of only _______.
  1. AMaxterms
  2. BLaterals
  3. CCell
  4. DMinterms
Show answerHide answer

Correct answer: (D) Minterms

Q289CIL MT Systems, 27 Feb 2020 (8:00 AM)
The following grammar is: S → Aa | bAc | dc | bda A → a
  1. ANeither LALR(1) nor SLR(1)
  2. BLALR(1) but not SLR(1)
  3. CNot LALR(1) but SLR(1)
  4. DLALR(1) and SLR(1)
Show answerHide answer

Correct answer: (B) LALR(1) but not SLR(1)

Q290CIL MT Systems, 27 Feb 2020 (8:00 AM)
A relation is in _______ form if every field contains only atomic values, that is, not lists or sets.
  1. AFirst normal
  2. BThird normal
  3. CSecond normal
  4. DFourth normal
Show answerHide answer

Correct answer: (A) First normal

Q291CIL MT Systems, 27 Feb 2020 (8:00 AM)
In hashing, collision results when _______.
  1. Aan attempt is made to delete a record at full primary bucket.
  2. Ban attempt is made to insert a record at full primary bucket.
  3. Can attempt is made to insert a record anywhere in primary bucket.
  4. Dan attempt is made to insert a record at empty primary bucket.
Show answerHide answer

Correct answer: (B) an attempt is made to insert a record at full primary bucket.

Q292CIL MT Systems, 27 Feb 2020 (8:00 AM)
In SQL, the _______ command is used to recompile view.
  1. AALTER VIEW
  2. BCOMPILE VIEW
  3. CCREATE VIEW
  4. DDEFINE VIEW
Show answerHide answer

Correct answer: (A) ALTER VIEW

Q293CIL MT Systems, 27 Feb 2020 (8:00 AM)
The multiplicand register and multiplier register of hardware circuit implementing Booths algorithm have (11101) and (1100). The result shall be:
  1. A812 (decimal)
  2. B−812 (decimal)
  3. C−12 (decimal)
  4. D12 (decimal)
Show answerHide answer

Correct answer: (A) 812 (decimal)

Q294CIL MT Systems, 27 Feb 2020 (8:00 AM)
The _______ defines a set of operations on relations, paralleling the usual algebraic operations such as addition, subtraction or multiplication, which operate on numbers.
  1. Arelational calculus
  2. Breferential integrity
  3. Crelational algebra
  4. Drelations
Show answerHide answer

Correct answer: (C) relational algebra

Q295CIL MT Systems, 27 Feb 2020 (8:00 AM)
The class of Context-free grammar is not closed under _______ operations.
  1. AConcatenation
  2. BIntersection
  3. CStar
  4. DUnion
Show answerHide answer

Correct answer: (B) Intersection

Q296CIL MT Systems, 27 Feb 2020 (8:00 AM)
Which of the following is a unary operation?
  1. AIntersection
  2. BProjection
  3. CJoin
  4. DCartesian Product
Show answerHide answer

Correct answer: (B) Projection

Q297CIL MT Systems, 27 Feb 2020 (8:00 AM)
Which of the following statement is false about Prim's algorithm?
  1. AInitially the roots key and nodes are initialized to zero.
  2. BIt may use binomial max heap to represent the priority queue.
  3. CThe complexity is O(E log V) using binary heap
  4. DThe time complexity is O(E + V log V) using Fibonacci Heap
Show answerHide answer

Correct answer: (B) It may use binomial max heap to represent the priority queue.

Q298CIL MT Systems, 27 Feb 2020 (8:00 AM)
Which of following problems are undecidable? I. Membership problem in context-free languages II. Whether a given context-free language is regular III. Whether a finite state automation halts on all inputs IV. Membership problem for type 0 languages
  1. AIII and IV
  2. BI and IV
  3. CI and II
  4. DII and IV
Show answerHide answer

Correct answer: (D) II and IV

Q299CIL MT Systems, 27 Feb 2020 (8:00 AM)
During DMA transfer, DMA controller transfers data ______.
  1. Adirectly from CPU to Memory
  2. Bdirectly from memory to CPU
  3. Cdirectly between memory and registers
  4. Ddirectly between the I/O module and main memory
Show answerHide answer

Correct answer: (D) directly between the I/O module and main memory

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