Time Left - 15:00 mins
NIELIT STQC 2021 Quiz-59
Attempt now to get your rank among 181 students!
Question 1
What is the formula used in quadratic probing?
Question 2
What is the time complexity of following code:
int a = 0;
for (i = 0; i < N; i++)
{
for (j = N; j > i; j--)
{
a = a + i + j;
}
}
Question 3
On a set A = {a, b, c, d} a binary operation * is defined as given in the following table.
The relation is:
Question 4
Which of the following statements are true?
I. Shortest remaining time first scheduling may cause starvation
II. Pre-emptive scheduling may cause starvation
III. Round robin is better than FCFS in terms of response time
Question 5
Q. Which of the following scheduling algorithms could result in starvation?
I. FCFS
II. SJF
III. Round Robin
IV. Priority
Question 6
In a cricket team of three batsman A,B,C, team loose the match if all the three batsman gets out. The probability of batsman for getting out will be 0.3, 0.4 and 0.5 respectively, then find the probability that team will win the match.
Question 7
One movie ticket is drawn at random from a bag containing 28 tickets numbered 1 to 28. Find the probability to obtain a ticket containing number which is multiple of 3.
Question 8
The convergence of the bisection method is
Question 9
The minimum number of flip-flops that can be used to construct a modulus-5 counter is __________
Question 10
To store n-bit in n-bit PIPO register ______ clock pulse is required.
- 181 attempts
- 1 upvote
- 2 comments
Tags :
GATE & PSU CSGeneralJun 19GATE & PSU CS
