7/23/2020

K L Deemed to be University
Department of CSE -- KLVZA
Course Handout
2020-2021, Odd Sem
Course Title :OPERATING SYSTEMS DESIGN - S
Course Code :19CS2106S
L-T-P-S Structure : 3-0-2-2
Pre-requisite :
Credits : 4.5
Course Coordinator :VISHNUVARDHAN MANNAVA
Team of Instructors :
Teaching Associates :
Syllabus :Architecture of the UNIX operating system, OS Design Approaches, Operating system interfaces, Operating system organization, An Overview of the
File Subsystem, buffer cache allocation algorithms: getblk, brelse, bread, breada, bwrite. Log design, Lower Level File System Algorithms: namei, iget, iput, alloc,
free, bmap, ialloc, ifree. File System Calls: open,read,write,close,creat,mknod,chdir,stat,pipe,dup,link,unlink. Processes, Context of a process, Process States and
Transitions, kernel data structures, Under the Hood: The System Call, Paging hardware, Process address space, Physical memory allocation, Systems calls,
exceptions, and interrupts, Assembly trap handlers, saving the context of a process, Disk driver, console, manipulation of the process address space: allocreg,
loadreg, freereg, dupreg, sleep, wakeup. Process System Calls: fork, kill, exit, wait, brk, exec, xalloc. Shell Process scheduling: Scheduling Parameters,
Multiplexing, Controlling Process Priorities, Fair Share Scheduler, Real-Time Processing. System calls for time, clock, Memory management policies: swapping,
Demand Paging, Page faults, TLB, Segmentation, Hybrid approach: paging and segments. Locking, Models of inter-process communication: shared memory and
message passing. Thread API, mutex, Deadlock, concurrent Linked Lists, Binary Semaphores (Locks), Counting Semaphores, The Producer/Consumer (Bounded
Buffer) Problem, Reader-Writer Locks, The Dining Philosophers. The boot loader: Assembly bootstrap, C bootstrap, Introduction to Assembly language
programming for X86.
Text Books : 1. Maurice J. Bach, The Design of The Unix Operating System, 2013 PHI Publishing. 2. Russ Cox, Frans Kaashoek, Robert Morris, xv6: a simple,
Unix-like teaching operating system", Revision https://pdos.csail.mit.edu/6.828/2018/xv6/book-rev11.pdf 3. Frans Kaashoek, Robert Morris, and Russ Cox, The
xv6 source code booklet (draft) (revision 11). https://pdos.csail.mit.edu/6.828/2018/xv6/xv6-rev11.pdf
Reference Books :1. Operating Systems: Three Easy Pieces, Remzi H. Arpaci-Dusseau and Andrea C. Arpaci- Dusseau, ArpaciDusseau Books, Createspace
Independent Publishing Platform (2018). http://pages.cs.wisc.edu/~remzi/OSTEP/ 2. Stallings, W. and Manna, M.M., 2015. Operating systems: internals and
design principles. 2018 9th Edition Pearson. 3. Advanced programming in the UNIX Environment, 2013 Third Edition, W.Richard Stevens, Stephen A. Rago, The
addison-wesley professional computing series. 4. Vahalia, U, UNIX internals: the new frontiers. 2008 Pearson Education India. 5. Tanenbaum, A.S., Modern
operating system. 2009 4th Edition Pearson Education, Inc. 6. Silberschatz, A., Galvin, P.B. and Gagne, G., Operating system concepts essentials. 2018 10th
Edition John 7. Marshall Kirk McKusick, George V. Neville-Neil, Robert N.M. Watson, The Design and Implementation of the FreeBSD Operating System, 2015,
Pearson 8. Andrew S. Tanenbaum, Albert S. Woodhull, Operating Systems: Design and Implementation, 2006, Pearson 9. Richard Blum, Professional Assembly
Language, wrox press, 2006. 10. Sumitabha Das - Your UNIX/Linux The Ultimate Guide, Third Edition-McGraw-Hill Education, 2012.
Web Links :1. https://www.cse.iitb.ac.in/~mythili/os/ 2. http://www.cse.iitm.ac.in/~chester/courses/15o_os/slides/ 3.
https://github.com/nbicocchi/operatingsystemsmsc 4. https://www.cs.columbia.edu/~junfeng/11sp-w4118/lectures/ 5.
http://pages.cs.wisc.edu/~remzi/Classes/537/Spring2018/Discussion/videos.html 6. https://www.ics.uci.edu/~aburtsev/238P/2018fall/index.html 7.
https://pdos.csail.mit.edu/6.828/2011/schedule.html 8. https://www.cs.columbia.edu/~junfeng/13fa-w4118/syllabus.html 9.
https://courses.cs.washington.edu/courses/csep551/17wi/
MOOCS :1. https://cs385.class.uic.edu/lectures/2/
Course Rationale :Examines some general conceptual issues relating to OS implementation strategies and looks at some low-level techniques that are often
helpful for operating system developers, application programmers, and system administrators. Programmers on UNIX systems can gain a deeper understanding of
how their programs interact with the system and thereby code more efficient programs.
Course Objectives :This course provides an in-depth view of the operating system's major kernel subsystems design & implementation. These include virtual
memory system, process lifetime cycles and scheduling and the UNIX file system. The course will describe the differences between the different flavours of
UNIX, such as BSD and SYSTEM V. Understanding design trade-offs, explaining parts of xv6 from a system design perspective. Students assess, customize and
manipulate xv6.

COURSE OUTCOMES (COs):

Blooms
CO Taxonomy
Course Outcome (CO) PO/PSO
NO Level
(BTL)
Understand the internals of UNIX kernel architectures and explore design of File Subsystem, buffer
CO1 PSO1,PO3,PO4 3
cache, and File System Calls.
Understand the internals of system call and explore design of structure of processes, process control,
CO2 PSO1,PO3,PO4 3
process system calls and scheduling in UNIX systems
Understand Traps, interrupts, and drivers. Explore design tradeoffs and Implement parts of memory
CO3 PSO1,PO3,PO4 3
management policies, first address space, page tables and virtual memory in UNIX systems
Analyse theory and implementation of inter-process communication, synchronization, concurrency, and
CO4 PO4,PSO1,PO3 4
Boot loader in UNIX variants.
Implement parts of xv6 and develop Programs/commands using UNIX System Programming. Perform
CO5 PSO1,PO3,PO4,PO5 5
system administration.

COURSE OUTCOME INDICATORS (COIs)::

Outcome Highest
COI-1 COI-2 COI-3 COI-4
No. BTL
Btl-2 Btl-3
Characterize the internals of Construct buffer cache and File
CO1 3 UNIX kernel architectures. System Calls in UNIX systems.
Visualize File Subsystem Data Explore the design of Lower
Structures and algorithms Level File System Algorithms.

1/24
7/23/2020
CO2 3 Btl-2 Btl-3
Understand the internals of systemExplore design of structure of
call. Visualize saving the contextprocesses and process control.
of a process, system calls for time,
Implement process system calls in
clock, console, and init process. UNIX systems Develop shell in
UNIX systems. Customize
scheduling in UNIX systems
Btl-3
Implement the first process and
address space. Perform physical
memory allocation and multiplex
address spaces using page tables
Btl-3
in xv6. Manipulate process
CO3 3 Understand Traps, interrupts, and
address space in UNIX systems
drivers.
Explore design trade-offs and
Implement parts of memory
management policies: swapping,
segmentation, paging, TLB, Page
faults and Advanced Page Tables
Btl-3
Btl-2 Apply Mutex, Semaphores, and Btl-4
Understand various Locking Condition variables to Perform Analyse Models of inter-process
CO4 4
mechanisms, pthreads, and boot concurrent programming Solve communication and Deadlocks for
loader classic synchronization problems UNIX systems
using pthreads.
Btl-4
Implement parts of xv6 and
develop Programs/commands Btl-5
CO5 5
using UNIX System Porting xv6
Programming. Perform system
administration

PROGRAM OUTCOMES & PROGRAM SPECIFIC OUTCOMES (POs/PSOs)

Po No. Program Outcome

Engineering Knowledge :An ability to apply knowledge of mathematics, science, engineering fundamentals and an engineering specialization for the
PO1
solution of complex engineering problems in engineering
Problem Analysis :An ability to identify, formulate, research literature, analyze complex engineering problems in mechanical engineering using first
PO2
principles of mathematics, natural sciences and engineering sciences
Design/ development of solutions :An ability to design solutions for complex engineering problems and system component or processes that meet the
PO3
specified needs considering public health & safety and cultural, societal & environment
Conduct investigations of complex problems :An ability to use research-based knowledge and research methods including design of experiments, analysis
PO4
and interpretation of data and synthesis of the information to obtain solutions to engineering problems
Modern tool usage :Ability to create, select and apply appropriate techniques, resources and modern engineering activities, with an understanding of the
PO5
limitations
The engineer and society :Ability to apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal and cultural issues and
PO6
the consequent responsibilities relevant to the professional engineering practice
Environment and sustainability Ability to demonstrate the knowledge of engineering solutions, contemporary issues understanding their impacts on
PO7
societal and environmental contexts, leading towards sustainable development
PO8 Ethics : An ability to apply ethical principles and commit to professional ethics and responsibilities and norms of engineering practice
PO9 Individual and team work :An ability to function effectively as an individual, and as a member or leader in diverse teams and in multi-disciplinary settings
PO10 Communication :Ability to communicate effectively oral, written reports and graphical forms on complex engineering activities
Project management and finance :Ability to demonstrate knowledge and understanding of the engineering and management principles and apply those
PO11
one’s own work, as a member and leader in team, to manage projects and in multi-disciplinary environments
Lifelong learning An ability to recognize the need for and having the preparation and ability to engage independent and life-long learning in broadest
PO12
context of technological change
PSO1 An ability to design and develop software projects as well as Analyze and test user requirements.
PSO2 An Ability to gain working Knowledge on emerging software tools and technologies.

Lecture Course DELIVERY Plan:

Teaching-Learning
Sess.No. CO COI Topic Book No[CH No][Page No] EvaluationComponents
Methods

COI- End Semester

1 CO1 Architecture of the UNIX operating system T1 CH 2.1 Page No [19 - 22] Chalk,LTC,PPT,Talk
1 Exam,SEM-EXAM1

COI- T6 CH 2.8 Page No [81-91], T2, CH End Semester

2 CO1 OS Design Approaches Chalk,LTC,PPT,Talk
1 2.8,2.9,2.10 Page No [108-118] Exam,SEM-EXAM1

Operating system Interfaces, Operating system

COI- organization: Abstracting physical resources, T2 CH 0 Page No [7 -16], T2 CH 1 Page No End Semester
3 CO1 Chalk,LTC,PPT,Talk
1 User mode, kernel mode, and system calls, [17-20] Exam,SEM-EXAM1
Kernel organization

COI- An Overview of the File Subsystem, Buffer T1 CH 2.2.1 Page No [22 – 24, 44, 46] T3 End Semester
4 CO1 Chalk,LTC,PPT,Talk
1 Cache allocation algorithms: getblk, brelse Sheet No [44] Exam,SEM-EXAM1

2/24
7/23/2020
Teaching-Learning
Sess.No. CO COI Topic Book No[CH No][Page No] EvaluationComponents
Methods

T1 CH 3, [3.3, 3.4] Page No [54,55,56], T2

COI- Buffer Cache allocation algorithms: bread, End Semester
5 CO1 CH 6 Page No [79,80], T3 Sheet No [44,45], Chalk,LTC,PPT,Talk
2 breada, bwrite Log design, Logging Exam,SEM-EXAM1
[47]

COI- Lower Level File System Algorithms: iget, T1 CH 4 Page No [64,66,70,75], T2 CH 6, T3 End Semester
6 CO1 Chalk,LTC,PPT,Talk
2 iput, bmap, namei Sheet No [50,52,53,54,57] Exam,SEM-EXAM1

COI- Lower Level File System Algorithms: ialloc, T1 CH [4], Page No [78,80,86,102], T2 CH End Semester
7 CO1 Chalk,LTC,PPT,Talk
2 ifree, alloc, free 6, T3 Sheet No [50,52,53,54,57] Exam,SEM-EXAM1

COI- End Semester

8 CO1 File System Calls: open, read, write, close T1 CH 5 Page No [93,97,101,103] Chalk,LTC,PPT,Talk
2 Exam,SEM-EXAM1

T1 CH 5 Page No [106,108, 109,110] T2 CH

COI- End Semester
9 CO1 File System Calls: creat, mknod, chdir, stat 6 Page No[75-89] T3 Sheet No Chalk,LTC,PPT,Talk
2 Exam,SEM-EXAM1
[36,64,61,63,65]

T1 CH 5 Page No [112,119,129,133] T2 CH
COI- End Semester
10 CO1 File System Calls: pipe, dup, link, unlink 0, 6 T2 CH 6 Page No13, 70, 75-89 T3 Sheet Chalk,LTC,PPT,Talk
2 Exam,SEM-EXAM1
No 36,67,64,61

Operating system organization: Process

COI- overview, Processes, Context of a process, T2 CH 1 Page No [20-22], T1 CH 2.2.2, 2.3 End Semester
11 CO2 Chalk,LTC,PPT,Talk
1 Process States and Transitions, kernel data Page No [24 - 34] Exam,SEM-EXAM1
structures, sleep and wakeup

R1
COI- End Semester
12 CO2 Under the Hood: The System Call http://pages.cs.wisc.edu/~remzi/OSFEP/intro- Chalk,LTC,PPT,Talk
1 Exam,SEM-EXAM1
syscall.pdf

R1 CH 6.3, Page No [55], T1 CH 6 Page No

COI- End Semester
13 CO2 Saving the context of a process [162,163,165,170,171], T2 CH [3,5], T3 Chalk,LTC,PPT,Talk
1 Exam,SEM-EXAM1
Sheet No[16,34,33,37

COI- T1 CH 6 Page No [185-186], T2 CH 5 [68 – End Semester

14 CO2 Sleep and wakeup Chalk,LTC,PPT,Talk
2 70], T3 Sheet No [28,29,38] Exam,SEM-EXAM1

COI- T1 CH 7 Page No [193,210,212,215], T2 CH End Semester

15 CO2 Process System Calls: fork, kill, exit Chalk,LTC,PPT,Talk
2 1,2,5 T3Sheet No[20,24,25,28,29,37,87] Exam,SEM-EXAM1

T1 CH 7,7.5,7.8 Page No [218,232,235,

COI- End Semester
16 CO2 exec, shell, init process 233,236,237], T2 CH [2,0], T3 Sheet Chalk,LTC,PPT,Talk
2 Exam,SEM-EXAM1
No[18,66,65,85]

COI- Process scheduling: Multiplexing, mycpu and End Semester

17 CO2 T2 CH 5[61 – 65], T3 Sheet No[24,30,28,27] Chalk,LTC,PPT,Talk
2 myproc, Exam,SEM-EXAM1

COI- Process scheduling: Scheduling Parameters, T1 CH 8.1 Page No [247- 255] T3 Sheet No End Semester
18 CO2 Chalk,LTC,PPT,Talk
2 Controlling Process Priorities. [24,30,28,27] Exam,SEM-EXAM1

COI- Process scheduling: Fair Share Scheduler, End Semester

19 CO2 T1 CH 8.1 Page No [255 - 258] Chalk,LTC,PPT,Talk
2 Real-Time Processing, problems Exam,SEM-EXAM1

COI- T1 CH [8.2,8.3] Page No [258-262], T2 CH End Semester

20 CO2 System calls for time, clock, console Chalk,LTC,PPT,Talk
2 [3,1] T3 Sheet No[75,38,4,79] Exam,SEM-EXAM1

Operating system organization: creating and

COI- T1 CH [6.2] Page No [151], T2 CH [2] Page End Semester
21 CO3 running the first process, Page tables: Paging, Chalk,LTC,PPT,Talk
2 No [29-32], T3 Sheet No[7,18,17] Exam,SEM-EXAM2
hardware, Process address space

COI- T2 CH [2] Page No [32-34], T3 Sheet No End Semester

22 CO3 Page tables: Physical memory allocation Chalk,LTC,PPT,Talk
2 [31] Exam,SEM-EXAM2

COI- Systems calls, exceptions and interrupts, T2 CH [3] Page No [39-49], T3Sheet End Semester
23 CO3 Chalk,LTC,PPT,Talk
1 Assembly trap handlers, No[84,33,18,34.37,32] Exam,SEM-EXAM2

R1 CH[36.7, 36.8, 37.5] Page No [426,427,

COI- End Semester
24 CO3 Disk driver and Disk scheduling 442], T2 CH [3] Page No [47 - 48], T3 Sheet Chalk,LTC,PPT,Talk
1 Exam,SEM-EXAM2
No[42,43]

COI- T1 CH [6,7] Page No [173,178,180,182], T2 End Semester

25 CO3 Manipulation of the process address space Chalk,LTC,PPT,Talk
2 CH [2], T3 Sheet No[19,20] Exam,SEM-EXAM2

T1 CH [7] Page No [213,218], T2 CH [2]

COI- Page tables: User part of an address space, End Semester
26 CO3 Page No [34-37],, T3 Sheet Chalk,LTC,PPT,Talk
2 sbrk, exec Exam,SEM-EXAM2
No[38,25,18,66,65]

3/24
7/23/2020
Teaching-Learning
Sess.No. CO COI Topic Book No[CH No][Page No] EvaluationComponents
Methods

R1 CH [14.2, 20.5, 28.13] Page No

COI- Memory management policies: swapping, End Semester
27 CO3 [132,227,328], T1 CH [9] Page No Chalk,LTC,PPT,Talk
2 demand paging Exam,SEM-EXAM2
271,273,281, T3 Sheet No 18,28

COI- Memory management policies: Page faults and R1 CH [22] Page No [243 - 256], T1 CH [9] End Semester
28 CO3 Chalk,LTC,PPT,Talk
2 replacement algorithms. Page No [299,304]. T3 Sheet No [18,28,21] Exam,SEM-EXAM2

COI- End Semester

29 CO3 TLB, Segmentation R1 CH [16.1,19.1] Page No [155,199], Chalk,LTC,PPT,Talk
2 Exam,SEM-EXAM2

COI- Hybrid approach: paging and Segmentation, End Semester

30 CO3 R1 CH [20.2, 20.3] Page No [216, 219], Chalk,LTC,PPT,Talk
2 Multi-level paging Exam,SEM-EXAM2

Locking: spin locks, Compare-And-Swap,

Load-Linked and Store-Conditional, R1 CH [28.7-28.14] Page No [320 -332], T1
COI- End Semester
31 CO4 bcache.lock,cons.lock,ftable.lock,icache.lock CH [5.4] Page No [103],T2 CH[4] Page No Chalk,LTC,PPT,Talk
2 Exam,SEM-EXAM2
idelock,kmem.lock,log.lock,ptable.lock ticks [51-59]
lock,inode’sip->lock.

Locking: Fetch-And-Add, Lock With Queues,

Test-and-set, Yield, Wakeup sleeplock, R1 CH [28.7-28.14] Page No [320 -332], T1
COI- End Semester
32 CO4 spinlock, getcallerpcs, acquire, release, CH [5.4] Page No [103], T2 CH[4] Page No Chalk,LTC,PPT,Talk
2 Exam,SEM-EXAM2
kvmalloc, [51-59]
xchg,acquiresleep,getcallerpcs,holding,initlock

COI- models of inter-process communication: End Semester

33 CO4 T1 CH [11.2.1] Page No [359 - 367]. Chalk,LTC,PPT,Talk
3 message passing – msgsnd, msgrcv Exam,SEM-EXAM2

COI- Models of inter-process communication: End Semester

34 CO4 T1 CH [112.2] Page No[367-370] Chalk,LTC,PPT,Talk
3 shared memory - shmat Exam,SEM-EXAM2

COI- End Semester

35 CO4 Thread API, condition variable R1 CH [27] Page No [303 - 313] Chalk,LTC,PPT,Talk
2 Exam,SEM-EXAM2

COI- End Semester

36 CO4 Mutex, Concurrent Linked Lists R1 CH [28.2,29.2] Page No [316,342] Chalk,LTC,PPT,Talk
2 Exam,SEM-EXAM2

COI- Binary Semaphores (Locks), Counting R1 CH [31.1-31.4] Page No [367] T1 CH End Semester
37 CO4 Chalk,LTC,PPT,Talk
1 Semaphores, algorithm semop [11.2.3] Page No [376] Exam,SEM-EXAM2

The Producer/Consumer (Bounded Buffer)

COI- R1 CH [31.4-31.6] Page No [372], T1 CH End Semester
38 CO4 Problem, Reader-Writer Locks, The Dining Chalk,LTC,PPT,Talk
2 [11.2.3] Page No [376] Exam,SEM-EXAM2
Philosophers

COI- R1 CH [32.3] Page No [389] R6 CH[8] Page End Semester

39 CO4 Deadlocks, banker’s algorithm Chalk,LTC,PPT,Talk
3 No [330 - 343] Exam,SEM-EXAM2

COI- The boot loader: Assembly bootstrap, C T2 Appendix A, B Page No [95 - 103] R9 End Semester
40 CO4 Chalk,LTC,PPT,Talk
2 bootstrap, Introduction to Assembly language CH[4,5] Page No [104, 125 Exam,SEM-EXAM2

Lecture Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Understand the functionalities of Operating system

Session Outcome: 2 Explore the Architecture of UNIX Operating systems.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Introduction to the course 2 Talk
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break/poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
10 Introduction to Architecture of the UNIX operating system 2 PPT
APPLICABLE ---
--- NOT
10 Role, functionalities, and objectives of operating system 2 PPT
APPLICABLE ---

SESSION NUMBER : 2

Session Outcome: 1 Understand Operating Systems Design Approaches

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods

4/24
7/23/2020
5 Attendance/Poll/Pop Question 1 Talk --- NOT
APPLICABLE ---
--- NOT
20 Traditional UNIX systems 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
--- NOT
10 Modern UNIX systems 2 PPT
APPLICABLE ---
--- NOT
10 LINUX Kernel 2 PPT
APPLICABLE ---

SESSION NUMBER : 3

Session Outcome: 1 Understand Operating system Interfaces and organization.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Operating system interfaces 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
--- NOT
10 Operating system organization: Abstracting physical resources 2 PPT
APPLICABLE ---
--- NOT
10 User mode, kernel mode, and system calls, Kernel organization 2 LTC
APPLICABLE ---

SESSION NUMBER : 4

Session Outcome: 1 Understand and Explore the Design of File Subsystem and Buffer Cache Algorithms.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 An Overview of the File Subsystem, File System Layout 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
--- NOT
10 Buffer Cache allocation algorithms: getblk, brelse. 3 PPT
APPLICABLE ---
--- NOT
10 Xv6 functions: bget, brelse. Design and Implementation of bio.c 3 LTC
APPLICABLE ---

SESSION NUMBER : 5

Session Outcome: 1 Understand and explore the Design of Buffer Cache allocation algorithms.

Session Outcome: 2 Apply Log design and Logging.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Buffer Cache allocation algorithms: bread, breada, bwrite 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
--- NOT
10 Log design, Logging 3 PPT
APPLICABLE ---
--- NOT
10 Xv6 functions: bread, bwrite. Design and Implementation of log.c 3 LTC
APPLICABLE ---

SESSION NUMBER : 6

Session Outcome: 1 Understand and Explore the Design of Lower Level File System Algorithms: iget, iput, bmap, namei

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Lower Level File System Algorithms: iget, iput, bmap, namei 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 2 Talk
APPLICABLE ---
Xv6 functions: iget, iput, bmap,namei, dirlookup xv6 functions: create, sys_mknod,
10 3 PPT Case Study
sys_mkdir, sys_chdir, sys_fstat, filestat, stat.h
--- NOT
10 Design and Implementation of creat, mknod, chdir, stat, file.c, sysfile.c 3 LTC
APPLICABLE ---
5/24
7/23/2020
SESSION NUMBER : 7

Session Outcome: 1 Understand and Explore the Design of Lower Level File System Algorithms

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Lower Level File System Algorithms : ialloc, ifree, alloc 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 Xv6 functions: ialloc, itrunc, balloc, bfree 3 PPT Case Study
--- NOT
10 Design and Implementation of algorithms in fs.c 3 LTC
APPLICABLE ---

SESSION NUMBER : 8

Session Outcome: 1 Understand and Explore the Design of File System Calls: Open, read, write, close

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Algorithms for File System Calls: open, read, write, close 3 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 Xv6 functions: sys_open, filealloc, sys_read, fileread, sys_write, filewrite, sys_close, fileclose 3 PPT Case Study
--- NOT
10 Design and Implementation of open, read, write, close, file.c, sysfile.c 3 LTC
APPLICABLE ---

SESSION NUMBER : 9

Session Outcome: 1 Understand and Explore the Design of File System Calls: creat, mknod, chdir, stat

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Algorithms for File System Calls: creat, mknod, chdir, stat 3 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 xv6 functions: create, sys_mknod, sys_mkdir, sys_chdir, sys_fstat, filestat, stat.h 3 PPT Case Study
--- NOT
10 Design and Implementation of creat, mknod, chdir, stat, file.c, sysfile.c 3 LTC
APPLICABLE ---

SESSION NUMBER : 10

Session Outcome: 1 Understand and Explore the Design of File System Calls: Pipe, dup, link, unlink

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Algorithms for File System Calls : Pipe, dup, link, unlink 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 Xv6: sys_pipe, pipealloc, piperead, pipewrite,sys_dup, filedup, sys_link, dirlink, sys_unlink 3 PPT Case Study
--- NOT
10 Design and Implementation of Pipe, dup, link, unlink, sysfile.c, pipe.c 3 LTC
APPLICABLE ---

SESSION NUMBER : 11

Session Outcome: 1 Understand Operating system organization: Process overview

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Processes, Context of a process 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
--- NOT
10 States and Transitions 2 PPT
APPLICABLE ---
10 kernel data structures, sleep and wakeup 2 PPT --- NOT

6/24
7/23/2020
APPLICABLE ---

SESSION NUMBER : 12

Session Outcome: 1 Understand Under the Hood: The System Call

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Under the Hood system call 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 Xv6: usys.s, read(), tvinit, mpmain(), alltraps, traps, syscall() 2 PPT Case Study
--- NOT
10 understand usys.s, main.c, trap.c, mmu.h, vectors.s, trapasm.s, trap.ctraps.h, syscall().c 2 PPT
APPLICABLE ---

SESSION NUMBER : 13

Session Outcome: 1 Understand saving the context of a process

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
Algorithms for inthand, syscall, Context Switch, Copying Data between System and User --- NOT
20 2 PPT
Address space APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 xv6: pushcli, trap, alltraps, popcli, tvinit, syscall, swtch, copyout 2 PPT Case Study
--- NOT
10 understand spinlock.c, trap.c, tapasm.s, spinlock.c, trapasm.s, syscal.c, swtch.s, vm.c 2 PPT
APPLICABLE ---

SESSION NUMBER : 14

Session Outcome: 1 Understand and Explore the Design of sleep and wakeup algorithms

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Sleep, wakeup algorithms 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 Xv6: sleep, sys_sleep, wakeup, wakeup1 3 PPT Case Study
--- NOT
10 Design and Implementation of Sleep, wakeup algorithms in proc.c, sysproc.c 3 LTC
APPLICABLE ---

SESSION NUMBER : 15

Session Outcome: 1 Understand and Explore the Design of Process system calls: fork, kill, exit

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Algorithms for fork, kill, exit 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 2 Talk
APPLICABLE ---
10 Xv6: allocproc, copyuvm, fork, fork1, forkret, sys_fork, kill, sys_kill, exit, sys_exit 2 PPT Case Study
--- NOT
10 Design and Implementation of fork, kill, exit in proc.c, syscall.c 2 LTC
APPLICABLE ---

SESSION NUMBER : 16

Session Outcome: 1 Understand init process and Explore the Design of Exec and shell,

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Algorithms for exec, shell, init process 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 Xv6 functions: Exec, shell, start, init setupkvm, exec, sys_exec, sh.c, init.c 2 PPT Case Study

7/24
7/23/2020
10 Design and Implementation of vm.c,exec.c, sysfile.c, sh.c, init.c 3 LTC --- NOT
APPLICABLE ---
--- NOT
10 Conclusion & Summary 3 Talk
APPLICABLE ---

SESSION NUMBER : 17

Session Outcome: 1 Understand and Explore the Design of process scheduling: Multiplexing, mycpu and myproc.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Process scheduling: Multiplexing, mycpu and myproc. 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 xv6 functions: mycpu, myproc, 3 PPT Case Study
--- NOT
10 Design and Implementation of proc.c, swtch.s 3 LTC
APPLICABLE ---

SESSION NUMBER : 18

Session Outcome: 1 Understand and Explore the Design of process scheduling: schedule_process, Scheduling Parameters, Controlling Process Priorities.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
Process scheduling: schedule_process algorithm, Scheduling Parameters, Controlling Process --- NOT
20 2 PPT
Priorities APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 xv6 functions: mycpu, myproc, swtch, yield, scheduler, sched 3 PPT Case Study
--- NOT
10 Working of cswtch.s, proc.c, problems 3 LTC
APPLICABLE ---

SESSION NUMBER : 19

Session Outcome: 1 Understand and explore the design of process scheduling: Fair Share Scheduler, Real-Time Processing

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Fair Share Scheduler, Real-Time Processing 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 Xv6: mycpu, myproc, swtch, yield, scheduler, sched 3 PPT Case Study
--- NOT
10 Working of proc.c, swtch.s, problems 3 LTC
APPLICABLE ---

SESSION NUMBER : 20

Session Outcome: 1 Understand system calls for time, clock, and console

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Understand console. Algorithms for stime, time, times, and alarm, clock 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 Xv6: cmostime, sys_uptime, timerinit, cprintf 2 PPT Case Study
--- NOT
10 explanation of lapic.c, sysproc.c, defs.h,timer.c, console.c 2 PPT
APPLICABLE ---

SESSION NUMBER : 21

Session Outcome: 1 Understand and Explore the Design of Operating system organization and page tables

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
Operating system organization: creating and running the first process, Page tables: Paging --- NOT
20 2 PPT
hardware, Process address space APPLICABLE ---
5 Ask for any doubts through Public chat/ Break 1 Talk --- NOT
8/24
7/23/2020
APPLICABLE ---
10 Xv6: mmu.h, kvmalloc, setupkvm, kmap, mappages, walkpgdir 3 PPT Case Study
--- NOT
10 Implementation of mmu.h, vm.c 3 LTC
APPLICABLE ---

SESSION NUMBER : 22

Session Outcome: 1 Understand and Explore the Design of Page tables: Physical memory allocation

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Page tables: Physical memory allocation 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 Xv6: kinit1, kinit2, kfree 3 PPT Case Study
--- NOT
10 Implementation of kalloc.c, kalloc.c, kalloc.c 3 LTC
APPLICABLE ---

SESSION NUMBER : 23

Session Outcome: 1 Understand Systems calls, exceptions, and interrupts, Assembly trap handlers,

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Systems calls, exceptions, and interrupts, Assembly trap handlers 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 Xv6: initcode.s, tvinit, switchuvm, alltraps trap, trapret, syscall, switchuvm vectors.pl 2 PPT Case Study
explanation of initcode.s, trapasm.s, vm.c, trapasm.s, trap.c, trapasm.s, syscal.c, vm.c, --- NOT
10 2 PPT
vectors.pl APPLICABLE ---

SESSION NUMBER : 24

Session Outcome: 1 Understand and Explore the Design of Disk driver and scheduling

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Disk driver and Disk scheduling. 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 Xv6: ideinit, idewait, iderw, idestart, ideintr, ioapicenable 2 PPT Case Study
--- NOT
10 Explanation of ide.c, problems on Disk space 2 PPT
APPLICABLE ---

SESSION NUMBER : 25

Session Outcome: 1 Understand and Explore the Design of the process address space manipulation

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
Algorithms for manipulation of the process address space: allocreg, loadreg, freereg, dupreg, --- NOT
20 2 PPT
xalloc APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 Xv6: allocuvm, loaduvm, deallocuvm, copyuvm 3 PPT Case Study
--- NOT
10 Implementation of vm.c 3 LTC
APPLICABLE ---

SESSION NUMBER : 26

Session Outcome: 1 Understand and Explore the Design of Page tables: User part of an address space, sbrk, exec

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Page tables: User part of an address space, Algorithms for sbrk, exec 2 PPT
APPLICABLE ---

9/24
7/23/2020
5 Ask for any doubts through Public chat/ Break 1 Talk --- NOT
APPLICABLE ---
10 Xv6: brk, exec sys_sbrk, growproc, setupkvm, exec, sys_exec 3 PPT Case Study
--- NOT
10 Implementation of sysproc.c, proc.c, vm.c, exec.c, sysfile.c 3 LTC
APPLICABLE ---

SESSION NUMBER : 27

Session Outcome: 1 Understand and Explore the Design of memory management policies: swapping and Demand Paging

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Memory management policies: swapping, Demand Paging 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 Algorithms for malloc, swapper. Xv6: kvmalloc, malloc, yield, copyout 3 PPT Case Study
--- NOT
10 Implementation of vm.c, proc.c 3 LTC
APPLICABLE ---

SESSION NUMBER : 28

Session Outcome: 1 Understand and Explore the Design of Page faults and replacement algorithms

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Page faults and replacement algorithms 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 Algorithms for vfault, pfault, Xv6: kvmalloc, malloc, yield, copyout 3 PPT Case Study
--- NOT
10 Implementation of vm.c, proc.c 3 LTC
APPLICABLE ---

SESSION NUMBER : 29

Session Outcome: 1 Understand and Explore the Design of TLB and Segmentation

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Algorithms for TLB 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
--- NOT
10 Algorithms for Segmentation 2 PPT
APPLICABLE ---
--- NOT
10 Design of TLB, problems 3 PPT
APPLICABLE ---

SESSION NUMBER : 30

Session Outcome: 1 Understand and Explore the Design of Hybrid approach and Multi-level paging.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Hybrid approach: paging and segments Segmentation algorithm 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
--- NOT
10 Algorithms for Multi-level paging 2 PPT
APPLICABLE ---
--- NOT
10 X86 Multi-level paging, problems, Paging and Address translation in X86 2 PPT
APPLICABLE ---

SESSION NUMBER : 31

Session Outcome: 1 Understand xv6 Locking: spin locks, Compare-And-Swap, Load-Linked and Store-Conditional, bcache.lock,cons.lock,ftable.lock,icache.lock,
idelock,kmem.lock,log.lock

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
5 Attendance/Poll/Pop Question 1 Talk --- NOT

10/24
7/23/2020
APPLICABLE ---
Locking algorithms: atomic exchange (xchg), spin locks, Compare-And-Swap, Load-Linked --- NOT
20 2 PPT
and Store-Conditional APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
Xv6 Locking: bcache.lock,cons.lock,ftable.lock,icache.lock
10 2 PPT Case Study
Idelock,kmem.lock,log.lock,ptable
--- NOT
10 Explanation of lockticks lock,inode’sip->lock. 2 PPT
APPLICABLE ---

SESSION NUMBER : 32

Session Outcome: 1 Understand xv6 Locking: Fetch-And-Add, Lock With Queues, Test-and-set, Yield, Wakeup,
sleeplock,spinlock,getcallerpcs,acquire,release,kvmalloc, xchg,acquiresleep,getcallerpcs,holding,initlock

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Questions 1 Talk
APPLICABLE ---
--- NOT
20 Locking algorithms: Fetch-And-Add, Lock with Queues, Test-and-set, Yield, Wakeup 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 Xv6 Locking: sleeplock,spinlock,getcallerpcs,acquire,release,kvmalloc 2 PPT Case Study
--- NOT
10 Explanation of xchg,acquiresleep,getcallerpcs,holding,initlock 2 PPT
APPLICABLE ---

SESSION NUMBER : 33

Session Outcome: 1 Understand and Explore the Design Models of inter-process communication: message passing – Message Queues.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Models of INTERPROCESS COMMUNICATION: shared memory and message passing 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
--- NOT
10 Message queues: Algorithm msgsnd 4 PPT
APPLICABLE ---
--- NOT
10 System V Message queues: Implementation of msgrcv 4 LTC
APPLICABLE ---

SESSION NUMBER : 34

Session Outcome: 1 Understand and Explore the Design of inter-process communication: shared memory

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop 1 Talk
APPLICABLE ---
--- NOT
20 Models of INTERPROCESS COMMUNICATION: shared memory and message passing 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
--- NOT
10 Algorithm shmat 3 PPT
APPLICABLE ---
--- NOT
10 Shared Memory: Implementation of shmat 4 LTC
APPLICABLE ---

SESSION NUMBER : 35

Session Outcome: 1 Understand and Explore the Design Thread API

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop 1 Talk
APPLICABLE ---
--- NOT
20 Thread API, critical section 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
--- NOT
10 pthread_self, pthread join and exit 3 PPT
APPLICABLE ---
--- NOT
10 Condition variable 4 PPT
APPLICABLE ---

SESSION NUMBER : 36

11/24
7/23/2020
Session Outcome: 1 Understand and Explore the Design mutex, concurrent Linked Lists

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop 1 Talk
APPLICABLE ---
--- NOT
20 mutex 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
--- NOT
10 concurrent Linked Lists 4 PPT
APPLICABLE ---
--- NOT
10 Solve increment problem. 4 PPT
APPLICABLE ---

SESSION NUMBER : 37

Session Outcome: 1 Understand and Explore the Design Binary Semaphores (Locks), Counting Semaphores

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop 1 Talk
APPLICABLE ---
--- NOT
20 Binary Semaphores (Locks) 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
--- NOT
10 Counting Semaphores, semop algorithm 4 PPT
APPLICABLE ---
--- NOT
10 Parent waiting for a child 4 PPT
APPLICABLE ---

SESSION NUMBER : 38

Session Outcome: 1 Understand and Explore the Design The Producer/Consumer (Bounded Buffer) Problem, Reader-Writer Locks, The Dining Philosophers

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop 1 Talk
APPLICABLE ---
--- NOT
20 The Producer/Consumer (Bounded Buffer) 4 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
--- NOT
10 The Dining Philosophers 3 PPT
APPLICABLE ---
--- NOT
10 Problem, Reader-Writer Locks , semop 3 PPT
APPLICABLE ---

SESSION NUMBER : 39

Session Outcome: 1 Understand and Explore the Design Deadlocks, banker’s algorithm

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop 1 Talk
APPLICABLE ---
--- NOT
20 Deadlocks 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
--- NOT
10 Banker’s algorithm 4 PPT
APPLICABLE ---
--- NOT
10 Deadlocks in The Producer/Consumer 4 PPT
APPLICABLE ---

SESSION NUMBER : 40

Session Outcome: 1 Understand The boot loader: Assembly bootstrap, C bootstrap and Assembly language.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Poll/Pop 1 Talk
APPLICABLE ---
--- NOT
20 The boot loader: Assembly bootstrap, C bootstrap, 2 PPT
APPLICABLE ---
--- NOT
5 Ask for any doubts through Public chat/ Break 1 Talk
APPLICABLE ---
10 Introduction to Assembly language, bootasm.S, bootmain.c 2 PPT --- NOT
APPLICABLE ---
12/24
7/23/2020

--- NOT
10 kernel.ld 2 PPT
APPLICABLE ---

Tutorial Course DELIVERY Plan: NO Delivery Plan Exists

Tutorial Session wise Teaching – Learning Plan

No Session Plans Exists

Practical Course DELIVERY Plan:

Tutorial
Session Topics CO-Mapping
no

Pre Lab: 1. cat.c: which forms the essence of cat) copies data from its standard input to its standard output. If an error
occurs, it writes a message to the standard error. 2. fork.c: A Simple Child Creation Program Post Lab: 1.C library
1 CO5
functions for file handling. Standard I/O library that will copy data from one file to another file. 2.io.c: A Program That
Does I/O

Pre lab: 1. ccp.c: Copying a File. Show a pictorial arrangement of File Descriptor, File and Inode tables for a single
2 process that has two different files open. 2. Write a system program which will opens files in the parent and uses dup2 in CO5
the child to reassign the descriptors

Pre Lab: 1. execl and execv, Gathering the exit Status using wait with standard input and output redirection. 2. Show a
3 pictorial arrangement - Sharing of open files between parent and child after fork. Post Lab: 1.orphan.c, zombie.c: create CO5
orphan and processes 2.Program that creates a new Process to Copy Files

Pre Lab: 1.pipe.c: Runs two programs in a pipeline Child runs cat, parent runs tr 2. A half-baked directory using mknod.
4 Post Lab: 1.mylink.c -- create the filename "another.txt" and link it to the other file. Later delete it using unlink. CO5
2.Unlinking an opened file

In lab: 1.attributes.c -- Uses lstat call and struct stat to display file attributes. 2. lsdir.c -- Lists only directories - Uses
5 S_IFMT and S_ISDIR macros Post Lab: mychown.c -- change the group of the file. mychmod.c -- changed the CO5
permission flags of the file.

In Lab: 1.signal.c -- Waits for 5 seconds for user input and then . 2.Generates SIGALRM that has a handler
specifiedkillproce ss.c -- Uses fork and exec to run a user-defined programand kills it if it doesn’t complete in 5 seconds
6 CO5
Post Lab: 1. mynice.c: A child process inherits its priority value from its parent, and change it by using nice () 2.
program to demonstrate time and times System Call

In Lab:1.Write a program to display the address space of various segments (stack, heap, data...etc) and show that
memory address a programmer see is virtual not real. 2. Develop a program to illustrate the effect of free() on the
7 program break. This program allocates multiple blocks of memory and then frees some or all of them, depending on its CO5
(optional) command-line arguments. Post Lab: 1. Write a simple memory allocator: memalloc is a simple memory
allocator. Which uses your own malloc(), calloc(), realloc() and free() implemented using system calls.

In Lab: 1.Write a program to demonstrate Accessing Memory with Paging - linear translates. 2. Write a program that
translates logical to physical addresses for a virtual address space of size 2^16 = 65,536 bytes. Your program will read
8 CO5
from a file containing logical addresses and, using a TLB as well as a page table Post Lab: 1. Write a program to
demonstrate Accessing Memory with segmentation - linear translates

In Lab: 1. Write a program for the simulation of following paging algorithms FIFO LRU and MRU NFU Post Lab: 1.
9 CO5
Program to demonstrate Multi-level Page Table Control Flow

In Lab: 1. System V shared memory 2. Write a program to create 5 pthreads and display Hello world. Main thread
10 should wait until all new threads are terminated. Use Simpler Argument Passing to a Thread. Post Lab: System V CO5
message queues

In Lab: 1. Illustrate how mutex is used for thread synchronization, print the counter variable upon each increment which
is in the critical section. (Two threads update a global shared variable with and without synchronization) 2. Write a
11 CO5
UNIX system program to implement concurrent Linked List Post Lab: 1.Write a Unix System program to make A Parent
Waiting for Its Child using semaphores

In Lab: Solve producer consumer problem using mutex, binary and counting semaphores, and condition variables Post
12 CO5
Lab: 1.Solve readers writer’s problem using mutex and semaphores

Practical Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 implement : 1. cat.c 2. fork.c

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 attendence/poll 1 Talk
APPLICABLE ---
Experiment explanation: 1. cat.c: which forms the essence of cat) copies data from its
--- NOT
10 standard input to its standard output. If an error occurs, it writes a message to the standard 2 Talk
APPLICABLE ---
error. 2. fork.c: A Simple Child Creation Program
5 Split sections 1 Talk --- NOT

