Register

Webpage

Programming in C. Recursion.
Filter

Hot questions in Programming and DS

3 votes
1 answer
3481
#cicular queue
User Avatar
0 votes
3 answers
3483
C programming
#include<stdio.h> int main() { int a=10,b=20,c=30; c==a==b; Printf("%d%d%d",a,b,c); return0;}
#include<stdio.h>int main(){ int a=10,b=20,c=30;c==a==b;Printf("%d%d%d",a,b,c);return0;}
User Avatar
0 votes
0 answers
3484
C programing
User Avatar
0 votes
0 answers
3485
Data structure
Answer given is 132 but on geeks for geeks solution is http://www.geeksforgeeks.org/number-of-ways-to-traverse-an-n-ary-tree/. Which is correct
Answer given is 132 but on geeks for geeks solution is http://www.geeksforgeeks.org/number-of-ways-to-traverse-an-n-ary-tree/. Which is correct
User Avatar
0 votes
0 answers
3486
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
1 votes
1 answer
3487
Array
A tridiagonal matrix [-2..2,5..9] is stored in row major order with base address 301.what is the address of data [0][8] if nonzero elements are stored??
A tridiagonal matrix [-2..2,5..9] is stored in row major order with base address 301.what is the address of data [0][8] if nonzero elements are stored??
User Avatar
0 votes
0 answers
3488
madeeasy work book
Assume that a lower traingular matrix A[0.....n-1,0...n-1] is stored in a linear array B [0....1/2 n (n+1)-1] in row by row order for n=100 if A[0,0] is stored inB[0] where is A[90,80] stored in B array??
Assume that a lower traingular matrix A[0.....n-1,0...n-1] is stored in a linear array B [0....1/2 n (n+1)-1] in row by row order for n=100 if A[0,0] is stored inB[0] whe...
User Avatar
3 votes
1 answer
3489
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
0 votes
2 answers
3492
internet
consider the following declarations 1.int a[5]={1,2,3,4,5}; 2.int *p=(int*) malloc(sizeof(int)*5); which is true a.statement 1 take less tym than statement 2 for execution. b.statement 2 takes more tym than 1 for execution. c.both takes same tyme. d.cannot say about execution time.
consider the following declarations1.int a[5]={1,2,3,4,5};2.int *p=(int*) malloc(sizeof(int)*5);which is truea.statement 1 take less tym than statement 2 for execution.b....
User Avatar
0 votes
1 answer
3494
Find output of the program
#include<stdio.h> int main() { int a=2; if(a==2) { a=~a+2<<1; printf("%d",a); } }
#include<stdio.h>int main(){ int a=2;if(a==2){ a=~a+2<<1; printf("%d",a);}}
User Avatar
1 votes
1 answer
3496
data structure
In a hash table of size 6, currently the locations 0, 2, 4 and 5 are occupied. The probability of a new record going into location 1, with a hash function resolving collisions by linear probing is (assume uniform hashing). (A) 2/3 (B) 1/3 (C) 1 (D) 1/6
In a hash table of size 6, currently the locations 0, 2, 4 and 5 are occupied. The probability of a new record going into location 1, with a hash function resolving colli...
User Avatar
0 votes
1 answer
3497
Prograaming bits
What is the output of the following C program? #include <stdio.h> void main (void) { int shifty; shifty = 0570; shifty = shifty » 4; shifty = shifty « 6; printf("The value of shifty is %o \n",shifty); }
What is the output of the following C program? #include <stdio.h void main (void) { int shifty; shifty = 0570; shifty = shifty » 4; shifty = shifty « 6; printf("The val...
User Avatar
3 votes
1 answer
3498
2. Linked List
Consider the given Doubly Linked List: Consider C like language code snippet with respect to doubly linked list given "p" is pointer to linked list node p=first->next->next->next->prev; p->next->next->prev=p; printf("%d",p->next->next->prev->next->data); What is the output?Plz explain
Consider the given Doubly Linked List:Consider C like language code snippet with respect to doubly linked list given"p" is pointer to linked list nodep=first->next->next-...
User Avatar
5 votes
2 answers
3499
infix to prefix
Convert following infix to prefix expression e^d-a*b^f/g+h*c/i+j-k Explain each step
Convert following infix to prefix expressione^d-a*b^f/g+h*c/i+j-kExplain each step
User Avatar
1 votes
1 answer
3500
doubt programming
difference between #define and typedef ??? please give logical answer not general answer
difference between #define and typedef ???please give logical answer not general answer
User Avatar
Page: