ISRO CS 2020

Last Updated :
Discuss
Comments

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

  • {u, v, w, x}

  • { }

  • {u, v, w, x, y, z}

  • {u, v, w}

  • None of these

Question 2

Minimum number of NAND gates required to implement the following binary equation (A'+B')(C+D), ISRO 2020

  • 4

  • 5

  • 3

  • 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 ?

  • 1/N

  • (N-1)/N

  • 1/K

  • (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

  • 90, 0

  • 45, 0

  • 10, 10

  • 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

  • 3

  • 2

  • 4

  • 1

Question 6

Raymonds tree based algorithm ensures

  • no starvation, but deadlock may occur in rare cases

  • no deadlock, but starvation may occur

  • neither deadlock nor starvation can occur

  • deadlock may occur in cases where the process is already starved

Question 7

The Master theorem

  • assumes the subproblems are unequal sizes

  • can be used if the subproblems are of equal size

  • cannot be used for divide and conquer algorithms

  • cannot be used for asymptotic complexity analysis

Question 8

The minimum height of an AVL tree with n nodes is

  • Ceil (log2 (n + 1))

  • 1.44 log2 n

  • Floor (log2 (n + 1))

  • 1.64 log2 n

Question 9

What is the in-order successor of 15 in the given binary search tree ?


  • 18

  • 6

  • 17

  • 2

Question 10

Consider the following circuit The function by the network above is, ISRO 2020

  • (AB)'E + EF + (CD)'F

  • (E' + ABF')(C + D + F')

  • ((AB)' + E)(E' + F')(C + D + F')

  • (A + B)E' + (EF)' + CDF'

Tags:

There are 80 questions to complete.

Take a part in the ongoing discussion