Register

Webpage

Programming in C. Recursion.
Filter

Hot questions in Programming and DS

1 votes
1 answer
1711
made-easy-test-series
Consider the following C function: void foo(int n) { while(n!=0) { if(!(n&1)) printf("*"); n=n>>1; } } The number of times printf (“*”) statement is executed, when the value $2^{24}$ is passed to the function foo().
Consider the following C function:void foo(int n) { while(n!=0) { if(!(n&1)) printf("*"); n=n>>1; } }The number of times printf (“*”) statement is executed, when the ...
User Avatar
0 votes
0 answers
1712
Made Easy Test Series
User Avatar
0 votes
0 answers
1713
Made easy TS question
The correct answer as you can see is given bellow but I think the condition a[k]>a[max] is wrong instead a[k]<a[max] is correct… someone please check it….!
The correct answer as you can see is given bellow but I think the condition a[k]>a[max] is wronginstead a[k]<a[max] is correct…someone please check it….!
User Avatar
0 votes
0 answers
1715
uppcl_2018
how the o/p came?
how the o/p came?
User Avatar
–1 votes
1 answer
1718
ME Test series
When searching for a key value 50 in a BST, nodes containing key values 10,30,40,70,90,120.150.175 are traversed in any order . The number of different orders possible in which these key values can occur in search path from the root to the value containing 50 are ________
When searching for a key value 50 in a BST, nodes containing key values 10,30,40,70,90,120.150.175 are traversed in any order . The number of different orders possible in...
User Avatar
0 votes
0 answers
1719
Made Easy DS doubt
IS IT CORRECT…??
IS IT CORRECT…??
User Avatar
0 votes
0 answers
1720
ME Test Series
User Avatar
0 votes
0 answers
1721
Self Doubt:Call by name
main() { int ar[5],a=0; ar={4,5,6,0,3} fun(ar[a],ar[ar[a]) } // will the called function be resolved to fun(0,3) at compile time ?? [Code Optimization:Folding]
main(){int ar[5],a=0; ar={4,5,6,0,3}fun(ar[a],ar[ar[a])}// will the called function be resolved to fun(0,3) at compile time ?? [Code Optimization:Folding]
User Avatar
1 votes
3 answers
1724
Made Easy test series DS
The number of binary search trees possible with 12 keys, when keys 1, 2, 3, 4, ........ 12 are inserted into empty Binary Search Tree with condition such that 4 is the root of binary search tree and 8 is immediate right child of 4 are ________.
The number of binary search trees possible with 12 keys, when keys 1, 2, 3, 4, ........ 12 are inserted into empty Binary Search Tree with condition such that 4 is the r...
User Avatar
0 votes
1 answer
1725
No Book
Which of the following data structure is efficient to implement priority queue with basic operation such as insertion, deletion and searching? A) Linked list B) Sorted array C) Heap D) Hash table
Which of the following data structure is efficient to implement priority queue with basic operation such as insertion, deletion and searching?A) Linked listB) Sorted arra...
User Avatar
0 votes
0 answers
1726
ME testseries
User Avatar
2 votes
0 answers
1729
MadeEasy Subject Test 2019: Programming & DS - Stack
I THING THERE IS MISTAKE BECAUSE BRACKET ARE CLOSING AFTER ELEMENT E SO ALL OPERATORS HOULD BE POPED AND AND ACCORDING TO ME ANWER SHOLD BE 2… TRY AND CORRECT IF I M WRONG !!!! THANKS IN ADVANCE!!!
I THING THERE IS MISTAKE BECAUSE BRACKET ARE CLOSING AFTER ELEMENT E SO ALL OPERATORS HOULD BE POPED AND AND ACCORDING TO ME ANWER SHOLD BE 2…TRY AND CORRECT IF I M WR...
User Avatar
1 votes
0 answers
1730
Please tell me the logic for x = 3 > 2 > 1;
What is the logic behind this code. #include <stdio.h> void main() { int x; x = 3 > 2 > 1; printf("%d", x); return; }
What is the logic behind this code.#include <stdio.h void main() { int x; x = 3 2 1; printf("%d", x); return; }
User Avatar
Page: