Scribd
Upload
21 views3 pages

2017nov 26

ict

Uploaded by

Antony mutahi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
21 views3 pages

2017nov 26

ict

Uploaded by

Antony mutahi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 3
easytvet.com 1920/106 OPERATING SYSTEMS November 2017 ‘Time: 3 hours THE KENYA NATIONAL EXAMINATIONS COUNCIL CRAFT CERTIFICATE IN INFORMATION TECHNOLOGY OPERATING SYSTEMS 3 hours INSTRUCTIONS TO CANDIDATES This paper consists of 15 (FIFTEEN) questions in TWO sections: A.and B. Answer ALL the questions in section A in the answer booklet provided. Answer any FOUR of the FIVE questions in section B in the answer booklet provided. Candidates should answer the questions in English. This paper consists of 4 printed pages Candidates should check the question paper to ascertain that all the ages are printed as indicated and that no questions are missing. © 2017 The Kenya National Examinations Councit Turn over easytvet.com SECTION B (60 marks) Answer any FOUR questions from this section. 11, (@) A hard disk received requests from the disk drive controller for the data in tracks 7, 4, 12, 17 and 20 respectively. Given that the disk has a total of 25 tracks, seek time of 4 msec per track moved and that the head is initially at track 9, calculate the seek time needed for each of the following disk arm scheduling algorithms: @ — escan; Gi) shortest seek first. (7 marks) (b) Distinguish between job control language and assembly language as used in systems software, (4 marks) © oo system schedules jobs for execution. Explain two schedulers used for this tice: hems = 14 Pi hefrernine WAAR FER Bre yobs ade (4 marks) =U Nn eress eg formate Roted tate oY Poe Uirsen 12. @ emitter er in'operating systems:” ion (i) context switch; (i) file allocation table; (i) spooting- (y Aa prbtry rome Henmathy (6 marks) Anba of (b) A computer system experienced a.deadlock during inter-process communication, explain three methods that the operating system could use to recover from the deadlock. (6 marks) = Miche — No pre-emehiod ~ Held & eth Dieter (©) ~ A data processing system tses mulliprogramming operating system. Describe this type of operating system. G marks) 13. (a) Classify the following software as either application sofiware or systems software: org 2-5 7 UF wea Unix, windows ultimate 7, andfold, database ritfmagement system, asitinbler, gdbele a a * chrome. (3 marks) ~.(b) With the aid of a diagram, describe a client-server operating system. (6 marks) —= (6) Each process is represented in the operating system by a process control block. Explain three items of information contained in the block. (6 marks) 14. (@) Outline three reasons why a disk would be formatted. G marks) (6) Outline three data backup methods. (3 marks) 1920/106 3 Turn over November 2017 15, © easytvet.com ‘A commercial bank requires its entire staff to be connected on a network to support time sharing system. Suppose two requests are sent at the same time for processing from different users, describe the execution procedure of the requests using round robin scheduling algorithm, (S marks) (@) Explain the term warm boot as used in computer systems, giving a situation when it could be necessary. (4 marks) (@) Explain the function of each of the following disk utilities: i) defrag; (ii) scandisk. (4 marks) () The operating system performs various memory management functions, Explain three such functions, (6 marks) (©) Consider the following set of processes that arrive at time 0 with the length of the CPU burst given in milliseconds. Process Burst time PL 18 P2 6 P3 6 If the processes arrive in the order.P2, P3, PI and are served on first come first served basis: (represent the order in which the process are served using aGantt chart; (2 marks) (ii) calculate the average waiting time. (3 marks) ‘THIS IS THE LAST PRINTED PAGE. 1920/106 4 November 2017

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy