My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Memory Management and File Systems - Operating System - Computer Science & Information Technology Previous Year Questions

Practice Memory Management and File Systems - Operating System - Computer Science & Information Technology previous year questions organised from real papers, with year-wise coverage and clear topic navigation.

24Papers
17Years
42Questions
1Topics

Memory Management and File Systems question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Memory Management and File Systems. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 23 54.8%
Easy 16 38.1%
Hard 3 7.1%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

Numerical Answer Type (NAT) 22 52.4%
MCQ 16 38.1%
MSQ 4 9.5%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
42 Qs

Most asked topics

Top topics across the included previous year papers.

Operating System
42 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Memory Management and File Systems
42 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

Computer Science and Information Technology (CS) 2026
2 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2016 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
2 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
1 Qs
Computer Science & Information Technology (CS) 2010
1 Qs
Computer Science & Information Technology (CS) 2009
3 Qs
Computer Science & Information Technology (CS) 2008
2 Qs
Computer Science & Information Technology (CS) 2007
3 Qs

Included previous year papers

Newest papers appear first. Sort by year, question coverage or name.

PaperYear / sessionQuestions in this viewOpen
Computer Science and Information Technology (CS) 202620262View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20253View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20252View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20241View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20242View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20232View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20223View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20212View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20211View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20202View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20191View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20181View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20171View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20162View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20162View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20141View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20141View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20142View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20131View paper
Computer Science & Information Technology (CS) 201020101View paper
Computer Science & Information Technology (CS) 200920093View paper
Computer Science & Information Technology (CS) 200820082View paper
Computer Science & Information Technology (CS) 200720073View paper

All Memory Management and File Systems previous year questions

Practice every matching question in batches of 20, with every available option.

1
2007 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2007
A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements:
P: Increasing the number of page frames allocated to a process sometimes increases the page fault rate.
Q: Some programs do not exhibit locality of reference.
Which one of the following is TRUE?
Open complete paper
2
2007 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2007
If optimal page replacement policy is used, how many page faults occur for the above reference string?
Open complete paper
3
2007 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2007

Least Recently Used (LRU) page replacement policy is a practical approximation to optimal page replacement. For the above reference string, how many more page faults occur with LRU than with the optimal page replacement policy?

Open complete paper
4
2008 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2008

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

Open complete paper
5
2008 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2008
A processor uses 36 bit physical addresses and 32 bit virtual addresses, with a page frame size of 4 Kbytes. Each page table entry is of size 4 bytes. A three level page table is used for virtual-to-physical address translation, where the virtual address is used as follows:
• bits 30-31 are used to index into the first level page table.
• bits 21-29 are used to index into the second level page table.
• bits 12-20 are used to index into the third level page table, and
• bits 0-11 are used as offset within the page.
The number of bits required for addressing the next level page table (or page frame) in the page table entry of the first, second and third level page tables are respectively
Open complete paper
6
2009 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2009
In which one of the following page replacement policies, Belady’s anomaly may occur ?
Open complete paper
7
2009 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2009

The essential content(s) in each entry of a page table is/are

Open complete paper
8
2009 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2009

A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because

Open complete paper
9
2010 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2010

A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. The system first accesses 100 distinct pages in some order and then accesses the same 100 pages but now in the reverse order. How many page faults will occur?

Open complete paper
10
2013 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2013 [Session 3]
What is the size of a page in KB in this computer?
Open complete paper
11
2014 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2014 [Session 1]
Assume that there are 3 page frames which are initially empty. If the page reference string is 1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6, the number of page faults using the optimal replacement policy is ____________.
Open complete paper
12
2014 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2014 [Session 2]
A FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is 4 bytes in size. Given a \(100 \times 10^6\) bytes disk on which the file system is stored and data block size is \(10^3\) bytes, the maximum size of a file that can be stored on this disk in units of \(10^6\) bytes is ____________.
Open complete paper
13
2014 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2014 [Session 3]
A system uses 3 page frames for storing process pages in main memory. It uses the Least Recently Used (LRU) page replacement policy. Assume that all the page frames are initially empty. What is the total number of page faults that will occur while processing the page reference string given below?
4, 7, 6, 1, 7, 6, 1, 2, 7, 2
Open complete paper
14
2014 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2014 [Session 3]
Consider a paging hardware with a TLB. Assume that the entire page table and all the pages are in the physical memory. It takes 10 milliseconds to search the TLB and 80 milliseconds to access the physical memory. If the TLB hit ratio is 0.6, the effective memory access time (in milliseconds) is ______.
Open complete paper
15
2016 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2016 [Session 1]
Consider a computer system with 40-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one-level page table per process and each page table entry requires 48 bits, then the size of the per-process page table is ______________ megabytes.
Open complete paper
16
2016 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2016 [Session 1]
Consider a computer system with ten physical page frames. The system is provided with an access sequence \((a_1, a_2, \ldots, a_{20}, a_1, a_2, \ldots, a_{20})\), where each \(a_i\) is a distinct virtual page number. The difference in the number of page faults between the last-in-first-out page replacement policy and the optimal page replacement policy is ______________.
Open complete paper
17
2016 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2016 [Session 2]
Consider a computer system with 40-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one-level page table per process and each page table entry requires 48 bits, then the size of the per-process page table is __________ megabytes.
Open complete paper
18
2016 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2016 [Session 2]
Consider a computer system with ten physical page frames. The system is provided with an access sequence \((a_1, a_2, \ldots, a_{20}, a_1, a_2, \ldots, a_{20})\), where each \(a_i\) is a distinct virtual page number. The difference in the number of page faults between the last-in-first-out page replacement policy and the optimal page replacement policy is __________.
Open complete paper
19
2017 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2017 [Session 2]
In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed?
I. Contiguous
II. Linked
III. Indexed
Open complete paper
20
2018 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2018 [Session 2]
Consider a process executing on an operating system that uses demand paging. The average time for a memory access in the system is \(M\) units if the corresponding memory page is available in memory, and \(D\) units if the memory access causes a page fault. It has been experimentally measured that the average time taken for a memory access in the process is \(X\) units.
Which one of the following is the correct expression for the page fault rate experienced by the process?
Open complete paper

Showing 20 of 41 questions