GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 1633 - 1636 of 2080

Access detailed explanations (illustrated with images and videos) to 2080 questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. Unlimited Access, Unlimited Time, on Unlimited Devices!

View Sample Explanation or View Features.

Rs. 550.00 -OR-

How to register? Already Subscribed?

Question 1633

Appeared in Year: 2018 (UGC-NET)

Question

MCQ▾

________ command is used to remove a relation from an SQL database. (Dec)

Choices

Choice (4)Response

a.

Drop table

b.

Update table

c.

Delete table

d.

Remove table

Question 1634

Appeared in Year: 2018 (UGC-NET)

Question

MCQ▾

Find the boolean expression for the logic circuit shown below: (December)

(1-NAND gate, 2-NOR gate, 3-NOR gate)

Image Shows the Logic Circuit

Choices

Choice (4)Response

a.

b.

c.

d.

Question 1635

Appeared in Year: 2018 (UGC-NET)

Question

MCQ▾

Identify the correct sequence in which the following packets are transmitted on the network by a host when a browser requests a webpage from a remote server, assuming that the host has just been restarted. (December)

Choices

Choice (4)Response

a.

DNS query, TCP SYN, HTTP GET request

b.

HTTP GET request, DNS query, TCP SYN

c.

TCP SYN, DNS query, HTTP GET request

d.

DNS query, HTTP GET request, TCP SYN

Question 1636

Appeared in Year: 2018 (UGC-NET)

Question

MCQ▾

Consider the following method: (Dec)

  1. intf( intm, intn, booleanx, booleany)
  2. {
  3.     intres=0;
  4.     if (m<0){res=n-m;}
  5.     elseif (x || y){
  6.         res=-1;
  7.         if(n==m) {res=1;}
  8.     }
  9.     else {res=n;}
  10.     returnres;
  11. } /⚹end of f ⚹/

If P is the minimum number of tests to achieve full statement coverage for f () , and Q is the minimum number of tests to achieve full branch coverage for f () , then (P, Q) =

Choices

Choice (4)Response

a.

(3,2)

b.

(4,3)

c.

(3,4)

d.

(2,3)

Developed by: