UTpaper

Free mock tests & test series

CIL MT · Computer Science

Data Structures Previous Year Questions (page 2)

56 Data Structures (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.

  • 56 questions
  • Official answer key
  • Free
Attempt CIL MT papers →All Computer Science questions

Other Computer Science topics

DBMS & SQL 53Theory of Computation & Compilers 27Digital Logic & Number Systems 26Computer Networks 22Operating Systems 21Algorithms 16Computer Organization & Architecture 16Programming in C/C++ 11Discrete Mathematics 10
Q51CIL 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)

Q52CIL 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

Q53CIL 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

Q54CIL 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

Q55CIL 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.

Q56CIL 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.

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