Exams
Subjects
Classes
Home
Exams
Computer Science and IT Engineering
Operating Systems
a computer uses 57 bit vi...
Question:
medium
A computer uses 57-bit virtual addresses with multi-level tree-structured page tables (L levels). Page size = 4 KB and each page-table entry (PTE) = 8 bytes. Find \(L\).
Show Hint
For multi-level paging: \( \text{levels} = \dfrac{\text{VPN bits}}{\log_2(\text{entries per page})}\). Here VPN bits \(= \text{VA} - \text{offset}\) and entries/page \(= \dfrac{\text{page size}}{\text{PTE size}}\).
GATE CS - 2023
GATE CS
Updated On:
Jan 31, 2026
Show Solution
Correct Answer:
5
Solution and Explanation
Download Solution in PDF
Was this answer helpful?
0
Top Questions on Operating Systems
Arrange the following layers of MS DOS operating system starting from inner most to outer most.
(A). ROM BIOS Device drivers
(B). Resident System Program
(C). MS DOS Device Drivers
(D). Application Program
CUET (PG) - 2025
Computer Science
Operating Systems
View Solution
What is the primary function of an operating system?
CUET (UG) - 2025
Computer Science
Operating Systems
View Solution
What is the purpose of the ‘virtual memory’ in an operating system?
CUET (UG) - 2025
Computer Science
Operating Systems
View Solution
What are the user access control permissions for file and directory defined in Unix/Linux? Draw a table showing permission type and symbol.
CBSE Class XII - 2025
Electronics and hardware
Operating Systems
View Solution
Want to practice more? Try solving extra ecology questions today
View All Questions
Questions Asked in GATE CS exam
With respect to a TCP connection between a client and a server, which of the following is true?
GATE CS - 2026
Computer Networks
View Solution
Let $P, Q, R, S$ be relational schemas. Let ``$\rightarrow$'' indicate a functional dependency (FD) in this context. Which of the following best describes the meaning of a functional dependency?
GATE CS - 2026
Database Management Systems
View Solution
Let a Non-deterministic Finite Automaton (NFA) have 6 states over a finite alphabet. Which of the following cannot be the number of states in a minimal Deterministic Finite Automaton (DFA) that is equivalent to this NFA?
GATE CS - 2026
Theory of Computations
View Solution
A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?
GATE CS - 2026
Computer Organization and Architecture
View Solution
Consider $Z = X - Y$, where $X$, $Y$ and $Z$ are all in sign-magnitude form. $X$ and $Y$ are each represented in $n$ bits. To avoid overflow, the representation of $Z$ would require a minimum of:
GATE CS - 2026
Computer Organization and Architecture
View Solution