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 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)$
commented
in
Probability
Jan 7
478
views
go2019-flt
engineering-mathematics
conditional-probability
probability
5
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 ____.
commented
in
Set Theory & Algebra
Dec 16, 2021
11.8k
views
gatecse-2014-set3
set-theory&algebra
group-theory
numerical-answers
normal
6
answers
3
GATE CSE 2003 | Question: 72
The following resolution rule is used in logic programming. Derive clause $(P \vee Q)$ from clauses $(P\vee R),(Q \vee ¬R)$ Which of the following statements related to this rule is FALSE? $((P ∨ R)∧(Q ∨ ¬R))⇒(P ∨ Q)$ ... if $(P ∨ R)∧(Q ∨ ¬R)$ is satisfiable $(P ∨ Q)⇒ \text{FALSE}$ if and only if both $P$ and $Q$ are unsatisfiable
commented
in
Mathematical Logic
Dec 2, 2021
9.4k
views
gatecse-2003
mathematical-logic
normal
propositional-logic
5
answers
4
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})$
commented
in
Algorithms
Nov 10, 2021
13.6k
views
gatecse-2021-set1
algorithms
recurrence-relation
time-complexity
2-marks
3
answers
5
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
commented
in
Compiler Design
Sep 13, 2021
3.2k
views
gatecse-2021-set1
runtime-environment
normal
1-mark
2
answers
6
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
commented
in
CO and Architecture
Sep 10, 2021
4.0k
views
gatecse-2021-set2
co-and-architecture
cache-memory
2-marks
5
answers
7
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
commented
in
Theory of Computation
Aug 10, 2021
4.7k
views
gatecse-2021-set1
theory-of-computation
recursive-and-recursively-enumerable-languages
decidability
easy
2-marks
6
answers
8
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)^*$
commented
in
Theory of Computation
Dec 21, 2020
31.7k
views
gate1997
theory-of-computation
regular-expression
normal
5
answers
9
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 ____
commented
in
CO and Architecture
Nov 21, 2020
21.7k
views
gatecse-2014-set2
co-and-architecture
cache-memory
numerical-answers
normal
3
answers
10
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$
commented
in
CO and Architecture
Nov 19, 2020
14.0k
views
gateit-2006
co-and-architecture
addressing-modes
normal
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent Blog Comments
Tests have been sent and all tests will be...
@GO Classes @Deepak Poonia @Sachin...
@GO Classes @Deepak Poonia sir...
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....