Course Document

Course Code UC24CSC11

Course Title Programming in C
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 Course Computers Science
Faculty Member Prof. Suhasini S
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: 45

2. Course Details

2.1 Course Aims and Summary

1. To provide a strong foundation in programming concepts: C programming is

considered the basis for learning other high-level programming languages. It aims to
teach the fundamental concepts of programming, such as variables, data types, control
structures, functions, and arrays.
2. To enhance problem-solving skills: C programming helps in developing strong
problem-solving and logical thinking skills. It teaches students how to plan and break
down complex problems into smaller, more manageable tasks, which can then be
implemented using C programming constructs.
3. C programming in BCA aims to provide students with a solid foundation in
programming concepts, problem-solving skills, system-level programming
knowledge, and algorithmic thinking. It serves as a stepping stone for further learning
and specialization in the field of computer science and software development.

2.2 Course Objectives

The objectives of the Course are:

 To understand the fundamentals of C programming language, including syntax, data types,
variables, and control structures.
 To learn how to write efficient and effective code using C programming constructs.
 To understand the concepts of functions, arrays, and pointers in C programming.
 To develop problem-solving skills by designing and implementing algorithms using C
programming.
 To learn how to work with files and input/output operations in C programming.
 To gain hands-on experience in debugging and testing C programs for errors and
troubleshooting.
 To practice implementing data structures and algorithms using C programming language.
 To learn how to optimize code and improve performance in C programming.
 To understand the concepts of memory management and dynamic memory allocation in C
programming.
 To develop effective coding practices and understand the importance of code documentation
and comments in C programming.
 Understand input and output operations in C, including file handling, to enable interaction
with external data sources and destinations.
 Learn to design and implement modular programs through functions, enabling code
organization, reusability, and maintenance.
 Gain insight into the concepts of memory allocation, deallocation, and manipulation, as well
as pointers and dynamic memory allocation, enabling efficient resource utilization.
 Acquire a solid foundation in the syntax, semantics, and structure of the C programming
language, including variables, data types, operators, and control flow constructs.
 Enhance problem-solving abilities by learning to formulate and implement algorithms using
C, fostering logical and algorithmic thinking essential for software development.
 Dive into advanced C programming concepts such as structures, unions, enumerations, and
pre processor directives, expanding the range of problem-solving tools.

2.3 Course Outcomes

After undergoing this course students will be able to:

CO1 Understand the fundamental principles of programming.
CO2 Analyze the importance of algorithms and problem-solving and Acquire a
solid understanding of C syntax and semantics.
CO3 Understand programming languages, number systems, peripheral devices,
networking, multimedia and internet concepts
CO4 Illustrate advanced concepts of memory management using malloc, calloc,
and realloc.
CO5 Explore commonly used C libraries and their functions.
CO6 Implement the C code for a given problem and Write programs that perform
operations on arrays

Outcome Map:
COs PO PO2 PO PO PO PO PO PO PS PS PS
01 03 04 05 06 07 08 O1 O2 O3

CO1 2 1 2 1 2 3 3 3 2 2 3
CO2 1 1 2 2 3 2 3 3 2 2 3
CO3 2 2 1 1 2 3 3 3 3 2 2
CO4 2 1 1 3 2 3 3 3 2 3 2
CO5 3 2 2 3 3 2 2 2 3 3 2
CO6 2 2 2 3 3 3 2 2 3 2 3
Relevance: 1 high, 2 medium, 3 low

2.4 Course Content

MODULE1: Introduction to C Programming

Overview of C; History and Features of C; Structure of a C Program with Examples;
Creating and Executing a C Program; Compilation process in C. C Programming
Basic Concepts:C Character Set; C tokens-keywords, identifiers, constants, and
variables; Datatypes; Declaration & initialization of variables; Symbolic constants.
Input and output with C:Formatted I/O functions – printf and scanf, control stings and
escape sequence ,output specifications with printf functions ;Unformatted I/O
functions to read and display single character and a string-getchar, putchar, gets and
puts functions.
MODULE 2:C Operators &Expressions
Arithmetic operators; Relational operators; Logical operators;Assignment
operators;Increment & Decrement operators; Bitwise operators; Conditional operator;
Special operators; Operator Precedence and Associatively; Evaluation of arithmetic
expressions; Type conversion
Decision making Statements-Simple if, if_else, nested if_else, else_if ladder, Switch
Case, goto, break &continue statements; Looping Statements-Entry controlled and
exit controlled statements, while, do-while, for loops, Nested loops.

MODULE 3:Arrays
One Dimensional arrays - Declaration, Initialization and Memory representation;
Two Dimensional arrays -Declaration, Initialization and Memory representation.
Strings : Declaring & Initializing string variables; String handling functions-strlen,
strcmp, strcpy and strcat; Character handling functions - toascii, toupper, tolower,
isalpha, isnumeric etc
MODULE 3: Pointers in C
 Understanding pointers - Declaring and initializing pointers, accessing address and
value of variables using pointers; Pointers and Arrays; Pointer Arithmetic;
Advantages and disadvantages of using pointers;

MODULE 4: User Defined Functions

Need for user defined functions; Format of C user defined functions; Components of
user defined functions - return type, name ,parameter list, function body, return
statement and function call; Categories of user defined functions-With and without
parameters and return type.
User defined data types: Structures-Structure Definition, Advantages of Structure,
declaring structure variables, accessing structure members, Structure members
initialization, comparing structure variables, Array of Structures; Unions – Union
definition; difference between Structures and Unions.

2.5 Course References

Text Book:
• Herbert Schildt, 4th Edition ,The Complete Reference of C
• M.T Somashekara, D.S Guruand K.S Manjunatha: Problem solving with C,PHI
publication
• Brain W.Kernighan : C Programming Language
• Kernighan & Ritchie: The C Programming Language(PHI)

• References:
• P.K.Sinha & PritiSinha: Computer Fundamentals(BPB)
• E.Balaguruswamy: Programming in ANSIC(TMH)
• Kamthane: Programming with ANSI and TURBOC(PearsonEducation)
• V.Rajaraman: Programming in C(PHI–EEE)
• www.w3school.com

3. Teaching and Assessment

3.1 Teaching Plan

Lecture Lecture Topic Lecture Lecture

Numbe Slides Videos
r
0 Faculty introduction ,student introduction and Lecture-00 Video-00
subject introduction
1 Overview of C, History and Features of C. Lecture-01 Video-01
2 Structure of a C Program with Examples, Lecture-02 Video-02
Creating and Executing a C Program,
Compilation process in C.
3 C Programming Basic Concepts - C Character Lecture-03 Video-03
Set
4 C tokens, Data types Lecture-04 Video-04
5 Declaration & initialization of variables Lecture-05 Video-05
6 Symbolic constants, Input and output with C. Lecture-06 Video-06
7 Formatted I/O functions – printf and scanf Lecture-07 Video-07
8 control strings and escape sequences Lecture-08 Video-08

9 Output specifications with printf functions. Lecture-09 Video-09

10 C Operators & Expressions - Arithmetic Lecture-10 Video-10
operators
11 Relational operators, Logical operators. Lecture-11 Video-11
Issue -Assignment 1 and Assignment-1 Statements
12 Assignment operators Lecture-12 Video-12
13 Increment & Decrement operators Lecture-13 Video-13
14 Bitwise operators. Lecture-14 Video-14
15 Conditional operator Lecture-15 Video-15
Submission of Assignment-1
Quiz-01 and Test-1-Obtain Student Feedback
16 Special operators, Operator Precedence, and Lecture-16 Video-16
Associativity.
17 Evaluation of arithmetic expressions, Lecture-17 Video-17
18 Type conversion. Lecture-18 Video-18
19 Control Structures Lecture-19 Video-19
20 Decision-making Statements Simple if, if_else Lecture-20 Video-20
21 nested if_else, else_if ladder Lecture-21 Video-21
22 Switch Case. Lecture-22 Video-22
23 Goto, Break & Continue statements, Lecture-23 Video-23
24 Looping Statements (while, do-while, for Lecture-24 Video-24
loops).
25 Nested loops Lecture-25 Video-25
26 One Dimensional arrays introduction Lecture-26 Video-26
27 Declaration, Initialization, and Memory Lecture-27 Video-27
representation.
Issue -Assignment 2 and Assignment-2 Statements
28 Strings - Declaring & Initializing string Lecture-28 Video-28
variable
29 String handling functions (strlen, strcmp, Lecture-29 Video-29
strcpy, strcat).
30 Character handling functions - toascii, toupper, Lecture-30 Video-30
tolower
Submission of Assignment-1
Quiz-02 and Test-2-Obtain Student Feedback
31 isalpha, isnumeric, etc. Lecture-31 Video-31
32 Pointers in C - Understanding pointers, Lecture-32 Video-32
Declaring and initializing pointers.
 33 Accessing address and value of variables using Lecture-33 Video-33
pointers,
34 Pointer and Arrays. Lecture-34 Video-34
35 Pointer Arithmetic, Lecture-35 Video-35
36 Advantages and disadvantages of using Lecture-36 Video-36
pointers.
37 User Defined Functions - Need for user-defined Lecture-37 Video-37
functions
38 Format of C user-defined functions. Lecture-38 Video-38
39 Components of user-defined functions - return Lecture-39 Video-39
type, name
40 parameter list, function body, return statement, Lecture-40 Video-40
and function call.
Issue -Assignment 3 and Assignment-3 Statements
41 Categories of user-defined functions - With and Lecture-41 Video-41
without parameters and return type.
42 User-defined data types - Structures, Structure Lecture-42 Video-42
Definition, Advantages of Structure.
43 Declaring structure variables, Accessing Lecture-43 Video-43
structure members.
44 Structure members initialization, Comparing Lecture-44 Video-44
structure variables.
45 Array of Structures, Unions – Union definition, Lecture-45 Video-45
Difference between Structures and Unions.
Quiz-03 and Test-03
Submission of Assignment-2
Obtain Student Feedback
Examination Preparation Break
Term/Semester End Examination

3.2 Assessment weight Distribution

Quiz Test Assignment/ SEE Total

Marks
PBL/PrBL
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.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
th
Quiz-2 10 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
th
Assignment- 14 11 CO
2 week
4-6
SEE 18th 40 All
Week

3.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 Studen Quiz Test Assignmen SEE Marks Grade

t Name (15%) (25%) t 40% Scored obtained
 20%

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 B 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 Semest Sect Course Course Title

emic m: er ion Code
Year Programming with C
B.Tec XXYYZZH1 Course Tutor/s:
2023 h., in 1
-24 Comp I A Tutor’s ID/Department:
uter
Scienc
e and
Engin
eering
Total Numb Numb Clas O- A+ A B+ B C D
Num er of er of s Graders Graders Grader Grader Grader Gra
ber Studen Studen Ave s s Grader ders
of ts ts - rage >= 91 81<= s
stude appear Passed Mar M<=90 M<
nts in ed for all the ks 71<= 40<= 40
the all the compo M<=8 61<= 51<= M<=5
Class compo nent of 0 M<=7 M<=6 0
nents Exami 0 0
of nation
Assess
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

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

PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3

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 mark

Course Document

Course Code UC24AIP12

Course Title C Programming Lab
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 Computers Science
Course
Faculty Member Prof. Suhasini S
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 3

Total Term/ Semester hours: 30

2. Course Details
 2.1 Course Aims and Summary

1. To provide a strong foundation in programming concepts: C programming is

considered the basis for learning other high-level programming languages. It aims to
teach the fundamental concepts of programming, such as variables, data types, control
structures, functions, and arrays.
2. To enhance problem-solving skills: C programming helps in developing strong
problem-solving and logical thinking skills. It teaches students how to plan and break
down complex problems into smaller, more manageable tasks, which can then be
implemented using C programming constructs.

2.2 Course Objectives

The objectives of the Course are:

• Understand the fundamental concepts of programming, including variables, data
types, operators, and control structures.
• Develop proficiency in writing simple C programs.
• Enhance problem-solving abilities by designing algorithms and implementing
solutions in C for various computational problems.
• Explore and utilize functions from the math.h library to perform mathematical
operations in C programs.
• Implement programs to check for prime numbers and generate a specified number
of prime numbers.
• Develop programs to manipulate numbers, including finding the sum of digits,
reversing a number, and checking for palindrome.
• Create programs that read input continuously until a specific condition (e.g., user
input 999) and calculate relevant results.
• Demonstrate the use of if-else and else-if ladder statements for decision-making in
C programs.
• Implement a program to find the roots of a quadratic equation, showcasing the use
of the switch case statement.
• Explore single-dimensional arrays by writing programs to calculate the average of
marks and remove duplicate elements.
• Develop programs for matrix addition and subtraction, showcasing skills in
handling multi-dimensional arrays.
• Understand and apply pointer concepts, including swapping two numbers and
reversing a string using pointers.
 2.3 Course Outcomes

After undergoing this course students will be able to:

CO1 Demonstrate a clear understanding of the basic concepts of programming in
the C language.
CO2 Demonstrate proficiency in writing and editing C programs using an
integrated development environment (IDE) or a text editor and a compiler.
CO3 Implement functions, arrays, and data structures in C to solve various
computational problems.
CO4 Understand and apply memory management concepts, including dynamic
memory allocation and de allocation.
CO5 Demonstrate professionalism in coding practices, project management, and
teamwork.
CO6 Implement loop structures to create programs that repeat a set of
instructions, such as checking for prime numbers and generating a list of
primes.

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

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

Relevance: 1 high, 2 medium, 3 low

2.4 Course Content

PART – A
 Program to read radius of a circle and to find area and circumference
 Program to read three numbers and find the biggest of three number
 Program to demonstrate library functions in math .h
 Program to check for prime
 Program to generate n primes
 Program to read a number, find the sum of the digits, reverse the number and
check it for palindrome.
  Program to read numbers from keyboard continuously till the user presses
999 and to find the sum of only positive numbers
 Program to read percentage of marks and to display appropriate
