Register

Webpage

Programming in C. Recursion.
Filter

Recent questions in Programming and DS

0 votes
0 answers
2501
C programing
User Avatar
0 votes
1 answer
2502
C programing
Count the no. Of token and also explain the token count rule? printf("i=%d,&i=%x",i&i);
Count the no. Of token and also explain the token count rule?printf("i=%d,&i=%x",i&i);
User Avatar
0 votes
1 answer
2503
Isro nielit gate
n=3 a[++n]=n++ Output : a[4]=4. How? Please explain it
n=3a[++n]=n++ Output : a[4]=4. How?Please explain it
User Avatar
0 votes
2 answers
2504
Programming doubt
What will be output if you will compile and execute the following c code? #include<stdio.h> int main(){ char c=125; c=c+10; printf("%d",c); return 0; } (A) 135 (B) 115 (C) -121 (D) -8 (E) Compiler error
What will be output if you will compile and execute the following c code? #include<stdio.h>int main(){char c=125;c=c+10;printf("%d",c); return 0;}(A) 135(B) 115(C) -121(D...
User Avatar
0 votes
0 answers
2505
Tree data structure
How many binary trees are possible with given preorder:- ABCD And given postorder:- cdba
How many binary trees are possible with given preorder:- ABCDAnd given postorder:- cdba
User Avatar
0 votes
0 answers
2506
data structure
what is complexity 1)to convert infix to prefix 2) to convert infix to postfix 3)convert infix to prefix using stack plz someone tell?
what is complexity1)to convert infix to prefix 2) to convert infix to postfix 3)convert infix to prefix using stackplz someone tell?
User Avatar
0 votes
0 answers
2507
Timothy Williams - Programming Output
static char hello[]='hello'; printf("%s",hello); The output will be same as- puts("hello"); puts(hello); printf("%s", "hello"); puts("hello\n"); Answer is 1,2 and 3. Can anyone tell what's the problem with 4 option? It is also printing hello.
static char hello[]='hello'; printf("%s",hello);The output will be same as-puts("hello");puts(hello);printf("%s", "hello");puts("hello\n");Answer is 1,2 and 3.Can anyone ...
User Avatar
0 votes
0 answers
2510
Hashing
What is clustering effect in hashing How quadratic and pseudorandom method of hashing works What is the difference between chaining and linklist method of hashing
What is clustering effect in hashing How quadratic and pseudorandom method of hashing worksWhat is the difference between chaining and linklist method of hashing
User Avatar
0 votes
1 answer
2513
Binary Search Tree
A search was performed on some binary search tree. Which of the following is a valid search sequence? (A) 1, 11, 111, 98, 58, 78, 90, 48, 88 (B) 333, 33, 53, 93, 63, 90, 70, 88 (C) 8, 888, 18, 98, 38, 78, 90, 48, 88 (D) 555, 5, 55, 95, 45, 65, 75, 88
A search was performed on some binary search tree. Which of the following is a valid search sequence?(A) 1, 11, 111, 98, 58, 78, 90, 48, 88(B) 333, 33, 53, 93, 63, 90, 70...
User Avatar
1 votes
1 answer
2514
Programming and data structures
Please explain the working of pointers in this question. I'm unable to understand how we are getting this answer.
Please explain the working of pointers in this question. I'm unable to understand how we are getting this answer.
User Avatar
0 votes
0 answers
2515
madeasy test series
The minimum size that an array may require to store a binary tree with ‘n’ nodes is _______. A log$2^{log_{2}(n+1)} -1$ B 2^{n}-1 C n + 1
The minimum size that an array may require to store a binary tree with ‘n’ nodes is _______.A log$2^{log_{2}(n+1)} -1$B 2^{n}-1C n + 1
User Avatar
0 votes
0 answers
2516
Data structure
Which of the following statement are true? 1. Computing the most frequently occurring elements in an array a(1....n) can be done in o(nlogn) time.
Which of the following statement are true?1. Computing the most frequently occurring elements in an array a(1....n) can be done in o(nlogn) time.
User Avatar
1 votes
1 answer
2517
ace test series
suppose given size of short int =2, char is 1 and of int is 4B int main() { short int i=20; charc=97; printf("%d,%d,%d",sizeof(i),sizeof(c),sizeof(c+i)); return o; } output of program is a)2,1,2 b)2,1,4 c)2,2,8 d)2,1,1
suppose given size of short int =2, char is 1 and of int is 4B int main(){short int i=20;charc=97;printf("%d,%d,%d",sizeof(i),sizeof(c),sizeof(c+i));return o;}output of ...
User Avatar
0 votes
1 answer
2519
data structure
to find the maximum elements in a min heap represnted by an array can be computed in ____________ time a. theta n b.theta n2 c.theta nlogn d.theta 1
to find the maximum elements in a min heap represnted by an array can be computed in ____________ timea. theta nb.theta n2c.theta nlognd.theta 1
User Avatar
0 votes
0 answers
2520
data structtures
complexity of algorithm to interchange the nth and mth element (node) of singly link list is: a.m+n b.m if m>=n otherwise n c.m if m<=n otherwise n d.m+min(m,n) ans given c???????????how
complexity of algorithm to interchange the nth and mth element (node) of singly link list is:a.m+nb.m if m>=n otherwise nc.m if m<=n otherwise nd.m+min(m,n)ans given c?...
User Avatar
Page: