Course Document

Course Code UC24CSC31

Course Title Discrete Mathematics
Program Code SCS02
Program Title B.Sc – Computer Science
Department School of Computer Science
Faculty Code C
Faculty Title Faculty of Computing and IT
Department offering the Faculty of Computing and IT
Course
Faculty Member Prof. Rajashekhar G C
Semester Duration Weeks (1-16) -Teaching, Learning and Continuous
Assessment
Weeks (17-18) -SEE
Weeks (19-20)- Announcement of Results

1. Course Size

Credits L T P Hours/Week
3 3 0 0 4

Total Term/ Semester hours: 30

2. Course Details

2.1 Course Aims and Summary

 Foundational Understanding: Provide students with a comprehensive

understanding of discrete mathematics, emphasizing logical reasoning, and the
ability to construct and analyze mathematical proofs.
 Structural Competence: Develop students' competence in fundamental
mathematical structures, including sets, functions, sequences, and matrices, with
an emphasis on their applications in problem-solving.
 Combinatorial Proficiency: Equip students with strong combinatorial skills,
covering basics of counting, the Pigeonhole Principle, and permutation and
combination, fostering the ability to handle diverse counting problems.
 Inductive and Recursive Thinking: Foster inductive and recursive thinking
through the study of mathematical induction, strong induction, and recursion,
emphasizing their application in algorithm development and program corrections.
 Relation Mastery: Provide a thorough understanding of relations, including their
properties, compositions, closures, and representations, with a focus on
equivalence relations and partitions.
  Graph Theory Proficiency: Develop proficiency in graph theory, covering graph
models, special graph types, connectivity, Euler and Hamilton paths, and practical
problem-solving through graph algorithms and coloring.

2.2Course Objectives

The objectives of the Course are:

1. To Understand the principles of Propositional Logic and its applications.
2. To differentiate between various Propositional Equivalences.
3. Apply Rules of Inference to derive logical conclusions.
4. Analyze and construct proofs using Predicates and Quantifiers.
5. Develop strategies for effective proof methods.
6. Grasp the fundamental concepts of sets, functions, sequences, sums, and matrices.
7. Apply set operations and matrix operations to solve mathematical problems.
8. Analyze the role of functions and sequences in mathematical structures.
9. Develop solutions for problems using a combination of basic structures.
10. Understand the principles of Mathematical Induction and Strong.
11. Differentiate between recursive and structural induction.
12. Analyze program corrections using mathematical induction.
13. Understand the properties and operations of relations.
14. Differentiate between equivalence relations and partitions.
15. Apply operations on relations and represent relations.
16. Understand the fundamentals of graphs and graph models.
17. Differentiate between various types of graphs and their terminology.
18. Apply graph algorithms to solve problems related to connectivity.
19. Analyze Euler and Hamilton paths and shortest-path problems.
20. Develop solutions for planar graphs and graph coloring.

2.3Course Outcomes
After undergoing this course students will be able to:
CO1 Understand and apply propositional logic and its applications.
CO2 Demonstrate knowledge of basic structures such as sets, functions,
sequences, and matrices.
CO3 Develop proficiency in counting techniques and apply them to solve
counting problems.
CO4 Understand and apply mathematical induction and recursion in problem-
solving.
CO5 Analyze and apply properties of relations, including composition and
equivalence relations.
CO6 Understand and analyze graphs and their properties, including
connectivity, paths, coloring, and planarity.
 Outcome Map:
COs PO PO PO PO PO PO PO PO PS PS PSO
01 02 03 04 05 06 07 08 O1 O2 3

CO1 1 2 1 3 2 3 3 2 2 3 1
CO2 1 1 1 2 2 3 3 2 1 3 2

CO3 2 3 2 3 1 3 3 1 3 2 1
CO4 2 1 3 3 3 3 2 2 3 3 2

CO5 3 2 2 3 1 3 3 1 3 3 1

CO6 3 3 3 3 3 1 2 1 3 3 2

Relevance: 1 high, 2 medium, 3 low

2.4Course Content
Module – 1
The Foundation: Logic and Proofs: Propositional Logic, Applications of
Propositional Logic, Propositional Equivalences, Predicates and Quantifiers, Nested
Quantifiers, Rules of Inference, Introduction to Proofs, Proof Methods and Strategy.

Module – 2
Basic Structures: Sets, Set Operations, Functions, Sequences, Sums and Matrices.
Counting: Basics of Counting, Pigeonhole Principle, Permutation and Combination,
Binomial Coefficient and Combination, Generating Permutation and Combination.

Module – 3
Induction and Recursion: Mathematical Induction, Strong Induction and Well –
Ordering, Recursive Definitions and Structural Induction, Recursive Algorithms,
Program Corrections.
Relation: Properties of Relation, Composition of Relation, Closer Operation on
Relation, Equivalence Relation and Partition. Operation on Relation, Representing
Relation.

Module – 4
Graphs: Graphs and Graph Models, Graph Terminology and Special Types of
Graphs, Representing Graphs and Graph Isomorphism, Connectivity, Euler and
Hamilton Paths, Shortest-Path Problems, Planar Graphs, Graph Coloring.

2.5 Course Resources:

• Text Book:
• Kenneth H. Rosen, Seventh Edition, 2012, Discrete Mathematics and Its
Applications.
 • References:
• Bernard Kolman, Robert C, Busby, Sharon Ross, 2003, Discrete Mathematical
Structure.
• Ralph P Grimaldi, B. V. Ramatta, Pearson Education, 5 th Edition, Discrete and
Combinatorial Mathematics.
• Trembly and Manohar, Discrete Mathematical Structures.

• Other Resources
• https://www.youtube.com/watch?v=9AUCdsmBGmA&list=PL0862D1A9472
52D20&index=10
• https://www.youtube.com/watch?v=oU60TuGHxe0&list=PL0862D1A947252
D20&index=11
• https://www.youtube.com/watch?v=_BIKq9Xo_5A&list=PL0862D1A947252
D20&index=13
• https://www.youtube.com/watch?v=RMLR2JHHeWo&list=PL0862D1A9472
52D20&index=14
• https://www.youtube.com/watch?v=nf9e0_ylGdc&list=PL0862D1A947252D2
0&index=15
• https://www.youtube.com/watch?v=7cTWea9YAJE&list=PL0862D1A947252
D20&index=24
• https://www.youtube.com/watch?v=695iAm935cY&list=PL0862D1A947252
D20&index=25
• https://www.youtube.com/watch?v=ZECJHfsf4Vs&list=PL0862D1A947252D
20&index=26
• https://www.youtube.com/watch?v=Dsi7x-
A89Mw&list=PL0862D1A947252D20&index=28
• https://www.youtube.com/watch?v=xlUFkMKSB3Y&list=PL0862D1A94725
2D20
• https://www.youtube.com/watch?v=0uTE24o3q-
o&list=PL0862D1A947252D20&index=2
• https://www.youtube.com/watch?v=DmCltf8ypks&list=PL0862D1A947252D
20&index=3
• https://www.youtube.com/watch?v=jNeISigUCo0&list=PL0862D1A947252D
20&index=4
• http://nptel.ac.in/courses.php?disciplineID=111

3. Teaching and Assessment

3.1 Teaching Plan

Lecture Lecture Topic Lecture Slides Lecture Videos
Number
0 Introduction Class Lecture-00 Video-00
1 Introduction to Discrete Lecture-01 Video-01
Mathematics
2 Propositional Logic Lecture-02 Video-02
3 Propositional Logic basics Lecture-03 Video-03
4 Applications of Propositional Lecture-04 Video-04
Logic
5 Propositional Equivalences Lecture-05 Video-05
6 Predicates and Quantifiers Lecture-06 Video-06
7 Nested Quantifiers Lecture-07 Video-07
8 Rules of Inference Lecture-08 Video-08
9 Introduction to Proofs Lecture-09 Video-09
10 Proof Methods Lecture-10 Video-10
11 Proof Strategy Lecture-11 Video-11
12 Sets Lecture-12 Video-12
Issue-Assignment 1 and Assignment-2 Statements

13 Set Operations Lecture-13 Video-13

14 Functions Lecture-14 Video-14
15 Sequences Lecture-15 Video-15
16 Sums and Matrices Lecture-16 Video-16
17 Basics of Counting Lecture-17 Video-17
Quiz -01 and Test-1-Obtain Student Feedback

18 Pigeonhole Principle Lecture-18 Video-18

19 Permutation and Lecture-19 Video-19
Combination
20 Permutation and Lecture-20 Video-20
Combination
21 Binomial Coefficient and Lecture-21 Video-21
Combination
22 Generating Permutation and Lecture-22 Video-22
Combination
23 Mathematical Induction Lecture-23 Video-23
Submission of Assignment-1
24 Strong Induction and Well- Lecture-24 Video-24
Ordering
25 Recursive Definitions Lecture-25 Video-25
26 Structural Induction Lecture-26 Video-26
27 Recursive Algorithms Lecture-27 Video-27
28 Program Corrections Lecture-28 Video-28
29 Properties of Relation Lecture-29 Video-29
30 Composition of Relation Lecture-30 Video-30
31 Closer Operation on Relation Lecture-31 Video-31
32 Equivalence Relation and Lecture-32 Video-32
Partition
33 Composition of Relation Lecture-33 Video-33
 Quiz -02 and Test -02
34 Lecture-34 Video-34
35 Representing Relation Lecture-35 Video-35
36 Graphs and Graph Models Lecture-36 Video-36
37 Graph Terminology Lecture-37 Video-37
38 Special Types of Graphs Lecture-38 Video-38
39 Representing Graphs Lecture-39 Video-39
40 Graph Isomorphism Lecture-40 Video-40
41 Connectivity Lecture-41 Video-41
42 Euler and Hamilton Paths Lecture-42 Video-42
43 Shortest-Path Problems Lecture-43 Video-43
44 Planar Graphs Lecture-44 Video-44
45 Graph Coloring Lecture-45 Video-45
Quiz-03 and Test-03
Submission of Assignment-2
Obtain Student Feedback
Examination Preparation Break
Term/Semester End Examination

.2 Assessment weight Distribution

Quiz Test Assignment/ SEE Total

PBL/PrBL Marks
Weights/ 15 25 20 40 100
Course
Outcomes
CO1 3 5 3 5 16
CO2 3 5 3 7 18
CO3 3 5 3 7 18
CO4 2 3 3 7 15
CO5 2 3 4 7 16
CO6 2 4 4 7 17

3. Schedule of Assessment
 Assessment Dates Mark COs Quiz Test Assignme SEE
