Register

Webpage

Programming in C. Recursion.
Filter

Hot questions in Programming and DS

0 votes
0 answers
1761
#c programming
#include <stdio.h> int cou=0; int cal(int a,int b){ int c; cou++; if(b==3) return(a*a*a); else{ c=cal(a,b/3); return(c*c*c); } } int main() { int d= cal(4,81); printf("%d",d); return 0; }
#include <stdio.h>int cou=0;int cal(int a,int b){ int c; cou++; if(b==3) return(a*a*a); else{ c=cal(a,b/3); return(c*c*c); }}int ma...
User Avatar
0 votes
0 answers
1762
#madeeasy
How many binary min heap possible with element(1,2,3,4,5,6,7)?
How many binary min heap possible with element(1,2,3,4,5,6,7)?
User Avatar
0 votes
1 answer
1764
c++ programming
The ________ program combines the output of the compiler with various library functions to produce an executable image.
The ________ program combines the output of the compiler with various library functions to produce an executable image.
User Avatar
2 votes
1 answer
1765
Test by Bikram | Data Structures | Test 2 | Question: 15
Elements $1,2,3,4,5$ are inserted in a stack in sequence. The elements are printed while popping them out. Which of the following is a wrong print sequence? $3 \ 5 \ 4 \ 2 \ 1$ $1 \ 3 \ 2 \ 4 \ 5$ $5 \ 4 \ 3 \ 2 \ 1$ $2 \ 4 \ 1 \ 5 \ 3$
Elements $1,2,3,4,5$ are inserted in a stack in sequence. The elements are printed while popping them out. Which of the following is a wrong print sequence?$3 \ 5 \ 4 \ 2...
User Avatar
1 votes
0 answers
1766
Ace test series
User Avatar
1 votes
2 answers
1768
Gradup topicwise question
Consider the vales of bst $11,22,33,44,55,66,77,88$. Which of the following is a valid sequence of preorder traversal? $55,33,11,22,44,77,66,88$ $55,33,22,44,11,66,77,88$ $55,33,11,44,22,66,77,88$ $55,33,11,44,22,66,77,88$ Given answer is option A But how?
Consider the vales of bst $11,22,33,44,55,66,77,88$.Which of the following is a valid sequence of preorder traversal?$55,33,11,22,44,77,66,88$$55,33,22,44,11,66,77,88$$55...
User Avatar
2 votes
5 answers
1770
made easy
What is the output???
What is the output???
User Avatar
0 votes
2 answers
1771
Data structure
How to find clique in a graph?
How to find clique in a graph?
User Avatar
0 votes
0 answers
1772
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
1773
DATA STRUCTURES
Can anyone explain answer is A
Can anyone explain answer is A
User Avatar
0 votes
2 answers
1774
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
1775
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
1776
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
1777
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
1778
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
1779
#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
Page: