Process

⏪Previous                                                          Next⏩

     

A process or task is an instance of a program in execution.
 The execution of a process must programs in a sequential manner. 
At any time at most one instruction is executed. 
The process includes the current activity as represented by the value of the program counter and the content of the processors registers.
 Also it includes the process stack which contain temporary data (such as 
method parameters return address and local variables) & a data section which contain global 
variables. 

Process memory is divided into four sections for efficient working :

• The Text section is made up of the compiled program code, read in from non-volatile storage when the program is launched.
• The Data section is made up the global and static variables, allocated and initialized prior to executing the main.
• The Heap is used for the dynamic memory allocation, and is managed via calls to new, delete, malloc, free, etc.
• The Stack is used for local variables. Space on the stack is reserved for local variables when they are declared.

⏪Previous                                                          Next⏩

1. What is an Operating System ?
2. Discuss the structure off OS ?
3. Explain type of OS?
4. Explain Function of OS?
5. Explain OS Services ?
6. What do mean by system call ?List different type ofsystem call available ?

1. what is process ? and Characteristics ?
2. What is different process state? explain the same in details?
3. write short note on user level and kernal level threads?
4. explain what is thread and its type ?
5. explain scheduler ? (short term,medium term,and long term)
6. state and explain scheduling criteria ?
7. Explain scheduling algorithm ? [ FCFS,SJF,PRIORITY,ROUND ROBINE.]    

1. What is process synchronization ? explain critical section problem and race condition ?
2. what is Race Condition ?
3. what is critical section problem?
4. explain classical problem of synchronization?
5. explain bounded - buffer problem?
6. explain reader - writer problem ?
7. explain Dining Philosophers Problem ?
8. explain semaphores ? its type ?

1.  What is deadlock ?
2. What are the 4 condition to produce deadlock ?
3. explain methods of handling deadlock ?
4. explain in detail deadlock prevention ?
5. write short note on deadlock avoidance ?
6. explain deadlock detection ? 
7. explain Banker algorithm with example ? 

1. What are memory management ?
2. what is contiguous memory allocation and non - contiguous memory allocation ?
3. explain concept of paging with neat diagram?
4. differentiate contiguous and non - contiguous memory allocation ?
5. explain in details various partitioning memory management?
6. explain the concept of Segmentation ?
7. what is Thrashing explain in details ?

1. explain virtual memory concept in details ? with advantages and disadvantages ?
2. explain page replacement algorithm ?
3. explain LRU , Optimal ,FIFO.