Type s nt/PBL/
PrBL
Weight 15 25 20 40
Duration 30 min 60 min 6 weeks 3
hours
Quiz-1 5th 6 CO1/
week CO2
Quiz-2 10th 5 CO3/
week CO4
Quiz-3 15th 4 CO5/
week CO6
Test-1 5th 10 CO1/
week CO2
Test-2 10th 8 CO3/
week CO4
Test-3 15th 7 CO5/
week CO6
Assignment- 7th 09 CO
1 week 1-3
Assignment- 14th 11 CO
2 week 4-6
SEE 18th 40 All
Week

a. Grading Criterion

● Based on total marks scored grade is Awarded.

If marks scored is:

● 91 and above O (outstanding); 81-90 : A+ (Excellent); 71-80: A (Very Good);

61-70: B+ (Good); 51-60 : B (Above Average); 40 -50: C (Average); below
40: D (Not satisfactory)
● If one scores D grade, the candidate is required to re-register for the course if
he/she wants to earn the credit at his/her own convenience

Attainment Calculations:
Recording Marks and Awarding Grades

S. No. USN Studen Quiz Test Assignme SEE Marks Grade

t Name (15%) (25%) nt 40% Scored Obtain
20% ed
1

Total XXXX
X

Class Average Marks: Total marks of All Students (XXXX)/ Number of students (N)
Average Grade:

Setting Attainment Targets:

Attainment of Course Outcomes-COs

Outcomes- Targeted Outcomes Level of Observations and
Attainment Remarks
70% of Students will score C
grade and above-1
60% of students will score C
grade and Above-2
50% of students will score C
grade and above-3
70% of Students will score C
grade and above-1
60% of students will score C
grade and Above-2
50% of students will score C
grade and above-3
70% of Students will score C
grade and above-1
60% of students will score C
grade and Above-2
50% of students will score C
grade and above-3
70% of Students will score C
grade and above-1
60% of students will score C
grade and Above-2
50% of students will score C
grade and above-3
70% of Students will score C
grade and above-1
60% of students will score C
grade and Above-2
50% of students will score C
grade and above-3
70% of Students will score C
grade and above-1
60% of students will score C
grade and Above-2
50% of students will score C
grade and above-3

Performance Recording

Acad Progra Semes Sect Course Course Title

emic m: ter ion Code Discrete Mathematics
Year in UC24CSC
2023 Comp 3 A 31 Course Tutor/s:
-24 uter Tutor’s ID/Department:
Scienc
e
Total Numb Numb Clas O- A+ A B+ B C D
Num er of er of s Grade Grader Grade Grade Grade Grade Gra
ber Studen Studen Ave rs s r rs rs rs ders
of ts ts - rage >= 91 40<= M<
stude appear Passed Mar 81<= 71<= 61<= 51<= M<=5 40
nts ed for all the ks M<=9 M<=8 M<=7 M<=6 0
in all the compo 0 0 0 0
the compo nent
Class nents of
of Exami
Assess nation
ment
60 58 54 58 4 8 10 14 10 8 4
B
Gra
de
CO1- Performance

CO2- Performance

CO3- Performance
CO4- Performance

CO5- Performance

CO6- Performance

Performance Plotting

Mapping of Course Outcomes with Program Outcomes

P P P P P P P P P PO PO PO PS PS PS
O1 O2 O3 O4 O5 O6 O7 O8 O9 10 11 12 O1 O2 O3
C 1
O1
C 1
O2
C 2 2
O3
C 2 2
O4
C 1 1
O5
C 1 1
O6

DistributionCO-1 CO-2 Distribution CO-3 Distribution

Distribution

CO-4 Distribution CO-5 Distribution CO-6 Distribution

4. Other Details

4.1 Assignment Details or Problem Based Learning

Assignments will be given at the beginning of each block period and students can
continuously work on assignment and submit at the end of the block period as per the
format provided.
4.2 Academic Integrity Policy: Students are required to strictly follow academic honesty
and integrity. Copying and plagiarism in any form for any of the assessment components
will result in zero marks.
 Course Document

Course Code UC24CSC32

Course Title Operating Systems
Program Code SCS02
Program Title BSc- Computer Science
School School of Computer Science
Faculty Code C
Faculty Title Faculty of Computing and IT
Department offering the Faculty of Computing and IT
Course
Faculty Member Prof.Shweta Marigoudar
Semester Duration Weeks (1-16) -Teaching, Learning and Continuous
Assessment
Weeks (17-18) -SEE
Weeks (19-20)- Announcement of Results

1. Course Size
Credits L T P Hours/Week
3 3 1 0 4

Total Term/ Semester hours: 45

2. Course Details

2.1 Course Aims and Summary

 The course on operating systems provides a comprehensive understanding of the
fundamental concepts and principles of operating systems. It covers topics such as
process management, memory management, file systems, and device management.
 The course explores various operating system structures and their mechanisms for
efficient resource allocation and task scheduling. It also discusses synchronization and
deadlock handling techniques.
 The course further delves into virtual memory management and explores the concepts
of paging and segmentation. Students are exposed to different types of operating
systems, such as batch, multi-programming, time-sharing, and real-time systems.
 The course equips students with the knowledge and skills necessary to develop and
manage operating systems efficiently.
2.2 Course Objectives

The objectives of the Course are:

1. Understanding the fundamental functions and components of an operating system.
2. Studying the process management and scheduling techniques used by operating
systems to allocate system resources efficiently.
3. Exploring memory management techniques, including virtual memory, paging,
and segmentation.
4. Learning about file systems and how operating systems manage and organize data
on storage devices.
5. Understanding the basics of inter-process communication and synchronization
mechanisms to support concurrent execution of processes.
6. Exploring operating system security concepts and techniques for protecting
system resources and data.
7. Studying various input/output techniques and device management mechanisms
implemented by operating systems.
8. Developing problem-solving skills through hands-on assignments and projects
related to operating system design and implementation.
9. Familiarizing with modern operating system architectures and technologies, such
as distributed systems, real-time systems, and mobile operating systems.
10. Gaining practical knowledge and experience through the use of tools, simulators,
and virtualization technologies to experiment with operating system concepts.

2.3Course Outcomes
After undergoing this course students will be able to:
CO1 Concepts of Operating system, such as process, memory management, and
file systems.
CO2 Explain the principles behind process scheduling and synchronization in
operating systems. Describe the relationship between hardware and software
in the context of operating systems..
CO3 Apply knowledge of process management to analyze and solve practical
problems in multitasking environments. Implement basic file management
operations in a given operating system..
CO4 Analyze the impact of different scheduling algorithms on system
performance. Evaluate the efficiency of memory management techniques in
various scenarios..
CO5 Evaluate the security implications of different access control mechanisms in
operating systems. Critically assess the trade-offs between performance and
reliability in file system design.
CO6 Design and implement a simple operating system component, such as a
process scheduler or memory allocator. Develop a solution to address a
specific challenge or limitation in an existing operating system
 Outcome Map:
Cos PO PO PO PO PO PO PO PO PS PS PS
01 02 03 04 05 06 07 08 O1 O2 O3

CO1 2 2 2 3 3 1 3 2 2 3 1
CO2 1 1 1 2 3 1 1 1 1 1 1
CO3 1 1 1 2 2 1 1 1 1 1 1
CO4 2 1 3 1 3 3 2 2 2 2 2

CO5 2 2 2 3 3 2 1 1 1 1 1
CO6 2 2 2 3 3 2 2 2 2 2 2

Relevance: 1 high, 2 medium, 3 low

2.4.Course Content

MODULE 1:
Introduction to operating systems,System structures: What operating systems do;
Computer System organization; Computer System architecture; Operating System
structure; Operating System operations; Process management; Memory management;
Storage management; Protection and Security; Distributed system; Special-purpose
systems; Computing environments.
Operating System Services: User - Operating System interface; System calls; Types of
system calls; System programs; Operating system design and implementation; Operating
System structure; Virtual machines; Operating System debugging, Operating System
generation; System boot.

MODULE-2:
Process Management: Process concept; Process scheduling; Operations on processes;
Inter process communication Multi-threaded Programming: Overview; Multithreading
models; Thread Libraries; Threading issues. Process Scheduling: Basic concepts;
Scheduling Criteria; Scheduling Algorithms; Thread scheduling; Multiple-processor
scheduling.

MODULE-3:
Process Synchronization: Synchronization: The critical section problem; Peterson’s
solution,
Synchronization hardware; Semaphores; Classical problems of synchronization
Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks;
Deadlock prevention; Deadlock avoidance; Deadlock detection and recovery from
deadlock.
 MODULE-4:
Memory Management: Memory management strategies, Background, Swapping,
Contiguous memory allocation, Paging-Structure of page table, Segmentation.
Virtual Memory Management: Background, Demand paging,Copy-on-write, Page
replacement;Allocation of frames; Thrashing.
MODULE-5
File System, Implementation of File System:File concept; Access methods; Directory
and Disk structure; File sharing; Implementing File system: File system structure; File
system implementation; Directory implementation; Allocation methods; Free space
management.
Secondary Storage Structure, Protection: Mass storage structures; Disk structure; Disk
attachment; Disk scheduling; Disk management; Protection: Goals of protection,
Principles of protection, Domain of protection, Access matrix.

2.5 Course Resources:

Textbooks
4. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System Principles
8th edition, Wiley-India, 2015.

Reference Books
5. Ann McHoes Ida M Fylnn, Understanding Operating System, Cengage Learning, 6th
Edition
6. D.M Dhamdhere, Operating Systems: A Concept Based Approach 3rd Ed, McGraw-
Hill, 2013.
7. P.C.P. Bhatt, An Introduction to Operating Systems: Concepts and Practice 4th
Edition, PHI(EEE), 2014.
8. William Stallings Operating Systems: Internals and Design Principles, 6th Edition,
Pearson.

Tutorial links and e-resources

9. https://youtu.be/mXw9ruZaxzQ
10. https://youtu.be/vBURTt97EkA
11. https://www.youtube.com/watch?v=783KABtuE4&list=PLIemF3uozcAKTgsCIj82vo
MK3TMR0YE_f
12. https://www.youtube.com/watch?v=3-
ITLMMeeXY&list=PL3pGy4HtqwD0n7bQfHjPnsWzkeRn6mkO

Teaching and Assessment

3.1 Teaching Plan

Lecture Lecture Topic Lecture Slides Lecture Videos

Number
0 Introduction to operating Lecture-00
systems
 Issue-Assignment 1 and Assignment-2 Statements
1 System structures: What Lecture-01 Video-01
operating systems ,Computer
System organization
2 Computer System Lecture-02
architecture
3 Operating System structure Lecture-03
4 Operating System operations, Lecture-04 Video-02
Process management
5 Memory management, Lecture-05
Storage management,
Protection and Security
6 Distributed system, Special- Lecture-06 Video-03
purpose systems
7 Operating System interface, Lecture-07
System calls, Types of
system calls
8 System programs, Operating Lecture-08
system design
,implementation
9 Operating System structure, Lecture-09
Virtual machines
10 Operating System debugging Lecture-10
11 System generation, System Lecture-11 Video-04
boot.
12 Process Management, Lecture-12
Process concept
13 Process scheduling, Lecture-13
Operations on processes
14 Inter process communication Lecture-14
Multi-threaded Programming
15 Multithreading models Lecture-15 Video-05
16 Thread Libraries, Threading
issues
Quiz -01 and Test-1-Obtain Student Feedback
Submission of Assignment-1
17 Process Scheduling Lecture-16 Video-06
18 Scheduling Criteria Lecture-17
19 Scheduling Algorithms Lecture-18
20 Thread scheduling Lecture-19
21 Multiple-processor Lecture-20
scheduling
22 Process Synchronization Lecture-21 Video-07
22 The critical section problem Lecture-22 Video-08
23 Peterson’s solution Lecture-23
24 Synchronization hardware, Lecture-24
Semaphores
25 Classical problems of Lecture-25
synchronization
 26 Deadlocks, System model, Lecture-26 Video-09
Deadlock characterization
27 Methods for handling Lecture-27
deadlocks, Deadlock
prevention, avoidance
28 Deadlock detection and Lecture-28 Video-10
recovery from deadlock
29 Memory Management Lecture-29
30 Memory management Lecture-30
strategies
31 Swapping, Contiguous Lecture-31 Video-11
memory allocation
32 Paging; Structure of page Lecture-32
table, Segmentation.
33 Demand paging Lecture-33
Quiz -02 and Test -02
Submission of Assignment-2
34 Page replacement algorithms Lecture-34
35 Thrashing Lecture-35 Video-12
36 File System, Implementation Lecture-36
of File System
37 Directory and Disk structure Lecture-37
38 Free space management Lecture-38
39 Secondary Storage Structure Lecture-39
40 Disk structure, Disk Lecture-40 Video-12
attachment
41 Disk management Lecture-41
42 Protection, Goals of Lecture-42
protection
43 Principles of protection Lecture-43
44 Domain of protection, Lecture-44
45 Access matrix Lecture-45
Quiz-03 and Test-03
Obtain Student Feedback
Examination Preparation Break
Term/Semester End Examination

1.2 Assessment weight Distribution

Quiz Test Assignment/ SEE Total

PBL/PrBL Marks
Weights/ 15 30 15 40 100
Course
Outcomes
CO1 3 5 3 5 16
CO2 3 5 3 7 18
CO3 3 5 3 7 18
 CO4 2 3 3 7 15
CO5 2 3 4 7 16
CO6 2 4 4 7 17
1.3 Schedule of Assessment

Assessment Dates Mark COs Quiz Test Assignme SEE

Type s nt/PBL/
PrBL
Weight 15 30 15 40
Duration 30 60 min 6 weeks 3
min hours
Quiz-1 5th 6 CO1/CO2
week
Quiz-2 10th 5 CO3/CO4
week
Quiz-3 15th 4 CO5/CO6
week
Test-1 5th 10 CO1/CO2
week
Test-2 10th 8 CO3/CO4
week
Test-3 15th 7 CO5/CO6
week
Assignment- 7th 09 CO 1-3
1 week
Assignment- 14th 11 CO 4-6
2 week
SEE 18th 40 All
Week

1.4 Grading Criterion

 Based on total marks scored grade is Awarded.

If marks scored is:

 91 and above O (outstanding); 81-90 : A+ (Excellent); 71-80: A (Very Good);

61-70: B+ (Good); 51-60 : B (Above Average); 40 -50: C (Average); below
40: D (Not satisfactory)
 If one scores D grade, the candidate is required to re-register for the course if
he/she wants to earn the credit at his/her own convenience
Attainment Calculations:
Recording Marks and Awarding Grades

S. No. USN Student Quiz Test Assignment SEE Marks Grade

Name (15%) (25%) 20% 40% Scored obtained
1
2
3

N
Total XXXXX

Class Average Marks: Total marks of All Students (XXXX)/ Number of students (N)
Average Grade:

Setting Attainment Targets:

Attainment of Course Outcomes-COs

Outcomes- Targeted Outcomes Level of Observations and
Attainment Remarks
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3

Performance Recording:

Acad Progr Semes Sect Course Course Title

emic am: ter ion Code Operating System
Year B.Sc., UC24CSC3
2023 in 3 A 2 Course Tutor/s:
-24 Comp Tutor’s ID/Department:
uter
Scien
ce
Total Numb Numb Clas O- A+ A B+ B C D
Num er of er of s Grader Graders Grader Grader Grader Grader Gra
ber Stude Studen Ave s s s s ders
of nts ts - rage >= 91 81<=M 71<= 40<= M<
stude appea Passed Mar <=90 M<=8 61<= 51<= M<=5 40
nts in red all the ks 0 M<=7 M<=6 0
the for all compo 0 0
Class the nent
comp of
onents Exami
of nation
Asses
sment
60 58 54 58 4 8 10 14 10 8 4
B
Gra
de
CO1- Performance

CO2- Performance

CO3- Performance

CO4- Performance
 CO5- Performance

CO6- Performance

Performance Plotting

CO-1 Distribution CO-2 Distribution CO-3 Distribution

CO-4 Distribution CO-5 Distribution CO-6 Distribution

Mapping of Course Outcomes with Program Outcomes

P P P P P P P P P PO PO PO PS PS PS
O1 O2 O3 O4 O5 O6 O7 O8 O9 10 11 12 O1 O2 O3
C 1
O1
C 1
O2
C 2 2
O3
C 2 2
O4
C 1 1
O5
C 1 1
O6

4. Other Details

4.1 Assignment Details or Problem Based Learning

Assignments will be given at the beginning of each block period and students can
continuously work on assignment and submit at the end of the block period as per the
format provided.
4.2 Academic Integrity Policy: Students are required to strictly follow academic honesty
and integrity. Copying and plagiarism in any form for any of the assessment components
will result in zero marks.
 Course Document

Course Code UC24CSC32

Course Title Operating System Lab
Program Code 02
Program Title BSc- Computer Science
School School of Computer Science
Faculty Code C
Faculty Title Faculty of Computing and IT
Department offering the Computer Science
Course
Faculty Member Prof.Shweta Marigoudar
Semester Duration Weeks (1-16) -Teaching, Learning and Continuous
Assessment
Weeks (17-18) -SEE
Weeks (19-20)- Announcement of Results

3. Course Size

Credits L T P Hours/Week
2 0 0 3 3

Total Term/ Semester hours: 30

4. Course Details
2.1Course Aims and Summary
 1.The course on operating systems provides a comprehensive understanding of the
fundamental concepts and principles of operating systems. It covers topics such as
process management, memory management, file systems, and device management.
 The course explores various operating system structures and their mechanisms for
efficient resource allocation and task scheduling. It also discusses synchronization and
deadlock handling techniques.
 3.The course further delves into virtual memory management and explores the
concepts of paging and segmentation. Students are exposed to different types of
operating systems, such as batch, multi-programming, time-sharing, and real-time
systems.
 4.The course equips students with the knowledge and skills necessary to develop and
manage operating systems efficiently.

2.2Course Objectives
The objectives of the Course are:
1 Understanding the fundamental functions and components of an operating system.
 2 Studying the process management and scheduling techniques used by operating systems to
allocate system resources efficiently.
3 Exploring memory management techniques, including virtual memory, paging, and
segmentation.
4 Learning about file systems and how operating systems manage and organize data on storage
devices.
5 Understanding the basics of inter-process communication and synchronization mechanisms to
support concurrent execution of processes.
6 Exploring operating system security concepts and techniques for protecting system resources
and data.
7 Studying various input/output techniques and device management mechanisms
implemented by operating systems.
8 Developing problem-solving skills through hands-on assignments and projects related to
operating system design and implementation.
9 Familiarizing with modern operating system architectures and technologies, such as
distributed systems, real-time systems, and mobile operating systems.
10 Gaining practical knowledge and experience through the use of tools, simulators, and
virtualization technologies to experiment with operating system concepts.

Course Outcomes
After undergoing this course students will be able to:

CO1 Explain the principles behind process management, memory management,

and file systems. Describe the interactions between hardware and software in
an operating system.

CO2 Analyse the principles behind process scheduling, Processing

synchronisation, execution of Scheduling algorithms
CO3 Implement basic system calls for process creation, termination, and
synchronization.Develop programs to demonstrate memory allocation and
deallocation strategies.
CO4 Evaluate the performance of different scheduling algorithms through
simulation.Analyze the impact of various memory management techniques
on system efficiency.
CO5 Design and implement a simple operating system shell with basic command
functionalities
CO6 create a simple operating system programs, such as a process scheduler or
memory allocator. Develop a multi-process program demonstrating
interprocess communication.
 Outcome Map:
Cos P P P P P P P P PO P P P PS PS PS
O O0 O O O O O O 09 O O O O O O3
01 2 03 04 05 06 07 08 10 11 12 1 2
CO1
2 2 2 3 3 1 3 2 3 3 1 1 2 3 1
CO2
1 1 1 2 3 1 1 1 1 2 3 1 1 1 1
CO3
1 1 1 2 2 1 1 1 1 1 2 1 1 1 1
CO4
2 1 3 1 3 3 2 2 2 2 3 2 2 2 2
CO5
2 2 2 3 3 2 1 1 1 2 2 1 1 1 1
CO6
2 2 2 3 3 2 2 2 2 3 3 2 2 2 2

Relevance: 1 high, 2 medium, 3 low

5. Course Content
Week 1: Simulate the following CPU scheduling algorithms. a) FCFS b) SJF c) Round Robin d)
Priority. Week 2: Write a C program to simulate producer-consumer problem using Semaphores
Week 3: Write a C program to simulate the concept of Dining-philosophers problem.
Week 4: Simulate MVT and MFT.
Week 5: Write a C program to simulate the following contiguous memory allocation Techniques a)
Worst fit b) Best fit c) First fit.
Week 6: Simulate all page replacement algorithms a)FIFO b) LRU c) OPTIMAL
Week 7: Simulate all file allocation strategies a) Sequential b) Indexed c) Linked.
Week 8: Simulate Bankers Algorithm for Dead Lock Avoidance.
Week 9: Simulate Bankers Algorithm for Dead Lock Prevention.
Week 10: Write a C program to simulate disk scheduling algorithms. a) FCFS b) SCAN c) C-SCAN

Teaching and Assessment

3.2Teaching Plan
Experiment Name of Experiment Duration
Number
1 CPU scheduling algorithms 3 Hour
a) first come first serve(fcfs)
b) shortest job first(sjf)
c) round robin
d) priority
2 Producer-Consumer problem using semaphores 3 Hour
 3 Dining-Philosophers problem 3 Hour
4 Memory management Techniques 3 Hour
a) multi programming with fixed number of tasks(mft)
b) multi programming with variable number of
tasks(mvt)
5 Contiguous Memory Allocation 3 Hour
a) worst fit b) best fit 27-28 c) first fit
6 Page Replacement Algorithms 3 Hour
a) first in first out(fifo)
b) least recently used(lru)
c) optimal
7 File Allocation Strategies 3 Hour
a)sequential b) indexed c) linked
8 Deadlock Avoidance 3 Hour
9 Dead lock Prevention 3 Hour
10 Disk Scheduling Algorithms 3 Hour
a) fcfs b) scan c) c-scan

1.5 Assessment weight Distribution

Conduction viva Lab Records SEE Total

laboratory Marks

1.6 Grading Criterion

 Based on total marks scored grade is Awarded.

If marks scored is:

 91 and above O (outstanding); 81-90 : A+ (Excellent); 71-80: A (Very Good); 61-70:

B+ (Good); 51-60 : B (Above Average); 40 -50: C (Average); below 40: D (Not
satisfactory)
 If one scores D grade, the candidate is required to re-register for the course if he/she
wants to earn the credit at his/her own convenience

Attainment Calculations:
Recording Marks and Awarding Grades

S. No. USN Student Quiz Test Assignment SEE Marks Grade

Name (15%) (25%) 20% 40% Scored obtained
1
2
3

N
Total XXXXX

Class Average Marks: Total marks of All Students (XXXX)/ Number of students (N)
Average Grade:

Setting Attainment Targets:

Attainment of Course Outcomes-COs

Outcomes- Targeted Outcomes Level of Observations and
Attainment Remarks
70% of Students will score C grade and
above-1
60% of students will score C grade
and Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade and
above-1
60% of students will score C grade
and Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade and
above-1
60% of students will score C grade
and Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade and
above-1
60% of students will score C grade
and Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade and
above-1
60% of students will score C grade
and Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade and
above-1
60% of students will score C grade
and Above-2
50% of students will score C grade and
above-3

Performance Recording

Acad Progr Semes Sect Course Course Title

emic am: ter ion Code Programming with C
Year B.Tec XXYYZZH
2023 h., in I A 11 Course Tutor/s:
-24 Comp Tutor’s ID/Department:
uter
Scien
ce and
Engin
eering
Total Numb Numb Clas O- A+ A B+ B C D
Num er of er of s Grader Graders Grader Grader Grader Grader Gra
ber Stude Stude Ave s s s s ders
of nts nts - rage >= 91 81<=M 71<= 40<= M<
stude appea Passed Mar <=90 M<=8 61<= 51<= M<=5 40
nts red all the ks 0 M<=7 M<=6 0
in for all compo 0 0
the the nent
Class comp of
onents Exami
of nation
Asses
sment
60 58 54 58 4 8 10 14 10 8 4
B
Gra
de
CO1- Performance

CO2- Performance

CO3- Performance

CO4- Performance

CO5- Performance

CO6- Performance
Performance Plotting

CO-1 CO-2 Distribution CO-3 Distribution

CO-4 Distribution CO-5 Distribution CO-6 Distribution

Mapping of Course Outcomes with Program Outcomes

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO

1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO 1
1
CO 1
2
CO 2 2
3
CO 2 2
4
CO 1 1
5
CO 1 1
6

4.Other Details

4.1 Assignment Details or Problem Based Learning

Assignments will be given at the beginning of each block period and students can
continuously work on assignment and submit at the end of the block period as per the
format provided.
4.2 Academic Integrity Policy: Students are required to strictly follow academic honesty
and integrity. Copying and plagiarism in any form for any of the assessment components
will result in zero marks.
 Course Document

Course Code UC24CSO31

Course Title Internet Security
Program Code SCS02
Program Title BSc- Computer Science
School School of Computer Science
Faculty Code C
Faculty Title Faculty of Computing and IT
Department offering the Faculty of Computing and IT
Course
Faculty Member Prof.Shweta Marigoudar
Semester Duration Weeks (1-16) -Teaching, Learning and Continuous
Assessment
Weeks (17-18) -SEE
Weeks (19-20)- Announcement of Results

1. Course Size
Credits L T P Hours/Week
3 3 1 0 4

Total Term/ Semester hours: 45

2. Course Details

2.1Course Aims and Summary

 Internet security is a crucial aspect of the digital age, as it involves protecting

computer systems, networks, and data from unauthorized access, attacks, and
damage. Courses on internet security aim to provide individuals with the knowledge
and skills necessary to safeguard information and ensure the integrity, confidentiality,
and availability of digital assets.
 Courses on internet security typically cover a range of topics to provide a
comprehensive understanding of cyber security principles. They may include
modules on cryptography, network security, secure coding practices, ethical hacking,
risk management, and legal aspects of cyber security.
 By the end of this course, participants should be able to assess and mitigate cyber
security risks, implement security measures to protect systems and data, and respond
effectively to security incidents. The goal is to produce professionals who can
contribute to creating a secure digital environment for individuals, organizations, and
society as a whole.

2.2Course Objectives
The objectives of the Course are:
1. Identify and analyze the various threats and vulnerabilities in the digital
environment. Stay updated on the latest trends and emerging cyber threats.
2. Establish a solid foundation in the basic principles of cyber security. Cover topics
such as encryption, authentication, access control, and secure coding practices.
3. Explore techniques to secure computer networks against unauthorized access and
cyber attacks.
4. To learn about firewalls, intrusion detection and prevention systems, and secure
network architecture.
5. Focus on ensuring the confidentiality, integrity, and availability of
information.Understand risk management and develop strategies for information
protection.
6. Familiarize students with various cyber security tools and technologies. Hands-on
experience with tools used for vulnerability assessment, penetration testing, and
incident response.
7. Equip students with skills to respond effectively to security incidents. Introduction
to digital forensics for investigating and analyzing cyber incidents.
8. Promote a culture of security awareness among individuals and organizations.
Educate users about best practices to prevent social engineering attacks.

2.3Course Outcomes
After undergoing this course students will be able to:
CO1 Define key terms and concepts related to internet security, cyber threats and
vulnerabilities. Remember fundamental principles of cryptography.
CO2 Understand the impact of various cyber threats on individuals and organizations.
Comprehend the role of encryption in securing digital communication.
CO3 Apply secure coding practices to develop resilient software. Implement network
security measures, such as firewalls and intrusion detection systems. Apply access
control mechanisms to restrict unauthorized access.
CO4 Analyze the security architecture of a system or network. Assess and identify
vulnerabilities through security risk assessments. Analyze the impact of a security
incident and formulate an appropriate response.
CO5 Evaluate the effectiveness of security policies and procedures. Assess the strengths
and weaknesses of different authentication methods. Evaluate the security
implications of adopting new technologies.
CO6 Create a secure system design for a given scenario. Design and conduct a penetration
testing exercise to identify and address vulnerabilities
 Outcome Map:
COs PO P PO PO PO PO PO PO PSO1 PSO2 PSO3
01 03 04 05 06 07 08
02

CO1 2 2 2 3 2 1 3 3 1 1 2
CO2 2 2 1 2 1 1 1 1 1 2 2
CO3 1 2 1 2 1 3 2 2 1 2 3
CO4 3 2 2 1 2 3 1 1 1 2 3
CO5 1 2 3 1 3 1 1 1 1 2 2
CO6 2 2 2 1 1 3 1 3 1 2 3

Relevance: 1 high, 2 medium, 3 low

2.4 Course Content

Module I
Introduction,Need for Security , Security Attacks, Services and Mechanisms, Network
Security-Importance of Network security,Security threats and attacks
Module II
Symmetric Ciphers- Classical Symmetric Ciphers, Caesar Cipher, Substitution Ciphers
(Monoalphabetic and Polyalphabetic),Transposition Ciphers ,Playfair Cipher Substitution
&Transposition Techniques ,Block Cipher , DES 4,Triple DES , Stream Ciphers , RC4 III
Module III
Public Key Cryptography and Message Authentication, Approaches to Message
Authentication, Authentication using Conventional Encryption, Message Authentication
without Message Encryption Message Authentication Code ,One Way Hash Function ,
Secure Hash Function and HMAC: Hash Function Requirements ,Simple Hash Functions the
SHA–1 Secure Hash Function ,Other Secure Hash Functions – HMAC Design Objectives,
HMAC Algorithm
Module IV
Cryptography Principles: Public Key Encryption Structure Application for Public Key
Cryptosystems – Requirements for Public Key Cryptography, Public Key Cryptography
Algorithms: RSA Public Key Encryption Algorithms , Diffie -Hellman Key Exchange ,Other
Public Key Cryptography Algorithms – Digital Signature , Key Management.
Module V
Firewalls and Intrusion Detection/Prevention Systems (IDS/IPS)
Firewall Concepts and Types, Firewall Rule Configuration, Intrusion Detection Systems
(IDS) and Intrusion Prevention Systems (IPS),Security Information and Event Management
(SIEM)
IP Security, VPN, Intrusion Detection , Web Security, SSL , TLS
2.5 Course Resources:

Textbooks
 William Stallings 1999, Network Security.

Reference Books
 Chris McNab,Network Security Assesment,3 rd Edition
 B. B. Buchanan ,The Handbook of Data Communications and Networks: Volume 1.
Volume 2,2013
 S. Keshav, 2nd Edition, Pearson Education. An Engineering Approach to Computer
Networks.

Tutorial links and e-resources

 https://www.youtube.com/watch?v=cMaVKxkC1Qs
 https://www.javatpoint.com/computer-network-tutorial
 https://www.geeksforgeeks.org/computer-network-tutorials

3.Teaching and Assessment

1. Teaching Plan
Lecture Lecture Topic Lecture Lecture
Number Slides Videos
0 Introduction Lecture-00
Issue-Assignment 1 and Assignment-2 Statements
1 Need for Security Lecture-01
2 Security Attacks Lecture-02 Video-01
3 Types of security attacks Lecture-03
4 Services Lecture-04
5 Mechanisms Lecture-05
6 Network Security Lecture-06 Video-02

7 Importance of Network security Lecture-07

8 Security threats and attacks Lecture-08
9 Symmetric Ciphers Lecture-09
10 Classical Symmetric Ciphers Lecture-10
11 Caesar Cipher, Substitution Ciphers Lecture-11 Video -03
12 Playfair Cipher Substitution Lecture-12
13 Transposition Techniques Lecture-13
14 Public Key Cryptography and Message Lecture-14 Video-04
Authentication
15 Approaches to Message Authentication Lecture-15
16 Authentication using Conventional Lecture-16
Encryption
Quiz -01 and Test -01
17 Message Authentication without Message Lecture-17 Video-05
Encryption
18 One Way Hash Function Lecture-18
19 Secure Hash Function Lecture-19
20 Hash Function Requirements Lecture-20
21 Simple Hash Functions Lecture-21
22 Other Secure Hash Functions Lecture-22
22 Design Objectives Lecture-23
23 HMAC Algorithm Lecture-24
24 Cryptography Principles Lecture-25
25 Public Key Encryption Lecture-26 Video-06
26 Application for Public Key Cryptosystems Lecture-27
27 Requirements for Public Key Cryptography Lecture-28
28 Introduction to Public Key Cryptography Lecture-29
Algorithms
29 RSA Public Key Encryption Algorithms Lecture-30 Video-07
30 Diffie -Hellman Key Exchange Lecture-31
31 Other Public Key Cryptography Algorithms Lecture-32
32 Digital Signature Lecture-33
33 Key Management Lecture-34 Video-08
Quiz -02 and Test -02
34 Firewall Concepts and Types Lecture-34
35 Firewall Rule Configuration Lecture-35
36 Intrusion Detection Systems Lecture-36
37 Intrusion Prevention Systems (IPS), Lecture-37 Video-09
38 Security Information management Lecture-38
39 Event Management Lecture-39
40 IP Security Lecture-40
41 Intrusion Detection Lecture-41 Video-10
42 Web security Lecture-42
Quiz-03 and Test-03
Submission of Assignment-2
Obtain Student Feedback
Examination Preparation Break
Term/Semester End Examination

2. Assessment weight Distribution

Quiz Test Assignment/ SEE Total Marks

PBL/PrBL
Weights/ Course Outcomes 15 30 15 40 100
CO1 3 5 3 5 16
CO2 3 5 3 7 18
CO3 3 5 3 7 18
CO4 2 3 3 7 15
CO5 2 3 4 7 16
CO6 2 4 4 7 17
 3. Schedule of Assessment

Assessment Dates Marks COs Quiz Test Assignment/PBL/ SEE

Type PrBL
Weight 15 30 15 40
Duration 30 60 6 weeks 3
min min hours
Quiz-1 5th 6 CO1/CO2
week
Quiz-2 10th 5 CO3/CO4
week
Quiz-3 15th 4 CO5/CO6
week
Test-1 5th 10 CO1/CO2
week
Test-2 10th 8 CO3/CO4
week
Test-3 15th 7 CO5/CO6
week
Assignment-1 7th 09 CO 1-3
week
Assignment-2 14th 11 CO 4-6
week
SEE 18th 40 All
Week

4. Grading Criterion

 Based on total marks scored grade is Awarded.

If marks scored is:

 91 and above O (outstanding); 81-90 : A+ (Excellent); 71-80: A (Very Good); 61-

70: B+ (Good); 51-60 : B (Above Average); 40 -50: C (Average); below 40: D
(Not satisfactory)
 If one scores D grade, the candidate is required to re-register for the course if
he/she wants to earn the credit at his/her own convenience
Attainment Calculations:

Recording Marks and Awarding Grades

S. USN Student Quiz Test Assignment SEE Marks Grade

No. Name (15%) (25%) 20% 40% Scored obtained

Total XXXXX

Class Average Marks: Total marks of All Students (XXXX)/ Number of students (N)
Average Grade:
Setting Attainment Targets:

Attainment of Course Outcomes-COs

Outcomes- Targeted Outcomes Level of Observations and
Attainment Remarks
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3

Performance Recording

Acad Progr Semes Sect Course Course Title

emic am: ter ion Code Internet Security
Year B.Sc., UC24CSO3
2023 in 3 A 1 Course Tutor/s:
-24 Comp Tutor’s ID/Department:
uter
Scien
ce
Total Numb Numb Clas O- A+ A B+ B C D
Num er of er of s Grader Graders Grade Grade Grade Grade Gra
ber Stude Studen Ave s 81<= r rs rs rs ders
of nts ts - rage >= 91 M<=90 40<= M<
stude appea Passed Mar 71<= 61<= 51<= M<=5 40
nts red all the ks M<=8 M<=7 M<=6 0
in for all compo 0 0 0
the the nent of
Class comp Exami
onent nation
s of
Asses
sment
60 58 54 58 4 8 10 14 10 8 4
B
Gra
de
CO1- Performance

CO2- Performance

CO3- Performance

CO4- Performance
CO5- Performance

CO6- Performance

Performance Plotting

Mapping of Course Outcomes with Program Outcomes

P P P P P P P P P PO PO PO PS PS PS
O1 O2 O3 O4 O5 O6 O7 O8 O9 10 11 12 O1 O2 O3

C
O1
C
O2
C
O3
C
O4
C
O5
C
O6
4. Other Details

4.1 Assignment Details or Problem Based Learning

Assignments will be given at the beginning of each block period and students can
continuously work on assignment and submit at the end of the block period as per
the format provided.
4.2 Academic Integrity Policy: Students are required to strictly follow academic
honesty and integrity. Copying and plagiarism in any form for any of the
assessment components will result in zero marks.
 Course Document
Course Code UC24CSC34
Course Title Web Technology
Program Code SCS02
Program Title B.Sc – Computer Science
Department Faculty of Computing and IT
Faculty Code C
Faculty Title Computing and IT (FCIT)
Department offering the Faculty of Computing and IT
Course
Faculty Member Prof. Shamina M. Attar
Semester Duration Weeks (1-16) -Teaching, Learning and Continuous
Assessment
Weeks (17-18) -SEE
Weeks (19-20)- Announcement of Results

1.Course Size
Credits L T P Hours/Week
3 4 0 0 4

Total Term/ Semester hours: 45

2.Course Details

2.1 Course Aims and Summary

 Understanding Web Fundamentals: Explore the foundational elements of the internet,
the World Wide Web, browsers, servers, URLs, MIME, and the HTTP protocol.
 XHTML Introduction: Grasp the basics of XHTML, including syntax, document
structure, text markup, images, links, lists, tables, forms, and differences between
HTML and XHTML.
 CSS Mastery: Develop proficiency in CSS by understanding style sheets, selector
forms, property value formats, font, list properties, color, alignment, box model,
background images, and conflict resolution.
 Introduction to JavaScript: Gain familiarity with JavaScript, covering its overview,
object orientation, syntax characteristics, primitive operations, and expressions.
2.2 Course Objectives
The objectives of this course are to:
1. Describe rich internet applications that use most recent client-side programming
technologies.
2. Apply client-side validations using Java Script.
3. Capture core technical skills necessary for a complete understanding of
 front-end web development, including HTML5 and CSS, JavaScript, DOM.

2.3 Course Outcomes

After undergoing this course students will be able to:
CO1 Gain a deep understanding of the core concepts and tools associated with
HTML and XHTML scripting.
CO2 Differentiate between HTML and XHTML syntactical elements and their
relevance in modern web development.
CO3 Apply programming concepts in CSS to effectively style and layout web
pages.
CO4 Implement JavaScript programming concepts to create interactive and
dynamic web functionalities.
CO5 Analyze and apply the principles essential for creating effective web pages,
encompassing usability, accessibility, and visual aesthetics.
CO6 Demonstrate the ability to structure and design web content that adheres to
industry standards and best practices.
CO7 Apply acquired web technology tools (HTML, XHTML, CSS, JavaScript) to
design and develop functional web applications.
C08 Showcase proficiency in using these tools collaboratively to create
responsive and user-friendly web interfaces.

Outcome Map:
COs PO PO PO PO PO PO PO PO PS PS PS
01 02 03 04 05 06 07 08 O1 O2 O3
CO1 1 3 3 3 2 3 1 2 1 3 1

CO2 1 1 1 1 3 3 1 1 3 3 1
CO3 3 3 3 3 3 3 3 3 3 3 3
CO4 1 1 3 3 3 3 3 3 3 3 3
CO5 1 3 3 2 3 3 3 3 3 3 1
CO6 2 3 3 2 3 3 3 3 3 3 3

Relevance: 1 high, 2 medium, 3 low

2.4 Course Content
Module1:
Fundamentals of Web: Fundamentals of Web: A Brief Introduction to the
Internet, The World Wide Web, Web Browsers, Web Servers, Uniform
Resource Locators, Multipurpose Internet Mail Extensions, The Hypertext
Transfer Protocol. Introduction to XHTML: Basic Syntax, Standard XHTML
Document Structure, Basic Text Markup, Images, Hypertext Links, Lists,
Tables, Forms, Syntactic Differences between HTML and XHTML.

Module2:
CSS & Basics of JavaScript: CSS Levels of Style Sheets, Style
Specification Formats, Selector Forms, Property Value Forms, Font
Properties, List Properties, Color, Alignment of Text, The Box Model,
Background Images, The <span> and <div> Tags, Conflict Resolution. The
Basics of JavaScript: Overview of JavaScript, Object Orientation and
JavaScript, General Syntactic Characteristics, Primitives Operations and
Expressions

Module3:
JavaScript and XHTML Documents JavaScript: Screen Output and
Keyboard Input, Control Statements, Object Creation and Modification,
Arrays, Functions, Pattern Matching Using Regular Expressions, Errors in
Scripts.
XHTML Documents: The JavaScript Execution Environment, The Document
Object Model, Element Access in JavaScript, Events and Event Handling.

Module4:
Event Handling & Dynamic Documents with Java Script Event Handling:
Handling Events from Body Elements, Handling Events from Button
Elements, Handling Events from Text Box and Password Elements, The
DOM 2 Event Model. Dynamic Documents with JavaScript: Introduction,
Positioning Elements, Moving Elements, Element Visibility, Changing
Colors and Fonts, Dynamic Content, Stacking Elements, Locating the Mouse
Cursor, Reacting to a Mouse Click, Slow Movement of Elements.

2.5Course Resources:
Text Book/s:
• Text Book:
1. Robert W Sebesta, “PROGRAMMING THE WORLD WIDE WEB”,
5th Edition, Pearson Education, 2008. (Chapters: 1, 2, 3, 4, 5 and 6)

• References:
• M.Deitel, P.J.Deitel, A.B.Goldberg, “INTERNET & WORLD WIDE
WEB HOW TO PROGRAM”, 3rd Edition, Pearson Education / PHI,
2004.
 • Chris Bates, “WEB PROGRAMMING BUILDING INTERNET
