Os Interview Questions and Faqs
1)What is MUTEX ?
2)What isthe difference between a 'thread' and a 'process'?
3)What is INODE?
4)Explain the working of Virtual Memory.
5)How does Windows NT supports Multitasking?
6)Explain the Unix Kernel.
7)What is Concurrency? Expain with example Deadlock and Starvation.
8)What are your solution strategies for "Dining Philosophers Problem" ?
9)Explain Memory Partitioning, Paging, Segmentation.
10)Explain Scheduling.
11)Operating System Security.
12)What is Semaphore?
13)Explain the following file systems : NTFS, Macintosh(HPFS), FAT .
14)What are the different process states?
15)What is Marshalling?
16)Define and explain COM?
17)What is Marshalling?
18)Difference - Loading and Linking ?
19)What are the basic functions of an operating system?
20)Explain briefly about, processor, assembler, compiler, loader, linker and the functions executed by them.
21)What are the difference phases of software development? Explain briefly?
22)Differentiate between RAM and ROM?
23)What is DRAM? In which form does it store data?
24)What is cache memory?
25)What is hard disk and what is its purpose?
26)Differentiate between Complier and Interpreter?
27)What are the different tasks of Lexical analysis?
28)What are the different functions of Syntax phase, Sheduler?
29)What are the main difference between Micro-Controller and Micro- Processor?
30)Describe different job scheduling in operating systems.
31)What is a Real-Time System ?
32)What is the difference between Hard and Soft real-time systems ?
33)What is a mission critical system ?
34)What is the important aspect of a real-time system ?
35)If two processes which shares same system memory and system clock in a distributed system, What is it called?
36)What is the state of the processor, when a process is waiting for some event to occur?
37)What do you mean by deadlock?
38)Explain the difference between microkernel and macro kernel.
Give an example of microkernel.
39)When would you choose bottom up methodology?
40)When would you choose top down methodology?
41)Write a small dc shell script to find number of FF in the design.
42)Why paging is used ?
43)Which is the best page replacement algorithm and Why? How much time is spent usually in each phases and why?
44)Difference between Primary storage and secondary storage?
45)What is multi tasking, multi programming, multi threading?
46)Difference between multi threading and multi tasking?
47)What is software life cycle?
48)Demand paging, page faults, replacement algorithms, thrashing, etc.
49)Explain about paged segmentation and segment paging
50)While running DOS on a PC, which command would be used to duplicate the entire diskette?
Showing posts with label os interview question and answers. Show all posts
Showing posts with label os interview question and answers. Show all posts
Explain the concept of Reentrancy in Operating systems.?-Os interview questions
Explain the concept of Reentrancy in Operating systems.?-Os interview questions
It is a useful, memory-saving technique for multiprogrammed timesharing systems. A Reentrant Procedure in O.S is one in which multiple users can share a single copy of a program during the same period. Reentrancy has 2 key aspects: The program code cannot modify itself, & the local data for each user process must be stored separately.
Thus, the permanent part is the code, & the temporary part is the pointer back to the calling program & local variables used by that program. Each execution instance is called activation. It executes the code in the permanent part, but has its own copy of local variables/parameters. The temporary part associated with each activation is the activation record. Generally, the activation record is kept on the stack.
It is a useful, memory-saving technique for multiprogrammed timesharing systems. A Reentrant Procedure in O.S is one in which multiple users can share a single copy of a program during the same period. Reentrancy has 2 key aspects: The program code cannot modify itself, & the local data for each user process must be stored separately.
Thus, the permanent part is the code, & the temporary part is the pointer back to the calling program & local variables used by that program. Each execution instance is called activation. It executes the code in the permanent part, but has its own copy of local variables/parameters. The temporary part associated with each activation is the activation record. Generally, the activation record is kept on the stack.
List the Coffman's conditions that lead to a deadlock in OS ?- os interview
List the Coffman's conditions that lead to a deadlock in OS ?- os interview
Mutual Exclusion: Only one process may use a critical resource at a time.
Hold & Wait: A process may be allocated some resources while waiting for others.
No Pre-emption: No resource can be forcible removed from a process holding it. Circular Wait: A closed chain of processes exist such that each process holds at least
Mutual Exclusion: Only one process may use a critical resource at a time.
Hold & Wait: A process may be allocated some resources while waiting for others.
No Pre-emption: No resource can be forcible removed from a process holding it. Circular Wait: A closed chain of processes exist such that each process holds at least
What is a binary semaphore? What is its use?
What is a binary semaphore? What is its use?
A binary semaphore is one, which takes only 0 & 1 as values. They are used to implement mutual exclusion & synchronize concurrent processes.
A binary semaphore is one, which takes only 0 & 1 as values. They are used to implement mutual exclusion & synchronize concurrent processes.
Explain Belady's Anomaly.?-Os interview question and answers
Explain Belady's Anomaly.?-Os interview question and answers
Also called FIFO anomaly of O.S. Usually, on increasing the number of frames allocated to a process' virtual memory, the process execution is faster, because fewer page faults occur. Sometimes, the reverse happens, i.e., the execution time increases even when more frames are allocated to the process. This is Belady's Anomaly. This is true for certain page reference patterns.
Also called FIFO anomaly of O.S. Usually, on increasing the number of frames allocated to a process' virtual memory, the process execution is faster, because fewer page faults occur. Sometimes, the reverse happens, i.e., the execution time increases even when more frames are allocated to the process. This is Belady's Anomaly. This is true for certain page reference patterns.
What is thrashing? -OS interview question
What is thrashing? -OS interview question
It is a phenomenon in virtual memory schemes when the processor spends most of its time swapping pages, rather than executing instructions. This is due to an inordinate number of page faults.
It is a phenomenon in virtual memory schemes when the processor spends most of its time swapping pages, rather than executing instructions. This is due to an inordinate number of page faults.
Subscribe to:
Posts (Atom)