13/24
7/23/2020
APPLICABLE ---
--- NOT
40 Experiment Using Tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 3 Talk
APPLICABLE ---
--- NOT
30 Documenting Results Summary and Result Explanation, Submitting as Assignment in LMS 3 Talk
APPLICABLE ---

SESSION NUMBER : 2

Session Outcome: 1 implement: 1. ccp.c 2. Write a system program which will opens files in the parent and uses dup2 in the child to reassign the descriptors

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence /poll 1 Talk
APPLICABLE ---
Experiment explanation : 1. ccp.c: Copying a File. Show a pictorial arrangement of File
Descriptor, File and Inode tables for a single process that has two different files open. 2. Write --- NOT
10 2 Talk
a system program which will opens files in the parent and uses dup2 in the child to reassign APPLICABLE ---
the descriptors.
--- NOT
5 Split sections 1 Talk
APPLICABLE ---
--- NOT
40 Experiment Using Tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 3 Talk
APPLICABLE ---
--- NOT
30 Documenting Results Summary and Result Explanation, Submitting as Assignment in LMS 3 Talk
APPLICABLE ---

SESSION NUMBER : 3

Session Outcome: 1 Implement : 1. execl and execv 2. Show a pictorial arrangement - Sharing of open files between parent and child after fork.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence /poll 1 Talk
APPLICABLE ---
Experiment explanation : 1. execl and execv, Gathering the exit Status using wait with
--- NOT
10 standard input and output redirection. 2. Show a pictorial arrangement - Sharing of open files 2 Talk
APPLICABLE ---
between parent and child after fork.
--- NOT
5 Split sections 1 Talk
APPLICABLE ---
--- NOT
40 Experiment Using Tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 2 Talk
APPLICABLE ---
--- NOT
30 Documenting Results Summary and Result Explanation,Submitting as Assignment in LMS 2 Talk
APPLICABLE ---

SESSION NUMBER : 4

Session Outcome: 1 Implement : 1. pipe.c 2. A half-baked directory using mknod.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence /poll 1 Talk
APPLICABLE ---
Experiment explanation : 1.pipe.c: Runs two programs in a pipeline Child runs cat, parent --- NOT
10 2 Talk
runs tr 2. A half-baked directory using mknod. APPLICABLE ---
--- NOT
5 Split sections 1 Talk
APPLICABLE ---
--- NOT
40 Experiment Using Tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 2 Talk
APPLICABLE ---
--- NOT
30 Documenting Results Summary and Result Explanation, Submitting as Assignment in LMS 2 Talk
APPLICABLE ---

SESSION NUMBER : 5

Session Outcome: 1 Implement : 1.attributes.c -- Uses lstat call and struct stat to display file attributes. 2. lsdir.c -- Lists only directories - Uses S_IFMT and
S_ISDIR macros

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence /poll 1 Talk
APPLICABLE ---
Experiment explanation : 1.attributes.c -- Uses lstat call and struct stat to display file --- NOT
10 2 Talk
attributes. 2. lsdir.c -- Lists only directories - Uses S_IFMT and S_ISDIR macros APPLICABLE ---
5 Split sections 1 Talk --- NOT
14/24
7/23/2020
APPLICABLE ---
--- NOT
40 Experiment Using Tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 2 Talk
APPLICABLE ---
--- NOT
30 Documenting Results Summary and Result Explanation/ Submitting as Assignment in LMS 2 Talk
APPLICABLE ---

SESSION NUMBER : 6

Session Outcome: 1 Implement : 1. signal.c 2. Generates SIGALRM that has a handler specified kill proce ss.c -- Uses fork and exec to run a user-defined program
and kills it if it doesn’t complete in 5 seconds

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence /poll 1 Talk
APPLICABLE ---
Experiment explanation : 1.signal.c -- Waits for 5 seconds for user input and then .
--- NOT
10 2.Generates SIGALRM that has a handler specifiedkillproce ss.c -- Uses fork and exec to run 2 Talk
APPLICABLE ---
a user-defined programand kills it if it doesn’t complete in 5 seconds
--- NOT
5 Split sections 1 Talk
APPLICABLE ---
--- NOT
40 Experiment Using Tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 1 Talk
APPLICABLE ---
--- NOT
20 Documenting Results Summary and Result Explanation 2 Talk
APPLICABLE ---

SESSION NUMBER : 7

Session Outcome: 1 Implement : 1. display the address space of various segments (stack, heap, data...etc) and show that memory address a programmer see is
virtual, not real.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence /poll 1 Talk
APPLICABLE ---
Experiment explanation : 1. Write a program to display the address space of various segments
(stack, heap, data...etc) and show that memory address a programmer see is virtual not real. 2.
--- NOT
10 Develop a program to illustrate the effect of free() on the program break. This program 2 Talk
APPLICABLE ---
allocates multiple blocks of memory and then frees some or all of them, depending on its
(optional) command-line arguments.
--- NOT
5 Split sections 1 Talk
APPLICABLE ---
--- NOT
40 Experiment Using Tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 2 Talk
APPLICABLE ---
--- NOT
30 Documenting Results Summary and Result Explanation, Submitting as Assignment in LMS 2 Talk
APPLICABLE ---

SESSION NUMBER : 8

Session Outcome: 1 Implement : a program to demonstrate Accessing Memory with Paging - linear translates.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence /poll 1 Talk
APPLICABLE ---
Experiment explanation : 1.Write a program to demonstrate Accessing Memory with Paging -
linear translates. 2. Write a program that translates logical to physical addresses for a virtual --- NOT
10 2 Talk
address space of size 2^16 = 65,536 bytes. Your program will read from a file containing APPLICABLE ---
logical addresses and, using a TLB as well as a page table
--- NOT
5 Split sections 1 Talk
APPLICABLE ---
--- NOT
40 Experiment Using Tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 1 Talk
APPLICABLE ---
--- NOT
30 Documenting Results Summary and Result Explanation, Submitting as Assignment in LMS 2 Talk
APPLICABLE ---

SESSION NUMBER : 9

Session Outcome: 1 Implement : 1. program for the simulation of following paging algorithms FIFO LRU and MRU NFU

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
5 Attendence /poll 1 Talk --- NOT

15/24
7/23/2020
APPLICABLE ---
Experiment explanation : 1. Write a program for the simulation of following paging --- NOT
10 2 Talk
algorithms FIFO LRU and MRU NFU APPLICABLE ---
--- NOT
5 Split sections 1 Talk
APPLICABLE ---
--- NOT
40 Experiment Using Tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 1 Talk
APPLICABLE ---
--- NOT
30 Documenting Results Summary and Result Explanation,Submitting as Assignment in LMS 2 Talk
APPLICABLE ---

SESSION NUMBER : 10

Session Outcome: 1 Implement : a program to create 5 pthreads and display Hello world. Main thread should wait until all new threads are terminated. Use Simpler
Argument Passing to a Thread.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence /poll 1 Talk
APPLICABLE ---
Experiment explanation : 1. System V shared memory 2. Write a program to create 5 pthreads
--- NOT
10 and display Hello world. Main thread should wait until all new threads are terminated. Use 2 Talk
APPLICABLE ---
Simpler Argument Passing to a Thread.
--- NOT
5 Split sections 2 Talk
APPLICABLE ---
--- NOT
40 Experiment Using Tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 2 Talk
APPLICABLE ---
--- NOT
30 Documenting Results Summary and Result Explanation,Submitting as Assignment in LMS 2 Talk
APPLICABLE ---

SESSION NUMBER : 11

Session Outcome: 1 Implement : a UNIX system program to implement concurrent Linked List

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence /poll 1 Talk
APPLICABLE ---
Experiment explanation : 1. Illustrate how mutex is used for thread synchronization, print the
counter variable upon each increment which is in the critical section. (Two threads update a --- NOT
10 1 Talk
global shared variable with and without synchronization) 2. Write a UNIX system program to APPLICABLE ---
implement concurrent Linked List
--- NOT
5 Split sections 1 Talk
APPLICABLE ---
--- NOT
40 Experiment Using Tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 1 Talk
APPLICABLE ---
--- NOT
30 Documenting Results Summary and Result Explanation, Submitting as Assignment in LMS 2 Talk
APPLICABLE ---

SESSION NUMBER : 12

Session Outcome: 1 Implement producer-consumer problem using a mutex, binary and counting semaphores, and condition variables

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence /poll 1 Talk
APPLICABLE ---
Experiment explanation : Solve producer-consumer problem using mutex, binary and --- NOT
10 2 Talk
counting semaphores, and condition variables APPLICABLE ---
--- NOT
5 Split sections 1 Talk
APPLICABLE ---
--- NOT
40 Experiment Using Tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 2 Talk
APPLICABLE ---
--- NOT
30 Documenting Results Summary and Result Explanation,Submitting as Assignment in LMS 2 Talk
APPLICABLE ---

Skilling Course DELIVERY Plan:

Skilling
session Topics/Experiments CO-Mapping
no

16/24
7/23/2020
Skilling
session Topics/Experiments CO-Mapping
no

Bridge COurse:Linux Command Line: What Is the Shell, Navigation, Exploring the System, Compiling Programs Xv6
1 design & implementation: cat.c syscall.c syscall.h sysproc.c user.h usys.S xv6 Customisation: 1. XV6 Installation 2. CO1
adda-new- system-call-in- xv6

Linux Command Line: Manipulating Files and Directories. Xv6 design & implementation: echo.c xv6 customization: cp,
2 CO1
wc.c

Linux Command Line: Searching for Files, Archiving and Backup Xv6 design & implementation: ls.c xv6
3 CO1
customization: ls, date, head

Bridge course: Linux Command Line: Seeing the World as The Shell Sees It, Advanced Keyboard Tricks, Permissions
4 Xv6 design & implementation: kill.c, grep.c xv6 customization: 1. Triply-Indirect- Block filesystem in xv6. 2. xv6 CO2
filesystem visualizer

Linux Command Line: Working with Commands, Redirection Xv6 design & implementation: exec.c xv6 customization:
5 CO2
pwd, cd, mv

Linux Command Line: Seeing the World as The Shell Sees It, Advanced Keyboard Tricks, Permissions Xv6 design &
6 CO2
implementation: ln.c rm.c, mkdir.c xv6 customization: rm, getpinfo

Bridge Course: Linux Command Line: Formatting Output, Printing Xv6 design & implementation: vm.c xv6
7 CO3
customization: shell

Linux Command Line: Text Processing, awk Xv6 design & implementation: vm.c, umalloc.c xv6 customization: Priority
8 CO3
scheduler in xv6, chpr

9 Linux Command Line: Processes Xv6 design & implementation: vm.c xv6 customization: ps, back trace CO3

Linux Command Line: The Environment, A Gentle Introduction To vi, Customizing the Prompt Xv6 design &
10 CO4
implementation: vm.c xv6 shared memory

Bridge Course: Linux Command Line: Package Management, Storage Media, Networking xv6: A Sample Assembly
11 CO4
Language Program xv6 customization: xv6 Assembly code

Linux Command Line: Writing Shell Scripts Assembly programming: 1. Using Inline Assembly 2. Using Li Porting xv6
12 CO4
with POSIX compliance + VFS + ulibc + ACPI

Skilling Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Exploring the System, Compiling Programs and Execution of Programs

Session Outcome: 2 Understand Xv6 design & implementation: cat.c syscall.c syscall.h sysproc.c user.h usys.S 1. XV6 Installation 2. add a-new- system-call-in-
xv6

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance 1 Talk
APPLICABLE ---
Experiment explanation : 1. Xv6 design & implementation: cat.c syscall.c syscall.h sysproc.c --- NOT
10 1 Talk
user.h usys.S 2. XV6 Installation 3. add-a-new- system-call-in- xv6 APPLICABLE ---
--- NOT
5 Split sections/Poll/Pop 1 Talk
APPLICABLE ---
--- NOT
40 Experimentation using tool/remote lab/hardware setup 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 3 Talk
APPLICABLE ---
--- NOT
30 Documenting Results Summary and result Explaination, Submitting as Assignment in LMS 3 Talk
APPLICABLE ---

SESSION NUMBER : 2

Session Outcome: 1 Understand Xv6 design & implementation: echo.c

Session Outcome: 2 xv6 customization: cp, wc.c

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 attendence 1 Talk
APPLICABLE ---
Experiment explanation : 1. Xv6 design & implementation: echo.c 2. xv6 customization: cp, --- NOT
10 2 Talk
wc.c APPLICABLE ---
--- NOT
5 split sections/poll 1 Talk
APPLICABLE ---

17/24
7/23/2020
40 experiment using tool 3 LTC --- NOT
APPLICABLE ---
--- NOT
10 Assessment and Interaction 2 Talk
APPLICABLE ---
--- NOT
30 Documenting Results,submitting in LMS as assignment 2 Talk
APPLICABLE ---

SESSION NUMBER : 3

Session Outcome: 1 Understand Xv6 design & implementation: exec.c

Session Outcome: 2 xv6 customization: pwd, cd, mv

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence 1 Talk
APPLICABLE ---
Experiment Explanation: 1.Xv6 design & implementation: exec.c 2. xv6 customization: pwd, --- NOT
10 2 Talk
cd, mv APPLICABLE ---
--- NOT
5 Split sections 1 Talk
APPLICABLE ---
--- NOT
40 experiment using tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 2 Talk
APPLICABLE ---
--- NOT
30 Documenting Results, submitting in LMS as assignment 1 Talk
APPLICABLE ---

SESSION NUMBER : 4

Session Outcome: 1 Understand Xv6 design & implementation: ln.c rm.c, mkdir.c

Session Outcome: 2 xv6 customization: rm, getpinfo

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence 1 Talk
APPLICABLE ---
Experiment explanation : 1. Xv6 design & implementation: ln.c rm.c, mkdir.c 2. xv6 --- NOT
10 2 Talk
customization: rm, getpinfo APPLICABLE ---
--- NOT
5 Split sections/poll 1 Talk
APPLICABLE ---
--- NOT
40 Experiment Using Tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 1 Talk
APPLICABLE ---
--- NOT
30 Documenting Results Summary and Result Explanation,Submitting as Assignment in LMS 2 Talk
APPLICABLE ---

SESSION NUMBER : 5

Session Outcome: 1 Understand the Xv6 design & implementation: ls.c

Session Outcome: 2 xv6 customization: ls, date, head

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence 1 Talk
APPLICABLE ---
Experiment Explanation: 1.Xv6 design & implementation: ls.c 2. xv6 customization: ls, date, --- NOT
10 2 Talk
head APPLICABLE ---
--- NOT
5 Split sections/poll 1 Talk
APPLICABLE ---
--- NOT
40 experiment using tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 2 Talk
APPLICABLE ---
--- NOT
30 Documenting Results, submitting in LMS as assignment 2 Talk
APPLICABLE ---

SESSION NUMBER : 6

Session Outcome: 1 Understand Xv6 design & implementation: kill.c, grep.c

Session Outcome: 2 Triply-Indirect- Block filesystem in xv6, xv6 filesystem visualizer

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence 1 Talk
APPLICABLE ---
10 Experiment explanation : 1.Xv6 design & implementation: kill.c, grep.c 2. Triply-Indirect- 2 Talk --- NOT
18/24
7/23/2020
Block filesystem in xv6. 3. xv6 filesystem visualizer. APPLICABLE ---
--- NOT
5 Split sections/poll 1 Talk
APPLICABLE ---
--- NOT
40 Experiment Using Tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 1 Talk
APPLICABLE ---
--- NOT
30 Documenting Results Summary and Result Explanation, Submitting as Assignment in LMS 2 Talk
APPLICABLE ---

SESSION NUMBER : 7

Session Outcome: 1 Understand Xv6 design & implementation: vm.c, umalloc.c

Session Outcome: 2 xv6 customization: Priority scheduler in xv6, chpr

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence 1 Talk
APPLICABLE ---
Experiment explanation : 1.Xv6 design & implementation: vm.c, umalloc.c 2.xv6 --- NOT
10 2 Talk
customization: Priority scheduler in xv6, chpr APPLICABLE ---
--- NOT
5 Split sections/poll 1 Talk
APPLICABLE ---
--- NOT
40 Experiment Using Tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 2 Talk
APPLICABLE ---
--- NOT
30 Documenting Results Summary and Result Explanation, Submitting as Assignment in LMS 2 Talk
APPLICABLE ---

SESSION NUMBER : 8

Session Outcome: 1 Understand Xv6 design & implementation: vm.c

Session Outcome: 2 xv6 customization: shell

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence 1 Talk
APPLICABLE ---
--- NOT
10 Experiment Explanation : 1. Xv6 design & implementation: vm.c 2. xv6 customization: shell 2 Talk
APPLICABLE ---
--- NOT
5 Split sections/poll 1 Talk
APPLICABLE ---
--- NOT
40 experiment using tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 2 Talk
APPLICABLE ---
--- NOT
30 Documenting Results, submitting in LMS as assignment 2 Talk
APPLICABLE ---

SESSION NUMBER : 9

Session Outcome: 1 Understand Xv6 design & implementation: vm.c

Session Outcome: 2 xv6 customization: ps, back trace

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence 1 Talk
APPLICABLE ---
--- NOT
10 Experiment explanation 2 Talk
APPLICABLE ---
--- NOT
5 split sections/poll 1 Talk
APPLICABLE ---
--- NOT
40 Experiment using tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and interaction 2 Talk
APPLICABLE ---
--- NOT
30 Documenting results,Submitting as assignment in LMS 2 Talk
APPLICABLE ---

SESSION NUMBER : 10

Session Outcome: 1 Understand Xv6 design & implementation: vm.c

Session Outcome: 2 customization of xv6 shared memory

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
19/24
7/23/2020
--- NOT
5 Attendence 1 Talk
APPLICABLE ---
--- NOT
10 Experiment Explanation: 1. Xv6 design & implementation: vm.c 2.xv6 shared memory 2 Talk
APPLICABLE ---
--- NOT
5 Split sections/poll 2 Talk
APPLICABLE ---
--- NOT
40 experiment using tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 2 Talk
APPLICABLE ---
--- NOT
30 Documenting Results, submitting in LMS as assignment 2 Talk
APPLICABLE ---

SESSION NUMBER : 11

Session Outcome: 1 Understand A Sample Assembly Language Program

Session Outcome: 2 xv6 Assembly code

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence 1 Talk
APPLICABLE ---
--- NOT
10 Experiment explanation : 1.A Sample Assembly Language Program 2.xv6 Assembly code 2 Talk
APPLICABLE ---
--- NOT
5 Split sections/poll 1 Talk
APPLICABLE ---
--- NOT
40 Experiment Using Tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 2 Talk
APPLICABLE ---
--- NOT
30 Documenting Results Summary and Result Explanation, Submitting as Assignment in LMS 2 Talk
APPLICABLE ---

SESSION NUMBER : 12

Session Outcome: 1 Understand Assembly programming

Session Outcome: 2 Porting xv6 with POSIX compliance + VFS + ulibc + ACPI

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendence 1 Talk
APPLICABLE ---
--- NOT
10 Experiment Explanation 2 Talk
APPLICABLE ---
--- NOT
5 Split sections 1 Talk
APPLICABLE ---
--- NOT
40 experiment using tool 3 LTC
APPLICABLE ---
--- NOT
10 Assessment and Interaction 2 Talk
APPLICABLE ---
--- NOT
30 Documenting Results, submitting in LMS as assignment 2 Talk
APPLICABLE ---

WEEKLY HOMEWORK ASSIGNMENTS/ PROBLEM SETS/OPEN ENDEDED PROBLEM-SOLVING EXERCISES etc:

Assignment
Week Assignment Type Topic Details co
No

COURSE TIME TABLE:

Hour 1 2 3 4 5 6 7 8 9
Day Component
Mon V-S13,V-S14,V- V-S13,V-S14,V-
- - S15,V-S16,V-S17,V- S15,V-S16,V-S17,V- - -
Theory - - -- -- S18,V-S19,V-S20,V- S18,V-S19,V-S20,V- - - ---
- - S21,V-S22,V-S23,V- S21,V-S22,V-S23,V- - -
S24,V-S25 S24,V-S25
- - - -
Tutorial - - -- -- -- -- - - ---
- - - -
Lab - - V-S13,V-S13,V-S14,V- V-S13,V-S13,V-S14,V- -- -- - - ---
- - S14,V-S15,V-S15,V-S16,V- S14,V-S15,V-S15,V-S16,V- - -
- - S16,V-S17,V-S17,V-S18,V- S16,V-S17,V-S17,V-S18,V- - -
S18,V-S19,V-S19,V-S20,V- S18,V-S19,V-S19,V-S20,V-
S20,V-S21,V-S21,V-S22,V- S20,V-S21,V-S21,V-S22,V-

20/24
7/23/2020
S22,V-S23,V-S23,V-S24,V- S22,V-S23,V-S23,V-S24,V-
S24,V-S25,V-S25 S24,V-S25,V-S25
- - - -
Skilling - - -- -- -- -- - - ---
- - - -
- - V-S1,V-S2,V-S3,V-S4,V- V-S1,V-S2,V-S3,V-S4,V- - -
Theory - - S5,V-S6,V-S7,V-S8,V-S9,V- S5,V-S6,V-S7,V-S8,V-S9,V- -- -- - - ---
- - S10,V-S11,V-S12 S10,V-S11,V-S12 - -
- - - -
Tutorial - - -- -- -- -- - - ---
- - - -
V-S1,V-S1,V-S2,V- V-S1,V-S1,V-S2,V-
Tue S2,V-S3,V-S3,V-S4,V- S2,V-S3,V-S3,V-S4,V-
- - S4,V-S5,V-S5,V-S6,V- S4,V-S5,V-S5,V-S6,V- - -
Lab - - -- -- S6,V-S7,V-S7,V-S8,V- S6,V-S7,V-S7,V-S8,V- - - ---
- - S8,V-S9,V-S9,V- S8,V-S9,V-S9,V- - -
S10,V-S10,V-S11,V- S10,V-S10,V-S11,V-
S11,V-S12,V-S12 S11,V-S12,V-S12
- - - -
Skilling - - -- -- -- -- - - ---
- - - -
V-S13,V-S14,V-S15,V-
- - - -
S16,V-S17,V-S18,V-
Theory - - --- --- --- --- - -
S19,V-S20,V-S21,V-
- - - -
S22,V-S23,V-S24,V-S25
- - - -
Tutorial - - --- --- --- --- - - --
Wed - - - -
- - - -
Lab - - --- --- --- --- - - --
- - - -
- - - -
Skilling - - --- --- --- --- - - --
- - - -
- - - -
Theory - - --- --- --- --- - - ---
- - - -
- - - -
Tutorial - - --- --- --- --- - - ---
- - - -
Thu
- - - -
Lab - - --- --- --- --- - - ---
- - - -
- - - -
Skilling - - --- --- --- --- - - ---
- - - -
- - - -
Theory - - --- --- --- --- - - --
- - - -
- - - -
Tutorial - - --- --- --- --- - - --
- - - -
- - - -
Lab - - --- --- --- --- - - --
Fri - - - -
V-S13,V-S13,V-S14,V-
S14,V-S15,V-S15,V-
S16,V-S16,V-S17,V-
- - - - S17,V-S18,V-S18,V-
Skilling - - --- --- --- --- - - S19,V-S19,V-S20,V-
- - - - S20,V-S21,V-S21,V-
S22,V-S22,V-S23,V-
S23,V-S24,V-S24,V-
S25,V-S25
- - - -
Theory -- -- -- -- --
- - - -
- - - -
Tutorial -- -- -- -- --
- - - -
Sat
- - - -
Lab -- -- -- -- --
- - - -
- - - -
Skilling -- -- -- -- --
- - - -
Sun - - - -
Theory -- -- -- -- --
- - - -
- - - -
Tutorial -- -- -- -- --
- - - -
- - - -
Lab -- -- -- -- --
- - - -
Skilling - - -- -- -- -- - - --