APPLICATIONS”,3rd Edition, Wiley India, 2006. 3. XueBai et al, “The
Web Warrior Guide to Web Programming”, Thomson, 2003.
• Sklar, “THE WEB WARRIOR GUIDE TO WEB DESIGN
TECHNOLOGIES”, 1st Edition, Cengage Learning India

3.Teaching and Assessment

3.1Teaching Plan

Lecture Lecture Topic Lecture Slides Lecture Videos

Number
0 Faculty Introduction ,Student Lecture-00 Video-00
Introduction and about
Subject
Issue-Assignment 1 and Assignment-2 Statements
1 Fundamentals of Web: Lecture-01 Video-01
Internet
2 The World Wide Web Lecture-02 Video-02
3 Web Browsers Lecture-03 Video-03
4 Web Servers, and URLs Lecture-04 Video-04
5 Multipurpose Internet Mail Lecture-05 Video-05
Extensions (MIME)
6 The Hypertext Transfer Lecture-06 Video-06
Protocol(HTTP)
7 Introduction to XHTML and Lecture-07 Video-07
Basic Syntax
8 Introduction to XHTML and Lecture-08 Video-08
Basic Syntax
9 Standard XHTML Document Lecture-09 Video-09
Structure
10 Basic Text Markup and Lecture-10 Video-10
Images
11 Hypertext Links, Lists Lecture-11 Video-11

12 Tables, and Forms in Lecture-12 Video-12

XHTML
13 Levels of Style Sheets Lecture-13 Video-13
14 Style Specification Formats Lecture-14 Video-14
15 Selector Forms Lecture-15 Video-15

16 Property Value Forms Lecture-16 Video-16

17 Font Properties, List Lecture-17 Video-17
Properties
18 Color, and Alignment of Lecture-18 Video-18
Text
19 The Box Model Lecture-19 Video-19
20 Background Images Lecture-20 Video-20
21 Background Images Lecture-21 Video-21
Quiz -02 and Test -02
22 <span> and <div> Tags Lecture-22 Video-22
23 Conflict Resolution Lecture-23 Video-23
24 Overview of JavaScript Lecture-24 Video-24
25 Object Orientation Lecture-25 Video-25
26 General Syntactic Lecture-26 Video-26
27 Characteristics and Lecture-27 Video-27
Primitives
28 Operations in JavaScript Lecture-28 Video-28
29 Expressions in JavaScript Lecture-29 Video-29
30 Screen Output Lecture-30 Video-30
31 Keyboard Input in JavaScript Lecture-31 Video-31
32 Control Statements Lecture-32 Video-32
33 Object Creation/Modification Lecture-33 Video-33
34 Arrays in JavaScript Lecture-34 Video-34
35 Functions in JavaScript Lecture-35 Video-35
36 Pattern Matching Using Lecture-36 Video-36
Regular Expressions
37 Pattern Matching Using Lecture-37 Video-37
Regular Expressions
38 Errors in Scripts Lecture-38 Video-38
39 JavaScript Execution Lecture-39 Video-39
Environment
40 Document Object Model Lecture-40 Video-40
41 Element Access in JavaScript Lecture-41 Video-41
42 Events/Event Handling Lecture-42 Video-42
43 DOM 2 Event Model Lecture-43 Video-43
44 Handling Events from Body, Lecture-44 Video-44
Button, Text Box, and
Password Elements
45 Dynamic Documents with Lecture-45 Video-45
JavaScript: Introduction and
Positioning Elements
Moving Elements, Element
Visibility, Changing Colors
and Fonts
Quiz-03 and Test-03
Submission of Assignment-2
Obtain Student Feedback
Examination Preparation Break
Term/Semester End Examination
4.3 Assessment weight Distribution

Quiz Test Assignment/ SEE Total

PBL/PrBL Marks
Weights/ 15 25 20 40 100
Course
Outcomes
CO1 3 5 3 5 16
CO2 3 5 3 7 18
CO3 3 5 3 7 18
CO4 2 3 3 7 15
CO5 2 3 4 7 16
CO6 2 4 4 7 17
4.4 Schedule of Assessment
Assessment Dates Mark COs Quiz Test Assignme SEE
Type s nt/PBL/
PrBL
Weight 15 25 20 40
Duration 30 min 60 min 6 weeks 3
hours
Quiz-1 5th 6 CO1/
week CO2
Quiz-2 10th 5 CO3/
week CO4
Quiz-3 15th 4 CO5/
week CO6
Test-1 5th 10 CO1/
week CO2
Test-2 10th 8 CO3/
week CO4
Test-3 15th 7 CO5/
week CO6
Assignment- 7th 09 CO
1 week 1-3
Assignment- 14th 11 CO
2 week 4-6
SEE 18th 40 All
Week
4.5 Grading Criterion

 Based on total marks scored grade is Awarded.

If marks scored is:
 91 and above O (outstanding); 81-90 : A+ (Excellent); 71-80: A (Very Good);
61-70: B+ (Good); 51-60 : B (Above Average); 40 -50: C (Average); below
40: D (Not satisfactory)
 If one scores D grade, the candidate is required to re-register for the course if
he/she wants to earn the credit at his/her own convenience

Attainment Calculations:
Recording Marks and Awarding Grades

S. No. USN Student Quiz Test Assignment SEE Marks Grade

Name (15%) (25%) 20% 40% Scored obtained
1
2
3

N
Total XXXXX

Class Average Marks: Total marks of All Students (XXXX)/ Number of

students (N)
Average Grade:

Setting Attainment Targets:

Attainment of Course Outcomes-COs
Outcomes- Targeted Outcomes Level of Observations and
Attainment Remarks
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
60% of students will score C grade and
Above-2
50% of students will score C grade and
above-3

Performance Recording
Acad Progr Semes Sect Course Course Title
emic am: ter ion Code Web Technology
Year B.Sc., UC24CSC3
2023 in 3 A 4 Course Tutor/s:
-24 Comp Tutor’s ID/Department:
uter
Scien
ce
Total Numb Numb Clas O- A+ A B+ B C D
Num er of er of s Grader Graders Grader Grader Grader Grader Gra
ber Stude Studen Ave s s s s ders
of nts ts - rage >= 91 81<=M 71<= 40<= M<
stude appea Passed Mar <=90 M<=8 61<= 51<= M<=5 40
nts in red all the ks 0 M<=7 M<=6 0
the for all compo 0 0
Class the nent
comp of
onents Exami
of nation
Asses
sment
60 58 54 58 4 8 10 14 10 8 4
B
Gra
de
CO1- Performance

CO2- Performance

CO3- Performance

CO4- Performance

CO5- Performance

CO6- Performance

Performance Plotting

CO-1 Distribution CO-2 Distribution CO-3 Distribution

CO-4 Distribution CO-5 Distribution CO-6 Distribution

Mapping of Course Outcomes with Program Outcomes

P P P P P P P P P PO PO PO PS PS PS
O1 O2 O3 O4 O5 O6 O7 O8 O9 10 11 12 O1 O2 O3
C 1
O1
C 1
O2
C 2 2
O3
C 2 2
O4
C 1 1
O5
C 1 1
O6
5. Other Details

4.3 Assignment Details or Problem Based Learning

Assignments will be given at the beginning of each block period and students can
continuously work on assignment and submit at the end of the block period as per the format
provided.
4.2 Academic Integrity Policy: Students are required to strictly follow academic
honesty and integrity. Copying and plagiarism in any form for any of the assessment
components will result in zero marks.
 Course Document

Course Code UC24CSP35

Course Title Web Technology Lab
Program Code SCS02
Program Title B.Sc – Computer Science
Department Faculty of Computing and IT
Faculty Code C
Faculty Title FC IT
Department offering the Faculty of Computing and IT
Course
Faculty Member Prof. Shamina M. Attar
Semester Duration Weeks (1-16) -Teaching, Learning and Continuous
Assessment
Weeks (17-18) -SEE
Weeks (19-20)- Announcement of Results

1.Course Size

Credits L T P Hours/Week
2 0 0 2 2

Total Term/ Semester hours: 30

2.Course Details

2.1 Course Aims and Summary

 The Web Technology Lab is designed to provide hands-on experience and

practical skills in developing interactive and dynamic web applications. The aim is
to equip students with the ability to create and manipulate web pages using
HTML, CSS, JavaScript, and explore client-side scripting for enhanced user
interactions.
 The Web Technology Lab focuses on building essential skills in web
development, emphasizing both static and dynamic aspects of web pages. Students
will learn to create visually appealing and interactive web applications using a
combination of HTML, CSS, and JavaScript. The lab covers topics ranging from
basic web page design to client-side scripting, enabling students to develop
practical solutions to real-world problems.

2.2 Course Objectives

The objectives of the Course are:

1. Syllabus Display:
2. Create a webpage to showcase the course syllabus.
 3. Student Pages:
4. Design linked pages for student details and results.
5. Class Timetable:
6. Develop a webpage for a class timetable.
7. Interactive Images:
8. Implement a webpage with moving images and hyperlinks.
9. JavaScript Calculator:
10. Build a simple calculator using JavaScript.
11. Math Operations Table:
12. Use JavaScript to create a table displaying squares and cubes.
13. Login Page Validation:
14. Create a login page with JavaScript validation.
15. Arithmetic Operations Form:
16. Develop a form for arithmetic operations using JavaScript.
17. Employee Information:
18. Design an interactive form for employee details with salary calculations.
19. Student Information:
20. Create a form for students with result calculations and grading.
21. Text to Uppercase:
22. Develop a page with JavaScript to convert text to uppercase.
23. Image Switching:
24. Enhance a page with images that switch on mouse events.
25. Math Expression Form:
26. Design a form for mathematical expressions with dynamic JavaScript evaluation.
27. Textbox Validation:
28. Create a form with JavaScript validation for numbers, alphabets, and completeness.
29. Sum of N Numbers:
30. Write a JavaScript function to find the sum of given numbers.
31. Factorial Calculation:
32. Implement a JavaScript function to find the factorial of a number.

2.3 Course Outcomes

After undergoing this course students will be able to:

CO1
CO2
CO3
CO4
CO5
CO6
 Outcome Map:
COs PO PO PO PO PO PO PO PO PSO PS PSO
01 02 03 04 05 06 07 08 1 O2 3

CO1
CO2

CO3
CO4
CO5

CO6

Relevance: 1 high, 2 medium, 3 low

2.4 Course Content

