Register

Webpage

Programming in C. Recursion.
Filter

Recent questions in Programming and DS

2 votes
2 answers
4984
Linked list
User Avatar
1 votes
2 answers
4985
MadeEasy Test Series: Programming & DS - Programming In C
Consider the following program: # define Rec(a) a + a * a int a; a = 20 + Rec(a) * Rec(a + 1); printf(“%d”, a) return 0; } The output of above program for a = 3 is ________.
Consider the following program:# define Rec(a) a + a * aint a;a = 20 + Rec(a) * Rec(a + 1);printf(“%d”, a)return 0;}The output of above program for a = 3 is ________....
User Avatar
0 votes
1 answer
4986
optimal binary serch tree
The cost of optimal binary serch tree for the identifier set (a1,a2,a3) = (do , if , while ) with p(1) =0.3,p(2) =0.2, p(3) = 0.15, q(0) = 0.05,q(1) = 0.15,q(2) =0.1,q(3) =0.05 is ?
The cost of optimal binary serch tree for the identifier set (a1,a2,a3) = (do , if , while ) with p(1) =0.3,p(2) =0.2, p(3) = 0.15, q(0) = 0.05,q(1) = 0.15...
User Avatar
0 votes
2 answers
4988
daa
the height of tree is the length of the longest of the longest root to leaf path in it.the max and min no of nodes of height 5 are_________
the height of tree is the length of the longest of the longest root to leaf path in it.the max and min no of nodes of height 5 are_________
User Avatar
2 votes
3 answers
4989
column major
Consider a three dimensional array A[50][20][30] stored in linear array in column major order . If the base address starts at 1000, the location of A[20][10][10] is ..? (assume first element is stored at A[1][1][1])
Consider a three dimensional array A[50][20][30] stored in linear array in column major order . If the base address starts at 1000, the location of A[20][10][10] is ..? (...
User Avatar
1 votes
1 answer
4991
c output
Consider the following C program segment: #include <stdio.h> main() { static char*s[] = {"black","white","yellow","violet"}; char **ptr[]={s+3,s+2,s+1,s},***p; p=ptr; ++P; printf("%s",*--*++p+3); } What will be printed by the program? et ite ck yellow
Consider the following C program segment:#include <stdio.h main() { static char*s[] = {"black","white","yellow","violet"}; char ptr[]={s+3,s+2,s+1,s}, *p; p=ptr; ++P; pr...
User Avatar
2 votes
3 answers
4994
MadeEasy Test Series: Programming & DS - Infix Postfix
Consider the following expression with infix notation A * B - (C + D) * (E / 5) ^ F What is the maximum height of the operator stack during conversion from infix to postfix ? a) 3 b) 4 c) 5 d) 6
Consider the following expression with infix notationA * B - (C + D) * (E / 5) ^ F What is the maximum height of the operator stack during conversion from infix to postfi...
User Avatar
2 votes
3 answers
4995
Virtual Gate Test Series: Programming & DS - AVL Tree
Insert the given values in the order in initially empty $\text{AVL}$ tree. $\text{34,21,10,27,24,43,15,6}$ What is the value at the root of the tree$?$
Insert the given values in the order in initially empty $\text{AVL}$ tree.$\text{34,21,10,27,24,43,15,6}$What is the value at the root of the tree$?$
User Avatar
8 votes
2 answers
4996
ISRO2015-76
Consider the following statements #define hypotenuse (a, b) sqrt (a*a+b*b); The macro call hypotenuse(a+2,b+3); Finds the hypotenuse of a triangle with sides $a+2$ and $b+3$ Finds the square root of $(a+2)^2$ and $(b+3)^2$ Is invalid Find the square root of $3 *a+4*b+5$
Consider the following statements#define hypotenuse (a, b) sqrt (a*a+b*b);The macro call hypotenuse(a+2,b+3);Finds the hypotenuse of a triangle with sides $a+2$ and $b+3$...
User Avatar
2 votes
2 answers
4997
How many ways can we insert numbers into an AVL tree so that it does not have any rotation?
If I have numbers from {1,2,...7} then in how many ways can I form an AVL tree without any rotation required ? How to approach this question ?
If I have numbers from {1,2,...7} then in how many ways can I form an AVL tree without any rotation required ?How to approach this question ?
User Avatar
3 votes
1 answer
4999
Arithmetics in C
In C programming language x &ndash; = y + 1 ; means (1)x= x-y+1 (2)x=-x-y-1 (3)x=-x+y+1 (4)x= x-y-1
In C programming language x &ndash; = y + 1 ; means(1)x= x-y+1(2)x=-x-y-1(3)x=-x+y+1(4)x= x-y-1
User Avatar
0 votes
2 answers
5000
What will be the output of right shift?
Consider the C function func shown below: int func(int num) { int count = 0; while (num) { count++; num>>= 1; } return (count); } The value returned by func(0235) is ________
Consider the C function func shown below: int func(int num) { int count = 0; while (num) { count++; num>>= 1; } return (count); }The value returned by func(0235) is _____...
User Avatar
Page: