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

Appeared in Year: 2017 (UGC-NET)

Question

MCQ▾

In a paging system, it takes 30 ns to search translation Look-a-side Buffer (TLB) and 90 ns to access the main memory. If the TLB hit ratio is 70 % , the effective memory access time is: (January paper II)

Choices

Choice (4)Response

a.

120ns

b.

84ns

c.

48ns

d.

147ns

Question 944

Appeared in Year: 2014 (UGC-NET)

Question

MCQ▾

Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is:

The number of page faults in LRU and optimal page replacement algorithms are respectively (without including initial page faults to fill available page frames with pages) : (June paper III)

Choices

Choice (4)Response

a.

b.

c.

d.

Question 945

Appeared in Year: 2014 (UGC-NET)

Question

MCQ▾

You have to sort a list L, consisting of a sorted list followed by a few ‘random’ elements. Which of the following sorting method would be most suitable for such a task? (December Paper II)

Choices

Choice (4)Response

a.

Bubble sort

b.

Selection sort

c.

Quick sort

d.

Insertion sort

Question 946

Appeared in Year: 2017 (UGC-NET)

Question

MCQ▾

Consider an array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array (i⩽n) , the index of the parent is: (November Paper II)

Choices

Choice (4)Response

a.

Ceiling

b.

Ceiling

c.

d.

Floor

Developed by: