Sudo Placement [1.5]

Question 1

A draining pipe takes half an hour to completely drain a tank when used alone. When it is used together with a filling pipe it takes 30 minutes to fill the tank completely. How long the filling pipe will take to fill the tank completely when used alone?

• 10 min
• 12 min
• 15 min
• 20 min

Question 2

What is the highest power of 3 in 99! ?

• 45
• 46
• 47
• 48

Question 3

A task is assigned to Ram and Shyam both but Ram was on leave for starting 5 days. After that both finished the same work in 10 days. If Shyam can finish the work in 12 days alone then how many days will Ram take alone to complete the task?

• 30 days
• 60 days
• 90 days
• 120 days

Question 4

A convoy of 40 cars occupy a parking containing 6 rows of parking space where every row contain 10 parking. If parking takes place randomly then, what is the probability that the 4th parking in 4 row will be empty?

• 1
• 1/2
• 1/3
• 0

Question 5

A and B started running on a circular track (in the same direction) of 300 m with speed 2 m / s and 3 m / s respectively. After how much time they will meet at starting point for the first time?

• 2 min
• 3 min
• 4 min
• 5 min

Question 6

Which of the following standard algorithms is not Dynamic Programming based?

• Bellman Ford Algorithm for single source shortest path
• Floyd Warshall Algorithm for all pairs shortest paths
• 0-1 Knapsack problem
• Prim\'s Minimum Spanning Tree

Question 7

Which of the following operations cannot be performed using bitwise operators?

• Division

• Modulus

• Left Shift

• Right Shift

Question 8

Which of the following bitwise operations will always return a bitwise complement of x for any given unsigned integer x?

• x ^ (x & (~x))

• x & (x | (~x))

• x | (x & (~x))

• x ^ (x | (~x))

Question 9

A matrix M(3 × 5) is to be stored in column-major order in a computer. If the base address of the matrix is 1000 and the size of each element is 4 bytes, then what will be the address of M(2, 3)?

(A) 1028
(B) 1188
(C) 1204
(D) 1220

• 1028

• 1188

• 1204

• 1220

Question 10

A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is

• O(n log n)

• O(n² + log n)

• O(n² log n)

• O(n²)