Anda di halaman 1dari 13

Lovely Professional University, Punjab

Course Code Course Title Course Planner Lectures Tutorials Practicals Credits
CAP560 OPERATING SYSTEM 18715::Ajay Kumar Bansal 4 0 0 4
Course Weightage ATT: 5 CA: 25 MTT: 20 ETT: 50 Exam Category: 13: Mid Term Exam: All MCQ – End Term Exam: MCQ +
Subjective
Course Orientation KNOWLEDGE ENHANCEMENT

TextBooks ( T )
Sr No Title Author Publisher Name
T-1 OPERATING SYSTEMS A SILBERSCHARTZ ADDISON-WESLEY
CONCEPTS AND GALVIN
Reference Books ( R )
Sr No Title Author Publisher Name
R-1 OPERATING SYSTEMS MILAN MILANKOVIC MCGRAW HILL EDUCATION
CONCEPTS AND DESIGN?
R-2 MODERN OPERATING SYSTEM ANDREW S. PRENTICE HALL
TANENBAUM
R-3 THE DESIGN OF THE UNIX MAURICE J. BACH PEARSON
OPERATING SYSTEM
R-4 BEGINNING LINUX NEIL MATTHEW WILEY
PROGRAMMING
R-5 OPERATING SYSTEMS : CHOUDHURY, PHI Learning Pvt Ltd
PRINCIPLES AND DESIGN PABITRA PAL
Other Reading ( OR )

Sr No Journals articles as Compulsary reading (specific articles, complete reference)

OR-1 http://www.sigops.org/osr.html ,

Relevant Websites ( RW )
Sr No (Web address) (only if relevant to the course) Salient Features
RW-1 http://www.personal.kent.edu/~rmuhamma/OpSystems/os.html Operating system concepts

RW-2 http://www.tutorialspoint.com/operating_system/os_processes.htm OS Services and processes

RW-3 http://courses.cs.vt.edu/csonline/OS/Lessons/Deadlock/index.html Deadlocks

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Audio Visual Aids ( AV )
Sr No (AV aids) (only if relevant to the course) Salient Features
AV-1 https://www.youtube.com/watch?v=MaA0vFKt-ew Introduction to OS
AV-2 http://www.satishkashyap.com/2013/02/video-lectures-on-operating-systems-by.html All topics covered

LTP week distribution: (LTP Weeks)


Weeks before MTE 7
Weeks After MTE 7
Spill Over (Lecture) 8

Detailed Plan For Lectures


Week Lecture Broad Topic(Sub Topic) Chapters/Sections of Other Readings, Lecture Description Learning Outcomes Pedagogical Tool Live Examples
Number Number Text/reference Relevant Websites, Demonstration/
books Audio Visual Aids, Case Study /
software and Virtual Images /
Labs animation / ppt
etc. Planned
Week 1 Lecture 1 Introduction to operating T-1 RW-1 L1: Lecture 0 Students will come to Blend of Windows
system(Introduction) R-1 AV-1 L2:Operating systems know the basic powerpoint different
AV-2 and its history behind studying the presentation with versions as a
concept of operating AV history
systems and its
history
Lecture 2 Introduction to operating T-1 RW-1 L1: Lecture 0 Students will come to Blend of Windows
system(Introduction) R-1 AV-1 L2:Operating systems know the basic powerpoint different
AV-2 and its history behind studying the presentation with versions as a
concept of operating AV history
systems and its
history
Lecture 3 Introduction to operating T-1 RW-1 Different types of Students will come to Discussion and Batch system
system(Types of operating R-5 AV-2 operating systems and know the different demonstration work by
systems) their introduction OS using white board punching the
available and their data on punch
usage cards and then
those cards will
be read to
complete the
execution
Lecture 4 Introduction to operating T-1 OR-1 Components of As a result of this Discussion and
system(System components) operating system and lecture students will demonstration
system level programs come to know about using white board
the components of
operating system

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 2 Lecture 5 Introduction to operating T-1 OR-1 Different services of Students will come to Discussion and To arrange
system(Operating system operating system know the different demonstration books from
services) including file services of operating using white board library on your
management, memory system shelf includes
management, process memory
management et.all management
and cache
Lecture 6 Introduction to operating T-1 OR-1 System calls and types System calls and Discussion and If we want to
system(System calls) R-4 of system calls including types demonstration communicate
system programs of system calls using white board with computer
including system then we
programsStudents communicate in
will come to know machine
about the way a user language
can interact with the similarly if a
hardware user wants to
interact with
kernel then he
will interact
using system
calls
Lecture 7 Process(Process concept) T-1 OR-1 Process and its states Process and its states Blend of If there is any
including interrupt including interrupt powerpoint input output call
Students will presentation with then process will
understand about the AV go in the waiting
states of a process state that depicts
when it enters the that a process
system needs to wait for
some amount of
time until the
interrupt will be
handled
Lecture 8 Process(Process states) T-1 OR-1 New, Ready, Waiting, Students will come to Discussion and
RW-2 Abort etc states of know about the states demonstration
process needs to be and tasks of a process using white board
discussed
Week 3 Lecture 9 Process(Operations on T-1 OR-1 Different operations of a Students will come to Discussion and Process
processes) R-2 RW-2 process and context know about the demonstration Creation: to give
switching operation that can be using white board birth to new
performed on a process using
process fork() system
call Process
termination: to
terminate the
working of a
process

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 3 Lecture 10 Process Management T-1 OR-1 Process control block Students will come to Discussion and
(Process control block) R-2 RW-2 (PCB) and its working know the details of demonstration
in details each process that using white board
what are the
components that a
process can have

Lecture 11 Process Management R-2 OR-1 Different operations of a Students will come to Discussion and Process
(Context switching) RW-2 process and context know about the demonstration Creation: to give
switching operation that can be using white board birth to new
performed on a process using
process fork() system
call Process
termination: to
terminate the
working of a
process

Lecture 12 Process Management R-2 OR-1 Scheduling of the As a result of this Discussion and Priority: when a
(Process scheduling) RW-2 processes lecture students will demonstration process with
come to know the using white board high priority
schedule in which the comes it needs
different processes to execute first
can run
Week 4 Lecture 13 Process Management R-2 OR-1 Scheduling of the As a result of this Discussion and Priority: when a
(Process scheduling) RW-2 processes lecture students will demonstration process with
come to know the using white board high priority
schedule in which the comes it needs
different processes to execute first
can run
Lecture 14 Process Management R-2 OR-1 Communication Students will come to Discussion and When A wants
(Interprocess RW-2 between two or more know that how demonstration to communicate
communication) processes. Includes different processes using white board with C in a
message passing and can communicate memory, then it
Interprocess with each other using can do so by
communication message passing and message passing
IPC

Lecture 15 Process Management R-2 OR-1 Communication Students will come to Discussion and When A wants
(Interprocess RW-2 between two or more know that how demonstration to communicate
communication) processes. Includes different processes using white board with C in a
message passing and can communicate memory, then it
Interprocess with each other using can do so by
communication message passing and message passing
IPC

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 4 Lecture 16 Process Management R-2 OR-1 Overview of threads and Students will come to Discussion and In a website
(Threads and RW-2 multithreading models know about the parts demonstration there are
Multithreading) of a process that are using white board multiple things
known as threads that are going on
side by side
which includes
images, videos
etc, which is an
example of
multiuthreading

Week 5 Lecture 17 CPU Scheduling T-1 OR-1 Types of CPU Students will come to Demonstration
(Introduction) scheduling and its know the different using board
complete explanation types of scheduling
CPU Scheduling(Types of T-1 OR-1 Types of CPU Students will come to Demonstration
scheduling) scheduling and its know the different using board
complete explanation types of scheduling
Lecture 18 CPU Scheduling T-1 OR-1 Types of CPU Students will come to Demonstration
(Introduction) scheduling and its know the different using board
complete explanation types of scheduling
CPU Scheduling(Types of T-1 OR-1 Types of CPU Students will come to Demonstration
scheduling) scheduling and its know the different using board
complete explanation types of scheduling
Lecture 19 CPU Scheduling(Scheduling T-1 OR-1 Basic Concepts pf CPU Students will come to Demonstration and Number of
Criteria) scheduling and know about the discussion using processes that
Scheduling Criteria parameters to judge white board can execute in 1
the efficiency of a sec will judge
system the through put
of a systems and
it should be
more

Lecture 20 CPU Scheduling(Scheduling T-1 OR-1 l20: Scheduler, L20:Students will Discussion and While
Algorithms) Dispatcher First come come to know about demonstration depositing the
first serve algo and the working of FCFS using white board fee the student
shortest job first and SJF who came first
L21: Priority scheduling L21: Students will will be the first
and Round robin come to know about one whose fee
scheduling the working of will be
L22: Preemptive and Priority and Round submitted
Non preemptive robin similar is the
scheduling of SJF, L22: Numericals on case with FCFS
FCFS and Round robin all algos

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 6 Lecture 21 CPU Scheduling(Scheduling T-1 OR-1 l20: Scheduler, L20:Students will Discussion and While
Algorithms) Dispatcher First come come to know about demonstration depositing the
first serve algo and the working of FCFS using white board fee the student
shortest job first and SJF who came first
L21: Priority scheduling L21: Students will will be the first
and Round robin come to know about one whose fee
scheduling the working of will be
L22: Preemptive and Priority and Round submitted
Non preemptive robin similar is the
scheduling of SJF, L22: Numericals on case with FCFS
FCFS and Round robin all algos

Lecture 22 CPU Scheduling(Scheduling T-1 OR-1 l20: Scheduler, L20:Students will Discussion and While
Algorithms) Dispatcher First come come to know about demonstration depositing the
first serve algo and the working of FCFS using white board fee the student
shortest job first and SJF who came first
L21: Priority scheduling L21: Students will will be the first
and Round robin come to know about one whose fee
scheduling the working of will be
L22: Preemptive and Priority and Round submitted
Non preemptive robin similar is the
scheduling of SJF, L22: Numericals on case with FCFS
FCFS and Round robin all algos

Lecture 23 Test 1
Lecture 24 Process Syncronization T-1 RW-2 Process Synchronization Students will come Demonstration and P1 wants to use
(Background) and its detailed concepts to know about the Discussion using the same
synchronization of white board resource that is
the processes being held by
P2. So they will
synchronize in a
manner to
achieve
deadlock free
environment

Process Syncronization T-1 RW-2 Process Synchronization Students will come Demonstration and P1 wants to use
(Critical section problem) and its detailed concepts to know about the Discussion using the same
synchronization of white board resource that is
the processes being held by
P2. So they will
synchronize in a
manner to
achieve
deadlock free
environment

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 7 Lecture 25 Process Syncronization T-1 RW-2 Process synchronization Students will learn Discussion and
(Semaphores) using semaphores another way of demonstration
synchronization using white board
among processes
using semaphores
Lecture 26 Process Syncronization T-1 RW-2 Serialization of the Students will come to Discussion and
(Concept of serializability) processes for proper know that in which demonstration
communication order the process are
going to
communicate using
serial order

SPILL OVER
Week 7 Lecture 27 Spill Over
Lecture 28 Spill Over

MID-TERM
Week 8 Lecture 29 Deadlocks(Deadlock T-1 RW-3 System Model and Students will learn Demonstration and
Characterization) AV-2 Deadlock about deadlocks and discussion using
characterization the ways to improve animation
deadlocks
Lecture 30 Deadlocks(Methods for T-1 RW-3 Different ways to handle As a result of this Discussion and
handling deadlocks) R-2 AV-2 deadlocks lecture students will demonstration
come to know about using powerpoint
the ways to handle presentation
deadlocks
Lecture 31 Deadlocks(Deadlock T-1 RW-3 Prevention measures to Students will come to Discussion and
Prevention) AV-2 prevent deadlock know about the ways demonstration
to prevent deadlock using AV
Lecture 32 Deadlocks(Deadlock T-1 RW-3 Ways to avoid deadlock this lecture students Blend of
avoidance) R-2 AV-2 will learn the ways to powerpoint
avoid deadlock presentation with
AV
Week 9 Lecture 33 Deadlocks(Deadlock T-1 RW-3 Ways to avoid deadlock this lecture students Blend of
avoidance) R-2 AV-2 will learn the ways to powerpoint
avoid deadlock presentation with
AV
Lecture 34 Deadlocks(Deadlock T-1 RW-3 Ways to avoid deadlock this lecture students Blend of
avoidance) R-2 AV-2 will learn the ways to powerpoint
avoid deadlock presentation with
AV

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 9 Lecture 35 Deadlocks(Recovery from T-1 RW-3 Ways to recover from As a result of this Discussion and
Deadlock) R-2 AV-2 deadlock lecture students will demonstration
come to know about using white board
the methods to
recover from
deadlocks
Lecture 36 Memory Management T-1 AV-1 Logical and physical Students will come to Discussion and
(logical versus physical address space and know about the demonstration
address space) address binding binding of addresses using white board
Memory Management T-1 AV-1 Logical and physical Students will come to Discussion and
(Address Binding) address space and know about the demonstration
address binding binding of addresses using white board
Week 10 Lecture 37 Memory Management T-1 OR-1 Swap in or swap out of Students will come to Blend of
(Dynamic Loading & the process from the know about the powerpoint
Dynamic Linking) memory loading and swapping presentation using
of the processes in AV
and out from the
memory
Memory Management T-1 OR-1 Swap in or swap out of Students will come to Blend of
(Overlays) the process from the know about the powerpoint
memory loading and swapping presentation using
of the processes in AV
and out from the
memory
Memory Management T-1 OR-1 Swap in or swap out of Students will come to Blend of
(Swapping) the process from the know about the powerpoint
memory loading and swapping presentation using
of the processes in AV
and out from the
memory
Lecture 38 Test 2
Lecture 39 Memory Management T-1 OR-1 Contiguous memory Students will come to Discussion and
(Contiguous Allocation) allocation and its know about different demonstration
methods ways of memory using white board
allocation
Lecture 40 Memory Management T-1 OR-1 Memory management Students will come to Discussion and
(Paging) technique using Paging know about the ways demonstration
to effectively manage using white board
the memory
Week 11 Lecture 41 Memory Management T-1 OR-1 Memory management Students will come to Discussion and
(Paging) technique using Paging know about the ways demonstration
to effectively manage using white board
the memory
Lecture 42 Memory Management T-1 OR-1 Memory management Students will come to Discussion and
(Paging) technique using Paging know about the ways demonstration
to effectively manage using white board
the memory

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 11 Lecture 43 Memory Management T-1 AV-1 Memory management Students will come to Blend of
(Segmentation) R-4 technique using know about the ways powerpoint
segmentation to manage memory presentation with
effectively AV
Lecture 44 Memory Management T-1 AV-1 Segmentation concept Students will come to Discussion and
(Segmentation with Paging) R-4 with paging know about demonstration
segmentation with using white board
paging in memory
management
Week 12 Lecture 45 Memory Management(Page T-1 RW-3 L45: Students will come Page replacement Blend of
Replacement Algorithms) R-3 to know about virtual algos will help to powerpoint
R-5 memory, demand paging understand the presentation with
concept and page efficiency of a system AV
replacement algorithms
L46:Page replacement
algorithms
L47 : Students will
come to know about
allocation of frames to a
process
Memory Management T-1 AV-2 L45: Students will come Page replacement Blend of
(Allocation of frames) R-3 to know about virtual algos will help to powerpoint
R-5 memory, demand paging understand the presentation with
concept and page efficiency of a system AV
replacement algorithms
L46:Page replacement
algorithms
L47 : Students will
come to know about
allocation of frames to a
process
Lecture 46 Memory Management(Page T-1 RW-3 L45: Students will come Page replacement Blend of
Replacement Algorithms) R-3 to know about virtual algos will help to powerpoint
R-5 memory, demand paging understand the presentation with
concept and page efficiency of a system AV
replacement algorithms
L46:Page replacement
algorithms
L47 : Students will
come to know about
allocation of frames to a
process

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 12 Lecture 46 Memory Management T-1 AV-2 L45: Students will come Page replacement Blend of
(Allocation of frames) R-3 to know about virtual algos will help to powerpoint
R-5 memory, demand paging understand the presentation with
concept and page efficiency of a system AV
replacement algorithms
L46:Page replacement
algorithms
L47 : Students will
come to know about
allocation of frames to a
process
Lecture 47 Memory Management(Page T-1 RW-3 L45: Students will come Page replacement Blend of
Replacement Algorithms) R-3 to know about virtual algos will help to powerpoint
R-5 memory, demand paging understand the presentation with
concept and page efficiency of a system AV
replacement algorithms
L46:Page replacement
algorithms
L47 : Students will
come to know about
allocation of frames to a
process
Memory Management T-1 AV-2 L45: Students will come Page replacement Blend of
(Allocation of frames) R-3 to know about virtual algos will help to powerpoint
R-5 memory, demand paging understand the presentation with
concept and page efficiency of a system AV
replacement algorithms
L46:Page replacement
algorithms
L47 : Students will
come to know about
allocation of frames to a
process
Lecture 48 Test 3
Week 13 Lecture 49 Memory Management T-1 RW-3 Poor performance due to Students will come to Discussion and
(Thrashing) thrashing and its know about thrashing demonstration
solution in memory using white board
management
Memory Management T-1 RW-3 Poor performance due to Students will come to Discussion and
(Working-set model) thrashing and its know about thrashing demonstration
solution in memory using white board
management
Lecture 50 Protection(Introduction) R-3 RW-1 Basic concept of files Students will come to Blend of
and ways to protect the know about directory powerpoint
files structure and the presentation using
permissions to access AV
the files

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 13 Lecture 50 Protection(File Access R-3 RW-1 Basic concept of files Students will come to Blend of
Methods) and ways to protect the know about directory powerpoint
files structure and the presentation using
permissions to access AV
the files
Lecture 51 Protection(Access Matrix) T-1 AV-2 All the access Students will learn Blend of
permissions required to how to protect files powerpoint
work with a file using proper presentation with
and ways to implement authentication and AV
those measures authorization

