Recent questions tagged numerical-answers / GATE Overflow for GATE CSE

6 votes

4 answers

751

GO Classes 2023 | Weekly Quiz 4 | Question: 10
int find(int n) { int i, j, k, a = 1; for (i = 1; i <= n; i++) for (j = 1; j <= i; j++) for (k = 1; k <= j; k++) a = a + 1; return a; } What will be the value of find$(10)$?

int find(int n) { int i, j, k, a = 1; for (i = 1; i <= n; i++) for (j = 1; j <= i; j++) for (k = 1; k <= j; k++) a = a + 1; return a; }What will be the value of find$(10)...

GO Classes

724 views

GO Classes asked Mar 26, 2022

2 votes

3 answers

752

GO Classes 2023 | Weekly Quiz 4 | Question: 17
How many times is foo activated (called), including the first "$\text{foo}(3,12)$" $\text{max()}$ and $\text{min()}$ are functions that return maximum and minimum respectively. int foo(int a, int b) { if (a==b) { return b; } int mn =min(a,b), mx =max(a,b); return foo(mn,mn) + foo( mx - mn , mn); }

How many times is foo activated (called), including the first "$\text{foo}(3,12)$"$\text{max()}$ and $\text{min()}$ are functions that return maximum and minimum respecti...

GO Classes

545 views

GO Classes asked Mar 26, 2022

5 votes

3 answers

753

GO Classes 2023 | Weekly Quiz 4 | Question: 20
What will be output printed by $\text{mystery}2(6)$? void mystery2(int n) { if (n > 0) { printf("%d", n); mystery2(n-2); mystery2(n-3); printf("%d", n); } }

What will be output printed by $\text{mystery}2(6)$?void mystery2(int n) { if (n 0) { printf("%d", n); mystery2(n-2); mystery2(n-3); printf("%d", n); } }

GO Classes

528 views

GO Classes asked Mar 26, 2022

4 votes

3 answers

754

GO Classes 2023 | Weekly Quiz 4 | Question: 21
What will be the output printed by $\text{mystery}3(6)$? void mystery3(int n) { if (n == 0 || n == 1) return; mystery3(n-2); printf("%d", n); mystery3(n-1); }

What will be the output printed by $\text{mystery}3(6)$?void mystery3(int n) { if (n == 0 || n == 1) return; mystery3(n-2); printf("%d", n); mystery3(n-1); }

GO Classes

584 views

GO Classes asked Mar 26, 2022

5 votes

3 answers

755

GO Classes 2023 | Weekly Quiz 4 | Question: 22
Consider the following pair of mutually recursive functions. What does $g(g(2))$ evaluate to? int f(int n){ if (n==0) return 0; return f(n-1)+g(n-1); } int g(int n){ if (n==0) return 1; return g(n-1) + f(n); }

Consider the following pair of mutually recursive functions. What does $g(g(2))$ evaluate to?int f(int n){ if (n==0) return 0; return f(n-1)+g(n-1); } int g(int n){ if (n...

GO Classes

879 views

GO Classes asked Mar 26, 2022

9 votes

2 answers

756

GO Classes 2023 | Weekly Quiz 4 | Question: 23
Consider the following recursive function. What is $f(0)?$ int f(int x) { if (x > 1000) return x - 4; else return f(f(x+5)); }

Consider the following recursive function. What is $f(0)?$int f(int x) { if (x 1000) return x - 4; else return f(f(x+5)); }

GO Classes

637 views

GO Classes asked Mar 26, 2022

27 votes

5 answers

757

GO Classes CS 2025 | Weekly Quiz 1 | Propositional Logic | Question: 12
Let $P$ be a compound proposition over $4$ propositional variables: $a,b,c,d$. We know that for a compound proposition over $n$ propositional variables, we have $2^n$ rows in the truth table. Every row of truth table of $P$ is called ... $P$ be $'a \rightarrow b'$. How many models are there for $P?$

Let $P$ be a compound proposition over $4$ propositional variables: $a,b,c,d$.We know that for a compound proposition over $n$ propositional variables, we have $2^n$ rows...

GO Classes

1.9k views

GO Classes asked Mar 23, 2022

4 votes

3 answers

758

GO Classes CS 2025 | Weekly Quiz 1 | Propositional Logic | Question: 3
Suppose that the statement $p \rightarrow \neg q$ is false. What is the number of all possible combinations of truth values of $r$ and $s$ for which $(\neg q \rightarrow r) \wedge (\neg p \vee s)$ is true?

Suppose that the statement $p \rightarrow \neg q$ is false. What is the number of all possible combinations of truth values of $r$ and $s$ for which $(\neg q \rightarrow ...

GO Classes

2.3k views

GO Classes asked Mar 23, 2022

5 votes

1 answer

759

GO Classes 2023 | Weekly Quiz 3 | Question: 17
If the statement $q \wedge r$ is true, then the number of all combinations of truth values for $p$ and $s$ such that the statement $(q \rightarrow [\neg p \vee s]) \wedge [\neg s \rightarrow r]$ is TRUE is ______

If the statement $q \wedge r$ is true, then the number of all combinations of truth values for $p$ and $s$ such that the statement $(q \rightarrow [\neg p \vee s]) \wedge...

GO Classes

348 views

GO Classes asked Mar 23, 2022

11 votes

4 answers

760

GO Classes CS 2025 | Weekly Quiz 1 | Propositional Logic | Question: 13
The number of combinations of truth values for $p, q$ and $r$ for which the statement $\neg p \leftrightarrow (q \wedge \neg (p \rightarrow r))$ is true ________

The number of combinations of truth values for $p, q$ and $r$ for which the statement $\neg p \leftrightarrow (q \wedge \neg (p \rightarrow r))$ is true ________

GO Classes

1.2k views

GO Classes asked Mar 23, 2022

40 votes

3 answers

761

GATE CSE 2022 | Question: 18
Suppose a binary search tree with $1000$ distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming that the array indices start with $0,$ the $3^{\text{rd}}$ largest element of the tree is stored at index ______________ .

Suppose a binary search tree with $1000$ distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assumin...

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