Register

Webpage

Programming in C. Recursion.
Filter

Most viewed questions in Programming and DS

1 votes
1 answer
2102
madeeasy test series
How many times made easy is printed? #include <stdio.h> int main() { c(4); return 0; } int c(int m){ if (m>0){ for(int i=1;i<3;i++){ c(m-i); c(m-i-1); printf("madeeasy") } } }
How many times made easy is printed?#include <stdio.h>int main() { c(4);return 0;}int c(int m){ if (m>0){ for(int i=1;i<3;i++){ c(m-i); ...
User Avatar
2 votes
2 answers
2103
how >> and << works
#include <stdio.h> int main(void) { int a=5, b=10; printf("%d%d",a,b); make_it(b,a,a+b); printf("%d%d",a,b); return 0; } int make_it(int x,int y, int z){ x*=y+z; y=x<<1; z=x+y; }
#include <stdio.h int main(void) { int a=5, b=10; printf("%d%d",a,b); make_it(b,a,a+b); printf("%d%d",a,b); return 0; } int make_it(int x,int y, int z){ x*=y+z; y=x<<1; z...
User Avatar
0 votes
0 answers
2105
ISRO2020-62
#include int main() { int x; char *ptr; x=622,100,101; printf("%d",(*(char *)&x)*(x%3)); return 0; } In this question what is the meaning of “ *(char *)&x “ ? please explain it.
#includeint main(){ int x;char *ptr;x=622,100,101;printf("%d",(*(char *)&x)*(x%3));return 0; }In this question what is the meaning of “ *(char *)&x “ ? please ...
User Avatar
1 votes
0 answers
2107
splay tree insertion
What item is at root after the following sequence of insertions into an empty splay tree 1,11,3,10,8, 4,6,5,7,9,2 A)1 B)2 C) 4 D)8
What item is at root after the following sequence of insertions into an empty splay tree1,11,3,10,8, 4,6,5,7,9,2A)1 B)2 C) 4 D)8
User Avatar
0 votes
1 answer
2108
MCA ARRAY ADDRESS CALCULATION
Find the address of the position [10, 11, 12] of array A in column major order? Given Dimension is A[1:10, -5:15, -10:15], w is two word count, and Base address is 200.
Find the address of the position [10, 11, 12] of array A in column major order? Given Dimension is A[1:10, -5:15, -10:15], w is two word count, and Base address is 200.
User Avatar
1 votes
1 answer
2109
ISRO-DEC2017-53
The minimum number of stacks needed to implement a queue is $3$ $1$ $2$ $4$
The minimum number of stacks needed to implement a queue is$3$$1$$2$$4$
User Avatar
1 votes
1 answer
2110
#dennis
#include<stdio.h> void print1(void){ static int x=10; x+=5; printf("%d",x); } void print2(void){ static int x; x=10; x+=5; printf("%d",x); } int main(){ print1(); print1(); print2(); print2(); getch(); return 0; } please let me know how print1 and print2 is working?
#include<stdio.h>void print1(void){static int x=10;x+=5;printf("%d",x);}void print2(void){static int x;x=10;x+=5;printf("%d",x);}int main(){print1();print1();print2();pri...
User Avatar
0 votes
1 answer
2111
#DataStructure Time Complexity in Sorted Array.
Given an sorted array in descending order, what will be the time complexity to delete the minimum element from this array?
Given an sorted array in descending order, what will be the time complexity to delete the minimum element from this array?
User Avatar
–2 votes
0 answers
2113
source code for building Hotel Management system in java
Source code for building Hotel Management system in java
Source code for building Hotel Management system in java
User Avatar
3 votes
2 answers
2114
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
1 votes
2 answers
2115
void pointer
#include<stdio.h> int main() { int a[2] = {1, 2}; void *ptr = &a; ptr = ptr + sizeof(int); printf("%d", *(int *)ptr); return 0; } what will be output ... explain in detail
#include<stdio.h>int main(){ int a = {1, 2}; void *ptr = &a; ptr = ptr + sizeof(int); printf("%d", *(int *)ptr); return 0;}what will be output ... explain...
User Avatar
1 votes
1 answer
2116
madeeasy
which is an efficient tree structure in terms of space and time complexity? a) AVL Tree b)Full Binary tree c)Complete binary tree d)Binary tree
which is an efficient tree structure in terms of space and time complexity?a) AVL Treeb)Full Binary treec)Complete binary treed)Binary tree
User Avatar
0 votes
1 answer
2117
output??
plz explain this code?? main() { char *p="hai friends",*p1; p1=p; while(*p!='\0') ++*p++; printf("%s %s",p,p1); }
plz explain this code??main(){char *p="hai friends",*p1;p1=p;while(*p!='\0') ++*p++;printf("%s %s",p,p1);}
User Avatar
0 votes
2 answers
2118
pointer airthmatic
we can subtract 2 pointer address then why we can't perform operations like addition, multiplication or division on pointer address??? any specific reason?
we can subtract 2 pointer address then why we can't perform operations like addition, multiplication or division on pointer address???any specific reason?
User Avatar
2 votes
0 answers
2120
Binary Tree
Consider the following routine on binary tree void do(struct btnode *t) { if(t) { Do(t->Rightchild); Do(t->Leftchild); swap(t->Rightchild,t->Leftchild); } } 1) What does Do(t) do on following binary tree after running the code? a) b)
Consider the following routine on binary treevoid do(struct btnode *t) { if(t) { Do(t->Rightchild); Do(t->Leftchild); swap(t->Rightchild,t->Leftchild); } }1) What does Do...
User Avatar
Page: