Register

Webpage

Programming in C. Recursion.
Filter

Hot questions in Programming and DS

0 votes
0 answers
1781
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
1782
Programming
User Avatar
0 votes
1 answer
1783
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
1785
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
1786
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
1787
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
1788
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
0 votes
0 answers
1789
SELF DOUBT RECURSION
NOT GGETTING THIS STATEMENT “Recursion is not useful for branching processes” WHAT DOES IT MEANS?
NOT GGETTING THIS STATEMENT“Recursion is not useful for branching processes” WHAT DOES IT MEANS?
User Avatar
0 votes
1 answer
1790
Recurrence Relation of BST
Let T (n) be the number of comparisons needed in a binary search of a list of n elements. What is the recurrence relation? Explain. 1) T(n) = T(n/2) + 2 2) T(n) = T(n/2) + 1
Let T (n) be the number of comparisons needed in a binary search of a list of n elements. What is the recurrence relation? Explain. 1) T(n) = T(n/2) + 22) T(n) = T(n/2) +...
User Avatar
0 votes
1 answer
1791
Printf
What is the output??
What is the output??
User Avatar
0 votes
0 answers
1792
ME ots stack and heap
Please explain points in short, and intuition behind its working. ​​
Please explain points in short, and intuition behind its working.​​
User Avatar
0 votes
0 answers
1793
data structure array
Which of the following C expressions access the (i, j)th entry of an (mn) matrix strored in column major order? n(i-1)+j m(j-1)+i m(n-j)+j n(m-i)+j
Which of the following C expressions access the (i, j)th entry of an (mn) matrix strored in column major order?n(i-1)+jm(j-1)+im(n-j)+jn(m-i)+j
User Avatar
2 votes
1 answer
1794
Test by Bikram | Data Structures | Test 2 | Question: 19
The resultant array after first iteration of bubble sort on $10,20,6,5,30, 8$ is _________. $10 , 6,5,20,8,30$ $10 , 6,5,20,30,8$ $10 , 5,6,20,8,30$ $10 , 6,5,30,8,20$
The resultant array after first iteration of bubble sort on $10,20,6,5,30, 8$ is _________.$10 , 6,5,20,8,30$$10 , 6,5,20,30,8$$10 , 5,6,20,8,30$$10 , 6,5,30,8,20$
User Avatar
0 votes
1 answer
1795
ME Test Series
User Avatar
0 votes
2 answers
1796
#self doubt
https://gateoverflow.in/204103/gate2018-29?show=204103#q204103 in this question wht is passed in function 1.....what actually 1st function is doing?
https://gateoverflow.in/204103/gate2018-29?show=204103#q204103in this question wht is passed in function 1.....what actually 1st function is doing?
User Avatar
1 votes
0 answers
1797
madeeasy test series
Time complexity for Maximum number of edges to be added to a tree so that it stays a Bipartite graph is?? answe given as O(v) using dfs but a option O(v+e) is also there why this cant be answer?
Time complexity for Maximum number of edges to be added to a tree so that it stays a Bipartite graph is??answe given as O(v) using dfs but a option O(v+e) is also there w...
User Avatar
3 votes
1 answer
1800
GATE CSE 1989 | Question: 4-xi
Express the following list in terms of a linked list structure suitable for internal representation. $(((ab)c)d((e)))$
Express the following list in terms of a linked list structure suitable for internal representation.$(((ab)c)d((e)))$
User Avatar
Page: