Mission NIELIT-2017 MiniMock -3 (All Subject) for GATE & PSU CS Exams

Question 1

Direction: In the following questions choose the word opposite in meaning to the given word.

Antagonism:

Question 2

Direction: In each of the following letter series, some of the letters are missing which are given in that order as one of the alternatives below it. Choose the correct alternative.

aaa_ bb_aab_baaa_bb

Question 3

Direction: In each of the following questions, one term in the number series is wrong. Find out the wrong term.

125, 126, 124, 127, 123, 129

Question 4

Which of the following algorithms sort in integers, having the range 0 to

in ascending order in

time?

Question 5

Direction: The following, questions consist of two words each that have a certain relationship to each other, followed by four lettered pairs of words. Select the lettered pairs of words. Select the lettered pairs that has the same relationship as the original pair of words.

Identity : Anonymity

Question 6

Direction: In each of the following questions, three out of four althernatives contain alphabet placed in a particular form. Find the one that does not belong to the group.

Question 7

Which of the following statements is true for Branch – and – Bound search?

Question 8

The travelling salesman problem can be solved in:

Question 9

Loop unrolling is a code optimization technique:

Question 10

Which of the following is the most powerful parring method?

Question 11

X.25 is ________ Network.

Question 12

The unlicensed National Information Infrastructure band operates at the _________ frequency

Question 13

The CPU of a system having 1 MIPS execution rate needs 4 machine cycles on an average for executing an instruction. The fifty percent of the cycles use memory bus. A memory read/write employs one machine cycle. For execution of the programs, the system utilizes 90 percent of the CPU time. For block data transfer, an IO device is attached to the system while CPU executes the background programmes continuously. What is the maximum IO data transfer rate if programmed IO data transfer technique is used?

Question 14

The post order traversal of a binary search tree is BDEFCA. Find out the pre-order traversal.

Question 15

Which of the following permutations can be obtained in the output using a stack of size 3 elements assuming that input, sequence is 1, 2, 3, 4, 5?
A. 3, 2, 1, 5, 4
B. 5, 4, 3, 2, 1
C. 3, 4, 5, 2, 1
D. 3, 4, 5, 1, 2

Question 16

What is Granularity?

Question 17

If a relation with a Schema R is decomposed into two relations R₁ and R₂ such that

then which one of the following is to be satisfied for a lossless joint decomposition (

indicates functional dependency)

Question 18

A Boolean function F is called self-dual if and only if

How many Boolean functions of degree n are self-dual?

Question 19

Consider a full-adder with the following input values:
(a)

and

(carry input) = 0
(b)

and

Compute the values of S(sum) and (carry output) for the above input values.

Question 20

In propositional logic

is equivalent to (Where ~ denotes NOT):

Question 21

Which of the following arguments are not valid?
(a) “If Gora gets the job and works hard, then he will be promoted. If Gora gets the promotion, then he will be happy. He will not be happy, therefore, either he will not get the job or he will not work hard”.
(b) “Either Puneet is not guilty or Pankaj is telling the truth. Pankaj is not telling the truth, therefore, Puneet is not guilty”.
(c) If n is a real number such that n>1 then n²>1 Suppose that n²>1 then n>1.

Question 22

Which of the following is not open source software?

Question 23

The factors that determine the quality of a software system are

Question 24

A specific editor has 200 K of Program text, 15 K of Initial stack, 50 K of Initial-ized data, and 70 K of Bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used?

Question 25

Consider the following page trace:
4,3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5
number of page fault that would occur if FIFO page replacement algorithm is used with number of frames is 4 .