GATE (Graduate Aptitude Test in Engineering) Computer Science & IT (CS): Questions 168 - 173 of 3196

Choose Programs:

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

Rs. 1000.00 -OR-

3 Year Validity (Multiple Devices)

Topic-wise Notes & SampleDetails

🎯 302 Numeric, 2894 MCQs (& PYQs) with Full Explanations (2024-2025 Exam)

Rs. 650.00 -OR-

3 Year Validity (Multiple Devices)

CoverageDetailsSample Explanation

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

Question 168

Question MCQ▾

What is the value of “d” after this line of code has been executed?

double d = Math. round (2.5 + Math. random () ) ;

Choices

Choice (4)Response

a.

3

b.

2

c.

2.5

d.

4

Edit

Question 169

Question MCQ▾

Which of the following systems software does the job of merging the records from two files into one?

Choices

Choice (4)Response

a.

Networking software

b.

Documentation system

c.

Security software

d.

Utility program

Edit

Question 170

Question MCQ▾

Multilevel Feedback Queue Scheduling algorithm allows a process to move between

Choices

Choice (4)Response

a.

stack

b.

graph

c.

queues

d.

tree

Edit

Question 171

Question MCQ▾

Which three are methods of the Object class?

1. notify () ;

2. notifyAll () ;

3. isInterrupted () ;

4. synchronized () ;

5. interrupt () ;

6. wait (long msecs) ;

7. sleep (long msecs) ;

8. yield () ;

Choices

Choice (4)Response

a.

2,4, 5

b.

1,2, 8

c.

1,2, 4

d.

1,2, 6

Edit

Question 172

Question MCQ▾

Which of the following addressing modes, facilitates access to an operand whose location is defined relative to the beginning of the data structure in which it appears?

Choices

Choice (4)Response

a.

index

b.

indirect

c.

sorting

d.

ascending

Edit

Question 173

Question MCQ▾

When once the CPU has been allocated to a process then the process keeps the CPU until it releases the CPU either by terminating or by switching to the waiting state is a called________

Choices

Choice (4)Response

a.

Preemptive Scheduling

b.

Round-Robin Scheduling

c.

Non- Preemptive Scheduling

d.

All of the above

Edit