Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Tests  >  GATE Computer Science Engineering(CSE) 2025 Mock Test Series  >  Test: Introduction, Process, Threads & CPU Scheduling- 1 - Computer Science Engineering (CSE) MCQ

Test: Introduction, Process, Threads & CPU Scheduling- 1 - Computer Science Engineering (CSE) MCQ


Test Description

10 Questions MCQ Test GATE Computer Science Engineering(CSE) 2025 Mock Test Series - Test: Introduction, Process, Threads & CPU Scheduling- 1

Test: Introduction, Process, Threads & CPU Scheduling- 1 for Computer Science Engineering (CSE) 2024 is part of GATE Computer Science Engineering(CSE) 2025 Mock Test Series preparation. The Test: Introduction, Process, Threads & CPU Scheduling- 1 questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Introduction, Process, Threads & CPU Scheduling- 1 MCQs are made for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Introduction, Process, Threads & CPU Scheduling- 1 below.
Solutions of Test: Introduction, Process, Threads & CPU Scheduling- 1 questions in English are available as part of our GATE Computer Science Engineering(CSE) 2025 Mock Test Series for Computer Science Engineering (CSE) & Test: Introduction, Process, Threads & CPU Scheduling- 1 solutions in Hindi for GATE Computer Science Engineering(CSE) 2025 Mock Test Series course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Introduction, Process, Threads & CPU Scheduling- 1 | 10 questions in 30 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study GATE Computer Science Engineering(CSE) 2025 Mock Test Series for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 1

Which of the following is an example of a SPOOLED device?

Detailed Solution for Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 1

Spool means simultaneous peri-pheral operations on line, a printer is a spooling device.

Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 2

Concurrent processes are processes that

Detailed Solution for Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 2

Concurrent processes are processes that share the CPU and memory. They do overlap in time while execution. At a time CPU entertain only one process but it can switch to other without completing it as a whole.

1 Crore+ students have signed up on EduRev. Have you? Download the App
Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 3

Which of the following are real-time systems?
1. An on-line railway reservation system ,
2. A process control system
3. Aircraft control system
4. Payroll processing system

Detailed Solution for Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 3

Real-time system are very fast and quick respondents systems. Response time of such systems is very low, to the tune of 10 ms or 100 ms or even less.

  • Such systems are used where real-life scenario are being implemented like missile system, aircraft system extra.
  • In process control system, the time quantum in reality is very less (to give a feel of multiprocessing so real time system is needed.
Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 4

In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the RUNNING state to the

Detailed Solution for Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 4


In time-sharing operating system (example in Round-Robin), whenever the time slot given to a process expires, it goes back to READY state and if it requests for same I/O operation, then it goes to BLOCKED state.

Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 5

Which of the following are single-user operating system?

Detailed Solution for Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 5

MS-DOS (Microsoft Disk Operating System) is a single-user, single-tasking computer operating system that uses a command line interface. In spite of its very small size and relative simplicity, it is one of the most successful operating systems that has been developed to date.

Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 6

In a multiprogramming environment:

Detailed Solution for Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 6
  • Multiprogramming environment means processor is executing multiple processes simultaneously by continuously switching between one-another.
  • Therefore, multiple processes should reside in memory. However, processor can't executes more than one process at a time.
Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 7

Suppose that a process is in ‘BLOCKED’ state waiting for some I/O service. When the service is completed, it goes to the

Detailed Solution for Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 7

When process in blocked state waiting for some I/O services, whenever the services is completed it goes in the ready queue of the ready state.

Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 8

Consider a set of 5 processes whose arrival time, CPU time needed and the priority are given below:


Note: Smaller the number, higher the priority.

If the CPU scheduling policy is FCFS, the average waiting time will be 

Detailed Solution for Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 8

According to FCFS process solve are p1 p2 p3 p4 p5 so  

For p1 waiting time = 0 process time = 10 then 

For p2 waiting time = (process time of p1-arrival time of p2) = 10 - 0 = 10 then 

For p3 waiting time = (pr. time of (p1+p2) - arrival time of p3) = (10 + 5) - 2 = 13 and 

Same for p4 waiting time = 18 - 5 = 13 

Same for p5 waiting time = 38 - 10 = 28 

So total average waiting time = (0 + 10 + 13 + 13 + 28) / 5

= 12.8

Hence option A.

Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 9

Consider a set of 5 processes whose arrival time, CPU time needed and the priority are given below:

Note: Smaller the number, higher the priority.

If the CPU scheduling policy is SJF, the average waiting time (without pre-emption) will be 

Detailed Solution for Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 9


Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 10

Consider a set of 5 processes whose arrival time, CPU time needed and the priority are given below:


Note: Smaller the number, higher the priority.

If the CPU scheduling policy is SJF with preemption, the average waiting time will be 

Detailed Solution for Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 10


55 docs|215 tests
Information about Test: Introduction, Process, Threads & CPU Scheduling- 1 Page
In this test you can find the Exam questions for Test: Introduction, Process, Threads & CPU Scheduling- 1 solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Introduction, Process, Threads & CPU Scheduling- 1, EduRev gives you an ample number of Online tests for practice

Top Courses for Computer Science Engineering (CSE)

Download as PDF

Top Courses for Computer Science Engineering (CSE)