Register

Webpage

Programming in C. Recursion.
Filter

Most viewed questions in Programming and DS

2 votes
0 answers
5101
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
0 votes
0 answers
5103
Advance test algorithms
i am getting 36 please confirm given answer is 15
i am getting 36 please confirm given answer is 15
User Avatar
0 votes
1 answer
5104
Arrays
If we take a 1-D array b[10] b is the pointer to 1st element of array because b has the address of 1st element of array...but sizeof(b) will give the size of whole array rather than just giving the size of single pointer b ...can anyone explain the reason for that?
If we take a 1-D array b[10] b is the pointer to 1st element of array because b has the address of 1st element of array...but sizeof(b) will give the size of whole array ...
User Avatar
1 votes
1 answer
5105
Binary
We are given a set of n distinct elements and an unlabelled binary tree with n nodes.how many ways can we populate the tree with the given set so that it becomes a BST 0 1 n! 2nCn / (n+1)
We are given a set of n distinct elements and an unlabelled binary tree with n nodes.how many ways can we populate the tree with the given set so that it becomes a BST01n...
User Avatar
0 votes
0 answers
5106
What do you interpret from question?
It took me hell a lot of time. Still cann't figure out question??
It took me hell a lot of time. Still cann't figure out question??
User Avatar
0 votes
0 answers
5107
........
User Avatar
0 votes
0 answers
5108
#self doubt
1) How many stacks are needed to implement a queue . 2) How many queue are needed to implement a stack.
1) How many stacks are needed to implement a queue .2) How many queue are needed to implement a stack.
User Avatar
0 votes
1 answer
5109
Made Easy programming and DS
What is the expected number of probes for an unsuccessful search for an open address hash table with 10000 slots containing 9800 entries? a)4 b)10 c)20 d)50
What is the expected number of probes for an unsuccessful search for an open address hash table with 10000 slots containing 9800 entries?a)4b)10c)20d)50
User Avatar
1 votes
2 answers
5110
test_series
Data structure BST I thinks answer is 2 either ascending or descending
Data structure BST I thinks answer is 2 either ascending or descending
User Avatar
0 votes
1 answer
5112
Test by Bikram | Programming | Test 2 | Question: 20
How many TOKENS are there in the statement answer $=(5*q-p*p)/3$; ? $13$ $12$ $15$ $14$
How many TOKENS are there in the statement answer $=(5*q-p*p)/3$; ?$13$$12$$15$$14$
User Avatar
0 votes
1 answer
5113
Ace test series
User Avatar
0 votes
1 answer
5115
which is correct....
which of the permutation o/p can't be obtained using stack for the i/p sequence 1,2,3,4,5 in that order <a>1,2,3,4,5 <b>1,2,5,4,3 <c>1,2,5,3,4 <d>1,2,4,5,3
which of the permutation o/p can't be obtained using stack for the i/p sequence 1,2,3,4,5 in that order<a>1,2,3,4,5 <b>1,2,5,4,3<c>1,2,5,3,4 <d>1,2,4,5,3
User Avatar
1 votes
1 answer
5116
c programming
#include <stdio.h> int main() { int i = -1; int x = (unsigned char)i; printf("%d", x); return 0; } output is 255 , but please explain how
#include <stdio.h int main() { int i = -1; int x = (unsigned char)i; printf("%d", x); return 0; }output is 255 , but please explain how
User Avatar
1 votes
1 answer
5117
c programming
main( ) { double x, d = 5.0; int y ; x = d * (x = 2.5/d); printf(“x=%lf\n”,x); x = d*(y=(int)2.5+1.5); printf("x=%lf y=%d\n",x,y); } What is output of above program?
main( ){double x, d = 5.0;int y ;x = d * (x = 2.5/d);printf(“x=%lf\n”,x);x = d*(y=(int)2.5+1.5);printf("x=%lf y=%d\n",x,y);}What is output of above program?
User Avatar
1 votes
2 answers
5119
doubt
User Avatar
0 votes
1 answer
5120
#uppcl
Q. The expressions are evaluated ____________ according to the precedence of set operators. A. from left to right B.from right to left C.as per user defined specification D.from bottom to up
Q. The expressions are evaluated ____________ according to the precedence of set operators.A. from left to rightB.from right to leftC.as per user defined specificationD.f...
User Avatar
Page: