Mission ISRO-2017 Day 31 : Demo MockTest for GATE & PSU CS Exams

Question 1

Which of the following statement is false?

Question 2

Consider the following statements.

:Greedy algorithm exists

:Dynamic programming algorithm exists

: Exhibit optimal substructure property.
Which of the above statements are true for 0-1 knapsack problem?

Question 3

The LCM and the HCF of the numbers 28 and 42 are in the ratio

Question 4

Which of the following sorting methods will be the best, it the number of swapping done, is the only measure of efficiency?

Question 5

In a network of LANs connected by bridges, packets are sent from one LAN to another through intermediate bridges. Since more than one path may exist between two LANs, packets may have to be routed through multiple bridges. Why is the spanning tree algorithm used for bridge-routing?

Question 6

On receiving an interrupt from an I/O device, the CPU

Question 7

The performance of a pipelined processor suffers if

Question 8

Match the following groups:
Group-I:
(P) SMTP
(Q) BGP
(R) TCP
(S) PPP
Grouo-II:
(1) Application layer
(2) Transport layer
(3) Data link layer
(4) Network layer
(5) Physical layer

Question 9

A two way set associative cache has lines of 16 byte and a total cache size of 8 K bytes. The 256 M byte main memory is byte addressable. Which one of the following main memory block is mapped on to the set ‘0’ of the cache memory?

Question 10

Consider the following statements:
A multiplexer
1. selects one of the several inputs and transmit it to a single output.
2. routes the data from a single input to one of many output
3. converts parallel data into serial data.
4. is a combinational circuit
Which of the statements are correct?

Question 11

Given

. What is the value of base x?

Question 12

Let G be an arbitrary graph with n nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie between.

Question 13

Let f(x) be the continuous probability density function of a random variable x. The probability that a <x $Description: E:\Gate\isro-cs\ISRO-CS-2009_files\image024.png$ b, is

Question 14

If the mean of a normal frequency distribution of 1000 items is 25 and its standard deviation is 2.5, then its maximum ordinate is

Question 15

TCP has

Question 16

Which of the following is not a solution to the critical section problem?

Question 17

By which Charter Act, the East India Company's monopoly of trade with China came to an end?

Question 18

In delete operation of binary search tree, we need inorder successor (or predecessor) of a node when a node to be deleted where it has both left and right child. Which of the following is true about inorder successor needed in delete operation?

Question 19

Suppose an array implementation of stack with nine items are pushed into the stack stored at array [1] through array [9]. Where does the push operation place the new entry in the array?

Question 20

What is the output of the following program?
int main ( )
{
char *str = “Gate2015”
printf (“%d”, gradeup (str)) ;
return 0;
}

int gradeup (char *P1)
{
char *P2 = P1 ;
while (*++P1) ;
return (P1 – P2);
}

Question 21

Let

Prefix and suffix operations over the language L is used to perform the following.

Quotient operation (/) is also used in the above. How many strings are exist in the language X?

Question 22

Which of the following are regular sets?
I.
II.
III.
IV. Assume c is a special input symbol

Question 23

A relational schema for a train reservation database is given below
Passenger (pid, pname, age)
Reservation (pid, cass, tid)
Table : Passenger

Table: Reservation

What pids are returned by the following SQL query for the above instance of the tables?
SELECT pid
FROM Reservation
WHERE class = 'AC' AND
EXISTS (SELECT *
FROM Passenger
WHERE age > 65 AND
Passenger . pid = Reservation.pid)

Question 24

Let X be the adjacency matrix of a graph G with no self loops. The entries along the principal diagonal of X are

Question 25

What are the time complexities of preorder, inorder, and level order binary tree traversals with both recursive and iterative algorithms?

Question 26

Assume

and

are matrices where

How many minimum number of multiplications required to perform the following operation?

Question 27

Consider the following sets os items for some CFG produced while constructing LR (1) parser.
Set 1 (State):
A →a.{b}
B→ba.{b,c}
Set 2 (State):
A→B.a {$}
B →aB.{b}
Each item has look-a-head part which is computed using CLR (1) parser.
Assume the grammar has follow sets for non-terminals as: Follow (A)={A,b} and follow (B) = {b,c}.
Which of the following can be concluded from above two states of CLR (1). [Assume all other states are not in conflict].

Question 28

Consider the following CFG.
S

aAb|eb
A

e|f
Find the number of states in LR(0) construction.

Question 29

Match List-I with List-II and select the correct answer using the codes given below the lists:
List-I (Frame)
A- PERGE FRAME
B- DAT FRAME
C- BECKON FRAME
List-II (Functionally OR Purpose)
1- Sent by Monitor to ensure unique MAC address in LAN
2- Frame sent to indicate link breakage
3- Sent by Monitor to clear corrupted or stray frames

Question 30

Which algorithm is used to shape the bursty traffic into a fixed rate traffic by averaging the data rate?

Question 31

Which of the following transmission media is not readily suitable to CSMA operation?

Question 32

Sharana Basaveshwara temple is located in which state of India?

Question 33

In each of the following questions, a series is given, with one term/number/letter missing. Choose the correct alternative from the given ones that will complete the series.

LXF, MTJ, NPN, OLR, ?

Question 34

Which of the following statements is TRUE about an SQL query?

A: An SQL query can contain a HAVING clause only if it has a GROUP BY clause
B: All attributes used in the GROUP BY clause must appear in the SELECT clause

Question 35

Consider the following statement
P : Canonical cover may not be unique.
Q :

Canonical cover of F is unique.
Which of the following is correct?

Question 36

Buses arrive at a specified stop at 15 minute intervals starting at 7 AM.if a passenger arrives at the stop at a random time between 7:00 and 7:30 AM, then the probability that the passenger waits less than 6 minutes is _______.

Question 37

The value of f’(1), if
$Description: E:\Gate\SSC JE Mechanical Part 1\Made Easy Questions\05_Engg-Math_BLok_files\image138.png$
Is ___________.

Question 38

Which of the following matrices is not invertible?

Question 39

Let P(S) denotes the power set of set S. Which of the following is always true?

Question 40

A relation R is defined on ordered pairs of integers as follows:
(x, y) R(u, v) if x < u and y > v. Then R is:

Question 41

Let P and V be semaphore operations. P represents wait and V represents signal operation. Counting semaphore variable S is initialized to 1 and no blocked processes in the system. If the following operations are performed in the given order then what is the value of S?
P, V, P, V, V, P, P, V, V, V, P, V, V, V, P, P

Question 42

Which of the following item is not a part of Process Control Block (PCB)?

Question 43

Consider a system with 4 processes and 3 resources. Total resources in the system given as:

Assume the system has following information.

Which of the following is correct statement when above system runs the deadlock avoidance algorithm?

Question 44

Which of the following are equivalent to the statement?

Question 45

Consider the following program.
variable l;
procedure My (K: integer)
begin
K = K + 1;
print A.;
end
procedure R ( )
var l ;
begin
l = 5;
My (l);
print (l);
end;
begin
l = 3;
My (l);
R( );
print (l);
end
Find the output produced by above program using dynamic scoping, and all functions uses call by value.

Question 46

Consider the following postorder and Inorder traversals of binary tree.
Post order: 1, 2, 5, 4, 7, 6, 3, 9, 11, 10, 8
In order: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11
Find the total number of nodes that have height greater than the height of node 6. Assume root is at lowest height.

Question 47

Let P, Q and R be three atomic prepositional assertions. Let X denote (P v Q) → R and Y denote (P → R) v (Q → R). Which one of the following is a tautology?

Question 48

Consider the grammar
E → E + n | E × n | n
For a sentence n + n × n, the handles in the right-sentential form of the reduction are

Question 49

Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For example, 001110 and 011001 are in the language, but 100010 is not. All strings of length less than 3 are also in the language. A partially completed DFA that accepts this language is shown below.

The missing arcs in the DFA are

Question 50

Which among the following information is correct forcomposite index?

Question 51

Direction:In the following question, out of the four alternatives, select the alternative which best expresses the meaning of the Idiom/Phrase.

As the situation got out of control, the speaker of the parliament tried to put oil over troubled waters.

Question 52

In Boolean algebra, rule (X+Y)(X+Z) =

Question 53

Consider the following logical inferences.
I₁: If it rains then the cricket match will not be played.
The cricket match was played.
Inference: There was no rain.
I₂: If it rains then the cricket match will not be played.
It did not rain.
Inference: The cricket match was played.
Which of the following is TRUE?

Question 54

Let fsa and pda be two predicates such that fsa(x) means x is a finite state automaton, and pda(y) means that y is a pushdown automaton. Let equivalent be another predicate such that equivalent (a,b) means a and bare equivalent. Which of the following first order logic statements represents the following:
Each finite state automaton has an equivalent pushdown automaton.

