Dark Mode

Recent questions tagged multiple-selects

4 votes

3 answers

1

GO Classes Weekly Quiz 1 | Fundamental Course | Question: 8
Let $k$ be some integer and it is given that $a \equiv b(\bmod n)$ then which of the following(s) is/are ALWAYS true? More than one option can be true. $a \equiv b-3 n(\bmod n)$ $a \equiv b+k(\bmod n)$ $a+k \equiv b+k(\bmod n)$ $a+5 n \equiv b-3 n(\bmod n)$

GO Classes asked in Quantitative Aptitude Mar 1

279 views

3 votes

2 answers

2

GO Classes Weekly Quiz 1 | Fundamental Course | Question: 9
Which of the following(s) ALWAYS hold given that $a \equiv b(\bmod n)$ is true for some integers $a, b$ and $n.$ More than one option can be true. $a \bmod n=b \bmod n$ $n \mid(a-b)$ $n \mid a$ $n \mid b$

GO Classes asked in Quantitative Aptitude Mar 1

233 views

1 vote

2 answers

3

GO Classes Weekly Quiz 1 | Fundamental Course | Question: 10
Which of the following options is/are TRUE? $43 \equiv-2(\bmod 5)$ $5 \equiv-7(\bmod 3)$ $-10 \equiv-25(\bmod 7)$ $8 \equiv-8(\bmod 5)$

GO Classes asked in Quantitative Aptitude Mar 1

203 views

2 votes

1 answer

4

GATE CSE 2023 | Question: 12
Which one or more of the following need to be saved on a context switch from one thread $\text{(T1)}$ of a process to another thread $\text{(T2)}$ of the same process? Page table base register Stack pointer Program counter General purpose registers

admin asked in Operating System Feb 15

by admin

1.4k views

2 votes

2 answers

5

GATE CSE 2023 | Question: 13
Which one or more of the following options guarantee that a computer system will transition from user mode to kernel mode? Function Call malloc Call Page Fault System Call

admin asked in Operating System Feb 15

by admin

1.4k views

2 votes

3 answers

6

GATE CSE 2023 | Question: 14
Which of the following statements is/are $\text{CORRECT}?$ The intersection of two regular languages is regular. The intersection of two context-free languages is context-free. The intersection of two recursive languages is recursive. The intersection of two recursively enumerable languages is recursively enumerable.

admin asked in Theory of Computation Feb 15

by admin

932 views

2 votes

1 answer

7

GATE CSE 2023 | Question: 15
Which of the following statements is/are $\text{INCORRECT}$ about the $\textsf{OSPF (Open Shortest Path First)}$ routing protocol used in the Internet? $\textsf{OSPF}$ implements Bellman-Ford algorithm to find shortest paths. $\textsf{OSPF}$ ... path routing. $\textsf{OSPF}$ is used as an inter-domain routing protocol. $\textsf{OSPF}$ implements hierarchical routing.

admin asked in Computer Networks Feb 15

by admin

1.1k views

6 votes

3 answers

8

GATE CSE 2023 | Question: 16
Geetha has a conjecture about integers, which is of the form \[ \forall x(P(x) \Longrightarrow \exists y Q(x, y)), \] where $P$ is a statement about integers, and $Q$ is a statement about pairs of integers. Which of the following (one or more) option(s) would imply ... $\exists y \forall x(P(x) \Longrightarrow Q(x, y))$ $\exists x(P(x) \wedge \exists y Q(x, y))$

admin asked in Mathematical Logic Feb 15

by admin

1.4k views

9 votes

3 answers

9

GATE CSE 2023 | Question: 17
Which one or more of the following $\text{CPU}$ scheduling algorithms can potentially cause starvation? First-in First-Out Round Robin Priority Scheduling Shortest Job First

admin asked in Operating System Feb 15

by admin

3.0k views

2 votes

2 answers

10

GATE CSE 2023 | Question: 18
Let $\qquad f(x)=x^{3}+15 x^{2}-33 x-36$ be a real-valued function. Which of the following statements is/are $\text{TRUE}?$ $f(x)$ does not have a local maximum. $f(x)$ has a local maximum. $f(x)$ does not have a local minimum. $f(x)$ has a local minimum.

admin asked in Calculus Feb 15

by admin

782 views

2 votes

0 answers

11

GATE CSE 2023 | Question: 19
Let $f$ and $g$ be functions of natural numbers given by $f(n)=n$ and $g(n)=n^{2}.$ Which of the following statements is/are $\text{TRUE}?$ $f \in O(g)$ $f \in \Omega(g)$ $f \in o(g)$ $f \in \Theta(g)$

admin asked in Algorithms Feb 15

by admin

