Operating Systems - Quiz(Unit 1) Batch-I
Operating Systems Quiz - Test Your Knowledge!
Welcome to the Operating Systems Quiz! This quiz is designed for those who want to challenge their understanding of operating systems fundamentals. Whether you are a student or a professional in the field, test your knowledge and see how well you know the ins and outs of processes, threads, and system states.
Key Features:
- 10 multiple-choice questions
- Instant feedback on your performance
- Great for exam preparation or just fun!
A multi-user, multi-processing operating system cannot be implemented on hardware that does not support:
Address translation
DMA for disk transfer
At least two modes of CPU execution (privileged and non-privileged
Demand Paging
The maximum number of processes that can be in Ready State for a computer system with n CPU is
N
N^2
2^n
Independent of n
A process executes the code fork(); fork(); fork(); The total number of child processes created is
3
4
7
8
Consider the following statements about process state transitions for a system using preemptive scheduling. I. A running process can move to ready state. II. A ready process can move to ready state. III. A blocked process can move to running state. IV. A blocked process can move to ready state.
I, II and III only
II and III only
I, II and IV only
I, II, III and IV
The following C program is executed on a Unix/Linux system: #include<< unistd.h > int main () { int I ; for (i=0; i<10; i++) if (i%2 == 0) fork ( ) ; return 0 ; } The total number of child processes created is ____
32
31
64
63
The following two functions P1 and P2 that share a variable B with an initial value of 2 execute concurrently. P1() { C=B-1; B=2*C; } P2(){ D=2*B; B= D-1; } The number of distinct values that B can possibly take after the execution is -------
2
3
4
1
A process having multiple threads of control implies
Only one task at a time, but much faster
More than one task at a time
Only one thread per process to use
All of the above
A thread is usually defined as a ''light weight process'' because an operating system (OS) maintains smaller data structures for a thread than for a process. In relation to this, which of the following is TRUE?
On per-thread basis, the OS maintains only CPU register state.
The OS does not maintain a separate stack for each thread.
On per-thread basis, the OS does not maintain virtual memory state.
On per-thread basis, the OS only maintains scheduling and accounting
Consider the following code fragment: if (fork() == 0) { a = a + 5; printf("%d, %d \n", a, &a); } else { a = a - 5; printf ("%d, %d \n", a, &a); } Let u,v be the values printed by the parent process, and x,y be the values printed by the child process. Which one of the following is TRUE?
U = x+10 , v = y
U = x=10, v != y
U+10 = x, v = y
U+10 = x, v !=y
Which one of the following is FALSE? a. User level threads are not scheduled by the kernel. b. When a user level thread is blocked, all other threads of its process are blocked. c. Context switching between user level threads is faster than context switching between kernel level threads. d. Kernel level threads cannot share the code segment.
A
B
C
D
{"name":"Operating Systems - Quiz(Unit 1) Batch-I", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Welcome to the Operating Systems Quiz! This quiz is designed for those who want to challenge their understanding of operating systems fundamentals. Whether you are a student or a professional in the field, test your knowledge and see how well you know the ins and outs of processes, threads, and system states.Key Features:10 multiple-choice questionsInstant feedback on your performanceGreat for exam preparation or just fun!","img":"https:/images/course1.png"}