Time Left - 15:00 mins
NIELIT STQC 2021: Quiz-8
Attempt now to get your rank among 221 students!
Question 1
If P(A ∩ B) = 0.17, P(A′ ∩ B) =0.32, P(a ∩ B′) = 0.18, find P(A).
Question 2
A card is drawn from a pack of 52 cards. The probability of getting a queen of club or a king of heart is?
Question 3
The problem of finding a path in a graph that visits every vertex exactly once is called?
Question 4
In how many ways can 6 coins of different values be put into 2 packets?
Question 5
For a database relation R (a, b, c, d) where the domains of a, b, c and d only include atomic values, only the following functional dependency and those that can be inferred from them hold:
a → c , b→ d
The relation is in:
Question 6
What will be the equivalent hexadecimal code for (10111101100)2?
Question 7
A complete binary tree with the property that the value at each node is as least as large as the values at its children is known as
Question 8
How many distinct binary trees can be constructed with three nodes?
Question 9
The keyword used to transfer control from a function back to the calling function is:
Question 10
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;
}
}
- 221 attempts
- 0 upvotes
- 4 comments
Tags :
GATE & PSU CSGeneralJun 28GATE & PSU CS