Recent questions tagged gate1993

The following relations are used to store data about students, courses, enrollment of students in courses and teachers of courses. Attributes for primary key in each rela...

For the initial state of $000$, the function performed by the arrangement of the $\text{J-K}$ flip-flops in figure is:Shift Register$\text{Mod- 3}$ Counter$\text{Mod- 6}$...

If the state machine described in figure should have a stable state, the restriction on the inputs is given by$a.b=1$$a+b=1$$\bar{a} + \bar{b} =0$$\overline{a.b}=1$$\over...

Let $\left(\{ p,q \},*\right)$ be a semigroup where $p*p=q$. Show that:$p*q=q*p$ and$q*q=q$

Draw the state transition of a deterministic finite state automaton which accepts all strings from the alphabet $\{a,b\}$, such that no string has $3$ consecutive occurre...

Write a concurrent program using $\text{parbegin-parend}$ and semaphores to represent the precedence constraints of the statements $S_1$ to $S_6$, as shown in figure belo...

The following page addresses, in the given sequence, were generated by a program:$\text{1 2 3 4 1 3 5 2 1 5 4 3 2 3}$This program is run on a demand paged virtual memory ...

A control algorithm is implemented by the NAND – gate circuitry given in figure below, where $A$ and $B$ are state variable implemented by $D$ flip-flops, and $P$ is cont...

Show that proposition $C$ is a logical consequence of the formula$$A\wedge \left(A \to \left(B \vee C\right)\right) \wedge \left( B \to \neg A\right)$$using truth tables.

Out of a group of $21$ persons, $9$ eat vegetables, $10$ eat fish and $7$ eat eggs. $5$ persons eat all three. How many persons eat at least two out of the three dishes?

Prove by the principal of mathematical induction that for any binary tree, in which every non-leaf node has $2$-descendants, the number of leaves in the tree is one more ...

Consider the recursive algorithm given below:procedure bubblesort (n); var i,j: index; temp : item; begin for i:=1 to n-1 do if A[i] A[i+1] then begin temp := A[i]; A[i]...

An $\text{ISAM}$ (indexed sequential) file consists of records of size $64$ bytes each, including key field of size $14$ bytes. An address of a disk block takes $2$ bytes...

Consider a singly linked list having $n$ nodes. The data items $d_1, d_2, \dots d_n$ are stored in these $n$ nodes. Let $X$ be a pointer to the $j^{\text{th}}$ node $(1 \...

The following Pascal program segments finds the largest number in a two-dimensional integer array $A[0\dots n-1, 0\dots n-1]$ using a single loop. Fill up the boxes to co...

In the three-level memory hierarchy shown in the following table, $p_i$ denotes the probability that an access request will refer to $M_i$.$$\begin{array}{|c|c|c|c|} \hli...

The instruction format of a CPU is:$\text{Mode}$ and $\text{RegR}$ together specify the operand. $\text{RegR}$ specifies a CPU register and $\text{Mode}$ specifies an add...

Assume that only half adders are available in your laboratory. Show that any binary function can be implemented using half adders only.

$\displaystyle \sum_{1\leq k\leq n} O(n)$, where $O(n)$ stands for order $n$ is:$O(n)$$O(n^2)$$O(n^3)$$O(3n^2)$$O(1.5n^2)$

Let $A$ and $B$ be sets with cardinalities $m$ and $n$ respectively. The number of one-one mappings from $A$ to $B$, when $m < n$, is$m^n$$^nP_m$$^mC_n$$^nC_m$$^mP_n$

The less-than relation, $<,$ on real number isa partial ordering since it is asymmetric and reflexivea partial ordering since it is antisymmetric and reflexivenot a parti...

Let A be a finite set of size n. The number of elements in the power set of $A\times A$ is:$2^{2^n}$$2^{n^2}$$\left(2^n\right)^2$$\left(2^2\right)^n$None of the above

Let $S$ be an infinite set and $S_1 \dots , S_n$ be sets such that $S_1 \cup S_2 \cup \dots \cup S_n = S$. Thenat least one of the sets $S_i$ is a finite setnot more than...

The proposition $p \wedge (\sim p \vee q)$ is:a tautologylogically equivalent to $p \wedge q$logically equivalent to $p \vee q$a contradictionnone of the above

Consider a simple connected graph $G$ with $n$ vertices and $n$ edges $(n 2)$. Then, which of the following statements are true?$G$ has no cyclesThe graph obtained by re...

Assume that the following jobs are to be executed on a single processor system$$\begin{array}{|c|c|} \hline \textbf{Job Id} & \textbf{CPU Burst Time} \\\hline \text{p} ...