Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Arjun
14
votes
6
answers
451
GATE CSE 2021 Set 1 | Question: 9
Consider the following array.$\begin{array}{|l|l|l|l|l|l|} \hline 23&32&45&69&72&73&89&97 \\ \hline\end{array}$ Which algorithm out of the following options uses the least number of comparisons ( ... elements) to sort the above array in ascending order? Selection sort Mergesort Insertion sort Quicksort using the last element as pivot
Consider the following array.$$\begin{array}{|l|l|l|l|l|l|} \hline 23&32&45&69&72&73&89&97 \\ \hline\end{array}$$ Which algorithm out of the following options uses the le...
12.4k
views
asked
Feb 18, 2021
Algorithms
gatecse-2021-set1
algorithms
sorting
1-mark
+
–
19
votes
3
answers
452
GATE CSE 2021 Set 1 | Question: 10
A binary search tree $T$ contains $n$ distinct elements. What is the time complexity of picking an element in $T$ that is smaller than the maximum element in $T$? $\Theta(n\log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta (1)$
A binary search tree $T$ contains $n$ distinct elements. What is the time complexity of picking an element in $T$ that is smaller than the maximum element in $T$?$\Theta(...
11.8k
views
asked
Feb 18, 2021
DS
gatecse-2021-set1
data-structures
binary-search-tree
time-complexity
1-mark
+
–
13
votes
3
answers
453
GATE CSE 2021 Set 1 | Question: 11
In the context of operating systems, which of the following statements is/are correct with respect to paging? Paging helps solve the issue of external fragmentation Page size has no impact on internal fragmentation Paging incurs memory overheads Multi-level paging is necessary to support pages of different sizes
In the context of operating systems, which of the following statements is/are correct with respect to paging?Paging helps solve the issue of external fragmentationPage si...
13.1k
views
asked
Feb 18, 2021
Operating System
gatecse-2021-set1
multiple-selects
operating-system
page-replacement
1-mark
+
–
17
votes
3
answers
454
GATE CSE 2021 Set 1 | Question: 12
Let $\langle M \rangle$ denote an encoding of an automaton $M$. Suppose that $\Sigma = \{0,1\}$. Which of the following languages is/are $\text{NOT}$ recursive? $L= \{ \langle M \rangle \mid M$ is a $\text{DFA}$ such that $L(M)=\emptyset \}$ ... that $L(M)=\emptyset \}$ $L= \{ \langle M \rangle \mid M$ is a $\text{PDA}$ such that $L(M)=\Sigma ^* \}$
Let $\langle M \rangle$ denote an encoding of an automaton $M$. Suppose that $\Sigma = \{0,1\}$. Which of the following languages is/are $\text{NOT}$ recursive?$L= \{ \la...
7.3k
views
asked
Feb 18, 2021
Theory of Computation
gatecse-2021-set1
multiple-selects
theory-of-computation
recursive-and-recursively-enumerable-languages
1-mark
+
–
19
votes
2
answers
455
GATE CSE 2021 Set 1 | Question: 13
Suppose a database system crashes again while recovering from a previous crash. Assume checkpointing is not done by the database either during the transactions or during recovery. Which of the following statements is/are correct? The same ... All the transactions that are already undone and redone will not be recovered again The database will become inconsistent
Suppose a database system crashes again while recovering from a previous crash. Assume checkpointing is not done by the database either during the transactions or during ...
10.8k
views
asked
Feb 18, 2021
Databases
gatecse-2021-set1
multiple-selects
databases
transaction-and-concurrency
1-mark
+
–
18
votes
4
answers
456
GATE CSE 2021 Set 1 | Question: 14
Which of the following standard $C$ library functions will always invoke a system call when executed from a single-threaded process in a $\text{UNIX/Linux}$ operating system? $\textsf{exit}$ $\textsf{malloc}$ $\textsf{sleep}$ $\textsf{strlen}$
Which of the following standard $C$ library functions will always invoke a system call when executed from a single-threaded process in a $\text{UNIX/Linux}$ operating sys...
10.8k
views
asked
Feb 18, 2021
Operating System
gatecse-2021-set1
multiple-selects
operating-system
system-call
1-mark
+
–
19
votes
2
answers
457
GATE CSE 2021 Set 1 | Question: 15
Consider a linear list based directory implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the file metadata, such as the list of pointers to the data blocks. Consider a given directory ... $\textsf{foo}$ Renaming of an existing file in $\textsf{foo}$ Opening of an existing file in $\textsf{foo}$
Consider a linear list based directory implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the file meta...
8.5k
views
asked
Feb 18, 2021
Operating System
gatecse-2021-set1
multiple-selects
operating-system
file-system
1-mark
+
–
13
votes
5
answers
458
GATE CSE 2021 Set 1 | Question: 16
In an undirected connected planar graph $G$, there are eight vertices and five faces. The number of edges in $G$ is _________.
In an undirected connected planar graph $G$, there are eight vertices and five faces. The number of edges in $G$ is _________.
8.2k
views
asked
Feb 18, 2021
Graph Theory
gatecse-2021-set1
graph-theory
graph-planarity
numerical-answers
easy
1-mark
+
–
8
votes
3
answers
459
GATE CSE 2021 Set 1 | Question: 17
Consider the following undirected graph with edge weights as shown: The number of minimum-weight spanning trees of the graph is ___________.
Consider the following undirected graph with edge weights as shown:The number of minimum-weight spanning trees of the graph is ___________.
11.0k
views
asked
Feb 18, 2021
Algorithms
gatecse-2021-set1
algorithms
graph-algorithms
minimum-spanning-tree
numerical-answers
1-mark
+
–
16
votes
2
answers
460
GATE CSE 2021 Set 1 | Question: 18
The lifetime of a component of a certain type is a random variable whose probability density function is exponentially distributed with parameter $2$. For a randomly picked component of this type, the probability that its lifetime exceeds the expected lifetime (rounded to $2$ decimal places) is ____________.
The lifetime of a component of a certain type is a random variable whose probability density function is exponentially distributed with parameter $2$. For a randomly pick...
9.4k
views
asked
Feb 18, 2021
Probability
gatecse-2021-set1
probability
random-variable
numerical-answers
1-mark
+
–
38
votes
3
answers
461
GATE CSE 2021 Set 1 | Question: 19
There are $6$ jobs with distinct difficulty levels, and $3$ computers with distinct processing speeds. Each job is assigned to a computer such that: The fastest computer gets the toughest job and the slowest computer gets the easiest job. Every computer gets at least one job. The number of ways in which this can be done is ___________.
There are $6$ jobs with distinct difficulty levels, and $3$ computers with distinct processing speeds. Each job is assigned to a computer such that:The fastest computer g...
11.9k
views
asked
Feb 18, 2021
Combinatory
gatecse-2021-set1
combinatory
counting
numerical-answers
1-mark
+
–
4
votes
2
answers
462
GATE CSE 2021 Set 1 | Question: 20
Consider the following expression.$\displaystyle \lim_{x\rightarrow-3}\frac{\sqrt{2x+22}-4}{x+3}$The value of the above expression (rounded to 2 decimal places) is ___________.
Consider the following expression.$$\displaystyle \lim_{x\rightarrow-3}\frac{\sqrt{2x+22}-4}{x+3}$$The value of the above expression (rounded to 2 decimal places) is ____...
6.4k
views
asked
Feb 18, 2021
Calculus
gatecse-2021-set1
calculus
limits
numerical-answers
1-mark
+
–
10
votes
3
answers
463
GATE CSE 2021 Set 1 | Question: 21
Consider the following sequence of operations on an empty stack.$\textsf{push}(54);\textsf{push}(52);\textsf{pop}();\textsf{push}(55);\textsf{push}(62);\textsf{s}=\textsf{pop}();$ ... $\textsf{s+q}$ is ___________.
Consider the following sequence of operations on an empty stack.$$\textsf{push}(54);\textsf{push}(52);\textsf{pop}();\textsf{push}(55);\textsf{push}(62);\textsf{s}=\texts...
8.4k
views
asked
Feb 18, 2021
DS
gatecse-2021-set1
data-structures
stack
easy
numerical-answers
1-mark
+
–
3
votes
4
answers
464
GATE CSE 2021 Set 1 | Question: 22
Consider a computer system with a byte-addressable primary memory of size $2^{32}$ bytes. Assume the computer system has a direct-mapped cache of size $\text{32 KB}$ ($\text{1 KB}$ = $2^{10}$ bytes), and each cache block is of size $64$ bytes. The size of the tag field is __________ bits.
Consider a computer system with a byte-addressable primary memory of size $2^{32}$ bytes. Assume the computer system has a direct-mapped cache of size $\text{32 KB}$ ($\t...
5.4k
views
asked
Feb 18, 2021
CO and Architecture
gatecse-2021-set1
co-and-architecture
cache-memory
numerical-answers
1-mark
+
–
33
votes
2
answers
465
GATE CSE 2021 Set 1 | Question: 23
A relation $r(A, B)$ in a relational database has $1200$ tuples. The attribute $A$ has integer values ranging from $6$ to $20$, and the attribute $B$ has integer values ranging from $1$ to $20$. Assume that the attributes $A$ and $B$ are independently distributed. The estimated number of tuples in the output of $\sigma _{(A>10)\vee(B=18)}(r)$ is ____________.
A relation $r(A, B)$ in a relational database has $1200$ tuples. The attribute $A$ has integer values ranging from $6$ to $20$, and the attribute $B$ has integer values r...
13.1k
views
asked
Feb 18, 2021
Databases
gatecse-2021-set1
databases
sql
numerical-answers
1-mark
+
–
9
votes
5
answers
466
GATE CSE 2021 Set 1 | Question: 24
Consider the following representation of a number in $\text{IEEE 754}$ single-precision floating point format with a bias of $127$.$S: 1\quad\quad E:\; 10000001\quad\quad F:\;11110000000000000000000$ Here $S, \;E$ and ... the floating point representation. The decimal value corresponding to the above representation (rounded to $2$ decimal places) is ____________.
Consider the following representation of a number in $\text{IEEE 754}$ single-precision floating point format with a bias of $127$.$$S: 1\quad\quad E:\; 10000001\quad\qu...
8.1k
views
asked
Feb 18, 2021
Digital Logic
gatecse-2021-set1
digital-logic
number-representation
ieee-representation
numerical-answers
1-mark
+
–
14
votes
6
answers
467
GATE CSE 2021 Set 1 | Question: 25
Three processes arrive at time zero with $\text{CPU}$ bursts of $16,\;20$ and $10$ milliseconds. If the scheduler has prior knowledge about the length of the $\text{CPU}$ bursts, the minimum achievable average waiting time for these three processes in a non-preemptive scheduler (rounded to nearest integer) is _____________ milliseconds.
Three processes arrive at time zero with $\text{CPU}$ bursts of $16,\;20$ and $10$ milliseconds. If the scheduler has prior knowledge about the length of the $\text{CPU}$...
9.3k
views
asked
Feb 18, 2021
Operating System
gatecse-2021-set1
operating-system
process-scheduling
numerical-answers
1-mark
+
–
18
votes
3
answers
468
GATE CSE 2021 Set 1 | Question: 26
Consider the following grammar (that admits a series of declarations, followed by expressions) and the associated syntax directed translation $\text{(SDT)}$ ... used to type-check syntactically correct boolean variable declarations and boolean expressions. The actions will lead to an infinite loop
Consider the following grammar (that admits a series of declarations, followed by expressions) and the associated syntax directed translation $\text{(SDT)}$ acti...
10.5k
views
asked
Feb 18, 2021
Compiler Design
gatecse-2021-set1
compiler-design
syntax-directed-translation
2-marks
+
–
16
votes
4
answers
469
GATE CSE 2021 Set 1 | Question: 27
The following relation records the age of $500$ employees of a company, where $empNo$ (indicating the employee number) is the key: $empAge(\underline{empNo},age)$ ... Employee numbers of all employees whose age is not the minimum Employee numbers of all employees whose age is the minimum
The following relation records the age of $500$ employees of a company, where $empNo$ (indicating the employee number) is the key:$$empAge(\underline{empNo},age)$$Conside...
7.2k
views
asked
Feb 18, 2021
Databases
gatecse-2021-set1
databases
relational-algebra
2-marks
+
–
11
votes
3
answers
470
GATE CSE 2021 Set 1 | Question: 28
Consider a $3$-bit counter, designed using $T$ flip-flops, as shown below: Assuming the initial state of the counter given by $\text{PQR}$ as $000$, what are the next three states? $011,101,000$ $001,010,111$ $011,101,111$ $001,010,000$
Consider a $3$-bit counter, designed using $T$ flip-flops, as shown below:Assuming the initial state of the counter given by $\text{PQR}$ as $000$, what are the next thre...
7.4k
views
asked
Feb 18, 2021
Digital Logic
gatecse-2021-set1
digital-logic
sequential-circuit
digital-counter
2-marks
+
–
Page:
« prev
1
...
18
19
20
21
22
23
24
25
26
27
28
...
96
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register