Recent activity by DEBANJAN DAS2k / GATE Overflow for GATE CSE

1 answer

1

GATE Mechanical 2021 Set 1 | GA Question: 10
Five persons $\text{P, Q, R, S and T}$ are sitting in a row not necessarily in the same order. $Q$ and $R$ are separated by one person, and $S$ should not be seated adjacent to $Q.$ The number of distinct seating arrangements possible is: $4$ $8$ $10$ $16$

Five persons $\text{P, Q, R, S and T}$ are sitting in a row not necessarily in the same order. $Q$ and $R$ are separated by one person, and $S$ should not be seated adjac...

3.8k views

commented Apr 27

1 answer

2

How to Prepare for Quantitative Aptitude for CAT Type 3 Q-25
Assume that the rate of consumption of coal by a locomotive varies as the square of the speed and is 1000 kg per hour when the speed is 60 km per hour. If the coal costs the railway company ` 15 per 100 kg and if the other ... train be ` 12 per hour, find a formula for the cost in paise per kilometre when the speed is S km per hour.

Assume that the rate of consumption of coal by a locomotive varies as the square of the speed and is 1000 kg per hour when the speed is 60 km per hour. If the coal costs ...

77 views

answered Apr 22

1 answer

3

Sorting Algorithm
For flag based approach in Bubble sort we can check first by a flag if the list is sorted or not in O(n), and if it is sorted, then no need to sort and the operation ends in Best case = O(n). Why isn't the same concept applicable to selection sort? Why it never comes down from O(n$^2$)?

For flag based approach in Bubble sort we can check first by a flag if the list is sorted or not in O(n), and if it is sorted, then no need to sort and the operation ends...

232 views

answer edited Mar 15

3 answers

4

GATE CSE 2024 | Set 2 | Question: 52
Let $L_{1}$ be the language represented by the regular expression $b^{*} a b^{*}\left(a b^{*} a b^{*}\right)^{*}$ and $L_{2}=\left\{w \in(a+b)^{*}|| w \mid \leq 4\right\}$, where $|w|$ denotes the length of string $w$. The number of strings in $L_{2}$ which are also in $L_{1}$ is _________.

Let $L_{1}$ be the language represented by the regular expression $b^{*} a b^{*}\left(a b^{*} a b^{*}\right)^{*}$ and $L_{2}=\left\{w \in(a+b)^{*}|| w \mid \leq 4\right\}...

2.3k views

answered Feb 16

2 answers

5

GATE CSE 2024 | Set 2 | Question: 54
Consider a $32$-bit system with $4 \mathrm{~KB}$ page size and page table entries of size $4$ bytes each. Assume $1 \mathrm{~KB}=2^{10}$ bytes. The OS uses a $2$-level page table for memory management, with the page table containing ... the maximum number of pages across the two levels of the page table of the process. The value of $\text{X+Y}$ is ___________.

Consider a $32$-bit system with $4 \mathrm{~KB}$ page size and page table entries of size $4$ bytes each. Assume $1 \mathrm{~KB}=2^{10}$ bytes. The OS uses a $2$-level pa...

3.3k views

answered Feb 16

1 answer

6

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 63
Assume an instruction mix of $15 \%$ conditional branches, $1 \%$ unconditional branches, $84 \%$ all others, and $60 \%$ of the conditional branches are taken. We have a 4-stage pipeline where branch target locations ... $1.38$ For both "predict taken", "predict not taken" branch predictions, CPI is the $1.30$

Assume an instruction mix of $15 \%$ conditional branches, $1 \%$ unconditional branches, $84 \%$ all others, and $60 \%$ of the conditional branches are taken. We have a...

804 views

commented Feb 7

6 answers

7

GATE CSE 2014 Set 2 | Question: 55
Consider the main memory system that consists of $8$ memory modules attached to the system bus, which is one word wide. When a write request is made, the bus is occupied for $100$ nanoseconds (ns) by the data, address, and control signals. ... bus at any time. The maximum number of stores (of one word each) that can be initiated in $1$ millisecond is ________

Consider the main memory system that consists of $8$ memory modules attached to the system bus, which is one word wide. When a write request is made, the bus is occupied ...

27.2k views