1.2k views

2 votes

1 answer

12

GATE CSE 2023 | Question: 39
Let $f: A \rightarrow B$ be an onto (or surjective) function, where $A$ and $B$ are nonempty sets. Define an equivalence relation $\sim$ on the set $A$ as \[ a_{1} \sim a_{2} \text { if } f\left(a_{1}\right)=f\left(a_{2}\right), \] ... is NOT well-defined. $F$ is an onto (or surjective) function. $F$ is a one-to-one (or injective) function. $F$ is a bijective function.

admin asked in Set Theory & Algebra Feb 15

by admin

853 views

1 vote

2 answers

13

GATE CSE 2023 | Question: 40
Suppose you are asked to design a new reliable byte-stream transport protocol like $\text{TCP}.$ This protocol, named $\textsf{myTCP}$, runs over a $100 \mathrm{~Mbps}$ network with Round Trip Time of $150$ ... lengths of the Sequence Number field in the $\textsf{myTCP}$ header? $30$ bits $32$ bits $34$ bits $36$ bits

admin asked in Computer Networks Feb 15

by admin

1.2k views

1 vote

1 answer

14

GATE CSE 2023 | Question: 41
Let $X$ be a set and $2^{X}$ denote the powerset of $X$. Define a binary operation $\Delta$ on $2^{X}$ as follows: \[ A \Delta B=(A-B) \cup(B-A) \text {. } \] Let $H=\left(2^{X}, \Delta\right)$. Which of the following statements about $H$ is/are correct? ... $A \in 2^{X},$ the inverse of $A$ is the complement of $A$. For every $A \in 2^{X},$ the inverse of $A$ is $A$.

admin asked in Set Theory & Algebra Feb 15

by admin

995 views

4 votes

1 answer

15

GATE CSE 2023 | Question: 42
Suppose in a web browser, you click on the $\textsf{www. gate-2023.in}\; \text{URL}$. The browser cache is empty. The $\text{IP address}$ for this $\text{URL}$ is not cached in your local host, so a $\text{DNS}$ lookup is triggered (by the ... $5$ parallel $\text{TCP}$ connections. $6\; \text{RTT}$s, in case of persistent $\text{HTTP}$ with pipelining.

admin asked in Computer Networks Feb 15

by admin

2.2k views

1 vote

1 answer

16

GATE CSE 2023 | Question: 43
Consider a random experiment where two fair coins are tossed. Let $A$ be the event that denotes $\text{HEAD}$ on both the throws, $B$ be the event that denotes $\text{HEAD}$ on the first throw, and $C$ be the event that denotes $\text{HEAD}$ on the ... . $A$ and $C$ are independent. $B$ and $C$ are independent. $\operatorname{Prob}(B \mid C)=\operatorname{Prob}(B)$

admin asked in Probability Feb 15

by admin

862 views

3 votes

1 answer

17

GATE CSE 2023 | Question: 44
Consider functions $\textsf{Function_1}$ and $\textsf{Function_2}$ ... $f_{1}(n) \in \omega\left(f_{2}(n)\right)$ $f_{1}(n) \in O(n)$

admin asked in Algorithms Feb 15

by admin

1.3k views

4 votes

2 answers

18

GATE CSE 2023 | Question: 45
Let $G$ be a simple, finite, undirected graph with vertex set $\left\{v_{1}, \ldots, v_{n}\right\}$. Let $\Delta(G)$ denote the maximum degree of $G$ and let $\mathbb{N}=\{1,2, \ldots\}$ denote the set of all possible colors. Color the vertices ... $\Delta(G)$. The number of colors used is equal to the chromatic number of $G$.

admin asked in Graph Theory Feb 15

by admin

2.0k views

0 votes

0 answers

19

GATE 2023 question
In which of the given operations, will a user level to kernel level switch, surely happen? Page Fault System Call Subroutine Call Malloc()

Souvik33 asked in Operating System Feb 6

164 views

1 vote

2 answers

20

GATE CSE 2023 | Memory Based Question: 17
Let $x$ be a set, $2^x=$ power $2 \mathrm{k}$ set of $\mathrm{X}$. define A binary operation $\Delta$ on $2^x$ as $A \Delta B=(A-B) \cup(B-A)$. Let $H=\left(2^x, \Delta\right)$, then for every $A \in 2^x$; inverse of $A$ ... $\mathrm{H}$ is a group. $\mathrm{H}$ satisfies inverse prop, but not a group for every $A \in 2^x$; the inverse of $A$ is $A$.

GO Classes asked in Set Theory & Algebra Feb 6

397 views

Page:

1
2
3
4
5
6
...
34
next »

Recent questions tagged multiple-selects