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

Appeared in Year: 2019 (UGC-NET)

Question

True-False▾

Statements

  1. The running time of dynamic programming algorithm is always where is number of subproblems. (December)

  2. When a recurrence relation has cyclic dependency, it is impossible to use that recurrence relation (unmodified) in a correct dynamic program.

  3. For a dynamic programming algorithm, computing all values in a bottom-up fashion is asymptotically faster than using recursion and memorization.

  4. If a problem can be reduced to a known NP-hard problem, then must be NP-hard.

Choices

Choice (4)Response

a.

Both statement Ⅰ & statement Ⅱ are true.

b.

Both statement Ⅱ & statement Ⅲ are true.

c.

Statement Ⅰ, Ⅱ & Ⅲ are all true.

d.

Only statement Ⅱ is true.

Question 1805

Appeared in Year: 2019 (UGC-NET)

Question

MCQ▾

Consider a paging system where translation look aside buffer (TLB) a special type of associative memory is used with hit ratio of 80 % .

Assume that memory reference takes 80 nanoseconds and reference time to TLB is 20 nanoseconds. What will be the effective memory access time given 80 % hit ratio?

(December)

Choices

Choice (4)Response

a.

200 nanoseconds

b.

110 nanoseconds

c.

100 nanoseconds

d.

116 nanoseconds

Developed by: