Register

Webpage

Programming in C. Recursion.
Filter

Hot questions in Programming and DS

0 votes
0 answers
3082
Stack Permutations
User Avatar
1 votes
0 answers
3083
Self Doubt
Given Only one of the traversal(pre,post,in) can we identify other remaining traversals using given traversals. AND if not, can we Atleast cross check from optio s given(trial and error method).
Given Only one of the traversal(pre,post,in) can we identify other remaining traversals using given traversals.AND if not, can we Atleast cross check from optio s given(...
User Avatar
2 votes
0 answers
3084
me test series
what is the output of above code using call by copy restore??????/is call by is in gate syllabus
what is the output of above code using call by copy restore??????/is call by is in gate syllabus
User Avatar
2 votes
0 answers
3085
programming & DS
Which of the following is true? A When stack is implemented using two queues, then insertion will take O(1) time while deletion will take O(n) time. B When stack is implemented using linked list, then insertion and deletion will take O(1) time C Stack is used to implement breadth first search D Both (a) and (b)
Which of the following is true?AWhen stack is implemented using two queues, then insertion will take O(1) time while deletion will take O(n) time.BWhen stack is implement...
User Avatar
–1 votes
0 answers
3086
ACE TEST
User Avatar
0 votes
1 answer
3087
Order Of Evaluation
What is the output generated by this code? main(){ int i=0; printf("%d %d %d %d %d %d %d", i++, ++i, i, i++, i, ++i, i++); } 4 4 3 2 2 2 0 4 5 5 2 5 5 0 0 2 2 2 2 4 4 Compiler Dependent
What is the output generated by this code?main(){ int i=0; printf("%d %d %d %d %d %d %d", i++, ++i, i, i++, i, ++i, i++); }4 4 3 2 2 2 04 5 5 2 5 5 00 2 2 2 2 4 4Compiler...
User Avatar
2 votes
0 answers
3089
c programming
#include<stdio.h> int main() { char arr[5][7][6]; char *p[5][7][6]; printf("%d\t", (unsigned)(arr+1)-(unsigned)arr); printf("%d", (unsigned)(p+1)-(unsigned)p); }
#include<stdio.h>int main(){char arr[5][7][6];char *p[5][7][6];printf("%d\t", (unsigned)(arr+1)-(unsigned)arr);printf("%d", (unsigned)(p+1)-(unsigned)p);}
User Avatar
2 votes
0 answers
3091
Programming language
Please explain in detail
Please explain in detail
User Avatar
1 votes
0 answers
3092
#of BST
Find number of BST's possible with 6 nodes numbered 1,2,3,4,5 and 6 having 6 as root and height of 4 ? please explain in detail ...
Find number of BST's possible with 6 nodes numbered 1,2,3,4,5 and 6 having 6 as root and height of 4 ?please explain in detail ...
User Avatar
27 votes
3 answers
3093
GATE CSE 2004 | Question: 37
The elements $32, 15, 20, 30, 12, 25, 16,$ are inserted one by one in the given order into a maxHeap. The resultant maxHeap is
The elements $32, 15, 20, 30, 12, 25, 16,$ are inserted one by one in the given order into a maxHeap. The resultant maxHeap is
User Avatar
1 votes
0 answers
3094
Made easy Test
User Avatar
1 votes
1 answer
3095
programming &DS
User Avatar
0 votes
0 answers
3096
test series
User Avatar
0 votes
0 answers
3097
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
1 answer
3099
GATE | GATE MOCK 2017
Consider an array consisting of –ve and +ve numbers. What would be the worst time comparisons an algorithm can take in order to segregate the numbers having same sign altogether i.e all +ve on one side and then all -ve on the other ? (A) N-1 (B) N (C) N+1 (D) (N*(N-1))/2
Consider an array consisting of –ve and +ve numbers. What would be the worst time comparisons an algorithm can take in order to segregate the numbers having same sign a...
User Avatar
–1 votes
1 answer
3100
DS COMPLETE BINARY TREE
IS IT A CBT?
IS IT A CBT?
User Avatar
Page: