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
Recent activity by anmol_
2
answers
1
GATE Overflow Test Series | Mock GATE | Test 2 | Question: 48
A binary search tree is a binary tree with the further property that, for every node, The value of the element in the left child is less than the value of the element at the node. The value of the element in the right child ... nodes. If $p$ is the probability that this BST is also an Unrestricted Max-heap, the value of $7p = $________
A binary search tree is a binary tree with the further property that, for every node,The value of the element in the left child is less than the value of the element at t...
670
views
commented
Jan 6, 2022
DS
go2025-mockgate-2
numerical-answers
binary-search-tree
heaps
+
–
1
answer
2
GATE Overflow Test Series | Mock GATE | Test 2 | Question: 34
What does the following function do? int Dosomething(int n) { int ceil = sqrt(n); int j; for(j=ceil;j>1;j--) { if(n%j==0 && j<=n) return 1; } return 0; } Return $1$ whenever $n$ is a prime number Return $0$ whenever $n$ is a prime number Return $0$ whenever $n$ is a composite number None of the above
What does the following function do?int Dosomething(int n) { int ceil = sqrt(n); int j; for(j=ceil;j>1;j ) { if(n%j==0 && j<=n) return 1; } return 0; }Return $1$ whenever...
259
views
commented
Jan 6, 2022
Programming in C
go2025-mockgate-2
output
+
–
5
answers
3
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.9k
views
commented
Jan 5, 2022
Theory of Computation
gatecse-2021-set1
theory-of-computation
recursive-and-recursively-enumerable-languages
decidability
easy
2-marks
+
–
1
answer
4
GATE Overflow Test Series | Mock GATE | Test 1 | Question: 56
Consider the expression $a + -b*c +d/e.$ The minimum number of temporary variables required to create a three-address code for this expression in Static Single Assignment form is ____________
Consider the expression $a + -b*c +d/e.$ The minimum number of temporary variables required to create a three-address code for this expression in Static Single Assignment...
821
views
commented
Dec 31, 2021
Compiler Design
go2025-mockgate-1
numerical-answers
intermediate-code
static-single-assignment
compiler-design
+
–
1
answer
5
GATE Overflow Test Series | Databases | Test 1 | Question: 10
Consider the following relation $R$ $\textbf{R}$ ... The output of the following query will be _____ select count(*) + count(A) + count(B) from R
Consider the following relation $R$$$\textbf{R}$$$$\begin{array}{|c|c|c|c|c|c|c|}\hline\textbf{A} & \textbf{B} \\\hline1 & \text{NULL} \\\hline1 & \text{NULL} \\\hline\te...
368
views
commented
Dec 21, 2021
Databases
go2025-dbms-1
numerical-answers
sql
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register