List of top Computer Science and IT Engineering Questions

All activities lying on the critical path have slack time equal to:
For a function of two variables, boundary value analysis yields:
Which test refers to the retesting of a unit, integration and system after modification, in order to ascertain that the changes have not introduced new faults?
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:
Which of the following is not a clustering method?
Which of the following is the characteristic of RAID-5?
Which of the following is a semi join?
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
A channel has \( B = 4 \) KHz, what is the channel capacity having the signal-to-noise ratio of 20 dB?
The number of additions required to compute N-point DFT using radix-2 FFT is given by:
The transfer function of a Butterworth filter is given by:
Fast Fourier Transform algorithms exploit:
Low pass Butterworth filters are:
What is the maximum size of data that the application layer can pass on to the TCP layer below?
A greedy algorithm is an approach for solving a problem by:
In the absolute addressing mode:
The elimination stage of WAR and WAW hazards is often called:
What is the formula for Hit Ratio?
What is the recurrence for the worst case of quicksort, and what is the time complexity in the worst case?
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?
Recursive algorithm like Merge Sort cannot use Dynamic Programming because:
Consider a binary Max-heap implemented using an array. Which one of the following arrays represents a binary Max-heap?
The number of trees in a binomial heap with \( n \) nodes is:
When the physical location of the file changes in a distributed file system:
When inorder traversing a tree resulted in ABCDEGFHI and postorder traversing the tree resulted in ACBEFGIHD; the preorder traversal would return: