Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
rsonx
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by rsonx
0
answers
1
What are my options?
GATE 2022 Score: 662, Rank: 841, General Category, Computer Science. What should I expect for?
GATE 2022 Score: 662,Rank: 841, General Category, Computer Science.What should I expect for?
352
views
asked
Mar 18, 2022
Written Exam
admission
cutoffs
iit
getting-to-iits
+
–
2
answers
2
GATE CSE 2022 | GA Question: 8
A box contains five balls of same size and shape. Three of them are green coloured balls and two of them are orange coloured balls. Balls are drawn from the box one at a time. If a green ball is drawn, it is not replaced. If an orange ball is drawn, it is replaced with ... an orange ball in the next draw? $\frac{1}{2}$ $\frac{8}{25}$ $\frac{19}{50}$ $\frac{23}{50}$
A box contains five balls of same size and shape. Three of them are green coloured balls and two of them are orange coloured balls. Balls are drawn from the box one at a ...
9.6k
views
commented
Feb 24, 2022
Quantitative Aptitude
gatecse-2022
quantitative-aptitude
probability
2-marks
+
–
0
answers
3
GATE 2022
A box contains five balls of same size and shape. Three of them are green coloured balls and two of them are orange coloured balls. Balls are drawn from the box one at a time. If a green ball is drawn, it is not replaced. If an orange ball is drawn, it is replaced with another orange ... of getting an orange ball in the next draw? $\frac{1}2$ $\frac{19}{50}$ $\frac{23}{50}$ $\frac{8}{25}$
A box contains five balls of same size and shape. Three of them are green coloured balls and two of them are orange coloured balls. Balls are drawn from the box one at a ...
667
views
retagged
Feb 24, 2022
Analytical Aptitude
probability
analytical-aptitude
+
–
1
answer
4
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}$
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 meta...
8.3k
views
commented
Feb 3, 2022
Operating System
gatecse-2021-set1
multiple-selects
operating-system
file-system
1-mark
+
–
2
answers
5
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.4k
views
commented
Feb 3, 2022
Operating System
gatecse-2021-set2
multiple-selects
operating-system
process-scheduling
1-mark
+
–
5
answers
6
GATE CSE 2019 | Question: 48
Let $\Sigma$ be the set of all bijections from $\{1, \dots , 5\}$ to $\{1, \dots , 5 \}$, where $id$ denotes the identity function, i.e. $id(j)=j, \forall j$. Let $\circ$ ... Consider the language $L=\{x \in \Sigma^* \mid \pi (x) =id\}$. The minimum number of states in any DFA accepting $L$ is _______
Let $\Sigma$ be the set of all bijections from $\{1, \dots , 5\}$ to $\{1, \dots , 5 \}$, where $id$ denotes the identity function, i.e. $id(j)=j, \forall j$. Let $\circ$...
20.1k
views
commented
Jan 30, 2022
Theory of Computation
gatecse-2019
numerical-answers
theory-of-computation
finite-automata
minimal-state-automata
difficult
2-marks
+
–
12
answers
7
GATE CSE 2003 | Question: 61
In a permutation \(a_1 ... a_n\), of n distinct integers, an inversion is a pair \((a_i, a_j)\) such that \(i < j\) and \(a_i > a_j\). If all permutations are equally likely, what is the expected number of inversions in a randomly chosen permutation of \(1. . . n\)? \(\frac{n(n-1)}{2}\) \(\frac{n(n-1)}{4}\) \(\frac{n(n+1)}{4}\) \(2n[\log_2n]\)
In a permutation \(a_1 ... a_n\), of n distinct integers, an inversion is a pair \((a_i, a_j)\) such that \(i < j\) and \(a_i a_j\).If all permutations are equally likel...
20.6k
views
commented
Jun 14, 2021
Algorithms
gatecse-2003
algorithms
sorting
inversion
normal
+
–
8
answers
8
GATE CSE 2014 Set 2 | Question: 50
Consider the following relation on subsets of the set $S$ of integers between $1$ and $2014$. For two distinct subsets $U$ and $V$ of $S$ we say $U\:<\:V$ if the minimum element in the symmetric difference of the two sets is in $U$. Consider the ... $S1$ is true and $S2$ is false $S2$ is true and $S1$ is false Neither $S1$ nor $S2$ is true
Consider the following relation on subsets of the set $S$ of integers between $1$ and $2014$. For two distinct subsets $U$ and $V$ of $S$ we say $U\:<\:V$ if the minimum ...
15.6k
views
commented
Jan 11, 2021
Set Theory & Algebra
gatecse-2014-set2
set-theory&algebra
normal
set-theory
+
–
5
answers
9
GATE CSE 2015 Set 2 | Question: 55
Which one of the following well-formed formulae is a tautology? $\forall x \, \exists y \, R(x,y) \, \leftrightarrow \, \exists y \, \forall x \, R(x, y)$ ... $\forall x \, \forall y \, P(x,y) \, \rightarrow \, \forall x \, \forall y \, P(y, x)$
Which one of the following well-formed formulae is a tautology? $\forall x \, \exists y \, R(x,y) \, \leftrightarrow \, \exists y \, \forall x \, R(x, y)$$( \forall x \,...
20.6k
views
commented
Jan 10, 2021
Mathematical Logic
gatecse-2015-set2
mathematical-logic
normal
first-order-logic
+
–
7
answers
10
GATE CSE 2014 Set 3 | Question: 11
The minimum number of arithmetic operations required to evaluate the polynomial $P(X) = X^5+4X^3+6X+5$ for a given value of $X$, using only one temporary variable is ______.
The minimum number of arithmetic operations required to evaluate the polynomial $P(X) = X^5+4X^3+6X+5$ for a given value of $X$, using only one temporary variable is ____...
19.1k
views
answered
Jan 8, 2021
Compiler Design
gatecse-2014-set3
compiler-design
numerical-answers
normal
code-optimization
+
–
8
answers
11
GATE CSE 2010 | Question: 48
A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cache is $16$ words. The memory access times are $2$ ... $L1$ cache. What is the time taken for this transfer? $2$ nanoseconds $20$ nanoseconds $22$ nanoseconds $88$ nanoseconds
A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cac...
41.1k
views
answered
Jan 10, 2019
CO and Architecture
gatecse-2010
co-and-architecture
cache-memory
normal
barc2017
+
–
1
answer
12
How to represent First order statements in plain English?
\neg \forall x \neg F(x) in English could we write this as Not for all x F(x) holds or as Not for all x F(x) holds is false.
\neg \forall x \neg F(x) in English could we write thisas Not for all x F(x) holdsor as Not for all x F(x) holds is false.
251
views
asked
Jul 22, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register