GATE 2022 Toppers Weekly Quiz 8

What will be the output of the following program?
#include <stdio.h>
void fun(int n)
{
if(n > =1)
{
fun(n-1);
printf("%d ", n);
fun(n-2);
}
}
int main()
{
fun(3);
return 0;
}

S1: An array is a collection of similar type of data items.
S2: Linked List follows contiguous memory locations.
S3: In Non-Linear data structures,the data items are not in sequence. 
S4: In Insertion Operation Underflow problem may occur.
The number of Correct Statements is/are_____

A computer on a 6 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 1 Mbps. It is initially filled to capacity with 8 megabits. How long can the computer transmit at the full 6 Mbps ________ in (sec).

In RSA algorithm the number of keys required to support both confidentiality and authentication are ________.

Consider a system having 30 instances of resources ‘R’ shared by ‘n’ processes. Each process require 4 instance of the resource. What is the maximum possible number of processes that must be allowed such that system is in a safe state ?

Which of the following is true?

Identify the Boolean function F (A, B, C, D) which is implemented by the following digital circuit.

Find the number of tokens in the following code.

printf(“gate exam = %d”, 1, 2, 3, 4 <= 5);

Consider the following, five binary strings of length 8
01010010, 11011011, 10011010, 11111011, 01110010
A hash table of size M = 8 (0 to 7) is using open addressing (initially empty) for hashing the binary strings. Also the hash function is given as h(k) = k mod Assume that finding an empty slot directly without collision or after collision is also counted as a probe. The total number of probes that occur while hashing the above 5 strings using linear probing are ________.