True and False:

1. When a process generates I/O request, it will be moved in suspended state. False.

2. Non-preemptive scheduling algorithm can switch processes on timer interrupt. False.

3. Multitasking is also known as multiprogramming. True.

4. All directories in Windows and UNIX always contain minimum two entries. True.

5. In blocked state, process is in secondary memory and awaiting an event. False.

6. Round robin scheduling algorithm may cause starvation. False.

7. Shortest Process Next scheduling policy is a preemptive version of Shortest Remaining

Time. False.

8. “Cobra” was the first beta version of Windows 95. False.

9. The command “cd..” is used to change current directory to the parent directory. True.

10. In UNIX, while a process is running in kernel mode, it may not be preempted. False.

Multiple Choice Questions:

1. Zero sector containing _____ is called boot sector. 0xAA55

a. 0xAA55 b. 0xFFFF c. 0x7C00 d. 0xFFF0

2. Process state in which process is in secondary memory and awaiting an event. Blocked
suspend.

a. Ready b. Running c. Ready suspend d. Blocked suspend

3. Real-time file protection in Antivirus scanning is an example of ____-term scheduling.

Long.

a. long b. medium c. short d. none

4. Which one is the example of multi-user, multitasking operating system. UNIX.

a. Windows XP b. DOS c. UNIX d. Windows 9x

5. Which one is a non-preempt-able resource. Printer.

a. Printer b. Memory c. Processor d. Virtual Memory

6. Process scheduling policy that may cause starvation. Shortest Process Next.
 a. Round-Robin b. Shortest Process Next c. FIFO d. Option ‘b’ and
‘c’

7. Which one is a non-preempted scheduling algorithm. Shortest Process Next AND FIFO.

a. Round-Robin b. Shortest Process Next c. FIFO d. Option ‘b’ and

‘c’

8. Maximum memory that can be addressed in a 32-bit system is _____. 4 GB.

a. 32-GB b. 1-GB c. 1-MB d. 4-GB

9. Maximum memory that can be addressed in a real mode system is _____. 1 MB.

a. 1-MB b. 20-MB c. 1-GB d. 4-GB.

Fill in the blanks:

1. Process state information part of the Process Control Block is used to save/restore
processor registers.

2. Execution code in UNIX process image is known as process _________.

3. When a process generates I/O request, it will be moved in blocked state.

4. GUID-PT used in storage device stands for Globally Unique Identifier Partition Table.

5. Ready waiting state means process takes processor time while waiting.

6. Suspend term is used when process is moved from main memory to virtual memory.

7. Booting system loads 512 bytes of disk boot sector at memory location = 0x0000:0x7C00.

8. In hard disk, MBR stands for Master Boot Record.

9. Memory compaction is used for External fragmentation.

When and why is a process moved from running state to the following states.

- Blocked: Due to I/O call.

- Ready: When process is preempted.

- Exit: Process completed or system crash.

- Ready Suspended: When ready queue is full and the process is preempted.

Why a process is moved in virtual memory. Provide answer with two examples.

- When a blocked process is inactive for a long duration.

- When a new process has lower priority than processes in ready queue.

- E.g. paused video, I/O call while user is away.

List down at least three examples of long-term scheduling.

- Real time scanning in antivirus.

- Windows Updates (when computer is restarted).

- Startup services.

What techniques can be used to reduce response time in web browsing.

- Divide the page into segments that are loaded at different times.

- Make use of web caches.

- Download media files after text/structure of webpage has been downloaded.

What is IVT (interrupt vector table)? How interrupt service routines are called in Intel based
systems.

IVT is a data structure that is used for interrupt handling. It consists of the interrupt ID,
interrupt name, interrupt type with associated handlers – when interrupt service routines are
called, the system references the IVT.

Provide description of partition naming convention (xxyN) used in UNIX/LINUX.

xx = type of device

1. hd

2. sd

y = which device the partition is on

- hda

- sdb

N = partition number

- 1-4 are primary and 5 onwards are logical.

Explain the working of both SIMD architectures with the help of diagram. For what type of
applications these systems are suitable?

Suitable application: Simulation, graphic processing.

Describe the working of SISD architecture along with efforts put up by research community
to improve overall system performance.

<draw picture>

Single Instruction Single Data that can access one data unit at one time only. Improvements
include increased cache memory, multi-core/multiprocessing computers, and multitasking.

Explain the working for following systems with the help of diagrams.

SIMD (Array Processors)

Diagram:

<draw diagram>

Suitable Application Areas: Graphic processing

MIMD (Shared Memory Systems) also known as multiprocessor.

Diagram:
Working:

It can execute multiple instructions on multiple data units simultaneously.

MIMD (Distributed Memory System) also known as multicomputer

Diagram:

Types: Grid & Cluster

Suitable Applications: Batch processing.

Describe the working of following components used in Microsoft DOS/Windows.

command.com:

Command-line interpreter for Windows.

io.sys & msdos.sys:

Msdos.sys is the DOS kernel. Io.sys contains default device drivers.

boot.ini:

Contains boot options.

autoexec.bat:

Contains commands executed at boot time.