• PART – A
1. Create a web page to display the course syllabus.
2. Design student details in first page and result in next page, link both pages using
hyper links.
3. Create a web page for class time table
4. Develop a web page with 2 or more images, move images in different
directions and write hyper link to any one image.
5. Write a java script to design a simple calculator to perform the following
operations sum, product, difference and quotient.
6. Write a java script that calculate the squares and cubes of the numbers
from 0 to 10 and outputs HTML text that displays the resulting values in
an HTML table format.
7. Design login page and validate it using JavaScript
8. Develop a HTML Form which accepts two numbers. Write JavaScript
code to execute arithmetic operationsand displays the result.

• PART – B
1. Create a form for Employee information. Write JavaScript code to find
DA, HRA, PF, TAX, Gross pay, Deduction and Net pay.
2. Create a form for Student information. Write JavaScript code to find Total,
Average, Result and Grade.
3. Develop web page with one text box and Write a JavaScript code to convert
the text entered in textbox toupper case.
 4. Create a web page using two image files, which switch between one
another as the mouse pointer moves over the images. Use the on Mouse
Over and on Mouse Out.
5. Develop a HTML Form, which accepts any Mathematical expression. Write
JavaScript code to Evaluates the expression and Displays the result.
6. Create a HTML form with 3 Textboxes. Write JavaScript code to validate
input for numbers, alphabets, alphanumeric and verify that all 3 textboxes
has been filled.
7. Write a user-defined function in JavaScript to find sum of N Number.
8. Write a JavaScript code to find factorial of a number using recursive
function.

2.5 Course Resources:

 Text Book/s:

• References:

• Other Resources

4. Teaching and Assessment

4.1Teaching Plan

Lecture Lecture Topic Lecture Slides Lecture Videos

Number
0 Lecture-00 Video-00
Issue-Assignment 1 and Assignment-2 Statements
1 Lecture-01 Video-01
2 Lecture-02 Video-02
3 Lecture-03 Video-03
4 Lecture-04 Video-04
5 Lecture-05 Video-05
6 Lecture-06 Video-06
7 Lecture-07 Video-07
8 Lecture-08 Video-08
9 Lecture-09 Video-09
10 Lecture-10 Video-10
11 Lecture-11 Video-11
Quiz -01 and Test-1-Obtain Student Feedback
 12 Lecture-12 Video-12
13 Lecture-13 Video-13
14 Lecture-14 Video-14
15 Lecture-15 Video-15
Submission of Assignment-1
16 Lecture-16 Video-16
17 Lecture-17 Video-17
18 Lecture-18 Video-18
19 Lecture-19 Video-19
20 Lecture-20 Video-20
21 Lecture-21 Video-21
Quiz -02 and Test -02
22 Lecture-22 Video-22
23 Lecture-23 Video-23
24 Lecture-24 Video-24
25 Lecture-25 Video-25
26 Lecture-26 Video-26
27 Lecture-27 Video-27
28 Lecture-28 Video-28
29 Lecture-29 Video-29
30 Lecture-30 Video-30
Quiz-03 and Test-03
Submission of Assignment-2
Obtain Student Feedback
Examination Preparation Break
Term/Semester End Examination

4.6 Assessment weight Distribution

Quiz Test Assignment/ SEE Total

PBL/PrBL Marks
Weights/ 15 25 20 40 100
Course
Outcomes
CO1 4 6 4 7 21
CO2 4 6 4 8 22
CO3 3 6 4 8 21
CO4 2 4 4 8 18
CO5 2 3 4 9 18
CO6

4.7 Schedule of Assessment

Assessment Dates Mark COs Quiz Test Assignme SEE

 Type s nt/PBL/
PrBL
Weight 15 25 20 40
Duration 30 min 60 min 6 weeks 3
hours
Quiz-1 5th 6 CO1/
week CO2
Quiz-2 10th 5 CO3/
week CO4
Quiz-3 15th 4 CO5/
week CO6
Test-1 5th 10 CO1/
week CO2
Test-2 10th 8 CO3/
week CO4
Test-3 15th 7 CO5/
week CO6
Assignment- 7th 09 CO
1 week 1-3
Assignment- 14th 11 CO
2 week 4-6
SEE 18th 40 All
Week

4.8 Grading Criterion

 Based on total marks scored grade is Awarded.

If marks scored is:

 91 and above O (outstanding); 81-90 : A+ (Excellent); 71-80: A (Very Good);

61-70: B+ (Good); 51-60 : B (Above Average); 40 -50: C (Average); below
40: D (Not satisfactory)
 If one scores D grade, the candidate is required to re-register for the course if
he/she wants to earn the credit at his/her own convenience

Attainment Calculations:
Recording Marks and Awarding Grades

S. No. USN Student Quiz Test Assignment SEE Marks Grade

Name (15%) (25%) 20% 40% Scored obtained
1
2
3
N
Total XXXXX

Class Average Marks: Total marks of All Students (XXXX)/ Number of

students (N)
Average Grade:

Setting Attainment Targets:

Attainment of Course Outcomes-COs

Outcomes- Targeted Outcomes Level of Observations and
Attainment Remarks
70% of Students will score C grade
and above-1
50% of students will score C grade and
Above-2
40% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
50% of students will score C grade and
Above-2
40% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
50% of students will score C grade and
Above-2
40% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
50% of students will score C grade and
Above-2
40% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
50% of students will score C grade and
Above-2
40% of students will score C grade and
above-3
70% of Students will score C grade
and above-1
50% of students will score C grade and
Above-2
40% of students will score C grade and
above-3

Performance Recording

Acad Progr Semes Sect Course Course Title

emic am: ter ion Code Web Technology Lab
Year B.Sc., UC24CSP3
2023 in III A 5 Course Tutor/s:
-24 Comp Tutor’s ID/Department:
uter
Scien
ce
Total Numb Numb Clas O- A+ A B+ B C D
Num er of er of s Grader Graders Grader Grader Grader Grader Gra
ber Stude Studen Ave s s s s ders
of nts ts - rage >= 91 81<=M 71<= 40<= M<
stude appea Passed Mar <=90 M<=8 61<= 51<= M<=5 40
nts in red all the ks 0 M<=7 M<=6 0
the for all compo 0 0
Class the nent
comp of
onents Exami
of nation
Asses
sment
60 58 54 58 4 8 10 14 10 8 4
B
Gra
de
CO1- Performance

CO2- Performance

CO3- Performance

CO4- Performance

CO5- Performance

CO6- Performance
 Performance Plotting

CO-1 Distribution CO-2 Distribution CO-3 Distribution

CO-4 Distribution CO-5 Distribution CO-6 Distribution

Mapping of Course Outcomes with Program Outcomes

P P P P P P P P P PO PO PO PS PS PS
O1 O2 O3 O4 O5 O6 O7 O8 O9 10 11 12 O1 O2 O3
C 1
O1
C 1
O2
C 2 2
O3
C 2 2
O4
C 1 1
O5
C 1 1
O6

6. Other Details

4.1 Assignment Details or Problem Based Learning

Assignments will be given at the beginning of each block period and students can
continuously work on assignment and submit at the end of the block period as per the
format provided.
4.2 Academic Integrity Policy: Students are required to strictly follow academic
honesty and integrity. Copying and plagiarism in any form for any of the assessment
components will result in zero marks.
 Course Document

Course Code UC24CSC36

Course Title Computer Organization and Architecture
Program Code SCS02
Program Title B.sc-Computer Science
Department Faculty of Computing and IT
Faculty Code C
Faculty Title Computing and IT (FCIT)
Department offering the Computer Science
Course
Faculty Member Prof. Shamina M. Attar
Semester Duration Weeks (1-16) -Teaching, Learning and Continuous
Assessment
Weeks (17-18) -SEE
Weeks (19-20)- Announcement of Results

6. Course Size

Credits L T P Hours/Week
3 4 0 0 4

Total Term/ Semester hours: 45

7. Course Details

2.6 Course Aims and Summary

 What is a digital circuit, its applications, and significance.
 Decimal and binary numbers, Decimal-to-Binary conversion.
 Binary Arithmetic, 1’s and 2’s Complements of Binary Numbers.
 Signed numbers, Arithmetic operations with signed numbers.
 Hexadecimal Numbers, Octal numbers, Binary Coded Decimal (BCD), Digital
Codes.
 he Inverter, AND Gate, OR gate, NAND Gate, NOR Gate.
 Exclusive-OR and Exclusive-NOR Gates, Basics of Digital Integrated Circuits.
 Boolean Operations and Expressions, Laws and Rules of Boolean Algebra.
 De Morgan’s Theorems, Boolean Analysis of Logic Circuits.
 Simplification Using Boolean Algebra, Standard Forms of Boolean Expressions.
 Boolean Expressions and Truth Tables, The Karnaugh Map.
 Karnaugh Map SOP Minimization, POS Minimization.
 Combinational Logic: Introduction, Design Procedure, Adders, Subtractors.
 Sequential Logic: Introduction, Flip-Flops.
 Registers: Introduction, Registers, and Shift Registers.
 Computer types, Functional Units, Basic Operational Concepts.
  Bus Structures and Performance.
 Some Basic Concepts, Semiconductor RAM Memories, and Read-Only
Memories.

2.7Course Objectives
The objectives of this course are to:
4. Gain a foundational understanding of digital circuits, their applications, and the
rationale for their usage in various fields.
5. Proficiently apply Boolean algebra, logic gates, and simplification methods
to analyze and optimize digital logic circuits.
6. Develop skills in designing and analyzing combinational logic circuits,
sequential logic circuits using flip-flops, and understanding the applications
of registers

2.8 Course Outcomes

After undergoing this course students will be able to:

CO1 Develop a solid foundation in digital electronics, understanding the

principles, applications, and significance of digital circuits in various fields.
CO2 Demonstrate proficiency in working with decimal and binary numbers,
executing Decimal-to-Binary conversions, performing binary arithmetic, and
interpreting different digital codes.
CO3 Apply the functionalities of logic gates, understand Boolean algebra laws,
and utilize De Morgan’s Theorems for logical analysis and simplification,
leading to optimized circuit designs.
CO4 Design and analyze combinational logic circuits, including adders and
subtractors, and sequential logic circuits using flip-flops, showcasing
practical problem-solving skills.
CO5 Comprehend the basic structure of computers, identify functional units,
evaluate computer performance, and understand memory systems, including
semiconductor RAM and Read-Only Memories.
CO6 Formulate and simplify Boolean expressions, analyze truth tables, and
utilize Karnaugh Maps for both SOP and POS minimization, enhancing
logical circuit efficiency.

Outcome Map:
COs PO PO PO PO PO PO PO PO PSO PSO PSO
01 02 03 04 05 06 07 08 1 2 3
CO1 1 1 1 2 1 3 2 3 1 3 2

CO2 3 3 3 3 1 1 3 3 1 2 3
 CO3 1 1 1 1 1 1 1 1 1 1 1

