Computer Fundamentals Archives - Quearn

Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

0

Asked: May 10, 2023In: Computer Fundamentals

Which one of the following linux file system does not support journaling feature? a) ext2 b) ext3 c) ext4 d) none of the mentioned

0

0

Asked: May 10, 2023In: Computer Fundamentals

The first linux kernel which supports the SMP hardware? a) linux 0.1 b) linux 1.0 c) linux 1.2 d) linux 2.0

0

0

Asked: May 10, 2023In: Computer Fundamentals

Linux uses a time-sharing algorithm ___________ a) to pair preemptive scheduling between multiple processes b) for tasks where absolute priorities are more important than fairness c) all of the mentioned d) none of the mentioned

0

0

Asked: May 9, 2023In: Computer Fundamentals

The strategy of making processes that are logically runnable to be temporarily suspended is called ____________ a) Non preemptive scheduling b) Preemptive scheduling c) Shortest job first d) First come First served

0

0

Asked: May 9, 2023In: Computer Fundamentals

What is FIFO algorithm? a) first executes the job that came in last in the queue b) first executes the job that came in first in the queue c) first executes the job that needs minimal processor d) first executes the job that has maximum processor needs

0

0

Asked: May 9, 2023In: Computer Fundamentals

Complex scheduling algorithms ____________ a) are very appropriate for very large computers b) use minimal resources c) use many resources d) all of the mentioned

0

0

Asked: May 9, 2023In: Computer Fundamentals

The portion of the process scheduler in an operating system that dispatches processes is concerned with ____________ a) assigning ready processes to CPU b) assigning ready processes to waiting queue c) assigning running processes to blocked queue d) all of the mentioned

0

0

Asked: May 9, 2023In: Computer Fundamentals

With round robin scheduling algorithm in a time shared system ____________ a) using very large time slices converts it into First come First served scheduling algorithm b) using very small time slices converts it into First come First served scheduling algorithm c) using extremely small time slices increases performance d) using very small time slices converts it into Shortest Job First algorithm

0

0

Asked: May 9, 2023In: Computer Fundamentals

Round robin scheduling falls under the category of ____________ a) Non-preemptive scheduling b) Preemptive scheduling c) All of the mentioned d) None of the mentioned

0