Memory Management 16-30

1.       A disc queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67 If the head is initially at 53rd cylinder, what will be the total number of cylinders traversed if we are using SSTF disc scheduling algorithm.
1) 156  
2) 236  
3) 366 
4) 456
Answer: 2
2.       The Best-Fit algorithm for allocating regions of contiguous memory does_________ 
1) Scan memory region list from start for first fit
2) Pick the closest free region in the entire list.
3) There is no such algorithm
4) Find the worst fit in the entire list 
Answer: 2
3.       Question: From the given data Bytes/Sector = 500
Sectors/Track = 50
Tracks/Platter = 150
Platters/ Hard Disk = 10
Data Transfer rate = 10 millisecs per byte
Total number of millisecs taken to transfer all the bytes in the hard disk?
1) 500 x 50 x 10 x 10
2) 500 x 50 x 150 x 10 
3) 500 x 50 x 150 x 10 x10 
4) 500 x 150 x 10 x10
Answer: 3
4.       From the given data Bytes/Sector = 500
Sectors/Track = 50
Tracks/Platter = 150
Platters/ Hard Disk = 10
Data Transfer rate = 10 millisecs per byte
Total number of millisecs taken to transfer the bytes from one single platter?
1) 500 x 50 x 150 x 10
 2) 500 x 50 x 10
 3) 500 x 150 x 50 x 10
 4) 500 x 150 x 10 x10
Answer: 1
5.       From the given data Bytes/Sector = 500
Sectors/Track = 50
Tracks/Platter = 150
Platters/ Hard Disk = 10
Data Transfer rate = 10 millisecs per byte
Total number of ms taken to transfer all the bytes from a cylinder cylinder? 
1) 500 x 50 x 10 x 10
2) 500 x 150 x 50
3) 500 x 150 x 10 x10
4) 50 x 150 x 10 x10
Answer: 1
6.        In a Hard disk,  Bytes per sector = 512
Sectors/track = 63
Number of Magnetic disks = 5
Tracks / platter = 50
Total number of bytes in a cylinder is ________
1) 512X 63X 5 
2) 512X 50X 5 
3) 512X 63 X 50 
4) 512 X 5
Answer: 1
7.       In a Hard disk,  Bytes per sector = 512
Sectors/track = 63
Number of Magnetic disks = 5
Tracks / platter = 50
The total number of bytes/platter is _____
1) 512X 63X 5
2) 512X 50X 5
3) 512X 63 X 50 
4) 512 X 5
Answer: 3
8.       In a Hard disk,  Bytes per sector = 512
Sectors/track = 63
Number of Magnetic disks = 5
Tracks / platter = 50
The total number of cylinders in the hard disk is_______.
1) 63 
2) 50 
3) 512 
4) 63 X 5
Answer: 2
9.       The size of single unit of allocation on disk is called ____.
1) Sector size 
2) Page size 
3) Segment size  
4)File size
Answer: 1
10.   Memory utilization factor shall be computed as follows 
(A)   memory in use/allocated memory.
(B)   memory in use/total memory connected.
(C) memory allocated/free existing memory.
 (D) memory committed/total memory available.  
                                Answer: B
11.     ‘LRU’ page replacement policy is                   
(A)    Last Replaced Unit.                 
(B) Last Restored Unit.
(C)  Least Recently Used.               
(D) Least Required Unit.           
Ans: (C)
12.     Nested Macro calls are expanded using the 
(A)    FIFO rule (First in first out)       
 (B)  LIFO (Last in First out)
(C)  FILO rule (First in last out)         
(D)  None of the above                     
Ans: (B) 
13.     A parser which is a variant of top-down parsing without backtracking is       
(A) Recursive Descend.          
 (B) Operator Precedence.                  
 (C) LL(1) parser.                     
  (D) LALR Parser.                                                                       
Ans: (A)    
14.    The expansion of nested macro calls follows 
(A)  FIFO rule.                                 
(B)  LIFO rule. 
(C)  LILO rule.                                
 (D)  priority rule.                         
Ans: (B) 
15.    In a two-pass assembler, the task of the Pass II is to  
(A)  separate the symbol, mnemonic opcode and operand  fields.                                        (B)  build the symbol table.
(C)  construct intermediate code.         
(D) synthesize the target program.                 

                                                Ans: (D)



Previous Page                                                                  Next Page

No comments:

Post a Comment

Thank you for using this blog.