Hot questions in Programming and DS

0 votes
0 answers
1701
Its always a confusion how Recursion works with for loop. Explain a brief.
0 votes
2 answers
1702
void foo(int n){ while (n! = 0) { if (!(n & 1)) printf(“*”); n = n > 1 ; }} The number of times printf(“*”) is executed, whe...
0 votes
0 answers
1703
Though parameters passed by reference , changes on "a" didn't reflect on "b" , why ?
0 votes
0 answers
1704
0 votes
1 answer
1705
How the below code snippet is working when the function black(“213”) is called?
0 votes
0 answers
1706
What is the significance of the underlined sentence ??
0 votes
0 answers
1709
implementation of queue using stack deletion of second element form fornt take O(1),when insertion take O(n) correct or not
0 votes
1 answer
1711
please explain this question
1 votes
1 answer
1712
0 votes
0 answers
1713
$a=a+100$ in function foo, does it increases the value of a by 100 or just increments the address.
0 votes
1 answer
1715
1 votes
1 answer
1716
#include<stdio.h>int main(){ int a; char *x; x = (char *) &a; a = 512; x[0] = 1; x = 2; printf("%dn",a); return 0;}
0 votes
0 answers
1717
A) (1-(N / K)) ^ r b) (1-(K / N)) ^ r c) (1+(N / K)) ^ r-1 d) (1-(K / N)) ^ r-1
–1 votes
0 answers
1718
0 votes
0 answers
1719
The number of nodes of degree one in a complete binary tree of 2$^{30}$ nodes is?(1) 2$^{29}$ +1(2) 2$^{29}$(3) 2$^{30}$(4) 1
0 votes
0 answers
1720