During a content search operation in associative memory, which register temporarily holds the key used to compare against all stored memory words simultaneously?
Show answerHide answer
Correct answer: (C) Argument Register
CIL MT · Computer Science
Algorithms Previous Year Questions
16 Algorithms (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.
- 16 questions
- Official answer key
- Free
Other Computer Science topics
Which of the following is true about Selection Sort?
Show answerHide answer
Correct answer: (B) It has O(n²) time complexity in all cases.
Which statement best describes both an advantage and a disadvantage of Insertion Sort?
Show answerHide answer
Correct answer: (B) Efficient for nearly sorted data due to adaptability but impractical for large datasets due to O(n2) complexity.
Which notation represents the worst-case time complexity?
Show answerHide answer
Correct answer: (B) Big O (O)
What is the space complexity of an algorithm that uses only a constant amount of memory regardless of input size?
Show answerHide answer
Correct answer: (D) O(1)
A logistics company manages a tracking system where each package ID is stored in a chronological list as the packages are processed. An engineer suggests that, to locate a particular package's ID, the system should check each ID sequentially from the start until the target is found or the list ends. Which statement most accurately reflects the main drawback of this approach if the company expects the number of packages to increase dramatically over time?
Show answerHide answer
Correct answer: (B) Search time grows linearly with the number of packages.
A list of n-1 integers is provided, where each integer is in the range of 1 to n, and there are no duplicates. One integer is missing from the list. What is the time and space complexity if we apply a brute force algorithm to find the missing integer?
Show answerHide answer
Correct answer: (D) O(n2) time, O(1) space
Which of the following is the time complexity of dynamic programming algorithm to compute the Binomial coefficient nCk?
Show answerHide answer
Correct answer: (A) Θ(nk)
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;
}
Show answerHide answer
Correct answer: (C) 17
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:
Show answerHide answer
Correct answer: (A) ⌊n / 10^(i−1)⌋ % 10
Which of the following is the every-case time complexity of dynamic programming algorithm for "traversing salesperson" problem to traverse 'n' cities?
Show answerHide answer
Correct answer: (B) Θ(n · 2ⁿ)
Which of the following statements related to Cache memory organization is FALSE?
Show answerHide answer
Correct answer: (A) In "write through" approach, main memory content is always invalid.
In RSA algorithm if p = 7, q = 11 and e = 13 then what will be the value of d?
Show answerHide answer
Correct answer: (C) 37
What is mean by stable sorting algorithm?
Show answerHide answer
Correct answer: (C) A sorting algorithm is stable if it preserves the order of duplicate keys
What is the complexity of Merge Sort?
Show answerHide answer
Correct answer: (C) O(n log n)
The multiplicand register and multiplier register of hardware circuit implementing Booths algorithm have (11101) and (1100). The result shall be:
Show answerHide answer
Correct answer: (A) 812 (decimal)
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.