Register

Webpage

Programming in C. Recursion.
Filter

Most answered questions in Programming and DS

1 votes
1 answer
3481
The order in which operands are evaluated in an expression is predictable
The order in which operands are evaluated in an expression is predictable if the operator is a) * b) + c) % d) &&
The order in which operands are evaluated in an expression is predictable if the operator isa) * b) + c) % d) &&
User Avatar
0 votes
1 answer
3482
insert_front_linkedlist
User Avatar
0 votes
1 answer
3483
programming and ds
Given an algorithm: void preorder(tree *t) { if(t) { 1. if(t->data==NULL) return ; else printf(t->data); 2. preorder(t->left); 3. preorder(t->right); } } Find the number of function calls made for traversing for preorder following above algorithm,for th below given tree; A / \ B C / \ D E \ / F G
Given an algorithm:void preorder(tree *t){if(t){1. if(t->data==NULL)return ;else printf(t->data);2. preorder(t->left);3. preorder(t->right); }}Find the number of function...
User Avatar
0 votes
1 answer
3484
Gate 2006
If pointer to leaf node of max heap given, what is the time complexity to find smallest element?
If pointer to leaf node of max heap given, what is the time complexity to find smallest element?
User Avatar
1 votes
1 answer
3486
What is the result of expression 5.45 + "3.2"
What is the result of expression 5.45 + "3.2"? (a) The double value 8.6 (b) The string ""8.6" (c) The long value 8. (d) The String "5.453.2"
What is the result of expression 5.45 +"3.2"?(a) The double value 8.6 (b) The string ""8.6"(c) The long value 8. (d) The String "5.453.2"
User Avatar
0 votes
1 answer
3487
ACE-TEST
User Avatar
0 votes
1 answer
3488
output of program
Predict the output of following code segment: #include<iostream.h> Void main ( ) { int x { } = {1,2,3,4,5}; int *p,**q,*t; p=x; cout<<*p; t=x+2; q=&t; cout<<*++p <<**q <<**q <<*t;} (a) 1233 (b) 1223 (d) 1234 (d) 2345
Predict the output of following code segment: #include<iostream.h Void main ( ) { int x { } = {1,2,3,4,5}; int *p, q,*t; p=x; cout<<*p; t=x+2; q=&t; cout<<*++p << q << q ...
User Avatar
0 votes
1 answer
3491
Minheap
User Avatar
3 votes
1 answer
3492
C programming
#include <stdio.h> void A() { printf("A");}; void B() { printf("B");}; void C() { printf("C");}; void D() { printf("D");}; int main() { void (*P[4])() = {A,B,C,D}; for(int i=0;i<4;i++) (*(i+P))(); }
#include <stdio.h void A() { printf("A");}; void B() { printf("B");}; void C() { printf("C");}; void D() { printf("D");}; int main() { void (*P[4])() = {A,B,C,D}; for(int...
User Avatar
2 votes
1 answer
3493
C programming
#include <stdio.h> int foo(unsigned word) { int n = 0; int num_set_bits[16] = {0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4}; while( word > 0 ) { n += num_set_bits[ word & 0xF ]; word >>= 4; } return n; } int main() { printf("%d\n",foo(0xABC)); return 0; } Output of the above program ?
#include <stdio.h int foo(unsigned word) { int n = 0; int num_set_bits[16] = {0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4}; while( word 0 ) { n += num_set_bits[ word & 0xF ]; word >...
User Avatar
4 votes
1 answer
3494
find the output
main () { if(--i) { main (); printf("%d", i); } } 5 4 3 2 1 1 2 3 4 5 0 0 0 0 0 Compiler error
main () { if( i) { main (); printf("%d", i); } } 5 4 3 2 1 1 2 3 4 5 0 0 0 0 0 Compiler error
User Avatar
7 votes
1 answer
3496
TIFR CSE 2016 | Part B | Question: 5
Consider the recursive function $\mathsf{mc91}$ ... $\{ n: 0 \leq n \leq 110 \}$ $\{ n: 0 \leq n \leq 111 \}$ $\{ n: 0 \leq n < + \infty \}$
Consider the recursive function $\mathsf{mc91}$.int mc91(int n) { print n if (n 100) { return n-10; } else { return mc91(mc91(n+11)); } }Let $\mathsf{Out}=\{n : \text{ t...
User Avatar
0 votes
1 answer
3498
C Program Output
How is the"do" function working here? What will be the output?
How is the"do" function working here? What will be the output?
User Avatar
1 votes
1 answer
3499
C programming
int main() { int a, b; /* Some code which initializes "a" here ... */ if (a < 0) { a = -a; } b = sqrt (a); } Above code will always work for calculating the square root of any valid integer value on a system . [T/F]
int main() { int a, b; /* Some code which initializes "a" here ... */ if (a < 0) { a = -a; } b = sqrt (a); }Above code will always work for calculating the square root of...
User Avatar
3 votes
1 answer
3500
Consider an array ‘A’ with 2m elements. The elements in odd position are sorted in non-increasing order that
Consider an array ‘A’ with 2m elements. The elements in odd position are sorted in non-increasing order that is A >= A[3] >= A[5]......A[2m-1] The elements in even p...
User Avatar
Page: