Register

Webpage

Programming in C. Recursion.
Filter

Hot questions in Programming and DS

2 votes
5 answers
1862
made easy
What is the output???
What is the output???
User Avatar
0 votes
2 answers
1863
Data structure
How to find clique in a graph?
How to find clique in a graph?
User Avatar
0 votes
0 answers
1864
Programming and DS
#include<stdio.h> int main() { char A[5][7][6]; char *p[5][7][6]; printf(“%d\t”,(unsigned)(A+1)-(unsigned)A); printf(“%d”,(unsigned)(p+1)-(unsigned)p); } OPTIONS: 42 42 1 1 42 336 336 42
#include<stdio.h int main() { char A[5][7][6]; char *p[5][7][6]; printf(“%d\t”,(unsigned)(A+1)-(unsigned)A); printf(“%d”,(unsigned)(p+1)-(unsigned)p); } OPTIONS:4...
User Avatar
0 votes
1 answer
1865
DATA STRUCTURES
Can anyone explain answer is A
Can anyone explain answer is A
User Avatar
0 votes
2 answers
1866
Choose the correct statement about HEAP
I. A heap is always nearly complete tree. II. Worst case complexity of heapify operation is O( log n) III. Worst case complexity of build heap operation is O( n log n) a. I only b. I and II only c. II and III only d. I, II and III
I. A heap is always nearly complete tree.II. Worst case complexity of heapify operation is O( log n)III. Worst case complexity of build heap operation is O( n log n)a. I ...
User Avatar
0 votes
0 answers
1867
Trees
Time complexity of creating a balanced binary search tree as well as unbalanced search tree from inorder traversal and preorder traversals?
Time complexity of creating a balanced binary search tree as well as unbalanced search tree from inorder traversal and preorder traversals?
User Avatar
0 votes
0 answers
1868
C Programming quiz
Consider the following C-fragment: #include<stdio.h> int(*foo())[3] { int a[3]={1,2,3}; printf("%d",*a); return &a; } int main() { int (*p)[3]; p==foo(); printf("%d",*(*p+2)); return 0; } $A)13$ $B)10$ $C)31$ $D)Compilation$ $error$
Consider the following C-fragment:#include<stdio.h int(*foo())[3] { int a[3]={1,2,3}; printf("%d",*a); return &a; } int main() { int (*p)[3]; p==foo(); prin...
User Avatar
0 votes
1 answer
1869
C programming
int main() { char *p="abc"; char *q="abc123"; while(*p++=*q++) printf("%c %c",*p,*q); } The Output is b bc c 1a 2b 3c Here explain how did 1a 2b 3c will come as at that time p has null value
int main() { char *p="abc"; char *q="abc123"; while(*p++=*q++) printf("%c %c",*p,*q); }The Output is b bc c 1a 2b 3cHere explain how did 1a 2b 3c will come as at that tim...
User Avatar
0 votes
0 answers
1870
Programming
#include<stdio.h> int code(int m){ if(m>0){ int i=1; for(;i<3;i++){ code(m-i); code(m-i-1); printf("GATE2019"); } } } int main() { code(4); return 0; } How many times GATE2019 will be printed?
#include<stdio.h int code(int m){ if(m>0){ int i=1; for(;i<3;i++){ code(m-i); code(m-i-1); printf("GATE2019"); } } } int main() { code(4); return 0; }How many times GATE2...
User Avatar
0 votes
0 answers
1871
#Incriment and decriment
#include <stdio.h> int main(void) { int i=1; printf("%d%d%d",i++,i++,i); } how to evaluate this type of questions
#include <stdio.h>int main(void) {int i=1;printf("%d%d%d",i++,i++,i);}how to evaluate this type of questions
User Avatar
0 votes
0 answers
1873
made easy
What is the output of the following program if dynamic scoping is used? int a,b,c; void func1(){ int a,b; a=6; b=8; func2(); a=a+b+c; print(a); } void func2(){ int b,c; b=4; c=a+b; a+=11; print(c); } void main(){ a=3; b=5; c=7; func1(); } a)7 19 b)10 1 c)10 23 d)10 32
What is the output of the following program if dynamic scoping is used? int a,b,c; void func1(){ int a,b; a=6; b=8; func2(); a=a+b+c; print(a); } void func2(){ int b,c; b...
User Avatar
1 votes
0 answers
1874
Programming
User Avatar
0 votes
1 answer
1875
C programming
#include<stdio.h> void fun(int *p,int *q) { p=q; *p=q; } int i=0,j=1; int main() { fun(&i,&j); printf("%d%d",i,j); } What will be the output of i and j in 16-bit C Compiler?
#include<stdio.h void fun(int *p,int *q) { p=q; *p=q; } int i=0,j=1; int main() { fun(&i,&j); printf("%d%d",i,j); }What will be the output of i and j in 16-bit C Compiler...
User Avatar
0 votes
0 answers
1877
Min heap
The number of possible min-heaps containing each value from 1,2, 3, 4, 5, 6, 7 exactly once is.
The number of possible min-heaps containing each value from 1,2, 3, 4, 5, 6, 7 exactly once is.
User Avatar
0 votes
0 answers
1878
Output of column major order ques ?
I am getting 55-54 =1 as output but answer mentioned is 10 .
I am getting 55-54 =1 as output but answer mentioned is 10 .
User Avatar
0 votes
0 answers
1879
What should be the answer?
int main() { int i, j = 1; for(i = 1; i < 100) { j = j * i; i++; if(i == j) break; } } Which of the following is always correct at the end of the loop. s1: (i = 100) or (i > j) s2: if i = n; then j = (n-1)!; n be some random value s3: (i = 100) or (i == j)
int main() { int i, j = 1; for(i = 1; i < 100) { j = j * i; i++; if(i == j) break; } }Which of the following is always correct at the end of the loop.s1: (i = 100) or (i ...
User Avatar
0 votes
0 answers
1880
ME T1
Total number of nodes in tree number of leaves The number of edges in the longest path from root to leaf in T The number of nodes in the longest path from root to leaf in T
Total number of nodes in treenumber of leavesThe number of edges in the longest path from root to leaf in TThe number of nodes in the longest path from root to leaf in T
User Avatar
Page: