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
Answers by Arjun
6
votes
81
Personal doubt
People say that "we should have our basics clear and we should have conceptual clearity" in any particular topic, what is the meaning of "conceptual clearity"? What do topper mean when they say that you should have "conceptual clearity"?
People say that "we should have our basics clear and we should have conceptual clearity" in any particular topic, what is the meaning of "conceptual clearity"?What do top...
340
views
answered
Dec 11, 2021
0
votes
82
GATE CSE 2022
How To Prepare For GATE CSE 2022 APTITUTE, from scratch, please provide me suggestions.. I have downloaded the syllabus.
How To Prepare For GATE CSE 2022 APTITUTE, from scratch, please provide me suggestions.. I have downloaded the syllabus.
885
views
answered
Sep 11, 2021
0
votes
83
Marks Distribution for Engineering and Discrete Maths
Hey all, As per brochure there will be 13 marks alloted for engineering maths. My quer is whether discrete maths will too be included in this 13 marks i.e. EM+DM=13, or Discrete maths will have separate marks? Like in Gate 2021 paper , the combined marks for Engineering and Discrete maths was over 13.
Hey all,As per brochure there will be 13 marks alloted for engineering maths. My quer is whether discrete maths will too be included in this 13 marks i.e. EM+DM=13, or Di...
1.1k
views
answered
Sep 11, 2021
0
votes
84
all tests and quiz are paid or not
all test is paid or not
all test is paid or not
359
views
answered
Sep 9, 2021
21
votes
85
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
answered
Jun 13, 2021
Operating System
gatecse-2021-set1
multiple-selects
operating-system
page-replacement
1-mark
+
–
33
votes
86
GATE CSE 2021 Set 2 | Question: 14
Which of the following statement(s) is/are correct in the context of $\text{CPU}$ scheduling? Turnaround time includes waiting time The goal is to only maximize $\text{CPU}$ utilization and minimize throughput Round-robin policy ... $\text{CPU}$ time required by each of the processes is not known apriori Implementing preemptive scheduling needs hardware support
Which of the following statement(s) is/are correct in the context of $\text{CPU}$ scheduling?Turnaround time includes waiting timeThe goal is to only maximize $\text{CPU}...
10.7k
views
answered
Jun 13, 2021
Operating System
gatecse-2021-set2
multiple-selects
operating-system
process-scheduling
1-mark
+
–
17
votes
87
GATE CSE 2021 Set 2 | Question: 27
Assume a two-level inclusive cache hierarchy, $L1$ and $L2$, where $L2$ is the larger of the two. Consider the following statements. $S_1$: Read misses in a write through $L1$ cache do not result in writebacks of dirty lines to the $L2$ $S_2$: Write ... 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
Assume a two-level inclusive cache hierarchy, $L1$ and $L2$, where $L2$ is the larger of the two. Consider the following statements.$S_1$: Read misses i...
8.1k
views
answered
Jun 13, 2021
CO and Architecture
gatecse-2021-set2
co-and-architecture
cache-memory
2-marks
+
–
53
votes
88
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
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 ...
9.8k
views
answered
Jun 13, 2021
Operating System
gatecse-2021-set2
multiple-selects
operating-system
deadlock-prevention-avoidance-detection
2-marks
+
–
1
votes
89
GATE Overflow Analytical and Spatial Aptitude 1: 12
If $7\:\theta\: 13\: \alpha\: 3 = 60,$ and $12\:\theta\: 13\: \alpha\: 4 = 100,$ then $38\:\theta\: 39\: \alpha\: 3 =\:?$ $313$ $219$ $343$ $231$
If $7\:\theta\: 13\: \alpha\: 3 = 60,$ and $12\:\theta\: 13\: \alpha\: 4 = 100,$ then $38\:\theta\: 39\: \alpha\: 3 =\:?$$313$$219$$343$$231$
176
views
answered
Jun 12, 2021
Analytical Aptitude
go-analytical-and-spatial-aptitude-1
number-series
+
–
12
votes
90
GATE CSE 1989 | Question: 12a
The below figure shows a $B^+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted into the $B^+$ tree. Obtain the modified $B^+$ tree after insertion.
The below figure shows a $B^+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted...
8.4k
views
answered
Jun 12, 2021
Databases
descriptive
gate1989
databases
b-tree
+
–
12
votes
91
GATE CSE 2005 | Question: 29, UGCNET-June2015-III: 9
Which one of the following statements about normal forms is $\text{FALSE}?$ $\text{BCNF}$ is stricter than $\text{3NF}$ Lossless, dependency-preserving decomposition into $\text{3NF}$ is always possible Lossless, dependency-preserving decomposition into $\text{BCNF}$ is always possible Any relation with two attributes is in $\text{BCNF}$
Which one of the following statements about normal forms is $\text{FALSE}?$$\text{BCNF}$ is stricter than $\text{3NF}$Lossless, dependency-preserving decomposition into $...
17.0k
views
answered
Jun 11, 2021
Databases
gatecse-2005
databases
database-normalization
easy
ugcnetcse-june2015-paper3
+
–
4
votes
92
GATE CSE 2008 | Question: 77
Delayed branching can help in the handling of control hazards The following code is to run on a pipelined processor with one branch delay slot: I1: ADD $R2 \leftarrow R7 + R8$ I2: Sub $R4 \leftarrow R5 – R6$ ... Which of the instructions I1, I2, I3 or I4 can legitimately occupy the delay slot without any program modification? I1 I2 I3 I4
Delayed branching can help in the handling of control hazardsThe following code is to run on a pipelined processor with one branch delay slot:I1: ADD $R2 \leftarrow R7 + ...
15.4k
views
answered
Jun 4, 2021
CO and Architecture
gatecse-2008
co-and-architecture
pipelining
normal
+
–
21
votes
93
GATE CSE 2021 Set 1 | Question: 39
For a Turing machine $M$, $\langle M \rangle$ denotes an encoding of $M$ ... decidable $L_1$ is decidable and $L_2$ is undecidable $L_1$ is undecidable and $L_2$ is decidable Both $L_1$ and $L_2$ are undecidable
For a Turing machine $M$, $\langle M \rangle$ denotes an encoding of $M$. Consider the following two languages.$$\begin{array}{ll} L_1 = \{ \langle M \rangle \mid M \text...
10.0k
views
answered
May 31, 2021
Theory of Computation
gatecse-2021-set1
theory-of-computation
recursive-and-recursively-enumerable-languages
decidability
easy
2-marks
+
–
23
votes
94
GATE CSE 2020 | Question: 26
Which of the following languages are undecidable? Note that $\left \langle M \right \rangle$ indicates encoding of the Turing machine M. $L_1 = \{\left \langle M \right \rangle \mid L(M) = \varnothing \}$ ... $L_1$, $L_3$, and $L_4$ only $L_1$ and $L_3$ only $L_2$ and $L_3$ only $L_2$, $L_3$, and $L_4$ only
Which of the following languages are undecidable? Note that $\left \langle M \right \rangle$ indicates encoding of the Turing machine M.$L_1 = \{\left \langle M \right \r...
14.6k
views
answered
May 31, 2021
Theory of Computation
gatecse-2020
theory-of-computation
decidability
2-marks
+
–
13
votes
95
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$)}$
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)$ : t...
6.8k
views
answered
May 30, 2021
Compiler Design
gatecse-2021-set2
code-optimization
live-variable-analysis
compiler-design
2-marks
+
–
18
votes
96
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
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, *...
9.7k
views
answered
May 30, 2021
Programming in C
gatecse-2021-set2
programming-in-c
normal
pointers
structure
2-marks
+
–
21
votes
97
GATE CSE 2016 Set 1 | Question: 10
A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ($n$ refers to the number of items in the queue) ? Both operations can be performed in $O(1)$ ... both operations will be $\Omega (n)$. Worst case time complexity for both operations will be $\Omega (\log n)$
A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ($n$ refers to ...
23.5k
views
answered
May 15, 2021
DS
gatecse-2016-set1
data-structures
queue
normal
+
–
21
votes
98
GATE CSE 1999 | Question: 2.5
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if-then-else forward go to arbitrary go to non-recursive procedure call recursive procedure/function call repeat loop, which constructs will you not include in a programming language ... $\text{(vi), (vii), (viii)}$ $\text{(iii), (vii), (viii)}$
Given the programming constructsassignmentfor loops where the loop parameter cannot be changed within the loopif-then-elseforward go toarbitrary go tonon-recursive proced...
12.7k
views
answered
May 14, 2021
Programming in C
gate1999
programming
normal
programming-constructs
+
–
14
votes
99
GATE CSE 1988 | Question: 2xa
State any undesirable characteristic of the following criteria for measuring performance of an operating system: Turn around time
State any undesirable characteristic of the following criteria for measuring performance of an operating system:Turn around time
4.4k
views
answered
May 4, 2021
Operating System
gate1988
normal
descriptive
operating-system
process-scheduling
+
–
7
votes
100
GATE CSE 1988 | Question: 2xb
State any undesirable characteristic of the following criteria for measuring performance of an operating system: Waiting time
State any undesirable characteristic of the following criteria for measuring performance of an operating system:Waiting time
2.9k
views
answered
May 4, 2021
Operating System
gate1988
normal
descriptive
operating-system
process-scheduling
+
–
Page:
« prev
1
2
3
4
5
6
7
8
...
70
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