message (Demonstration of else-if ladder)
 Program to find the roots of quadratic equation (demonstration of switch
Case statement)
 Program to read marks scored by n students and find the average of marks
(Demonstration of single dimensional array)
 Program to remove Duplicate Element in a single dimensional Array
 Program to perform addition and subtraction of Matrices

PART – B

 Program to find the length of a string without using built-in function

 Program to demonstrate string functions.
 Program to demonstrate pointers in C
 Program to check a number for prime by defining is prime() function
 Program to read, display and to find the trace of a square matrix
 Program to read, display and add two m x n matrices using functions
 Program to read, display and multiply two m x n matrices using function
 Program to read a string and to find the number of alphabets, digits, vowels,
consonants, spaces and special characters.
 Program to Reverse a String using Pointer
 Program to Swap Two Numbers using Pointers
 Program to demonstrate student structure to read & display records of n
students.
 Program to demonstrate the difference between structure & union.

2.5 Course References

Text Book/s:

• Ellis Horowitz and Sartaj Sahni: Fundamentals of Data Structures

• Kamathane: Introduction to Data Structures(Pearson Education)

• Kottur: Data Structure using C

References:

• Tanenbaum: Data Structure using C(Pearson Education)

• Y. Kanitkar: Data Structures using C(BPB)
• Padma Reddy: Data Structure using C
• Sudipa Mukherjee: Data Structure using C – 1000 Problems and Solutions (McGraw Hill
Education,2007)
3. Teaching and Assessment

3.1 Teaching

Lecture Lecture Topic Lecture Slides Lecture Videos

Number
0 Program to read radius of a Lecture-00 Video-00
circle and to find area and
circumference
Issue-Assignment 1 and Assignment-2 Statements
1 Program to read three Lecture-01 Video-01
numbers and find the biggest
of three numbers

2 Program to demonstrate Lecture-02 Video-02

library functions in math .h
3 Program to check for prime Lecture-03 Video-03
4 Program to generate n primes Lecture-04 Video-04
5 Program to read a number, Lecture-05 Video-05
find the sum of the digits,
reverse the number and
check it for palindrome.
6 Program to read a number, Lecture-06 Video-06
find the sum of the digits,
reverse the number and
check it for palindrome.
7 Program to read numbers Lecture-07 Video-07
from keyboard continuously
till the user presses 999 and
to find the sum of only
positive numbers
8 Program to read percentage Lecture-08 Video-08
of marks and to display
appropriate message
(Demonstration of else-if
ladder)
9 Program to read percentage Lecture-09 Video-09
of marks and to display
appropriate message
(Demonstration of else-if
ladder)
10 Program to find the roots of Lecture-10 Video-10
quadratic equation
(demonstration of switch
Case statement)
11 Program to find the roots of Lecture-11 Video-11
quadratic equation
 (demonstration of switch
Case statement)
Quiz -01 and Test-1-Obtain Student Feedback
12 Program to read marks Lecture-12 Video-12
scored by n students and find
the average of marks
(Demonstration of single
dimensional array)
13 Program to read marks Lecture-13 Video-13
scored by n students and find
the average of marks
(Demonstration of single
dimensional array)
14 Program to remove Duplicate Lecture-14 Video-14
Element in a single
dimensional Array
15 Program to remove Duplicate Lecture-15 Video-15
Element in a single
dimensional Array
Submission of Assignment-1
16 Program to perform addition Lecture-16 Video-16
and subtraction of Matrices
17 Program to find the length of Lecture-17 Video-17
a string without using built-in
function
18 Program to demonstrate Lecture-18 Video-18
string functions
19 Program to demonstrate Lecture-19 Video-19
pointers in C
20 Program to check a number Lecture-20 Video-20
for prime by defining is
prime() function
21 Program to read, display and Lecture-21 Video-21
to find the trace of a square
matrix
Quiz -02 and Test -02
22 Program to read, display and Lecture-22 Video-22
add two m x n matrices using
functions
23 Program to read, display and Lecture-23 Video-23
multiply two m x n matrices
using function
24 Program to read a string and Lecture-24 Video-24
to find the number of
alphabets, digits, vowels,
consonants, spaces and
special characters.
25 Program to Reverse a String Lecture-25 Video-25
using Pointer
26 Program to Reverse a String Lecture-26 Video-26
 using Pointer
27 Program to Swap Two Lecture-27 Video-27
Numbers using Pointers
28 Program to demonstrate Lecture-28 Video-28
student structure to read &
display records of n students
29 Program to demonstrate Lecture-29 Video-29
student structure to read &
display records of n students
30 Program to demonstrate the Lecture-30 Video-30
difference between structure
& union.
Quiz-03 and Test-03
Submission of Assignment-2
Obtain Student Feedback
Examination Preparation Break
Term/Semester End Examination

3.2. Assessment weight Distribution

Quiz Test Assignment/ SEE Total
Marks
PBL/PrBL
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

3.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
th
Quiz-1 5 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
th
Test-2 10 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
th
SEE 18 40 All
Week

3.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 Studen Quiz Test Assignmen SEE Marks Grade

t Name (15%) (25%) t 40% Scored obtained
20%

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 Progra Semest Sect Course Course Title

emic m: er ion Code
Year Artificial Intelligence and machine learning
B.Sc., UC24AIC3 Course Tutor/s:
2023- in 3
24 Artific III A Tutor’s ID/Department:
ial
Intelli
gence
and
Data
Analyt
ics
Total Numb Numbe Clas O- A+ A B+ B C D
Num er of r of s Grader Graders Grader Grader Grader Gra
ber Studen Studen Ave s s s Grader ders
of ts ts - rage 81<= s
stude appear Passed Mar >= 91 M<=90 M<
nts in ed for all the ks 71<= 40<= 40
the all the compo M<=8 61<= 51<= M<=5
Class compo nent of 0 M<=7 M<=6 0
nents Exami 0 0
of nation
Assess
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

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

PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3

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 UC24CSC12

Course Title Fundamentals of computer
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 Computers Science
Course
Faculty Member Prof. Teja H
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: 45

2. Course Details

2.1 Course Aims and Summary

1. The Aim of course of fundaments of computer course is to provide students with a

comprehensive understanding of the foundational principles and concept that underlie
the field of computer application.
2. The course aims to equip students with essential knowledge required to comprehend
and engage with various aspects to computing, including hardware, software,
algorithms, problem solving methodologies.
3. The fundaments of computer application introduces students to core elements of
computing covering topics such as computer architecture, programming languages,
data representation ,and algorithm thinking through theoretical concepts ,students will
develop the skills necessary to analyze and solve computational problem.

2.2 Course Objectives

The objectives of the Course are:

 To introduce Computer Definition and Characteristics of Computer
 To introduce evolution and generation of Computers, basic organization of a digital
Computer
 To define functions and components of a Computer, Central Processing Unit,
Microprocessor, Storage Unit, Input and Output devices
 To introduce how CPU and Memory works
 To understand classification of digital computers
 To define systems Microcomputers, Minicomputers, Mainframes, Supercomputers
 To define number systems different types conversion from one number system to another
 To explain Computer codes BCD, Gray code, ASCII, Unicode
 To introduce Boolean Algebra-Boolean operators with truth tables
 To explain binary arithmetic, binary addition, binary subtraction, compliment of a binary
number.
 To understand Computer Languages-Machine level, Assembly level and High level
languages
 To understand Translator programs-Assembler, Interpreter and Compiler
 To introduce planning a computer program-Algorithm and Flowcharts, pseudo code with
examples
 To define Operating system fundamentals
 To define Operating systems introduce functions of an operating system
  To understand classification of operating systems, system programs
 To define applications programs, utilities
 To explain Unix Operating Systems, basic commands (cal, date, bc, echo, who, is, pwd,
cd, mkdir, rmdir
 To work commands with files(cat, cp, rm, mv,file, wc, head, tail
 To introduce database management system
 To define database DBMS , why database file system vs DBMS
 To explain database application, database users
 To introduce SQL, Classification of SQL-DDL,DML,DCL,TCL
 To understand basics of internet
 To introduce features of internet, internet applications services of internet
 To understand logical and physical addresses, internet service provider, domain name
system
 To introduce web basics-introduction to web, web browsers, http/https, URL

2.3 Course Outcomes

After undergoing this course students will be able to:

CO1 Understand the basic concepts of fundamental computer
including hardware, software, and operating systems
CO2 Implement to organize , manage, and retrieve information
effectively using file systems
CO3 Develop an awareness of cyber security threats and basic
practices to protect computer systems and data
CO4 Understand the Internet basics, features, applications,
services, internet service providers, domain name system
CO5 Analyze the Web Programming basics, introduction of HTML and CSS
programming
CO6 Explain problem solving skills through the application of trouble shooting
techniques

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 1 1 2 3 3 2 1 3 3
CO2 1 2 2 1 3 3 2 1 3 3 2
CO3 2 1 2 2 3 1 1 2 2 2 3
CO4 2 3 3 1 2 2 1 1 3 3 2
CO5 1 1 2 2 3 2 1 1 3 2 2
CO6 1 2 3 3 2 3 1 1 3 3 3
Relevance: 1 high, 2 medium, 3 low
2.4 Course Content

Module 1:Introduction to Computers

Computer Definition, Characteristics of Computers, Evolution and History of
Computers, Basic Organization of a Digital Computer; Functions & Components of a
Computer, Central Processing Unit, Microprocessor, Storage units, Input and output
Devices. How CPU and memory works. Types of Computers: microcomputer,
minicomputer, super computer, mainframe computer.
Module 2:Anatomy of Computer
Types of Software–System Software and Utility Software; Computer Languages -
Machine Level, Assembly Level &High Level Languages, Translator Programs –
Assembler, Interpreter and Compiler; Planning a Computer Program -Algorithm,
Flowchart and Pseudocode with Examples.
Number Systems – different types, conversion from one number system to another;
Computer Codes – BCD, Gray Code, ASCII and Unicode; Boolean Algebra – Boolean
Operators with Truth Tables; Binary Arithmetic: Binary Addition, Binary Subtraction,
Complement of a Binary number.
Module 3: Operating System Fundamentals
Operating Systems: Introduction, Functions of an operating System, Classification of
Operating Systems, System programs, Application programs, Utilities, The Unix
Operating System, Basic Unix commands

Module 4: Introduction to Database Management Systems

Database, DBMS, Why Database - File system vs DBMS, Database applications,
Database users, Introduction to SQL.
Internet Basics
Introduction, Features of Internet, Internet application, Services of Internet, Logical and
physical addresses, Internet Service Providers, Domain Name System

2.5 Course References

Text Book:
•Pradeep K. Sinha and Priti Sinha: BPB Publication Computer
Fundamentals (Sixth Edition)
•David Riley and Kenny Hunt, Computational thinking for modern
solver, Chapman & Hall / CRC,
References:
• J.GlennBrookshear,”ComputerScience:AnOverview”,Addision-
Wesley,TwelfthEdition,
• R.G. Dromey, “How to solve it by Computer”, PHI
• www.w3school.com

3. Teaching and Assessment

3.1 Teaching Plan
Lecture Lecture Topic Lecture Lecture
Numbe Slides Videos
r
0 Faculty introduction ,student introduction Lecture-00 Video-00
and subject introduction
Issue-Assignment 1 and Assignment-2 Statements
1 Computer Definition, Characteristics of Lecture-01 Video-01
Computers

2 Evolution and History of Computers Lecture-02 Video-02

3 Functions & Components of a Compute Lecture-03 Video-03
4 Central Processing Unit, Microprocessor Lecture-04 Video-04
5 Storage units, Input and Output Devices Lecture-05 Video-05
6 How CPU and memory work Lecture-06 Video-06
7 Types of Computers: Microcomputer, Lecture-07 Video-07
Minicomputer
8 Types of Computers: Supercomputer, Lecture-08 Video-08
Mainframe Computer
9 Types of Software – System Software Lecture-09 Video-09
10 Utility Software Lecture-10 Video-10
11 Computer Languages - Machine Level, Lecture-11 Video-11
12 Assembly Level & High-Level Languages Lecture-12 Video-12
11 Translator Programs – Assembler, Lecture-11 Video-11
Interpreter, and Compiler
Issue-Assignment 1 and Assignment-1 Statements
12 Planning a Computer Program Lecture-12 Video-12
13 Algorithms Lecture-13 Video-13
14 Examples of algorithms Lecture-14 Video-14
15 Flowchart Lecture-15 Video-15
Submission of Assignment-1
Quiz-01 and Test-1-Obtain Student Feedback
16 Examples of Flowcharts Lecture-16 Video-16
17 Pseudocode with Examples Lecture-17 Video-17
18 Number Systems – different types, Lecture-18 Video-18
19 conversion from one number system to Lecture-19 Video-19
another
20 conversion from one number system to Lecture-20 Video-20
another
21 Computer Codes – BCD Lecture-21 Video-21
22 Gray Code, ASCII, and Unicode Lecture-22 Video-22
23 Boolean Algebra – Boolean Operators Lecture-23 Video-23
with Truth Tables
24 Binary Arithmetic: Binary Addition Lecture-24 Video-24
25 Binary Subtraction, Complement of a Lecture-25 Video-25
Binary number
26 Operating Systems: Introduction Lecture-26 Video-26
27 Functions of an Operating System Lecture-27 Video-27
Issue-Assignment 2 and Assignment-2 Statements
28 Classification of Operating Systems Lecture-28 Video-28
29 System programs, Application Lecture-29 Video-29
programs, Utilities
30 Application programs Lecture-30 Video-30
Submission of Assignment-2
Quiz-02 and Test-2-Obtain Student Feedback
31 The Unix Operating System Lecture-31 Video-31
3.2 Assessment weight Distribution

Quiz Test Assignment/ SEE Total

Marks
PBL/PrBL
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.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
th
Quiz-2 10 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
th
Assignment- 14 11 CO
2 week
4-6
 SEE 18th 40 All
Week

3.4 Grading Criterion

 Based on total marks scored grade is Awarded.
If marks score 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 Assignmen SEE Marks Grade

t Name (15%) (25%) t 40% Scored obtained
20%

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 Progra Semest Sect Course Course Title

emic m: er ion Code
Year Programming with C
B.Tec XXYYZZH1 Course Tutor/s:
2023 h., in 1
-24 Comp I A Tutor’s ID/Department:
uter
Scienc
e and
Engin
eering
Total Numb Numb Clas O- A+ A B+ B C D
Num er of er of s Graders Graders Grader Grader Grader Gra
ber Studen Studen Ave s s Grader ders
of ts ts - rage >= 91 81<= s
stude appear Passed Mar M<=90 M<
nts in ed for all the ks 71<= 61<= 51<= 40<= 40
the all the compo M<=8 M<=7 M<=6 M<=5
Class compo nent of 0 0 0 0
nents Exami
of nation
Assess
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

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

 PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3

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 UC24CSP14

Course Title Computer Fundamental Lab
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 Computers Science
Course
Faculty Member Prof. Teja H
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 3

Total Term/ Semester hours: 30

2. Course Details

2.1 Course Aims and Summary

1. The course aims is to provide students with hands-on experience and practical skills in
fundamental concepts related to computer systems, hardware, software, and basic
programming.
2. Computer Fundamentals Lab is designed to complement theoretical knowledge with
practical skills in the field of computer science. The lab sessions cover a range of
topics, including computer hardware components, operating systems, file management.
3. The lab exercises are structured to provide a step-by-step progression, starting with the
basics and gradually advancing to more complex tasks. Emphasis is placed on fostering
a practical understanding of fundamental concepts, promoting problem-solving skills.

3.2 Course Objectives

• Recognize and identify essential computer hardware components, including the
central processing unit (CPU), memory, storage devices, and peripherals.
• Demonstrate the ability to assemble and disassemble a computer system.
 • Install, configure, and manage operating systems, with a focus on fundamental tasks
such as system setup, user management, and file organization.
• Navigate and utilize common features of operating systems for effective system
administration.
• Diagnose and troubleshoot common hardware and software issues that may arise in a
computer system.
• Apply systematic problem-solving techniques to identify and resolve issues
efficiently.
• Develop proficiency in file and directory management, including creating, copying,
moving, and deleting files and folders.
• Understand and use file permissions to control access and security.
• Grasp fundamental programming concepts such as variables, data types, control
structures, and functions.
• Write simple programs in a high-level programming language to solve basic
computational problems.
• Understand basic networking concepts, including IP addressing, subnetting, and
network protocols.
• Recognize and implement basic security measures to protect computer systems from
common threats.
• Practice effective documentation of procedures, troubleshooting steps, and solutions.
• Communicate findings and solutions clearly in written and/or oral formats.
• Work effectively in a team environment during lab exercises, fostering collaboration
and sharing of knowledge.
• Engage in discussions and peer-assessment to enhance collective learning.
• Understand the importance of privacy, intellectual property, and responsible use of
technology.

3.2 Course Outcomes

After undergoing this course students will be able to:
CO1 Understand and able to identify and explain the functions of major hardware
components, assemble and disassemble a computer system, and troubleshoot
common hardware issues.
CO2 Demonstrate the ability to install, configure, and manage operating systems,
perform essential system administration tasks, and troubleshoot common
operating system problems.
CO3 Analyze exhibit competence in file and directory management, including
creating, copying, moving, and deleting files and folders, as well as
understanding and applying file permissions.
CO4 Implement basic security measures, including user authentication, password
management, and an understanding of common security threats.
CO5 Demonstrate ethical standards in computing, demonstrating an
understanding of privacy, intellectual property, and responsible technology
use.
CO6 Analyze the collaborative learning environments, working effectively in
teams during lab exercises, discussions, and peer-assessment activities.
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 1 2 2 1 3 3 3 2 2 2
CO2
2 2 1 3 3 2 2 1 2 3 3
CO3
1 1 2 2 3 3 3 3 2 2 3
CO4
2 3 1 1 2 2 2 3 2 2 2
CO5
2 2 3 3 3 1 1 3 3 2 3
CO6
1 1 2 2 3 2 2 3 2 3 3

Relevance: 1 high, 2 medium, 3 low

3.2 Course Content

 PART – A
 Identification of the peripherals of computer, components in cpu and their functions.
 Assembling and disassembling the system hardware components of personal
computer
 Basic computer hardware trouble shooting
 PLAN and WIFI Basics
 Operating system installation-Windows OS, UNIX/LINUX, Dual Booting
 Installation and Un installation- of software-office Tools, Utility Software(like Anti-
virus system maintenance tools); application software-like photos/images editors,
audio records/editors, video editors)fress ware, shareware, pay ware and trial ware;
internet browser, programming IDES
 System configuration-BIOS Setting, Registry editor, MS config task manager,
system maintenance third –party system maintenance tools (similar to CCleaner and
jv16 PowerTools)

 PART – B
 Activities using word processor software
 Activities using Spreadsheets software
 Activities using Presentation Software
 Activities Involving Multimedia editing(Images, Videos, Audio)
 Program tasks involving internet browsing
 Program to Flowchart: installation and using of flowgarithms software for different
 arithmetic tasks like sum, average, product, difference, quotient and remainder of
given numbers, calculate are of shapes(Square, rectangle, circles and triangle,)arrays
and recursion

2.5 Course References

Text Book/s:

• Ellis Horowitz and Sartaj Sahni: Fundamentals of Data Structures

• References:

• Tanenbaum: Data Structure using C(Pearson Education)

• Kamathane: Introduction to Data Structures(Pearson Education)
• Y. Kanitkar: Data Structures using C(BPB)
• Kottur: Data Structure using C
• Padma Reddy: Data Structure using C
• Sudipa Mukherjee: Data Structure using C – 1000 Problems and Solutions (McGraw Hill
Education,2007)

3. Teaching and Assessment

3.1 Teaching Plan

Lecture Lecture Topic Lecture Slides Lecture Videos

Number
0 Identification of the peripherals Lecture-00 Video-00
of computer, components in
cpu and their functions

Issue-Assignment 1 and Assignment-2 Statements

1 Identification of the peripherals Lecture-01 Video-01
of computer, components in
cpu and their functions
2 Assembling and disassembling Lecture-02 Video-02
the system hardware
components of personal
computer
3 Basic computer hardware Lecture-03 Video-03
trouble shooting
4 Basic computer hardware Lecture-04 Video-04
trouble shooting
5 PLAN and WIFI Basics Lecture-05 Video-05
6 Operating system installation- Lecture-06 Video-06
Windows OS, UNIX/LINUX, Dual
Booting
7 Operating system installation- Lecture-07 Video-07
Windows OS, UNIX/LINUX, Dual
Booting
8 Installation and Un installation- Lecture-08 Video-08
of software-office Tools,
9 Installation and Un installation- Lecture-09 Video-09
of software-office Tools,
10 Utility Software(like Anti-virus Lecture-10 Video-10
system maintenance tools)
11 Utility Software(like Anti-virus Lecture-11 Video-11
system maintenance tools)
Quiz -01 and Test-1-Obtain Student Feedback
12 application software-like Lecture-12 Video-12
photos/images editors, audio
records/editors, video editors
13 application software-like Lecture-13 Video-13
photos/images editors, audio
records/editors, video editors
14 application software-like Lecture-14 Video-14
photos/images editors, audio
records/editors, video editors
15 fress ware, shareware, pay Lecture-15 Video-15
ware and trial ware; internet
browser, programming IDES
Submission of Assignment-1
16 fress ware, shareware, pay Lecture-16 Video-16
ware and trial ware; internet
browser, programming IDES
17 System configuration-BIOS Lecture-17 Video-17
Setting, Registry editor, MS
config task manager
18 System configuration-BIOS Lecture-18 Video-18
Setting, Registry editor, MS
config task manager
19 ystem maintenance third – Lecture-19 Video-19
party system maintenance
tools (similar to CCleaner and
jv16 PowerTools)
20 ystem maintenance third – Lecture-20 Video-20
party system maintenance
tools (similar to CCleaner and
jv16 PowerTools)
21 Program to read, display and to Lecture-21 Video-21
find the trace of a square
matrix
Quiz -02 and Test -02
22 ystem maintenance third – Lecture-22 Video-22
party system maintenance
tools (similar to CCleaner and
jv16 PowerTools)
23 Activities using word processor Lecture-23 Video-23
 software
24 Activities using word processor Lecture-24 Video-24
software.
25 Activities using Spreadsheets Lecture-25 Video-25
software
26 Activities using Spreadsheets Lecture-26 Video-26
software
27 Activities using Presentation Lecture-27 Video-27
Software
28 Activities Involving Multimedia Lecture-28 Video-28
editing(Images, Videos, Audio)
29 Program tasks involving Lecture-29 Video-29
internet browsing Program to
Flowchart: installation and
using of flowgarithms software
for different arithmetic tasks
30 like sum, average, product, Lecture-30 Video-30
difference, quotient and
remainder of given numbers,
calculate are of shapes(Square,
rectangle, circles and
triangle,)arrays and recursion
Quiz-03 and Test-03
Submission of Assignment-2
Obtain Student Feedback
Examination Preparation Break
Term/Semester End Examination

3.2 Assessment weight Distribution

Quiz Test Assignment/ SEE Total Marks

PBL/PrBL
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

3.3 Schedule of Assessment

 Assessment Dates Marks COs Quiz Test Assignmen SEE
Type t/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-1 7th 09 CO
week
1-3
Assignment-2 14th 11 CO
week
4-6
SEE 18th 40 All
Week

3.1 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

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 Progra Semest Sect Course Course Title

emic m: er ion Code
Year Artificial Intelligence and machine learning
B.Sc., UC24AIC3 Course Tutor/s:
2023- in 3
24 Artific III A Tutor’s ID/Department:
ial
Intelli
gence
and
Data
Analyt
ics
Total Numb Numbe Clas O- A+ A B+ B C D
Num er of r of s Grader Graders Grader Grader Grader Gra
ber Studen Studen Ave s s s Grader ders
of ts ts - rage 81<= s
stude appear Passed Mar >= 91 M<=90 M<
nts in ed for all the ks 71<= 40<= 40
the all the compo M<=8 61<= 51<= M<=5
Class compo nent of 0 M<=7 M<=6 0
nents Exami 0 0
of nation
Assess
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

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

PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3
 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 UC24CSC15

Course Title Mathematical Foundation of Computer Science
Program Code SCS02
Program Title B.sc-Computer Science
Department Faculty of Computing and IT
Faculty Code C
Faculty Title Faculty of Computing and IT
Department offering the Computer Science
Course
Faculty Member Mr. 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: 45

2. Course Details
2.1 Course Aims and Summary

MODULE 1:

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.

MODULE 2:
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.

MODULE 3:
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.

MODULE 4:
Relation Mastery: Provide a thorough understanding of relations, including their
properties, compositions, closures, and representations, with a focus on equivalence
relations and partitions.

2.2 Course Objectives

The objectives of the Course are:

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

2.3 Course Outcomes

After undergoing this course students will be able to:

CO1 Apply the concepts of logic for effective computation and relating problems
CO2 Analyze the concepts of functions and relations
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 P PO P PO PO PO PO PO PSO PSO PSO
O 02 O 04 05 06 07 08 1 2 3
01 03
CO 2 3 3 2 3
1 2 1 3 1 1
1
CO 2 3 3 2 3 2
1 1 1 2 1
2
CO 3 1 3 3 2 3 2 2
2 3 2
3
CO 3 1 3 2 2 3 2 2
2 1 3
4
CO 3 1 3 1 3 3
3 2 2 L 1
5
CO 3 3 1 3 3
3 3 3 1 1 3
6

Relevance: 1 high, 2 medium, 3 lo

2.4 Course Content

Module – 1: Fundamentals of Logic

 Basic Connectives and Truth Tables, Logical Equivalence – The Laws of Logic, Logical
Implication – Rules of Inference. Fundamentals of Logic contd.: The Use of Quantifiers,
Quantifiers, Definitions, and the Proofs of Theorems.

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: Relations and Functions

Cartesian Products and Relations, Functions – Plain and One-to-One, Onto Functions.
Function Composition, and Inverse Functions.
Relations: Properties of Relations, Computer Recognition – Zero-One Matrices and
Directed Graphs, Partial Orders – Hasse Diagrams, Equivalence Relations and Partitions.

Module – 4: Induction and Recursion

Mathematical Induction, Strong Induction and Well – Ordering, Recursive Definitions

and Structural Induction, Recursive Algorithms, Program Corrections.

2.5 Course References

 Text Book:
 Ralph P. Grimaldi and B V Ramana, Discrete and Combinatorial Mathematics- An
Applied Introduction, Pearson Education, Asia, Fifth edition – 2007
 Discrete Mathematics and Its Applications, Kenneth H. Rosen, Seventh Edition,
2012
 References:
 Discrete Mathematical Structure, Bernard Kolman, Robert C, Busby, Sharon Ross,
2003
 C. L. Liu and D P Mohapatra, Elementary Discrete Mathematics, Tata- McGraw
Hill, Sixth Edition
 Discrete Mathematical Structures, Trembly and Manohar.

 Other Resources
 https://www.youtube.com/watch?
v=9AUCdsmBGmA&list=PL0862D1A947252D20&index=10
 https://www.youtube.com/watch?
v=oU60TuGHxe0&list=PL0862D1A947252D20&index=11
  https://www.youtube.com/watch?
v=_BIKq9Xo_5A&list=PL0862D1A947252D20&index=13
 https://www.youtube.com/watch?
v=RMLR2JHHeWo&list=PL0862D1A947252D20&index=14
 https://www.youtube.com/watch?
v=nf9e0_ylGdc&list=PL0862D1A947252D20&index=15
 https://www.youtube.com/watch?
v=7cTWea9YAJE&list=PL0862D1A947252D20&index=24
 https://www.youtube.com/watch?
v=695iAm935cY&list=PL0862D1A947252D20&index=25
 https://www.youtube.com/watch?
v=ZECJHfsf4Vs&list=PL0862D1A947252D20&index=26

3. Teaching and Assessment

3.1 Teaching Plan
Lecture Number Lecture Topic Lecture Slides Lecture Videos
0 Introduction Class Lecture-00 Video-00
1 Introduction to Discrete Mathematics Lecture-01 Video-01
2 Basic Connectives Lecture-02 Video-02
3 Truth Tables Lecture-03 Video-03
4 Logical Equivalence Lecture-04 Video-04
5 The Laws of Logic Lecture-05 Video-05
6 Logic Implication Lecture-06 Video-06
7 Rule of Inference Lecture-07 Video-07
8 Fundamentals of Logic Lecture-08 Video-08
9 Use Quantifiers Lecture-09 Video-09
10 Quantifiers Lecture-10 Video-10
11 Definitions Lecture-11 Video-11
Issue-Assignment 1 and Assignment-1 Statements
12 Proofs of Theorems. Lecture-12 Video-12
13 Set Operations Lecture-13 Video-13
14 Functions Lecture-14 Video-14
15 Sequences Lecture-15 Video-15
Submission of Assignment-1
Quiz -01 and Test-1-Obtain Student Feedback
16 Sums and Matrices Lecture-16 Video-16
17 Basics of Counting Lecture-17 Video-17
18 Pigeonhole Principle Lecture-18 Video-18
19 Permutation and Combination Lecture-19 Video-19
20 Permutation and Combination Lecture-20 Video-20
21 Binomial Coefficient and Combination Lecture-21 Video-21
22 Generating Permutation and Combination Lecture-22 Video-22
23 Mathematical Induction Lecture-23 Video-23
24 Strong Induction and Well-Ordering Lecture-24 Video-24
25 Recursive Definitions Lecture-25 Video-25
26 Structural Induction Lecture-26 Video-26
27 Recursive Algorithms Lecture-27 Video-27
 Issue-Assignment 2 and Assignment-2 Statements
28 Program Corrections Lecture-28 Video-28
29 Properties of Relation Lecture-29 Video-29
30 Composition of Relation Lecture-30 Video-30
Submission of Assignment-1
Quiz -02 and Test-2-Obtain Student Feedback
31 Closer Operation on Relation Lecture-31 Video-31
32 Equivalence Relation and Partition Lecture-32 Video-32
33 Composition of Relation Lecture-33 Video-33
34 Relation Composition 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
Issue-Assignment 3 and Assignment-3 Statements
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

3.2 Assessment weight Distribution

Quiz Test Assignment/ SEE Total Marks

PBL/PrBL
Weights/ Course Outcomes 15 25 20 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.3 Schedule of Assessment

Assessment Dates Mark COs Quiz Test Assignment/PBL/ SEE
Type s
PrBL
Weight 15 25 20 40
Duration 30 60 6 weeks 3
min min hours
Quiz-1 5 week
th
6 CO1/

CO2
Quiz-2 10 th
5 CO3/
week CO4
Quiz-3 15 th
4 CO5/
week CO6
Test-1 5 week
th
10 CO1/

CO2
Test-2 10 th
8 CO3/
week CO4
Test-3 15 th
7 CO5/
week CO6
Assignment-1 7 week
th
09 CO

1-3
Assignment-2 14 th
11 CO
week
4-6
SEE 18 th
40 All
Week

3.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
60% 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 Semest Sect Course Course Title

emic m: er ion Code
Year Programming with C
B.Tec XXYYZZH1 Course Tutor/s:
2023 h., in 1
-24 Comp I A Tutor’s ID/Department:
uter
Scienc
e and
Engin
eering
Total Numb Numbe Clas O- A+ A B+ B C D
Num er of r of s Graders Graders Grader Grader Grader Gra
ber Stude Studen Ave s s Grader ders
of nts ts - rage >= 91 81<=M s
stude appear Passed Mar <=90 M<
nts in ed for all the ks 71<= 40<= 40
the all the compo M<=8 61<= 51<= M<=5
Class compo nent of 0 M<=7 M<=6 0
nents Exami 0 0
of nation
Assess
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

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

PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3
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 UC24CSO11

Course Title Fundamentals of computer
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 Computers Science
Course
Faculty Member Prof. Teja H
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: 45

2. Course Details

2.1 Course Aims and Summary

1. The Aim of course of fundaments of computer course is to provide students with a

comprehensive understanding of the foundational principles and concept that underlie
the field of computer application.
2. The course aims to equip students with essential knowledge required to comprehend
and engage with various aspects to computing, including hardware, software,
algorithms, problem solving methodologies.
3. The fundaments of computer application introduces students to core elements of
computing covering topics such as computer architecture, programming languages,
data representation ,and algorithm thinking through theoretical concepts ,students will
develop the skills necessary to analyze and solve computational problem.

2.2 Course Objectives

The objectives of the Course are:

• To introduce Computer Definition and Characteristics of Computer

• To introduce evolution and generation of Computers, basic organization of a digital
Computer
• To define functions and components of a Computer, Central Processing Unit,
Microprocessor, Storage Unit, Input and Output devices
• To introduce how CPU and Memory works
• To understand classification of digital computers
• To define systems Microcomputers, Minicomputers, Mainframes, Supercomputers
• To define number systems different types conversion from one number system to
another
• To explain Computer codes BCD, Gray code, ASCII, Unicode
• To introduce Boolean Algebra-Boolean operators with truth tables
• To explain binary arithmetic, binary addition, binary subtraction, compliment of a
binary number.
• To understand Computer Languages-Machine level, Assembly level and High level
languages
• To understand Translator programs-Assembler, Interpreter and Compiler
• To introduce planning a computer program-Algorithm and Flowcharts, pseudo code
with examples
 • To define Operating system fundamentals
• To define Operating systems introduce functions of an operating system
• To understand classification of operating systems, system programs
• To define applications programs, utilities
• To explain Unix Operating Systems, basic commands (cal, date, bc, echo, who, is,
pwd, cd, mkdir, rmdir
• To work commands with files(cat, cp, rm, mv,file, wc, head, tail
• To introduce database management system
• To define database DBMS , why database file system vs DBMS
• To explain database application, database users
• To introduce SQL, Classification of SQL-DDL,DML,DCL,TCL
• To understand basics of internet
• To introduce features of internet, internet applications services of internet
• To understand logical and physical addresses, internet service provider, domain name
system
• To introduce web basics-introduction to web, web browsers, http/https, UR

2.3 Course Outcomes

After undergoing this course students will be able to:

CO1 Introduction to computers, classification of computers,
anatomy of computer, constituents and architecture,
microcontrollers
CO2 Analyze Operating systems, functions of operating systems,
classification of operating systems, kernel, shell, basics of
Unix, shell programming, booting
CO3 Implement databases, why databases are used, users, SQL,
data types in SQL, introduction of queries - select, alter,
update, delete, truncate
CO4 Demonstrate Internet basics, features, applications, services,
internet service providers, domain name system, browsing,
email, searching
CO5 Develop Web Programming basics, introduction of HTML and CSS
programming
CO6 Explain how data is represented in a computer, including binary and
hexadecimal representations.

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 1 1 3 3 2 2 3 2 2
CO2 2 1 1 3 2 2 3 3 2 1 3
CO3 1 1 2 2 2 3 2 2 3 3 3
CO4 2 2 3 1 1 2 1 1 2 3 2
CO5 1 1 2 2 1 2 3 3 2 2 2
CO6 2 2 3 3 3 2 1 2 2 3 3
Relevance: 1 high, 2 medium, 3 low

2.4 Course Content

Module 1:Introduction to Computers

Computer Definition, Characteristics of Computers, Evolution and History of
Computers, Basic Organization of a Digital Computer; Functions & Components of a
Computer, Central Processing Unit, Microprocessor, Storage units, Input and output
Devices. How CPU and memory works. Types of Computers: microcomputer,
minicomputer, super computer, mainframe computer.
Module 2:Anatomy of Computer
Types of Software–System Software and Utility Software; Computer Languages -
Machine Level, Assembly Level &High Level Languages, Translator Programs –
Assembler, Interpreter and Compiler; Planning a Computer Program -Algorithm,
Flowchart and Pseudocode with Examples.
Number Systems – different types, conversion from one number system to another;
Computer Codes – BCD, Gray Code, ASCII and Unicode; Boolean Algebra – Boolean
Operators with Truth Tables; Binary Arithmetic: Binary Addition, Binary Subtraction,
Complement of a Binary number.
Module 3: Operating System Fundamentals
Operating Systems: Introduction, Functions of an operating System, Classification of
Operating Systems, System programs, Application programs, Utilities, The Unix
Operating System, Basic Unix commands

Module 4: Introduction to Database Management Systems

Database, DBMS, Why Database - File system vs DBMS, Database applications,
Database users, Introduction to SQL.
Internet Basics
Introduction, Features of Internet, Internet application, Services of Internet, Logical and
physical addresses, Internet Service Providers, Domain Name System
 2.5 Text Book and References

Text Book:
• Pradeep K. Sinha and Priti Sinha: Computer Fundamentals (Sixth Edition),
BPB Publication
• David Riley and Kenny Hunt, Computational thinking for modern
solver, Chapman & Hall / CRC,
References:
• J.GlennBrookshear,”ComputerScience:AnOverview”,Addision-
Wesley,TwelfthEdition,
• R.G. Dromey, “How to solve it by Computer”, PHI
• www.w3school.com

3. Teaching and Assessment

3.1Teaching Plan

Lecture Lecture Topic Lecture Slides Lecture

Number Videos
0 Faculty introduction ,student Lecture-00 Video-00
introduction and subject
introduction
1 Computer Definition, Lecture-01 Video-01
Characteristics of Computers

2 Evolution and History of Computers Lecture-02 Video-02

3 Functions & Components of a Lecture-03 Video-03
Compute
4 Central Processing Unit, Lecture-04 Video-04
Microprocessor
5 Storage units, Input and Output Lecture-05 Video-05
Devices
6 How CPU and memory work Lecture-06 Video-06
7 Types of Computers: Lecture-07 Video-07
Microcomputer, Minicomputer
8 Types of Computers: Lecture-08 Video-08
Supercomputer, Mainframe
Computer
9 Types of Software – System Lecture-09 Video-09
Software
10 Utility Software Lecture-10 Video-10
11 Computer Languages - Machine Lecture-11 Video-11
Level,
12 Assembly Level & High-Level Lecture-12 Video-12
Languages
11 Translator Programs – Assembler, Lecture-11 Video-11
Interpreter, and Compiler
Issue-Assignment 1 and Assignment-1 Statements
12 Planning a Computer Program Lecture-12 Video-12
13 Algorithms Lecture-13 Video-13
14 Examples of algorithms Lecture-14 Video-14
15 Flowchart Lecture-15 Video-15
Submission of Assignment-1
Quiz -01 and Test-1-Obtain Student Feedback
16 Examples of Flowcharts Lecture-16 Video-16
17 Pseudocode with Examples Lecture-17 Video-17
18 Number Systems – different types, Lecture-18 Video-18
19 conversion from one number system Lecture-19 Video-19
to another
20 conversion from one number system Lecture-20 Video-20
to another
21 Computer Codes – BCD Lecture-21 Video-21
22 Gray Code, ASCII, and Unicode Lecture-22 Video-22
23 Boolean Algebra – Boolean Lecture-23 Video-23
Operators with Truth Tables
24 Binary Arithmetic: Binary Addition Lecture-24 Video-24
25 Binary Subtraction, Complement of Lecture-25 Video-25
a Binary number
26 Operating Systems: Introduction Lecture-26 Video-26
27 Functions of an Operating System Lecture-27 Video-27
Issue-Assignment 2 and Assignment-2 Statements
28 Classification of Operating Systems Lecture-28 Video-28
29 System programs, Application Lecture-29 Video-29
programs, Utilities
30 Application programs Lecture-30 Video-30
Submission of Assignment-2
Quiz -02 and Test-2-Obtain Student Feedback
31 The Unix Operating System Lecture-31 Video-31
32 Basic Unix commands Lecture-32 Video-32
33 Basic Unix commands Lecture-33 Video-33
34 Database, DBMS Lecture-34 Video-34
35 Why Database - File system vs Lecture-35 Video-35
DBMS
36 Database applications Lecture-36 Video-36
37 Database users Lecture-37 Video-37
38 Introduction to SQL Lecture-38 Video-38
39 Introduction, Features of Interne Lecture-39 Video-39
40 Internet application Lecture-40 Video-40
Issue-Assignment 3 and Assignment-3 Statements
41 Services of Internet Lecture-41 Video-41
 42 Logical and physical addresse Lecture-42 Video-42
43 Internet Service Providers Lecture-43 Video-43
44 Domain Name System Lecture-44 Video-44
45 Revision Lecture-45 Video-45
Quiz-03 and Test-03
Submission of Assignment-2
Obtain Student Feedback
Examination Preparation Break
Term/Semester End Examination

3.2 Assessment weight Distribution

Quiz Test Assignment/ SEE Total

Marks
PBL/PrBL
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.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
th
Assignment- 14 11 CO
2 week
4-6
SEE 18th 40 All
Week

3.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 Studen Quiz Test Assignmen SEE Marks Grade

t Name (15%) (25%) t 40% Scored obtained
20%

2
3

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 Progra Semest Sect Course Course Title

emic m: er ion Code
Year Programming with C
B.Tec XXYYZZH1 Course Tutor/s:
2023 h., in 1
-24 Comp I A Tutor’s ID/Department:
uter
Scienc
e and
Engin
eering
Total Numb Numb Clas O- A+ A B+ B C D
Num er of er of s Graders Graders Grader Grader Grader Gra
ber Studen Studen Ave s s Grader ders
of ts ts - rage >= 91 81<= s
stude appear Passed Mar M<=90 M<
nts in ed for all the ks 71<= 40<= 40
the all the compo M<=8 61<= 51<= M<=5
Class compo nent of 0 M<=7 M<=6 0
nents Exami 0 0
of nation
Assess
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

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

PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3

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.