>
Tamil Nadu Common Entrance Test
>
Computer Science and IT Engineering
List of top Computer Science and IT Engineering Questions asked in Tamil Nadu Common Entrance Test
The chromatic number of a wheel graph on \( n \) vertices denoted by \( W_n \) is:
TANCET - 2024
TANCET
Computer Science and IT Engineering
Discrete Mathematics
Identify the incorrect statement regarding the use of generics and parameterized types in Java?
TANCET - 2024
TANCET
Computer Science and IT Engineering
Programming and Data Structures
Let \( S \) be an NP-complete problem and \( Q \) and \( R \) be two other problems not known to be in NP. \( Q \) is polynomial-time reducible to \( S \) and \( S \) is polynomial-time reducible to \( R \). Which one of the following statements is true?
TANCET - 2024
TANCET
Computer Science and IT Engineering
Algorithm design techniques
The regular expression of the language \(\{0, 01, 011, 0111, \dots\}\) is given by:
TANCET - 2024
TANCET
Computer Science and IT Engineering
Discrete Mathematics
A B-tree of minimum degree \( t \) can have a maximum of _________ pointers in a node.
TANCET - 2024
TANCET
Computer Science and IT Engineering
Programming and Data Structures
The stability condition for the multi-server queueing model with "c" servers is given by:
TANCET - 2024
TANCET
Computer Science and IT Engineering
Queueing Theory
If the random process is such that, "Future behavior of the process depends only on the present state and not on the past", then it is a:
TANCET - 2024
TANCET
Computer Science and IT Engineering
Probability theory
Consider the following sets of processes, with the length of CPU burst time given in milliseconds:
\(\begin{array}{|c|c|c|} \hline \text{Process} & \text{Burst Time (ms)} & \text{Priority} \\ \hline P_1 & 8 & 4 \\ P_2 & 6 & 1 \\ P_3 & 1 & 2 \\ P_4 & 9 & 2 \\ P_5 & 3 & 3 \\ \hline \end{array}\)
The processes are assumed to have arrived in the order \( P_1, P_2, P_3, P_4, P_5 \) all at time 0.
Calculate the average waiting time of each process using FCFS scheduling.
TANCET - 2024
TANCET
Computer Science and IT Engineering
Operating Systems
Consider a binary Max-heap implemented using an array. Which one of the following arrays represents a binary Max-heap?
TANCET - 2024
TANCET
Computer Science and IT Engineering
Programming and Data Structures
A greedy algorithm is an approach for solving a problem by:
TANCET - 2024
TANCET
Computer Science and IT Engineering
Algorithm design techniques
Regular expression for all strings starting with “ab” and ending with “ba” is:
TANCET - 2024
TANCET
Computer Science and IT Engineering
Discrete Mathematics
What is the if-then form of the following conditional statement? "It is time for dinner if it is 6 pm."
TANCET - 2024
TANCET
Computer Science and IT Engineering
Discrete Mathematics
Which of the following enables indirect communication in IPC?
TANCET - 2024
TANCET
Computer Science and IT Engineering
Operating Systems
The number of states required to accept the string ending with 010 is:
TANCET - 2024
TANCET
Computer Science and IT Engineering
Discrete Mathematics
If 5 TCP segments of 100-byte MSS are sent consecutively, starting with sequence number 101, 201, 301, 401, and 501, and if the first segment is lost, the ACKs returned will have ACK numbers as:
TANCET - 2024
TANCET
Computer Science and IT Engineering
Computer Networks
The probability density function of a continuous random variable \( X \) is given by \( f(x) = k(x-1)^3 \), for \( 1 \leq x \leq 3 \). The value of \( k \) is:
TANCET - 2024
TANCET
Computer Science and IT Engineering
Probability theory
What is the recurrence for the worst case of quicksort, and what is the time complexity in the worst case?
TANCET - 2024
TANCET
Computer Science and IT Engineering
Algorithm design techniques
Which of the following is not a component of the ANOVA table?
TANCET - 2024
TANCET
Computer Science and IT Engineering
Analysis of variance
A channel has \( B = 4 \) KHz, what is the channel capacity having the signal-to-noise ratio of 20 dB?
TANCET - 2024
TANCET
Computer Science and IT Engineering
Computer Networks
When inorder traversing a tree resulted in ABCDEGFHI and postorder traversing the tree resulted in ACBEFGIHD; the preorder traversal would return:
TANCET - 2024
TANCET
Computer Science and IT Engineering
Programming and Data Structures
Recursive algorithm like Merge Sort cannot use Dynamic Programming because:
TANCET - 2024
TANCET
Computer Science and IT Engineering
Algorithm design techniques
Which of the following serves as the root parent process of all the user processes?
TANCET - 2024
TANCET
Computer Science and IT Engineering
Operating Systems
What is the maximum size of data that the application layer can pass on to the TCP layer below?
TANCET - 2024
TANCET
Computer Science and IT Engineering
Computer Networks
A bit-stuffing based framing protocol uses an 8-bit delimiter pattern of 01111110. If the output bit-string after stuffing is 01111100101, then the input bit-string is
TANCET - 2024
TANCET
Computer Science and IT Engineering
Computer Networks
If a parent process terminates without invoking wait(), the process is a:
TANCET - 2024
TANCET
Computer Science and IT Engineering
Operating Systems
Prev
1
2
3
Next