CO4 3 3 1 1 1 1 1 1 1 1 2

CO5 3 1 1 2 1 1 1 1 1 3 2
CO6 2 1 1 2 1 1 1 1 1 1 2

Relevance: 1 high, 2 medium, 3 low

2.9 Course Content

Module1:
Introduction to Digital Electronics, Number systems, Operations and codes:
What is Digital circuit, where are digital circuits are used, why use digital
circuits. Decimal numbers, Binary numbers, Decimal-to-Binary conversion,
Binary Arithmetic, 1’s and 2’s Complements of Binary Numbers, signed
numbers, Arithmetic operations with signed numbers, Hexadecimal Numbers,
Octal numbers, Binary Coded Decimal(BCD), Digital Codes.

Module2:
Logic Gates, Boolean Algebra and Logic Simplification: The Inverter, the
AND Gate, the OR gate, the NAND Gate, the NOR Gate, the Exclusive-OR and
Exclusive-NOR Gates, Basics of Digital Integrated Circuits.Boolean Operations
and Expressions, Laws and Rules of Boolean Algebra, DE Morgan’s Theorems,
Boolean Analysis of Logic Circuits, Simplification Using Boolean Algebra,
Standard Forms of Boolean Expressions, Boolean Expressions and Truth Tables,
The Karnaugh Map, karnaugh Map SOP Minimization, POS Minimization.

Module3:
Combinational Logic, Sequential Logic, Registers: Combinational
Logic: Introduction, Design Procedure, Adders, sub tractors.
Sequential Logic: Introduction, Flip-Flops. Registers: Introduction,
Registers, and Shift Registers.
Module4:
Basic Structure of Computers and the Memory System: Computer types,
Functional Units, Basic Operational Concepts, Bus Structures, and Performance.
Some Basic Concepts, Semiconductor RAM Memories and Read-Only
Memories.

2.10 Course Resources:

Text Book/s:
 Text Book:
 Tokheim “Digital Electronics Principles and Applications”, 6th Edition,
McGraw-Hill, 2014. Chapter 1 (1.1, 1.2, 1.3).
 Thomos L. Floyd, “Digital Fundamentals”, Tenth Edition, Pearson,
2015.Chapters (2.1, 2.2, 2.3, 2.4, 2.5, 2.6, 2.7, 2.8, 2.9, 2.10 and 2.11),
Chapters (3.1 to 3.7) and (4.1 to 4.9).
 M. Morris Mano “ Digital Logic and Computer Design”, Pearson,
2013.Chapters (4.1 to 4.4,6.1 to 6.2 and 7.1 to 7.3).
 Hamacher, Vranesic and Zaky, “Computer Organization”, Fifth
Edition, Tata Mcgraw-Hill,2015.Chapters (1.1, 1.2, 1.3, 1.4 and 1.6),
Chapters (5.1 to 5.3)

References:
 William Gothman, Second Edition, PHI Publisher, 2015 Digital
Electronics: An Introduction To Theory And Practice
 John Morris Digital Electronics, Fifth Edition, 2016.
 Anand Kumar, Fourth Edition, 2014 Fundamentals of Digital Circuits.
 Anil K. Maini, second Edition, 2013,Digital Electronics Principles and Integrated
Circuits.
 David A. Patterson, John L. Hennessy, Fifth Edition, Morgan Kaufmann.
Computer Organization and Design.
5. Teaching and Assessment

5.1 Teaching Plan

Lecture Lecture Topic Lecture Slides Lecture

Number Videos
0 Faculty Introduction ,Student Lecture-00 Video-00
Introduction and about Subject
Issue-Assignment 1 and Assignment-2 Statements
1 What is Digital circuit, whereare Lecture-01 Video-01
digital circuits are used, why use
digital circuits.
2 Applications, and significance of Lecture-02 Video-02
digital circuits.
3 Significance of digital circuits. Lecture-03 Video-03
4 Decimal and binary numbers Lecture-04 Video-04
5 Conversions Lecture-05 Video-05
6 Arithmetic. Lecture-06 Video-06
7 Complements, signed numbers Lecture-07 Video-07
8 Hexadecimal, octal Lecture-08 Video-08
9 BCD, and other codes. Lecture-09 Video-09
10 Inverter, AND, OR, NAND, NOR Lecture-10 Video-10
gates.
11 Inverter, AND, OR, NAND, NOR Lecture-11 Video-11
gates.
12 Inverter, AND, OR, NAND, NOR Lecture-12 Video-12
gates.
13 Inverter, AND, OR, NAND, NOR Lecture-13 Video-13
gates.
Quiz -01 and Test-1-Obtain Student Feedback
14 Boolean operations Lecture-14 Video-14
15 Expressions Lecture-15 Video-15
16 Laws of Boolean Algebra Lecture-16 Video-16
17 Laws of Boolean Algebra Lecture-17 Video-17
Submission of Assignment-1
18 De Morgan’s Theorems Lecture-18 Video-18
19 simplification using Boolean Lecture-19 Video-19
Algebra
20 simplification using Boolean Lecture-20 Video-20
Algebra
21 simplification using Boolean Lecture-21 Video-21
Algebra
22 Standard forms Lecture-22 Video-22
23 Boolean expressions Lecture-23 Video-23
Quiz -02 and Test -02
24 Truth tables Lecture-24 Video-24
25 Karnaugh Map. Lecture-25 Video-25
26 Design procedure and adders Lecture-26 Video-26
27 Design procedure and adders Lecture-27 Video-27
28 Design procedure and adders Lecture-28 Video-28
29 Design procedure and adders Lecture-29 Video-29
30 Introduction to flip-flops. Lecture-30 Video-30
31 Introduction to flip-flops. Lecture-31 Video-31
32 Introduction to flip-flops. Lecture-32 Video-32
33 Introduction to flip-flops Lecture-33 Video-33
34 Registers and shift registers. Lecture-34 Video-34
35 Registers and shift registers. Lecture-35 Video-35
36 Registers and shift registers. Lecture-36 Video-36
37 Registers and shift registers. Lecture-37 Video-37
38 Types of computers Lecture-38 Video-38
39 Functional units. Lecture-39 Video-39
40 Basic operational concepts Lecture-40 Video-40
41 Bus structures Lecture-41 Video-41
42 performance. Lecture-42 Video-42
43 Some basic concepts Lecture-43 Video-43
44 Semiconductor RAM memories Lecture-44 Video-44
45 Read-Only Memories (ROMs). Lecture-45 Video-45
Quiz-03 and Test-03
Submission of Assignment-2
Obtain Student Feedback
Examination Preparation Break
Term/Semester End Examination
4.9 Assessment weight Distribution

Quiz Test Assignment/ SEE Total

PBL/PrBL Marks
Weights/ 15 25 20 40 100
Course
Outcomes
CO1 3 5 3 5 16
CO2 3 5 3 7 18
CO3 3 5 3 7 18
CO4 2 3 3 7 15
CO5 2 3 4 7 16
CO6 2 4 4 7 17

4.10 Schedule of Assessment

Assessment Dates Mark COs Quiz Test Assignme SEE

Type s nt/PBL/
PrBL
Weight 15 25 20 40
Duration 30 min 60 min 6 weeks 3
hours
Quiz-1 5th 6 CO1/
week CO2
Quiz-2 10th 5 CO3/
week CO4
Quiz-3 15th 4 CO5/
week CO6
Test-1 5th 10 CO1/
week CO2
Test-2 10th 8 CO3/
week CO4
Test-3 15th 7 CO5/
week CO6
Assignment- 7th 09 CO
1 week 1-3
Assignment- 14th 11 CO
2 week 4-6
SEE 18th 40 All
Week

4.11 Grading Criterion

 Based on total marks scored grade is Awarded.

If marks scored is:
  91 and above O (outstanding); 81-90 : A+ (Excellent); 71-80: A (Very Good);
61-70: B+ (Good); 51-60 : B (Above Average); 40 -50: C (Average); below
40: D (Not satisfactory)
 If one scores D grade, the candidate is required to re-register for the course if
he/she wants to earn the credit at his/her own convenience

Attainment Calculations:
Recording Marks and Awarding Grades

S. No. USN Student Quiz Test Assignment SEE Marks Grade

Name (15%) (25%) 20% 40% Scored obtained
1
2
3

N
Total XXXXX

Class Average Marks: Total marks of All Students (XXXX)/ Number of

students (N)
Average Grade:

Setting Attainment Targets:

Attainment of Course Outcomes-COs

Outcomes- Targeted Outcomes Level of Observations and
Attainment Remarks
70% of Students will score C grade and
above-1
60% of students will score C grade
and Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade and
above-1
60% of students will score C grade
and Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade and
above-1
60% of students will score C grade
and Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade and
above-1
60% of students will score C grade
and Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade and
above-1
60% of students will score C grade
and Above-2
50% of students will score C grade and
above-3
70% of Students will score C grade and
above-1
60% of students will score C grade
and Above-2
50% of students will score C grade and
above-3

Performance Recording

Acad Progr Semes Sect Course Course Title

emic am: ter ion Code Internet of Things
Year B.Sc., UC24DSC4
2023 in IV A 6 Course Tutor/s:
-24 Data Tutor’s ID/Department:
Scien
ce
Total Numb Numb Clas O- A+ A B+ B C D
Num er of er of s Grader Graders Grader Grader Grader Grader Gra
ber Stude Studen Ave s s s s ders
of nts ts - rage >= 91 81<=M 71<= 40<= M<
stude appea Passed Mar <=90 M<=8 61<= 51<= M<=5 40
nts in red all the ks 0 M<=7 M<=6 0
the for all compo 0 0
Class the nent
comp of
onents Exami
of nation
Asses
sment
60 58 54 58 4 8 10 14 10 8 4
B
Gra
de
CO1- Performance
CO2- Performance

CO3- Performance

CO4- Performance

CO5- Performance

CO6- Performance

Performance Plotting

CO-1 Distribution CO-2 Distribution CO-3 Distribution

CO-4 Distribution CO-5 Distribution CO-6 Distribution

Mapping of Course Outcomes with Program Outcomes

P P P P P P P P P PO PO PO PS PS PS
O1 O2 O3 O4 O5 O6 O7 O8 O9 10 11 12 O1 O2 O3
C 1
O1
C 1
O2
C 2 2
O3
C 2 2
O4
C 1 1
O5
C 1 1
O6
7. Other Details

4.3 Assignment Details or Problem Based Learning

Assignments will be given at the beginning of each block period and students can
continuously work on assignment and submit at the end of the block period as per the
format provided.
4.4 Academic Integrity Policy: Students are required to strictly follow academic honesty
and integrity. Copying and plagiarism in any form for any of the assessment components
will result in zero marks.