stud
bud
Sign up
Log in
Home
Library
Explore
SAT
More
Net1 red Flashcards | StudBud
Explore
/
Net1 red
Net1 red
32 terms
·
StudBud Administration
·
10 plays
Imported from external platform
Flashcards
32 cards
F
Practice quiz
P
Host live
L
Questions
32
Answers
1
In linked allocation it is easy to get the contigous memory space .
True
False
2
Average access time=Average seek time+Average rotational delay+Transfer time+Controlled over head
False
True
3
Transfer time of a disk structure will be ranging in
Micro seconds
Nano seconds
Seconds
Milli seconds
4
Segmentation not supports virtual memory.
False
True
5
Which of the following systems provides high levels of fault tolerance?
Time sharing
Distributed
Multiprogramming
Real time
6
What is a page?
Blocks of physical memory
Blocks of virtual memory
Blocks of logical memory
None
7
A directory is a
Storage device
File
System program
None of the above
8
______ software is used to store large programs in a small adress space
Paging
Segmentation
Fragmentation
Overlays
9
Address generated by the CPU at compile and load time______
None
Physical
Logical
Virtual
10
When a process wants to access a resource which operation is required??
Verhogen
Probern
11
Which of the following algorithm requires the O.S to have perfect knowledge of future events?
Least recently used
Round Robin
Optimal
Shortest seek time first
12
Which of the mechanisms used to convert virtual memory to physical memory?
Framing
Fragmentation
Paging
Segmentation
13
Monolithic kernel is very portable .
True
False
14
Which of the following contain slender magnetizable covering extented a plactic film of thin strip.
Registers
Main memory
Magnetic disks
Magnetic tapes
15
Which of the following is used to creating maintaining and manipulating the files.
Both a and b
File management
File system
File system management
16
The parameter used to indicate the working set window size.
W
∆
Both a and b
t
17
A directed edge Pi<--Rj is called a
Request edge
Process edge
Assignment edge
Resource edge
18
In memory hierarchy when we shift from bottom to top the ability is increases
True
False
19
The memory gives us a illusion that is there is large pool of memory is available.
Cache memory
Physical memory
Registers
Virtual memory
20
A process that waits too long in lower priority queue is moved to higher priority queue in ______algorithm.
Both a and b
Multilevel queue
Multilevel feedback queue
Round Robin
21
A status word register doesn't store the data like mathematical operations.
True
False
22
Wait operation____
Increment
Decrement
Equal
23
s!=0 then
s=s-1
none
s=s+1
s==0
24
What is the size of the page ?
512 bits between 1892 bits
512 bits between 8194 bytes
512 bytes between 8192 bits
512 bytes between 8192 bytes
25
Which of the following is associated with concept of communication network?
FIFOs
Sockets
Pipes
Distributed systems
26
______is used to identify whether the Operation is to be executed or the CPU has to wait
Critical section
None
Both a and b
Semaphore
27
Index allocation doesn't removes external fragmentation.
False
True
28
What is the advantage of memory hierarchy?
Data can't be spread all over
Swapping is more difficult
No internal fragmentation
Data can be spread all over
29
The following process has more responsible time.
Student process
Batch process
System process
Interative process
30
Transfer rate is measured in kbps
True
False
31
The following one is an example for one process with multiple threads .
Java
Linux
Solarix
Windows 2000
32
Tightly coupled system--Individual process within the single processor system share global shared memory
False
True
