GATE Mock Test Computer Science Engineering (CSE) - 10 - Computer Science Engineering (CSE) MCQ

We can see that the profit increasing in year 2015 and 2017 only.

We know that,

Profit percent increase is given by:

In 2015, the profit is increasing as compared to the previous year but in 2017 profit percent increase is highest.

∴ The profit percent increase of B is the highest compared to the previous year in 2017.

Hence, the correct option is (B).

The given sentence is in Direct Speech.

The given sentence is in the Direct Speech because it quotes actual words. Therefore, it has to be changed into Indirect Speech.

The rule is that during conversion from direct to indirect pronouns change their forms. Example-“My” changes to “her”.

In the case of interrogative sentences, Indirect Speech is introduced by verbs like 'asked', 'inquired' etc.

Also, the actual words have been spoken by the speaker in the past, therefore narrating it in the present will require a change in the tense.

Therefore, the sentence in Indirect Speech will be an option (B) i.e. "The traveller asked if he could tell him the way to the nearest inn".

Hence, the correct option is (B).

In the figure shown below, the shaded region is the region bounded externally by the square and internally by the circle,

Given,

Side of square =2a cm

Area of square =( side )² = 4a² cm²

∵ The circle touches the four sides of the square.

As we know,

Radius of a circle (r) = d/2

Diameter of circle = 2a cm
Area of a circle = π × r²
⇒ π × d/2 × d/2
⇒ π/4 × (d)²
= (π/4) × 4a²

= πa² cm²

∴ Area of shaded region  =  Area of square − Area of circle = (4−π) a² cm²

Hence, the correct option is (A).

Average = 

Number of employees in company B = 

=5,000

Number of employees in company C = 

=3,750

Number of employees in company E = 

=5,500

Now, Average number of employees in B,C and E.

=4,750

∴ Average number of employees in B,C and E is 4,750.

Hence, the correct option is (B).

Let's look at the meaning of the given idiom:

Get the jitters: To experience a temporary state of nervous anxiety or anticipation.

Example: 

Lo Jill always gets the jitters before exams.

​Thus, from the explanation given above, we find that the first option is the correct choice.

Hence, the correct option is (A).

There is no indication of weights of the students in the question. Therefore, it is not possible to find the relation between the weights of students in groups A, B, C, and D.

Probability that a man will live 10 more years = 1/4
Probability that man will not live 10 more years = 1 - 1/4 = 3/4
Probability that his wife will live 10 more years = 1/3
Probability that his wife will not live 10 more years = 1 - 1/3 = 2/3
Then, probability that neither will be alive in 10 years = (3/4) x (2/3) = 1/2

The context mentions that wars have been fought for 'voting' and 'privilege' means 'a special right'.

Let the speeds of two trains starting from station A and B be S₁ and S₂ respectively and the time taken by them after meeting be t₁ and t₂ respectively.
Then, we can use this equation to get the answer: 

S₂ = 28 kmph

Let us assume that man starts from point O and reaches his destination at point A.

The shortest distance between O and his destination is OA = = 5 km

Cache memory size = 16 kB
Block size = 16 B
Main memory address = 32 bit
Number of lines (N) = 16 K/16
⇒ 2¹⁴/2⁴
⇒ 2¹⁰
Fully associative cache memory (N-way)
So, number of sets (S) = N
P-way = 2¹⁰/2¹⁰ = 1
∴ Address format:   

So, TAG = 28 bit
Index = 0 bit (No address)

In a complete graph we can traverse the n vertices in any order and return to the starting vertex and form a Hamiltonian cycle. The number of such cycles will be n! However, since circular rotations will have to ignored. Since for example K4 with vertices {1, 2, 3, 4}, the cycle 1-2-3-4 is same as 2-3-4-1 is same as 3-4-1-2 etc. we now get only (n – 1)! distinct Hamiltonian cycles. Further, the cycle 1-2-3-4 and 1-4-3-2 are also same (clockwise and anticlockwise). So ignoring this orientation also we finally get (n-1)!/2 distinct Hamiltonian cycles which is option (d).

+28 ⇒ 0000 0000 0001 1100
–28 ⇒ 1111 1111 1110 0100 (2’s complement form)

I. Strict 2PL guaranteed conflict serializable because of 2PL condition and also strict
recoverable.
II. Thomas Write time stamp ordering ensures serializable. Thomas write rule time
stamp ordering allowed to execute schedule which is view equal serial schedule
based on time stamp ordering

