Recent questions in Programming and DS

0 votes
1 answer
211
Which data structure would be most appropriate to implement a collection of values with the following 3 characteristicsSingly link list with head and tail pointerDoubly l...
1 votes
0 answers
213
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same h...
0 votes
0 answers
214
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same h...
0 votes
1 answer
215
Can there be “Stack Overflow” in Linked list Implementation of stack? If Yes, how?
–4 votes
2 answers
216
*MSQ*The following figure depicts a a. A tree and only treeb. A tree with 3 nodesc. A graph (Since every tree is a graph)d. A graph and only graph
1 votes
2 answers
219
The return value of ace(4) is int ace(int a) { int x=1; static int k=1; if(a==1) return x; for(;k<a;++k) x=x+ace(k)*ace(a-k); return x; }A.15B.4C.10D.Error
0 votes
1 answer
220
1 votes
0 answers
222
Given a skew tree what will be the time complexity to balance the tree? What will be the algorithm for this?
1 votes
1 answer
223
An object whose contents cannot be changed once the object is created is called:(a) Immutable object(b) Mutable object(c) Smart object(d) Rich object
0 votes
1 answer
224
i have typed the following code but when i executed it the solution was not according to my expectation.unsigned short int y= -9; int iy=y; printf(“%d”,iy); solutio...
0 votes
0 answers
225
0 votes
1 answer
226
I am getting 5 as output, but the answer is 4, please verify
0 votes
0 answers
227
I want to know which evaluation is wrong here:a-b-c = ab-c- or a-b-c = abc- –a * b *c = ab*c* a*b*c = abc 3 . a+b-c = ab+c- a+b-c = ...
0 votes
2 answers
228
#include <stdio.h int main(){ int a[] = {5,3,7,2,4}; int *p = &a[3]; p -= *p; printf("%d ",*p); return 0; } output is 3.Why 2 * sizeof(int) is doene.?
0 votes
1 answer
229
Can we determine unique tree by Inorder and level order traversal .
0 votes
0 answers
230