Time Left - 08:00 mins

DMRC CS 2018 Practice Quiz - 7(Tech)

Attempt now to get your rank among 209 students!

Question 1

How many comparisons are needed to sort an array of length 5 if a straight selection sort is used and array is already in the opposite order?

Question 2

How many edges are there in a forest with v vertices and k components?

Question 3

In the Ethernet, which field is actually added at the physical layer and is not part of the frame

Question 4

Consider a pipeline ‘x’ consist of 5 stages named as IF, ID, OF, EX and WB with the respective stage delays of 2 ns, 5 ns, 6 ns, 8 ns and 1 ns. The alternative pipeline ‘y’ contain the same number of stages but EX stage is divided into 4 sub stages, (EX1, EX2, EX3 and EX4) with equal delay i.e. (8 ns/4) and ID stage is divided into 2 substages (ID1 and ID2) with equal delays of (5 ns/2). In the pipeline x and y memory reference instructions are not overlapped so the penalty of memory reference instructions in the pipeline ‘x’ is 4 cycles and in the pipeline ‘y’ is 8 cycles.
If the program contain 30% of the instructions are memory based instructions, what is the ratio of speedup of x to speedup of y?

Question 5

Consider the following statement
(i) Primary index is always sparse
(ii) Secondary index may or may not be dense
Which of the above statement is/are false?

Question 6

The type of software that controls the internal operations in the computer, and controls how the computer words with all its parts is which of the following?

Question 7

The Boolean function Description: F:\GradeStack Courses\GATE Tests (Sent by Ravi)\GATE-ME-20-April\GATE-IES-EC-Digital=Electronics-Circuits_files\image045.pngis equal to which one of the following expression?

Question 8

Decision makers who are concerned with tactical (short-term) operational problems and decision making are

Question 9

Which one of the following algorithm is not used in asymmetric-key Cryptography?

Question 10

Consider the following C function:
int f(int n)
{ static int i = 1 ;
if (n >=5) return n;
n = n+i;
i++;
return f(n);
}
The value returned by f(1) is
  • 209 attempts
  • 2 upvotes
  • 0 comments
Mar 12GATE & PSU CS