Which of the following statements about "total specialization" constraint is TRUE?
Show answerHide answer
Correct answer: (B) Every entity in the superclass must be a member of at least one subclass in the specialization.
CIL MT · Topic-wise previous year questions
Computer Science Previous Year Questions (page 4)
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
Practise by topic
In a B-Tree of order m (m > 1), every non-leaf node (except root node) has the number of children between:
Show answerHide answer
Correct answer: (B) ⌈m/2⌉ and m
Which of the following statements about Secure Shell Protocol (SSH) is FALSE?
Show answerHide answer
Correct answer: (A) SSH cannot be used for file transfer and e-mail tasks.
Which of the following statements is INCORRECT with respect to pointers declared in the following 'C' language code?
void main(){
int a[10], *p, *q;
p=&a[5];
q=&a[7];
}
Show answerHide answer
Correct answer: (D) P+q
Considering the process details given in the following table, what will be the completion order of the processes under the policies FCFS and RR (with CPU quantum of 2 time units)?
Process ID – CPU Burst – Arrival Time
P1 – 5 – 3
P2 – 7 – 2
P3 – 5 – 0
Show answerHide answer
Correct answer: (B) FCFS: P3, P2, P1 and RR: P3, P1, P2
Which of the following represents the language over the set A = {a, b} consisting of all words beginning with one or more a's and followed by the same number of b's?
Show answerHide answer
Correct answer: (C) L = {aᵐbᵐ : m > 0}
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.
If D = {R1, R2} is a decomposition of R, and F is the set of functional dependencies on R, then which of the following ensures that the decomposition D is lossless (nonadditive)?
Show answerHide answer
Correct answer: (A) ((R1 ∩ R2) → (R1 − R2)) ∈ F⁺
The 9's compliment of the decimal number 139452 is:
Show answerHide answer
Correct answer: (C) 860547
A flip-flop has a 20-nano second delay from the time its CP input goes from 1 to 0 to the time the output is complimented. What is the maximum delay in a 16-bit binary ripple counter that uses these flip-flops?
Show answerHide answer
Correct answer: (B) 320 ns
Let L be the language on A = {a, b, c} which consists of all words of the form w = aʳbˢcᵗ where r, s, t > 0. Which of the following is the valid regular expression 'r' such that L = L(r)?
Show answerHide answer
Correct answer: (D) r = aa*bb*cc*
Match the following.
List-I: I) Dijkstra's Algorithm, II) Tower of Hanoi, III) Floyd-Warshall Algorithm, IV) Merge Sort
List-II: P) Divide and Conquer Approach, Q) Greedy Approach, R) Dynamic Approach, S) Recursion
Show answerHide answer
Correct answer: (A) I – Q, II – S, III – R, IV – P
The listing of nodes after applying the preorder traversal over the following binary tree is:
A is the root. A has left child B and right child C. B has left child D and right child E. C has left child F and right child G. D has children H (left) and I (right). E has children J (left) and K (right). F has a single left child L.
Show answerHide answer
Correct answer: (D) A, B, D, H, I, E, J, K, C, F, L, G
Consider the following relation schema R along with the tuples.
Employee(name, salary) = {<e1, 10000>, <e2, 5000>, <e3, 2500>, <e4, 7500>, <e5, 8900>, <e6, 9800>}
What is the output of following SQL query?
SELECT name, MAX(salary) FROM Employee WHERE salary < (SELECT MAX(salary) FROM Employee);
Show answerHide answer
Correct answer: (C) <e6, 9800>
Maximum number of edges in a simple graph with 'n' vertices and 'k' components is:
Show answerHide answer
Correct answer: (B) (n − k)(n − k + 1)/2
The number of elements in a one-dimensional array with lowest and highest index values as −1024 and 1024 is:
Show answerHide answer
Correct answer: (D) 2049
Total number of spanning tree of a complete graph of 4 vertices K₄ is:
Show answerHide answer
Correct answer: (B) 16
Which of the following relationships holds for non-random-access memory, where Tₙ = average time to read or write n bits, Tₐ = average access time, n = number of bits and r = transfer rate in bits per second?
Show answerHide answer
Correct answer: (B) Tₙ = Tₐ + n/r
Match the following.
List-1: I) Independent access, II) Parallel access, III) Mirroring, IV) Striping
List-2: A) RAID 0, B) RAID 3, C) RAID 5, D) RAID 1
Show answerHide answer
Correct answer: (B) I – C, II – B, III – D, IV – A
Consider an information exchange scenario where Anthony is the sender and Bond is the intended recipient of the data. Match the following appropriately.
List I: I) Message authentication, II) Message confidentiality, III) Message integrity, IV) Message non-repudiation
List II: A) Anthony must not be able to deny sending a message that he or she, in fact, did send; B) The message must arrive at the Bond's side exactly as it was sent; C) Bond needs to be sure of Anthony's identity and that an imposter has not sent the message; D) The transmitted message must make sense to only Bond, and to all others it must be garbage
Show answerHide answer
Correct answer: (C) I – C, II – D, III – B, IV – A
If the address of the operand is embedded in the instruction code itself, then the addressing mode is termed as:
Show answerHide answer
Correct answer: (B) Direct mode
Consider the process details given in the following table.
Process ID – CPU Burst – Arrival Time – Priority
P0 – 3 – 0 – 1
P1 – 9 – 2 – 4
P2 – 7 – 4 – 3
P3 – 6 – 3 – 2
A new pre-emptive scheduling algorithm is proposed, i.e., the Longest Remaining Time Next (LRTN), wherein ties are broken by giving priority to the process with the highest priority. Calculate the following.
i. Turnaround time for Process P2
ii. Response time for Process P3
Show answerHide answer
Correct answer: (A) (i) 20, (ii) 6
Under normal circumstances, the cardinality ratio of the binary relationship "Write" relating "Author" and "Book" entities is:
Show answerHide answer
Correct answer: (D) M : N
If T is a binary tree with N nodes, then the number of levels is at least:
Show answerHide answer
Correct answer: (A) ⌈log₂(N + 1)⌉
Which of the following declares 'pf' as a pointer to a function, which returns an integer quantity and requires two integer arguments?
Show answerHide answer
Correct answer: (B) int (*pf) (int, int);
The output of the following 'C' language code is:
void main(){
char arr[10];
arr = "world";
printf("%s", arr);
}
Show answerHide answer
Correct answer: (D) L-value required error
Interrupt generated due to which of the following operations does not belong to program-related interrupt category?
Show answerHide answer
Correct answer: (C) Memory parity error
What will be the minimum Hamming distance for the following coding scheme?
Data Word – Code Word
00 – 00111
01 – 01001
10 – 10101
11 – 11100
Show answerHide answer
Correct answer: (B) 2
In clustering index, the number of index entries is same as the number of:
Show answerHide answer
Correct answer: (D) distinct index field values
Which of the following operators can be used if a portion of a given bit patterns needs to be copied to a new word, while the remainder of the new word is filled with 0s?
Show answerHide answer
Correct answer: (B) Bitwise AND
Let each process Pᵢ, i=1 to 7 executes the following code.
repeat
P(mutex);
CS
V(mutex);
forever
The process P₈ executes the following code:
repeat
V(mutex);
CS
V(mutex);
forever
What is the maximum number of processes that can be present in the critical section at any point of time? Given that the initial value of binary semaphore variable "mutex" is 1.
Show answerHide answer
Correct answer: (B) 8
Which of the following is the best-case time complexity of Floyd's algorithm for finding shortest paths in a graph with 'n' vertices?
Show answerHide answer
Correct answer: (D) Θ(n³)
State TRUE or FALSE for the following.
(i) A sine wave with a phase of 180° starts at time 0 with a zero amplitude. The amplitude is decreasing.
(ii) If a signal changes instantaneously, its frequency is zero.
(iii) In bipolar encoding, we use three voltage levels: positive, negative and zero.
(iv) Infrared signals can be used for short-range communication in a closed area using ground propagation.
Show answerHide answer
Correct answer: (A) (i) TRUE, (ii) FALSE, (iii) TRUE, (iv) FALSE
Consider the characters and their frequency counts given in the following table.
Character: a, b, c, d, e, f
Frequency (in 1000s): 24, 16, 12, 20, 8, 4
Using the Huffman coding technique, which of the following is the valid code for character 'c'?
Show answerHide answer
Correct answer: (B) 1110
A block of addresses is granted to a small organization. If one of the addresses is 210.32.64.79/26, then what will be the values of the following?
(i) First address
(ii) Last address
(iii) Total number of addresses
Show answerHide answer
Correct answer: (A) (i) 210.32.64.64, (ii) 210.32.64.127, (iii) 64
A ______ takes a directed ______ graph G and produces a linear ordering of all its vertices such that for every directed edge <v, w> in G, the vertex v comes before the vertex w in the ordering.
Show answerHide answer
Correct answer: (B) topological sort; acyclic
Match the following.
List I: I) Stack, II) Heap tree, III) Tree, IV) Binary search
List II: P) Non-linear, Q) Complete binary tree, R) Ordered list, S) Linear
Show answerHide answer
Correct answer: (B) I – S, II – Q, III – P, IV – R
Which of the following statements is TRUE for the function prototype declaration given below?
int *(*P) (char *Q[]);
Show answerHide answer
Correct answer: (C) P is a pointer to a function that accepts an argument which is an array of character pointers, and returns a pointer to an integer quantity.
Consider the following segment of codes related to process creation. How many times the message "child process created" will be printed?
#include <stdio.h>
void main(){
fork(); fork(); fork();
printf("child process created");
}
Show answerHide answer
Correct answer: (C) 8
What is the output when the following segment of 'C' code is executed?
void main(){
float a = 123.456;
printf("%7.2f, %7.3f, %12e", a, a, a);
}
Show answerHide answer
Correct answer: (B) 123.46, 123.456, 1.234560e+02
Which of the following is a seven-bit code?
Show answerHide answer
Correct answer: (A) Biquinary code
Which of the following attributes can be considered as composite, single-valued and key attribute?
Show answerHide answer
Correct answer: (D) Enrollment number
Which of the following statements about the following binary tree is FALSE?
A is the root. A has left child B and right child C. B has left child D and right child E. C has left child F and right child G. D has children H (left) and I (right). E has children J (left) and K (right). F has a single left child L.
Show answerHide answer
Correct answer: (A) It is a binary search tree.
The default storage class for functions in 'C' language is:
Show answerHide answer
Correct answer: (C) Extern
If T is a binary tree with number of levels as L, then the number of leaf nodes in the binary tree is at most:
Show answerHide answer
Correct answer: (D) 2^(L−1)
If a connected graph G does not contain any vertex whose removal disconnects the rest of the graph, then G is called:
Show answerHide answer
Correct answer: (A) Biconnected graph
Consider a cache memory organization with m lines in which the cache is divided into v sets, each of which consists of k lines. The set associative mapping technique reduces to direct mapping when:
Show answerHide answer
Correct answer: (C) v = m and k = 1
Consider a memory unit of size 96 K × 16, where the first component represents the total number of words and the second component represents the number of bits per word. What will be the number of address lines and input-output data lines?
Show answerHide answer
Correct answer: (C) 17 address lines, 16 data lines
A _______ is a pictorial depiction of the schema of a database that shows the relations in the database, their attributes, and primary keys and foreign keys.
Show answerHide answer
Correct answer: (D) schema diagram
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.