IIIT Hyderabad Practice Quiz: Mini Mock-4 for GATE & PSU CS Exams

Question 1

In a cricket team of three batsman A,B,C, team loose the match if all the three batsman gets out. The probability of batsman for getting out will be 0.3, 0.4 and 0.5 respectively, then find the probability that team will win the match.

Question 2

56 men can complete a piece of work in 24 days, In how many days can 42 men complete the same piece of work ?

Question 3

Alfred buys an old scooter for Rs. 4700 and spends Rs. 800 on its repairs. If he sells the scooter for Rs. 5800, his gain percent is:

Question 4

If in the English alphabet, all the letters at odd-numbered positions are written in serial order from left to right followed by the letters at even-numbered positions written in reverse order, which letter will be sixth to the left of seventeenth letter from left

Question 5

A tank is filled by three pipes with uniform flow. The first two pipes operating simultaneously fill the tank in the same time during which the tank is filled by the third pipe alone. The second pipe fills the tank 5 hours faster than the first pipe and 4 hours slower than the third pipe. The time required by the first pipe is

Question 6

On rolling a dice 2 times, the sum of 2 numbers that appear on the uppermost face is 8. What is the probability that the first throw of dice yields 4?

Question 7

A speaks truth in 70% cases and B speaks truth in 85% cases. The probability that they speak the same fact is ______ .

Question 8

Two dice are thrown. Find the probability that the numbers appeared have a sum 8 if it is known that the second die always exhibits 4.

Question 9

Three coins are tossed simultaneously. The probability that they will fall two heads and one tail is

Question 10

Given P(A) = 0.4, P(B) = 0.7 and P(B/A) = 0.6. Find P(A ∪ B).

Question 11

The worst case running time of Insertion sort, Merge sort and Quick sort, respectively, are:

Question 12

A machine needs a minimum of 100 sec to sort 1000 names by quick sort. The minimum time needed to sort 100 names will be approximately _____ sec

Question 13

In a binary max heap containing n numbers, the smallest element can be found in time

Question 14

An element in an array X is called a leader if it is greater than all elements to the right of it in X. The best algorithm to find all leaders in an array.

Question 15

Consider an array consisting of the following elements in unsorted order (placed randomly), but 60 as first element.
60, 80, 15, 95, 7, 12, 35, 90, 55
Quick sort partition algorithm is applied by choosing first element as pivot element. How many total number of arrangements of array integers is possible preserving the effect of first pass of partition algorithm.

Question 16

Consider the following function:

Which of the following implemented by above function when function is passed to root of any binary tree?

Question 17

Consider the following functions, foo() and bar():

int foo(int n)

{

if (n <= 1) return 2ⁿ;

return 8*foo(n - 1);

}

int bar (int n)

{

if (n <= 1) return 3ⁿ;

return 3*bar(n - 1) + 2*bar(n -1);

}

The time complexity of the functions foo() and bar() is

Question 18

We can perform operation like insert, delete, concatenate and rearrange substrings in…………

Question 19

Given an array A[2][2][2], let the address of A be 100.
After executing following code what will be the output? (assume integer takes 4 bytes memory )
int main()
{
int A[2][2][2] = { { {2,4},{6,8} }, { {10,12},{14,16} } };
printf(“%d %d %d”, A,*(**A + 2), ***(A+1) );
}

Question 20

We have a program that reads 200 integers in the range (0,50). If the program prints frequency of the each integer above 30 and less than or equal to 50, then what would be the best way for program to store the frequencies?

Question 21

Consider the following relational database:

Employee (eno , ename, address, basic-salary)

Project (pno, pname,number-of-people)

Works-For (pno, eno, job)

SELECT ename

FROM Employee

WHERE eno IN

(SELECT eno

FROM Works-For

GROUP BY eno

HAVING COUNT(*)=

(SELECT COUNT(*)

FROM Project))

It returns the name of employees working on:

Question 22

Let a function F which has 3 input variables (x,y,z). The function F will be high only when atleast two of the input variables are set to high. Draw the K-Map for the given function and find its boolean expression :

Question 23

If f1(a, b, c) = Σ (0,1,6,7)

f2(a, b, c) = Σ (2,3,4,5) . Then what are the variable that f1 + f2 is free from?

Question 24

The minimum number of NAND and NOR gates required to realise EX-OR gate:

Question 25

Let the size of congestion window of a TCP connection be 30 KB . When the time-out occurs maximum segment size used is 2 KB . If the time taken by TCP connection to get 31 KB congestion window is 480 msec then which of the following represent the round trip time of connection?

Question 26

Interrupt generated through the problem of stack overflow is of the type ______.

Question 27

The size of the data count register of a DMA controller is 16 bits. The processor needs to transfer a file of 29,154 kilobytes from disk to main memory. The memory is byte addressable. The minimum number of times the DMA controller needs to get the control of the system bus from the processor to transfer the file from the disk to main memory is __________.

Question 28

Which of the following is not a characteristic of the transparent DMA mode of I/O operation?

Question 29

Which one of the following is not a client server application?

Question 30

Which of the following is /are NOT a Interior Gateway Protocol.
I. RIP
II. OSPF
III. BGP