Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
KineticKarm
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by KineticKarm
1
answer
1
GATE Overflow | Mock GATE | Test 1 | Question: 42
An urn contains $m$ WHITE and $n$ BLACK balls. A ball is drawn at random and is put back into the urn along with $k$ additional balls of the same color as that of the ball drawn. If now a ball is drawn, the probability that it is WHITE is? $(m+k)/(m+n+k)$ $(n+k)/(m+n+k)$ $m/(m+n+k)$ $m/(m+n)$
An urn contains $m$ WHITE and $n$ BLACK balls. A ball is drawn at random and is put back into the urn along with $k$ additional balls of the same color as that of the bal...
683
views
commented
Jan 7, 2022
Probability
go2019-flt
engineering-mathematics
conditional-probability
probability
+
–
6
answers
2
GATE CSE 2014 Set 3 | Question: 50
There are two elements $x,\:y$ in a group $(G,*)$ such that every element in the group can be written as a product of some number of $x$'s and $y$'s in some order. It is known that $x*x=y*y=x*y*x*y=y*x*y*x=e$ where $e$ is the identity element. The maximum number of elements in such a group is ____.
There are two elements $x,\:y$ in a group $(G,*)$ such that every element in the group can be written as a product of some number of $x$'s and $y$'s in some order. It is ...
15.4k
views
commented
Dec 16, 2021
Set Theory & Algebra
gatecse-2014-set3
set-theory&algebra
group-theory
numerical-answers
normal
+
–
7
answers
3
GATE CSE 2021 Set 1 | Question: 30
Consider the following recurrence relation. $T\left ( n \right )=\left\{\begin{array} {lcl} T(n ∕ 2)+T(2n∕5)+7n & \text{if} \; n>0\\1 & \text{if}\; n=0 \end{array}\right.$ Which one of the following options is correct? $T(n)=\Theta (n^{5/2})$ $T(n)=\Theta (n\log n)$ $T(n)=\Theta (n)$ $T(n)=\Theta ((\log n)^{5/2})$
Consider the following recurrence relation.$$T\left ( n \right )=\left\{\begin{array} {lcl} T(n ∕ 2)+T(2n∕5)+7n & \text{if} \; n>0\\1 & \text{if}\; n=0 \end{array}\r...
23.4k
views
commented
Nov 10, 2021
Algorithms
gatecse-2021-set1
algorithms
recurrence-relation
time-complexity
2-marks
+
–
3
answers
4
GATE CSE 2021 Set 1 | Question: 4
Consider the following statements. $S_1:$ The sequence of procedure calls corresponds to a preorder traversal of the activation tree. $S_2:$ The sequence of procedure returns corresponds to a postorder traversal of the activation tree. Which one of the following options is ... and $S_2$ is true $S_1$ is true and $S_2$ is true $S_1$ is false and $S_2$ is false
Consider the following statements.$S_1:$ The sequence of procedure calls corresponds to a preorder traversal of the activation tree.$S_2:$ The sequence of procedure retur...
6.5k
views
commented
Sep 13, 2021
Compiler Design
gatecse-2021-set1
runtime-environment
normal
1-mark
+
–
2
answers
5
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.0k
views
commented
Sep 10, 2021
CO and Architecture
gatecse-2021-set2
co-and-architecture
cache-memory
2-marks
+
–
5
answers
6
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...
9.8k
views
commented
Aug 9, 2021
Theory of Computation
gatecse-2021-set1
theory-of-computation
recursive-and-recursively-enumerable-languages
decidability
easy
2-marks
+
–
8
answers
7
GATE CSE 1997 | Question: 6.4
Which one of the following regular expressions over $\{0,1\}$ denotes the set of all strings not containing $\text{100}$ as substring? $0^*(1+0)^*$ $0^*1010^*$ $0^*1^*01^*$ $0^*(10+1)^*$
Which one of the following regular expressions over $\{0,1\}$ denotes the set of all strings not containing $\text{100}$ as substring?$0^*(1+0)^*$$0^*1010^*$$0^*1^*01^*$$...
37.2k
views
commented
Dec 21, 2020
Theory of Computation
gate1997
theory-of-computation
regular-expression
normal
+
–
5
answers
8
GATE CSE 2014 Set 2 | Question: 9
A $4$-way set-associative cache memory unit with a capacity of $16$ KB is built using a block size of $8$ words. The word length is $32$ bits. The size of the physical address space is $4$ GB. The number of bits for the TAG field is ____
A $4$-way set-associative cache memory unit with a capacity of $16$ KB is built using a block size of $8$ words. The word length is $32$ bits. The size of the physical ad...
25.7k
views
commented
Nov 21, 2020
CO and Architecture
gatecse-2014-set2
co-and-architecture
cache-memory
numerical-answers
normal
+
–
3
answers
9
GATE IT 2006 | Question: 40
The memory locations $1000,1001$ and $1020$ have data values $18,1$ and $16$ ... value $20$ Memory location $1020$ has value $20$ Memory location $1021$ has value $20$ Memory location $1001$ has value $20$
The memory locations $1000,1001$ and $1020$ have data values $18,1$ and $16$ respectively before the following program is executed.$$\begin{array}{ll} \text{MOVI} & \text...
17.1k
views
commented
Nov 19, 2020
CO and Architecture
gateit-2006
co-and-architecture
addressing-modes
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register