Question 55

Match the following groups.
Group-I (n > 0)
A-

B-

C-

D-

Group-II
1.

2.

3.

4.

5.

Question 56

What is best case and worst case time complexity respectively to find largest number that will divide both m and n ?

Question 57

Consider the following C code
main()
{
int c =0, z=1;
char *p;
for(z=1;z<100;z++)
{
printf(“%d”,z);
}
c=c+20;
}
Find an induction variable in the above code?

Question 58

Consider different activities related to email.
m1: Send an email from a mail client to a mail server
m2: Download an email from mailbox server to a mail client
m3: Checking email in a web browser
Which is the application level protocol used in each activity?

Question 59

A computer on a 10-Mbps network is regulated by a token bucket. The token bucket is fillied at a rate of 2 Mbps. It is initially field to capacity with 20 Megabits. How long can the computer transmit at the full 10-Mbps (in second)?

Question 60

How many 8-bit characters can be transmitted per second over a 9600 baud serial communication link using asynchronous mode of transmission with one start bit, eight data bits, two stop bits, and one parity bit?

Question 61

A program consist of four major types of instructions. The instruction mix and the CPI for each instruction type are given in the following table.

If the clock frequency of the processor is 400 MHz. what is the average CPI of the processor?

Question 62

Disk requests are received by a disk drive for cylinder 5, 25, 18, 3, 39, 8 and 35 in that order. A seek takes 5 msec per cylinder moved. How much seek time is needed to serve these requests for a Shortest Seek First (SSF) algorithm? Assume that the arm is at cylinder 20 when the last of these requests is made

Question 63

Which of the following is the highest isolation in transaction management?

Question 64

A 5 stage pipelined CPU has the following sequence of stages:

IF – instruction fetch from instruction memory
RD – Instruction decode and register read
EX – Execute: ALU operation for data and address computation
MA – Data memory access – for write access, the register read at RD state is used.
WB – Register write back

Consider the following sequence of instructions:

$I_{1}$ : L R0, loc 1; R0 <= M[loc1]
$I_{2}$ : A R0, R0; R0 <= R0 +R0
$I_{3}$ _{$I_{3}$}: S R2, R0; R2 <= R2-R0

Let each stage take one clock cycle

What is the number of clock cycles taken to complete the above sequence of instructions starting from the fetch of $I_{1}$ ?

Question 65

In a bubble Sort, worst-case runtime complexity will be:

Question 66

In Bridge

Question 67

A tap drips at a rate of one drop/sec. 600 drops make 100ml. The number of liters wasted in 300 days is

Question 68

Assume a matrix

is stored in a linear in row major order. Base address of A is 0 and each element takes 1 word. Find the location of A[–2] [50].

Question 69

Which of the following functions is total recursive function?

Question 70

Ram and Shyam have been asked to show that a certain problem Î is NP complete. Ram shows a polynomial time reduction from the 3-SAT problem to Î , and Shyam shows a polynomial time reduction from Î to 3-SAT. Which of the following can be inferred from these reductions?

Question 71

In C language break statement can be simulated by

Question 72

Which sorting algorithm is fastest?

Question 73

Match the following:
1) Waterfall model
2) Evolutionary model
3) Component-based software engineering
4) Spiral development

a) Specifications can be developed incrementally
b) Requirements compromises are inevitable
c) Explicit recognition of risk
d) Inflexible partitioning of the project into stages

Question 74

In an RS flip-flop, if the S line (Set line) is set high (1) and the R line (Reset line) is set low (0), then the state of the flip flop is

Question 75

What is the logical translation of the following statement?
“None of my friends are perfect.”

Question 76

P and Q are two propositions. Which of the following logical expressions are equivalent?
I.

II.

III.

IV.

Question 77

The coupling between different modules of a software is categorized as follows:
I. Content coupling
II. Common coupling
III. Control coupling
IV. Stamp coupling
V. Data coupling
Coupling between modules can be ranked in the order of strongest (least desirable) to weakest (most desirable) as follows :

Question 78

In C programming, which of the following is not used as a token separator during lexical analysis?

Question 79

Type checking is normally done during ___

Question 80

Consider the following two statements:
P: Every regular grammar is LL(1)
Q: Every regular set has a LR(1) grammar
Which of the following is TRUE?