Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Arjun
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Arjun
8
votes
3
answers
181
GATE CSE 2021 Set 1 | Question: 4
Consider the following statements. $S_1:$ The sequence of procedure calls corresponds to a preorder traversal of the activation tree. $S_2:$ The sequence of procedure returns corresponds to a postorder traversal of the activation tree. Which one of the following options is ... and $S_2$ is true $S_1$ is true and $S_2$ is true $S_1$ is false and $S_2$ is false
asked
in
Compiler Design
Feb 18, 2021
3.8k
views
gatecse-2021-set1
runtime-environment
normal
1-mark
8
votes
2
answers
182
GATE CSE 2021 Set 1 | Question: 5
Consider the following statements. $S_1:$ Every $\text{SLR(1)}$ grammar is unambiguous but there are certain unambiguous grammars that are not $\text{SLR(1)}$. $S_2:$ For any context-free grammar, there is a parser that takes at most $O(n^3)$ time to parse a ... false $S_1$ is false and $S_2$ is true $S_1$ is true and $S_2$ is true $S_1$ is false and $S_2$ is false
asked
in
Compiler Design
Feb 18, 2021
4.9k
views
gatecse-2021-set1
compiler-design
lr-parser
1-mark
6
votes
4
answers
183
GATE CSE 2021 Set 1 | Question: 6
Let the representation of a number in base $3$ be $210$. What is the hexadecimal representation of the number? $15$ $21$ $\text{D}2$ $528$
asked
in
Digital Logic
Feb 18, 2021
6.5k
views
gatecse-2021-set1
digital-logic
number-representation
normal
1-mark
7
votes
5
answers
184
GATE CSE 2021 Set 1 | Question: 7
Let $p$ and $q$ be two propositions. Consider the following two formulae in propositional logic. $S_1: (\neg p\wedge(p\vee q))\rightarrow q$ $S_2: q\rightarrow(\neg p\wedge(p\vee q))$ Which one of the following choices is correct? Both $S_1$ and ... but $S_2$ is not a tautology $S_1$ is not a tautology but $S_2$ is a tautology Neither $S_1$ nor $S_2$ is a tautology
asked
in
Mathematical Logic
Feb 18, 2021
4.5k
views
gatecse-2021-set1
mathematical-logic
propositional-logic
1-mark
4
votes
4
answers
185
GATE CSE 2021 Set 1 | Question: 8
Consider the following two statements. $S_1$: Destination $\text{MAC}$ address of an $\text{ARP}$ reply is a broadcast address. $S_2$: Destination $\text{MAC}$ address of an $\text{ARP}$ request is a broadcast address. Which one of the following choices is ... true $S_1$ is true and $S_2$ is false $S_1$ is false and $S_2$ is true Both $S_1$ and $S_2$ are false
asked
in
Computer Networks
Feb 18, 2021
3.5k
views
gatecse-2021-set1
computer-networks
network-protocols
1-mark
9
votes
4
answers
186
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
asked
in
Algorithms
Feb 18, 2021
7.6k
views
gatecse-2021-set1
algorithms
sorting
1-mark
13
votes
3
answers
187
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)$
asked
in
DS
Feb 18, 2021
7.3k
views
gatecse-2021-set1
data-structures
binary-search-tree
time-complexity
1-mark
7
votes
3
answers
188
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
asked
in
Operating System
Feb 18, 2021
7.7k
views
gatecse-2021-set1
multiple-selects
operating-system
page-replacement
1-mark
9
votes
3
answers
189
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 ^* \}$
asked
in
Theory of Computation
Feb 18, 2021
4.1k
views
gatecse-2021-set1
multiple-selects
theory-of-computation
recursive-and-recursively-enumerable-languages
1-mark
12
votes
2
answers
190
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
asked
in
Databases
Feb 18, 2021
6.5k
views
gatecse-2021-set1
multiple-selects
databases
transaction-and-concurrency
1-mark
12
votes
3
answers
191
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}$
asked
in
Operating System
Feb 18, 2021
6.5k
views
gatecse-2021-set1
multiple-selects
operating-system
system-call
1-mark
10
votes
1
answer
192
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}$
asked
in
Operating System
Feb 18, 2021
5.0k
views
gatecse-2021-set1
multiple-selects
operating-system
file-system
1-mark
8
votes
5
answers
193
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 _________.
asked
in
Graph Theory
Feb 18, 2021
5.9k
views
gatecse-2021-set1
graph-theory
graph-planarity
numerical-answers
easy
1-mark
5
votes
3
answers
194
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 ___________.
asked
in
Algorithms
Feb 18, 2021
6.8k
views
gatecse-2021-set1
algorithms
graph-algorithms
minimum-spanning-tree
numerical-answers
1-mark
11
votes
2
answers
195
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 ____________.
asked
in
Probability
Feb 18, 2021
5.5k
views
gatecse-2021-set1
probability
random-variable
numerical-answers
1-mark
25
votes
3
answers
196
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 ___________.
asked
in
Combinatory
Feb 18, 2021
7.0k
views
gatecse-2021-set1
combinatory
counting
numerical-answers
1-mark
3
votes
2
answers
197
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 ___________.
asked
in
Calculus
Feb 18, 2021
3.6k
views
gatecse-2021-set1
calculus
limits
numerical-answers
1-mark
6
votes
3
answers
198
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 ___________.
asked
in
DS
Feb 18, 2021
5.3k
views
gatecse-2021-set1
data-structures
stack
numerical-answers
1-mark
1
vote
4
answers
199
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.
asked
in
CO and Architecture
Feb 18, 2021
3.4k
views
gatecse-2021-set1
co-and-architecture
cache-memory
numerical-answers
1-mark
19
votes
2
answers
200
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 ____________.
asked
in
Databases
Feb 18, 2021
7.3k
views
gatecse-2021-set1
databases
sql
numerical-answers
1-mark
Page:
« prev
1
...
5
6
7
8
9
10
11
12
13
14
15
...
83
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
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
Recent Posts
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...
@Aakash_Bhardwaj all the best bro . For your...