Answers by vizzard110 / GATE Overflow for GATE CSE

3 votes

1

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...

863 views

answered Jan 18, 2020

1 votes

2

Peter Linz Edition 4 Exercise 6.1 Question 6 (Page No. 161)
Eliminate useless productions from $S\rightarrow a|aA|B|C,$ $A\rightarrow aB|\lambda,$ $B\rightarrow Aa,$ $C\rightarrow cCD,$ $D\rightarrow ddd.$

Eliminate useless productions from$S\rightarrow a|aA|B|C,$$A\rightarrow aB|\lambda,$$B\rightarrow Aa,$$C\rightarrow cCD,$$D\rightarrow ddd.$

513 views

answered Sep 24, 2019

0 votes

3

Please help
Can someone plz help me understand union find algo? Or provide a good resource other thah GfGeeks,for this

Can someone plz help me understand union find algo?Or provide a good resource other thah GfGeeks,for this

350 views

answered Sep 15, 2019

0 votes

4

The recurrence relation for MAX-HEAPIFY function of heapsort algorithm is T(n) <= T(2n/3) + O(1). How is it 2n/3 ?

11.3k views

answered Jun 18, 2019

0 votes

5

MadeEasy Full Length Test 2019: Combinatory - Permutations And Combinations
The number of ways 5 letter be put in 3 letter boxes A,B,C. If letter box A must contain at least 2 letters.

The number of ways 5 letter be put in 3 letter boxes A,B,C. If letter box A must contain at least 2 letters.

1.5k views

answered Mar 19, 2019

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true