commented Jan 31

2 answers

8

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 48
#include <stdio.h> int main() { int i= 255; short int *s= (short int *)&i; printf("%d\n", *s); } What will be the output of the above program in little-endian and big-endian, respectively? $(65280\text{ is } 255\times2^8)$ $255,\; 0$ $65280,\; 0$ $0,\;0$ $0,\; 65280$

#include <stdio.h int main() { int i= 255; short int *s= (short int *)&i; printf("%d\n", *s); }What will be the output of the above program in little-endian and big-endia...

598 views

answered Jan 31

1 answer

9

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 50
Consider a laptop trying to access a file via HTTP from a server. The laptop knows its own IP address and the server's IP address. Below list the following messages that appear on the Laptop's network (in the order that they would occur), by listing the letter ... $a, e, c, d, g, c, b, f, c$

Consider a laptop trying to access a file via HTTP from a server. The laptop knows its own IP address and the server's IP address.Below list the following messages that a...

354 views

commented Jan 31

2 answers

10

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 11
Let $f(x)$ be a real-valued function all of whose derivatives exist. Recall that a point $x_0$ in the domain is called an inflection point of $f(x)$ if the second derivative $f^{\prime \prime}(x)$ changes sign at ... only inflection point. $x_0=0$ and $x_0=6$, both are inflection points. The function does not have an inflection point.

Let $f(x)$ be a real-valued function all of whose derivatives exist. Recall that a point $x_0$ in the domain is called an inflection point of $f(x)$ if the second derivat...

907 views

commented Jan 30

1 answer

11

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 39
Consider a $\text{TCP}$ flow sending three segments, namely $1,2,$ and $3.$ Due to congestion, the $\text{TCP}$ flow experiences exactly two losses. Only segments can be lost; acknowledgments are not lost. Segments $1$ and $3$ are ... for all packets successfully? $\text{3 RTTs}$ $\text{5 RTTs}$ $\text{6 RTTs}$ $\text{8 RTTs}$

Consider a $\text{TCP}$ flow sending three segments, namely $1,2,$ and $3.$ Due to congestion, the $\text{TCP}$ flow experiences exactly two losses. Only segments can be ...

806 views

comment edited Jan 24

3 answers

12

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 23
An attribute $A$ is called prime if $A$ is in any of the candidate keys. Assume in the following statements, $\mathrm{A}$ is an attribute $\&\;\mathcal{X}$ is a set of attributes. Consider the following statements: Domain of each attribute is an ... $\text{A - BCNF, B - 3NF, C - 2NF, D - 1NF}$

An attribute $A$ is called prime if $A$ is in any of the candidate keys. Assume in the following statements, $\mathrm{A}$ is an attribute $\&\;\mathcal{X}$ is a set of at...

491 views

answered Jan 23

1 answer

13

MadeEasy Test Series: How many tuples will be present in the output of the following SQL query.
My doubt here is, if NOT EXISTS gets an empty set as the input then every tuple of the table in the outer query must satisfy the condition. Am I right? For example, in the above question - The ... the same below) Can anyone please explain whether I am approaching this right, or if I am missing something?

My doubt here is, if NOT EXISTS gets an empty set as the input then every tuple of the table in the outer query must satisfy the condition. Am I right?For example, in the...

438 views

commented Jan 23

2 answers

14

test series
int i,j,k,s=0; for(i=1; i<=n; i++) { for(j=1 ; j<=i; j=j*2) { for(k=n; k>1;k=k/2) { s++; } } } What will be the time complexity of the above code?

int i,j,k,s=0; for(i=1; i<=n; i++) { for(j=1 ; j<=i; j=j*2) { for(k=n; k>1;k=k/2) { s++; } } }What will be the time complexity of the above code?

499 views

commented Jan 23

6 answers

15

GATE IT 2004 | Question: 63
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let $P_h$ ... but starvation-free The scheme is neither deadlock-free nor starvation-free The scheme is both deadlock-free and starvation-free

In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same ti...

13.7k views

commented Jan 22

1 answer

16

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 49
An inversion in an array $a$ is a pair of array indices $(i, j)$ such that $i<j$ but $a[i]>a[j]$. What is the maximum number of inversions that can be eliminated by the following program fragment? tmp = a[5] ; a[5] = a[10] ; a[10]= tmp ; $5$ $6$ $9$ $20$

