Which one of the following well formed formulae is a tautology?  (A) ∀x∃yR(x,y)<–>∃y∀xR(x,y) (B) (∀x(∃yR(x,y)->S(x,y)])->∀x∃yS(x,y) (C) [∀x∃y(P(x,y)->R(x,y)]<->[∀x∃y(~P(x,y)∪R(x,y)] (D) ∀x∃yR(x,y)<–>∀y∀xR(x,y) Answer: (C) Explanation: In logic, a… Read More

Consider the sequence of machine instructions given below: MUL R5, R0, R1 DIV R6, R2, R3 ADD R7, R5, R6 SUB R8, R7, R4 In… Read More

Consider the C program below.   C #include <stdio.h> int *A, stkTop; int stkFunc (int opcode, int val) {     static int size=0, stkTop=0;     switch (opcode)     {… Read More

In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is True? (A) In both AST and CFG, let node N2… Read More

Consider the following C function.  C int fun (int n){   int x = 1, k;   if (n == 1)     return x;   for (k = 1;… Read More

Consider a non-pipelined processor with a clock rate of 2.5 gigahertz and average cycles per instruction of four. The same processor is upgraded to a… Read More

What is the output of the following C code? Assume that the address of x is 2000 (in decimal) and an integer requires four bytes… Read More