Similar Topics

3.2k+ articles

60+ articles

GATE-GATE CS 1999

60+ posts

Popular articles

Recent articles

GATE | GATE CS 1999 | Question 50

Last updated: 24 October 2018

Which of the following is/are correct?(A) An SQL query automatically eliminates the duplicates(B) An SQL query will not work if there are no indexes on the relations(C) SQ ...read more

GATE-GATE CS 1999

GATE | GATE CS 1999 | Question 49

Last updated: 23 October 2017

Consider the following C function definition.int Trial (int a, int b, int c){ if ((a >= b) else if (a>=b) return Trial(a, c, b); else return Trial(b, a, c);}The ...read more

GATE-GATE CS 1999

GATE | GATE CS 1999 | Question 37

Last updated: 18 September 2018

Which of the following actions is/are typically not performed by the operating system when switching context from process A to process B?(A) Saving current register values ...read more

GATE-GATE CS 1999

Similar Topics

3.2k+ articles

60+ articles

GATE | GATE CS 1999 | Question 36

Last updated: 25 October 2018

Which of the following is/are advantages of virtual memory?a) Faster access to memory on an average.b) Processes can be given protected address spaces.c) Linker can assign ...read more

GATE-GATE CS 1999

GATE | GATE CS 1999 | Question 32

Last updated: 22 April 2020

Consider the schema R= ( S, T, U, V ) and the dependencies S→T, T→U, U→V and V→S. Let R (R1 and R2) be a decomposition such that R1∩R2 ≠ Ø. The decomposition is:(A) Not in ...read more

GATE-GATE CS 1999

GATE | GATE CS 1999 | Question 31

Last updated: 12 October 2020

For the schedule given below, which of the following is Correct?1 Read A2 Read B3 Write A4 Read A5 ...read more

GATE-GATE CS 1999

GATE | GATE CS 1999 | Question 29

Last updated: 11 August 2021

If L1 is a context free language and L2 as a regular language, which of the following is/are False?a. L1-L2 is not context freeb. L1 ∩ L2 is context freec. ~L1 is conte ...read more

GATE-GATE CS 1999

GATE | GATE CS 1999 | Question 25

Last updated: 12 October 2020

Which of the following is correct?(A) B-trees are for storing data on disk and B+ trees are for main memory.(B) Range queries are faster on B+ trees.(C) B-trees are for pr ...read more

GATE-GATE CS 1999

GATE | GATE CS 1999 | Question 24

Last updated: 24 October 2018

Let R = ( A, B, C, D, E, F ) be a relation scheme with the following dependencies:C→F, E→A, EC→D, A→B. Which of the following is a key of R?(A) CD(B) EC(C) AE(D) AC Answer ...read more

GATE-GATE CS 1999

GATE | GATE CS 1999 | Question 17

Last updated: 05 August 2020

Which of the following is the most powerful parsing method?(A) LL(1)(B) Canonical LR(C) SLR(D) LALR Answer: (B) Explanation: Canonical LR is the most powerful parser as co ...read more

GATE-GATE CS 1999

GATE | GATE CS 1999 | Question 14

Last updated: 12 September 2018

If one uses a straight two-way merge sort algorithm to sort the following elements in ascending order 20, 47, 15, 8, 9, 4, 40, 30, 12, 17 then the order of these elements ...read more

GATE-GATE CS 1999

GATE | GATE CS 1999 | Question 13

Last updated: 12 September 2018

Suppose we want to arrange the ii numbers stored in an array such that all negative values occur before all positive ones. Minimum number of exchanges required in the wors ...read more

GATE-GATE CS 1999

GATE | GATE CS 1999 | Question 12

Last updated: 06 October 2017

A sorting technique is called stable if:(A)It takes O(n*log(n)) time(B)It maintains the relative order of occurrence of non-distinct elements(C)It uses divide and conquer ...read more

GATE-GATE CS 1999

GATE | GATE CS 1999 | Question 9

Last updated: 04 February 2020

Listed below are some operating system abstractions (in the left column) and the hardware components or mechanism (in the right column) that they are abstractions of. Whic ...read more

GATE-GATE CS 1999

GATE | GATE CS 1999 | Question 4

Last updated: 06 October 2017

Consider the regular expression (0+1)(0+1)... n times. The minimum state finite automaton that recognizes the language represented by this regular expression contains:(A) ...read more

GATE-GATE CS 1999