ExamSIDE (Powered by ExamGOAL)
Questions
PREVIOUS NEXT
1
GATE CSE 2021 Set 1
MCQ (More than One Correct Answer)
+1
-0
In the context operating systems, which of the following statements is/are correct with respect to paging?
A
Paging incurs memory overheads.
B
Paging helps solve the issue of external fragmentation.
C
Page size has no impact on internal fragmentation.
D
Multi-level paging is necessary to support pages of different sizes.
2
GATE CSE 2020
MCQ (Single Correct Answer)
+1
-0.33
Consider allocation of memory to a new process. Assume that none of the existing holes in the memory will exactly fit the process's memory requirement. Hence, a new hole of smaller size will be created if allocation is made in any of the existing holes. Which one of the following statements is TRUE?
A
The hole created by worst fit is always larger than the hole created by first fit.
B
The hole created by best fit is never larger than the hole created by first fit.
C
The hole created by first fit is always larger than the hole created by next fit.
D
The hole created by next fit is never larger than the hole created by best fit.
3
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+1
-0.3
In which one of the following page replacement algorithms it is possible for the page fault rate to increase even when the number of allocated frames increases?
A
$$LRU$$ (Least Recently Used)
B
$$OPT$$ (Optimal Page Replacement)
C
$$MRU$$ (Most Recently Used)
D
$$FIFO$$ (First In First Out)
4
GATE CSE 2015 Set 1
Numerical
+1
-0
Consider a system with byte-addressable memory, 32-bit logical addresses, 4 kilobyte page size and page table entries of 4 bytes each. The size of the page table in the system in megabytes is ________.
Your input ____
PREVIOUS NEXT
GATE CSE Subjects
Theory of Computation
Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine Undecidability
Operating Systems
Process Concepts and Cpu Scheduling Synchronization and Concurrency File System IO and Protection Deadlocks Memory Management
Algorithms
Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method P and NP Concepts Dynamic Programming
Digital Logic
Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits
Database Management System
Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing
Data Structures
Arrays Stacks and Queues Linked List Trees Graphs Hashing
Computer Networks
Concepts of Layering Lan Technologies and Wi-Fi Data Link Layer and Switching Network Layer Routing Algorithm TCP UDP Sockets and Congestion Control Application Layer Protocol Network Security
Software Engineering
Software Engineering
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Web Technologies
Web Technologies
General Aptitude
Numerical Ability Logical Reasoning Verbal Ability
Discrete Mathematics
Mathematical Logic Probability Set Theory & Algebra Combinatorics Linear Algebra Graph Theory Calculus
Programming Languages
Basic of Programming Language Function and Recursion Pointer and Structure in C
Computer Organization
Computer Arithmetic Memory Interfacing Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSATMHT CETKCETCOMEDKVITEEEAP EAPCET
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12