List of top Computer Science & Information Technology Questions

Choose typical program control instructions.

What is the output of selective complement operation of 1010 and 1100?

The symbolic notation used to describe the microoperation transfers among registers is called

Which of the following register holds memory operand?

What is the correct description of CIL instruction?

Consider the following statements about interrupts.
Statement-I: Internal interrupts are synchronous with the program while external interrupts are asynchronous.
Statement-II: Internal interrupts are called traps. The correct answer is

Which gate is used for Boolean addition?

How many NAND gates are required to implement a full adder?

Choose the correct statement about connected components.

Which type of charts are used in Boolean function simplification?

Which flip flop is used as a push button switch?

What is the product of \[ 1.11\times2^3 \] and \[ 1.0101\times2^6 ? \]

How many different strings can be made by reordering the letters of the word SUCCESS?

What is \(R^3\) of \[ R=\{(1,1),(2,1),(3,2),(4,3)\}? \]

What is the solution of the recurrence relation \[ a_n=6a_{n-1}-9a_{n-2} \] with initial conditions \[ a_0=1,\qquad a_1=6? \]

How many relations are there on a set with \(3\) elements?

What is the Four Colour Theorem?

Which among the following represents idempotent law?

Let \(f\) and \(g\) be the functions from the set of integers to the set of integers defined by \[ f(x)=2x+3 \] and \[ g(x)=3x+2. \] What is the composition of \(f\) and \(g\)?

Suppose that there are eight runners in a race. The winner receives a gold medal, the second-place finisher receives a silver medal, and the third-place finisher receives a bronze medal. How many different ways are there to award these medals, if all possible outcomes of the race can occur and there are no ties?

With respect to a TCP connection between a client and a server, which of the following is true?

Let $P, Q, R, S$ be relational schemas. Let ``$\rightarrow$'' indicate a functional dependency (FD) in this context. Which of the following best describes the meaning of a functional dependency?

Let a Non-deterministic Finite Automaton (NFA) have 6 states over a finite alphabet. Which of the following cannot be the number of states in a minimal Deterministic Finite Automaton (DFA) that is equivalent to this NFA?

A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?

Consider $Z = X - Y$, where $X$, $Y$ and $Z$ are all in sign-magnitude form. $X$ and $Y$ are each represented in $n$ bits. To avoid overflow, the representation of $Z$ would require a minimum of: