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
1
votes
0
answers
2311
test series
Consider implementation of stack using queue by following algorithm. Let x be an element to be pushed in the stack. push(q1, x) { EQ(q1,x) while (q1 does not contain 1 element) { k= DQ(q1) EQ(q1,k) } } pop(q1) { DQ(q1) } How many enqueue and dequeue operations required to push 2 and pop 2 elements in the empty stack?
Consider implementation of stack using queue by following algorithm.Let x be an element to be pushed in the stack.push(q1, x) { EQ(q1,x) while (q1 does not cont...
kunalv
319
views
kunalv
asked
Jan 1, 2018
1
votes
1
answer
2312
made easy test series
Consider the following keys that are hashed into the hash table in the order given using the hash function H(i)=(3i+5)mod11. 12,44,13,88,23,94,11,39,20,16,5 Where to handle the collision chaining is used, after inserting all the above keys ... if 2 new keys inserted into table the what is the probability new items hashed into empty slot? (upto 2 decimal places) Please explain
Consider the following keys that are hashed into the hash table in the order given using the hash function H(i)=(3i+5)mod11.12,44,13,88,23,94,11,39,20,16,5Where to handle...
garg div
604
views
garg div
asked
Jan 1, 2018
10
votes
4
answers
2313
Hashing (Test Series)
Consider an initially empty hash table of length 10. Following set of keys are inserted using open addressing with hash function h(k) = k mod 10 and linear probing. 0 1 91 2 2 3 13 4 24 5 12 6 62 7 77 8 82 9 The number of different insertion sequence of the key values using the given hash function and linear probing will result in the hash table shown in above __________.
Consider an initially empty hash table of length 10. Following set of keys are inserted using open addressing with hash function h(k) = k mod 10 and linear probing.0 1912...
VS
3.3k
views
VS
asked
Dec 31, 2017
DS
data-structures
hashing
+
–
5
votes
2
answers
2314
Hashing
Consider a hash table with 8 slots that uses chaining for collision resolution .The table is initially empty .what is probability that after 4 keys inserted at least a chain of 3 created?
Consider a hash table with 8 slots that uses chaining for collision resolution .The table is initially empty .what is probability that after 4 keys inserted at least a ch...
Aaditya Pundir
824
views
Aaditya Pundir
asked
Dec 31, 2017
3
votes
1
answer
2315
C programming
Lakshman Bhaiya
237
views
Lakshman Bhaiya
asked
Dec 31, 2017
Programming in C
programming-in-c
+
–
3
votes
2
answers
2316
C programming
Lakshman Bhaiya
335
views
Lakshman Bhaiya
asked
Dec 31, 2017
Programming in C
programming-in-c
+
–
1
votes
1
answer
2317
output
What is the output of this C code? 1. #include <stdio.h> 2. int main() 3. { 4. int a = 10, b=20, c=30; 5. a<<2>>4; 6. b<<=2>>4; 7. if (a >> 1) 8. printf("%d %d %d\n", a, b, c<<2>>4); 9. } plz explain line number 5 & 6???
What is the output of this C code? 1. #include <stdio.h 2. int main() 3. { 4. int a = 10, b=20, c=30; 5. a<<2>>4; 6. b<<=2>>4; 7. if (a > 1) 8. printf("%d %d %d\n", a, b,...
Hira Thakur
286
views
Hira Thakur
asked
Dec 31, 2017
Programming in C
programming-in-c
+
–
1
votes
0
answers
2318
MadeEasy Test Series: Programming & DS - Heap
How to solve such a problem?
How to solve such a problem?
Kalpataru Bose
560
views
Kalpataru Bose
asked
Dec 31, 2017
DS
made-easy-test-series
data-structures
binary-heap
programming-in-c
array
+
–
0
votes
0
answers
2319
C progarmming
#include <stdio.h> int main(void) { int i = 0; char ch; while(1) { ch= *("hello world" + i); if(ch == '\0') break; putchar(ch); i++; } return 0; } What does ch= *("hello world" + i); do?
#include <stdio.h int main(void) { int i = 0; char ch; while(1) { ch= *("hello world" + i); if(ch == '\0') break; putchar(ch); i++; } return 0; }What does ch= *("hello w...
Abhishek Kumar Singh
528
views
Abhishek Kumar Singh
asked
Dec 30, 2017
Programming in C
programming-in-c
output
programming
+
–
5
votes
2
answers
2320
Double hashing
How many probes takes place to insert a sequence of numbers: 14, 17, 25, 37, 34, 16, 26, into a hash table of size 11, using Double hashing, where h(x) = x mod 11, h2(x) = x mod 7 + 1 ? I am getting collision even after using h2(x) for 16 Please somebody can explain it? Given solution :
How many probes takes place to insert a sequence of numbers: 14, 17, 25, 37, 34, 16, 26, into a hash table of size 11, using Double hashing, where h(x) = x mod 11, h2(x) ...
sunil sarode
4.3k
views
sunil sarode
asked
Dec 30, 2017
DS
hashing
data-structures
+
–
1
votes
1
answer
2321
Linked list
In a circular single linked list how many external pointers are there because in some books there are two external pointers start pointing at first node and last pointing at last node while some given only last pointer and some have only first pointer
In a circular single linked list how many external pointers are there because in some books there are two external pointers start pointing at first node and last pointing...
kd.....
945
views
kd.....
asked
Dec 30, 2017
DS
linked-list
data-structures
programming-in-c
algorithms
+
–
3
votes
0
answers
2322
Recursion
The sum of all values printed by Rec (6) is _______.
The sum of all values printed by Rec (6) is _______.
Learner_jai
733
views
Learner_jai
asked
Dec 29, 2017
5
votes
0
answers
2323
Min heap tree
Answer given : 1935360 but I m getting 3225600 please check..
Answer given : 1935360 but I m getting 3225600 please check..
vamp_vaibhav
557
views
vamp_vaibhav
asked
Dec 29, 2017
Programming in C
min
binary-heap
+
–
1
votes
0
answers
2324
AceTestSeries: Programming & DS - Programming in C
sm
287
views
sm
asked
Dec 29, 2017
Programming in C
programming-in-c
programming
pointers
+
–
0
votes
0
answers
2325
C-Output
Aditya Bahuguna
142
views
Aditya Bahuguna
asked
Dec 28, 2017
0
votes
0
answers
2326
C-Output
Aditya Bahuguna
158
views
Aditya Bahuguna
asked
Dec 28, 2017
0
votes
0
answers
2327
Stack Permutations
Aditya Bahuguna
572
views
Aditya Bahuguna
asked
Dec 28, 2017
0
votes
0
answers
2328
Const Array
Can i access array like this: const int array [5]= {10,20,30,40,50}; int *x; x=array+5; *x=6; // can i assign this value as x is pointing to some unknown location. and other array is constant. x=array+2; *x=2; // can i assign if array is constant. in both assignment any compiler error would be there ????
Can i access array like this:const int array [5]= {10,20,30,40,50};int *x;x=array+5;*x=6; // can i assign this value as x is pointing to some unknown location. and o...
nitin_kumar
258
views
nitin_kumar
asked
Dec 28, 2017
1
votes
0
answers
2329
Binary Search Tree
Is number of BST with n labeled nodes is 1? If yes, then how?
Is number of BST with n labeled nodes is 1? If yes, then how?
Swati Rauniyar
408
views
Swati Rauniyar
asked
Dec 28, 2017
1
votes
0
answers
2330
C-Output
Consider a linked list of length n is implemented using a circular array P[0, n - 1], two variables first and last are used to point the first and last element of the list present in array respectively i.e., first = P and last = (P + x) mod ... : S1: Delete kth element in linked list. S2: Reverse the elements of linked list. What is the time complexity of above two operations respectively?
Consider a linked list of length n is implemented using a circular array P[0, n – 1], two variables first and last are used to point the first and last element of the l...
Aditya Bahuguna
134
views
Aditya Bahuguna
asked
Dec 28, 2017
Page:
« prev
1
...
111
112
113
114
115
116
117
118
119
120
121
...
309
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register