GATE-GATE CS 2012

GATE | GATE CS 2012 | Question 51

Last Updated: 28 June 2021

Table AId Name Age----------------12 Arun 6015 Shreya 2499 Rohit 11Table BId Name Age----------------15 Shreya 2425 ...read more

Last Updated: 28 June 2021

Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow st ...read more

GATE | GATE CS 2012 | Question 40

Similar Topics

Web Technologies

38.1k+ articles

DSA

21.9k+ articles

Python

19.1k+ articles

Experiences

14.1k+ articles

GATE

3.2k+ articles

Theory of Computation

260+ articles

Computer Organization and Architecture

82+ articles

GATE-CS-2012

75+ articles

Computer Networks Quiz

27+ articles

DBMS Quiz

13+ articles

Last Updated: 14 February 2018

Consider the virtual page reference string1, 2, 3, 2, 4, 1, 3, 2, 4, 1On a demand paged virtual memory system running on a computer system t...read more

GATE | GATE CS 2012 | Question 33

Last Updated: 28 June 2021

Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion o ...read more

Last Updated: 28 June 2021

An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: 245.248.128.0/20. The I ...read more

Last Updated: 22 July 2021

Consider the 3 processes, P1, P2 and P3 shown in the table.Process Arrival time Time Units Required P1 0 ...read more

GATE | GATE CS 2012 | Question 25

Last Updated: 28 June 2021

Consider the following transactions with data items P and Q initialized to zero:T1: read (P) ; read (Q) ; if P = 0 then Q : = Q + 1 ; ...read more

Last Updated: 02 December 2021

In the IPv4 addressing format, the number of networks allowed under Class C addresses is(A) 2^14(B) 2^7(C) 2^21(D) 2^24 Answer: (C) Explanat ...read more

GATE | GATE CS 2012 | Question 16

Computer Networks Quiz

Last Updated: 28 June 2021

The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is(A) T(n) = 2T(n − 2) + 2(B) T( ...read more

GATE | GATE CS 2012 | Question 15

Last Updated: 09 October 2019

Which of the following statements are TRUE about an SQL query? P : An SQL query can contain a HAVING clause even if it does not have a GROUP ...read more

GATE | GATE CS 2012 | Question 14

DBMS Quiz

Last Updated: 28 June 2021

Given the basic ER and relational models, which of the following is INCORRECT?(A) An attribute of an entity can have more than one value(B) ...read more

GATE | GATE CS 2012 | Question 10

Last Updated: 09 October 2019

The protocol data unit (PDU) for the application layer in the Internet stack is(A) Segment (B) Datagram (C) Message (D) Frame Answer: (C) Ex ...read more

GATE | GATE CS 2012 | Question 8

Computer Networks Quiz

Last Updated: 28 June 2021

A process executes the code fork();fork();fork(); The total number of child processes created is(A) 3(B) 4(C) 7(D) 8 Answer: (C) Explanation ...read more