Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors

CBSE Net 2017

Photo of author

By Team EasyExamNotes

Updated: 29-September-2017

CBSE NET JAN 2017 PAPER III

OPERATING SYSTEM QUESTIONS

A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively :
(1) 14 and 15
(2) 14 and 29
(3) 15 and 14
(4) 16 and 32

Ans:- 3

Explanation:

Page size = frame size for minimizing the internal fragmentation.

LOGICAL ADDRESS CALCULATION:
Number of bits for logical address = Number of bits to represent pages + Number of bits to represent bytes per page size.

Here, number of pages = 64, and 512 bytes page size.

64 = 26 . So, number of bits to represent pages = 6.

512=29. So, number of bits to represent bytes per page size = 9.

So, the number of bits for logical address = 6 + 9 = 15

PHYSICAL ADDRESS CALCULATION:
Number of bits for physical address = Number of bits to represent frames+Number of bits to represent bytes per frame size.
Here, number of page frames = 32, and frame size is the same as page size which is 512 bytes.
32 = 25. So, number of bits to represent frames = 5.

512=29. So, number of bits to represent bytes per frame size = 9.

So, the number of bits for physical address = 5 + 9 = 14.

Therefore, the number of bits required in logical and physical address are 15 and 14 respectively.

So, the correct answer is 3.

Download as PDF

Related posts:

  1. CBSE NET 2004 38
  2. Cbse net 2004 37
  3. Cbse net 2004
  4. Ugc net 2017 solved
  5. NET 4
  6. NET 1
  7. Net 28
  8. Net 26
  9. Net 50
  10. Net 49
  11. Net 48
  12. Net 46
  13. Net 44
  14. Net 40
  15. Net 39
  16. Operating System: A List of Video Lectures RGPV Notes
  17. GATE, Context switch calculation in SRTF algorithm | Prof. Jayesh Umre
  18. Net 42
  19. Introduction to Operating Systems
  20. Different Types of OS
  21. Characteristics and features of an OS
  22. Operating sytems services
  23. System Calls in OS
  24. File Systems
  25. How many page faults
  26. Process State Diagram
  27. Operating System Scheduler
  28. FIFO page replacement algorithm
  29. LRU page replacement algorithms
  30. Optimal page replacement algorithm
  31. SRTF shortest remaining time first
  32. OS 4
  33. OS 3
  34. Os 2
  35. Os 1
  36. Net 14
  37. Net 13
  38. Net 12
  39. Net 11
  40. Net 10
  41. Net 9
  42. Net 9
  43. Net 8
  44. Net 7
  45. Net 6
  46. Net 5
  47. NET 3
  48. NET 2
  49. Net 35
  50. Net 34
  51. Net 33
  52. Net 32
  53. Net 31
  54. Net 29
  55. Net 30
  56. Net 27
  57. Net 52
  58. Net 51
  59. Net 47
  60. Net 45
  61. Net 43
  62. Net 41
  63. Net 38
  64. Net 37
  65. Net 36
  66. UGC NET November 2017 Paper II
  67. GATE, Longest Remaining Time First Algorithm | Prof. Jayesh Umre
  68. GATE SRTF | What is the total waiting time for process P2?
  69. GATE Calculate Total Waiting Time SRTF algorithm | Prof. Jayesh Umre
  70. Memory management
  71. Concept of Threads
  72. Process concept
  73. Directory Structure OS
  74. Contiguous disk space allocation method
  75. File systems
  76. Types of os
  77. Evolution of os
  78. Functions of os
  79. Why is operating system a mandatory software?
  80. UGC NET CS Paper 2 June 2012
  81. Readers Writes Problem | UGC NET Dec 2018
  82. Suppose a system has 12 instances | UGC NET Dec 2018
  83. Data warehouse | UGC NET Dec 2018
  84. Bankers algorithm problems
  85. Diploma Linux Unit 3
  86. RGPV Diploma Linnux Unit 2
  87. Program to print string in reverse order
  88. Program to implement while loop in Linux
  89. Program to implement for loop using sequence keyword in Liux
  90. Program to implement different types of increment in Linux
  91. For loop without in keyword in Linux
  92. Program to implement for loop using in keyword in Linux
  93. Multiple Processor Scheduling
  94. What do you mean by Virtual Memory? Write down its advantages?
  95. Compare Paging and Segmentation?
  96. What is Process Scheduling, CPU Scheduling, Disk Scheduling? Explain Short, Medium and Long term Scheduler?
  97. Explain concept of a process with its components ?
  98. Explain the following in brief Contiguous and Linked list allocation for implementing file system?
  99. Explain various Disk scheduling algorithms with Illustrations ?
  100. Define process and thread. What is PCB ? Explain its various entries with their usefulness ?
  101. Discuss advantages and disadvantages of the Buffer cache ?
  102. Explain different types of OS with examples of each ?
  103. What is an Operating System? Write down its desirable characteristics ?
  104. Define a deadlock ? Write down the conditions responsible for deadlock? How can we recover from deadlock ?
  105. What are the various services provided by Operating system ?
  106. What do you mean by PCB? Where is it used? What are its contents? Explain.
  107. What is Binary and Counting semaphores ?
  108. What is File? What are the different File attribute and operations?
  109. What are System call? Explain briefly about various types of system call provided by an Operating System?
  110. Describe necessary conditions for deadlocks situation to arise.
  111. What are points to be consider in file system design? Explain linked list allocation in detail?
  112. Write a Semaphore solution for dining Philosopher’s problem?
  113. Consider the following page reference string:1,2,3,4,5,3,4,1,2,7,8,7,8,9,7,8,9,5,4,5. How many page faults would occur for the following replacement algorithm, assuming four frames:a) FIFOb) LRU
  114. Explain CPU schedulers in operating system?
  115. Write the different state of a process with the help of Process state deagram?
  116. What is Mutex in operating system?
  117. Explain Network operating system?
  118. What do you mean by paging in operating system ?

Leave a Comment