Register

Webpage

Programming in C. Recursion.
Filter

Recent questions in Programming and DS

2 votes
1 answer
2541
Operators precedence
The output of the following program main ( ) { int a = 1, b = 2, c = 3; printf (“%d”, a+ = (a+ = 3, 5, a)); }
The output of the following programmain ( ){int a = 1, b = 2, c = 3;printf (“%d”, a+ = (a+ = 3, 5, a));}
User Avatar
4 votes
0 answers
2542
Arrays
main ( ) { static char [3] [4] = {“abcd”, “mnop”, “fghi”}; putchar (**a); }
main ( ){static char [3] [4] = {“abcd”, “mnop”, “fghi”};putchar ( a);}
User Avatar
1 votes
1 answer
2544
pointers
#include void fun(int *p) { int q = 10; p = &q; } int main() { int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0; }
#includevoid fun(int *p){int q = 10; p = &q;}int main(){int r = 20;int *p = &r;fun(p);printf("%d", *p);return 0;}
User Avatar
0 votes
0 answers
2545
trees
The number of possible ordered trees with 3 nodes A, B, C is:
The number of possible ordered trees with 3 nodes A, B, C is:
User Avatar
0 votes
1 answer
2546
Programming
Explain with example call by name parameter passing
Explain with example call by name parameter passing
User Avatar
0 votes
2 answers
2547
C program
The number of possible m, such that m&0x3F equals 0x23?
The number of possible m, such that m&0x3F equals 0x23?
User Avatar
0 votes
2 answers
2548
internet
consider the following declarations 1.int a[5]={1,2,3,4,5}; 2.int *p=(int*) malloc(sizeof(int)*5); which is true a.statement 1 take less tym than statement 2 for execution. b.statement 2 takes more tym than 1 for execution. c.both takes same tyme. d.cannot say about execution time.
consider the following declarations1.int a[5]={1,2,3,4,5};2.int *p=(int*) malloc(sizeof(int)*5);which is truea.statement 1 take less tym than statement 2 for execution.b....
User Avatar
0 votes
1 answer
2549
height of a tree
For the height of the tree for gate what should we consider the number of edges from the root the leaf or number of levels.????
For the height of the tree for gate what should we consider the number of edges from the root the leaf or number of levels.????
User Avatar
0 votes
1 answer
2550
output of the program
main( ) { double x, d = 5.0; int y ; x = d * (x = 2.5/d); printf(“x=%lf\n”,x); x = d*(y=(int)2.5+1.5); printf("x=%lf y=%d\n",x,y); } What is output of above program?
main( ){double x, d = 5.0;int y ;x = d * (x = 2.5/d);printf(“x=%lf\n”,x);x = d*(y=(int)2.5+1.5);printf("x=%lf y=%d\n",x,y);}What is output of above program?
User Avatar
0 votes
1 answer
2551
Output of program
What is the output of following program? int i ; main ( ) { int j; for (; ;) { if (j = function (i)) printf (“j = %d \n”, j) else break; } } function (x) { int x ; static int v = 2; v - - ; return (v – x); } j = 1 j = - 1 j = 2
What is the output of following program?int i ;main ( ){int j;for (; ;){if (j = function (i))printf (“j = %d \n”, j)elsebreak;}}function (x){int x ;static int v = 2;v...
User Avatar
4 votes
4 answers
2552
Number of binary search trees
How many different binary search trees can be constructed using six distinct keys? 256 128 132 264
How many different binary search trees can be constructed using six distinct keys? 256 128 132 264
User Avatar
1 votes
0 answers
2556
linked list
Let P be a single linked list.Let Q be a pointer to an intermediate node 'X' in the list.What is the worst case time complexity of best known algorithm to delete the node 'X ' from the list
Let P be a single linked list.Let Q be a pointer to an intermediate node 'X' in the list.What is the worst case time complexity of best known algorithm to delete the node...
User Avatar
0 votes
2 answers
2558
Help to clarify
int *A[10]; Now, what is meant by A[2][3]?
int *A[10];Now, what is meant by A [3]?
User Avatar
0 votes
1 answer
2559
recursion
void abc() { auto int a; static int s; a=s++; printf("%d%d",a,s); if(a<=2) abc(); printf("%d%d",a,s); } void main() { abc(); abc(); } how many times printf will execute??
void abc(){auto int a;static int s;a=s++;printf("%d%d",a,s);if(a<=2)abc();printf("%d%d",a,s);}void main(){abc();abc();}how many times printf will execute??
User Avatar
2 votes
1 answer
2560
endian
int main() { int a = 300; char *b = (char *)&a; *++b = 2; printf("%d ",a); return 0; } Consider the size of int as two bytes and size of char as one byte.Machine is little-endian O/P_________ a=300-->(00000001 00101100)2 now b will point to 00101100 *++b = 2; what will this do ?
int main() { int a = 300; char *b = (char *)&a; *++b = 2; printf("%d ",a); return 0; }Consider the size of int as two bytes and size of char as one byte.Machine is little...
User Avatar
Page: