- Courses
- Tutorials
- Practice
- Jobs
ISRO CS 2020
Question 1
If A = {x, y, z} and B = {u, v, w, x}, and the universe is {s, t, u, v, w, x, y, z}. Then (A U B') ∩ (A ∩ B) is equal to
- A
{u, v, w, x}
- B
{ }
- C
{u, v, w, x, y, z}
- D
{u, v, w}
- E
None of these
Question 2
Minimum number of NAND gates required to implement the following binary equation (A'+B')(C+D), ISRO 2020
- A
4
- B
5
- C
3
- D
6
Question 3
Of the following, which best approximates the ratio of the number of non-terminal nodes in the total number of nodes in a complete K-ary tree of depth N ?
- A
1/N
- B
(N-1)/N
- C
1/K
- D
(K-1)/K
Question 4
In a class definition with 10 methods, to make the class maximally cohesive, number of direct and indirect connections required among the methods are
- A
90, 0
- B
45, 0
- C
10, 10
- D
45, 45
Question 5
Consider the following pseudo-code:
I = 0; J = 0; K = 8;
while (I < K – 1) //while-1
{
J = J + 1;
while (J < K) //while-2
{
if (x[I] < x[J])
{
temp = x[I];
x[I] = x[J];
x[J] = temp;
}
} // end of while-2
I = I +1;
} // end of while-1
The cyclomatic complexity of the above is
- A
3
- B
2
- C
4
- D
1
Question 6
Raymonds tree based algorithm ensures
- A
no starvation, but deadlock may occur in rare cases
- B
no deadlock, but starvation may occur
- C
neither deadlock nor starvation can occur
- D
deadlock may occur in cases where the process is already starved
Question 7
The Master theorem
- A
assumes the subproblems are unequal sizes
- B
can be used if the subproblems are of equal size
- C
cannot be used for divide and conquer algorithms
- D
cannot be used for asymptotic complexity analysis
Question 8
The minimum height of an AVL tree with n nodes is
- A
Ceil (log2 (n + 1))
- B
1.44 log2 n
- C
Floor (log2 (n + 1))
- D
1.64 log2 n
Question 9
What is the in-order successor of 15 in the given binary search tree ?
- A
18
- B
6
- C
17
- D
2
Question 10
Consider the following circuit 
The function by the network above is, ISRO 2020
- A
(AB)'E + EF + (CD)'F
- B
(E' + ABF')(C + D + F')
- C
((AB)' + E)(E' + F')(C + D + F')
- D
(A + B)E' + (EF)' + CDF'
There are 80 questions to complete.
