Similar Topics

3.2k+ articles

50+ articles

GATE-GATE-CS-2009

50+ posts

Popular articles

Recent articles

GATE | GATE-CS-2009 | Question 56

Last updated: 17 December 2021

Consider the following relational schema:Suppliers(sid:integer, sname:string, city:string, street:string)Parts(pid:integer, pname:string, color:string)Catalog(sid:integer, ...read more

GATE-GATE-CS-2009

GATE | GATE-CS-2009 | Question 55

Last updated: 04 February 2020

Consider the following relational schema:Suppliers(sid:integer, sname:string, city:string, street:string)Parts(pid:integer, pname:string, color:string)Catalog(sid:integer, ...read more

GATE-GATE-CS-2009

GATE | GATE-CS-2009 | Question 53

Last updated: 28 June 2021

A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences X[m] and Y[n] of l ...read more

GATE-GATE-CS-2009

Similar Topics

3.2k+ articles

50+ articles

GATE | GATE-CS-2009 | Question 48

Last updated: 28 June 2021

Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect odd number of bits in error?(A) G(x) contains ...read more

GATE-GATE-CS-2009

GATE | GATE-CS-2009 | Question 38

Last updated: 19 November 2018

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) (b,e)(e,f)(a,c)(b,c)(...read more

GATE-GATE-CS-2009

GATE | GATE-CS-2009 | Question 35

Last updated: 28 June 2021

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) + cnWhich one of the following re...read more

GATE-GATE-CS-2009

GATE | GATE-CS-2009 | Question 33

Last updated: 28 June 2021

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-a ...read more

GATE-GATE-CS-2009

GATE | GATE-CS-2009 | Question 60

Last updated: 28 June 2021

Consider a system with 4 types of resources R1 (3 units), R2 (2 units), R3 (3 units), R4 (2 units). A non-preemptive resource allocation policy is used. At any given insta ...read more

GATE-GATE-CS-2009

GATE | GATE-CS-2009 | Question 29

Last updated: 30 September 2021

Consider a 4-way set associative cache (initially empty) with total 16 cache blocks. The main memory consists of 256 blocks and the request for memory blocks is in the fol ...read more

GATE-GATE-CS-2009

GATE | GATE-CS-2009 | Question 28

Last updated: 23 December 2020

Consider a 4 stage pipeline processor. The number of cycles needed by the four instructions I1, I2, I3, I4 in stages S1, S2, S3, S4 is shown below:S1S2S3S4I12111I21322I3...read more

GATE-GATE-CS-2009

GATE | GATE-CS-2009 | Question 17

Last updated: 17 September 2017

Match all items in Group 1 with correct options from those given in Group 2.Group 1 Group 2P. Regular expression 1. Syntax analysisQ. Pushd ...read more

GATE-GATE-CS-2009

GATE | GATE-CS-2009 | Question 16

Last updated: 19 November 2018

How many 32K x 1 RAM chips are needed to provide a memory capacity of 256K-bytes?(A) 8(B) 32(C) 64(D) 128 Answer: (C) Explanation: We need 256 Kbytes, i.e., 256 x 1024 x 8 ...read more

GATE-GATE-CS-2009

GATE | GATE-CS-2009 | Question 15

Last updated: 20 March 2018

Which one of the following is FALSE?(A) There is unique minimal DFA for every regular language(B) Every NFA can be converted to an equivalent PDA.(C) Complement of every c ...read more

GATE-GATE-CS-2009

GATE | GATE-CS-2009 | Question 14

Last updated: 22 November 2021

Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)* ?(A) The set of all strings containing the substr ...read more

GATE-GATE-CS-2009

GATE | GATE-CS-2009 | Question 6

Last updated: 19 November 2018

What is the minimum number of gates required to implement the Boolean function (AB+C)if we have to use only 2-input NOR gates?(A) 2(B) 3(C) 4(D) 5 Answer: (B) Explanation: ...read more

GATE-GATE-CS-2009