0% found this document useful (0 votes)
24 views6 pages

Operating System-Syllabus

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
24 views6 pages

Operating System-Syllabus

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Operating System Course Code: 22516

Program Name : Computer Engineering Program Group


Program Code : CO/CM/IF/CW
Semester : Fifth
Course Title : Operating System
Course Code : 22516

1. RATIONALE
An Operating System is basically a system program that controls the execution of application
programs and acts as an interface between applications and the computer hardware. It
manages the computer system resources to be used in an efficient manner. This course enables
to learn internal functioning of operating system and will help in identifying appropriate
Operating System for given applications/task. This course is also a prerequisite for the group
of courses included in 'Cloud Infrastructure Maintenance' Elective group.

2. COMPETENCY
The aim of this course is to help the students to attain the following industry identified
competency through various teaching learning experiences:
• ' Manage operations of Operating System.

3:. . COURSE OUTCOMES (COs}


The theory, practical experiences and relevant soft skills associated with this course are to be
taught and implemented, so that the student demonstrates the following industry oriented
COs associated with the above mentioned competency:
a, Install operating system and configure it.
b. Use operating system tools to perform various functions.
c. Execute process commands for performing process management operations.
d. Apply scheduling algorithms to calculate turnaround time and average waiting
time.
e. Calculate efficiency of different memory management techniques.
1. Apply file management techniques.

4. TEACHING AND EXAMINATION SCHEME


Teachi Examination Scheme

Credit Theo Practical


(L+T-I- E
L P Pa ESE PA Tota PA Tota
P)
Max Max l Max M M Max l Max

3 0 1 4 I Min 5 2
3 3 7 2 25

(*): Under the theory PA; Out of 30 marks, 10 marks of theory PA are for micro-project
assessment to .facilitate integration of COs and the remaining 20 marks is the average of 2
tests to be taken during the semester for the assessment of the UOs required for the
attainment of the COs.
Legends: L-Lecture; T — Tutorial/Teacher Guided Theory Practice; P - Practical; C Credit,
ESE - End Semester Examination; PA - Progressive Assessment
5. COURSE MAP (with sample COs, PrOs, UOs, ADOs, and topics) VO
This course map illustrates an overview of the flow and linkages of the topics al etyiNf t.
of outcomes (details in subsequent sections) to be attained by the student b

MSBTE — Final Copy Dt. 29.03.2019 Page 1 of 7 r


wry
Operating System Course Code: 22516

course, in all domains of learning in terms of the industry/employer identified competency


depicted at the centre of this map.
(• AIN) 1.114) 1.141t. etto:r, ........................
 en...en:Awn • .•'. . tlitimtn.,
opir 6.1 HIE- 4, nnecrrmtypes
Opontions,
.
2...  %N) tut - • rile
• . .!quitriti
................. _ • 1 . 114; p p r r - Pr . , • .
.•

........................... ,6■.••••••
.1 nit 1.11PAIC FtV
Jill !Mk% Li;

.---
Smite ltteting.entint '1 et

LL
8,,,,,,,,, I,,,,,,,,I 1 .4.4-
....... ... " ............... .. :-. - - - - -
;4. %
%6
Ii1q.1)-$14tM di 401 itt•
• !NIA PEA-MAP,
)
• • - - •• •• .-.. ,... ....
,-- I, •'.• .,—. . • ....-
-' --- • ....................... --.
.' .-- ..."I .() 7-
141 1 11c ,o ',:' Inowilin /4" , ....,. '44,.. .......... • • • • .... ..... , s
,

., ..V: page
11iirlorneill.1,11,0 - - - .• - 1Cr in- 1Jst vi aliitil & ' ..:- . , i

r i

'... replacement olgotitlim ... • perform MT ctlitot


r 1 ,./ IA, .:;i1 1,,Irldilsr'.4•,... ., ...... -•.................... '‘,.
-. .. ••. ...... coilinknini5 .. ,..„
r • . ,
1 - ......::,' , '
. , ,
—...-.-,. ...

/
i ,
/
. ........ . . ........ 0
, .......„ ..— „.....
A_.....-- ....„. :-
. ,
,,,
,..
/ •
r' " 1:0 id) Applk. W'ke..tuhn.'".4`n
0 ..-
- 4 I ' ) C ° " 1 " t e .

► 4 Ar ,•.../..I.(0,ecutc.
4:41 1 Wilnirountl
Waiting
ri............ ...•••••
. 1, F" Cil(C) if) Aimly, iiir• •
pincer •
i s
..•
S\
pvslin ming ',toilet',
••••-`
'f
•..
.

4 ;
\( .......„le; ,,,,,ii.n.•. ,,./
s ,, ..,,,,...trnonn.itm,,,i .1%-intion:.....
,4,...... #4.° lr
, 4 1' 1 ' i 1 l i 1 ".%
1 ; 4 1; 1 i L. i i ..... ::::: ::■::: iii i.i :::1 1 ) , 'i

, ,

.., ............ i.... ...-, , .,
., ., ....... , Tr...
ti
I-. ....... ......., , # ,
...'.... CO .11,) l I 1•C tPriefelf I ItS ..../c... , •
,
.• ..,-oronnatul- in. 4 ail.
: :
•••• 1.A1 5- 1,cone inskc-el• ".„ - - - ,,( 4
RN,: en, lool:. In ptlfmm ../ ,. , , ...11nr6aci i ales of
like '1
...,, "7 10 ll► 1:Npl.m.
,
,. .. .4•••••...... ....
4 ..... ,4/1,13. l'inictimi%
••-,, „_, __ ..•••^;... ...... - • .. „-..._. - -• • ?Nen inte kir
,
. it .. ... _ _,..... .. '•.. .•' Lo. I._ ',aim' •••, . •- N., PIPP.111111Fp, ,ym.4tri.....,,. ,,
:-..., --. _,....
.•• 1.0 3- ,kik,ori, ,v11 11 '.
..- - —operning. svnem And .
7,1111: ••
.. i multiple Lino., '. • "--. • •'
7 6 1,0 1 : .. h i s /I S e I l i ; .
Legends • conliguir il_ - , /
no,n1 asul ubleciis.c. of ". km3'114415 A; boific .....• 4. .' ., /
,. ••. ............. • „ ...'• ........... •••..., „ -' ' ' ..•
.-. /711/111114111114 ..... Ir.. '
I
• ti)h WWII/illy With , . ,/
 ........ icirqkloPeossottple •,_
-... I
....... " .... ,
, • . - - _.;......... „ • — .„ . . ., ..
--. . 16 .• •
„... ....................... .... ......... ....
., ......... ... .....
1 % / • ••• 10 141 CORIllili ,' • '•••• .di'
.
.11.4 1 - Aflopic "...%
1 14 1
- Own*. Outcome i •,. 1.0 thr,Jugli Practicals i
 .
....,..• , . , . Dornnin 4,
... . . 113,11PIAll I ()u►ciitile •. - Topic
. ..'
... ... ., -- '''' ...... ..••••
... . ..' .............. .......... "•
......................

Figure 1 - Course Map

6. SUGGESTED PRACTICALS/ EXERCISES


The practicals in this section are PrOs (i.e. sub-components of the COs) to be developed and
assessed in the student for the attainment of the competency:

Practical Outcomes (PrOs Approx.


Hrs.
1. Install and configure Linux (or Required
Sr. alike) operating system. Unit 02*
No. 2. Execute general purpose commands No. 02*
date, time, cal, clear, banner, tty, script,
man. I
Work with multiple linux terminals and basic commands: who,
who am I, login, passwd, su, pwd.
a) Use Operating services(Editor, GUI, File handling.)

MSBTE -- Final Copy Dt. 29.03.2019 Page 2 of 7


Operating System Course Code:

Approx.
Sr. Unit
Hrs.
No. No. Required
Practical Outcomes (PrOs
b) Run commands to start, stop, and restart the specified service in
Linux.
Execute process commands- ps, wait, sleep, exit, kill. III 02*
Write a program to calculate total waiting and turnaround time of n IV 02
processes with First Come First Serve CPU scheduling algorithm.
7. Write a 'C' program to implement FIFO page replacement V 02
algorithm.
8. Execute file and directory manipulation commands — ls, rm, my, VI 02*
cp, join, split, cat (file saving and redirection operator), head, tail,
touch,
9.Execute file and directory manipulation commands — diff, comm., VI 02*
pr, chmod, mkdir, rmdir, cd, pwd, dir, cmp. (Use wild card
character).
10.
Execute text processing tr, wc, cut, paste, spell, sort, grep, more. VI 02*
11.
Use vi editor and perform all editor commands. VI 04*
12.
Write and execute Shell Script by using following Control VI 02*
statements features- "i' statement
13.
Write and execute Shell Script by using following Control VI 02*
statements features- "for" statement, exit, break, continue
14, Write Shell script to find out whether - Given file exists? VI 02
15. Write Shell script to find out whether - VI 02*
File has read, write, and execute permissions?
Total 32

Note
i. In the above listed example wherever Linux as operating system is mentioned, it
could be replaced with other alike operating systems such as Ubuntu, CentOs or any other
OS.
ii. A suggestive list of PrOs is given in the above table. More such PrOs can be
added to attain the COs and competency. A judicial mix of minimum 12 or more practical need
to be perlbrmed, out of which, the practicals marked as '* ' are compulsory, s that the
student reaches the 'Application Level' of Bloom's Taxonomy' as generally required by
the industry.
iii. The 'Process' and 'Product' related skills associated with each PrO are to be
assessed according to a suggested sample given below:

S. No. Performance Indicators Weightage in %


a. Installation/configuration of operating system 25
b. Correctness of Executing various commands 25
c. Writing and executing programs to get desired output 20
d. Debugging the program 15
e. Submit journal report in time 15
Total 100
The above PrOs also comprise of the following social skills/attitudes which are Affective
Domain Outcomes (ADOs) that are best developed through the laboratory/field based
experiences:
a.Follow safety practices.
b.Practice good housekeeping.

MSBTE — Final Copy Dt. 29.03.2019 Page 3 of 7


Operating System Course Code: 22516

c.Demonstrate working as a leader/a team member.


d.Follow ethical practices.

The ADOs are not specific to any one PrO, but are embedded in many PrOs. Hence, the
acquisition of the ADOs takes place gradually in the student when s/he undertakes a series of
practical experiences over a period of time. Moreover, the level of achievement of the ADOs
according to Krathwohl's 'Affective Domain Taxonomy' should gradually increase as planned
below:
in • 'Valuing Level' i s t year
'Organising Level' in 2 year and
nd

'Characterising Level' in 3 rd year.

7.MAJOR EQUIPMENT/ INSTRUMENTS REQUIRED


The major equipment with broad specification mentioned here will usher in uniformity in
conduct of experiments, as well as aid to procure equipment by authorities concerned.
PrO
Equipment Name with Broad Specifications
No. S. No.
1 Computer system All
(Any computer system with basic configuration)
Linux or alike operating system such as Ubuntu, CentOS or any other.

8.U N D E R P I N N I N G T H E O R Y C O M P O N E N T S
The following topics are to be taught and assessed in order to develop the sample UOs given
below for achieving the COs to attain the identified competency. More UOs could be added.

Unit Unit Outcomes (UOs) Topics and Sub-topics


(in cognitive domain)
Unit — la. Explain the functioning of 1.1 Operating System — Concept,
Overview given component of OS. Components of operating system,
of lb. Explain characteristics of the operations of OS: Program
Operating given type of operating Management, Resource management,
System system. Security and protection.
l c. Identify type of operating Views of OS: User view, System View
system suitable for the given 1.2 Different Types of Operating systems-
type of application. Batch operating system, Multi
ld. Execute command on Programmed, Time Shared OS.
Multiprocessor Systems, Distributed
command line for the given
Systems, Real time systems. Mobile OS
task.
(Android,iOS).
1.3 Command line based OS — DOS, UNIX
GUI based OS —WINDOWS, LINUX.
Unit— II 2a 2.1 Different Services of Operating System. 2.2
Services Start, System Calls- Concept, types of system calls
and stop, 2.3 OS Components: - Process Management,
Componen and Main Memory Management, File
is of restart Management, I/O System management,
the Secondary management.
Operating given 2.4 Use of operating system to user
System servic management, security
e in
Linux.

MSBTE — Final Copy Dt. 29.03.2019 Page 4 of 7


Operating System Course Code: 22516

U Unit Outcomes (UOs) Topics and Sub-topics


(in cognitive domain)
device management, performance
monitor, task scheduler
3a Explain functions 3.1 Process-: process states,
Unit- III
carried out in the given Process Control Block (PCB).
Process
process state. 3.2 Process Scheduling- Scheduling
Manage
3b Describe the Queues, Schedulers, Context switch.
me nt 3.3 Inter-process communication (IPC):
function of the given
component of process Introduction, shared memory system
stack in PCB. and message passing system.
3c Explain 3.4 Threads - Benefits, users and kernel
characteristics of the given threads, Multithreading Models -
multithreading model. Many to One, One to One, Many to
Many.
3d Describe method
3.5 Execute process commands- like
of executing the given
ps, wait, sleep, exit, kill
process command with
example. 4.1 Scheduling types scheduling
Objectives, CPU and I/O burst
cycles, Pre-emptive, Non- Pre-
4a Justify the need emptive Scheduling, Scheduling
Unit-IV criteria.
CPU and objective of given job
scheduling criteria with 4.2 Types of Scheduling algorithms -
Scheduli
relevant example. First come first served (FCFS),
ng and
4b Explain with Shortest Job First (SJF), Shortest
Algorithms Remaining Time(SRTN), Round
example the procedure
of allocating CPU to the Robin (RR) Priority scheduling,
given process using the multilevel queue scheduling.
specified OS. 4.3 Deadlock - System Models,
Necessary Conditions leading to
4c Calculate
Deadlocks, Deadlock Handling -
turnaround time and Preventions, avoidance.
average waiting time of
the given scheduling
algorithm.
4d Explain
functioning of the given
necessary condition
leading to deadlock.

Unit -V 5a Describe the 5d Calculate Page fault for


Memory working of specified the given page reference string.
Manage memory Unit- 6a Explain structure of the
m ent management VI File given file system with example.
function. 6b Describe mechanism of
Manage
5b m ent the given file access method.
Explain 6c Explain procedure to
characteristic of the given create and access directories and
memory management assign the given files access
techniques. permissions.
5c Write algorithm
for the given page
replacement technique.

MSBTE - Final Copy Dt. 29.03.2019 Page 5 of 7


6d Explain features 5.1 Basic Memory Management -
of the given Raid level Partitioning, Fixed and Variable,
structure of hard disk. Free Space management
Techniques - Bitmap, Linked List.
5.2 Virtual Memory - Introduction to
Paging, Segmentation,
Fragmentation, and Page fault.
5.3 Page Replacement Algorithms:
FIFO, LRU, Optimal.

6.1 File - Concepts, Attributes,


Operations, types and File System
Structure.
6.2 Access Methods - Sequential,
Direct, Swapping, File Allocation
Methods-Contiguous, Linked,
Indexed.
6.3 Directory structure-- Single level,
two levels, tree-structured directory,
Disk Organization and disk
Structure-Physical structure, Logical
structure, Raid structure of disk, raid

level 0 to 6.

You might also like