Similar Topics

80+ articles

80+ articles

80+ articles

80+ articles

GATE-GATE IT 2004

80+ articles

GATE-GATE-CS-2004

80+ articles

GATE-Gate IT 2005

80+ articles

GATE-GATE-CS-2005

80+ articles

80+ articles

GATE-GATE-CS-2003

80+ articles

GATE

3.2k posts

Popular articles

Recent articles

GATE | GATE CS 2019 | Question 11

Last Updated: 16 August 2021

A certain processor uses a fully associative cache of size 16 kB, The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit addre...read more

Important Topics for GATE 2023 Computer Science

Last Updated: 18 March 2023

.entry-content table,.entry-content th,.entry-content td { border: 1px solid black; table-layout: fixed; text-align:left !important;...read more

GATE | GATE CS 1996 | Question 39

Last Updated: 01 November 2017

A binary search tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24 The number of nodes in the left subtree and rig ...read more

GATE-GATE CS 1996

Similar Topics

80+ articles

80+ articles

80+ articles

80+ articles

GATE-GATE IT 2004

80+ articles

GATE-GATE-CS-2004

80+ articles

GATE-Gate IT 2005

80+ articles

GATE-GATE-CS-2005

80+ articles

80+ articles

GATE-GATE-CS-2003

80+ articles

GATE | Gate IT 2008 | Question 59

Last Updated: 28 June 2021

Let R (A, B, C, D) be a relational schema with the following functional dependencies:A → B, B → C,C → D and D → B. The decomposition of R into (A, B), (B, C), (B, D)(A) gi ...read more

GATE-Gate IT 2008

GATE | GATE-CS-2016 (Set 2) | Question 48

Last Updated: 28 June 2021

Let A1, A2, A3, and A4 be four matrices of dimensions 10 x 5, 5 x 20, 20 x 10, and 10 x 5, respectively. The minimum number of scalar multiplications required ...read more

GATE-GATE-CS-2016 (Set 2)

GATE-CS-2016 (Set 2)

GATE | GATE-CS-2001 | Question 48

Last Updated: 28 June 2021

R(A,B,C,D) is a relation. Which of the following does not have a lossless join, dependency preserving BCNF decomposition?(A) A-B, B-CD(B) A-B, B-C, C-D(C) AB-C, C-AD(D) ...read more

GATE-GATE-CS-2001

GATE | GATE-CS-2005 | Question 72

Last Updated: 07 July 2020

Consider the following code fragment: if (fork() == 0) { a = a + 5; printf(“%d,%d\n”, a, } else { a = a –5; printf(“%d, %d\n”, a, } Let u, v be the values printed by ...read more

GATE-GATE-CS-2005

GATE | GATE-CS-2014-(Set-3) | Question 65

Last Updated: 28 June 2021

Consider the transactions T1, T2, and T3 and the schedules S1 and S2 given below. T1: r1(X); r1(Z); w1(X); w1(Z)T2: r2(Y); r2(Z); w2(Z)T3: r3(Y); r3(X); w3(Y)S1: r1(X); r3 ...read more

GATE-GATE-CS-2014-(Set-3)

GATE-CS-2014-(Set-3)

GATE | GATE-CS-2014-(Set-3) | Question 20

Last Updated: 28 June 2021

Let A be a square matrix of size n x n. Consider the following program. What is the expected output?[tabby title="C"][sourcecode language="c"]C = 100for i = 1 ...read more

GATE-GATE-CS-2014-(Set-3)

GATE-CS-2014-(Set-3)

GATE | GATE-CS-2014-(Set-1) | Question 65

Last Updated: 28 June 2021

An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y, and Z to three processes P0, P1, and P2. ...read more

GATE-GATE-CS-2014-(Set-1)

GATE-CS-2014-(Set-1)

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-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 2011 | Question 37

Last Updated: 28 June 2021

Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4?f1(n) = 2^nf2(n) = n^(3/2)f3(n) = nLognf4(n) = n^(Logn)(A) ...read more

GATE-GATE CS 2011

GATE | GATE CS 2012 | Question 54

Last Updated: 30 September 2021

A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32 Bytes. The processor sends 32 bit addresses to the cache controller. Each ca ...read more

GATE-GATE CS 2012

GATE | GATE CS 2013 | Question 31

Last Updated: 31 May 2021

Consider the following function:[tabby title="C"][sourcecode language="c"]int unknown(int n) { int i, j, k = 0; for (i = n/2; i <= n; i++) for (j = 2; j <= n ...read more

GATE-GATE CS 2013

1 2 3 4 5 6 7 8 >>