Sudo GATE 2020 Mock II (10 January 2019)

Question 11

What is the probability of passing a 10-question true-false exam by random guessing, if a passing score is 70% ?

• 0.296094
• 0.321502
• 0.964506
• 0.171875

Question 12

Which of the following option is false regarding option field in the IPv4 header:

• If the header length is greater than 5 (i.e., it is from 6 to 15) it means that the options field is present and must be considered.
• The Value of "Type" in the Security option field of an IPv4 header is 131.
• Copied, Option Class, and Option Number are sometimes referred to as a single eight-bit field, the Option Type.
• None of these

Question 13

S1- MD5 is vulnerable to the Birthday attack.
S2- traceroute uses the "Destination port unreachable" ICMP error message.
S3- 3DES is a type of Public Key Encryption Algorithm.
S4- IPv6 has a 40-byte fixed header size(without Options fields). 

How many of the above statements are true ?

• 1

• 2

• 3

• 4

Question 14

Consider the following code segment.

x = u - t;
y = x * v;
x = y + w;
y = t - z; 

The minimum number of total variables required to convert the above code segment to static single assignment form is

• 6
• 8
• 9
• 10

Question 15

Consider the relational schema R = {P, Q, R, S, T, U, V, W} and the set of functional dependencies FD:

FD = { Q → U, U → V, PQ → WST, SU → TR, VT → RW, R → W } 

Which of the following is a minimum cover of the FD ?

• { Q → U, U → V, P Q → S, SU → T, SU → R, VT → R, VT → W, R → W }
• { Q → U, U → V, PQ → S, SU → T, PQ → W, VT → R, PQ → T, R → W }
• { Q → U, U → V, PQ → S, SU → T, VT → R, R → W }
• { Q → U, U → V, PQ → S, SU → T, SU → R, VT → R, PQ → T, R → W }

Question 16

Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below: If the pre-emptive shortest remaining time first scheduling algorithm is used to schedule the processes, then the average turn around time across all processes is _______ milliseconds.

• 3
• 7
• 7.25
• 7.50

Question 17

Consider the following statements:
(I) Let T be a binary search tree with 4 height. The minimum and maximum possible nodes of T are 5 and 15 respectively.
(II) In a binary tree, the number of internal nodes of degree 2 is 6, and the number of internal nodes of degree 1 is 8. The number of leaf nodes in the binary tree is 15.
Which of the following statement(s) is/are correct ?

• Only (I)
• Only (II)
• Both (I) and (II)
• Neither (I) nor (II)

Question 18

Which of the following is not tautology ?

• ((p ∧ q) ∧ (q ∧ r)) → (p ∧ r)
• ((p ⊕ q) ∧ (q ⊕ r)) → (p ⊕ r)
• ((p ∨ q) ∧ (¬p ∨ r)) → (q ∨ r)
• ((A ∨ B) → C)) ↔ ((A → C) ∨ (B → C))

Question 19

Which of the following option is False ?

• System calls involved in process but not in threads.
• Context switching required in both processes and threads
• Different process have different copies of code and data.
• All user level threads treated as single task for operating system.

Question 20

Consider the following relational schema:

STUDENT(SNO, SNAME, DEPT)
ENROLL(CNO, SNO, GRADE)
COURSE(CNO, DEPT)
PREREQ(CNO, PNO) 

Keys are underlined. The column ENROLL(SNO) is a foreign key referencing STUDENT(SNO). All the occurrences of the columns CNO and PNO, except for the one in COURSE, are foreign keys referencing COURSE(CNO).

SELECT E1.CNO, S.SNAME
FROM ENROLL E1, STUDENT S
WHERE E1.SNO = S.SNO
      AND NOT EXISTS ( SELECT * FROM ENROLL E2
                       WHERE E2.CNO = E1.CNO
                            AND E2.GRADE > E1.GRADE )

What is the output of the Query ?

• For every course, return the names of the highest-scoring students.
• For every student, return the names of the courses.
• For every course, return the names of the students who never score highest marks.
• None of these.