Register

Webpage

Programming in C. Recursion.
Filter

Most viewed questions in Programming and DS

0 votes
2 answers
1891
C programming
a=4 and b=3 printf("%d",a+++b); output.?? My doubt is that we will read from left as a++ or as ++b.
a=4 and b=3printf("%d",a+++b);output.??My doubt is that we will read from left as a++ or as ++b.
User Avatar
3 votes
1 answer
1892
Program1
const int perplexed = 2; #define perplexed 3 main() { #ifdef perplexed #undef perplexed #define perplexed 4 #endif printf("%d",perplexed); } a. 0 b. 2 c. 4 d. none of the above
const int perplexed = 2; #define perplexed 3 main() { #ifdef perplexed #undef perplexed #define perplexed 4 #endif printf("%d",perplexed); }a. 0 b. 2 c. 4 d. none of the...
User Avatar
3 votes
1 answer
1893
Output of program
Consider the following code int main(){ char *str = "ABCDEF"; printf("%d",fun(str)); return 0; } int fun(int *p1){ int *p2 = p1; while(*++p1); return (p2-p1); } The output of given program is_________. Assume object of data type int occupies 2 bytes.
Consider the following codeint main(){ char *str = "ABCDEF"; printf("%d",fun(str)); return 0; } int fun(int *p1){ int *p2 = p1; while(*++p1); return (p2-p1); }The output ...
User Avatar
1 votes
1 answer
1894
c programming
User Avatar
3 votes
1 answer
1896
Algorithms
I am having a doubt in this question. The binary search algorithm is implemented using recursion. Then the space complexity is :- (1) O( 1 ) (2) O( n ) (3) O( logn ) (4) O(n logn ) According to me, the answer should be option 2. Please explain the solution as well.
I am having a doubt in this question. The binary search algorithm is implemented using recursion. Then the space complexity is :-(1) O( 1 )(2) O( n )(3) O( logn )(4) O(n ...
User Avatar
0 votes
1 answer
1897
Linked list time complexity
I think it should be O(L).
I think it should be O(L).
User Avatar
3 votes
2 answers
1898
Stack
I am getting a) as ans. Plz tell how C?
I am getting a) as ans. Plz tell how C?
User Avatar
0 votes
1 answer
1899
C programming/ predict the output
main() { int c=- -2; printf("c=%d",c); }
main() { int c=- -2; printf("c=%d",c); }
User Avatar
0 votes
1 answer
1902
Matrix Multiplication
Consider three matrices A (10 × 100), B (100 × 5), C (5 × 50). What is total number of multiplications required? Your Answer: 500 Correct Answer: 7500 Status: incorrect
Consider three matrices A (10 × 100), B (100 × 5), C (5 × 50). What is total number of multiplications required?Your Answer:500Correct Answer: 7500 Status: incorrec...
User Avatar
2 votes
1 answer
1903
Could any one explain me How to derive formula in RMO CMO ?
There has to be a general method in deriving equations based on RMO and CMO . Could any one explain me how to derive formula of RMO and CMO of important matrices like Upper Triangular Lower Triangular S matrice z matrix Diagonal MAtrix etc
There has to be a general method in deriving equations based on RMO and CMO .Could any one explain me how to derive formula of RMO and CMO of important matrices likeUpper...
User Avatar
0 votes
0 answers
1904
Depth First Search
User Avatar
1 votes
1 answer
1905
Programming
n=3; printf("%d %d",n++,++n); 1) 3 5 b) 4 5 c) 4 4 d) implementation dependent
n=3;printf("%d %d",n++,++n);1) 3 5b) 4 5c) 4 4d) implementation dependent
User Avatar
8 votes
2 answers
1906
Data structure
Ttotal number of BST's possible with 6 nodes numbered 1,2,3,4,5 and 6 having a height of 4 are ??
Ttotal number of BST's possible with 6 nodes numbered 1,2,3,4,5 and 6 having a height of 4 are ??
User Avatar
1 votes
1 answer
1907
why output is 300?
#include <stdio.h> int main(void) { int i; char *p=(char *)&i; ++p; (*p)=2; printf("%d",i); return 0; }
#include <stdio.h>int main(void){ int i; char *p=(char *)&i; ++p; (*p)=2; printf("%d",i); return 0;}
User Avatar
0 votes
1 answer
1909
Priority queue stack
How to implement Priority queue using stack?What will be time complexity for Enqueue and Dequeue operations? Edit:- Updated the question clearly
How to implement Priority queue using stack?What will be time complexity for Enqueue and Dequeue operations?Edit:- Updated the question clearly
User Avatar
1 votes
1 answer
1910
Hashing
using Method : Fold shift , we can find key then what use of Fold shift in Hashing
using Method : Fold shift , we can find keythen what use of Fold shift in Hashing
User Avatar
Page: