NTA-NET (UGC-NET) Computer Science & Applications (87): Questions 665 - 666 of 2699

Choose Programs:

⏳ 🎯 Online Tests (4 Tests [100 questions each]): NTA Pattern, Analytics & Explanations

Rs. 800.00 -OR-

3 Year Validity (Multiple Devices)

Sample TestsDetailsSee Demo

🎓 Study Material (2083 Notes): 2024-2025 Syllabus

Rs. 1250.00 -OR-

3 Year Validity (Multiple Devices)

Topic-wise Notes & SampleDetails

🎯 2699 MCQs (& PYQs) with Full Explanations (2024-2025 Exam)

Rs. 600.00 -OR-

3 Year Validity (Multiple Devices)

CoverageDetailsSample Explanation

Help me Choose & Register (Watch Video) Already Subscribed?

Question 665

Appeared in Year: 2013

Question MCQ▾

Consider the input/output (I/O) requests made at different instants of time directed at a hypothetical disk having 200 tracks as given in the following table:

Table Shows the Serial Number, Track Number and Time of Arrival
Serial

No.

12345
Track

No.

12854010075
Time of

arrival

6580110100175

Assume that:

Current head position is at track no. 65

Direction of last movement is towards higher numbered tracks c

Current clock time is 160 milliseconds

Head movement time per track is 1 millisecond.

“look” is a variant of “SCAN” disk-arm scheduling algorithm. In this algorithm. if no more I/O requests are left in current direction, the disk head reverses its direction, The seek times in shortest seek First (SSF) and “look” disk-arm scheduling algorithms respectively are: (September Paper II)

Choices

Choice (4)Response

a.

144 and 123 milliseconds

b.

143 and 123 milliseconds

c.

149 and 124 milliseconds

d.

256 and 186 milliseconds

Edit

Question 666

Appeared in Year: 2013

Question MCQ▾

Arrays in C language can have ________ with reference to memory representation. (June Paper III)

Choices

Choice (4)Response

a.

two-subscripts

b.

n-subscripts

c.

only one subscript

d.

three subscripts only

Edit