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
Recent questions tagged gatecse-2022
22
votes
1
answer
1
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})$
Arjun
asked
in
Algorithms
Feb 15, 2022
by
Arjun
8.1k
views
gatecse-2022
algorithms
asymptotic-notations
1-mark
24
votes
4
answers
2
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})$
Arjun
asked
in
Theory of Computation
Feb 15, 2022
by
Arjun
7.4k
views
gatecse-2022
theory-of-computation
finite-automata
regular-expression
1-mark
7
votes
1
answer
3
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.
Arjun
asked
in
Compiler Design
Feb 15, 2022
by
Arjun
3.5k
views
gatecse-2022
compiler-design
parsing
1-mark
8
votes
2
answers
4
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.
Arjun
asked
in
Databases
Feb 15, 2022
by
Arjun
3.8k
views
gatecse-2022
databases
database-normalization
1-mark
10
votes
3
answers
5
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.
Arjun
asked
in
DS
Feb 15, 2022
by
Arjun
4.2k
views
gatecse-2022
data-structures
linked-list
1-mark
12
votes
1
answer
6
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}$
Arjun
asked
in
Algorithms
Feb 15, 2022
by
Arjun
5.0k
views
gatecse-2022
algorithms
hashing
uniform-hashing
1-mark
6
votes
3
answers
7
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
Arjun
asked
in
CO and Architecture
Feb 15, 2022
by
Arjun
2.5k
views
gatecse-2022
co-and-architecture
dma
1-mark
6
votes
2
answers
8
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}$
Arjun
asked
in
Digital Logic
Feb 15, 2022
by
Arjun
3.9k
views
gatecse-2022
digital-logic
number-system
number-representation
1-mark
10
votes
3
answers
9
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$
Arjun
asked
in
Operating System
Feb 15, 2022
by
Arjun
5.1k
views
gatecse-2022
operating-system
process-synchronization
semaphore
1-mark
9
votes
2
answers
10
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.
Arjun
asked
in
Linear Algebra
Feb 15, 2022
by
Arjun
4.1k
views
gatecse-2022
linear-algebra
matrix
1-mark
7
votes
2
answers
11
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$
Arjun
asked
in
Programming
Feb 15, 2022
by
Arjun
2.6k
views
gatecse-2022
programming
programming-in-c
pointers
output
1-mark
11
votes
3
answers
12
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$
Arjun
asked
in
Computer Networks
Feb 15, 2022
by
Arjun
7.9k
views
gatecse-2022
computer-networks
ethernet
1-mark
4
votes
2
answers
13
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.
Arjun
asked
in
Theory of Computation
Feb 15, 2022
by
Arjun
6.9k
views
gatecse-2022
theory-of-computation
identify-class-language
recursive-and-recursively-enumerable-languages
multiple-selects
1-mark
12
votes
1
answer
14
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}.$
Arjun
asked
in
CO and Architecture
Feb 15, 2022
by
Arjun
3.6k
views
gatecse-2022
co-and-architecture
cache-memory
multiple-selects
1-mark
8
votes
2
answers
15
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)$
Arjun
asked
in
Databases
Feb 15, 2022
by
Arjun
3.5k
views
gatecse-2022
databases
relational-algebra
multiple-selects
1-mark
9
votes
2
answers
16
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.
Arjun
asked
in
Operating System
Feb 15, 2022
by
Arjun
5.3k
views
gatecse-2022
operating-system
resource-allocation
multiple-selects
1-mark
9
votes
2
answers
17
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.
Arjun
asked
in
Set Theory & Algebra
Feb 15, 2022
by
Arjun
3.6k
views
gatecse-2022
set-theory&algebra
group-theory
multiple-selects
1-mark
24
votes
3
answers
18
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 ______________ .
Arjun
asked
in
DS
Feb 15, 2022
by
Arjun
6.7k
views
gatecse-2022
numerical-answers
data-structures
binary-search-tree
1-mark
6
votes
3
answers
19
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.
Arjun
asked
in
Compiler Design
Feb 15, 2022
by
Arjun
3.2k
views
gatecse-2022
numerical-answers
compiler-design
parsing
lr-parser
1-mark
14
votes
5
answers
20
GATE CSE 2022 | Question: 20
Consider a simple undirected graph of $10$ vertices. If the graph is disconnected, then the maximum number of edges it can have is _______________ .
Arjun
asked
in
Graph Theory
Feb 15, 2022
by
Arjun
3.9k
views
gatecse-2022
numerical-answers
graph-theory
graph-connectivity
1-mark
9
votes
1
answer
21
GATE CSE 2022 | Question: 21
Consider a relation $R (A, B, C, D, E)$ with the following three functional dependencies. $AB \rightarrow C; \; BC \rightarrow D; \; C \rightarrow E;$ The number of superkeys in the relation $R$ is ______________ .
Arjun
asked
in
Databases
Feb 15, 2022
by
Arjun
2.3k
views
gatecse-2022
numerical-answers
databases
database-normalization
1-mark
10
votes
3
answers
22
GATE CSE 2022 | Question: 22
The number of arrangements of six identical balls in three identical bins is _____________ .
Arjun
asked
in
Combinatory
Feb 15, 2022
by
Arjun
4.7k
views
gatecse-2022
numerical-answers
combinatory
balls-in-bins
1-mark
7
votes
2
answers
23
GATE CSE 2022 | Question: 23
A cache memory that has a hit rate of $0.8$ has an access latency $10 \; \text{ns}$ and miss penalty $100 \; \text{ns}.$ An optimization is done on the cache to reduce the miss rate. However, the optimization results ... (rounded off to two decimal places) needed after the optimization such that it should not increase the average memory access time is _______________.
Arjun
asked
in
CO and Architecture
Feb 15, 2022
by
Arjun
4.2k
views
gatecse-2022
numerical-answers
co-and-architecture
cache-memory
1-mark
7
votes
4
answers
24
GATE CSE 2022 | Question: 24
The value of the following limit is ________________. $\lim_{x \rightarrow 0^{+}} \frac{\sqrt{x}}{1-e^{2\sqrt{x}}}$
Arjun
asked
in
Calculus
Feb 15, 2022
by
Arjun
2.6k
views
gatecse-2022
numerical-answers
calculus
limits
1-mark
13
votes
3
answers
25
GATE CSE 2022 | Question: 25
Consider the resolution of the domain name $\textsf{www.gate.org.in}$ by a $\text{DNS}$ resolver. Assume that no resource records are cached anywhere across the $\text{DNS}$ servers and that iterative query mechanism is used in the resolution. The number of $\text{DNS}$ query-response pairs involved in completely resolving the domain name is ________________.
Arjun
asked
in
Computer Networks
Feb 15, 2022
by
Arjun
5.6k
views
gatecse-2022
numerical-answers
computer-networks
1-mark
20
votes
5
answers
26
GATE CSE 2022 | Question: 26
Which one of the following is the closed form for the generating function of the sequence $\{ a_{n} \}_{n \geq 0}$ defined below? $ a_{n} = \left\{\begin{matrix} n + 1, & \text{n is odd} & \\ 1, & \text{otherwise} & \end{matrix}\right.$ ... $\frac{2x}{(1-x^{2})^{2}} + \frac{1}{1-x}$ $\frac{x}{(1-x^{2})^{2}} + \frac{1}{1-x}$
Arjun
asked
in
Combinatory
Feb 15, 2022
by
Arjun
4.2k
views
gatecse-2022
combinatory
generating-functions
2-marks
12
votes
2
answers
27
GATE CSE 2022 | Question: 27
Consider a simple undirected unweighted graph with at least three vertices. If $\textit{A}$ is the adjacency matrix of the graph, then the number of $3–$cycles in the graph is given by the trace of $\textit{A}^{3}$ $\textit{A}^{3}$ divided by $2$ $\textit{A}^{3}$ divided by $3$ $\textit{A}^{3}$ divided by $6$
Arjun
asked
in
Graph Theory
Feb 15, 2022
by
Arjun
3.4k
views
gatecse-2022
graph-theory
graph-connectivity
2-marks
13
votes
2
answers
28
GATE CSE 2022 | Question: 28
Which one of the following statements is $\text{FALSE}?$ The $\text{TLB}$ performs an associative search in parallel on all its valid entries using page number of incoming virtual address. If the virtual address of a word given by $\text{CPU}$ has a ... $\text{V2}$ map to the same value while hashing, then the memory access time of these addresses will not be the same.
Arjun
asked
in
Operating System
Feb 15, 2022
by
Arjun
3.7k
views
gatecse-2022
operating-system
memory-management
translation-lookaside-buffer
2-marks
4
votes
2
answers
29
GATE CSE 2022 | Question: 29
Let $\textit{R}_{i}(z)$ and $\textit{W}_{i}(z)$ denote read and write operations on a data element $z$ by a transaction $\textit{T}_{i},$ respectively. Consider the schedule $\textit{S}$ ... $T_{4} \rightarrow T_{1} \rightarrow T_{3} \rightarrow T_{2}$ $T_{3} \rightarrow T_{1} \rightarrow T_{4} \rightarrow T_{2}$
Arjun
asked
in
Databases
Feb 15, 2022
by
Arjun
3.3k
views
gatecse-2022
databases
transaction-and-concurrency
conflict-serializable
2-marks
8
votes
2
answers
30
GATE CSE 2022 | Question: 30
Consider a digital display system $\text{(DDS)}$ shown in the figure that displays the contents of register $\text{X}.$ A $16 - \text{bit}$ code word is used to load a word in $\text{X},$ either from $\text{S}$ or from $\text{R}.$ $\text{S}$ is a $1024-$ ... $1:10$ de-multiplexer$; \quad \; \;\text{Q}$ is $1:5$ de-multiplexer$; \quad \text{T}$ is $2:1$ multiplexer
Arjun
asked
in
Digital Logic
Feb 15, 2022
by
Arjun
2.3k
views
gatecse-2022
digital-logic
combinational-circuit
2-marks
Page:
1
2
3
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
Central Pollution Control Board CPCB Various Post Recruitment 2023
MP Rajya Sahkari Apex Bank Various Post Recruitment 2023
NITIE MUMBAI throgh GATE
PGCIL recruitment 2023 – Apply Online For 138 Posts through GATE
Admission guidance for GATE CSE 2023
Subjects
All categories
General Aptitude
(2.6k)
Engineering Mathematics
(9.4k)
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.7k)
Non GATE
(1.3k)
Others
(2.5k)
Admissions
(655)
Exam Queries
(848)
Tier 1 Placement Questions
(17)
Job Queries
(77)
Projects
(9)
Unknown Category
(866)
Recent questions tagged gatecse-2022
Recent Blog Comments
Please upload updated previous year question...
The last hardcopy that was made was for GATE 2022...
overall only 3 post .no post for gen male
for gen GS in the range of 720-750 approx.
can we get 2023 hark copy from amazon?