Similar Topics

3.2k+ articles

80+ articles

GATE-GATE CS 2008

70+ posts

Popular articles

Recent articles

GATE | GATE CS 2008 | Question 85

Last Updated: 07 September 2018

Consider the following ER diagram. The minimum number of tables needed to represent M, N, P, R1, R2 is(A) 2(B) 3(C) 4(D) 5 Answer: (B) Explanation: Answer is B, i.e, 3 min...read more

GATE-GATE CS 2008

GATE | GATE CS 2008 | Question 70

Last Updated: 14 February 2018

Consider a file of 16384 records. Each record is 32 bytes long and its key field is of size 6 bytes. The file is ordered on a non-key field, and the file organization is u...read more

GATE-GATE CS 2008

GATE | GATE CS 2008 | Question 69

Last Updated: 24 September 2021

Consider the following relational schemes for a library database:Book (Title, Author, Catalog_no, Publisher, Year, Price)Collection (Title, Author, Catalog_no)with in the ...read more

GATE-GATE CS 2008

Similar Topics

3.2k+ articles

80+ articles

GATE | GATE CS 2008 | Question 67

Last Updated: 14 February 2018

A processor uses 36 bit physical addresses and 32 bit virtual addresses, with a page frame size of 4 Kbytes. Each page table entry is of size 4 bytes. A three level page t...read more

GATE-GATE CS 2008

GATE | GATE CS 2008 | Question 66

Last Updated: 05 April 2019

A process executes the following codefor (i = 0; i The total number of child processes created is(A) n(B) 2n - 1(C) 2n(D) 2(n+1) - 1 Answer: (B) Explanation: F0 ...read more

GATE-GATE CS 2008

GATE | GATE CS 2008 | Question 85

Last Updated: 28 June 2021

Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes?(A) In deadlock prevention, the request for resources is always granted if the res ...read more

GATE-GATE CS 2008

GATE | GATE CS 2008 | Question 55

Last Updated: 14 September 2021

An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if(A) the SLR(1) parser for G has S-R conflicts(B) the LR(1) parser for G has S-R confl ...read more

GATE-GATE CS 2008

GATE | GATE CS 2008 | Question 46

Last Updated: 28 June 2021

You are given the postorder traversal, P, of a binary search tree on the n elements 1, 2, ..., n. You have to determine the unique binary search tree that has ...read more

GATE-GATE CS 2008

GATE | GATE CS 2008 | Question 43

Last Updated: 28 June 2021

Consider the Quicksort algorithm. Suppose there is a procedure for finding a pivot element which splits the list into two sub-lists each of which contains at least one-fif ...read more

GATE-GATE CS 2008

GATE | GATE CS 2008 | Question 41

Last Updated: 28 June 2021

A B-tree of order 4 is built from scratch by 10 successive insertions. What is the maximum number of node splitting operations that may take place?(A)3(B)4(C)5(D)6 Answer: ...read more

GATE-GATE CS 2008

GATE | GATE CS 2008 | Question 40

Last Updated: 02 November 2022

The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is (A)Θ(n)(B)Θ(log ...read more

GATE-GATE CS 2008

GATE | GATE CS 2008 | Question 39

Last Updated: 28 June 2021

Consider the following functions: f(n) = 2ng(n) = n!h(n) = nlognWhich of the following statements about the asymptotic behaviour of f(n), g(n), and h(n) is true?(A) f(n) = ...read more

GATE-GATE CS 2008

GATE | GATE CS 2008 | Question 85

Last Updated: 02 December 2021

What is the maximum size of data that the application layer can pass on to the TCP layer below?(A) A(B) B(C) C(D) D Answer: (A) Explanation: The default TCP Maximum Segmen...read more

GATE-GATE CS 2008

GATE | GATE CS 2008 | Question 85

Last Updated: 17 September 2021

Some code optimizations are carried out on the intermediate code because(A) they enhance the portability of the compiler to other target processors(B) program analysis is ...read more

GATE-GATE CS 2008

GATE | GATE CS 2008 | Question 10

Last Updated: 14 September 2021

Which of the following describes a handle (as applicable to LR-parsing) appropriately? (A) It is the position in a sentential form where the next shift or reduce operation ...read more

GATE-GATE CS 2008