Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
138 views9 pages

Os Lesson Plan

This document outlines the lesson plan for the course "Operating Systems" taught to second year computer science students. It details 15 topics to be covered in Unit I, including an overview of operating systems, architecture, structure, and evolution. It also lists topics such as process management, memory management, file systems, deadlocks, and protection to be covered in subsequent units, along with the required classes for each topic and teaching aids.

Uploaded by

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

Os Lesson Plan

This document outlines the lesson plan for the course "Operating Systems" taught to second year computer science students. It details 15 topics to be covered in Unit I, including an overview of operating systems, architecture, structure, and evolution. It also lists topics such as process management, memory management, file systems, deadlocks, and protection to be covered in subsequent units, along with the required classes for each topic and teaching aids.

Uploaded by

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

GURU NANK INSTITUTE OF TECHNOLOGY

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING


LESSON PLAN
PROGRAM: B.TECH (CSE) DEGREE: UG YEAR & SEM: II YEAR & II-SEM A.Y: 2019-20
COURSE: OPERATING SYSTEMS(CS403PC) FACULTY NAME: M.SADHASIVAM
Required Cumulative Date of
S.NO Toppic to be Covered Classes Classes Completion Text Book Teaching Aid

UNIT - I
1 Operating Systems Over view 1 1 TB1 Chalk & Talk
2 Overview of Computer operating Systems 1 2 TB1 Chalk & Talk
3 Operating System Architecture 1 3 TB1 Chalk & Talk
4 Operating System Structure 1 4 TB1 Chalk & Talk
5 Operating System Operations 1 5 TB1 Chalk & Talk
6 Evolution of Operating System 1 6 TB1 Chalk & Talk
7 Simple Operating System, Batch OS 1 7 TB1 Chalk & Talk
8 Multi Programmed OS 1 8 TB1 Chalk & Talk
9 Time Shared, Special Operating System, 1 9 TB1 Chalk & Talk
10 Operating System Services 1 10 TB1 Chalk & Talk
11 System calls 1 11 TB1 Chalk & Talk
12 Types of System calls 1 12 TB1 Chalk & Talk
13 System Programs 1 13 TB1 Chalk & Talk
14 OS design 1 14 TB1 Chalk & Talk
15 Virtual Machines 1 15 TB1 Chalk & Talk
16 TUTORIAL: OS OVERVIEW 1 16 TB1 DISCUSSIONS

17 TOPIC BEYOND SYLLABUS: Real Time Operating System Design 1 17 PPT


Issues

18 TOPIC BEYOND SYLLABUS: Distributed Systems Design Issues 1 18 PPT

19 SPECIAL DESCRIPTIVE TEST -1 1 19 TEST DATE:

UNIT - II
20 Process management 1 20 TB1 Chalk & Talk
21 Process concepts, Process Control Block 1 21 TB1 Chalk & Talk
22 1 22 TB1 Chalk & Talk
23 Threads 1 23 TB1 Chalk & Talk
24 Process Scheduling-Scheduling queues 1 24 TB1 Chalk & Talk
25 Schedulers 1 25 TB1 Chalk & Talk
26 Context Switch 1 26 TB1 Chalk & Talk
27 Preemptive Scheduling 1 27 TB1 Chalk & Talk
28 Dispatcher 1 28 TB1 Chalk & Talk
29 Scheduling- Criteria 1 29 TB1 Chalk & Talk
30 TUTORIAL: Scheduling 1 30 TB1 DISCUSSIONS
31 algorithms 1 31 TB1 Chalk & Talk
Required Cumulative Date of
S.NO Toppic to be Covered Classes Classes Completion Text Book Teaching Aid

32 Multiple Processor Scheduling 1 32 TB1 Chalk & Talk


