CSCE 3600 Exam 2 Questions and Answers Fully Solved Latest Version 2025-2026
The SELECT function allows the servers to deal with blocking calls by identifying sockets that are ready
for use - AnswersTrue
In a single processor system, all the threads execute in interleaved fashion(=though in no particular
order) sharing the CPU - AnswersTrue
System calls or library routines are called thread safe if they can be called from multiple threads
simultaneously and always produce correct results - AnswersTrue
Each process has its own ready queue - AnswersFalse
Datagram sockets do not require the client to establish a connection with the server before sending
messages to the server - AnswersFalse
preemptive scheduling algorithms may results in starvation - AnswersTrue
The degree of multi program is controller by the CPU scheduler - AnswersFalse
When the PTHREAD_EXIT system call is issued by a thread, all threads associated with that process are
terminated - AnswersFalse
A child process created by the FORK system call inherits its parent's process id - AnswersFalse
condition variable allows a thread to block itself until specified data reaches a redefined state -
AnswersTrue
A thread will block if the semaphore value is less than or equal to zero when a SEM_WAIT is issued -
AnswersTrue
As the time slice becomes shorter, the more the RR scheduler behaves like the FIFO scheduler -
AnswersFalse
The privilege mode must be changed to "kernel mode" when doing a system call - AnswersTrue
One of the guarantees offered by the PIPE IPC system call is that__________ - AnswersAll writes up to
4K bytes to the pipe are atomic
turnaround time refers to the amount of time___________ - AnswersNeeded to executes a particular
process
_______ refers to a situation in which a process is ready to execute, but is continuously denied access to
a processor in deference to other processes - AnswersStarvation
Consider the following code
, Int main()
{
If (fork() > 0)
Sleep(100);
Return 0;
}
Execution of this code results in the creation of an______ - AnswersZombie process
An optimal job scheduling scheme for minimizing queueing time is__________ - AnswersSJF
Context Switching between processes is carried out by the______ - AnswersShort term scheduler
Consider the following segment of code in a program
Int fd[2];
Pipe(fd);
Pip = fork();
// what statement here to read from pipe
Int bytesRead = read(...);
...
What operations regarding the pipe do we expect the child to do following the PID = FORK() statement?
- AnswersClose(fd[1]);
An I/O- bound process spends _______ - AnswersMore of its time seeking I/O operations than doing
computational work
Which of the following are virtually shared by threads within a single process? In other words, which are
instantiated per process instead of per thread? - AnswersCode / program text
The SELECT function allows the servers to deal with blocking calls by identifying sockets that are ready
for use - AnswersTrue
In a single processor system, all the threads execute in interleaved fashion(=though in no particular
order) sharing the CPU - AnswersTrue
System calls or library routines are called thread safe if they can be called from multiple threads
simultaneously and always produce correct results - AnswersTrue
Each process has its own ready queue - AnswersFalse
Datagram sockets do not require the client to establish a connection with the server before sending
messages to the server - AnswersFalse
preemptive scheduling algorithms may results in starvation - AnswersTrue
The degree of multi program is controller by the CPU scheduler - AnswersFalse
When the PTHREAD_EXIT system call is issued by a thread, all threads associated with that process are
terminated - AnswersFalse
A child process created by the FORK system call inherits its parent's process id - AnswersFalse
condition variable allows a thread to block itself until specified data reaches a redefined state -
AnswersTrue
A thread will block if the semaphore value is less than or equal to zero when a SEM_WAIT is issued -
AnswersTrue
As the time slice becomes shorter, the more the RR scheduler behaves like the FIFO scheduler -
AnswersFalse
The privilege mode must be changed to "kernel mode" when doing a system call - AnswersTrue
One of the guarantees offered by the PIPE IPC system call is that__________ - AnswersAll writes up to
4K bytes to the pipe are atomic
turnaround time refers to the amount of time___________ - AnswersNeeded to executes a particular
process
_______ refers to a situation in which a process is ready to execute, but is continuously denied access to
a processor in deference to other processes - AnswersStarvation
Consider the following code
, Int main()
{
If (fork() > 0)
Sleep(100);
Return 0;
}
Execution of this code results in the creation of an______ - AnswersZombie process
An optimal job scheduling scheme for minimizing queueing time is__________ - AnswersSJF
Context Switching between processes is carried out by the______ - AnswersShort term scheduler
Consider the following segment of code in a program
Int fd[2];
Pipe(fd);
Pip = fork();
// what statement here to read from pipe
Int bytesRead = read(...);
...
What operations regarding the pipe do we expect the child to do following the PID = FORK() statement?
- AnswersClose(fd[1]);
An I/O- bound process spends _______ - AnswersMore of its time seeking I/O operations than doing
computational work
Which of the following are virtually shared by threads within a single process? In other words, which are
instantiated per process instead of per thread? - AnswersCode / program text
