GATE CS question library

Let $f(A,B) = A'+B$. Simplified expression for function $f(f(x+y, y), z)$ is

Consider the following multiplexer where $I0, I1, I2, I3$ are four data input lines selected by two address line combinations $A1A0=00,01,10,11$ respectively and $f$ is the output of the multiplexor. EN is the Enable input. The function $f(x,y,z)$ implemented by the above circuit is

Consider the following logic circuit whose inputs are functions $f_1, f_2, f_3$ and output is $f$ Given that $f_1(x,y,z) = \Sigma (0,1,3,5)$ $f_2(x,y,z) = \Sigma (6,7),$ and $f(x,y,z) = \Sigma (1,4,5).$ $f_3$ is

The maximum number of edges in a $n$-node undirected graph without self loops is

In the absolute addressing mode:

The optimal page replacement algorithm will select the page that

Which of the following scheduling algorithms is non-preemptive?

In $2's$ complement addition, overflow

With regards to the expressive power of the formal relational query languages, which of the following statements is true?

Relation $R$ with an associated set of functional dependencies, $F$, is decomposed into $\text{BCNF}$. The redundancy (arising out of functional dependencies) in the resulting set of relations is

The results returned by function under value-result and reference parameter passing conventions

In the C language:

Sign extension is a step in

The decimal value $0.25$

The $2's$ complement representation of the decimal value $-15$ is

Which of the following is not a form of memory

Minimum sum of product expression for $f(w,x,y,z)$ shown in Karnaugh-map below

In serial data transmission, every byte of data is padded with a $'0'$ in the beginning and one or two $'1'$s at the end of byte because:

A device employing INTR line for device interrupt puts the CALL instruction on the data bus while:

"If $X$ then $Y$ unless $Z$" is represented by which of the following formulas in propositional logic? ("$\neg$" is negation, "$\land$" is conjunction, and "$\rightarrow$" is implication)