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

Appeared in Year: 2017 (UGC-NET)

Question

MCQ▾

The Bounded buffer problem is also known as ________. (November paper III)

Choices

Choice (4)Response

a.

Reader - writer problem

b.

Producer - consumer problem

c.

Dining Philosophers problem

d.

All of the above

Question 1308

Question

MCQ▾

Which of the following options is false for a Combinational Logic Circuit? (Model paper II)

Choices

Choice (4)Response

a.

Output determined by the current input

b.

NAND, NOR, NOT gates are present

c.

It has feedback loops

d.

Implements Adder and Subtractor

Question 1309

Question

MCQ▾

In 8085 addressing modes, CMA is associated with which addressing mode? (Model paper III)

Choices

Choice (4)Response

a.

Direct addressing

b.

Implicit Addressing

c.

Immediate addressing

d.

Register addressing

Question 1310

Question

MCQ▾

Which of the following are types of Traceability Test Matrix?

1. Forward traceability

2. Backward traceability

3. Bi-directional traceability (Model paper II)

Choices

Choice (4)Response

a.

1 and 2

b.

2 and 3

c.

1 Only

d.

1,2 and 3

Question 1311

Question

MCQ▾

Find the Cyclomatic complexity of the given code fragment.

Case

a: Code

b: Code

K: Code

End Case

Statement (Model paper II)

Choices

Choice (4)Response

a.

b.

c.

d.

Developed by: