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 pinaksh10
2
answers
1
Test series question of ace academy
#include<stdio.h> #define ADD(a,b)(a+b) #define SQUARE(x)(x*x) int main() { int x=2; int y=3; int z = ADD(SQUARE(x++),y); printf("%d\n",z); return 0; } What is the output of the above code snippet?
#include<stdio.h>#define ADD(a,b)(a+b)#define SQUARE(x)(x*x)int main(){int x=2;int y=3;int z = ADD(SQUARE(x++),y);printf("%d\n",z);return 0;}What is the output of the abo...
195
views
answered
Apr 27
Programming in C
ace-test-series
+
–
3
answers
2
GO Classes CS Test Series 2025 | Discrete Mathematics | Topic Wise Test 1 | Question: 5
Consider the statement $\text{S} :$ "For all natural numbers $n,$ if $n$ is prime, then $n$ is antisocial." You do not need to know what antisocial means for this problem, just that it is a property ... $10$ is antisocial. $10$ is not antisocial. $7$ is antisocial. $7$ is not antisocial.
Consider the statement $\text{S} :$ "For all natural numbers $n,$ if $n$ is prime, then $n$ is antisocial."You do not need to know what antisocial means for this problem,...
459
views
answered
Apr 26
Mathematical Logic
goclasses_2025_cs_dm_tw_1
goclasses
mathematical-logic
first-order-logic
multiple-selects
easy
1-mark
+
–
2
answers
3
GO Classes CS Test Series 2025 | Discrete Mathematics | Topic Wise Test 1 | Question: 15
Let's make a trip to a new world called "Never Never Land". Regular, ordinary first-order logic has two quantifiers: $\forall$ and $\exists$. Now, let's imagine we lived in a world in which these quantifiers ... $\mathrm{Nx}(\neg A(x) \wedge B(x))$
Let's make a trip to a new world called "Never Never Land".Regular, ordinary first-order logic has two quantifiers: $\forall$ and $\exists$.Now, let's imagine we lived in...
496
views
answered
Apr 25
Mathematical Logic
goclasses_2025_cs_dm_tw_1
goclasses
mathematical-logic
first-order-logic
difficult
2-marks
+
–
2
answers
4
GATE CSE 2008 | Question: 81
The subset-sum problem is defined as follows. Given a set of $n$ positive integers, $S = \{ a_1, a_2, a_3, \dots , a_n \}$, and positive integer $W$, is there a subset of $S$ whose elements sum to $W$? A dynamic program for solving this problem uses a $\text{2-dimensional}$ ... that there is a subset whose elements sum to $W$? $X[1, W]$ $X[n, 0]$ $X[n, W]$ $X[n-1, n]$
The subset-sum problem is defined as follows. Given a set of $n$ positive integers, $S = \{ a_1, a_2, a_3, \dots , a_n \}$, and positive integer $W$, is there a subset of...
10.3k
views
commented
Aug 14, 2023
Algorithms
gatecse-2008
algorithms
normal
dynamic-programming
+
–
12
answers
5
GATE CSE 2014 Set 1 | Question: 42
Consider the following pseudo code. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3 Half of the product of the $3$ consecutive integers. One-third of the product of the $3$ consecutive integers. One-sixth of the product of the $3$ consecutive integers. None of the above.
Consider the following pseudo code. What is the total number of multiplications to be performed?D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3H...
35.1k
views
commented
Aug 13, 2023
Algorithms
gatecse-2014-set1
algorithms
time-complexity
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register