Explore Exams
Login Signup
Sign in Open App
Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Test  >  GATE Computer Science Engineering(CSE) 2027 Mock Test Series  >  Test: Introduction, Process, Threads & CPU Scheduling- 1 - Computer Science Engineering (CSE) MCQ

GATE Computer Science Engineering(CSE) 2027 Test: Introduction, Process


MCQ Practice Test & Solutions: Test: Introduction, Process, Threads & CPU Scheduling- 1 (10 Questions)

You can prepare effectively for Computer Science Engineering (CSE) GATE Computer Science Engineering(CSE) 2027 Mock Test Series with this dedicated MCQ Practice Test (available with solutions) on the important topic of "Test: Introduction, Process, Threads & CPU Scheduling- 1". These 10 questions have been designed by the experts with the latest curriculum of Computer Science Engineering (CSE) 2026, to help you master the concept.

Test Highlights:

  • - Format: Multiple Choice Questions (MCQ)
  • - Duration: 30 minutes
  • - Number of Questions: 10

Sign up on EduRev for free to attempt this test and track your preparation progress.

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

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

Detailed Solution: 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
Save

Concurrent processes are processes that

Detailed Solution: 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.

Clear all your doubts with EduRev
Test: Introduction, Process, Threads & CPU Scheduling- 1 - Question 3
Save

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: 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
Save

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: 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
Save

Which of the following are single-user operating system?

Detailed Solution: 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
Save

In a multiprogramming environment:

Detailed Solution: 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
Save

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: 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
Save

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: 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
Save

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: Question 9

  • P1: Starts at 8, finishes at 18. Waiting Time = 8 - 0 = 8
  • P2: Starts at 0, finishes at 5. Waiting Time = 0 - 0 = 0
  • P3: Starts at 5, finishes at 8. Waiting Time = 5 - 2 = 3
  • P4: Starts at 20, finishes at 40. Waiting Time = 20 - 5 = 15
  • P5: Starts at 18, finishes at 20. Waiting Time = 18 - 10 = 8

Total Waiting Time = 8 (P1) + 0 (P2) + 3 (P3) + 15 (P4) + 8 (P5) = 34

Number of Processes = 5

Average Waiting Time = Total Waiting Time / Number of Processes = 34 / 5 = 6.8

The average waiting time is 6.8 ms.

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

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: Question 10


56 docs|215 tests
Join Course
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
Download as PDF

About this Computer Science Engineering (CSE) Practice Test

This test contains 10 MCQs on Introduction, Process, Threads & CPU Scheduling- 1 with detailed solutions for each question. It is part of the GATE Computer Science Engineering(CSE) 2027 Mock Test Series course on EduRev, designed to align with the current Computer Science Engineering (CSE) syllabus. Each solution explains not just the correct answer but also gives you an understanding of the topic — not just to attempt the question but also help you prepare for the exam with practice.

Explore more Computer Science Engineering (CSE) Study Resources

If you found this Introduction, Process, Threads & CPU Scheduling- 1 MCQ Test helpful, you can further enhance your Computer Science Engineering (CSE) preparation with in-depth courses on EduRev, for all the subjects and topics available in GATE Computer Science Engineering(CSE) 2027 Mock Test Series course. The course offers:
  • Video Lectures: covering all the topics of GATE Computer Science Engineering(CSE) 2027 Mock Test Series
  • Notes for Revision: offering revision notes, important questions, summaries, flashcards, cheatsheets & more for Computer Science Engineering (CSE) preparation
  • MCQ Test: variety of questions as per the pattern of Computer Science Engineering (CSE) exam
Signup to see your scores go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup