Register

Webpage

Programming in C. Recursion.
Filter

Recent questions in Programming and DS

3 votes
2 answers
151
C: Test Your Aptitude
#include<stdio.h> void main() { char arr[]=”\0”; if(printf(“%s\n”,arr)) printf(“Nothing\n”); else printf(“Something\n”); } What is the output of the following code?
#include<stdio.h>void main(){ char arr[]=”\0”; if(printf(“%s\n”,arr)) printf(“Nothing\n”); else printf(“Something\n”);} What is the output of...
User Avatar
0 votes
1 answer
152
physics wallah dpp
User Avatar
0 votes
1 answer
153
Practice question Avl trees
S1 : An insertion in an AVL with n nodes requires O(n) rotations. answer is false in answer key,but is guess for 1 insetion its O(1).so for n it will be O(n). tell me if i am wrong and correct me please.
S1 : An insertion in an AVL with n nodes requires O(n) rotations.answer is false in answer key,but is guess for 1 insetion its O(1).so for n it will be O(n).tell me if i ...
User Avatar
0 votes
1 answer
156
TOPIC - Infix to postfix and prefix conversion
Convert the following infix expression to postfix and prefix A^B^C^D
Convert the following infix expression to postfix and prefixA^B^C^D
User Avatar
14 votes
3 answers
157
GATE CSE 2023 | Question: 2
Which one of the following sequences when stored in an array at locations $A[1], \ldots, A[10]$ forms a max-heap? $23,17,10,6,13,14,1,5,7,12$ $23,17,14,7,13,10,1,5,6,12$ $23,17,14,6,13,10,1,5,7,15$ $23,14,17,1,10,13,16,12,7,5$
Which one of the following sequences when stored in an array at locations $A , \ldots, A[10]$ forms a max-heap?$23,17,10,6,13,14,1,5,7,12$$23,17,14,7,13,10,1,5,6,12$$23,1...
User Avatar
18 votes
4 answers
159
GATE CSE 2023 | Question: 25
The integer value printed by the $\textsf{ANSI-C}$ program given below is _______________ #include<stdio.h> int funcp(){ static int x = 1; x++; return x; } int main(){ int x,y; x = funcp(); y = funcp()+x; printf("%d\n", (x+y)); return 0; }
The integer value printed by the $\textsf{ANSI-C}$ program given below is _______________#include<stdio.h int funcp(){ static int x = 1; x++; return x; } int main(){ int ...
User Avatar
1 votes
1 answer
164
ISRO CS 2018
#include <stdio.h> int main() { int i,j,x; scanf("%d ",x); i=1; j=1; while(i<10){ j=j*i; i=i+1; if(i==x) break; } return 0; }
#include <stdio.h int main() {int i,j,x;scanf("%d ",x);i=1;j=1;while(i<10){j=j*i;i=i+1;if(i==x) break;}return 0;}
User Avatar
0 votes
1 answer
165
#madeeasy
is it ok to mark both and at least option in the case of MSQ, on my view in this question first option will always be true so marking the second is correct?
is it ok to mark both and at least option in the case of MSQ, on my view in this question first option will always be true so marking the second is correct?
User Avatar
3 votes
1 answer
166
Made Easy test series
answer given is 33
answer given is 33
User Avatar
0 votes
1 answer
167
#selfdoubt
how many topological sort possible for above graph?directions like this question https://gateoverflow.in/39669/gate-cse-2016-set-1-question-11
how many topological sort possible for above graph?directions like this question https://gateoverflow.in/39669/gate-cse-2016-set-1-question-11
User Avatar
Page: