• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE-CS-2014-(Set-3)

Question 61

A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is _________.
  • 6
  • 7
  • 8
  • 9

Question 62

The minimum number of arithmetic operations required to evaluate the polynomial P(X) = X5 + 4X3 + 6X + 5 for a given value of X using only one temporary variable.
  • 6
  • 7
  • 8
  • 9

Question 63

Classless Inter-domain Routing (CIDR) receives a packet with address 131.23.151.76. The router’s routing table has the following entries:
Prefix           Output Interface Identifier
131.16.0.0/12              3
131.28.0.0/14              5
131.19.0.0/16              2
131.22.0.0/15              1
The identifier of the output interface on which this packet will be forwarded is ______.
  • 1
  • 2
  • 3
  • 5

Question 64

Consider the following relational schema:
  employee(empId, empName, empDept)
  customer(custId, custName, salesRepId, rating)
salesRepId is a foreign key referring to empId of the employee relation. Assume that each employee makes a sale to at least one customer. What does the following query return?
SELECT empName
       FROM employee E
       WHERE NOT EXISTS ( SELECT custId
                          FROM customer C
                          WHERE C.salesRepId = E.empId
                            AND C.rating <> `GOOD`);
  • Names of all the employees with at least one of their customers having a ‘GOOD’ rating.
  • Names of all the employees with at most one of their customers having a ‘GOOD’ rating.
  • Names of all the employees with none of their customers having a ‘GOOD’ rating.
  • Names of all the employees with all their customers having a ‘GOOD’ rating.

Question 65

While trying to collect(I) an envelope from under the table (II), Mr. X fell down (III) and was losing consciousness (IV) Which one of the above underlined parts of the sentence is NOT appropriate?
  • I
  • II
  • III
  • IV

There are 65 questions to complete.

Last Updated :
Take a part in the ongoing discussion