MARUTHI SCHOOL OF BANKING (MSB)

Similar documents
CSC Operating Systems Spring Lecture - XII Midterm Review. Tevfik Ko!ar. Louisiana State University. March 4 th, 2008.

Main Points of the Computer Organization and System Software Module

Techno India Batanagar Department of Computer Science & Engineering. Model Questions. Multiple Choice Questions:

Mid Term from Feb-2005 to Nov 2012 CS604- Operating System

(MCQZ-CS604 Operating Systems)

Chapter 5: CPU Scheduling

CSI3131 Final Exam Review

Department of Computer applications. [Part I: Medium Answer Type Questions]

CHAPTER 2: PROCESS MANAGEMENT

Operating Systems Comprehensive Exam. Spring Student ID # 3/16/2006

OPERATING SYSTEMS CS3502 Spring Processor Scheduling. Chapter 5

CLASS: II YEAR / IV SEMESTER CSE SUBJECT CODE AND NAME: CS6401 OPERATING SYSTEMS UNIT I OPERATING SYSTEMS OVERVIEW

Review. Preview. Three Level Scheduler. Scheduler. Process behavior. Effective CPU Scheduler is essential. Process Scheduling

Chendu College of Engineering & Technology

Lecture 2 Process Management

CSE 153 Design of Operating Systems

Subject: Operating System (BTCOC403) Class: S.Y.B.Tech. (Computer Engineering)

CHAPTER NO - 1 : Introduction:

QUESTION BANK UNIT I

CPU Scheduling. Daniel Mosse. (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013)

Midterm Exam. October 20th, Thursday NSC

Lecture 9: Midterm Review

Preview. Process Scheduler. Process Scheduling Algorithms for Batch System. Process Scheduling Algorithms for Interactive System

Chapter 6: CPU Scheduling. Operating System Concepts 9 th Edition

