CS604P Sample Paper Solved 2023 by Prince Alvi

Sample Paper

FINALTERM EXAMINATION

Fall 2022 CS604P – Operating Systems (Practical)

Time: 90 min Marks: 40

Q1. In Unix, which system call creates the new process that contains a copy of the parent address space? (01 marks)

1. Create
2. Fork
3. New
4. pipe

Correct answer: Fork

Q2. The FCFS algorithm is highly problematic for ____________ (01 marks)

1. operating systems
2. multiprocessor systems
3. time sharing systems
4. multiprogramming systems

Correct answer: time sharing systems

Q3. If a parent process terminates__________, this results in the termination of all child processes; this is referred to as cascading termination. (01 marks)

1. Normally or abnormally
2. Abnormally
3. Normally
4. forcefully

Correct answer: Normally or abnormally

Q4. If process synchronization is not controlled in the dining philosopher problem, it will lead to (01 marks)

1. Deadlock
2. Starvation
3. Deadlock or Starvation
4. Deadlock and Starvation

Correct answer: Deadlock or Starvation

Q5. Which of the following algorithms is used to avoid deadlock? (01 marks)

1. Dynamic Programming algorithm
2. Primality algorithms
3. Banker's algorithm
4. Deadlock algorithm

Correct answer: Banker's algorithm

Q6. Address generated by CPU is referred as (01 marks)

1. Physical address
2. Logical address
3. Page address
4. Segment address

Correct answer: Logical address

Q7. The instruction being executed, must be in ____________ (01 marks)

1. physical memory
2. logical memory
3. physical & logical memory
4. Registers

Correct answer: physical memory

Q8. When the CPU attempts to obtain a needed page exists in main memory (RAM), it is referred to as a (01 marks)

1. Page hit
2. Page miss
3. Page fault
4. Fault time

Correct answer: Page hit

Q9. Producer – consumer problem also known as (01 marks)

1. Reader-writer
2. Dinning-philosopher
3. Bounded-buffer
4. Writer – reader

Correct answer: Bounded-buffer

Q10. Which of the following page replacement algorithms suffers from Belady’s Anomaly? (01 marks)

1. Optimal replacement
2. LRU
3. FIFO
4. Both optimal replacement and FIFO

Correct answer: Both optimal replacement and FIFO

Q11. LRU page - replacement algorithm associates with each page the ______ (01 marks)

1. time it was brought into memory
2. the time of that page’s last use
3. page after and before it
4. all of the mentioned

Correct answer: the time of that page’s last use

Q12. Virtual memory is normally implemented by ________ (01 marks)

1. demand paging
2. buses
3. virtualization
4. all of the mentioned

Correct answer: demand paging

Q13. In inter-process communication using pipe the ______ system call is used to create pipe between parent and child process. (01 marks)

1. segment()
2. page()
3. pipe()
4. fork()

Correct answer: pipe()

Q14. In Linux Terminal Window ________ command is used to compile the C Program. (01 marks)

1. vcc
2. gcc
3. vcc
4. dcc

Correct answer: gcc