Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage
Programming in C.
Recursion.
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Recent questions in Programming and DS
0
votes
0
answers
3961
ACE-2
This program shows undefined behaviour as "/" is not a sequence point and value of variable $i$ is modified more than once between two sequence points.
This program shows undefined behaviour as "/" is not a sequence point and value of variable $i$ is modified more than once between two sequence points.
thor
162
views
thor
asked
Dec 9, 2016
0
votes
0
answers
3962
ACE-1
thor
145
views
thor
asked
Dec 9, 2016
0
votes
0
answers
3963
MADE EASY TEST SERIES
Consider the following keys that are hashed into table in the order given using hash function h(i) = (2i + 5) mod11 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 5 Assume hash table has location from 0 to 10. If hash table uses chaining to handle the collisions, what is the probability of new elements ‘x’ fit inside hash table without any collision.
Consider the following keys that are hashed into table in the order given using hash functionh(i) = (2i + 5) mod1112, 44, 13, 88, 23, 94, 11, 39, 20, 16, 5Assume hash tab...
User007
414
views
User007
asked
Dec 9, 2016
9
votes
2
answers
3964
Max Heap
The number of ways , in which numbers 1,2,3,4,5 can be inserted into binary heap,such that resultant binary heap is max heap ? given ans :8
The number of ways , in which numbers 1,2,3,4,5 can be inserted into binary heap,such that resultant binary heap is max heap ?given ans :8
minal
4.0k
views
minal
asked
Dec 9, 2016
Programming in C
binary-heap
algorithms
+
–
2
votes
1
answer
3965
No. of Binary trees
FIve nodes labelled 1,2,3,4,5 are used to construct different binary trees. How many such binary trees can be constructed whose preorder traversal is 1,2,3,4,5 ?
FIve nodes labelled 1,2,3,4,5 are used to construct different binary trees. How many such binary trees can be constructed whose preorder traversal is 1,2,3,4,5 ?
Ashwani Kumar 2
1.1k
views
Ashwani Kumar 2
asked
Dec 9, 2016
5
votes
1
answer
3966
trees
jenny101
605
views
jenny101
asked
Dec 9, 2016
DS
binary-tree
+
–
1
votes
1
answer
3967
number of distinct binary search trees
The answer is given as 14.I calculated using Catalan number but the answer did not come as 14.
The answer is given as 14.I calculated using Catalan number but the answer did not come as 14.
jenny101
667
views
jenny101
asked
Dec 9, 2016
Programming and DS
binary-tree
+
–
0
votes
1
answer
3968
MADE EASY ONLINE TEST SERIES
Confusion in last printf Statement.. Can anyone explain what printf Statement want to say...
Confusion in last printf Statement..Can anyone explain what printf Statement want to say...
Kashyap Avinash
604
views
Kashyap Avinash
asked
Dec 9, 2016
0
votes
2
answers
3969
Made Easy Test Series
Step by step solution...... answer is -2
Step by step solution...... answer is -2
Kashyap Avinash
399
views
Kashyap Avinash
asked
Dec 9, 2016
1
votes
1
answer
3970
No. of vertex in a undirected graph
I think the answer to this problem is 9 whereas given answer is 8. My approach was using sum of degree theorm, 6(no. of vertex with degree 3) * 3 + x(no.of vertices which we need to find out) *( degree less than 3) = 2*|E| {|E| = 12 ... it should be 2 therefor x*2 = 6 i.e x = 3 and total vertices = 9 whereas ans.given is 8. please provide a clear explanation.
I think the answer to this problem is 9 whereas given answer is 8. My approach was using sum of degree theorm,6(no. of vertex with degree 3) * 3 + x(no.of vertices which ...
mohit chawla
434
views
mohit chawla
asked
Dec 7, 2016
7
votes
3
answers
3971
#data structure array
Consider the following C program main() { int a[2][3][2]={{{1,2},{9,8},{3,7}},{{2,2},{1,4},{5,4}}}}; printf(“%d%d%d”, (a[1]-a[0]), (a[1][0]-a[0][0]), (a[1][0][0]-a[0][0][0])); } Which of the following represents the output of above program? $3\: 3\; 1$ $3\; 6 \;1 $ $6\;6\;1$ $1\:1\:1$
Consider the following C programmain() { int a [3] ={{{1,2},{9,8},{3,7}},{{2,2},{1,4},{5,4}}}}; printf(“%d%d%d”, (a -a[0]), (a [0]-a[0][0]), (a [0][0]-a[0][0][0])); }...
papesh
1.3k
views
papesh
asked
Dec 6, 2016
0
votes
1
answer
3972
MadeEasy Test Series: Programming & DS - Hashing
anybody give detailed explnation please
anybody give detailed explnation please
Anusha Motamarri
534
views
Anusha Motamarri
asked
Dec 6, 2016
DS
made-easy-test-series
data-structures
hashing
+
–
0
votes
0
answers
3973
MadeEasy Test Series: Programming & DS - Binary Tree
Vishal Goyal
360
views
Vishal Goyal
asked
Dec 6, 2016
DS
made-easy-test-series
data-structures
binary-tree
+
–
0
votes
1
answer
3974
programing test series
Vishal Goyal
448
views
Vishal Goyal
asked
Dec 6, 2016
DS
programming-in-c
test-series
strings
+
–
0
votes
0
answers
3975
dout plz correct me
Vishal Goyal
283
views
Vishal Goyal
asked
Dec 6, 2016
DS
test-series
array
data-structures
+
–
0
votes
1
answer
3976
MadeEasy Test Series: Programming & DS - Programming
Vishal Goyal
294
views
Vishal Goyal
asked
Dec 6, 2016
Programming in C
made-easy-test-series
programming
+
–
6
votes
2
answers
3977
MadeEasy Test Series: Programming & DS - Heap
The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________.
The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________.
Vishal Goyal
731
views
Vishal Goyal
asked
Dec 6, 2016
DS
made-easy-test-series
data-structures
binary-heap
+
–
3
votes
2
answers
3978
MadeEasy Test Series: Algorithms - Heap
Consider M1 and M2 be two complete binary tree which satisfy max-heap property, each of size ‘n’. What is the time complexity to combine both M1 and M2 such that combine tree will be min heap tree? O (n log n) O (n) O (n2) O (n2 log n)
Consider M1 and M2 be two complete binary tree which satisfy max-heap property, each of size ‘n’. What is the time complexity to combine both M1 and M2 such that comb...
Vishal Goyal
1.4k
views
Vishal Goyal
asked
Dec 6, 2016
DS
made-easy-test-series
data-structures
binary-heap
time-complexity
+
–
1
votes
1
answer
3979
MadeEasy Test Series: Programming & DS - Hashing
Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’. What is the expected number of colliding pairs of elements, if we used simple uniform hashing?
Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’. What is the expected number of colliding pairs of element...
Vishal Goyal
670
views
Vishal Goyal
asked
Dec 6, 2016
DS
made-easy-test-series
data-structures
hashing
+
–
0
votes
0
answers
3980
Test Series
Number of comparison made by algorithm that inserts values in the binary search tree?In the worst case for left or right skewed tree isn;t it o(n)?
Number of comparison made by algorithm that inserts values in the binary search tree?In the worst case for left or right skewed tree isn;t it o(n)?
Sayan Das 1
252
views
Sayan Das 1
asked
Dec 6, 2016
Programming in C
binary-search-tree
+
–
Page:
« prev
1
...
194
195
196
197
198
199
200
201
202
203
204
...
309
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register