Deadlock is generally a situation where a set of processes are blocked as each process is holding resources and waits to acquire resources held by another process. In this situation, two or more processes simply try to execute simultaneously and wait for each to finish their execution because they are dependent on each other. We can see a hand problem in our system whenever a deadlock occurs in a program.
It is one of the common problems you can see in multiprocessing. Necessary Conditions for Deadlock There are basically four necessary conditions for deadlock as given below:. In the Operating System, process data is loaded in fixed-sized chunks and each chunk is referred to as a page.
The processor loads these pages in the fixed-sized chunks of memory called frames. Spooling simply stands for Simultaneous peripheral operations online. It is used for mediation between a computer application and a slow peripheral.
It is very useful and important because devices access or acquire data at different rates. Before you go! Take this "Operating System Interview Questions" interview guide with you. Download PDF. Enter the name of your college. Computer Science. Information Technology. Mathematics and Computing. Before After Enter company name.
Forgot Password. Basic OS Interview Questions 1. Why is the operating system important? What's the main purpose of an OS? What are the different types of OS? What are the benefits of a multiprocessor system? What are the different levels of RAID configuration?
What is GUI? What is a Pipe and when it is used? What are the different kinds of operations that are possible on semaphore?
What is a bootstrap program in OS? Explain demand paging? What do you mean by RTOS? What do you mean by process synchronization? What is IPC? What are the different IPC mechanisms? What is different between main memory and secondary memory. What do you mean by overlays in OS? Write top 10 examples of OS? Intermediate OS Interview Questions What is virtual memory? What is thread in OS? What is a process? What are the different states of a process? What do you mean by FCFS? What is Reentrancy?
What is a Scheduling Algorithm? Name different types of scheduling algorithms. What is the difference between paging and segmentation? What is thrashing in OS? What is the main objective of multiprogramming? What do you mean by asymmetric clustering? What is the difference between multitasking and multiprocessing OS? What do you mean by Sockets in OS? Explain zombie process? What do you mean by cascading termination? What is starvation and aging in OS?
Advanced OS Interview Questions What do you mean by Semaphore in OS? Why is it used? What is Kernel and write its main functions? What are different types of Kernel? Write difference between micro kernel and monolithic kernel? What is a time-sharing system? What is Context Switching? What is difference between Kernel and OS? What is difference between process and thread? What are various sections of the process?
What is a deadlock in OS? What are the necessary conditions for a deadlock? What is spooling in OS? Os interview MCQs. Crack your next tech interview with confidence! Take Free Mock Interview. Timesharing OS Example: Multics, etc. Benefits: Such systems are used widely nowadays to improve performance in systems that are running multiple programs concurrently.
By increasing the number of processors, a greater number of tasks can be completed in unit time. One also gets a considerable increase in throughput and is cost-effective also as all processors share the same resources.
It simply improves the reliability of the computer system. Click here to download. There are two types of processes: Operating System Processes User Processes States of Process: Different states of the process through which process goes are given below: New State : In this state, a process is just created.
Waiting: In this state, the process cannot run because it just waits for some event to occur Ready: In this state, the process has all resources available that are required to run but it waits to get assigned to a processor because CPUs are not working currently on instructions passed by the process.
Terminate: In this state, the process is completed I. It has two major functions: Program code cannot change or modify itself. Local data for every client process needs to be stored in different disks. Types of Scheduling Algorithm There are different types of scheduling algorithms as given below: Paging Segmentation It is invisible to a programmer.
It is visible to a programmer. In this, the size of pages is fixed. In this, the size of segments is not fixed. Procedures and data cannot be separated in paging. Procedures and data can be separated in segmentation. It allows a cumulative total of virtual address spaces to cross physical main memory. It allows all programs, data, and codes to break up into independent address spaces.
It is mostly available on Windows servers that may support backward compatibility, while Linux has limited support. It is faster for memory access as compared to segmentation. It is slower as compared to paging. In this, OS needs to maintain a free frame. In this, OS needs to maintain a list of holes in the main memory.
In paging, the type of fragmentation is internal. In segmentation, the type of fragmentation is external. The size of the page is determined by available memory. The size of the page is determined by the user.
Multitasking Multiprocessing It performs more than one task at a time using a single processor. It performs more than one task at a time using multiple processors. In this, the number of CPUs is only one. In this, the number of CPUs is more than one.
It is more economical. It is less economical. It is less efficient than multiprocessing. It is more efficient than multitasking. It allows fast switching among various tasks. It allows smooth processing of multiple tasks at once. It requires more time to execute tasks as compared to multiprocessing.
It requires less time for job processing as compared to multitasking. When we use Priority Scheduling or Shortest Job First Scheduling, Starvation can happen, This algorithm is mostly used in CPU schedulers Starvation: It is generally a problem that usually occurs when a process has not been able to get the required resources it needs for progress with its execution for a long period of time.
Types of Semaphore There are usually two types of semaphores as given below: Binary Semaphore Counting Semaphore Binary Semaphore Mutex It allows various process threads to get the finite instance of the resource until resources are available. It allows various process threads to get single shared resource only at a time. Its functions are based upon signaling mechanisms. It also manages all communications between software and hardware components to ensure usability and reliability.
Real-time systems are used when rigid time requirements have been placed on the operation of a processor. It has well defined and fixed time constraints. Virtual memory is a memory management technique for letting processes execute outside of memory. This is very useful especially is an executing program cannot fit in the physical memory.
The main objective of multiprogramming is to have a process running at all times. With this design, CPU utilization is said to be maximized. In a Time-sharing system, the CPU executes multiple jobs by switching among them, also known as multitasking. This process happens so fast that users can interact with each program while it is running.
It is the most common type of multiple-processor systems. In this system, each processor runs an identical copy of the operating system, and these copies communicate with one another as needed.
Server systems can be classified as either computer-server systems or file server systems. In the first case, an interface is made available for clients to send requests to perform an action. In the second case, provisions are available for clients to create, access and update files. In asymmetric clustering, a machine is in a state known as hot standby mode where it does nothing but to monitor the active server. A thread is a basic unit of CPU utilization.
In general, a thread is composed of a thread ID, program counter, register set, and the stack. FCFS stands for First-come, first-served. It is one type of scheduling algorithm. Implementation is managed by a FIFO queue.
RR round-robin scheduling algorithm is primarily aimed for time-sharing systems. A circular queue is a setup in such a way that the CPU scheduler goes around that queue, allocating CPU to each process for a time interval of up to around 10 to milliseconds. Deadlock situations occur when four conditions occur simultaneously in a system: Mutual exclusion; Hold and Wait; No preemption; and Circular wait.
It gets its name from a banking system wherein the bank never allocates available cash in such a way that it can no longer satisfy the needs of all of its customers. One is that it depends on how often a deadlock is likely to occur under the implementation of this algorithm. The other has to do with how many processes will be affected by deadlock when this algorithm is applied. Logical address refers to the address that is generated by the CPU. On the other hand, physical address refers to the address that is seen by the memory unit.
With dynamic loading, a routine is not loaded until it is called. This method is especially useful when large amounts of code are needed in order to handle infrequently occurring cases such as error routines. Overlays are used to enable a process to be larger than the amount of memory allocated to it. The basic idea of this is that only instructions and data that are needed at any given time are kept in memory.
Paging is a memory management scheme that permits the physical address space of a process to be noncontiguous. It avoids the considerable problem of having to fit varied sized memory chunks onto the backing store. Fragmentation is memory wasted. It can be internal if we are dealing with systems that have fixed-sized allocation units, or external if we are dealing with systems that have variable-sized allocation units.
During regular intervals that are set by the operating system, processes can be copied from main memory to a backing store, and then copied back later. Swapping allows more operations to be run that can fit into memory at one time. A socket provides a connection between two applications. Each endpoint of a communication is a socket. Direct Access method is based on a disk model of a file, such that it is viewed as a numbered sequence of blocks or records. It allows arbitrary blocks to be read or written.
Direct access is advantageous when accessing large amounts of information. Thrashing refers to an instance of high paging activity. This happens when it is spending more time paging instead of executing. Primary commands. Compiler c. Utilities d.
User-happy b. User-simple c. User-friendly d. USB snap drive b. USB flash drive c. USB memory maker drive d. Source drive b. Destination drive c. USB drive d. Up to 8 characters b.
Up to 10 characters d. Which command is used to undelete a bunch of files with extension. Undelete b. Run applications b.
Device setting c. Turn off the system d. COM b. COM c. COM d. Destroys every byte of data on a disk by overwriting it with with blank spaces b. Transfer system files after format d. Once text has been cut to the clipboard, you can ….. Paste b. Copy c. Transfer d. To select multiple option b. To select single option c. To select all option d. To make the most efficient use of the computer hardware b.
To allow people to use the computer, c. To keep systems programmers employed d. To make computers easier to use. To make the most efficient use of computer hardware b.
To allow people to use the computer c. To keep system programmer employed d. To make computer easier to use. To check status of files in the print queue b. To cancel the print job c. To interrupt printing d.
Quick Response System b. Real Time System c. Time Sharing System d. Batch Processing System. Any amount of RAM can be allocated to virtual memory b. The setting for the amount of hard disk drive space to allocate virtual memory can be manually change c.
This temporary storage is called the swap file or page file d. Virtual memory is the physical space o the hard drive. The essential difference between an operating system like Linux and one like Windows is that.
Windows can run with an Intel processor, whereas Linux cannot b. Linux is a proprietary whereas Windows is not c. There are multiple versions of Linux, but only one version of Windows d. Any programmer can modify Linux code which is not permitted with Windows. The time taken by the dispatcher to stop one process and start another b.
The time taken by the processor to write a file into disk c. The whole time taken by all processor d. None of Above. All files inside the directory are moved b. All the subdirectory inside that directory are moved c. The directory is moved the source file is not moved d. Both a and b. The scandisk utility begins to run b. The video card and video memory are tested c.
The BIOS identification process occurs d. Memory chip are checked to ensure that they are working properly. Name of the file b. Extension of the file c. The amount of memory in your computer d.
Recycle bin b. Desktop c. Taskbar d. My computer. Dialog boxes b. Start menu c. A small part of taskbar that has icons of background running applications is. Start button b. Quick launch c. Task bar d. System tray. Home edition b. Media center edition c. Tablet PC edition d. Taskbar b. Status bar c. System tray d. Launch pad. Application system c.
System software d. Which runs on computer hardware and serve as platform for other software to run on? Operating System b. Application Software c. System Software d. System software b. Operating system c. System operations d. Standard menu b. System menu d. Operating environment b. System environment d. None of these. Which is the layer of a computer system between the hardware and the user program. When you start up the computer the boot up storage at which the BIOS versions manufacturer and data are displayed on the monitor is called.
Bootstrap b. Power on self test POST c. System configuration d. Kernel loading. Communication b. Application c. System d. Word processing software. Edit b. XCOPY c. Sys d. Save all opened files b. Close all running applications c. Switch off monitor d. Cut off the power supply. IT Expert b.
Diagnosis tool c. Surgeon d. Fdisk b. Format c. Subst d. You can move a window to a different position on your screen by dragging it by its. Move handle b. Tail c. Status bar d. Title bar. A bar that inform you the available options in your computer, opened applications, background running applications and can be used to switch between applications quickly is.
Menu bar b. Tool bar c. Task bar. Dialog box b. Task bar c. Start menu d. Navigation program b. Switching between program c.
0コメント