Answers by DEBANJAN DAS2k / GATE Overflow for GATE CSE

0 votes

1

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 ...

76 views

answered Apr 22

2 votes

2

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...

231 views

answered Mar 15

4 votes

3

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.2k views

answered Feb 16

2 votes

4

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 votes

5

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...

597 views

answered Jan 31

1 votes

6

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...

489 views

answered Jan 23

2 votes

7

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...

437 views

answered Dec 17, 2023

1 votes

8

GATE CSE 2012 | Question: 39
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is $O (n \log n) $ $ O(n^{2} \log n) $ $ O(n^{2} + \log n) $ $ O(n^{2}) $

A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is$O (n \log...

29.2k views

answered Sep 24, 2023

1 votes

9

GATE ECE 2023 | GA Question: 9
Out of $1000$ individuals in a town, $100$ unidentified individuals are covid positive. Due to lack of adequate covid-testing kits, the health authorities of the town devised a strategy to identify these covid-positive individuals. The strategy is to: ... identify all the $100$ covid positive individuals irrespective of how they are grouped. $700$ $600$ $800$ $1000$

Out of $1000$ individuals in a town, $100$ unidentified individuals are covid positive. Due to lack of adequate covid-testing kits, the health authorities of the town dev...

1.1k views

answered Aug 14, 2023

1 votes

10

GATE CH 2023 | GA Question: 6
Human beings are one among many creatures that inhabit an imagined world. In this imagined world, some creatures are cruel. If in this imagined world, it is given that the statement "Some human beings are not cruel creatures" is $\text{FALSE,}$ then which of the ... are cruel creatures. only (i) only (iii) and (iv) only (i) and (ii) (i), (ii) and (iii)

Human beings are one among many creatures that inhabit an imagined world. In this imagined world, some creatures are cruel. If in this imagined world, it is given that th...

896 views

answered Aug 13, 2023

1 votes

11

GATE Mechanical 2023 | GA Question: 9
How many pairs of sets $\text{(S, T)}$ are possible among the subsets of $\{1,2,3,4,5,6\}$ that satisfy the condition that $\mathrm{S}$ is a subset of $\mathrm{T}?$ $729$ $728$ $665$ $664$

How many pairs of sets $\text{(S, T)}$ are possible among the subsets of $\{1,2,3,4,5,6\}$ that satisfy the condition that $\mathrm{S}$ is a subset of $\mathrm{T}?$ $729$...

1.2k views

answered Aug 13, 2023

2 votes

12

UGC NET CSE | October 2022 | Part 1 | Question: 96
Read the following and Answer the Questions: Consider the relational schema of sailors $\text{S}$. Reserves $\mathrm{R}$ and Boots $\text{B}$. Table $1$: Sailors $\text{S}$ \begin{array}{|l|l|l|} \hline Sid & Sname & Ratting & Age \\ \ ... $\text{Q1}$ and $\text{Q3}$ Both $\text{Q2}$ and $\text{Q3}$ Only $\text{Q3}$ Only $\text{Q2}$

Read the following and Answer the Questions:Consider the relational schema of sailors $\text{S}$. Reserves $\mathrm{R}$ and Boots $\text{B}$.Table $1$: Sailors $\text{S}$...

557 views

answered Oct 24, 2022

1 votes

13

IITB Practice Set: 22
Suppose the stop and wait protocol is employed over an asymmetric link $A$ to $B$. The $A$ to $B$ link bandwidth is $8\text{ Mbps}$ with a propagation delay of $20\;ms$, however the $B$ to $A$ link bandwidth is $800\;\text{Kbps}$ ... other delays. Express answer in kbps. ($1\text{ Mbps} = 10^6 \text {bps and } 1\text{ Kbps} = 10^3 \text{bps})$

Suppose the stop and wait protocol is employed over an asymmetric link $A$ to $B$. The $A$ to $B$ link bandwidth is $8\text{ Mbps}$ with a propagation delay of $20\;ms$, ...

217 views

answered Sep 16, 2022

1 votes

14

ISI2020-PCB-CS: 1.3
What does the following function compute for $x \neq 0?$ float isi1(float x, int y) { if (y==0) { return 1; } else if (y>0) { return isi1(x,-y); } else { return isi1(x, y+1)/x; } }

What does the following function compute for $x \neq 0?$float isi1(float x, int y) { if (y==0) { return 1; } else if (y>0) { return isi1(x,-y); } else { return isi1(x, y+...

567 views

answered Aug 19, 2022

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