Bsys
Ultimate Operating Systems Knowledge Quiz
Test your knowledge of operating systems with our comprehensive quiz designed for both students and professionals. With 65 challenging questions, you'll cover a range of essential topics, from process management to memory types.
- Over 65 thought-provoking questions
- Covers a wide array of OS concepts
- Perfect for students and tech enthusiasts
Which Statement is true? Operating systems…
Provide system services for application programs
Are always monolithic
Are managing hardware resources
Provide abstractions to application programmers
Are running in user mode only
Other
Please Specify:
By any operating system, the resource management can be done via…
Division multiplexing
Digital multiplexing
Code-division multiplexin
Space division multiplexing
Time division multiplexing
Which of the following are examples for space multiplexed resources?
Multi Core CPU
Memory (RAM)
Printer
Single Core CPU
Keyboard
Which of the following statements are true? In an interrupt driven input/output: The CPU runs a user written code and does accordingly.
The CPU receives an interrupt when new data has arrived and is ready to be retrieved by the processor
The CPU uses polling to watch the control bit constantly, looping to see if the device is ready.
The CPU writes one data byte to the data register and sets a bit in control register to show that a byte is available
The process waiting for the I/O data remains in the CPU.
User programs access operating system services via
I/O interrupts
System calls
Service calls
Direct memory access
Application programming interfaces (APIs), e.g. POSIX, Win32 API
Which of the following statements regarding memory is true?
Registers are CPU-internal memory, made of the same material as the CPU.
Disk memory (HDDs) is about 100 times cheaper than RAM but data access is 1000 times slower compared to RAM
Moores law states, that the number of CPUs on a chip doubles every 18 months.
The size of Random Access Memory of a 64-bit CPU is typically 64 x 64 bits.
Solid State Drives (SDD) have smaller and faster moving parts than Hard Disk Drives (HDDs). Therefore data write/read access is about 10 to 20 times faster.
In which ways can Input and output be done?
Interrupt
Random Access
Digital Analog Converter (DAC)
Busy waiting
Direct Access Memory (DMA)
Which of the following is true for processes?
Possible process states are: ready, running, waiting
A process is the part of a program loaded into main memory
A process is associated with an address space in main memory
A process is a program in execution
Possible process states are: ready, running, interrupted.
Which of the following is true for the root directory of file systems?
There is no single root directory in Microsoft Windows file systems.
There is no single root directory in Unix-like file systems (Linux, MacOS,..)
/root’ is the directory in Unix-like operating systems (Linux, MacOS,..)
/’ is the root directory in Unix-like operating system (Linux, MacOS,..)
\’ is the root directory in Microsoft Windows file systems.
What sections does the image of a process in memory consists of?
Data
Text
Stack
Heap
Variables
Code
Pointer
Program Counter
What is the ready state of a process?
When all threads of a process are finished.
When the process has finished its execution .
When the process is using the CPU.
When the process is unable to run until some task has been completed.
When the process is scheduled to run after some other processes execution.
Which items are shared by all thready in a process?
Program counter
Address space
Open files
Global variables
Stack
Child processes
What of the following is true for a thread?
A thread can belong to more than one process.
A thread has its own address space and data.
A thread shares and memory with the process
It is a flow of execution through the process code, sharing the process program counter and stack.
All threads of a process share their address space and data.
In a time-multiplexed operating system, when the time slot given to a process is completed, the process is completed, the process goes from the running state to the:
Ready state
Terminated state
Waiting state
Scheduled state
Suspended state
Suppose that a process is in “Waiting” state waiting for some I/O service. When the service is completed, it goes to the:
Ready state
Suspended state
Terminated state
Running state
Scheduled state
Which of the following are methods used for inter process communication?
Sockets
Pipes
Shared memory
Shared ports
Channels
Messages
Whistles
Interrupts
Which of the following is true for pipes?
Ordinary pipes are bidirectional.
Ordinary pipes can be accessed without a parent-child relationship.
Ordinary pipes are unidirectional
Pipes allow to processes to communicate. .
Named pipes are bidirectional
What is the POSIX system call Pthread_join used for?
To merge the results of two threads
To wait for a specific thread to finish
To merge the execution to two threads into a single thread.
To start a new thread
To load a thread into the process address space in memory.
Which is the following is true? At the particular time of computation the value of a counting semaphore is 7. Then 20 acquire operations and 15 release operations were completed on this semaphore. The resulting value of the semaphore is:
7
2
28
42
12
Which of the following are true? A Semaphore is a shared integer variable…
That can not be more than zero.
That can not drop below zero.
That can not be more than one.
That can be more than two.
Which of the following is true? Consider the following set of processes in the scheduling queue, the length of the CPU burst time given in milliseconds:Assuming the above process being scheduled with Shortest Job First scheduling algorithm:
The waiting time for P1 is 3ms
The waiting time for P1 is 0ms
The turn around time for P1 is 6ms
The waiting time for P1 is 15ms
The turn around time for P1 is 9ms
Which of the following are true? Scheduling is done by the operating system so as to…
Increase CPU utilization
Increase the turn around time
Increase the throughput
Keep the CPU more idle
Decrease CPU utilization
Which of the following are true?
A mutex is typically an integer variable with values greater than 1.
A lock acquired on a mutex can be released only by the process that has acquired the lock
A semaphore can be modified by any process
A semaphore is typically an integer variable
A semaphores allows multiple program threads to access a finite instance of resources.
Mutual exclusion can be provided by:
Mutex locks
Critical regions
Binary exclusions
Safe areas
Binary semaphores
Which of the following is true? Inter process communication…
Is the communication and synchronization between two processes.
Allows processes to only synchronize their actions without communication.
Allows processes to only communicate and synchronize their actions when using the same address space.
Allows processes to communicate and synchronize their actions without using the same address space.
Is the communication and synchronization between threads of the same processes.
There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have short runtime e.g. Less than 10 ms.
TQ = 100ms
TQ = 50ms
TQ = 40ms
TQ = 15ms
TQ = 45ms
If several processes the same data as the same time and the result of the execution depends on the respective order in which the access takes place, this is called…
A dynamic condition
A safe condition
A race condition
A critical condition
An essential condition
What is the ready state of a process?
When the process is using the CPU
When the process is scheduled to run after some other processes execution
When all threads of a process are finished
When all threads of a process are finished
When the process is unable to run unzil some task has been completed
Consider the following snapshot of a system running 3 processes:E is the vector for existing resources. C is the Current Allocation Matrix and R is the available Resources Matrix. What is the content of the Available Resource Vector A?
A = ( [ 1 ] [ 0 ] [ 1 ] [ 1 ] )
Which processes are deadlocked? None
A computer system hat 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. What is the maximum value of ‘n’ for which the system is guaranteed to be deadlock free?
3
6
1
2
4
Your operating system is set up to detect and recover from deadlocks. When should your OS check for deadlocks?
When CPU utilization drops below threshold.
Periodically (every n seconds).
When CPU utilization rises above threshold.
When the process request the same resource.
Every time a resource request is made
A problem encountered in multiprogramming when a process is perpetually denied necessary
Exclusion
Aging
Starvation
Deadlock
Inversion
Which of the following are true?If one thread opens a file with read privileges then:
Any other thread can not read from that file.
Other threads in the same process can also write to that file.
Other threads in the same process can also read from that file
No thread can write to that file.
Other threads in another process can also read from that file.
Which one of the following conditions are required for a deadlock?
Circular wait condition
A process may hold allocated resources while awaiting assignment of other resources.
No resource can be forcibly removed from a process holding it.
No assumptions may be made about speeds or the number of CPUs.
Preemptive scheduling.
No two processes may be simultaneously inside their critical regions.
No resource may be allocated by more than two processes.
Mutual exclusion
Whats should Linux/Unix programs do? (Peter H. Salus)
Work together
Handle binary streams
As much as possible
None of them
Just one thing
Which statement about pruefung.1.test is true? drwx---rwx 2 root hans 4096 Jan 13 2020 pruefung1.test
Hans is the owner of the file
The filetype is test
Hans is the owner group of the file
Users which are not in a group hans can execute the file
Users in group hans are allowed to read the file
Debian, Ubuntu Kali and Mint are…
Shells
Linux Kernels
Linux commands
Linux Distributions
Operating Systems
If a page number is not found in the TLB, then it is known as a…
TLB hit
Hard miss
Page fault
Buffer miss
Soft miss
What statement/s about Bitmaps is/are true?
The larger the allocation unit, the smaller the bitmap.
A bitmap is a list which shows if a unit is free or occupied
It is easy to find appropriate holes via bitmap.
Bitmaps are always more efficiant than linked lists.
Which memory management algorithm produces the smallest holes by design?
Best Fit
Buddy
Worst Fit
First Fit
Next Fit
Which registers are needed to create an address space?
Swap Register
Base Register
Start Register
Page Register
Limit Register
Which statement/s about paging is/are true?
Page frames are larger than pages so that pages fit into the page frames.
The virtual address is translated by the MMU
When a Page Fault occurs the Os crashes.
The content of a Page is immediately written to disk.
Which statement/s is wrong about using no memory abstraction?
It is not used anymore today
It is easy to run multiple programs at once
The Os can be easily trashed.
It is very secure
For which page replacement algorithm is the modified bit needed?
Clock
Not Frequently used (NFU)
Not Recently Used (NRU)
Second Chance
First-In, First Out (FIFO)
Which statement/s about filenames is/are true?
Filenames are always case sensitive
File names can be of any length.
File extensions must have three letters.
Unix filenames are case sensiitiv
By using the specific system call, we can ...
... Read a file
... Create a file
... Set attributes of a file
... Rename a file
... Zip a file
You are in /home/markus you enter cd .././alice/markus/../../tmp Where are you now?
/home/tmp
/home/markus
/home/alice/tmp
/tmp
/home/markus/tmp
Shining shimmering splendid the princess now when did you last let your heart What are possible state transisions of a process?
Ready -> waiting
Running -> ready
Ready -> running
Scheduled -> running
Waiting -> running
For which page replacement algorithm is the referenced bit needed?
Clock
Clock
First-In, First Out (FIFO)
Second Chance
Not Recently Used (NRU)
Not Frequently used (NFU)
What can be a part of a page table entry?
Page Frame Number
Security Bit
Protection Bit
Referenced Bit
Modified Bit
Copy on Write Bit
Which statement/s about the magic number is/are true
It is the first value of every file.
It is at the end of a file.
It is an Identifier for a file format
"CAFEBABE" is the Magic Byte for compiled Java Class Files.
What is a disadvantage of FAT?
Internal Fragmentation
Random access much faster
Entire table must be in memory
Entire block is available for data
Does not scale with disk size
What is the first part of a Disk (first sector)?
UEFI
GUID Partition Table
None of the answers
BIOS
Master Boot Record
What is returned by the POSIX' fork() system call?
The process ID (pid) of the calling process
The user ID (uid) of the user associated with the new process.
The user ID (uid) of the calling user.
A return code stating the result of the call (e.g., -1 if an error has occured)
The process ID (pid) of the created process.
{"name":"Bsys", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Test your knowledge of operating systems with our comprehensive quiz designed for both students and professionals. With 65 challenging questions, you'll cover a range of essential topics, from process management to memory types.Over 65 thought-provoking questionsCovers a wide array of OS conceptsPerfect for students and tech enthusiasts","img":"https:/images/course2.png"}