Operating Systems

Operating System – CS604

A(or an exception) is a software-generated interrupt caused either by an error (division by zero or invalid memory access) or by a user request for an operating system service.

► Interrupt

► Trap

► Signal

► Process

Question No: 2 ( Marks: 1 ) – Please choose one

Which register holds the smallest legal physical memory address for a process?

► Base register

► Limit register

►Status register

►None of the given options

Question No: 3 ( Marks: 1 ) – Please choose one

The process of switching from one process to another is called —————–

► context switching

► scheduling

► quantum period

► latency

Question No: 4 ( Marks: 1 ) – Please choose one

The ————–semaphore provides mutual exclusion for accesses to the buffer pool and is initialized to the value 1.

► mutex

► binary

► couting

► none of the given options

Question No: 5 ( Marks: 1 ) – Please choose one

Binary semaphores are those that have only two values———

► 0 and n

► 0 and 0

► 0 and 1

► None of the given options

Question No: 6 ( Marks: 1 ) – Please choose one

Addresses generated relative to part of program, not to start of physical memory are

► Virtual

► Physical

► Relocatable

► Symbolic

Question No: 7 ( Marks: 1 ) – Please choose one

Object files and libraries are combined by a ————- program to produce the executable binary

► Compiler

► Linker

► Text editor

► Loader

Question No: 8 ( Marks: 1 ) – Please choose one

Physical memory is broken down into fixed-sized blocks, called———– and Logical memory is divided into blocks of the same size, called ———–

► Frames, pages

► Pages, Frames

► Frames, holes

► Holes, segments

Question No: 9 ( Marks: 1 ) – Please choose one

A page table needed for keeping track of pages of the page table is called ————–

► 2-level paging

► Page directory

► Page size

► Page table size

Question No: 10 ( Marks: 1 ) – Please choose one

The address generated by the CPU, after any indexing or other addressing-mode arithmetic, is called a ——–

address, and the address it gets translated to by the MMU is called a ———address.

►Virtual, physical

► Hexadecimal, Binary,

► Valid, invalid

► Physical, Virtual

Question No: 11 ( Marks: 1 ) – Please choose one

Each page is a power of ——– bytes long in paging scheme.

► 2

► 3

► 4

► 5

Question No: 12 ( Marks: 1 ) – Please choose one

is a way to establish a connection between the file to be shared and the directory entries of the users who want to have aces to this file.

► Link

► Directory

► Common Group

► Access Permission

Question No: 13 ( Marks: 1 ) – Please choose one

When alink is created, a directory entry for the existing file is created

► Soft

► Hard

► Soft or Hard

► None of the given options

Question No: 14 ( Marks: 1 ) – Please choose one

Themethod requires each file to occupy a set of contiguous blocks on the disk.

► Contiguous Allocation

► Linked Allocation

► Indexed Allocation

► None of the given options

Question No: 15 ( Marks: 1 ) – Please choose one

Which part of the computer system helps in managing the file and memory management system?

► Operating System

► Device Drivers

► Application Software

► Hardware

Question No: 16 ( Marks: 1 ) . – Please choose one

Which of the following is correct definition for wait operation?

► wait(S) { (Page 111) while(S<=0)

;// no op S–;

}

► wait(S) { S++;

}

► wait(S) { while(S>=0)

;// no op S–;

}

► wait(S) {

S–;

}

Question No: 17 ( Marks: 1 ) – Please choose one

Wrong use of wait and signal operations (in context with semaphores) can causeproblem(s).

► Mutual Exclusion

► Deadlock

► Bounded Waiting

► All of the given options are correct

Question No: 18 ( Marks: 1 ) – Please choose one

If a system is not in a safe state, there can be no deadlocks.

► True

► False

Question No: 19 ( Marks: 1 ) – Please choose one

If a process continues to fault, replacing pages, for which it then faults and brings back in right away. This high paging activity is called.

► paging

► thrashing

► page fault

► CPU utilization

Question No: 20 ( Marks: 1 ) – Please choose one

Inpage replace algorithm we will replace the page that has not been used for the longest period of time.

► counter based

► Least Frequently Used

► FIFO

► LRU

Question No: 21 ( Marks: 1 ) . – Please choose one

Overlays are implemented by the

► Operating system

► Programmer

► Kernel

► Shell

Question No: 22 ( Marks: 1 ) – Please choose one

An acyclic graph does not allow directories to have shared subdirectories and files.

► True

► False

Question No: 23 ( Marks: 1 ) – Please choose one

The size of pages and frames are same in logical memory and physical memory respectively.

► True

► False

Question No: 24 ( Marks: 1 ) – Please choose one

A modification of free-list approach in free space managment is to store the addresses of n free blocks in the first free block. Known as.

► counting

► linked list

► bit vector

► grouping

Question No: 25 ( Marks: 1 ) – Please choose one

In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a

► Cycle

► Graph

► Edge

► Node

Question No: 26 ( Marks: 1 ) – Please choose one

Intel is basically designed for following Operating Systems except.

► MULTICS

► OS/2

► Windows

► Linux

Question No: 27 ( Marks: 1 ) – Please choose one

Following is NOT true about Virtual memory.

► Virtual memory help in executing bigger programs even greater in size that of main memory.

► Virtual memory makes the processes to stuck when the collective size of all the processes becomes greater than the size of main memory.

► Virtual memory also allows files and memory to be shared by several different processes through page sharing.

► Virtual memory makes the task of programming easier because the programmer need not worry about the amount of physical memory,

Question No: 28 ( Marks: 1 ) – Please choose one

The execution of critical sections must NOT be mutually exclusive

► True

► False

Question No: 29 ( Marks: 1 ) – Please choose one

The critical section problem can be solved by the following except

► Software based solution

► Firmware based solution

► Operating system based solution

► Hardware based solution

Question No: 30 ( Marks: 1 ) – Please choose one

The bottom layer in the layered approach of Operating System is———–

► User interface

► Hardware

► Kernel

► None of the given options

Question No: 31 ( Marks: 1 ) – Please choose one

You can display the contents (names of files and directories) of a directory in UNIX/Linux directory structure with the ————— command.

► l

► s

► ls

► none of the given options

Question No: 32 ( Marks: 1 ) – Please choose one

————- spend more time doing IO than computations

► short CPU bursts

► CPU bound processes

► IO bound processes

► None of the given options

Question No: 33 ( Marks: 1 ) – Please choose one

————buffer places no practical limit on the size of the buffer

► Bounded

► Unbounded

► Both Unbounded & bounded

►None of the given options

Question No: 34 ( Marks: 1 ) – Please choose one

With ———-you use condition variables.

► Semaphores

► Read/Write Locks

► Swaps

► Monitor

Question No: 35 ( Marks: 1 ) – Please choose one

Deadlocks can be described more precisely in terms of a directed graph called a system ———-

► Directed graph

► Critical path

► Resource allocation graph

► Mixed graph

Question No: 36 ( Marks: 1 ) – Please choose one

The integer value ofsemaphores can not be greater than 1.

►Counting

►Binary

►Mutex

►Bounded buffer

Question No: 37 ( Marks: 1 ) – Please choose one

Starvation is infinite blocking caused due to unavailability of resources.

►True

►False

Question No: 38 ( Marks: 1 ) – Please choose one

The set of all physical addresses corresponding to the logical addresses is a —————- of the process

► Physical address space

► Process address space

► None of the given options

► Logical address space

Question No: 39 ( Marks: 1 ) – Please choose one

—————- indicates size of the page table

► translation look-aside buffers

► Page-table length register (PTLR)

► Page-table base register (PTBR)

► Page offset

Question No: 40 ( Marks: 1 ) – Please choose one

If validation bit is 0, it indicates a/an ——— state of segment.

► protected

► shared

► legal

► illegal

Question No:41 ( Marks: 1 ) – Please choose one

Inallocation scheme free frames are equally divided among processes

► Fixed Allocation

► Propotional Allocation

► Priority Allocation

► None of the given options

Question No: 42 ( Marks: 1 ) – Please choose one

Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.

► True

► False

Question No: 43 ( Marks: 1 ) – Please choose one

is used to store data on secondary storage device, e.g., a source program(in C), an executable program.

► Block Special File

► Link File

► Ordinary File

► Directory

Question No: 44 ( Marks: 1 ) – Please choose one

The basic purpose ofis to help the users to utilize the hardware resources for completing different tasks in a simplified manner

► Operating system

► Application software

► All Software

► All of the given

Question No: 45 ( Marks: 1 ) – Please choose one

User mode can run the Privileged instructions

► True

► False

Question No: 46 ( Marks: 1 ) – Please choose one

wastes CPU cycles and hence is a problem in real multiprogramming system.

► Busy waiting

► Spinlock

► Critical section

► Mutex

Question No: 47 ( Marks: 1 ) – Please choose one

Therequires that no reader will be kept waiting unless a writer has already obtained permission to use the shared object.

► first readers-writers problem

► second readers-writers problem

► third readers-writers problem

► fourth readers-writers problem

Question No: 48 ( Marks: 1 ) – Please choose one

The process of holding at least one resource and waiting to acquire additional resources that are currently being held by other processes is known as.

► Mutual exclusion

► Hold and wait

► No preemption

► Circular wait

Question No: 49 ( Marks: 1 ) – Please choose one

The condition where a set of blocked processes each holding a resource and waiting to acquire a resource held by another process in the set, is termed as.

►Deadlock

►Starvation

Question No: 50 ( Marks: 1 ) – Please choose one

Banker‟s algorithm is used for_

► Deadlock avoidance

► Deadlock detection

► Deadlock prevention

► Deadlock removal

Question No: 51 ( Marks: 1 ) – Please choose one

A program can not execute unless whole or necessary part of it resides in the main memory.

► True

► False

Question No: 52 ( Marks: 1 ) – Please choose one

Therequires that once a writer is ready, that writer performs its write as soon as possible , if a writer waiting to access the object, no new readers may start reading.

►first readers-writers problem

►second readers-writers problem

►third readers-writers problem

►fourth readers-writers problem

Question No: 53 ( Marks: 1 ) – Please choose one

Which command, Display permissions and some other attributes for prog1.c in your current directory?

► ls –l prog1.c

► ls –d prog1.c

► ls file prog1.c

► ls –l prog1.c /Directory

Question No: 54 ( Marks: 1 ) – Please choose one

In the C-Scan and C-Look algorithms, when the disk head reverses its direction, it moves all the way to the other end, without serving any requests, and then reverses again and starts serving requests.

► True

► False

Question No: 55 ( Marks: 1 ) – Please choose one

In paged segmentation, we divide every segment in a process intopages.

► Fixed size

► Variable size

Question No: 56 ( Marks: 1 ) – Please choose one

Intel 80386 used paged segmentation withlevel paging.

► One

► Two

► Three

► Four

Question No: 57 ( Marks: 1 ) – Please choose one

The logical address of Intel 80386 is

► 36 bits

► 48 bits

► 64 bits

► 128 bits

Question No: 58 ( Marks: 1 ) – Please choose one

The Swap instruction which is the hardware solution to synchronization problem does not satisfy the condition, hence not considered to be a good solution.

► Progress

► Bounded waiting

► Mutual exclusion

► None of the given

Question No: 59 ( Marks: 1 ) – Please choose one

The ———–scheme is not applicable to a resource allocation system with multiple instances of each resource type.

►Wait for graph

►Resource allocation graph

►Both Resource-allocation and wait-for graph

► None of the given options

Question No: 60 ( Marks: 1 ) – Please choose one

The following requirement for solving critical section problem is known as.

“There exists a bound on the number of times that other processes are allowed to enter their critical sections after a process has made a request to enter its critical section and before that request is granted.”

ExamPlanning

Disclaimer: All content on this website is based on individual experience and journalistic research. It does not constitute proper advice. ExamPlanning is not liable for how tips are used, nor for content and services on external websites. Common sense should never be neglected!