Register

Webpage

Programming in C. Recursion.
Filter

Recent questions in Programming and DS

1 votes
1 answer
2481
Heap Deletion
For searching an element from heap,then delete it from heap Why will it take O(n+log n) time and not O(n log n) time?
For searching an element from heap,then delete it from heapWhy will it take O(n+log n) time and not O(n log n) time?
User Avatar
0 votes
0 answers
2482
gateforum test series
User Avatar
1 votes
0 answers
2484
gateforum booklet
Consider inserting the key 10,22,31,4,15,28,17,88,59 using open addressing technique into hash table of length m=11 with hash function h(k)= k mod 11 what is no of collisions encountered? A) 7 B) 10 C)12 D) none of these given ans is d is it right?
Consider inserting the key 10,22,31,4,15,28,17,88,59 using open addressing technique into hash table of length m=11 with hash function h(k)= k mod 11 what is no of colli...
User Avatar
2 votes
1 answer
2485
Pointer arithmetic
What is the output of the following ? int main() { int arr[2][3][2]={1,2,3,4,5,6,7,8,9,10,11,12}; printf("%d%d", a[1]-a[0], a[1][0]-a[0][0]); return 0; }
What is the output of the following ?int main(){int arr [3] ={1,2,3,4,5,6,7,8,9,10,11,12};printf("%d%d", a -a[0], a [0]-a[0][0]);return 0;}
User Avatar
1 votes
2 answers
2486
MadeEasy Test Series: Programming & DS - Trees
assume the preorder tŕaversal of binary tree is "abc" how many total different binary trees are possible whose postorder traversal.is "cba" with the given preorder traversal.?? how to find it ?
assume the preorder tŕaversal of binary tree is "abc" how many total different binary trees are possible whose postorder traversal.is "cba" with the given preorder trave...
User Avatar
0 votes
0 answers
2487
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
0 votes
1 answer
2488
madeeasy work book
https://gateoverflow.in/?qa=blob&qa_blobid=12037309044418228871 someone plz solve this question??
https://gateoverflow.in/?qa=blob&qa_blobid=12037309044418228871someone plz solve this question??
User Avatar
0 votes
0 answers
2490
self doubt
void Do(struct*node head) { if(!head)return; printf("%d",head->data); Do(head->next); } so which statement follow which inside bracket i am getting doubt?? if we give 2->4->8->5 then what it will print??
void Do(struct*node head){ if(!head)return; printf("%d",head->data); Do(head->next);} so which statement follow which inside bracket i am getting doubt??if we...
User Avatar
1 votes
1 answer
2491
return type
What is the default return type in C? i) void ii) int iii) double iv) long int
What is the default return type in C?i) voidii) intiii) doubleiv) long int
User Avatar
0 votes
0 answers
2492
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
1 answer
2493
pointer
int *p, A[3]={0,1,2}; p=A; *(P+2)=5; p=A++; *P=7; what are the values stored in the atray A from index 0 to index 2 after execution of the above cod?
int *p, A[3]={0,1,2};p=A;*(P+2)=5;p=A++;*P=7; what are the values stored in the atray A from index 0 to index 2 after execution of the above cod?
User Avatar
0 votes
0 answers
2494
self doubt
The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted into binary heap. Such that resulted binary heap is max heap ________.
The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted into binary heap. Such that resulted binary heap is max heap ________.
User Avatar
0 votes
1 answer
2496
data structure
What will be the output of following C program, if int takes 16 bits to store. Int a=60; printf(“%d”,~a);
What will be the output of following C program, if int takes 16 bits to store.Int a=60;printf(“%d”,~a);
User Avatar
0 votes
1 answer
2497
Programming
int func(int a) { if(a<=0) return a; else { printf(a); func(a-2); printf(a); func(a-3); } } #include<stdio.h> int main(void) { int a=6; func(a); } what will be the sum of all values that printed ?
int func(int a) { if(a<=0) return a; else { printf(a); func(a-2); printf(a); func(a-3); } } #include<stdio.h int main(void) { int a=6; func(a); }what will be the sum of a...
User Avatar
0 votes
0 answers
2499
ISRO GATE
The solution given to this question is : How can z=5? According to me it should be 100
The solution given to this question is :How can z=5? According to me it should be 100
User Avatar
0 votes
0 answers
2500
output of program
User Avatar
Page: