Register

Webpage

Programming in C. Recursion.
Filter

Recent questions in Programming and DS

0 votes
0 answers
2381
C programming
User Avatar
0 votes
0 answers
2382
huffman coding
Assume that letters p, q, r, s, t and q have probabilities 1/2, 1/4, 1/8, 1/16, 1/32 and 1/32 respectively. The difference in the average length of the message without and with using Huffman’s coding is ______ . (upto 2 decimal places)
Assume that letters p, q, r, s, t and q have probabilities 1/2, 1/4, 1/8, 1/16, 1/32 and 1/32 respectively. The difference in the average length of the message without an...
User Avatar
0 votes
0 answers
2383
C Prog
#include<stdio.h> int reverse(int); int main() { int num=4; reverse(num); return 0; } int reverse(num) { if(num==0) return 0; else printf("%d",num); reverse(num--); } What is the output ?
#include<stdio.h int reverse(int); int main() { int num=4; reverse(num); return 0; } int reverse(num) { if(num==0) return 0; else printf("%d",num); reverse(num ); }What i...
User Avatar
1 votes
2 answers
2384
C PROGRAMMING
Assuming no syntax error:
Assuming no syntax error:
User Avatar
0 votes
1 answer
2385
general C programming doubt
How to work on such question ? Answer is : 19 #include <stdio.h> int main() { int i = 4, ans; ans = ++i + ++i + ++i; printf("%d\n", ans); return 0; }
How to work on such question ? Answer is : 19#include <stdio.h>int main() { int i = 4, ans; ans = ++i + ++i + ++i; printf("%d\n", ans); return 0;}
User Avatar
0 votes
0 answers
2386
data structure
The number of permutations can be obtained in the output using stack assuming that input contains elements 1, 2, 3, 4, 5, 6 in any order such that 3 will poped out from stack at 3rd position are _______ (assume one element enter in stack only one time)
The number of permutations can be obtained in the output using stack assuming that input contains elements 1, 2, 3, 4, 5, 6 in any order such that 3 will poped out from s...
User Avatar
0 votes
0 answers
2387
C Programming
#include<stdio.h> int main() { int a[2][2][2]={10,2,3,4,5,6,7,8}; int *p,*q; p=&a[1][1][1]; q=(int*)a; //Please explain this line printf("%d%d"*p,*q); return 0; } Why we are doing typecasting here and what will be returned after type cast to q?
#include<stdio.h int main() { int a ={10,2,3,4,5,6,7,8}; int *p,*q; p=&a ; q=(int*)a; //Please explain this line printf("%d%d"*p,*q); return 0; }Why we are doing type...
User Avatar
5 votes
1 answer
2388
INSERTION IN AVL
Which of the following is highest upper bound that represents the time complexity of inserting an object into AVL tree with n-nodes. It must be 0(logn) right. What would be answer if it asked that element is continuously inserting in to a AVL tree.
Which of the following is highest upper bound that represents the time complexity of inserting an object into AVL tree with n-nodes.It must be 0(logn) right.What would be...
User Avatar
8 votes
1 answer
2389
Number of Binary tree
Q.Consider a four labeled 1, 2, 3, 4. The number of distinct binary tree are possible such that whose inorder traversal is 1, 2, 3, 4 are _________ Answer must be 14 right ?
Q.Consider a four labeled 1, 2, 3, 4. The number of distinct binary tree are possible such that whose inorder traversal is 1, 2, 3, 4 are _________Answer must be 14 right...
User Avatar
0 votes
1 answer
2391
Zeal Test Series 2018: Programming & DS - Binary Search Trees
Given an initially empty Binary search tree how many different order of insertion order A,B,C,D,E,F,G that returns minimum height tree?
Given an initially empty Binary search tree how many different order of insertion order A,B,C,D,E,F,G that returns minimum height tree?
User Avatar
1 votes
2 answers
2392
Pointers
Plz Explain with a diagram .
Plz Explain with a diagram .
User Avatar
0 votes
0 answers
2393
Question
Insert these element in avl tree 15,20,24,10,13,7,30,36,25 And then delete 24,20 Please explain step by step I am confuse
Insert these element in avl tree15,20,24,10,13,7,30,36,25And then delete 24,20Please explain step by stepI am confuse
User Avatar
1 votes
1 answer
2396
c programming
Consider the following function: int f(int n) { staticint i=1; if(n>5)return n; n=n+i; return f(n); } The value of f(1) is:
Consider the following function:int f(int n){staticint i=1;if(n>5)return n;n=n+i;return f(n);}The value of f(1) is:
User Avatar
0 votes
1 answer
2397
c programming
#include<stdio.h> void main() { printf("Hello\b\b\b\b\b"); printf("Hi!\b\b\bBye"); }
#include<stdio.h>void main(){printf("Hello\b\b\b\b\b");printf("Hi!\b\b\bBye");}
User Avatar
0 votes
1 answer
2398
cprogramming
#include<stdio.h> void main() { printf("Hello\b\b\b\b\b"); printf("Hi!\b\b\bBye"); }
#include<stdio.h>void main(){printf("Hello\b\b\b\b\b");printf("Hi!\b\b\bBye");}
User Avatar
6 votes
3 answers
2399
ISRO-2017
Q.A strictly binary tree with 10 leaves A) cannot have more than 19 nodes B) has exactly 19 nodes C)has exactly 17 nodes D) has exactly 20 nodes
Q.A strictly binary tree with 10 leavesA) cannot have more than 19 nodesB) has exactly 19 nodesC)has exactly 17 nodesD) has exactly 20 nodes
User Avatar
Page: