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
Questions by rajan
2
votes
2
answers
1
c language
#include <stdio.h> int main() { int a = 1; int b = 1; int c = a || --b; printf("%d %d",c,b); } Answer is given 1, 1 but i m having doubt in logical OR operator and uninary operator .uni operator having higher precedence then so we firstly decrement the 'b' and then perform OR by which i got output 1,0 where i m wrong plz explain.
#include <stdio.h int main() { int a = 1; int b = 1; int c = a || b; printf("%d %d",c,b); }Answer is given 1, 1 but i m having doubt in logical OR operator and uninary ...
2.9k
views
asked
Apr 4, 2017
1
votes
1
answer
2
c language
#include <stdio.h> int f1() { printf ("Geeks"); return 1;} int f2() { printf ("Quiz"); return 1;} int main() { int p = f1() + f2(); return 0; } (A) GeeksQuiz (B) QuizGeeks (C) Compiler Dependent (D) Compiler Error plz explain i m ... A bcz + is left associative so f1() first execute then f2() will be executed so answer will be A bt they given C why is it so ?
#include <stdio.h int f1() { printf ("Geeks"); return 1;} int f2() { printf ("Quiz"); return 1;} int main() { int p = f1() + f2(); return 0; } (A) GeeksQuiz(B) QuizGe...
922
views
asked
Apr 4, 2017
1
votes
1
answer
3
C language
#include <stdio.h> #define R 10 #define C 20 int main() { int (p)[R][C]; printf("%d", sizeof(p)); printf("\n%d",sizeof(*p)); printf("\n%d",sizeof(**p)); getchar(); return 0; } i m thinking output is 4, 800, 4 ?? any body explain it??
#include <stdio.h>#define R 10#define C 20int main(){int (p)[R][C];printf("%d", sizeof(p));printf("\n%d",sizeof(*p));printf("\n%d",sizeof( p));getchar();return 0;} i...
1.6k
views
asked
Mar 16, 2017
0
votes
1
answer
4
TestBook Test Series: Algorithms - Time Complexity
how to solve these two using matser thorem. 1. t(n)=2t(√n)+n 2. t(n)=4t(√n)+(logn)^2
how to solve these two using matser thorem.1. t(n)=2t(√n)+n2. t(n)=4t(√n)+(logn)^2
377
views
asked
Dec 9, 2016
Algorithms
testbook-test-series
algorithms
time-complexity
master-theorem
+
–
1
votes
1
answer
5
fill in the blank
foreign bank have stopped ________ in india a. to open b. for opening c. opening d open
foreign bank have stopped ________ in indiaa. to openb. for openingc. openingd open
805
views
asked
Sep 2, 2016
Verbal Aptitude
verbal-aptitude
+
–
1
votes
1
answer
6
quick sort
is it quick sort is inplace algorithm. according to me it takes o(logn) space in best case and as i know any algo takes more then 0(1) spcae count as not inplace algo then why quick sort is inplace plz explain clearly
is it quick sort is inplace algorithm. according to me it takes o(logn) space in best case and as i know any algo takes more then 0(1) spcae count as not inplace algo...
589
views
asked
Jul 24, 2016
Algorithms
quick-sort
+
–
0
votes
3
answers
7
syllogism
s1. some big are small s2. no small is large s3. some large are tiny conclusions 1. some large are not big 2. no big is large 3. some small are not tiny 4. some bigs are not tiny options are A.) only 1 B) only 2 C) only 3 D) only 4 E) none follow plz explain and tell where can i prefer for syllogism bcz i got consfused
s1. some big are smalls2. no small is larges3. some large are tinyconclusions 1. some large are not big 2. no big is large 3....
3.3k
views
asked
Jun 20, 2016
1
votes
2
answers
8
find the odd one 17,25,32,37,47,59,71
if i simply observe all no is odd except 32 so my answer should be 32 bt if i do other observation like 17 do digit sum ie (1+7)=8 and it is the diffrence between 17 and 25 and then if i take 25 do digit sum i got 7 and it is the diffrence between 25 and 32 like wise i do my procedure and i got 59 odd one then which one is correct in 32 and 59. 32 59 71 47 37
if i simply observe all no is odd except 32 so my answer should be 32 bt if i do other observation like 17 do digit sum ie (1+7)=8 and it is the diffrence between 17 and...
1.2k
views
asked
Jun 16, 2016
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register