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 prateek_hazard
1
answer
1
BITS HD
I got Selected for BITS Pilani SS. Should I go for it or wait for one year to give gate again to get IITs. ?Repaying loan of 10Lac which i will take for BITS is getting me nervous. My this year gate rank is AIR 2047
I got Selected for BITS Pilani SS. Should I go for it or wait for one year to give gate again to get IITs. ?Repaying loan of 10Lac which i will take for BITS is getting m...
5.8k
views
commented
Mar 23, 2023
Written Exam
bits
gate2018-admissions
admissions
+
–
2
answers
2
GO Classes Test Series 2023 | Data Structures | Test 3 | Question: 7
Consider a circular array-based implementation of the queue where the front and rear has been initialized to $-1.$ Array size is $N.$ Which of the following statements is true for the number of elements or size of the queue ... S1 is true but S2 is false S1 is false but S2 is true Both statements are true Both statements are false
Consider a circular array-based implementation of the queue where the front and rear has been initialized to $-1.$ Array size is $N.$Which of the following statements is ...
499
views
commented
Jun 9, 2022
DS
goclasses2024-ds-3-weekly-quiz
goclasses
data-structures
queue
circular-queue
1-mark
+
–
2
answers
3
GO Classes Test Series 2024 | Programming | Test 3 | Question: 23
What will be the output of the following lines of code? int i = 0; int j = 0; char *s = "ceded"; while (s[i] != '\0') { j = j + s[i] - 'b'; i = i + 1; } printf("%d %d\n", i, j); $5\; 11$ $4\; 16$ $5\; 16$ $4 \;11$
What will be the output of the following lines of code?int i = 0; int j = 0; char *s = "ceded"; while (s[i] != '\0') { j = j + s[i] - 'b'; i = i + 1; } printf("%d %d\n", ...
296
views
answered
May 5, 2022
Programming in C
goclasses2024-programming-3-weekly-quiz
goclasses
programming
programming-in-c
loop
output
2-marks
+
–
1
answer
4
GO Classes Test Series 2024 | Programming | Test 3 | Question: 21
Consider the following C code where main shows the intended use of the functions relating to struct foo. struct foo { int x; int y; int * p; }; struct foo* make_foo() { struct foo *foo = malloc(sizeof( ... program has a dangling pointer Given program may result in run time error Given program will result in a compile-time error
Consider the following C code where main shows the intended use of the functions relating to struct foo.struct foo { int x; int y; int * p; }; struct foo* make_foo() { st...
566
views
answered
May 5, 2022
Programming in C
goclasses2024-programming-3-weekly-quiz
goclasses
programming
programming-in-c
structure
pointers
multiple-selects
2-marks
+
–
6
answers
5
GATE CSE 1997 | Question: 6.3
The number of equivalence relations of the set $\{1,2,3,4\}$ is $15$ $16$ $24$ $4$
The number of equivalence relations of the set $\{1,2,3,4\}$ is$15$$16$$24$$4$
21.4k
views
commented
Apr 28, 2022
Set Theory & Algebra
gate1997
set-theory&algebra
relations
normal
+
–
8
answers
6
GATE CSE 2005 | Question: 32
Consider the following C program: double foo (double); /* Line 1 */ int main() { double da, db; //input da db = foo(da); } double foo (double a) { return a; } The above code compiled without any error ... or error some compiler-warnings not leading to unintended results some compiler-warnings due to type-mismatch eventually leading to unintended results compiler errors
Consider the following C program:double foo (double); /* Line 1 */ int main() { double da, db; //input da db = foo(da); } double foo (double a) { return a; }The above cod...
16.3k
views
commented
Apr 27, 2022
Programming in C
gatecse-2005
programming
programming-in-c
compiler-design
easy
+
–
1
answer
7
GO Classes Test Series 2024 | Programming | Test 2 | Question: 3
Consider two files given below. //file1.c #include<stdio.h> main () { extern int i; printf("file1"); } //file2.c #include<stdio.h> main () { int i =1; printf("file2"); } We compile ... compiled independently but can not be linked together file$1$.c can be compiled and linked independently of file$2$.c.
Consider two files given below.//file1.c #include<stdio.h main () { extern int i; printf("file1"); } //file2.c #include<stdio.h main () { int i =1; printf("file2"); }We c...
643
views
commented
Apr 26, 2022
Programming in C
goclasses2024-programming-2-weekly-quiz
goclasses
programming
programming-in-c
storage-classes-in-c
multiple-selects
1-mark
+
–
2
answers
8
GO Classes 2023 | Weekly Quiz 3 | Question: 4
Let $A,\;B$ represent two propositions. Which of the following logical formulae is/are tautology? $A\wedge B\rightarrow (A\rightarrow B)$ $A\wedge \neg B \rightarrow \neg (A\rightarrow B)$ $\neg A\wedge B \rightarrow (A\rightarrow B)$ $\neg A\wedge \neg B \rightarrow (A\rightarrow B)$
Let $A,\;B$ represent two propositions.Which of the following logical formulae is/are tautology?$A\wedge B\rightarrow (A\rightarrow B)$$A\wedge \neg B \rightarrow \neg (A...
527
views
answered
Mar 27, 2022
Mathematical Logic
goclasses
goclasses_wq3
mathematical-logic
propositional-logic
multiple-selects
1-mark
+
–
5
answers
9
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...
2.0k
views
answered
Mar 26, 2022
Mathematical Logic
goclasses
goclasses2025_cs_wq1
mathematical-logic
propositional-logic
numerical-answers
2-marks
+
–
1
answer
10
Doubt in By Case Method to check Tautology
The Truth Value of a compound proposition (if there two pv p,q) is depend on both pv...Then while checking tautology in by case method why we check only one pv’s case like p = true p =false..why we dont check q also?
The Truth Value of a compound proposition (if there two pv p,q) is depend on both pv...Then while checking tautology in by case method why we check only one pv’s case l...
301
views
answered
Mar 25, 2022
Mathematical Logic
discrete-mathematics
propositional-logic
+
–
8
answers
11
GATE CSE 1999 | Question: 2.21
If $T_1 = O(1)$, give the correct matching for the following pairs: $\begin{array}{l|l}\hline \text{(M) $T_n = T_{n-1} + n$} & \text{(U) $T_n = O(n)$} \\\hline \text{(N) $T_n = T_{n/2} + n$} & \text{(V) $T_n = O(n \log n)$ ... $\text{M-W, N-U, O-X, P-V}$ $\text{M-V, N-W, O-X, P-U}$ $\text{M-W, N-U, O-V, P-X}$
If $T_1 = O(1)$, give the correct matching for the following pairs:$$\begin{array}{l|l}\hline \text{(M) $T_n = T_{n-1} + n$} & \text{(U) $T_n = O(n)$} \\\hline \text{(...
15.1k
views
commented
Jun 23, 2021
Algorithms
gate1999
algorithms
recurrence-relation
asymptotic-notation
normal
match-the-following
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register