Recent questions tagged gate1992

Consider the function $F(n)$ for which the pseudocode is given below :Function F(n) begin F1 ← 1 if(n=1) then F ← 3 else For i = 1 to n do begin C ← 0 For j = 1 to n – 1 ...

Write $3$ address intermediate code (quadruples) for the following boolean expression in the sequence as it would be generated by a compiler. Partial evaluation of boolea...

Let the page reference and the working set window be $c\ c\ d\ b\ c\ e\ c\ e\ a\ d\ $ and $4$, respectively. The initial working set at time $t=0$ contains the pages $\{a...

Suppose we have a database consisting of the following three relations:$$\begin{array}{|c|c|} \hline \text {FREQUENTS} & \text {(CUSTOMER, HOTEL)} \\\hline \text {SERVES}...

Consider the set of integers $\{1,2,3,4,6,8,12,24\}$ together with the two binary operations LCM (lowest common multiple) and GCD (greatest common divisor). Which of the ...

Let $S$ be the set of all integers and let $n 1$ be a fixed integer. Define for $a,b \in S, a R b$ iff $a-b$ is a multiple of $n$. Show that $R$ is an equivalence relat...

Design a $3$-bit counter using D-flip flops such that not more than one flip-flop changes state between any two consecutive states.

A priority encoder accepts three input signals $\text{(A, B and C)}$ and produces a two-bit output $(X_1, X_0 )$ corresponding to the highest priority active input signal...

Which of the following three statements are true? Prove your answer.The union of two recursive languages is recursive.The language $\{O^n \mid n\text{ is a prime} \}$ is ...

Use Modus ponens $(A, A → B |= B)$ or resolution to show that the following set is inconsistent:$Q(x) \rightarrow P (x) \vee \sim R (a)$$R (a) \vee \sim Q(a)$$Q(a)$$\sim ...

If $G$ is a group of even order, then show that there exists an element $a≠e$, the identity in $G$, such that $a^2 = e$.

Draw the precedence graph for the concurrent program given belowS1 parbegin begin S2:S4 end; begin S3; parbegin S5; begin S6:S8 end parend end; S7 parend; S9

Write syntax directed definitions (semantic rules) for the following grammar to add the type of each identifier to its entry in the symbol table during semantic analysis....

Consider the function $F(n)$ for which the pseudocode is given below :Function F(n) begin F1 ← 1 if(n=1) then F ← 3 else For i = 1 to n do begin C ← 0 For j = 1 to n – 1 ...

The access times of the main memory and the Cache memory, in a computer system, are $500$ n sec and $50$ nsec, respectively. It is estimated that $80\%$ of the main memor...

Consider addition in two's complement arithmetic. A carry from the most significant bit does not always correspond to an overflow. Explain what is the condition for overf...

Start and stop bits do not contain any "information" but are used in serial communication forError detectionError correctionSynchronizationSlowing down the communications...

Assume that the last element of the set is used as partition element in Quicksort. If $n$ distinct elements from the set $\left[1\dots n\right]$ are to be sorted, give an...

How many edges can there be in a forest with $p$ components having $n$ vertices in all?

Mention the pass number for each of the following activities that occur in a two pass assembler:object code generationliterals added to literal tablelisting printedaddres...

Write short answers to the following:Which of the following macros can put a macro assembler into an infinite loop?.MACRO M1,X .IF EQ,X M1 X+1 .ENDC .IF NE,X .WORD X .END...

In which of the cases stated below is the following statement true?"For every non-deterministic machine $M_{1}$ there exists an equivalent deterministic machine $M_{2}$ r...