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
16
votes
4
answers
141
GATE CSE 2021 Set 2 | Question: 29
In an examination, a student can choose the order in which two questions ($\textsf{QuesA}$ and $\textsf{QuesB}$) must be attempted. If the first question is answered wrong, the student gets zero marks. If the first question is answered correctly and the ... $22$. First $\textsf{QuesA}$ and then $\textsf{QuesB}$. Expected marks $16$.
asked
in
Probability
Feb 18, 2021
4.1k
views
gatecse-2021-set2
probability
expectation
2-marks
13
votes
2
answers
142
GATE CSE 2021 Set 2 | Question: 30
Consider the following $\text{ANSI C}$ code segment: z=x + 3 + y->f1 + y->f2; for (i = 0; i < 200; i = i + 2) { if (z > i) { p = p + x + 3; q = q + y->f1; } else { p = p + y->f2; q = q + x + 3; } ... $\textsf{y ->f2}$) in the optimized code, respectively, are: $403$ and $102$ $203$ and $2$ $303$ and $102$ $303$ and $2$
asked
in
Compiler Design
Feb 18, 2021
5.5k
views
gatecse-2021-set2
code-optimization
compiler-design
2-marks
12
votes
2
answers
143
GATE CSE 2021 Set 2 | Question: 31
The relation scheme given below is used to store information about the employees of a company, where $\textsf{empId}$ is the key and $\textsf{deptId}$ indicates the department to which the employee is assigned. Each employee ... average salary of employees in the department employees in the company female employees in the department female employees in the company
asked
in
Databases
Feb 18, 2021
3.0k
views
gatecse-2021-set2
databases
sql
easy
2-marks
7
votes
2
answers
144
GATE CSE 2021 Set 2 | Question: 32
Let $S$ be the following schedule of operations of three transactions $T_1$, $T_2$ and $T_3$ in a relational database system: $R_2(Y), R_1(X), R_3(Z), R_1(Y)W_1(X), R_2(Z), W_2(Y), R_3(X), W_3(Z)$ Consider the statements $P$ and $Q$ below: $P$ ... Both $P$ and $Q$ are true $P$ is true and $Q$ is false $P$ is false and $Q$ is true Both $P$ and $Q$ are false
asked
in
Databases
Feb 18, 2021
4.0k
views
gatecse-2021-set2
databases
transaction-and-concurrency
conflict-serializable
2-marks
27
votes
4
answers
145
GATE CSE 2021 Set 2 | Question: 33
A bag has $r$ red balls and $b$ black balls. All balls are identical except for their colours. In a trial, a ball is randomly drawn from the bag, its colour is noted and the ball is placed back into the bag along with another ball of the same colour. Note that the number of ...
asked
in
Probability
Feb 18, 2021
6.4k
views
gatecse-2021-set2
probability
normal
2-marks
6
votes
2
answers
146
GATE CSE 2021 Set 2 | Question: 34
Consider the cyclic redundancy check $\text{(CRC)}$ based error detecting scheme having the generator polynomial $X^3+X+1$. Suppose the message $m_4m_3m_2m_1m_0=11000$ is to be transmitted. Check bits $c_2c_1c_0$ are appended at the end of the ... is denoted by $m_4m_3m_2m_1m_0c_2c_1c_0$. The value of the checkbit sequence $c_2c_1c_0$ is $101$ $110$ $100$ $111$
asked
in
Computer Networks
Feb 18, 2021
3.6k
views
gatecse-2021-set2
computer-networks
crc-polynomial
2-marks
10
votes
2
answers
147
GATE CSE 2021 Set 2 | Question: 35
Consider the following $\text{ANSI C}$ program: #include <stdio.h> #include <stdlib.h> struct Node{ int value; struct Node *next;}; int main( ) { struct Node *boxE, *head, *boxN; int index=0; boxE=head= (struct ... which will be reported as an error by the compiler It dereferences an uninitialized pointer that may result in a run-time error
asked
in
Programming
Feb 18, 2021
5.9k
views
gatecse-2021-set2
programming-in-c
normal
pointers
structure
2-marks
24
votes
1
answer
148
GATE CSE 2021 Set 2 | Question: 36
Consider the following two statements about regular languages: $S_1$: Every infinite regular language contains an undecidable language as a subset. $S_2$: Every finite language is regular. Which one of the following choices is correct? Only $S_1$ is true Only $S_2$ is true Both $S_1$ and $S_2$ are true Neither $S_1$ nor $S_2$ is true
asked
in
Theory of Computation
Feb 18, 2021
7.1k
views
gatecse-2021-set2
theory-of-computation
regular-language
decidability
2-marks
17
votes
1
answer
149
GATE CSE 2021 Set 2 | Question: 37
For two $n$-dimensional real vectors $P$ and $Q$, the operation $s(P,Q)$ is defined as follows: $s(P,Q) = \displaystyle \sum_{i=1}^n (P[i] \cdot Q[i])$ Let $\mathcal{L}$ be a set of $10$-dimensional non-zero real vectors such that for every pair ... $s(P,Q)=0$. What is the maximum cardinality possible for the set $\mathcal{L}$? $9$ $10$ $11$ $100$
asked
in
Set Theory & Algebra
Feb 18, 2021
4.2k
views
gatecse-2021-set2
set-theory&algebra
set-theory
2-marks
11
votes
4
answers
150
GATE CSE 2021 Set 2 | Question: 38
For a statement $S$ in a program, in the context of liveness analysis, the following sets are defined: $\text{USE}(S)$ : the set of variables used in $S$ $\text{IN}(S)$ : the set of variables that are live at the entry of $S$ $\text{OUT}(S)$ : the set of variables ... S_2$) }\cup \text{ OUT ($S_2$)}$ $\text{OUT ($S_1$)} = \text{USE ($S_1$)} \cup \text{IN ($S_2$)}$
asked
in
Compiler Design
Feb 18, 2021
3.9k
views
gatecse-2021-set2
code-optimization
compiler-design
2-marks
14
votes
3
answers
151
GATE CSE 2021 Set 2 | Question: 39
For constants $a \geq 1$ and $b>1$, consider the following recurrence defined on the non-negative integers: $T(n) = a \cdot T \left(\dfrac{n}{b} \right) + f(n)$ Which one of the following options is correct about the recurrence $T(n)$? If $f(n)$ is $n \log_2(n)$, ... $f(n)$ is $\Theta(n^{\log_b(a)})$, then $T(n)$ is $\Theta(n^{\log_b(a)})$
asked
in
Algorithms
Feb 18, 2021
4.8k
views
gatecse-2021-set2
algorithms
recurrence-relation
2-marks
11
votes
2
answers
152
GATE CSE 2021 Set 2 | Question: 40
Suppose the following functional dependencies hold on a relation $U$ with attributes $P,Q,R,S$, and $T$: $P \rightarrow QR$ $RS \rightarrow T$ Which of the following functional dependencies can be inferred from the above functional dependencies? $PS \rightarrow T$ $R \rightarrow T$ $P \rightarrow R$ $PS \rightarrow Q$
asked
in
Databases
Feb 18, 2021
3.8k
views
gatecse-2021-set2
multiple-selects
databases
database-normalization
2-marks
18
votes
2
answers
153
GATE CSE 2021 Set 2 | Question: 41
For a string $w$, we define $w^R$ to be the reverse of $w$. For example, if $w=01101$ then $w^R=10110$. Which of the following languages is/are context-free? $\{ wxw^Rx^R \mid w,x \in \{0,1\} ^* \}$ $\{ ww^Rxx^R \mid w,x \in \{0,1\} ^* \}$ $\{ wxw^R \mid w,x \in \{0,1\} ^* \}$ $\{ wxx^Rw^R \mid w,x \in \{0,1\} ^* \}$
asked
in
Theory of Computation
Feb 18, 2021
4.1k
views
gatecse-2021-set2
multiple-selects
theory-of-computation
context-free-language
2-marks
13
votes
4
answers
154
GATE CSE 2021 Set 2 | Question: 42
Consider the following multi-threaded code segment (in a mix of C and pseudo-code), invoked by two processes $P_1$ and $P_2$, and each of the processes spawns two threads $T_1$ and $T_2$: int x = 0; // global Lock L1; // global main () { create a ... the value of $y$ as $2.$ Both $T_1$ and $T_2$, in both the processes, will print the value of $y$ as $1.$
asked
in
Operating System
Feb 18, 2021
5.7k
views
gatecse-2021-set2
multiple-selects
operating-system
threads
2-marks
22
votes
2
answers
155
GATE CSE 2021 Set 2 | Question: 43
Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can be owned by only one process at a time. Owning and freeing of resources are done by holding a global lock $(L)$. ... not occur The scheme may lead to live-lock The scheme may lead to starvation The scheme violates the mutual exclusion property
asked
in
Operating System
Feb 18, 2021
5.5k
views
gatecse-2021-set2
multiple-selects
operating-system
deadlock-prevention-avoidance-detection
2-marks
23
votes
6
answers
156
GATE CSE 2021 Set 2 | Question: 44
If the numerical value of a $2$-byte unsigned integer on a little endian computer is $255$ more than that on a big endian computer, which of the following choices represent(s) the unsigned integer on a little endian computer? $0\text{x}6665$ $0\text{x} 0001$ $0\text{x} 4243$ $0\text{x} 0100$
asked
in
Digital Logic
Feb 18, 2021
9.2k
views
gatecse-2021-set2
multiple-selects
digital-logic
number-representation
little-endian-big-endian
2-marks
9
votes
1
answer
157
GATE CSE 2021 Set 2 | Question: 45
Consider a computer network using the distance vector routing algorithm in its network layer. The partial topology of the network is shown below. The objective is to find the shortest-cost path from the router $R$ to routers $P$ and $Q$. Assume that $R$ does not initially ... a packet from $R$ to $P$ is $Y$ The next hop router for a packet from $R$ to $Q$ is $Z$
asked
in
Computer Networks
Feb 18, 2021
2.9k
views
gatecse-2021-set2
multiple-selects
computer-networks
distance-vector-routing
2-marks
11
votes
2
answers
158
GATE CSE 2021 Set 2 | Question: 46
Consider the following directed graph: Which of the following is/are correct about the graph? The graph does not have a topological order A depth-first traversal starting at vertex $S$ classifies three directed edges as back edges The graph does not have a strongly connected component For each pair of vertices $u$ and $v$, there is a directed path from $u$ to $v$
asked
in
Algorithms
Feb 18, 2021
5.1k
views
gatecse-2021-set2
multiple-selects
algorithms
graph-algorithms
2-marks
19
votes
5
answers
159
GATE CSE 2021 Set 2 | Question: 47
Which of the following regular expressions represent(s) the set of all binary numbers that are divisible by three? Assume that the string $\epsilon$ is divisible by three. $(0+1(01^*0)^*1)^*$ $(0+11+10(1+00)^*01)^*$ $(0^*(1(01^*0)^*1)^*)^*$ $(0+11+11(1+00)^*00)^*$
asked
in
Theory of Computation
Feb 18, 2021
6.6k
views
gatecse-2021-set2
multiple-selects
theory-of-computation
regular-expression
2-marks
35
votes
4
answers
160
GATE CSE 2021 Set 2 | Question: 48
Consider a three-level page table to translate a $39-$bit virtual address to a physical address as shown below: The page size is $\text{4 KB} \;(1\text{KB}=2^{10}$ bytes$)$ and page table entry size at every level is $8$ bytes. A ... $P$ across all levels is _________ $\text{KB}$.
asked
in
Operating System
Feb 18, 2021
17.0k
views
gatecse-2021-set2
numerical-answers
operating-system
memory-management
page-replacement
2-marks
Page:
« prev
1
...
3
4
5
6
7
8
9
10
11
12
13
...
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...