Deck 3: Processes
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/55
Play
Full screen (f)
Deck 3: Processes
1
If process P0 is switched to process P1, state for P0 will be saved into ____, and state from ___ will be reloaded?
A) PCB0, PCB0
B) PCB0, PCB1
C) PCB1, PCB0
D) PCB1, PCB1
A) PCB0, PCB0
B) PCB0, PCB1
C) PCB1, PCB0
D) PCB1, PCB1
B
2
The list of processes waiting to execute on a CPU is called a(n) ____.
A) standby queue
B) device queue
C) ready queue
D) interrupt queue
A) standby queue
B) device queue
C) ready queue
D) interrupt queue
C
3
Which of the following contains memory allocated by malloc()?
A) text section
B) data section
C) heap section
D) stack section
A) text section
B) data section
C) heap section
D) stack section
C
4
Which of the following cases could force a process removed from the CPU?
A) I/O request
B) fork a child
C) interrupt or time slice expired
D) all of the above
A) I/O request
B) fork a child
C) interrupt or time slice expired
D) all of the above
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
5
Which of the following structures defines the process control block for Linux system?
A) task_struct
B) files_struct
C) mm_struct
D) schedu_entity
A) task_struct
B) files_struct
C) mm_struct
D) schedu_entity
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
6
Which of the following is true?
A) An I/O-bound process is one that spends more of its time doing I/O than it spends doing computations
B) An I/O-bound process is one that spends more of its time doing computations than it spends doing I/O
C) Both A and B
D) None of the above
A) An I/O-bound process is one that spends more of its time doing I/O than it spends doing computations
B) An I/O-bound process is one that spends more of its time doing computations than it spends doing I/O
C) Both A and B
D) None of the above
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
7
Which of the following process state will be switched from "ready" state?
A) ready
B) terminated
C) waiting
D) running
A) ready
B) terminated
C) waiting
D) running
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
8
Which of the following contains dynamically allocated data during program run time?
A) text section
B) data section
C) heap section
D) stack section
A) text section
B) data section
C) heap section
D) stack section
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
9
Which of the following contains the executable code?
A) text section
B) data section
C) heap section
D) stack section
A) text section
B) data section
C) heap section
D) stack section
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
10
Which of the following process state will be switched from "running" state when an I/O event occurs?
A) ready
B) terminated
C) waiting
D) new
A) ready
B) terminated
C) waiting
D) new
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
11
Which of the following contains global data?
A) text section
B) data section
C) heap section
D) stack section
A) text section
B) data section
C) heap section
D) stack section
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
12
What is done by command "spy -el" on Unix and Linux systems?
A) list complete information for all processes currently active in the system
B) list complete information for all processes currently running in background
C) list complete information for all files currently open in the system
D) list complete information for all folders currently open in the system
A) list complete information for all processes currently active in the system
B) list complete information for all processes currently running in background
C) list complete information for all files currently open in the system
D) list complete information for all folders currently open in the system
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
13
What is the degree of multiprogramming for a single-processor system?
A) 0
B) 1
C) 2
D) 3
A) 0
B) 1
C) 2
D) 3
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
14
Which of the following process state will be switched from "running" state when an interrupt occurs?
A) ready
B) terminated
C) waiting
D) new
A) ready
B) terminated
C) waiting
D) new
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
15
Which of the following system calls is used to have a new program loaded into the new process's memory space?
A) fork()
B) exec()
C) wait()
D) exit()
A) fork()
B) exec()
C) wait()
D) exit()
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
16
Which of the following memory space dynamically grows from high memory to low memory?
A) text section
B) data section
C) heap section
D) stack section
A) text section
B) data section
C) heap section
D) stack section
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
17
Which of the following selects from among the processes that are in the ready queue to execute and allocate the CPU to one of them?
A) CPU scheduler
B) context switch
C) swapping
D) job scheduler
A) CPU scheduler
B) context switch
C) swapping
D) job scheduler
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
18
Which of the following data structure is used to manage the processes in Linux?
A) tree
B) linked list
C) hash map
D) stack
A) tree
B) linked list
C) hash map
D) stack
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
19
The ________ application is the application appearing on the display screen of a mobile device.
A) main
B) background
C) display
D) foreground
A) main
B) background
C) display
D) foreground
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
20
Which of the following system calls is used to let the parent process create a child process?
A) abort();
B) wait();
C) fork();
D) exec().
A) abort();
B) wait();
C) fork();
D) exec().
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
21
Explain why Google Chrome uses multiple processes.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
22
Explain the fundamental differences between the UNIX fork() and Windows CreateProcess() functions.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
23
Which of the following IPC mechanism is easier to implement in a distributed system?
A) shared memory
B) message passing
C) socket communication
D) ordinary pipe
A) shared memory
B) message passing
C) socket communication
D) ordinary pipe
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
24
Describe two approaches to the binding of client and server ports during RPC calls.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
25
Explain the purpose of external data representation (XDR).
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
26
Assume the shared buffer is implemented as a circular array with two logical pointers: in and out. The variable in points to the next free position in the buffer; out points to the first full position in the buffer. Which of the following is true?
A) The buffer is empty when in == out; the buffer is full when ((in + 1) % BUFFER SIZE) == out;
B) The buffer is full when in == out; the buffer is empty when ((in + 1) % BUFFER SIZE) == out;
C) All the elements of the buffer can be used;
D) Both A and C
A) The buffer is empty when in == out; the buffer is full when ((in + 1) % BUFFER SIZE) == out;
B) The buffer is full when in == out; the buffer is empty when ((in + 1) % BUFFER SIZE) == out;
C) All the elements of the buffer can be used;
D) Both A and C
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
27
Explain the term marshalling.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
28
Describe how UNIX and Linux manage orphan processes.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
29
The difference between a program and a process is that a program is an active entity while a process is a passive entity.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
30
Which of the following is true in a Mach operating system?
A) All messages have the same priority.
B) Multiple messages from the same sender are guaranteed an absolute ordering.
C) The sending thread must return immediately if a mailbox is full.
D) It is not designed for distributed systems.
A) All messages have the same priority.
B) Multiple messages from the same sender are guaranteed an absolute ordering.
C) The sending thread must return immediately if a mailbox is full.
D) It is not designed for distributed systems.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
31
Explain the terms "at most once" and "exactly once" and indicate how they relate to remote procedure calls.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
32
Child processes inherit UNIX ordinary pipes from their parent process because:
A) The pipe is part of the code and children inherit code from their parents.
B) A pipe is treated as a file descriptor and child processes inherit open file descriptors from their parents.
C) The STARTUPINFO structure establishes this sharing.
D) All IPC facilities are shared between the parent and child processes.
A) The pipe is part of the code and children inherit code from their parents.
B) A pipe is treated as a file descriptor and child processes inherit open file descriptors from their parents.
C) The STARTUPINFO structure establishes this sharing.
D) All IPC facilities are shared between the parent and child processes.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
33
Ordinarily the exec() system call follows the fork(). Explain what would happen if a programmer were to inadvertently place the call to exec() before the call to fork().
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
34
Explain the concept of a context switch.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
35
What is a loopback and when is it used?
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
36
Explain the difference between an I/O-bound process and a CPU-bound process.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
37
Which of the following is not a process type in the Chrome browser?
A) Plug-in
B) Renderer
C) Sandbox
D) Browser
A) Plug-in
B) Renderer
C) Sandbox
D) Browser
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
38
Explain the main differences between a short-term and long-term scheduler.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
39
Name the three types of sockets used in Java and the classes that implement them.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
40
Name and describe the different states that a process can exist in at any given time.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
41
Background processes are not apparent to users.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
42
The iOS mobile operating system only supports a limited form of multitasking.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
43
Using a section object to pass messages over a connection port avoids data copying.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
44
Ordinary pipes are unidirectional, allowing only one-way communication.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
45
Sockets are considered a high-level communications scheme.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
46
The exec() system call creates a new process.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
47
The Mach operating system treats system calls with message passing.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
48
For a single-processor system, there will never be more than one process in the Running state.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
49
All access to POSIX shared memory requires a system call.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
50
init is the very first process for a typical Linux system.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
51
Ordinary pipes in Windows require a parent-child relationship between the communicating processes.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
52
All processes in UNIX first translate to a zombie process upon termination.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
53
Local Procedure Calls in Windows XP are similar to Remote Procedure Calls.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
54
Ordinary pipes in UNIX require a parent-child relationship between the communicating processes.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck
55
The communication with named pipes requires parent-child relationship.
Unlock Deck
Unlock for access to all 55 flashcards in this deck.
Unlock Deck
k this deck