OS

II-MID IMP QUESTIONS - Aug 2015

1.       Assume the disk has 200 tracks and the requested tracks are received in the order: 55, 58, 39, 18, 90, 160, 150, 38, 184, 27, 129, 110, 186, 147, 41, 10, 64, and 120. Assume that the disk head is initially positioned over track 100 and is moving in the direction of decreasing track number. Perform the analysis for FIFO, SSTF, SCAN, C-SCAN, LOOK and C-LOOK. Compare the results and give recommendations.

2.       What is access matrix? Explain how the access matrix can be effectively implemented?

3.       Explain Free-Space management?

4.       What is Safe state? Write the Bankers algorithm and explain it with the help of an example?

5.    Explain firewall as a security mechanism

6.       What is a deadlock? How deadlock problem can be handled?

7.       Describe the file allocation methods: contiguous allocation, Linked allocation, Indexed allocation and its advantages and disadvantages with examples

8.       What are the different threats of a Computer System?

9.       What is the difference between protection and security? What are the goals of protection? How Network security is provided

10.   What is page fault? Discuss the page replacement algorithms

I-MID IMP QUESTIONS - MAY 2015

1.      What are the functions of an Operating system?

2.      What is the difference between symmetric and asymmetric multiprocessing

3.      Draw and explain about five-state process model.

4.      Discuss various issues of Multithreading programs

5.      How and what information about a process is represented using PCB

6.      What are the different types of Scheduling Queues? What are the different types of schedulers?

7.      What is the difference between Preemptive and non-preemptive scheduling?

8.      What is a critical section problem? Suggest classic software based solution?

9.      Explain various Scheduling algorithms with an example

10.  Explain about IPC? And what are the issues of IPC?    

OPERATING SYSTEM IMP QUESTIONS – AUG – 2014

1.       What are the functions of an Operating system?

2.       What are the different types of operating systems?

3.       Define Real-time operating systems. Explain their importance in various applications.

4.       Differentiate Distributed systems from Multiprocessor systems

5.       How the operating systems are designed using layered approach

6.       Time Sharing Operating Systems are logical extension of Multiprogramming Operating Systems. Discuss

7.       Discuss operating system from user point of view and system view

8.       What is system call? What is the difference between system call and system program. What are the different types of system calls?

9.       Explain the terms multiprogramming and multitasking.

10.   Explain the evolution of operating Systems?

11.   Draw and explain about five-state process model.

12.   Discuss various issues of Multithreading programs

13.   How and what information about a process is represented using PCB

14.   Explain Priority scheduling with the help of an example. What are Starvation and aging?

15.   What are the situations in which Round robin scheduling is preferred and situations in which it results in overhead

16.   What are the different types of Scheduling Queues? What are the different types of schedulers?

17.   What is the difference between Preemptive and non-preemptive scheduling?

18.   What is the difference between symmetric and asymmetric multiprocessing

19.   Explain communication in client server model

20.   How can Semaphores be used to achieve mutual exclusion? Explain with an example.

21.   What is meant by a counting semaphore and a binary semaphore? How a counting semaphore is implemented in terms of binary semaphores?

22.   What are the requirements of mutual exclusion?

23.   What is the need for Process synchronization? How hardware can be used to solve synchronization problem

24.   What is the critical-section problem? Discuss Peterson's solution

25.   Explain the Readers-Writers problem and give the solution for synchronization using semaphores

26.   Define monitor. What are its characteristics?

27.   What is an atomic transaction? Explain log-based recovery and checkpoints for ensuring transaction atomicity.

28.   Enumerate different Classical problems of synchronization. Give structure of their Process for these different problems

29.   What is a deadlock? What are the necessary conditions for a deadlock occurrence?

30.   What is Safe state? Write the Bankers algorithm and explain it with the help of an example.

31.   How Deadlocks can be prevented considering the four necessary conditions.

32.   What is Resource allocation graph? How Resource allocation graph can be used in the context of Deadlocks

33.   Discuss deadlock detection and recovery.

34.   What is the need for swapping?

35.   What is Contiguous memory allocation?

36.   What is segmentation? Explain

37.   What is page fault? Discuss the page replacement algorithms

38.   What is addressing binding? How base and limit registers can be used for address protection.

39.   What are the different types of fragmentation and what are the solutions for it.

40.   Explain the memory management technique Paging

41.   Discuss in detail about logical versus physical address space.

42.   Explain thrashing and its effect on CPU utilization

43.   Describe the key features of NTFS.

44.   Discuss file allocation method in UNIX file.

45.   Compare the different free space management techniques.

46.   What is mounting a file system? How file system is mounted in LINUX

47.   How Directories are implemented

48.   What are the different file attributes and file operations.

49.   Explain the different file access control methods.

50.   What are the different disk scheduling algorithms?

51.   Explain the different RAID levels.

52.   What is STREAMS? Explain.

53.   Explain kernel I/O system

54.   Differentiate between logical I/O and device I/O.

55.   How access matrix can be used for providing protection.

56.   How Firewalls are used for protection.

57.   How Firewalls are used for protecting a network. What are the expected features of a Firewall? Identify some features which may not be present in currently available firewalls.

58.   What are the different threats of a Computer System?

59.   What is the difference between protection and security? What are the goals of protection? How Network security is provided.

60.   Explain the following program threats.

a.       Trojan horse ii) Trap door iii) Stack and Buffer overflow

61.   Explain the following system threats

a.       Worms ii) Viruses iii) Denial of service

62.   How Cryptography can be used as a security tool

MCA II SEM OPERATING SYSTEMS Second MID IMP QUESTIONS

1.       What is a file locking? Compare shared lock and exclusive lock.

2.       Assume the disk has 200 tracks and the requested tracks are received in the order: 55, 58, 39, 18, 90, 160, 150, 38, 184, 27, 129, 110, 186, 147, 41, 10, 64, and 120. Assume that the disk head is initially positioned over track 100 and is moving in the direction of decreasing track number. Perform the analysis for FIFO, SSTF, SCAN, C-SCAN, LOOK and C-LOOK. Compare the results and give recommendations.

3.       What is page replacement? Explain LRU page replacement algorithm

4.       What is access matrix? Explain how the access matrix can be effectively implemented?

5.       Describe the file allocation methods: contiguous allocation, Linked allocation, Indexed allocation and its advantages and disadvantages with examples

6.       What is a deadlock? How deadlock problem can be handled?

7.       Explain Free-Space management?

8.       Explain firewall as a security mechanism

9.       What is paging and Demand paging. How Demand paging is implemented

10.   What is Safe state? Write the Bankers algorithm and explain it with the help of an example?

MCA II SEM OPERATING SYSTEMS FIRST MID IMP QUESTIONS

1.         What are the functions of an Operating system?

2.         What are the different types of operating systems?

3.         Define Real-time operating systems. Explain their importance in various applications.

4.         Differentiate Distributed systems from Multiprocessor systems

5.         How the operating systems are designed using layered approach

6.         What is system call? What is the difference between system call and system program. What are the different types of system calls?

7.         Explain the terms multiprogramming and multitasking.

8.         Draw and explain about five-state process model.

9.         Discuss various issues of Multithreading programs

10.     How and what information about a process is represented using PCB

11.     Explain FCFS scheduling with the help of an example.

12.     Explain SJF scheduling algorithm for both preemptive and non-preemptive with the help of examples.

13.     What are the different types of Scheduling Queues? What are the different types of schedulers?

14.     What is the difference between Preemptive and non-preemptive scheduling?

15.     What is the difference between symmetric and asymmetric multiprocessing

16. Explain communication in client server model

                                                                                External Exam Question Paper

SET-01

A) Design a Lexical analyzer in C Language. The lexical analyzer should ignore redundant spaces, tabs and newlines. It    should separate keywords identifiers operators and numbers

B)  Simulate LRU page replacement algorithms  

SET-02

A) Implement the lexical analyzer using JLex, flex or lex or other lexical analyzer generating tools.

B) Simulate the SJF CPU scheduling algorithms

 SET-03

A) Design Predictive parser for the given language

B) Simulate the PRIORITY CPU scheduling algorithms

 SET-04

A) Design LALR bottom up parser for the given language.

B) Simulate the ROUND ROBIN CPU scheduling algorithms

 SET-05

A) Convert the BNF rules into Yacc form and write code to generate abstract syntax tree.

B) Simulate Multiprogramming with Fixed number of Tasks

 SET-06

A) Design Predictive parser for the given language

B) Simulate the FCFS CPU scheduling algorithms

 SET-07

A)Implement the lexical analyzer using JLex, flex or lex or other lexical analyzer generating tools.

B) Simulate Sequential file allocation strategy

SET-08

A) Design Predictive parser for the given language

B) Simulate Bankers Algorithm for Dead Lock Avoidance

 SET-09

A) Design LALR bottom up parser for the given language.

B) Simulate FIFO page replacement algorithms

 SET-10

A) Implement the lexical analyzer using JLex, flex or lex or other lexical analyzer generating tools.

B) Simulate Multiprogramming with Variable number of Tasks

II MID IMP QUESTIONS

1.      Explain various page replacement algorithms with an example.

2.      What is Thrashing? Explain the causes of thrashing.

3.      Explain the following techniques for structuring the page table in detail.

a)Hierarchical paging b) Inverted page table

4.      What is Deadlock? What are the necessary conditions for deadlock?

5.      Write Bankers algorithm for deadlock. Explain it with an example

6.      Explain in detail about different access methods for accessing information.

7.      Explain acyclic graph directory structure.

8.      Explain the free-space management techniques

9.      What are the different types of mass storage structures?

10.  What are the different disk scheduling algorithms?

OS & CD LAB

SET-01

A) Design a Lexical analyzer for the given language. The lexical analyzer should ignore redundant spaces, tabs and newlines. It should also ignore comments. Although the syntax specification states that identifiers can be arbitrarily long, you may restrict the length to some reasonable value.

B) Simulate the FCFS CPU scheduling algorithms

SET-02

A) Implement the lexical analyzer using JLex, flex or lex or other lexical analyzer generating tools.

B) Simulate the SJF CPU scheduling algorithms

SET-03

A) Design Predictive parser for the given language

B) Simulate the PRIORITY CPU scheduling algorithms

SET-04

A) Design LALR bottom up parser for the given language.

B) Simulate the ROUND ROBIN CPU scheduling algorithms

SET-05

A) Convert the BNF rules into Yacc form and write code to generate abstract syntax tree.

B) Simulate Multiprogramming with Fixed number of Tasks

SET-06

A) Design Predictive parser for the given language

B) Simulate the FCFS CPU scheduling algorithms

SET-07

A)Implement the lexical analyzer using JLex, flex or lex or other lexical analyzer generating tools.

B) Simulate Sequential file allocation strategy

SET-08

A) Design Predictive parser for the given language

B) Simulate Bankers Algorithm for Dead Lock Avoidance

SET-09

A) Design LALR bottom up parser for the given language.

B) Simulate FIFO page replacement algorithms

SET-10

A) Convert the BNF rules into Yacc form and write code to generate abstract syntax tree.

B) Simulate Multiprogramming with Variable number of Tasks

*************

I Mid Imp Questions Date : 07-09-2013

1.      What are the different types of operating systems? What is meant by system call? Discuss about types of system calls?

2.     What is the difference between symmetric and asymmetric multiprocessing?

3.     Explain the layered approach and microkernel approach to system design?

4.     What is a process? Explain the process states and PCB

5.     What are the different types of Scheduling Algorithms? Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:

Process            Burst Time    Priority

P1                    10                     3

P2                    1                      1

P3                    2                      3

P4                    1                      4

P5                    5                      2

The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0.Draw four Gantt charts illustrating the execution of these processes using FCFS,SJF, a non preemptive priority ( a smaller priority number implies a higher priority), and RR (quantum = 1) scheduling.

6.      A. Describe in detail about the critical-section problem? What are the requirements to be satisfied for its solution? What is dining philosopher’s problem? Give solution

7.     Explain & give solution to readers and writers problem

8.      Discuss in detail the swapping technique. What is its purpose? Discuss briefly memory mapping and protection.

II Unit Test (24-07-2013)

1. What is a process? Explain the process states and PCB.

2. Discuss various issues of Multithreading programs.

3.What is a thread? What are the benefits of multi threaded programming?

4. What are the different types of Scheduling Queues? What are the different types of schedulers?

5. Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:

Process Burst Time Priority

P1           10          3

P2           1             1

P3           2             3

P4           1              4

P5           5              2

The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0.

a) Draw four Gantt charts illustrating the execution of these processes using FCFS,

SJF, a non preemptive priority ( a smaller priority number implies a higher priority), and RR (quantum = 1) scheduling.

I Unit Test Dt: 03-.7-2013

·         Discuss operating system from user point of view and system view?

·         What is the difference between symmetric and asymmetric multiprocessing?

·         What is meant by system call? Discuss about types of system calls?

·         What are the different types of operating systems?

Explain the layered approach and microkernel approach to system design?