33 Real Time Scheduling 1 33 TB1 Chalk & Talk
34 Thread Scheduling 1 34 TB1 Chalk & Talk
35 Examples 1 35 TB1 Chalk & Talk
36 SPECIAL DESCRIPTIVE TEST -2 1 36 TEST DATE:
UNIT - III
37 Memory Management 1 37 TB1 Chalk & Talk
38 Logical & Physical Address Space 1 38 TB1 Chalk & Talk
39 Swapping 1 39 TB1 Chalk & Talk
40 contiguous memory allocation 1 40 TB1 Chalk & Talk
41 paging, structure of page table 1 41 TB1 Chalk & Talk
42 Segmentation, Virtual Memory 1 42 TB1 Chalk & Talk
43 demand paging 1 43 TB1 Chalk & Talk
44 Page replacement Algorithm 1 44 TB1 Chalk & Talk
45 Allocation of frames 1 45 TB1 Chalk & Talk
46 Thrashing 1 46 TB1 Chalk & Talk
47 TUTORIAL: CASE STUDIES 1 47 TB1 DISCUSSIONS

48 GAPS IN THE SYLLABUS:Multi processor systems 1 48 GUEST LECTURE /


WEB RESOURSE

UNIT - IV
49 The concept of a file, access methods 1 49 TB1 Chalk & Talk
50 directory structure 1 50 TB1 Chalk & Talk
51 file system mounting 1 51 TB1 Chalk & Talk
52 File sharing, protection. 1 52 TB1 Chalk & Talk
53 file system Structure, File System Implementation 2 53 TB1 Chalk & Talk
54 Allocation methods 1 54 TB1 Chalk & Talk
55 free space management 1 55 TB1 Chalk & Talk
56 Mass storage Structure, Disk Structure 1 56 TB1 Chalk & Talk
57 disk scheduling, swap space management 1 57 TB1 Chalk & Talk
58 Swap Space management 1 58 TB1 Chalk & Talk
59 TUTORIAL: FILE ALOCATION 1 59 TB1 DISCUSSIONS
UNIT - V
60 Principles of deadlocks 1 60 TB2 Chalk & Talk
61 system model 1 61 TB2 Chalk & Talk
62 deadlock characterization 1 62 TB2 Chalk & Talk
63 deadlock prevention 1 63 TB2 Chalk & Talk
64 detection and avoidance 1 64 TB2 Chalk & Talk
65 recovery from deadlocks 1 65 TB2 Chalk & Talk
66 Protection: Protection, Goals of protection 1 66 TB2 Chalk & Talk
67 Principles of protection, domain of protection Access Matrix 1 67 TB2 Chalk & Talk
68 Implementation of access Matrix, Access control 1 68 TB2 Chalk & Talk
69 Revocation of Access rights, Capability- Based systems, 1 69 TB2 Chalk & Talk
Language Based Protection
70 TUTORIAL: DEAD LOCK 2 71 TB2 DISCUSSIONS
Required Cumulative Date of
S.NO Toppic to be Covered Classes Classes Completion Text Book Teaching Aid

71 GAPS IN THE SYLLABUS:Topics regarding inter-process DISCUSSIONS


communication, message passing
72 GAPS IN THE SYLLABUS:Servlet 1 72 WEB RESOURSE
73 Remedial class: 1 73 TB1 &2 Chalk & Talk
74 Remedial class: 1 74 TB1 &2 Chalk & Talk
75 Remedial class: 1 75 TB1 &2 Chalk & Talk
76 Remedial class: 1 76 TB1 &2 Chalk & Talk

FACULTY SIGNATURE
GURU NANK INSTITUTE OF TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
LESSON PLAN
PROGRAM: B.TECH (CSE) DEGREE: UG YEAR & SEM: II YEAR & II-SEM
COURSE: Discrete Mathematics(CS401PC) FACULTY NAME: MOHAMMED MISKEEN ALI
Required Cumulative Date of
S.NO Toppic to be Covered Classes Classes Completion
UNIT - I
1 The Foundations: Logic and Proofs 1 1
2 Propositional Logic 1 2
3 Applications of Propositional LOGIC 1 3
4 Propositional Equivalence, 1 4
5 Predicates and Quantifiers, 1 5
6 Predicates and Quantifiers, 1 6
7 Rules of Inference 1 7
8 Problems with Rules of Inference 1 8
9 Rules of Inference 1 9
10 Introduction to Proofs 1 10
11 Proof Methods and Strategy 1 11
12 TUTORIAL: DM OVERVIEW 1 16
13 SPECIAL DESCRIPTIVE TEST -1 1 19 TEST DATE:

UNIT - II
14 Basic Structures 1 20
15 Sets, Functions 1 21
16 Sequences, Sums, 1 22
17 Threads 1 23
18 Matrices and Relations Sets 1 24
19 Functions 1 25
20 Sequences & Summations, 1 26
21 Cardinality of Sets 1 27
22 Matrices Relations, 1 28
23 Relations and Their Properties 1 29
24 n-ary Relations 1 30
25 n-ary Applications 1 31
26 Representing Relations 1 32
27 Closures of Relations 1 33
28 Equivalence Relations 1 34
29 Partial Orderings. 1 35
30 SPECIAL DESCRIPTIVE TEST -2 1 36 TEST DATE:
UNIT - III
31 Algorithms, Induction and Recursion 1 37
32 Algorithms, 1 38
33 The Growth of Functions 1 39
34 Complexity of algorithms 1 40
35 Induction and Recursion 1 41
36 Mathematical Induction 1 42
37 Strong Induction 1 43
38 Well-Ordering 1 44
39 Recursive Definitions 1 45
40 Structural Induction 1 46
41 Recursive Algorithms
42 Program Correctness

UNIT - IV

43 Discrete Probability and Advanced Counting Techniques: An 1 49


Introduction to Discrete Probability,
44 An Introduction to Discrete Probability 1 50
45 Probability Theory 1 51
46 Bayes’ Theorem 1 52
47 Expected Value and Variance 2 53
48 Advanced Counting Techniques 1 54
49 Recurrence Relations, 1 55
50 Solving Linear Recurrence Relations 1 56
51 Divide-and-Conquer Algorithms 1 57
52 Generating Functions 1 58
53 Inclusion-Exclusion,
54 Applications of Inclusion-Exclusion
UNIT - V
55 Graphs and Graph Models 1 60
56 Graph Terminology 1 61
57 Special Types of Graphs 1 62
58 Representing 1 63
59 Graphs and Graph Isomorphism 1 64
60 Connectivity, 1 65
61 Euler and Hamilton Paths 1 66
62 Shortest-Path Problems 1 67
63 Planar Graphs, Graph Coloring. 1 68
64 Introduction to Trees 1 69
65 Applications of Trees
66 Tree Traversal, Spanning Trees,
67 Minimum Spanning Trees 2 71
68 Remedial class: 1 73
69 Remedial class: 1 74
70 Remedial class: 1 75
71 Remedial class: 1 76
OGY
NEERING

A.Y: 2019-20
AMMED MISKEEN ALI
Text Book Teaching Aid

TB1 Chalk & Talk


TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 DISCUSSIONS
TEST DATE:

TB1 Chalk & Talk


TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 DISCUSSIONS
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TEST DATE:

TB1 Chalk & Talk


TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
Chalk & Talk
Chalk & Talk

TB1 Chalk & Talk

TB1 Chalk & Talk


TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk
TB1 Chalk & Talk

TB2 Chalk & Talk


TB2 Chalk & Talk
TB2 Chalk & Talk
TB2 Chalk & Talk
TB2 Chalk & Talk
TB2 Chalk & Talk
TB2 Chalk & Talk
TB2 Chalk & Talk
TB2 Chalk & Talk
TB2 Chalk & Talk

TB2 DISCUSSIONS
TB1 &2 Chalk & Talk
TB1 &2 Chalk & Talk
TB1 &2 Chalk & Talk
TB1 &2 Chalk & Talk

FACULTY SIGNATURE

You might also like