ISRO CS 2009

Question 71

If the pdf of a Poisson distribution is given by f(x) = (e^-22^x)/x!, then its mean is

• 2^x
• 2
• -2
• 1

Question 72

If G is a graph with e edges and n vertices, the sum of the degrees of all vertices in G is

• e
• e/2
• e²
• 2 e

Question 73

A one dimensional array A has indices 1....75. Each element is a string and takes up three memory words. The array is stored at location 1120 decimal. The starting address of A[49] is

• 1267
  

• 1164
  

• 1264
  

• 1169
  

Question 74

The five items: A, B, C, D, and E are pushed in a stack, one after other starting from A. The stack is popped four items and each element is inserted in a queue. The two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is

• A
• B
• C
• D

Question 75

Consider a binary tree with n nodes, where each node can have at most two children. The height of the tree is defined as the maximum number of edges between the root node and any leaf node. Which of the following statements is true regarding the height h of this binary tree?

• The height of the tree is always equal to n-1.

• The height of the tree can be greater than or equal to n-1.

• The height of the tree is always equal to log₂(n).

• The height of the tree can be greater than or equal to log₂(n).

Question 76

The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?

• 2
• 3
• 4
• 6

Question 77

Consider a system having "n" resources of same type. These resources are shared by 3 processes, A, B, C. These have peak demands of 3, 4, and 6 respectively. For what value of "n" deadlock won\'t occur

• 15
• 9
• 10
• 11

Question 78

The infix expression A + (B - C)* D is correctly represented in prefix notation as

• A + B − C ∗ D
• + A ∗ − B C D
• A B C − D ∗ +
• A + B C − D ∗

Question 79

SHA-1 is a

• encryption algorithm
• decryption algorithm
• key exchange algorithm
• message digest function

Question 80

In networking, UTP stands for

• Unshielded T-connector port
• Unshielded twisted pair
• Unshielded terminating pair
• Unshielded transmission process