Lecture 52 Disk Management(Disk T-1 AV-2 Introduction to disk and Students will learn Blend of
structure) the concept of storing about the disk and its powerpoint
data on the disk various ways of presentation with
formatting AV
(architecture)
Disk Management(disk T-1 AV-2 Introduction to disk and Students will learn Blend of
scheduling) the concept of storing about the disk and its powerpoint
data on the disk various ways of presentation with
formatting AV
(architecture)
Week 14 Lecture 53 Disk Management(FCFS T-1 AV-2 Detail of FCFS disk Student will come to Blend of
scheduling) scheduling algorithm know the various powerpoint
ways of accessing presentation with
data stored on disk AV
with minimal times
Lecture 54 Disk Management(SSTF T-1 AV-2 Detail of FCFS, SCAN Student will come to Blend of
scheduling) and C-SCAN disk know the various powerpoint
scheduling algorithm ways of accessing presentation with
data stored on disk AV
with minimal times
Disk Management(SCAN T-1 AV-2 Detail of FCFS, SCAN Student will come to Blend of
scheduling) and C-SCAN disk know the various powerpoint
scheduling algorithm ways of accessing presentation with
data stored on disk AV
with minimal times
Disk Management(C-SCAN T-1 AV-2 Detail of FCFS, SCAN Student will come to Blend of
scheduling) and C-SCAN disk know the various powerpoint
scheduling algorithm ways of accessing presentation with
data stored on disk AV
with minimal times

SPILL OVER
Week 14 Lecture 55 Spill Over
Lecture 56 Spill Over
Week 15 Lecture 57 Spill Over

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 15 Lecture 58 Spill Over
Lecture 59 Spill Over
Lecture 60 Spill Over

Scheme for CA:

CA Category of this Course Code is:A0203 (2 best out of 3)

Component Weightage (%)


Test 50
Test 50
Test 50

Details of Academic Task(s)

Academic Task Objective Detail of Academic Task Nature of Academic Academic Task Marks Allottment /
Task Mode submission
(group/individuals) Week
Test 1 To evaluate the Unit I Individual Offline 30 5/6
student performance Introduction to operating system : Introduction, Types of operating
systems,
System components, Operating system services, System calls
Process : Process concept, Process states, Operations on processes
Unit II
Process Management : Process control block, Context switching,
Process
scheduling, Interprocess communication, Threads and
Multithreading

Test 2 To evaluate the Unit III Individual Offline 30 9 / 10


student performance CPU Scheduling : Introduction, Types of scheduling, Scheduling
Criteria, Scheduling
Algorithms
Process Syncronization : Background, Critical section problem,
Semaphores,
Concept of serializability
Unit IV
Deadlocks : Deadlock Characterization, Methods for handling
deadlocks, Deadlock
Prevention, Deadlock avoidance, Recovery from Deadlock

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Test 3 To evaluate the Unit V Individual Offline 30 11 / 12
student performance Memory Management : logical versus physical address space,
Address Binding,
Dynamic Loading & Dynamic Linking, Overlays, Swapping,
Contiguous Allocation,
Paging, Segmentation, Segmentation with Paging, Page
Replacement Algorithms,
Allocation of frames, Thrashing, Working-set model
Unit VI
Protection : Introduction, File Access Methods, Access Matrix

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.