Answers by MSG1999 / GATE Overflow for GATE CSE

0 votes

1

GATE CSE 1999 | Question: 2.21
If $T_1 = O(1)$, give the correct matching for the following pairs: $\begin{array}{l|l}\hline \text{(M) $T_n = T_{n-1} + n$} & \text{(U) $T_n = O(n)$} \\\hline \text{(N) $T_n = T_{n/2} + n$} & \text{(V) $T_n = O(n \log n)$ ... $\text{M-W, N-U, O-X, P-V}$ $\text{M-V, N-W, O-X, P-U}$ $\text{M-W, N-U, O-V, P-X}$

If $T_1 = O(1)$, give the correct matching for the following pairs:$$\begin{array}{l|l}\hline \text{(M) $T_n = T_{n-1} + n$} & \text{(U) $T_n = O(n)$} \\\hline \text{(...

15.1k views

answered Jan 23

0 votes

2

GATE Civil 2023 Set 1 | GA Question: 10
A square of side length $4 \mathrm{~cm}$ is given. The boundary of the shaded region is defined by one semi-circle on the top and two circular arcs at the bottom, each of radius $2 \mathrm{~cm}$, as shown. The area of the shaded region is__________$\text{cm}^{2}.$ $8$ $4$ $12$ $10$

A square of side length $4 \mathrm{~cm}$ is given. The boundary of the shaded region is defined by one semi-circle on the top and two circular arcs at the bottom, each of...

1.1k views

answered Jan 10

1 votes

3

GATE IT 2008 | Question: 53
The following is a code with two threads, producer and consumer, that can run in parallel. Further, $S$ and $Q$ are binary semaphores quipped with the standard $P$ and $V$ operations. semaphore S = 1, Q = 0; integer x; producer: ... lost Values generated and stored in '$x$' by the producer will always be consumed before the producer can generate a new value

The following is a code with two threads, producer and consumer, that can run in parallel. Further, $S$ and $Q$ are binary semaphores quipped with the standard $P$ and $V...

9.8k views

answered Dec 27, 2023

0 votes

4

GATE CSE 2015 Set 2 | Question: 33
Which one of the following hash functions on integers will distribute keys most uniformly over $10$ buckets numbered $0$ to $9$ for $i$ ranging from $0$ to $2020$? $h(i) = i^2 \text{mod } 10$ $h(i) = i^3 \text{mod } 10$ $h(i) = (11 \ast i^2) \text{mod } 10$ $h(i) = (12 \ast i^2) \text{mod } 10$

Which one of the following hash functions on integers will distribute keys most uniformly over $10$ buckets numbered $0$ to $9$ for $i$ ranging from $0$ to $2020$?$h(i) ...

17.1k views

answered Dec 11, 2023

2 votes

5

GATE CSE 1998 | Question: 1.1
A die is rolled three times. The probability that exactly one odd number turns up among the three outcomes is $\dfrac{1}{6}$ $\dfrac{3}{8}$ $\dfrac{1}{8}$ $\dfrac{1}{2}$

A die is rolled three times. The probability that exactly one odd number turns up among the three outcomes is$\dfrac{1}{6}$ $\dfrac{3}{8}$ $\dfrac{1}{8}$ $\dfrac{1}{2}...

8.6k views

answered Oct 10, 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