List of top Computer Science and IT Engineering Questions

Consider the following \(B^+\) tree with 5 nodes, in which a node can store at most 3 key values. The value 23 is now inserted in the \(B^+\) tree. Which of the following options(s) is/are CORRECT?


 

Consider the following recurrence relation: \[ T(n) = 2T(n - 1) + n2^n { for } n>0, \, T(0) = 1. \] Which ONE of the following options is CORRECT?
Let G be any undirected graph with positive edge weights, and T be a minimum spanning tree of G. For any two vertices, u and v, let \( d_1(u, v) \) and \( d_2(u, v) \) be the shortest distances between u and v in G and T, respectively. Which ONE of the following options is CORRECT for all possible G, T, u, and v?

Identify the ONE CORRECT matching between the OSI layers and their corresponding functionalities as shown.


 

A schedule of three database transactions \(T_1\), \(T_2\), and \(T_3\) is shown. \(R_i(A)\) and \(W_i(A)\) denote read and write of data item A by transaction \(T_i\), \(i = 1, 2, 3\). The transaction \(T_1\) aborts at the end. Which other transaction(s) will be required to be rolled back?

Suppose a program is running on a non-pipelined single processor computer system. The computer is connected to an external device that can interrupt the processor asynchronously. The processor needs to execute the interrupt service routine (ISR) to serve this interrupt. The following steps (not necessarily in order) are taken by the processor when the interrupt arrives:
(i) The processor saves the content of the program counter.
(ii) The program counter is loaded with the start address of the ISR.
(iii) The processor finishes the present instruction.
Which ONE of the following is the CORRECT sequence of steps?
Consider a demand paging memory management system with 32-bit logical address, 20-bit physical address, and page size of 2048 bytes. Assuming that the memory is byte addressable, what is the maximum number of entries in the page table?
Which ONE of the following techniques used in compiler code optimization uses live variable analysis?
Which ONE of the following statements is FALSE regarding the symbol table?
Consider a database relation \( R \) with attributes \( A, B, C, D, E, F, G \), and having the following functional dependencies: \[ A \rightarrow BCEF \quad E \rightarrow DG \quad BC \rightarrow A \] Which of the following statements is/are correct?
Consider the following two relations, named Customer and Person, in a database:

\[ \text{Person} \left( \begin{array}{l} \text{aadhaar CHAR(12) PRIMARY KEY,} \\ \text{name VARCHAR (32);} \end{array} \right) \]

\[ \text{Customer} \left( \begin{array}{l} \text{name VARCHAR (32),} \\ \text{email VARCHAR(32) PRIMARY KEY,} \\ \text{phone CHAR(10),} \\ \text{aadhaar CHAR(12),} \\ \text{FOREIGN KEY (aadhaar) REFERENCES Person (aadhaar);} \end{array} \right) \]

Which of the following statements is/are correct?
If a relational decomposition is not dependency-preserving, which one of the following relational operators will be executed more frequently in order to maintain the dependencies?
Identify the incorrect statement regarding the use of generics and parameterized types in Java?
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?
When inorder traversing a tree resulted in ABCDEGFHI and postorder traversing the tree resulted in ACBEFGIHD; the preorder traversal would return:
Consider a binary Max-heap implemented using an array. Which one of the following arrays represents a binary Max-heap?
Which of the following enables indirect communication in IPC?
Recursive algorithm like Merge Sort cannot use Dynamic Programming because:
A B-tree of minimum degree \( t \) can have a maximum of _________ pointers in a node.
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:
A greedy algorithm is an approach for solving a problem by:
The number of trees in a binomial heap with \( n \) nodes is:
What is the if-then form of the following conditional statement? "It is time for dinner if it is 6 pm."
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 \)?
Regular expression for all strings starting with “ab” and ending with “ba” is: