WordPress.com



VELAMMAL COLLEGE OF ENGINEERING AND TECHNOLOGY, MADURAI – 625 009Department of ITINTERNAL ASSESSMENT – IBranchB.Tech Year/Sem./Sec.II/IVCourse CodeCS8493Date30.01.2020Course NameOperating SystemsMax. marks50Course InchargeMs.R.Nancy Deborah, APIII/ITTime01:30 HoursPART A (Answer All Questions) (8 X 2 = 16)KCOMarks1.Differentiate between tightly coupled systems and systems.K1CO12List the difference between mainframe & desktop OSK1CO12Define Operating SystemK1CO122.What are the advantages of peer to peer systems over client server systems?K1CO12Differentiate between hard real time systems and soft real time systemsK2CO12Develop clustered systems.K1CO123.Consider why API's need to be used rather than system calls?K1CO12Illustrate with an example about OS a resource ManagerK2CO12Pointout the function of system programs. Write the categories in it.K2CO124.Describe bootstrap program.K2CO12What is the purpose of system programs?K1CO12Summarize the functions of DMAK1CO125.Define semaphore and mention the operations on semaphore.K1CO22Demonstrate when a system is said to be in safe state.K1CO22Define monitor. What does it consists of?K1CO226.What is the meaning of the term busy waitingK1CO22Convince the statement “If there is a cycle in the resource allocation graph, it may or may not be in deadlock state.K2CO22Define race condition.K1CO227.What is Critical Section problem?K1CO22Give two hardware instructions and their definitions which can be used for implementing Mutual Exclusion.K1CO22Conclude your answer is it possible to have a deadlock with only one process.K1CO228.What are the types of communication in client-server system?K1CO22What are the benefits of multithreading?K1CO22What is thread cancellation? Explain its types.K1CO22PART B (Answer All Questions) (2 X 13 = 26)10.(i)Classify different types of Computer system architecture (7) (ii)Illustrate the operating system structure and functions. (6)K2CO11310.Explain the concept of instruction execution in detail. (13) pare and contrast Multi threading Vs Multiprogramming (8) Multitasking Vs Multiprocessing (5) K2CO11311.(i)Discuss about monitor solution (10)(ii)Describe the operation on a process in detail. (3)K2CO21311.Explain the classic problems of synchronization with suitableexamples. K2CO21311.Explain about deadloacks in detail.K2CO213PART C (Answer All Questions) (1 X 8 = 8)12. Explain the FCFS, preemptive and non-preemptive versions of Shortest Job First and Round Robin (time-slice2) scheduling algorithms with Gantt Chart for the four processes given. Compare their average turn around and waiting timeProcess Arrival Time Burst Time P1 0 10 P2 1 6 P3 2 12 P4 3 15 K2CO2812(i)Examine the criteria for evaluating the performance ofscheduling Algorithms? (4)(ii)Demonstrate with an example about critical section (9)K2CO2812Evaluate the following snapshot of the system Allocation Max Available A B C D A B C D A B C D 1 5 2 0Po 0 0 1 2 0 0 1 2P1 1 0 0 0 1 7 5 0P2 1 3 5 4 2 3 5 6P3 0 6 3 2 0 6 5 2P4 0 0 1 4 0 6 5 6Answer the follow based on banker’s algorithm.(i)Define safety algorithm (2)(ii)What is the content of need matrix? (4)(iii)Is the system in a safe state? (4)K2CO28Course In-ChargeModule CoordinatorHOD/ITMs.R.Nancy DeborahMrs.D.AnandhavalliDr.R.Perumalraja ................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download