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: File System & Device Management- 1 - Computer Science Engineering (CSE) MCQ

GATE Computer Science Engineering(CSE) 2027 Test: File System & Device


MCQ Practice Test & Solutions: Test: File System & Device Management- 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: File System & Device Management- 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: File System & Device Management- 1 - Question 1
Save

The page replacement policy that sometimes leads to more page faults when the size of the memory is increased is

Detailed Solution: Question 1

It is due to Belady’s Anomaly in which more frames may sometimes lead to more page fault.

Test: File System & Device Management- 1 - Question 2
Save

Which of the following page replacement algorithms suffers from Belady’s anomaly?

Detailed Solution: Question 2

There are two types of page replacement algorithm mainly stack based and non-stack based, it is observed that algorithms which follows the latter one suffers from Belady’s anomaly. FIFO suffers from Belady's anomaly.

Clear all your doubts with EduRev
Test: File System & Device Management- 1 - Question 3
Save

Match List-I with List-ll select the correct answer using the codes given below the lists:

Detailed Solution: Question 3

SCAN is a disk scheduling algorithm:

  • Batch processing can be successfully done by FIFO without starvation.
  • Round Robin work son times haring mechanism.
  • Interrupt processing (means interrupted process to be handled, last in first out). (LIFO)

Test: File System & Device Management- 1 - Question 4
Save

Thrashing

Detailed Solution: Question 4

When to increase multi-programming, a lot of processes are brought into memory. Then, what happens is, no process gets enough memory space and processor needs to keep bringing new pages into the memory to satisfy the requests. (A lot of page faults occurs). This process of excessive page replacements is called thrashing, which in turn reduces the overall performance.

Test: File System & Device Management- 1 - Question 5
Save

The data block of a very large file in the Unix file system are allocated using

Detailed Solution: Question 5

Data block of a very large file in the UNIX file system are allocated using an extersion of induced allocation.

Test: File System & Device Management- 1 - Question 6
Save

Given reference to the following page by a program:
0, 9, 0, 1,8, 1,8, 7, 8, 7, 1,2, 8, 2, 7, 8, 2, 3, 8, 3 
If the program contains 3 page frames.
How many page fault will occur in optimal page replacement policy?

Detailed Solution: Question 6

Test: File System & Device Management- 1 - Question 7
Save

On a system the average process size be 128 KB and each page entry requires 8 bytes then what will be the optimal page size.

Detailed Solution: Question 7


Test: File System & Device Management- 1 - Question 8
Save

How many page faults occur in LRU page replacement algorithm for the given reference

string, with four-page frames

7, 0, 1, 2, 0, 3, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1

Detailed Solution: Question 8

Test: File System & Device Management- 1 - Question 9
Save

Determine the page faults when FIFO is applied to the following string with 3 frames 2, 4, 3, 1, 5, 3, 2, 5, 3, 1, 4, 2 

Detailed Solution: Question 9


So, 10 page faults.

Test: File System & Device Management- 1 - Question 10
Save

Consider the following page addresses stream frequency by executing the program with 3 frames. 1 2 3 1 2 5 8 7
By using optimal page replacement, number of page fault will be ....... and the number of page hit will be .......

Detailed Solution: Question 10


So, 6 page faults and 2 page hit.

56 docs|215 tests
Join Course
Information about Test: File System & Device Management- 1 Page
In this test you can find the Exam questions for Test: File System & Device Management- 1 solved & explained in the simplest way possible. Besides giving Questions and answers for Test: File System & Device Management- 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 File System & Device Management- 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 File System & Device Management- 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