CPU Scheduling. Operating Systems (Fall/Winter 2018) Yajin Zhou ( Zhejiang University

Comp 310 Computer Systems and Organization

UNIT:2. Process Management

Operating System Study Notes Department of Computer science and Engineering Prepared by TKG, SM and MS

EXAMS CS604- OPERATING SYSTEMS

PROCESSES & THREADS. Charles Abzug, Ph.D. Department of Computer Science James Madison University Harrisonburg, VA Charles Abzug

OPERATING SYSTEMS. COMS W1001 Introduction to Information Science. Boyi Xie

Operating Systems Comprehensive Exam. Spring Student ID # 3/20/2013

B. V. Patel Institute of Business Management, Computer &Information Technology, UTU

Exam Guide COMPSCI 386

CS370 Operating Systems

Lecture 5 / Chapter 6 (CPU Scheduling) Basic Concepts. Scheduling Criteria Scheduling Algorithms

TDIU25: Operating Systems II. Processes, Threads and Scheduling

Processes The Process Model. Chapter 2. Processes and Threads. Process Termination. Process Creation

SNS COLLEGE OF ENGINEERING

Question No: 1 (Marks: 1) - Please choose one A computer system that allows only one user to use the computer at a given time is known as:

MC7204 OPERATING SYSTEMS

Maximum CPU utilization obtained with multiprogramming. CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait

Properties of Processes

Chapter 2 Processes and Threads. Interprocess Communication Race Conditions

OS 1 st Exam Name Solution St # (Q1) (19 points) True/False. Circle the appropriate choice (there are no trick questions).

CS370 Operating Systems

Lecture 17: Threads and Scheduling. Thursday, 05 Nov 2009

AC59/AT59/AC110/AT110 OPERATING SYSTEMS & SYSTEMS SOFTWARE DEC 2015

8: Scheduling. Scheduling. Mark Handley

OPERATING SYSTEMS. UNIT II Sections A, B & D. An operating system executes a variety of programs:

CS3733: Operating Systems

INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad COMPUTER SCIENCE AND ENGINEERING QUESTION BANK OPERATING SYSTEMS

CSE 120. Fall Lecture 8: Scheduling and Deadlock. Keith Marzullo

Operating System Concepts Ch. 5: Scheduling

Unit 3 : Process Management

Processes. CS 475, Spring 2018 Concurrent & Distributed Systems

Processes Prof. James L. Frankel Harvard University. Version of 6:16 PM 10-Feb-2017 Copyright 2017, 2015 James L. Frankel. All rights reserved.

SMD149 - Operating Systems

CS604- Operating Systems Solved MCQS From Midterm Papers

CPU Scheduling: Objectives

CMPS 111 Spring 2003 Midterm Exam May 8, Name: ID:


CS 571 Operating Systems. Midterm Review. Angelos Stavrou, George Mason University

Chapter 5: CPU Scheduling

CS370 Operating Systems Midterm Review

Chapter 2 Processes and Threads

CSE 120 Principles of Operating Systems Spring 2017

CSE 120 Principles of Operating Systems

Last Class: Synchronization Problems. Need to hold multiple resources to perform task. CS377: Operating Systems. Real-world Examples

Scheduling. The Basics

Processes The Process Model. Chapter 2 Processes and Threads. Process Termination. Process States (1) Process Hierarchies

SYED AMMAL ENGINEERING COLLEGE CS6401- OPERATING SYSTEM

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIT I

Operating Systems Comprehensive Exam. Fall Student ID # 10/31/2013

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

FCM 710: Architecture of Secure Operating Systems

CS370 Operating Systems

CS370 Operating Systems

OPERATING SYSTEMS: Lesson 4: Process Scheduling

Course Syllabus. Operating Systems

Operating System MC Exercises

Operating Systems. Figure: Process States. 1 P a g e

Processes. Overview. Processes. Process Creation. Process Creation fork() Processes. CPU scheduling. Pål Halvorsen 21/9-2005

Dr. Rafiq Zakaria Campus. Maulana Azad College of Arts, Science & Commerce, Aurangabad. Department of Computer Science. Academic Year

Operating Systems: Quiz2 December 15, Class: No. Name:

Processes, PCB, Context Switch

Announcements. Reading. Project #1 due in 1 week at 5:00 pm Scheduling Chapter 6 (6 th ed) or Chapter 5 (8 th ed) CMSC 412 S14 (lect 5)

Chapter 6: CPU Scheduling. Operating System Concepts 9 th Edition

Subject Name: OPERATING SYSTEMS. Subject Code: 10EC65. Prepared By: Kala H S and Remya R. Department: ECE. Date:

CPU Scheduling. Rab Nawaz Jadoon. Assistant Professor DCS. Pakistan. COMSATS, Lahore. Department of Computer Science

Processes-Process Concept:

Operating Systems Comprehensive Exam. Spring Student ID # 2/17/2011

Scheduling of processes

CS 318 Principles of Operating Systems

1.1 CPU I/O Burst Cycle

Lecture Topics. Announcements. Today: Uniprocessor Scheduling (Stallings, chapter ) Next: Advanced Scheduling (Stallings, chapter

FCM 710: Architecture of Secure Operating Systems

Student Name:.. Student ID... Course Code: CSC 227 Course Title: Semester: Fall Exercises Cover Sheet:

ALL the assignments (A1, A2, A3) and Projects (P0, P1, P2) we have done so far.

CS370 Operating Systems

Transcription:

MARUTHI SCHOOL OF BANKING (MSB) SO IT - OPERATING SYSTEM(2017) 1. is mainly responsible for allocating the resources as per process requirement? 1.RAM 2.Compiler 3.Operating Systems 4.Software 2.Which of the following plays an important role in modern Operating Systems(OS)? 1.Kernel 2.Shell 3.Fork 4.None 3.FAT stands for 1.File Allocation Table 2.File Application Table 3.First Allocation Table 4.First Application Table 4.BAT refers to 1.Executable Files 3.Boot Files 2.Batch Files 4.None 5... occur commonly in multi-tasking when two or more threads waiting for each other. 1.Kernel 2.Shell 3.Fork 4.Deadlock 6.In DOS the DIR command is used to. 1.Display Information 2.Display list of files & Sub directories 3.Delete files 4.Copy files 7. is the program which interprets commands given by the user? 1.Kernel 2.Shell 3.Fork 4.None 8.Which of the following is an MS-DOS external command? 1.DIR 2.COPY 3.FORMAT 4.PROMPT 9.In DOS label command is used to. 1.Create the label of disk 2.Change the label of disk 3.Both 1& 2 4.None 12.Dijkstra s banking algorithm for resource allocation is used for 1.Deadlock detection 2.Deadlock prevention 3.Deadlock avoidance 4.Deadlock recovery 13.In UNIX, cached disk blocks are managed by the Kernel and referred to as.. 1.Cache 2.Disk Cache 3.Buffer Cache 14. is the smallest unit for processing that consists of a program counter, a stack & a set of registers. 1.Compiler 2.Thread 3.Heap 15.Which of the following services is not supported by the OS? 1.I/O Operation 2.Protection 3.Compilation 16.Which of the following is used to remove deadlock? 1.Preemption 2.Mutual Exclusion 3.Circular Wait 17.First Come First Serve (FCFS) Scheduling is. 1.used to reduce waiting time 2.easy to understand and implement 3.impossible to implement 4.None of the Above 18. is a system call of OS that is used to create a new process? 1.Shell 2.Kernel 3.Fork 4.Thread 19.Which of the following is an example of Cooperative Multi-Tasking OS? 1.Lynx OS 2.Mac OS 3.MS DOS 10.NTFS stands for.. 1.New Technology File System 2.New Transmission File System 3.Net Transmission File System 4.None 20.The performance of Round Robin(RR) scheduling depends on 1.quantum 2.priority 3.preemption 11.An Integer variable that is used to manage concurrent processes is called.. 1.Thread 2.Semaphore 3.Counter 21.Round Robin(RR) scheduling algorithm is suitable for 1.Real Time Operating Systems 2.Embedded Operating Systems 1

3.Distributed Operating Systems 4.Time Sharing Operating Systemss 22. is a special system software that is used to handle process scheduling in different ways. 1.Fork 2.Scheduler 3.Spawn 23.Short term scheduler is a 1.CPU scheduler 2.process swapping scheduler 3.job scheduler 24.Which one of the following scheduler controls the degree of multiprogramming? 1.Long Term Scheduler 2.Medium Term Scheduler 3.Short Term Scheduler 32.A variant of deadlock is called. 1.Mutex lock 2.Live lock 3.Both1 & 2 33... is a system call that causes the caller to block. 1.Await 2.Sleep 3.Wakeup 34. is the most used method to communicate over a network. 1.Sockets 2.Semaphores 3.Pipes 35. is the process of switching of CPU from one thread to another. 1.Process handling 2.interrupt handling 3.Context switching 25.Which of the following is a scheduling algorithm that allows a process to move up and down between queues? 1.Round Robin(RR) scheduling 2.First Come First Served (FCFS) scheduling 3.Multilevel feedback queue scheduling 4.Shortest Job First (SJF) scheduling 26... commands are automatically loaded into main memory when the booting process gets completed. 1.External 2.Internal 3.Both 1& 2 4.None 27.Which of the following is an Internal command? 1.DEBUG 2.EDIT 3.EXTRACT 4.COPY 28.Which of the following is an example of Batch Processing Operating Systems? 1.Lynx OS 2.Mac OS 3.UNIX 29.In DOS, TYPE command is used to. 1.display message on screen 2.display the contents of a text file 3.Both 1& 2 4.None 30... process checks to ensure the components of the computer are operating and connected properly. 1.Editing 2.Saving 3.Booting 31.First Come First Serve(FCFS) is 1.Preemptive scheduling 2.Non-preemptive scheduling 3.deadline scheduling 2 36.Which of the following is an example of Real Time Operating Systems? 1.Lynx OS 2.Mac OS 3.UNIX 37.Which of the following is a function of an OS? 1.Process Management 2.I/O Management 3.Memory Management 4.All of the above 38.In DOS, ECHO command is used to. 1.display message on screen 2.display the contents of a text file 3.Both 1 & 2 39.Which of the following is an external command of DOS? 1.CALL 2.SHIFT 3.TITLE 4.FORMAT 40. is a technique used to speed up communication with slow devices. 1.Fragmentation 2.Caching 3.Segmentation 41.Which of the following scheduling algorithms provide minimum averagee waiting time? 1.Round Robin (RR) 2.First come First Serve (FCFS) 3.Shortest Job First Scheduling 42.Medium term scheduler is based on 1.Scroll in, Scroll out 2.Fetch in, Fetch out 3.Swap in, Swap out

43.A computer is restarted by restart button or by pressing the Combination of (Ctrl+Alt+Del). This type of booting is called 1.Cold Booting 2.Warm Booting 3.Both 1 and 2 44.Which of the following is a type of Semaphores? 1.Binary Semaphore 2.Counting Semaphore 3.Both1 & 2 45.. are required to complete within a guaranteed amount of time. 1.Real Time Operating Systems 2.Multi Tasking Operating Systems 3.Distributed Operating Systems 46.Long Term Scheduler is a 1.CPU scheduler 2.process swapping scheduler 3.job scheduler 47. is a way of processing data serially. 1.spooling 2.caching 3.Paging 4.All of the above a critical task 48.Which of the following is true for the algorithms for memory allocation? 1.First Fit 2.Best Fit 3.Worst Fit 4.All of the above 49.Which type of scheduler typically uses a FIFO or Priority queue? 1.Short Term Scheduler 2.Medium Term Scheduler 3.Long Term Scheduler 4.All of the above 50.Which of the following is a solution to fragmentation problem? 1.Thread 2.Kernel 3.Paging 4.All of the above 51. holds the address of the next instruction to be executed? 1.Accumulator 2.Stack Pointer 3.Status Register 4.Program Counter 52.Which of the following condition leads to deadlock? 1.Hold and Wait 2.Preemption 3.Rollback 2.Short Term Scheduler 3.Long Term Scheduler 54.Message queuing is managed by? 1.Shell 2.Kernel 3.Fork 55.Interrupt latency should be for Real Time Operating Systems (RTOS)? 1.minimal 2.maximumm 3.zero 56.In DOS, MD command is used to. 1.display message on screen 2.create new files 3.create new folders 57.Which of the following is the delay that occur during the playback of a stream is called? 1.jitter 2.playback delay 3.stream delay 58.The high paging activity is called 1.Fragmentation 2.Segmentation 3.Thrashing 59.Which is not a valid state of a thread? 1.running 2.blocked 3.parsing 60.The register is read by the host to get input 1.data out 2.data in 3.flow out 61.A register that can be used for memory protection is called 1.memory data register 2.fence register 3.memory buffer register 4.index register 62. occurs in a dynamic memory allocation system when most of the free blocks are too small to satisfy any request? 1.Paging 2.Segmentation 3.Fragmentation 63.Which of the following holds the data currently being worked on? 1.Stack pointer 2.Program Counter 3.Accumulator 53.Which type of scheduler is used in batch systems? 1.Medium Term Scheduler 3 64.The total number of processes completed per unit time is termed as 1.throughput 2.response time 3.waiting time

65.... is generic and that can run on any OS. 1.Kernel level thread 2.User level thread 3.Both 1 & 2 66.Which of the following is multi threading model? 1.many to many relationship 2.many to one relationship 3.one to One relationship 4.All of the above 67..files represent physical devices printers, terminals etc., 1.Ordinary files 2.Directory files 3.Special files 68.An interrupt that is reserved for unrecoverable memory errors is called 1.maskable interrupt 2.non maskable interrupt 3.Both 1 & 2 69.Process Control Block (PCB) is also called 1.Program Control Block 2.Memory Control Block 3.Task Control Block 70.The process that is currently being executed is called 1.Waiting State 2.Running State 3.Ready state 71.. is an user interface that uses only keyboard for input. 1.Graphical User Interface 2.Command Line Interface 3.Both 1 & 2 72.Which of the following is an example of Preemptive Multi-Tasking OS? 1.MS-DOS 2.Linux 3.OS/2 4.Mac OS 73.An Operating System that can predict the exact time duration for operations is called 1.Hard RTOS 2.Soft RTOS 3.Both 1 & 2 74.The use of software to allow system hardware to run multiple applications on different OS is termed as 1.OS Virtualization 2.OS level Virtualization 3.Both 1 & 2 75.The command interpreter in Linux is known as 1.Fork 2.Kernel 3.Shell 4 like 76.Which is a hardware register that contains status information of the Processor? 1.Stack pointer 2.Program Counter 3.Accumulator 4.Status register 77.Physical memory can be divided into a number of equal sized blocks called.. 1.Page 2.Frame 3.Block 78.The most commonly used Linux shell is. 1.C Shell 2.Korn Shell 3.Bourne Shell 4.Bash Shell 79.A table that contains the base address of each page in physical memory is called.. 1.Page table 2.Frame table 3.Memory table 80.Virtual memory can be implemented with 1.Thrashing 2.Synchronization 3.Demand Paging 81. provides an Interface between the process and the Operating System 1.Synchronization 2.System call 3.Segmentation 82.The resolution of externally defined symbols is performed by? 1.Compiler 2.Assembler 3.Linker 83.Which of the following is not used on multiprogramming systems? 1.Memory Management 2.File Management 3.Process Management 84 is a system call that runs an executable file into an existing process. 1.fork 2.wait 3.exec 85.Which of the following technique is used to convert a blocking system call into a non blocking system call? 1.Segmentation 2.Jacketing 3.Fragmentation 86.One user-level thread is mapped to many kernel level thread is known as. 1.One to Many model 2.One to One model 3.Many to One model 87.In Operating Systems, as a single thread is termed

1.Light Weight Process (LWP) 2.Heavy Weight Process (HWP) 3.Both 1 & 2 88.. is a system call that returns the process ID of current process. 1.getpid 2.wait 3.getppid 89.In Unix, cat command is used to display 1.file names 2.folder names 3.file contents 90.Which of the following command is used to create terminal connection to another host in Unix? 1.ssh 2.scp 3.telnet 91.Producer Consumer problem, one of the classical problems of synchronization is also called 1.Bounded Buffer Problem 2.Readers Writers Problem 3.Dining Philosophers Problem 92.Which of the following command current working directory in Unix? 1.mkdir 2.pwd 3.rm is used to print 93.. is a classic synchronizationn problem that involves the allocation of limited resources amongst a group of processes in a deadlock free and starvation free manner. 1.Bounded Buffer Problem 2.Dining Philosophers Problem 3.Readers Writers Problem 3.Real Time Streaming Protocol 4.Real Trigger Streaming Protocol 98.Which of the following is a System call that can be used to send signal to a process? 1.kill 2.wait 3.exec 99... allows a thread to terminate the execution of other threads in the process. 1.Thread Scheduling 2.Thread Safety 3.Thread Cancellation 100.Which of the following scheduling algorithm is impossible to implement? 1.FCFS Scheduling 2.Priority Scheduling 3.Shortest Job First (SJF) Scheduling 101.Which of the following is a dynamic scheduling algorithm used in real-time operating systems to place processes in a priority queue? 1. Earliest deadline first (EDF) 2. First-Come First-Servee Scheduling(FCFS) 3. Round Robin Scheduling(RRS) 4. Multilevel Queue Scheduling(MQS) Earliest deadline first (EDF) or least time to go is a dynamic scheduling algorithm used in real-time operating systems to place processes in a priority queue. 102.Which of the following is the module that gives control of the CPU to the process selected by the scheduler? 1. Device Driver 2. Scheduler 3. Dispatcher 4. All of these The dispatcher is the module that gives control of the CPU to the process selected by the scheduler. 94.. is a system call that returns the process ID of the parent of the current process. 1.getpid 2.wait 3.getppid 95.Which of the following is standard print command in Unix? 1.ncftp 2.grep 3.ls 4.lpr 96.In Unix, file command is used to determine 1.file name 2.file type 3.file content 97.What is the full form of RTSP? 1.Real Time System Protocol 2.Real Transfer System Protocol 5 103.Number of processes completed per unit time is termed as 3. Turnaround time 4. Throughput Number of processes that complete their execution per time unit. 104.The time taken in an interactive program from the issuance of a command to the commence of a response to that command is known as? 3. Turnaround time 4. Throughput Response time is the interval between submission of a request.

105.Which of the following is time required for a particular process to complete, from submission time to completion? 3. Turnaround time 4. Throughput Turnaround time is the time difference between completion time and arrival time. 106.Which of the following is the time difference between turn around time and burst time? 3. Arrival Time 4. Throughput An amount of time a process has been waiting in the ready queue. 107.Which of the following is a time required by a process for CPU execution? 3. Arrival Time 4. Throughput 5. Burst time Burst time is a time required to complete execution of particular task or process. 108.Which of the following is similar to FCFS scheduling? 1. Earliest deadline first (EDF) 2. Multilevel Feedback Queue Scheduling(MQS) 3. Round Robin Scheduling(RRS) 4. Multilevel Queue Scheduling(MQS) Round robin scheduling is similar to FCFS scheduling, except that CPU burstss are assigned with limits called time quantum. 109.Which of the following is an example of dynamic priority scheduling algorithms? 1. Earliest deadline first scheduling 2. Least slack time scheduling 3. Round Robin Scheduling(RRS) 4. Both 1 and 2 5. Both 2 and 3 Earliest deadline first scheduling and Least slack time scheduling are examples of Dynamic priority scheduling algorithms. 111.Which of the following is a feature of the Windows operating system that causes predetermined system actions when certain media is inserted? 1. BIOS 2. Flat file 3. Auto Run 4. All of these 5. None of these Auto Run is a feature of the Windows operating system that causes predetermined system actions when certain media is inserted 112.Which of the following is a register in a computer processor that contains the address of the instruction being executed at the current time? 1. Device Driver 2. Scheduler 3. Dispatcher 4. Program Counter The Program Counter is a register in a computer processor that contains the address of the instruction being executed at the current time. 113.To load an operating system into the computer s main memory or Random Access Memory (RAM) is knownn as 3. Turnaround time 4. Throughput 5. Boot To load an operating system into the computer s main memory or random access memory (RAM) is known as Boot. 114.This is a situation in which two computer programs sharing the same resource are effectively preventing each other from accessing the resource is known as? 1. Scheduling 2. Deadlock 3. Parsing 4. Running Deadlock is a situation in which two computer programs sharing the same resource are effectively preventing each other from accessing the resource. 115.Which of the following is the central component of most computer operating systems? 1. Scheduling 2. Deadlock 3. Parsing 4. Running 5. Kernel The central component of most computer operating systems is Kernel. 110.Which of the following is also known as CPU Scheduler? 1. Long Term Scheduler 2. Short Term Scheduler 3. Medium Term Scheduler 4. Both 1 and 2 5. Both 2 and 3 Short Term Scheduler is also known as CPU Scheduler used to enhance the CPU performance and it runs very frequently 6 116.Which of the following is the module that gives control of the CPU to the process selected by the short-time scheduler? 1. Interrupt 2. Dispatcher 3. Scheduler 4. Running 5. Kernel Dispatcher is the module that gives control of the CPU to the process selected by the short-time scheduler

117.Which of the following is a data structure maintained by job scheduler software? 1. job queue 2. ready queue 3. process queue 4. execution queue 5. None of the A job queue, is a data structure maintained by job scheduler software containing jobs to run 118.Which is a set of all processes that are waiting to be scheduled on a core? 1. job queue 2. ready queuee 3. process queue 4. execution queue Ready queue is a set of all processes that are waiting to be scheduled on a core 119.This is used to create a new process, which becomes the child process of the caller is known as? 1. Thread Cancellation 2. Mutual Exclusion 3. Signal Handling 4. System Call 5. Both 2 and 3 System Call, fork() is used to create a new process, which becomes the child process of the caller 120.Which of the following is a program that prevents simultaneous access to a shared resource? 1. Thread Cancellation 2. Mutual Exclusion 3. Signal Handling 4. System Call 5. Both 2 and 3 Mutual Exclusion is a program that prevents simultaneous access to a shared resource 121.Which of the following is the creation of a virtual rather than actual version of an operating system? 1. Compression 2. Virtualization 3. Synchronization 4. Multithreading Virtualization is the creation of a virtual rather than actual version of an operating system. 122.Which of the following is the primary and first installed operating system? 1. Guest OS 2. Host OS 3. Common OS 4. Shared OS Host OS is the primary and first installed operating system Guest OS is a virtual machine (VM) that is installed under the host operating system 124.Which of the following is an operating system with ability to handle multiple interrupts concurrently? 1. Network OS 2. Guest OS 3. Host OS 4. Interruptible OS 5. Uninterruptible OS Interruptible OS is an operating system with ability to handle multiple interrupts concurrently 125.Which is a computer software, firmware, or hardware, that creates and runs virtual machine? 1. Hypervisor 2. Uninterruptible OS 3. Parser 4. Network OS Hypervisor is a computer software, firmware, or hardware, that creates and runs virtual machine. 126.Which of the following is the smallest operating systems run on credit card sized devices containing a CPU chip? 1. Network OS 2. Guest OS 3. Host OS 4. Embedded OS 5. Smart Card OS Smart Card OS is the smallest operating systems run on credit card sized devices containing a CPU chip 127.Which of the following is the abstraction of upper layer protocols from physical connections? 1. Para-Virtualization 2. Memory Virtualization 3. I/O Virtualization 4. All of these I/O Virtualization is the protocols from physical transport abstraction of upper layer connections or physical 128.It is an enhancement of virtualization technology in which a guest OS is recompiled prior to installation inside a virtual machine is known as? 1. Para-Virtualization 2. Memory Virtualization 3. I/O Virtualization 4. All of these Para-Virtualization is an enhancement of virtualization technology in which a guest OS is recompiled prior to installation inside a virtual machine 123.Which is a virtual machine (VM) that is installed under the host operating system? 1. Guest OS 2. Network OS 3. Common OS 4. Shared OS 7 129.Which is a protocol that one program can use to request a service from a program of another computer on a network? 1. Para-Virtualization 2. Memory Virtualization 3. I/O Virtualization 4. Remote Procedure Call 5. Load Balancing

Remote Procedure Call is a protocol that one program can use to request a service from a program of another computer on a network without having to understand the network s details 130.Which of the following is the main reason for computer server clustering? 1. Para-Virtualization 2. Memory Virtualization 3. I/O Virtualization 4. Remote Procedure Call 5. Load Balancing Load Balancing is the main reason for computer server clustering. Want to passs sources Everywhere Want a job resources At MSB Visit www.maruthischoolofbanking.com For Answer Key and more Updated Materials 8