Register

Webpage

Programming in C. Recursion.
Filter

Recent questions in Programming and DS

5 votes
1 answer
5121
Ds..
Consider the following function: void f(int a) { if(a <= 0) return ; else{ printf("%d ",a); f(a-2); printf("%d ",a); f(a-3); } } The sum of all values printed by f(6) is _____ .
Consider the following function:void f(int a) { if(a <= 0) return ; else{ printf("%d ",a); f(a-2); printf("%d ",a); f(a-3); } }The sum of all values printed by f(6) is __...
User Avatar
0 votes
1 answer
5122
depth of the binary tree with n node?
User Avatar
0 votes
2 answers
5123
regarding pointers
What does this mean? int *(*func())[] According to me , it means that its an array of pointers to functions which returns pointers of type int. Am I correct?
What does this mean?int *(*func())[] According to me , it means that its an array of pointers to functions which returns pointers of type int. Am I correct?
User Avatar
1 votes
2 answers
5127
DFS
User Avatar
0 votes
1 answer
5130
program
What will be the output of the following program assuming that parameter passing is call by value procedure P{a, b, c}; begin a:=b:=3; b:b+1; c: a+a end; begin main P(a+b, a, a); Print(a) end.
What will be the output of the following program assuming that parameter passing iscall by valueprocedure P{a, b, c}; begin a:=b:=3; b:b+1; c: a+a end; begin main P(a+b, ...
User Avatar
0 votes
1 answer
5133
data structure
describe in details
describe in details
User Avatar
0 votes
1 answer
5134
total possible BST with n nodes
total possible binary search trees with 3 nodes is: 14 15 6 none
total possible binary search trees with 3 nodes is:14 15 6 none
User Avatar
1 votes
2 answers
5135
Complexity
User Avatar
3 votes
2 answers
5136
Identify syntax error
Find the $C$ statement which has a syntax error. If (z) For (a, b, c) While (a, b) None of these.
Find the $C$ statement which has a syntax error.If (z)For (a, b, c)While (a, b)None of these.
User Avatar
1 votes
1 answer
5137
output
User Avatar
1 votes
1 answer
5138
returned value
User Avatar
5 votes
2 answers
5139
Pointers
Main() { int a[2][3][2]={{{2,4},{7,8},{3,4}}，{{2,2},{2,3},{3,4}}}; Printf("%u",a); Printf("%u",*a); Printf("%u",**a); Printf("%u",***a); Printf("%u",a+1); Printf("%u",*a+1); Printf("%u",**a+1); Printf("%u",***a+1); }
Main(){int a [3] ={{{2,4},{7,8},{3,4}}，{{2,2},{2,3},{3,4}}};Printf("%u",a);Printf("%u",*a);Printf("%u", a);Printf("%u", *a);Printf("%u",a+1);Printf("%u",*a+1);Printf("%...
User Avatar
Page: