GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 1762 - 1765 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 1762

Appeared in Year: 2019 (UGC-NET)

Question

MCQ▾

In the context of software testing, which of the following statements is/are NOT correct? (June)

P: A minimal test set that achieves 100 % path coverage will also achieve 100 % statement coverage.

Q: A minimal test set that achieves 100 % path coverage will generally detect more faults than one that achieves 100 % statement coverage.

R: A minimal test set that achieves 100 % statement coverage will generally detect more faults than one that achieves 100 % branch coverage.

Choices

Choice (4)Response

a.

Q only

b.

R only

c.

P and Q only

d.

Q and R only

Question 1763

Appeared in Year: 2019 (UGC-NET)

Question

MCQ▾

In the TCP/IP model, encryption and decryption are functions of ________ layer. (June)

Choices

Choice (4)Response

a.

Application

b.

Transport

c.

Data link

d.

Network

Question 1764

Appeared in Year: 2019 (UGC-NET)

Question

MCQ▾

Consider the game tree given below: (June)

Consider the Game Tree

Here

Figure Show of the Circle

and

Figure Show of the Rectangle

represents MIN and MAX nodes respectively.

The value of the root node of the game tree is:

Choices

Choice (4)Response

a.

11

b.

4

c.

12

d.

7

Question 1765

Appeared in Year: 2019 (UGC-NET)

Question

MCQ▾

There are many sorting algorithms based on comparison. The running time of heap sort algorithm is O (n log n) . Like P, but unlike Q, heap sort sorts in place where (P, Q) is equal to (June)

Choices

Choice (4)Response

a.

Insertion Sort, Merge sort

b.

Insertion Sort, Quick sort

c.

Quick Sort, Insertion sort

d.

Quick Sort, Merge sort

Developed by: