Register
Filter

Answers by prateekdwv

3 votes
42
If we store n keys in a hash table of size m=n^2 , then what is the probability of any collision ?
The hash function is randomly chosen from a universal class of hash functions , then what is the probability of any collision ?
The hash function is randomly chosen from a universal class of hash functions , then what is the probability of any collision ?
4 votes
43
Output and please explain
#include<stdio.h> int main() { char *s = "Geeks Quiz"; int n = 7; printf("%.*s", n, s); return 0; }
#include<stdio.h>int main(){char *s = "Geeks Quiz";int n = 7;printf("%.*s", n, s);return 0;}
2 votes
44
Full outer join
3 votes
45
UGC NET CSE | December 2015 | Part 3 | Question: 42
In an operating system, indivisibility of operation means: Operation is interruptable Race Condition may occur processor can not be prempted All of the above
In an operating system, indivisibility of operation means:Operation is interruptableRace Condition may occurprocessor can not be premptedAll of the above
1 votes
46
data structure
describe in details
describe in details
Page: