Predict the output of the following code.
#include <stdlib.h>
int main()
{
srand(0);
printf("%d\n", rand()%50);
return 0;
}
#include <stdlib.h>
int main()
{
srand(0);
printf("%d\n", rand()%50);
return 0;
}A. compilation error
B. random number between 0 to 50 (both inclusive)
C. random number between 0 to 51 (both inclusive)
D. random number between 0 to 49 (both inclusive)
Answer: Option D
This Question Belongs to Data Structure >> Miscellaneous On Data Structures
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