List of top Computer Science and IT Engineering Questions

A greedy algorithm is an approach for solving a problem by:
The transfer function of a Butterworth filter is given by:
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:
Fast Fourier Transform algorithms exploit:
What is the if-then form of the following conditional statement? "It is time for dinner if it is 6 pm."
The CREATE TRIGGER statement is used to create the trigger. THE _________ clause specifies the table name on which the trigger is to be attached. The ___________ pecifies that this is an AFTER INSERT trigger.
A channel has \( B = 4 \) KHz, what is the channel capacity having the signal-to-noise ratio of 20 dB?
Consider the following systems of three equations (congruences): \( x \equiv 2 \pmod{3} \), \( x \equiv 3 \pmod{5} \), and \( x \equiv 2 \pmod{7} \). Find \( x \)?
Which of the following serves as the root parent process of all the user processes?
Which of the following models has the most stringent consistency requirement and is also called the strongest form of memory coherence?
Regular expression for all strings starting with “ab” and ending with “ba” is:
In the absolute addressing mode:
When the physical location of the file changes in a distributed file system:
The regular expression of the language \(\{0, 01, 011, 0111, \dots\}\) is given by:
The elimination stage of WAR and WAW hazards is often called:
What is the formula for Hit Ratio?
The number of states required to accept the string ending with 010 is:
The Sun Microsystems processors usually follow ________ architecture.
Which of the following statements is true about the distributed system?
Which of the following is a semi join?
The chromatic number of a wheel graph on \( n \) vertices denoted by \( W_n \) is:
Which of the following computing models is not an example of a distributed computing environment?
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.
The number of levels used in defining a knowledge-based agent is
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: