List of top Computer Science and IT Engineering Questions

What is the maximum size of data that the application layer can pass on to the TCP layer below?
Which of the following statements is true about the distributed system?
Which of the following computing models is not an example of a distributed computing environment?
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:
Consider a binary Max-heap implemented using an array. Which one of the following arrays represents a binary Max-heap?
Which of the following models has the most stringent consistency requirement and is also called the strongest form of memory coherence?
When the physical location of the file changes in a distributed file system:
A B-tree of minimum degree \( t \) can have a maximum of _________ pointers in a node.
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:
Which of the following enables indirect communication in IPC?
The number of trees in a binomial heap with \( n \) nodes is:
Fast Fourier Transform algorithms exploit:
Low pass Butterworth filters are:
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.
All activities lying on the critical path have slack time equal to:
Which of the following is a semi join?
Which of the following is not a clustering method?

Consider the Deterministic Finite-state Automaton (DFA) A shown below. The DFA runs on the alphabet \(\{0, 1\}\), and has the set of states \(\{s, p, q, r\}\), with \(s\) being the start state and \(p\) being the only final state.

Which one of the following regular expressions correctly describes the language accepted by A?
 

The Lucas sequence $L_n$ is defined by the recurrence relation: \[ L_n = L_{n-1} + L_{n-2}, \text{for } n \geq 3, \] with $L_1 = 1$ and $L_2 = 3$. Which one of the options given is TRUE?
Which one of the options given below refers to the degree (or arity) of a relation in relational database systems?
Suppose two hosts are connected by a point-to-point link and they are configured to use Stop-and-Wait protocol for reliable data transfer. Identify in which one of the following scenarios, the utilization of the link is the lowest.
Let \[ A = \begin{bmatrix} 1 & 2 & 3 & 4 \\ 4 & 1 & 2 & 3 \\ 3 & 4 & 1 & 2 \\ 2 & 3 & 4 & 1 \end{bmatrix}, \quad B = \begin{bmatrix} 3 & 4 & 1 & 2 \\ 4 & 1 & 2 & 3 \\ 1 & 2 & 3 & 4 \\ 2 & 3 & 4 & 1 \end{bmatrix} \] Let det(A) and det(B) denote the determinants of the matrices A and B, respectively.
Which one of the options given below is TRUE?

Consider the following definition of a lexical token id for an identifier in a programming language, using extended regular expressions: \[ \text{letter} \;\;\rightarrow\;\; [A\!-\!Za\!-\!z] \] \[ \text{digit} \;\;\rightarrow\;\; [0\!-\!9] \] \[ \text{id} \;\;\rightarrow\;\; \text{letter (letter | digit)}^* \] Which one of the following Non-deterministic Finite-state Automata with $\epsilon$-transitions accepts the set of valid identifiers? (A double-circle denotes a final state). 

An algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize the number of collisions. Let $k$ be the number of keys, $m$ be the number of slots in the hash table, and $k>m$. Which one of the following is the best hashing strategy to counteract the adversary?