Which of the following code will generate unique random numbers every time?
A.
#include <stdlib.h>
int main()
{
srand(0);
printf("%d\n", rand()%50);
return 0;
}B.
#include <stdlib.h>
int main()
{
srand(time(0));
printf("%d\n", rand()%50);
return 0;
}C.
#include <stdlib.h>
int main()
{
srand(1);
printf("%d\n", rand()%50);
return 0;
}D.
#include <stdlib.h>
int main()
{
printf("%d\n", rand()%50);
return 0;
}Answer: Option B
Related Questions on Miscellaneous on Data Structures
Which data structure is used to implement a binary heap efficiently?
A. Array
B. Linked List
C. Stack
D. Queue
In which scenario would you use a Bloom Filter?
A. For implementing a stack-based algorithm
B. To maintain a balanced binary tree
C. For efficient sorting of elements
D. To test membership in a large dataset
A. Queue
B. Stack
C. Heap
D. Array

Join The Discussion