21/24
7/23/2020
- - - -

REMEDIAL CLASSES:

Supplement course handout, which may perhaps include special lectures and discussions that would be planned, and schedule notified according

SELF-LEARNING:

Assignments to promote self-learning, survey of contents from multiple sources.

S.no Topics CO ALM References/MOOCS

DELIVERY DETAILS OF CONTENT BEYOND SYLLABUS:

Content beyond syllabus covered (if any) should be delivered to all students that would be planned, and schedule notified accordingly.
S.no Advanced Topics, Additional Reading, Research papers and any CO ALM References/MOOCS

EVALUATION PLAN:

Evaluation Type Evaluation Component Weightage/Marks Assessment Dates Duration (Hours) CO1 CO2 CO3 CO4 CO5
Weightage 9 9
Lab End Semester Exam 120
End Semester Max Marks 50 50
Summative Weightage 4.5 1.125 1.125 1.125 1.125
Exam – Exercise 120
Evaluation Max Marks 50 12.5 12.5 12.5 12.5
Total= 40 % Weightage 26.5 6.625 6.625 6.625 6.625
End Semester Exam 180
Max Marks 100 25 25 25 25
Weightage 2 0.5 0.5 0.5 0.5
Questions &Answers 100
Max Marks 100 25 25 25 25
Weightage 8 8
Continuous Evaluation - Lab Exercise 100
In Semester Max Marks 100 100
Formative Weightage 6 1.5 1.5 1.5 1.5
ALM 50
Evaluation Max Marks 100 25 25 25 25
Total= 25 % Weightage 5 1 1 1 1 1
Attendance 50
Max Marks 5 1 1 1 1 1
Weightage 4 1 1 1 1
Home Assignment and Textbook 60
Max Marks 40 10 10 10 10
Weightage 11.65 5.825 5.825
Semester in Exam-I 120
Max Marks 50 25 25
In Semester Weightage 11.65 5.825 5.825
Semester in Exam-II 120
Summative Max Marks 50 25 25
Evaluation Weightage 7.7 7.7
Total= 35 % Lab In Semester Exam 100
Max Marks 50 50
Weightage 4 1 1 1 1
Exercise 100
Max Marks 50 12.5 12.5 12.5 12.5

ATTENDANCE POLICY:

Every student is expected to be responsible for regularity of his/her attendance in class rooms and laboratories, to appear in scheduled tests and examinations and
fulfill all other tasks assigned to him/her in every course
In every course, student has to maintain a minimum of 85% attendance to be eligible for appearing in Semester end examination of the course, for cases of medical
issues and other unavoidable circumstances the students will be condoned if their attendance is between 75% to 85% in every course, subjected to submission of
medical certificates, medical case file and other needful documental proof to the concerned departments

DETENTION POLICY :

In any course, a student has to maintain a minimum of 85% attendance and In-Semester Examinations to be eligible for appearing to the Semester End Examination,
failing to fulfill these conditions will deem such student to have been detained in that course.

PLAGIARISM POLICY :

Supplement course handout, which may perhaps include special lectures and discussions

COURSE TEAM MEMBERS, CHAMBER CONSULTATION HOURS AND CHAMBER VENUE DETAILS:

Supplement course handout, which may perhaps include special lectures and discussions
Delivery Chamber Chamber
Sections of Chamber Consultation Signature of
Name of Faculty Component of Consultation Day Consultation Room
Faculty Timings for each day Course faculty:
Faculty (s) No:
7-MA,22-
SHAHANA BANO L - - - -
MA
SHAHANA BANO P 7-A,22-A - - - -
SHAHANA BANO S 7-A,22-A - - - -

22/24
7/23/2020
VISHNUVARDHAN L 1-MA,16- - - - -
MANNAVA MA
VISHNUVARDHAN
P 1-A,16-A - - - -
MANNAVA
VISHNUVARDHAN
S 1-A,16-A - - - -
MANNAVA
2-MA,17-
VIJAYA BABU BURRA L - - - -
MA
VIJAYA BABU BURRA P 2-A,17-A - - - -
VIJAYA BABU BURRA S 2-A,17-A - - - -
SAI KIRAN 3-MA,18-
L - - - -
PASUPULETI MA
SAI KIRAN
P 3-A,18-A - - - -
PASUPULETI
SAI KIRAN
S 3-A,18-A - - - -
PASUPULETI
THIRUPATHI RAO 4-MA,19-
L - - - -
KOMATI MA
THIRUPATHI RAO
P 4-A,19-A - - - -
KOMATI
THIRUPATHI RAO
S 4-A,19-A - - - -
KOMATI
TIRAPATHI REDDY 5-MA,20-
L - - - -
BURRAMUKKU MA
TIRAPATHI REDDY
P 5-A,20-A - - - -
BURRAMUKKU
6-MA,21-
Pradeepini Gera L - - - -
MA
Pradeepini Gera P 6-A,21-A - - - -
Pradeepini Gera S 6-A,21-A - - - -
8-MA,23-
swetha Kolachana L - - - -
MA
swetha Kolachana P 8-A,23-A - - - -
swetha Kolachana S 8-A,23-A - - - -
Naresh Vurukonda P 3-B,18-B - - - -
Naresh Vurukonda S 8-B,19-B - - - -
Talluri Lakshmi Siva
P 25-B - - - -
Rama Krishna
Talluri Lakshmi Siva
S 3-B,15-B - - - -
Rama Krishna
VENKATA
P 4-B - - - -
MANDHALA
VENKATA
S 9-B,20-B - - - -
MANDHALA
LAKSHMANA
L 9-MA - - - -
MAGULURI
LAKSHMANA
P 9-A,14-B - - - -
MAGULURI
LAKSHMANA
S 9-A,21-B - - - -
MAGULURI
CHANDOL MOHAN
L 10-MA - - - -
KUMAR
CHANDOL MOHAN
P 10-A,19-B - - - -
KUMAR
CHANDOL MOHAN
S 10-A,23-B - - - -
KUMAR
SAI PRASANTHI 11-MA,24-
L - - - -
MAGANTY MA
SAI PRASANTHI
P 11-A,24-A - - - -
MAGANTY
SAI PRASANTHI
S 11-A,24-A - - - -
MAGANTY
Yellamma Pachipala P 1-B,16-B - - - -
Yellamma Pachipala S 4-B,16-B - - - -
sadhana BURLA L 14-MA - - - -
sadhana BURLA P 11-B,14-A - - - -
sadhana BURLA S 5-A,14-A - - - -
GUNASEKHAR T P 24-B - - - -
GUNASEKHAR T S 5-B,17-B - - - -
ASDAQUE HUSSAIN
L 13-MA - - - -
MOHAMMED
ASDAQUE HUSSAIN
P 13-A - - - -
MOHAMMED
ASDAQUE HUSSAIN S 6-B,13-A - - - -

23/24
7/23/2020
MOHAMMED
BHAVANI VASANTHA P 6-B,21-B - - - -
BHAVANI VASANTHA S 11-B,24-B - - - -
MOUNIKA
P 10-B,13-B - - - -
VALASAPALLI
MOUNIKA
S 10-B,22-B - - - -
VALASAPALLI
JHANSI RANI 12-MA,25-
L - - - -
PARITALA MA
JHANSI RANI
P 12-A,25-A - - - -
PARITALA
JHANSI RANI
S 12-A,25-A - - - -
PARITALA
ARPITA ROY P 7-B,22-B - - - -
ARPITA ROY S 25-B - - - -
RAVI TEJA
L 15-MA - - - -
KANAKALA
RAVI TEJA
P 9-B,15-A - - - -
KANAKALA
RAVI TEJA
S 15-A - - - -
KANAKALA
M Mekala P 8-B,23-B - - - -
M Mekala S 20-A - - - -
Gottumukkala varma S 1-B,13-B - - - -
HITESHWAR AZAD P 2-B,17-B - - - -
HITESHWAR AZAD S 7-B,18-B - - - -
Debnath Bhattacharyya P 5-B,20-B - - - -
Debnath Bhattacharyya S 2-B,14-B - - - -
Sindhura Surapaneni P 12-B,15-B - - - -
Sindhura Surapaneni S 12-B - - - -

GENERAL INSTRUCTIONS

Students should come prepared for classes and carry the text book(s) or material(s) as prescribed by the Course Faculty to the class.

NOTICES

Most of the notices are available on the LMS platform.

All notices will be communicated through the institution email.

All notices concerning the course will be displayed on the respective Notice Boards.

Signature of COURSE COORDINATOR

(VISHNUVARDHAN MANNAVA)

Signature of Department Prof. Incharge Academics & Vetting Team Member

Department Of CSE

HEAD OF DEPARTMENT:

Approval from: DEAN-ACADEMICS

(Sign with Office Seal) [object HTMLDivElement]

24/24