## GATE | GATE-CS-2009 | Question 60

Let R and S be relational schemes such that R={a,b,c} and S={c}. Now consider the following queries on the database: IV) SELECT R.a, R.b FROM R,S… Read More »

## GATE | GATE-CS-2009 | Question 44

The following key values are inserted into a B+-tree in which order of the internal nodes is 3, and that of the leaf nodes is… Read More »

## GATE | GATE-CS-2009 | Question 43

Consider two transactions T1 and T2, and four schedules S1, S2, S3, S4 of T1 and T2 as given below: T1 = R1[X] W1[X] W1[Y]… Read More »

## GATE | GATE-CS-2009 | Question 42

Which of the following statements are TRUE? I. There exist parsing algorithms for some programming languages whose complexities are less than O(n3). II. A programming… Read More »

## GATE | GATE-CS-2009 | Question 60

The below DFA accepts the set of all strings over {0,1} that (A) begin either with 0 or 1 (B) end with 0 (C) end… Read More »

## GATE | GATE-CS-2009 | Question 60

Let L = L1∩L2, where L1 and L2 are languages as defined below: L1 = { | m, n >= 0 } L2 = { | i,… Read More »

## GATE | GATE-CS-2009 | Question 39

In quick sort, for sorting n elements, the (n/4)th smallest element is selected as pivot using an O(n) time algorithm. What is the worst case… Read More »

## GATE | GATE-CS-2009 | Question 38

Consider the following graph: Which one of the following is NOT the sequence of edges added to the minimum spanning tree using Kruskal’s algorithm? (A)… Read More »

## GATE | GATE-CS-2009 | Question 37

What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0. (A)… Read More »

## GATE | GATE-CS-2009 | Question 36

The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using open addressing… Read More »

## GATE | GATE-CS-2009 | Question 35

The running time of an algorithm is represented by the following recurrence relation: if n <= 3 then T(n) = n else T(n) = T(n/3)… Read More »

## GATE | GATE-CS-2009 | Question 34

A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because (A) It reduces… Read More »

## GATE | GATE-CS-2009 | Question 33

The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows: void enter_CS(X) { while test-and-set(X) ;… Read More »

## GATE | GATE-CS-2009 | Question 60

In the following process state transition diagram for a uniprocessor system, assume that there are always some processes in the ready state: Now consider the… Read More »

## GATE | GATE-CS-2009 | Question 31

Consider a disk system with 100 cylinders. The requests to access the cylinders occur in following sequence: 4, 34, 10, 7, 19, 73, 2, 15,… Read More »