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
3
votes
1
answer
271
GATE ECE 2022 | GA Question: 10
Consider the following square with the four corners and the center marked as $\text{P, Q, R, S}$ and $\text{T}$ respectively. Let $\text{X, Y}$ and $\text{Z}$ represent the following operations: $\text{X:}$ rotation of the square by $180$ ... The sequence of operations $(2)$ and $(3)$ are equivalent The sequence of operations $(1), (2)$ and $(3)$ are equivalent
Consider the following square with the four corners and the center marked as $\text{P, Q, R, S}$ and $\text{T}$ respectively.Let $\text{X, Y}$ and $\text{Z}$ represent th...
943
views
asked
Feb 15, 2022
Spatial Aptitude
gateece-2022
spatial-aptitude
image-rotation
+
–
37
votes
2
answers
272
GATE CSE 2022 | Question: 1
Which one of the following statements is $\text{TRUE}$ for all positive functions $f(n)?$ $f(n^{2}) = \theta (f(n)^{2}),$ when $f(n)$ is a polynomial $f(n^{2}) = o (f(n)^{2})$ $f(n^{2}) = O (f(n)^{2}),$ when $f(n)$ is an exponential function $f(n^{2}) = \Omega (f(n)^{2})$
Which one of the following statements is $\text{TRUE}$ for all positive functions $f(n)?$$f(n^{2}) = \theta (f(n)^{2}),$ when $f(n)$ is a polynomial$f(n^{2}) = o (f(n)^{2...
15.8k
views
asked
Feb 15, 2022
Algorithms
gatecse-2022
algorithms
asymptotic-notation
1-mark
+
–
31
votes
4
answers
273
GATE CSE 2022 | Question: 2
Which one of the following regular expressions correctly represents the language of the finite automaton given below? $ab^{\ast}bab^{\ast} + ba^{\ast}aba^{\ast}$ $(ab^{\ast}b)^{\ast}ab^{\ast} + (ba^{\ast}a)^{\ast} ba^{\ast}$ $(ab^{\ast}b + ba^{\ast}a)^{\ast} (a^{\ast} + b^{\ast})$ $(ba^{\ast}a + ab^{\ast}b)^{\ast} (ab^{\ast} + ba^{\ast})$
Which one of the following regular expressions correctly represents the language of the finite automaton given below?$ab^{\ast}bab^{\ast} + ba^{\ast}aba^{\ast}$$(ab^{\ast...
17.8k
views
asked
Feb 15, 2022
Theory of Computation
gatecse-2022
theory-of-computation
finite-automata
regular-expression
1-mark
+
–
9
votes
1
answer
274
GATE CSE 2022 | Question: 3
Which one of the following statements is $\text{TRUE}?$ The $\textit{LALR}(1)$ parser for a grammar $\textit{G}$ cannot have reduce-reduce conflict if the $\textit{LR}(1)$ parser for $\textit{G}$ does not have reduce-reduce ... Data flow analysis is necessary for run-time memory management. $\textit{LR}(1)$ parsing is sufficient for deterministic context-free languages.
Which one of the following statements is $\text{TRUE}?$The $\textit{LALR}(1)$ parser for a grammar $\textit{G}$ cannot have reduce-reduce conflict if the $\textit{LR}(1)$...
7.4k
views
asked
Feb 15, 2022
Compiler Design
gatecse-2022
compiler-design
parsing
1-mark
+
–
12
votes
2
answers
275
GATE CSE 2022 | Question: 4
In a relational data model, which one of the following statements is $\text{TRUE}?$ A relation with only two attributes is always in $\text{BCNF}.$ If all attributes of a relation are prime attributes, then the relation is in $\text{BCNF}.$ Every relation has at least one non-prime attribute. $\text{BCNF}$ decompositions preserve functional dependencies.
In a relational data model, which one of the following statements is $\text{TRUE}?$A relation with only two attributes is always in $\text{BCNF}.$If all attributes of a r...
10.1k
views
asked
Feb 15, 2022
Databases
gatecse-2022
databases
database-normalization
1-mark
+
–
19
votes
4
answers
276
GATE CSE 2022 | Question: 5
Consider the problem of reversing a singly linked list. To take an example, given the linked list below, the reversed linked list should look like Which one of the following statements is $\text{TRUE}$ about the time complexity of algorithms that solve the above problem ... $O(1)$ space.
Consider the problem of reversing a singly linked list. To take an example, given the linked list below,the reversed linked list should look likeWhich one of the followin...
9.3k
views
asked
Feb 15, 2022
DS
gatecse-2022
data-structures
linked-list
1-mark
+
–
19
votes
2
answers
277
GATE CSE 2022 | Question: 6
Suppose we are given $n$ keys, $m$ hash table slots, and two simple uniform hash functions $h_{1}$ and $h_{2}.$ Further suppose our hashing scheme uses $h_{1}$ for the odd keys and $h_{2}$ for the even keys. What is the expected number of keys in a slot? $\frac{m}{n}$ $\frac{n}{m}$ $\frac{2n}{m}$ $\frac{n}{2m}$
Suppose we are given $n$ keys, $m$ hash table slots, and two simple uniform hash functions $h_{1}$ and $h_{2}.$ Further suppose our hashing scheme uses $h_{1}$ f...
10.5k
views
asked
Feb 15, 2022
Algorithms
gatecse-2022
algorithms
hashing
uniform-hashing
1-mark
+
–
9
votes
3
answers
278
GATE CSE 2022 | Question: 7
Which one of the following facilitates transfer of bulk data from hard disk to main memory with the highest throughput? $\text{DMA}$ based $\text{I/O}$ transfer Interrupt driven $\text{I/O}$ transfer Polling based $\text{I/O}$ transfer Programmed $\text{I/O}$ transfer
Which one of the following facilitates transfer of bulk data from hard disk to main memory with the highest throughput?$\text{DMA}$ based $\text{I/O}$ transferInterrupt d...
5.2k
views
asked
Feb 15, 2022
CO and Architecture
gatecse-2022
co-and-architecture
dma
1-mark
+
–
10
votes
2
answers
279
GATE CSE 2022 | Question: 8
Let $\text{R1}$ and $\text{R2}$ be two $4 - \text{bit}$ registers that store numbers in $2\text{'s}$ complement form. For the operation $\text{R1 + R2},$ which one of the following values of $\text{R1}$ and $\text{R2}$ ... and $\text{R2 = 1010}$ $\text{R1 = 0011}$ and $\text{R2 = 0100}$ $\text{R1 = 1001}$ and $\text{R2 = 1111}$
Let $\text{R1}$ and $\text{R2}$ be two $4 – \text{bit}$ registers that store numbers in $2\text{’s}$ complement form. For the operation $\text{R1 + R2},$ which one of...
8.9k
views
asked
Feb 15, 2022
Digital Logic
gatecse-2022
digital-logic
number-system
number-representation
1-mark
+
–
12
votes
3
answers
280
GATE CSE 2022 | Question: 9
Consider the following threads, $\text{T}_{1}, \text{T}_{2},$ and $\text{T}_{3}$ executing on a single processor, synchronized using three binary semaphore variables, $\text{S}_{1}, \text{S}_{2},$ and $\text{S}_{3},$ operated upon using standard $\textsf{wait}()$ ... $\text{S}_{1} = 0; \text{S}_{2} = 1; \text{S}_{3} = 1$
Consider the following threads, $\text{T}_{1}, \text{T}_{2},$ and $\text{T}_{3}$ executing on a single processor, synchronized using three binary semaphore variables, $\t...
9.1k
views
asked
Feb 15, 2022
Operating System
gatecse-2022
operating-system
process-synchronization
semaphore
1-mark
+
–
19
votes
4
answers
281
GATE CSE 2022 | Question: 10
Consider the following two statements with respect to the matrices $\textit{A}_{m \times n}, \textit{B}_{n \times m}, \textit{C}_{n \times n}$ and $ \textit{D}_{n \times n}.$ Statement $1: tr \text{(AB)} = tr \text{(BA)}$ ... $2$ is correct. Both Statement $1$ and Statement $2$ are correct. Both Statement $1$ and Statement $2$ are wrong.
Consider the following two statements with respect to the matrices $\textit{A}_{m \times n}, \textit{B}_{n \times m}, \textit{C}_{n \times n}$ and $ \textit{D}_{n \times ...
10.9k
views
asked
Feb 15, 2022
Linear Algebra
gatecse-2022
linear-algebra
matrix
1-mark
+
–
12
votes
3
answers
282
GATE CSE 2022 | Question: 11
What is printed by the following $\text{ANSI C}$ program? #include<stdio.h> int main(int argc, char *argv[]) { int x = 1, z[2] = {10, 11}; int *p = NULL; p = &x; *p = 10; p = &z[1]; *(&z[0] + 1) += 3; printf(“%d, %d, %d\n”, x, z[0], z[1]); return 0; } $1, 10, 11$ $1, 10, 14$ $10, 14, 11$ $10, 10, 14$
What is printed by the following $\text{ANSI C}$ program?#include<stdio.h int main(int argc, char *argv[]) { int x = 1, z = {10, 11}; int *p = NULL; p = &x; *p = 10; p =...
5.8k
views
asked
Feb 15, 2022
Programming in C
gatecse-2022
programming
programming-in-c
pointers
output
1-mark
+
–
22
votes
3
answers
283
GATE CSE 2022 | Question: 12
Consider an enterprise network with two Ethernet segments, a web server and a firewall, connected via three routers as shown below. What is the number of subnets inside the enterprise network? $3$ $12$ $6$ $8$
Consider an enterprise network with two Ethernet segments, a web server and a firewall, connected via three routers as shown below.What is the number of subnets inside th...
14.5k
views
asked
Feb 15, 2022
Computer Networks
gatecse-2022
computer-networks
ethernet
1-mark
+
–
6
votes
2
answers
284
GATE CSE 2022 | Question: 13
Which of the following statements is/are $\text{TRUE}?$ Every subset of a recursively enumerable language is recursive. If a language $\textit{L}$ and its complement $\overline{\textit{L}}$ are both recursively enumerable, then $\textit{L}$ must be recursive. ... $\textit{L}_{1} \cap \textit{L}_{2}$ must be deterministic context-free.
Which of the following statements is/are $\text{TRUE}?$Every subset of a recursively enumerable language is recursive.If a language $\textit{L}$ and its complement $\over...
15.4k
views
asked
Feb 15, 2022
Theory of Computation
gatecse-2022
theory-of-computation
identify-class-language
recursive-and-recursively-enumerable-languages
multiple-selects
1-mark
+
–
21
votes
1
answer
285
GATE CSE 2022 | Question: 14
Let $\text{WB}$ and $\text{WT}$ be two set associative cache organizations that use $\text{LRU}$ algorithm for cache block replacement. $\text{WB}$ is a write back cache and $\text{WT}$ ... cache to main memory. A read miss in $\text{WB}$ will never lead to eviction of a dirty block from $\text{WB}.$
Let $\text{WB}$ and $\text{WT}$ be two set associative cache organizations that use $\text{LRU}$ algorithm for cache block replacement. $\text{WB}$ is a write back cache ...
7.8k
views
asked
Feb 15, 2022
CO and Architecture
gatecse-2022
co-and-architecture
cache-memory
multiple-selects
1-mark
+
–
15
votes
2
answers
286
GATE CSE 2022 | Question: 15
Consider the following three relations in a relational database. $\text{Employee} (\underline{\text{eId}},\text{Name}), \; \text{Brand}(\underline{\text{bId}},\text{bName}), \; \text{Own}(\underline{\text{eId}},\underline{\text{bId}})$ Which of the following relational ... $ \Pi_{eId} \left( (\Pi_{eId}(Own) \times \Pi_{bId} (Own)) / \Pi_{bId} (Brand) \right)$
Consider the following three relations in a relational database.$\text{Employee} (\underline{\text{eId}},\text{Name}), \; \text{Brand}(\underline{\text{bId}},\text{bName}...
8.5k
views
asked
Feb 15, 2022
Databases
gatecse-2022
databases
relational-algebra
multiple-selects
1-mark
+
–
12
votes
2
answers
287
GATE CSE 2022 | Question: 16
Which of the following statements is/are $\text{TRUE}$ with respect to deadlocks? Circular wait is a necessary condition for the formation of deadlock. In a system where each resource has more than one instance, a cycle in its wait-for graph ... the resource-allocation graph of a system, if every edge is an assignment edge, then the system is not in deadlock state.
Which of the following statements is/are $\text{TRUE}$ with respect to deadlocks?Circular wait is a necessary condition for the formation of deadlock.In a system where ea...
12.5k
views
asked
Feb 15, 2022
Operating System
gatecse-2022
operating-system
resource-allocation
multiple-selects
1-mark
+
–
14
votes
2
answers
288
GATE CSE 2022 | Question: 17
Which of the following statements is/are $\text{TRUE}$ for a group $\textit{G}?$ If for all $x,y \in \textit{G}, \; (xy)^{2} = x^{2} y^{2},$ then $\textit{G}$ is commutative. If for all $x \in \textit{G}, \; x^{2} = 1,$ then ... $2,$ then $\textit{G}$ is commutative. If $\textit{G}$ is commutative, then a subgroup of $\textit{G}$ need not be commutative.
Which of the following statements is/are $\text{TRUE}$ for a group $\textit{G}?$If for all $x,y \in \textit{G}, \; (xy)^{2} = x^{2} y^{2},$ then $\textit{G}$ is commutati...
7.6k
views
asked
Feb 15, 2022
Set Theory & Algebra
gatecse-2022
set-theory&algebra
group-theory
multiple-selects
1-mark
+
–
41
votes
3
answers
289
GATE CSE 2022 | Question: 18
Suppose a binary search tree with $1000$ distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming that the array indices start with $0,$ the $3^{\text{rd}}$ largest element of the tree is stored at index ______________ .
Suppose a binary search tree with $1000$ distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assumin...
15.3k
views
asked
Feb 15, 2022
DS
gatecse-2022
numerical-answers
data-structures
binary-search-tree
1-mark
+
–
6
votes
3
answers
290
GATE CSE 2022 | Question: 19
Consider the augmented grammar with $\{ +, {\ast}, (,),\text{id} \}$ as the set of terminals. $S' \rightarrow S$ $S \rightarrow S + R\; |\; R$ $R \rightarrow R {\ast} P \;| \;P$ $P \rightarrow (S)\; |\; \text{id} $ If $I_{0}$ is ... $\{ [S' \rightarrow S.], [S \rightarrow S. + R] \}$, then $\textit{goto(closure}(I_{0}), +)$ contains exactly ______________ items.
Consider the augmented grammar with $\{ +, {\ast}, (,),\text{id} \}$ as the set of terminals.$S’ \rightarrow S$$S \rightarrow S + R\; |\; R$$R \rightarrow R {\ast} P \;...
7.3k
views
asked
Feb 15, 2022
Compiler Design
gatecse-2022
numerical-answers
compiler-design
parsing
lr-parser
1-mark
+
–
Page:
« prev
1
...
9
10
11
12
13
14
15
16
17
18
19
...
96
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register