X(PQRS) {QR → S, R → P, S → Q} decomposed into
Y(PR)                                                      Z(QRS)
{R → P}                                                  {QR → S, S → Q}
Candidate key : R                                  Candidate key : QR, RS
Relation Y in BCNF                               Relation Z in 3NF but not BCNF
Common attribute between Y and Z relations is R which is key for relation Y.
So that given decomposition is lossless join decomposition.
R → P in Y
QR →S
S →Q
both are in Z and dependency preserving decomposition.

Characteristic equation is

Difference between the eigen values of the matrix = 12 - (-8) = 20

For a singular matrix, its determinant is always zero.
i.e. Determinant = 0
i.e.
4(0 – 3) – x(2  0 – 6) + 0(6 – 0) = 0
⇒ 4(–3) – x(– 6) + 0 = 0
– 12 + 6x = 0
– 12 + 6x = 0
6x = 12
x = 2

The 1's complement number is a 6-bit number. We have to find the maximum and minimum number which can be represented by it.
When the number is negative, then the maximum value can be 111111, i.e. -(2⁶ - 1) = (-31)₁₀.
Here, MSB is for sign.
Maximum positive number is 0 11111, i.e. + (2⁶- 1) = (+ 31)₁₀.
Hence, the range of signed decimal numbers that can be represented by 6-bit 1's complement number is: -31 to +31.

Loader is a program which performs the functions of:
(1) Loading
(2) Link editing
Link editing is used to create a single program from several files of relocatable machine code.

In O - notation, two functions f(n) and g(n) are such that f(n) is O(g(n)), if and only if there is positive constant c such that f(n) ≤ c*g(n).
O - notation is useful, when there exist only upper bound on the time complexity.

Owner constraints table, administrator constraints table and constraint type do not exist in SQL. User constraints table contains the information about each constraint in the database along with the constraint specific information.

In immediate addressing mode, data is present in the address field of the instruction. It is designed in one address instruction format. In this mode, range of constants are limited by the size of address field.

To find post order traversal,

• scan left child of the tree
• scan right child of the tree
• scan the root

The postorder traversal will give the result as ACEDBHIGF.

The IP address range for APIPA is 169.254.0.1 - 169.254.255.254, with the subnet mask of 255.255.0.0.

Suppose N = ∑  all Needsi, A = ∑ all Allocationsi, M = ∑ all maximum Needsi.
Assume that there is no deadlock in the given system. If there is a deadlock state, then A = m because there is only one kind of resource and it can either be requested or released at a time.
From the condition 1 and 2 we get, N + A = M < m + n. So, we get N < n. It shows that at least one process i that Needs = 0. From condition 1, one process can release at least 1 resource. Thus, there are n -1 processes sharing m resources. It is always true that no process will wait permanently. Hence, the given system is deadlock free.

When an interrupt occurs the process loses the CPU, but regains it as soon as the handler completes. The process is never rolled out of memory.
Note that when timer runout occurs, the process is returned to the ready queue, and it may later be rolled out of memory. When the process blocks, it is moved to a waiting queue, where it may also be rolled out at some point.

• Boolean expressions and logic networks correspond to labelled acyclic digraphs. Correct
• Optimal boolean expressions may not correspond to simplest networks. Correct
• Choosing essential blocks first in a Karnaugh map and then, greedily choosing the largest remaining blocks to cover may not give an optimal expression. Correct

So, option (4) is correct.

XML uses Document Type Definition (DTD) to describe the data. DTD is a specified document defining and constraining definition and XML uses a description node to describe the data.
Extensible Stylesheet Language (XSL) is used to transform and render the XML document.
Statements (1) and (3) are correct.
So, option (4) is correct.

Recursively enumerable languages are also known as Type 0 grammars. They are not closed under set difference.
Here, T - P (where T and P are two sets) may or may not be recursively enumerable.
If T is recursively enumerable, then the complement of T is recursively enumerable if and only if T is also recursive.

Number of surfaces = 16
Tracks = 16 × 128 × 256 = 2⁴ × 2⁷ × 2⁸
Number of bits required by a sector = 2¹⁹
So, 19 lines are required to address all the sectors.
Bytes = 2¹⁹ × 512 B = 2¹⁹ × 2⁹ = 2²⁸
Bytes = 256 MB