An inversion in an array $a$ is a pair of array indices $(i, j)$ such that $i<j$ but $a[i]>a[j]$.What is the maximum number of inversions that can be eliminated by the fo...

594 views

commented Jan 13

1 answer

17

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 12
Let $A-B$ denote $\{x \in A: x \notin B\}$. If $(A-B) \cup B=A$, which of the following must be true? $B$ is empty $A \subseteq B$ $B \subseteq A$ $(B-A) \cup A=B$

Let $A-B$ denote $\{x \in A: x \notin B\}$. If $(A-B) \cup B=A$, which of the following must be true?$B$ is empty$A \subseteq B$$B \subseteq A$$(B-A) \cup A=B$

643 views

commented Jan 13

1 answer

18

Process Synchronization: Dekker's algorithm
This Screenshot is taken from William Stalling's Operating Systems book. My doubt is that Bounded wait is not satisfied by this solution. Though Book claims that is satisifes all three required conditions. For example: P0 and P1 both want to enter ... its flag to False to give path to Po and now stuck for infinite time. hence B.W is not satisfied!

This Screenshot is taken from William Stalling's Operating Systems book. My doubt is that Bounded wait is not satisfied by this solution. Though Book claims that is satis...

3.9k views

commented Jan 12

8 answers

19

GATE CSE 2018 | Question: 54
Consider an IP packet with a length of $4,500\;\text{bytes}$ that includes a $20\text{-byte}\;\textsf{IPv4}$ header ans $40\text{-byte}$ TCP header. The packet is forwarded to an $\textsf{IPv4}$ router that supports a ... that the fragmentation offset value stored in the first fragment is $0$. The fragmentation offset value stored in the third fragment is ________.

Consider an IP packet with a length of $4,500\;\text{bytes}$ that includes a $20\text{-byte}\;\textsf{IPv4}$ header ans $40\text{-byte}$ TCP header. The packet is forward...

19.6k views

comment edited Dec 21, 2023

6 answers

20

GATE CSE 2006 | Question: 81
A CPU has a $32$ $KB$ direct mapped cache with $128$ byte-block size. Suppose $A$ is two dimensional array of size $512 \times512$ with elements that occupy $8-bytes$ each. Consider the following two $C$ code segments, $P1$ and $P2$. $P1$: for (i=0; i<512; i++) { for ( ... $M2$. The value of the ratio $\frac{M_{1}}{M_{2}}$: $0$ $\frac{1}{16}$ $\frac{1}{8}$ $16$

A CPU has a $32$ $KB$ direct mapped cache with $128$ byte-block size. Suppose $A$ is two dimensional array of size $512 \times512$ with elements that occupy $8-bytes$ eac...

10.6k views

commented Dec 14, 2023

2 answers

21

GATE CSE 2021 Set 2 | Question: 54
Consider a network using the pure $\text{ALOHA}$ medium access control protocol, where each frame is of length $1,000$ bits. The channel transmission rate is $1$ Mbps ($=10^6$ bits per second). The aggregate number ... the average number of frames successfully transmitted per second. The throughput of the network (rounded to the nearest integer) is ______________

Consider a network using the pure $\text{ALOHA}$ medium access control protocol, where each frame is of length $1,000$ bits. The channel transmission rate is $1$ Mbps ($=...

14.6k views

commented Nov 25, 2023

1 answer

22

GATE CSE 1990 | Question: 10-a
Consider the following relational database: employees (eno, ename, address, basic-salary) projects (pno, pname, nos-of-staffs-allotted) working (pno, eno, pjob) The queries regarding data in the above database are formulated below in SQL. ... FROM projects)) SELECT pname FROM projects WHERE pno IN (SELECT pno FROM projects MINUS SELECT DISTINCT pno FROM working);

Consider the following relational database:employees (eno, ename, address, basic-salary)projects (pno, pname, nos-of-staffs-allotted)working (pno, eno, pjob)The queries r...

3.0k views

commented Nov 14, 2023

10 answers

23

GATE IT 2006 | Question: 85
Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the records are stored in ascending order of these primary keys as given in the tables. No indexing is available in the database. ... key, then $n$ lies in the range: $36 - 40$ $44 - 48$ $60 - 64$ $100 - 104$

Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the records are stored ...

22.6k views

commented Nov 13, 2023

4 answers

24

GATE CSE 2003 | Question: 17
Assume that the SLR parser for a grammar G has $n_1$ states and the LALR parser for G has $n_2$ states. The relationship between $n_1$ and $n_2$ is $n_1$ is necessarily less than $n_2$ $n_1$ is necessarily equal to $n_2$ $n_1$ is necessarily greater than $n_2$ None of the above

Assume that the SLR parser for a grammar G has $n_1$ states and the LALR parser for G has $n_2$ states. The relationship between $n_1$ and $n_2$ is$n_1$ is necessarily le...

11.4k views

commented Nov 11, 2023

3 answers

25

GATE CSE 2008 | Question: 55
An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if The SLR(1) parser for G has S-R conflicts The LR(1) parser for G has S-R conflicts The LR(0) parser for G has S-R conflicts The LALR(1) parser for G has reduce-reduce conflicts

An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only ifThe SLR(1) parser for G has S-R conflictsThe LR(1) parser for G has S-R conflictsThe...

16.0k views

commented Nov 11, 2023

11 answers

26

GATE CSE 2004 | Question: 81
Let $G_1=(V,E_1)$ and $G_2 =(V,E_2)$ be connected graphs on the same vertex set $V$ with more than two vertices. If $G_1 \cap G_2= (V,E_1\cap E_2)$ is not a connected graph, then the graph $G_1\cup G_2=(V,E_1\cup E_2)$ cannot have a cut vertex must have a cycle must have a cut-edge (bridge) has chromatic number strictly greater than those of $G_1$ and $G_2$

Let $G_1=(V,E_1)$ and $G_2 =(V,E_2)$ be connected graphs on the same vertex set $V$ with more than two vertices. If $G_1 \cap G_2= (V,E_1\cap E_2)$ is not a connected gr...

12.0k views

commented Nov 10, 2023

11 answers

27

GATE CSE 2015 Set 3 | Question: 36
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a packet $35$ microseconds after it receives the same. If $10000$ bits of ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.

Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a pack...

33.5k views

commented Nov 6, 2023

2 answers

28

GATE CSE 2020 | Question: 38
An organization requires a range of IP address to assign one to each of its $1500$ computers. The organization has approached an Internet Service Provider (ISP) for this task. The ISP uses CIDR and serves the requests from the available IP address space $202.61.0.0/17$. The ... $\text{III}$ only $\text{III}$ and $\text{IV}$ only $\text{I}$ and $\text{IV}$ only

An organization requires a range of IP address to assign one to each of its $1500$ computers. The organization has approached an Internet Service Provider (ISP) for this ...

24.8k views

comment reshown Oct 18, 2023

11 answers

29

GATE CSE 2004 | Question: 85
A program takes as input a balanced binary search tree with $n$ leaf nodes and computes the value of a function $g(x)$ for each node $x$. If the cost of computing $g(x)$ ... time complexity of the program is? $\Theta (n)$ $\Theta (n \log n)$ $\Theta(n^2)$ $\Theta (n^2\log n)$

A program takes as input a balanced binary search tree with $n$ leaf nodes and computes the value of a function $g(x)$ for each node $x$. If the cost of computing $g(x)$ ...

33.4k views

comment edited Sep 30, 2023

1 answer

30

GATE CSE 2021 Set 1 | Question: 47
Consider a $\textit{dynamic}$ hashing approach for $4$-bit integer keys: There is a main hash table of size $4$. The $2$ least significant bits of a key is used to index into the main hash table. Initially, the main hash table entries are empty. Thereafter, when more keys are hashed ... notation)? $5,9,4,13,10,7$ $9,5,10,6,7,1$ $10,9,6,7,5,13$ $9,5,13,6,10,14$

Consider a $\textit{dynamic}$ hashing approach for $4$-bit integer keys:There is a main hash table of size $4$.The $2$ least significant bits of a key is used to index in...

7.9k views

commented Sep 24, 2023

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true