Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F = {CH -> G, A -> BC, B -> CFH, E… Read More »

Consider the same data as above question. What is the minimum number of page colours needed to guarantee that no two synonyms map to different… Read More »

A computer uses 46-bit virtual address, 32-bit physical address, and a three-level paged page table organization. The page table base register stores the base address… Read More »

In the above question, if array A is made to hold the string “abcde”, which of the above four test cases will be successful in… Read More »

The procedure given below is required to find and replace certain characters inside an input character string supplied in array A. The characters to be… Read More »

Consider the same data as above question. What is the minimum number of registers needed in the instruction set architecture of the processor to compile… Read More »

The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands… Read More »

(A) A (B) B (C) C (D) D Answer: (A) (D) Explanation:   Given statement is : ¬ ∃ x ( ∀y(α) ∧ ∀z(β) )… Read More »

A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable… Read More »

Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write… Read More »

Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter. MultiDequeue(Q){ m = k while (Q is… Read More »

The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is… Read More »

What is the return value of f(p,p), if the value of p is initialized to 5 before the call? Note that the first parameter is… Read More »

Which of the following is/are undecidable? (A) 3 only (B) 3 and 4 only (C) 1, 2 and 3 only (D) 2 and 3 only… Read More »

Consider the following two sets of LR(1) items of an LR(1) grammar. X -> c.X, c/d X -> .cX, c/d X -> .d, c/d X… Read More »