DEPARTMENT OF COMPUTER SCIENCE

B.Sc. COMPUTER SCIENCE

(Students admitted during 2020-2021 Onwards)

(Under CBCS with Outcome Based Education (OBE) Pattern)

SYLLABUS
I & II SEMESTER

GOBI ARTS & SCIENCE COLLEGE

(Govt. Aided Autonomous Co-educational Institution, Affiliated to
Bharathiar University, Coimbatore, Accredited with 'A' Grade by NAAC (4th cycle)
and Recognised as a STAR College by DBT, Government of India)

KARATTADIPALAYAM POST,
GOBICHETTIPALAYAM - 638453
ERODE DISTRICT.

1
 GOBI ARTS & SCIENCE COLLEGE (Autonomous)

Vision
Social and Economic upliftment of the people of this area through value based quality Education.

Mission
Committed to serve the society with humility and trust, devoid of exploitation; to impart value
based higher education, particularly to the socially and economically deprived sections of this area; to
make students of this institution worthy citizens of our glorious motherland.

DEPARTMENT OF COMPUTER SCIENCE

Vision
To inculcate better programming skills among rural area students.

Mission
To impart value based technical education and educate students towards the design and
development of software products for the benefit of computer industry and society.

2
 GOBI ARTS & SCIENCE COLLEGE (AUTONOMOUS): GOBICHETTIPALAYAM
SCHEME OF EXAMINATIONS - B.Sc. (COMPUTER SCIENCE) (20 BATCH)

Maximum
Course
No. Part Course Total Hrs/ Marks Total Credits
Code Hours Exam Marks
CIA EOS
SEMESTER – I
1 20U1TM01 I TAMIL – I 90 3 30 70 100 3.0
2 19U2EN01 II ENGLISH - I 90 3 30 70 100 3.0
3 19UACS01 III MAJOR CORE : PROGRAMMING IN C 60 3 30 70 100 3.5
DIGITAL COMPUTER FUNDAMENTALS &
4 19UACS02 III 60 3 30 70 100 3.5
ARCHITECTURE
5 19UBMA51 III ALLIED CORE : MATHEMATICS – I 90 3 30 70 100 5.0
MAJOR CORE PROGRAMMING LAB - I :
6 19UACSPA III 60 3 30 70 100 2.0
(C)
i) HUMAN EXCELLENCE PAPER - I :
7 19U4HE01 IV 15 3 30 70 100 1.0
BASICS OF YOGIC LIFE

SEMESTER – II

8 20U1TM02 I TAMIL - II 90 3 30 70 100 3.0

9 19U2EN02 II ENGLISH – II 90 3 30 70 100 3.0
MAJOR CORE : OBJECT ORIENTED
10 19UACS03 III 60 3 30 70 100 3.5
PROGRAMMING WITH C++
11 19UACS04 III OPERATING SYSTEM 60 3 30 70 100 3.5
12 19UBMA52 III ALLIED CORE : MATHEMATICS – II 90 3 30 70 100 5.0
MAJOR CORE PROGRAMMING LAB - II :
13 20UACSPB III 60 3 30 70 100 2.0
(C++)
i) HUMAN EXCELLENCE PAPER - II :
14 19U4HE02 IV 15 3 30 70 100 1.0
SUBLIMATION AND SOCIAL WELFARE
15 19U4HEP1 IV PRACTICAL - I : YOGA PRACTICAL – I 15 100 100 1.0
ii) FOUNDATION SUBJECT - A :
16 19U4FN01 IV 1.5 100 100 1.0
GENERAL AWARENESS

SEMESTER – III
17 19UACS05 III MAJOR CORE : DATA STRUCTURES 60 3 30 70 100 3.5
18 19UACS06 III CLIENT SERVER COMPUTING 60 3 30 70 100 3.5
MICROPROCESSORS AND ASSEMBLY
19 19UACS07 III 60 3 30 70 100 3.5
LANGUAGE PROGRAMMING
20 19UACS08 III PYTHON PROGRAMMING 60 3 30 70 100 3.5
21 19UBCS01 III ALLIED CORE : NUMERICAL METHODS 75 3 30 70 100 5.0
MAJOR CORE PROGRAMMING LAB - III :
22 19UACSPC III 60 3 30 70 100 2.0
(DATA STRUCTURES IN C)
MAJOR CORE PROGRAMMING LAB - IV :
23 19UACSPD III 60 3 30 70 100 2.0
(PYTHON PROGRAMMING)
i) HUMAN EXCELLENCE PAPER - III :
24 19U4HE03 IV 15 3 30 70 100 1.0
VIRTUES OF LIFE
25 IV ii) FOUNDATION SUBJECT - B 3 100 100 2.0

Contd…

3
 SEMESTER – IV

26 19UACS09 III MAJOR CORE : VISUAL PROGRAMMING 75 3 30 70 100 4.0

COMPUTER ORIENTED STATISTICAL
27 19UACS10 III 75 3 30 70 100 4.0
METHODS
28 19UABM51 III ACCOUNTING AND MANAGEMENT 90 3 30 70 100 4.0
29 III ALLIED OPTIONAL : 90 3 30 70 100 5.0
MAJOR CORE PROGRAMMING LAB - V :
30 19UACSPE III 60 3 30 70 100 2.0
(VISUAL PROGRAMMING)
MAJOR CORE PROGRAMMING LAB - VI :
31 19UACSPF III 60 3 30 70 100 2.0
(SPSS AND TALLY)
i) HUMAN EXCELLENCE PAPER - IV :
32 19U4HE04 IV 15 3 30 70 100 1.0
PERSONALITY DEVELOPMENT
PRACTICAL - II :
33 19U4HEP2 IV 15 100 100 1.0
YOGA PRACTICAL – II
34 IV ii) FOUNDATION SUBJECT – B 3 100 100 2.0
35 V CO-CURRICULAR ACTIVITIES 1.0

SEMESTER – V
36 19UACS11 III MAJOR CORE : JAVA PROGRAMMING 60 3 30 70 100 4.5
37 19UACS12 III SOFTWARE ENGINEERING 60 3 30 70 100 4.5
RELATIONAL DATABASE MANAGEMENT
38 19UACS13 III 60 3 30 70 100 4.5
SYSTEMS
MAJOR ELECTIVE - I : COMPUTER
39 19UACS14 III 60 3 30 70 100 4.5
NETWORKS
MAJOR CORE PROGRAMMING LAB - VII :
40 19UACSPG III 60 3 30 70 100 2.5
(JAVA PROGRAMMING)
MAJOR CORE PROGRAMMING LAB – VIII :
41 19UACSPH III 60 3 30 70 100 2.5
(RDBMS)
42 III MAJOR OPTIONAL : 90 3 30 70 100 4.0

SEMESTER – VI

43 19UACS15 III MAJOR ELECTIVE - II : WEB DESIGN 90 3 30 70 100 4.5

MAJOR SKILL BASED PAPER: COMPUTER
44 19UECS01 III 90 3 30 70 100 4.5
GRAPHICS
MAJOR CORE PROGRAMMING LAB - IX :
45 19UACSPI III 60 3 30 70 100 2.5
(WEB DESIGN)
MAJOR SKILL BASED PRACTICAL:
46 19UECSPJ III PROGRAMMING LAB - X : (COMPUTER 60 3 30 70 100 2.5
GRAPHICS)
19UACS16 III MAJOR CORE: PROGRAMMING WITH PHP 90 3 30 70 100 4.5
19UACSPK III PROGRAMMING LAB - XI : (PHP) 60 3 30 70 100 2.5
47 (OR)
19UACSV1 III PROJECT WORK 150 30 70 100
7.0

CREDITS:
=======
PART I : 6 PART II : 6 PART III : MAJOR : 100
ALLIED: 20
---> 120
PART IV : 11 PART V : 1 TOTAL : 144

4
 BLOOM’S TAXONOMY BASED ASSESSMENT PATTERN

K1-Remember; K2- Understanding; K3- Apply; K4-Analyze; K5- Evaluate

I. END OF SEMESTER (EOS) EXAMINATIONS:

1. Part I, II & III-Theory: 70 Marks

Knowledge Level Section Marks Description Total
K1 A (Answer All) 15 × 1 = 15 MCQ
K2 B (Either or Pattern) 5 × 5 = 25 Short answers 70
K3 & K4 C (Answer 3 out of 5) 3 × 10 = 30 Descriptive/Detailed

2. Practical Examinations: 70 Marks

Section Total
Knowledge Level
Practical Record work
K3
K4 60 10 70
K5

II. CONTINUOUS INTERNAL ASSESSMENT (CIA):

1. Test – I & II: 30 Marks (Theory)

Knowledge Level Section Marks Description Total
K1 A (Answer All) 10 × 1 = 10 MCQ
K2 B (Answer 2 out of 3) 2 × 5 = 10 Short answers 30
K3 & K4 C (Answer 1 out of 2) 1 × 10 = 10 Descriptive/Detailed

2. Practical Internal Assessment: 30 Marks

Section Total
Knowledge Level
Test Lab Performance
K3
K4 20 10 30
K5

Components of Continuous Internal Assessment (CIA)

Components Calculation CIA Total
Test 1 30 Test 1 + Test 2
30
Test 2 30 2

5
PROGRAMME SPECIFIC OBJECTIVES
The students will be able to do, on successful completion of programme
1. Gain sound technical foundation in computer science theory and open source programming
languages and the ability to apply computer related technologies to practical problems.
2. Acquire independent thinking, possess problem-solving skills and become technically competent to
pursue higher studies.
3. Exhibit professional leadership qualities, good communication, team work, social and professional
skills.
4. Utilize emerging technological tools, learn, adapt and successfully write effective procedural
coding meeting the needs of technical and societal challenges.
5. Equip students to critically analyze existing systems at multiple levels and develop innovative
solutions that cater to the dynamic nature of information technology industries.

PROGRAMME SPECIFIC OUTCOMES (PSO)

PSO1: Understand the basic principles and concepts of Computer Science and integrate the
knowledge gained in computer science domain with practical needs of the society and be an ethically
and socially responsible computer science professional.
PSO2: Identify theoretical foundations and appropriate algorithmic principles for modeling and
designing computational systems.
PSO3: Analyze and formulate the problem, propose feasible solutions using computing facilities and
enhance the skills towards post graduate programmes.
PSO4: Ability to apply the concepts of computer theory and practices using emerging technologies
and tools for developing software.
PSO5: Equip students to identify, analyze and explore the field of computer science at multiple levels
for implementing innovative solutions that cater to the dynamic nature of information technology
industries.

6
Programme Code: B.Sc. Programme Title: Computer Science
Course Code: 19UACS01 Course Title: Batch: 2019
Programming in C Semester: I
Total Hours: 60 (Common for CS, CA, IT,
CT) Credits: 3.5

Course Objective
The course aims
 To provide a comprehensive study of the procedure oriented concept using C programming language.
 To facilitates the students to elaborately study about C programming techniques.
 To implement these techniques to solve the variety of real-time problems.

Course Outcomes (CO)

On the successful completion of the course, students will be able to
Knowledg CO
Course Outcome
e Level Number
Remember and understand the basic data types, operators and to write &
K1,K2,K5 CO1
compile simple programs.
K1,K2,K5 CO2 Understand the conditional statements & loops in programs.
K1,K2,K3, Understand and apply the concept of arrays & functions and design the
CO3
K5 application programs.
K1,K2,K3, Analyze the usage of structures, unions, pointers and make them to
CO4
K4,K5 efficiently access the memory.
Understand and evaluate the file operations and write programs to handle
K3,K4, K5 CO5
the data using files.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate

SYLLABUS

No. of
Unit Content
Hours
C FUNDAMENTALS: Overview of C, Constants, Variables and Data
I Types, Operators and Expressions, Data Input and Output Operators – 12
Simple Programs.
CONTROL STATEMENTS: If statements, Switch, Conditional Operator,
II While, do..While, for statements, break, continue, Storage Classes – 12
Programs.
ARRAY AND FUNCTIONS: One and Multidimensional arrays,
III Handling of Character Strings – Programs. USER DEFINED 12
FUNCTIONS: Programs - Simple Function*.
STRUCTURE AND POINTERS: Structures and Unions – Programs.
POINTERS: Introduction, Pointer Expressions, Pointers and Arrays,
IV 12
Pointers and Character Strings, Pointers and Functions, Pointers and
Structure – Programs - Simple Pointers*.

7
 File and the preprocessor: File Management in C – Programs, Concept of
V 12
Dynamic Allocation of Memory and Linked List, The Preprocessor.
<* - Self Study>
Text Book:
1. E. Balagurusamy, “Programming In Ansi C”, Second Edition, Tata Mcgraw Hill Publications, 2003
(Unit – I to V)
Reference Books:
1. Ashok N. Kamthane, “Programming in C”, Second Edition, Pearson, 2006.
2. Herbert Schildt, “C: The Complete Reference”, Fourth Edition, Tata Mcgraw-Hill, 2008.
3. Shubhnandan S, Jamual, “Programming in C”, First Edition, Pearson, 2014.
4. Subburaj R, “Programming in C”, First Edition, Vikas Publishing, 2012.
E-references:
1. https://www.cprogramming.com/reference/
2. https://en.cppreference.com/w/c/language
3. https://developerinsider.co/best-c-programming-book-for-beginners/

Mapping with Programme Specific Outcomes

PSO
PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 S S M S S
CO2 S S M S S
CO3 S S H S H
CO4 S S S S H
CO5 H S S S H
S - Strong; H - High; M - Medium; L - Low

8
Programme Code: B.Sc. Programme Title: Computer Science

Course Code: 19UACS02 Course Title: Batch: 2019

Digital Computer Semester: I

Total Hours: 60
Fundamentals & Architecture Credits: 3.5

Course Objective
The course aims

 To know the concepts of representation and conversion of number systems.

 To understand and gain knowledge about the logic circuits and design different kinds of circuits for
Boolean algebra and K-maps.
 To recognize and design combinational and sequential circuits.
 To acquire the knowledge about the internal work flow of CPU, micro-operations and programme
control.
 To learn about I/O, data-transfer techniques, and interrupts.
Course Outcomes (CO)
On the successful completion of the course students will be able to

Knowledge CO
Course Outcome
Level Number
K1, K2, K3, Understand the fundamentals of various number systems, complements,
CO1
K5 codes and perform conversions.
K1, K2, K3, Understand the logic gates and the laws of Boolean algebra, remember and
CO2
K4, K5 solve K-maps.
K1, K2,K3, Understand the basics of arithmetic and sequential circuits, apply the logics
CO3
K4, K5 for designing circuit diagrams.
Know and realize the important of central processing unit, instruction formats
K1,K2 CO4
and various instructions.
Understand the usage of I/O, data-transfer, I/O processor and analyze
K1, K2, K4 CO5
various strategies of interrupts.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate

SYLLABUS
No. of
Unit Content
Hours
NUMBER SYSTEM: Decimal, Binary, Octal, Hexadecimal – Binary addition,
Multiplication, Division – Floating point representation, Complements, BCD,
I 12
Excess3, Gray codes – Convention between Number Systems. (Self-study:
Gray codes)
DIGITAL LOGIC: The Basic Gates – NOR, NAND, XOR Gates –
COMBINATIONAL LOGIC CIRCUITS: Boolean Algebra, simplification of
II 12
Boolean functions – Karnaugh map – Canonical form – Don’t care condition –
Product of sum, Sum of products, K- map Computational circuits.

9
 ARITHMETIC CIRCUITS: Half Adder, Full Adder, Parallel Binary Adder,
BCD Adder, Half subtractor, Full subtractor, Parallel binary subtractor.
III SEQUENTIAL CIRCUITS - FLIP-FLOP: RS, JK, D, and T– Multiplexers – 12
Demultiplexers – Decoder – Encoder. (Self-Study: Half Subtractor, D and T
Flip-flop)
CENTRAL PROCESSING UNIT: General Register Organization – Control
IV word– Examples of Micro operations – Stack organization – Instruction formats 12
– Addressing modes – Data Transfer and manipulation program control.
INPUT – OUTPUT ORGANIZATION: Input-Output Interface – I/O Bus and
Interface – I/O Bus Versus Memory Bus – Isolate Versus Memory – Mapped
I/O – Example of I/O Interface. ASYNCHRONOUS DATA TRANSFER:
V Strobe Control and Handshaking – PRIORITY INTERRUPT: Daisy – 12
Chaining Priority, Parallel priority Interrupt, DIRECT MEMORY ACCESS:
DMA Controller, DMA Transfer. INPUT-OUTPUT PROCESSOR: CPU –
IOP Communication. (Self-Study: Handshaking)

Text Book:
1. M.Morris Mano, “Computer System Architecture”, Third Edition –Tenth Impression, Prentice Hall of
India, 2013. (UNIT - I to V).
Reference Books:
1. V. Vijayendran, “Digital Fundamentals”, S. Viswanathan Publishers Pvt Ltd, 2009.
2. Donald P Leach, Albert Paul Malvino, Goutam Saha, “Digital Priniciples and Applications”, 7th
Edition, McGraw Hill, 2011.
3. David A. Patterson, John L.Hennessy, “Computer Organization and Design”, Fourth Edition, Morgan
Kauffmann Publishers, 2011.
4. William Stallings, “Computer Organization and Architecture”, Tenth Edition, Pearson Education, 2015.

E-references:
1. https://www.studytonight.com/computer-architecture/architecture-of-computer-system
2. https://onlinecourses.nptel.ac.in/noc19_cs03
3. http://www.cs.uwm.edu/classes/cs458/Lecture/HTML/ch01.html
4. https://www.geeksforgeeks.org/computer-organization-and-architecture-tutorials/#idf

Mapping with Programme Specific Outcomes

PSO
PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 S S S S S
CO2 S S H S S
CO3 S H S S H
CO4 S H H M S
CO5 S S S H S
S - Strong; H - High; M - Medium; L - Low

10
 Programme Code: B.Sc. Programme Title: Computer Science
Course Code: 19UBMA51 Course Title: Batch: 2019
Semester: I
Total Hours: 90 Mathematics - I
Credits: 5.0

Course Objective
The course aims
 To study the Binomial, Exponential & Logarithmic series, Theory Equation and different types of
Matrices.
 To know the Trigonometric function & Hyperbolic Function.
 To know the basic concepts of Partial Differentiation & Integration.

Course Outcomes (CO)

On the successful completion of the course, students will be able to
Knowledge CO
Course Outcome
Level Number
K2, K3 CO1 Solve the series using Binomial, Exponential & Logarithmic.
K1, K2, CO2 Acquire Knowledge of solving problems in theory of equations and
matrices.
K1, K2, K3 CO3 Expand sines and cosines of multiples of theta, powers of theta,
hyperbolic and inverse hyperbolic functions.
K1, K2 CO4 Understand the basic concept of partial differential equations.
K2 CO5 Evaluate varies type of Integrations and Reduction formula.

K1 - Remember; K2 - Understanding; K3 - Apply; K4 - Analyze; K5 – Evaluate

SYLLABUS
No. of
Unit Content
Hours
ALGEBRA
I Binomial, Exponential and Logarithmic theorems (statements only) Summations 18
related to Binomial, Exponential and Logarithmic series.
THEORY OF EQUATIONS
Theory of Equations – Transformation of Equations: Reciprocal Equations – To
II increase or decrease the roots – Removal of terms – Descartes Rule of Signs – 18
Matrices – Additon, Subtraction, Multiplication, Determinant, Inverse, Linear
Equations, Cramer's Rule, Rank of Matrices.
TRIGONOMETRY
Expansions: Expansions of sin n , cos n , tan n - Power of sines & cosines of  -
III 18
Expansions of sin  & cos  - Expansions of sin  & cos  in a series of
n n

ascending power of  - Hyperbolic functions – Inverse Hyperbolic funtions.

DIFFERENTIAL CALCULUS
Partial Differentiation – Successive Partial Derivatives – Function of function rule –
IV Total Differential Co-efficients – Implicit functions. Euler's theorem (problems 18
only) – Jacobian.
INTEGRAL CALCULUS
Definite Integrals – Properties of Definite Integrals – Integration by parts –
V 18
n ax n n n n m n
Reduction formula for x e , x cos ax, sin x, cos x, tan x, sin x cos x.
11
Text Books:
1. Manicavachagom Pillay & Narayanan, “Ancillary Mathematics Book I” J.Viswanathan (printers &
Publishers) Pvt.Ltd., 1995. (Unit-I & II).
2. Narayanan & Manicavachagom Pillay, “TRIGONOMETRY”, 1995. (Unit-III).
3. Narayanan & Manicavachagom Pillay, “Ancillary Mathematics Book II”, J.S.Viswanathan (printers
& Publishers) Pvt.Ltd., 1995.(Unit-IV & V).

Reference Books:
1. Tom M.Apostol, “Calculus Vol-1 & Vol-2” published by John Wiley & Sons, United states-2016,
2nd edition.
2. James Stewart, “Calculus: Early Transcendentals” published by Thomson books/Cole, USA-2008,
6th edition.
E-references:
1. http://nptel.ac.in/courses/111104085/29
2. https://www.khanacademy.org/math/calculus-home
3. https://ocw.mit.edu/courses/mathematics/18-01-single-variable-calculus-fall-2006/video-lectures/
4. http://www.math.odu.edu/~jhh/Volume-1.PDF
5. http://www.math.odu.edu/~jhh/Volume-2.PDF

Mapping with Programme Specific Outcomes

PSO
PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 S M M S H
CO2 H S M M M
CO3 S S S S M
CO4 S M H S M
CO5 S M H H L
S - Strong; H - High; M - Medium; L – Low

12
Programme Code: B.Sc. Programme Title: Computer Science
Course Code: 19UACSPA Course Title: Batch: 2019

Programming Lab – I: (C) Semester: I

Total Hours: 60
(Common for CS, CA, IT, CT) Credits: 2.0

Course Objective
The course aims
 To provide a comprehensive study of the procedure oriented concept using C programming language.
 To facilitates the students to elaborately study about C programming techniques.
 To implement these techniques to solve the variety of real-time problems.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Course Outcome
Level Number
Remember basic data types, operators and to write simple programs using
K1,K2,K5 CO1
them.
K1,K2,K5 CO2 Understand the conditional statements & loops for creating programs.
K1,K2,K3, Apply the concept of arrays & functions and design the application
CO3
K5 programs.
K1,K2,K3, Analyze the usage of structures, pointers and use them efficiently to solve
CO4
K4,K5 problems.
Evaluate the file operations and write programs to handle the data using
K3,K4, K5 CO5
file concept.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate

SYLLABUS
1. Write a C program to calculate the sum of digits of a given number.
2. Write a C program to find a factorial for given number.
3. Write a C program to print the Fibonacci series.

4. Write a C program to find the Ramanujam number.

5. Write a C program to print the numbers between some interval which divisible by four.

6. Write a C program to find the Maximum and Minimum value in a array.

7. Write a C program to sort a given number.
8. Write a C program to add two matrices.
9. Write a C program for converting numbers into words.
10. Write a C program to find and count number of vowels in a word or string.
11. Write a C program for sorting string in a alphabetical order.
12. Write a C program to find the roots of a Quadratic Equation.
13. Write a C program for swapping two values using pointers.
14. Write a C program to print Electricity Bill using File.
15. Write a C program to Maintain Student Mark List using Structure.

13
Text Book:
1. E. Balagurusamy, “Programming In Ansi C”, Second Edition, Tata Mcgraw Hill Publications, 2003.
Reference Books:
1. Ashok N. Kamthane, “Programming in C”, Second Edition, Pearson, 2006.
2. Herbert Schildt, “C: The Complete Reference”, Fourth Edition, Tata Mcgraw-Hill, 2008.
3. Shubhnandan S, Jamual, “Programming in C”, First Edition, Pearson, 2014.
4. Subburaj R, “Programming in C”, First Edition, Vikas Publishing, 2012.
E-references:
1. https://www.cprogramming.com/reference/
2. https://en.cppreference.com/w/c/language
3. https://developerinsider.co/best-c-programming-book-for-beginners/

Mapping with Programme Specific Outcomes

PSO
PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 S S M S S
CO2 S S M S S
CO3 S S H S H
CO4 S S S S H
CO5 H S S S H
S-Strong; H-High; M- Medium; L-Low

14
Programme Code: B.Sc. Programme Title: Computer Science
Course Code: 19UACS03 Course Title: Batch: 2019
Object Oriented Programming with Semester: II
Total Hours: 60 C++
(Common for CS, CA, IT, CT) Credits: 3.5

Course Objective
The course aims
 To understand the feature of C++ supporting object oriented programming.
 To develop the knowledge of how to represent real-life entities of problems in system design.
 To implement inheritance and file operations.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Course Outcome
Level Number

K1,K2,K5 CO1 Learn and understand the basic knowledge on Object Oriented concepts.

Understand and develop applications using Object Oriented Programming

K1,K2,K5 CO2
Operators and Functions.
To apply the class structures as fundamental, modular building block and
K1,K2,K3,
CO3 demonstrate the differences between traditional imperative design and
K5
object-oriented Design.
K1,K2,K3, To analyze and understand the role of inheritance, polymorphism and
CO4
K4 building reusable code.
To evaluate small/medium scale C++ programs with pointers &
K3,K4, K5 CO5
understand the file handling and error handling mechanisms in C++.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate

SYLLABUS
No. of
Unit Content
Hours
Principles of Object Oriented Programming: Procedure Oriented Programming,
Object Oriented Programming Paradigm, Basic Concepts of Object Oriented
Programming, Benefits of Object Oriented Programming, Object Oriented
Languages, Application of Object Oriented Programming - Beginning With C++:
I 12
What Is C++?, Applications of C++, Structure of C++ Statement – Tokens,
Expressions and Control Structures: tokens, keywords, identifiers and constants,
basic and user defined data types, derived data types, variables, operators in C++,
Operator Precedence, Expression and Their Types, Control Structures.
Function in C++: Main Function, Function Prototyping, Call By Reference, Return
By Reference, Inline Functions, Default Arguments, Function Overloading –
II 12
Classes And Objects: Specifying A Class, Defining Member functions, Making an
Outside Function Inline, Nesting of Member Functions, Private Member Functions,

15
 Arrays Within a Class, Memory Allocation For Objects, Static Data Members and
Member Functions Arrays of Objects, Object As Function Arguments, Friendly
Functions, Pointers to Members.
Constructors And Destructors: Constructors, Parameterized Constructors,
Multiple Constructors in a Class, Constructors With Default Arguments, Copy
III Constructor, Destructors – Operator Overloading And Type Conversions: Defining 12
Operator Overloading, Overloading Unary Operators, Overloading Binary
Operators using Friend, Rules For Overloading Operators, Type Conversions.
Inheritance: Defining Derived Classes, Single, Multilevel, Multiple, Hierarchical
And Hybrid Inheritance, Virtual Base Classes, Abstract Classes, Constructors in
IV Derived Classes, Nesting Of Classes – Pointers, Virtual Functions And 12
Polymorphism: Pointers To Objects, This Pointer, Pointers To Derived Classes,
Virtual Functions, Pure Virtual Functions.
Managing Console I/O Operations: C++ Streams, C++ Stream Classes,
Unformatted I/O Operations, Formatted Console I/O Operations, managing Output
With Manipulators Working With File: Classes For File Stream Operations,
V 12
Opening And Closing A File Detecting End-Of-File, Open() File Modes, File
Pointers And Their Manipulation , Sequential I/O Operations, Random Access File,
Error Handling During File Operations.

Text Book:
1. E. Balagurusamy, “Object Oriented Programming With C++”, Six Edition, Tata McGraw Hill, 2013
(Unit I-V).
Reference Books:
1. Ananthi Sheshasaayee, G Sheshasaayee,”Object Oriented Programming With C++”, Margham
Publication, First Edition, 2001.
2. Bjarne Stroustrup, “The C++ Programming Language”, 4th Edition, Addison Wesley, 2013
3. Anirban Das, Goutam Panigraphi, “Object Oriented Programming With C++”, Second Edition, Vikas
Publishing Pvt Ltd, 2014.
4. M.T. Somashekara, D.S. Guru, H.S.Nagendraswamy and K.S. Mnajunatha, ”Object Oriented
Programming With C++”, Second Edition, Vikas Publishing Pvt Ltd, 2012.
E-references:
1. https://en.cppreference.com/w/
2. https://www.tutorialspoint.com/cplusplus/cpp_references.htm
3. https://www.javatpoint.com/cpp-tutorial
4. https://beginnersbook.com/2017/08/c-plus-plus-tutorial-for-beginners/

Mapping with Programme Specific Outcomes

PSO
PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 S H M S M
CO2 S H M S S
CO3 S S H S H
CO4 S S S S H
CO5 H M S S S
S - Strong; H - High; M - Medium; L – Low

16
Programme Code: B.Sc. Programme Title: Computer Science
Course Code: 19UACS04 Course Title: Batch: 2019

Operating System Semester: II

Total Hours: 60
(Common for CS, CA, IT, CT) Credits: 3.5

Course Objective
The course aims
 To understand what a process is and how processes are synchronized and scheduled.
 To understand the structure and organization of the file system.

Course Outcomes (CO)

Knowledge CO
Course Outcomes
Level Number
Understand the fundamental components, concepts, history and system
K1,K2 CO1
calls of operating system.
Understand various process states in an operating system and its
K2,K3, K4 CO2
implementation using mutual exclusion primitives.
Understand the problems of deadlock and analyze deadlock prevention and
K1, K2, K4,
CO3 recovery techniques along with the design of real storage management
K5
strategies.
K1,K3, K4, Learn and analyze various processor scheduling policies and evaluate the
CO4
K5 algorithms.
Realize the disk performance optimization technique and learn the
K1,K2,K4 CO5
concepts of file systems design.
K1 - Remember; K2 - Understanding; K3 - Apply; K4 - Analyze; K5 - Evaluate

SYLLABUS

No. of
UNIT CONTENTS
Hours
Introduction: What is an Operating System? - History of operating systems-
Operating System Concepts: Processes–Files-The Shell. System Calls:
I 12
Process Management–Signaling-File Management-Directory Management-
Protection-Time Management.
PROCESS MANAGEMENT: Introduction-Definitions of Process-Process
States-Process State Transitions-The Process Control Block-Operations on
Processes-Suspend and Resume-Interrupt Processing- The Nucleus of the
II Operating System. ASYNCHRONOUS CONCURRENT PROCESSES: 12
Introduction-Parallel Processing- A Control Structure for Indicating Parallelism:
Parbegin/Parend-Mutual Exclusion-Critical Sections-Mutual Exclusion
Primitives-Implementing Mutual Exclusion Primitives.
DEADLOCK AND INDEFINITE POSTPONEMENT: Introduction-
Examples of Deadlock-A Related Problem: Indefinite Postponement-Resource
Concepts-Four Necessary Conditions for Deadlock-Major areas of Deadlock
III 12
Research- Deadlock Prevention-Deadlock Avoidance and the Banker's
Algorithm-Deadlock Detection-Deadlock Recovery. REAL STORAGE:
Introduction-Storage Organization-Storage Management-Storage Hierarchy-

17
 Storage Management Strategies-Contiguous vs Non contiguous Storage
Allocation-Single User Contiguous Storage Allocation-Fixed Partition
Multiprogramming-Variable Partition Multiprogramming.
JOB AND PROCESSOR SCHEDULING: Scheduling Levels-Objectives-
Criteria-Preemptive vs Nonpreemptive Scheduling-The Interval Timer or
Interrupting Clock-Priorities-Deadline Scheduling-First In First Out(FIFO)-
IV 12
Round Robin(RR)-Shortest-Job-First(SJF)-Shortest- Remaining-Time (SRT)-
Highest-Response-Ratio-Next(HRN)-Multilevel Feedback Queues-Fair Share
Scheduling.
DISK PERFORMANCE OPTIMIZATION: Operation of Moving-Head Disk
Storage-Desirable Characteristics of Disk Scheduling Policies - Seek
Optimization - Rotational Optimization. FILE SYSTEMS: The File System-
V 12
File System Functions- The Data Hierarchy-Blocking and Buffering-File
Organization-Queued and Basic Access Methods-Allocating and Freeing Space-
File Descriptor.

Text Books:
1. Andrew S.Tanenbaum, “Operating Systems-Design And Implementation”, PHI Learning Private Ltd
2012. (Unit I).
2. H.M.Deitel,“Operating System”,Third Edition,Pearson Education, 2013(UNITS II,III,IV,V).
Reference Books:
1. Rohit Khurana, “Operating Systems”, Vikas Publishing House, First Edition, 2011.
2. Neeta Singh, “Operating System”, Global Academic Publishers, Second Edition, 2011.
3. I.Chandra Mohan “Operating System”, PHI Learning PVT Ltd, First Edition, 2013.
E-references:
1. https://www.studytonight.com/operating-system/cpu-scheduling
2. https://www.tutorialspoint.com/operating_system
3. https://www.slideshare.net/rajendraprasadalladi/operating-system-overview-concepts-ppt
4. https://www.geeksforgeeks.org/gate-notes-operating-system-process-management-introduction/
5. https://www.cs.uic.edu/~jbell/CourseNotes/OperatingSystems/

Mapping with Programme Specific Outcomes

PSO
PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 S S M H S
CO2 S S S M M
CO3 H S S H H
CO4 M S S S H
CO5 S S H S H
S - Strong; H - High; M - Medium; L - Low

18
 Programme Code: B.Sc. Programme Title: Computer Science
Course Code: 19UBMA52 Course Title: Batch: 2019
Semester: II
Total Hours: 90 Mathematics - II
Credits: 5.0

Course Objective
The course aims
 To learn the difference between Ordinary differential equations and Partial differential equations.
 To know about the mathematical logic concepts.

Course Outcome
On the successful completion of the course, students will be able to
Knowledge CO
Course Outcome
Level Number
K1 CO1 Identify the different methods of solving differential equations of the
first order and of the first degree
K2 CO2 Solve linear differential equation with constant coefficients
K3 CO3 Know the concepts of Gradient, Divergence and Curl.
K2 CO4Understand different kinds of logical connectives and properties of

binary relations.
K1 - Remember; K2 - Understanding; K3 - Apply; K4 - Analyze; K5 – Evaluate

SYLLABUS
No. of
Unit Content
Hours
Differential equations:
Introduction: Definitions - Solutions of Differential Equations –
Formation of Differential Equations. Equations of the first order and of the
first Degree: Type A: Variable Separable – Type B: Homogeneous
I 18
Equations – Type D: Linear Equations – Bernoulli’s Equation – Exact
Differential Equations.
Book 1: Chapter 1: Sections 1, 2, 3.
Chapter 2: Sections 1, 2, 4, 5, 6.1.
Linear Equation with Constant Coefficients:
Definitions - The operator D – Complementary function of a linear
II Equation with constant co-efficient – particular integral – General method 18
of finding P.I. – Special method of finding P.I. – Variation of Parameters.
Book 1: Chapter 3: Sections 1, 2, 3, 4, 6.
Vector Calculus:
Gradient, Divergence and Curl: Differentiation of vectors – Gradient
– Direction and magnitude of gradient – Divergence and curl – Formulae
III involving operator D. Vector integration: Line integral. 18
Book 2: Chapter II: Sections 1, 7, 8, 9, 10, 11.
Chapter IV: Sections 1, 2, 3.
Mathematical Logic:
Introduction – Statements and Notation – Connectives – Normal
IV 18
forms.
Book 3: Chapter 1: Sections 1-1 – 1-2.4, 1-2.6 – 1-2.13, 1-3 – 1-3.5.

19
 Set Theory:
Relations and Ordering: Relations – Properties of Binary Relations
in a set – Relation Matrix and the graph of a Relation – Partition and
V covering of a set – Equivalence Relations – Compatibility Relations – 18
Composition of Binary Relations. Functions: Definition and Introduction –
Composition of functions – Inverse Functions.
Book 3: Chapter 2: Sections 2-3.1 – 2-3.7, 2-4.1 – 2-4.3.

Text Books:
Book 1: Narayanan and Manicavachagom Pillay, “Ancillary Mathematics Book II”, S.Viswanathan
(Printers and Publishers), Pvt. Ltd., 1999.
Book 2: Narayanan and Manicavachagom Pillay, “Ancillary Mathematics Book III”, S.Viswanathan
(Printers and Publishers), Pvt. Ltd., 1998.
Book 3: J.P.Trembly and R.Manohar, “Discrete Mathematical Structures with Applications to Computer
Science”, McGraw Hill Education (India) Private Limited, 1997.

Reference Books:
1. Shanti Narayan, “A Basic Course in Vector Algebra and Vector Calculus”, S.Chand & Company
Publication.
2. Shanti Narayan, “Differential Calculus”, S.Chand & Company Publication.
3. T.Veerarajan, “Discrete Mathematics with Graph Theory and Combinatorics”, Tata McGraw–Hill,
New Delhi, Fifth Reprint, 2008.
E-reference:
1. http://ocw.mit.edu/courses/mathematics

Mapping with Programme Specific Outcomes

PSO
PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 H M M M L

CO2 S M M L H

CO3 S H H M H

CO4 S H H S H
S - Strong; H - High; M - Medium; L – Low

20
Programme Code: B.Sc. Programme Title: Computer Science
Course Code: 20UACSPB Course Title: Batch: 2020
Major Core Programming Lab - II: Semester: II
Total Hours: 60 (C++)
(Common for CS, BCA, IT, CT) Credits: 2.0

Course Objective
The course aims
To understand the feature of C++ supporting object oriented programming.
To develop the knowledge of how to represent real-life entities of problems in system design.
To implement inheritance and file operations.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Course Outcome
Level Number
Remember the basic knowledge of object oriented concepts and to write
K1, K2, K5 CO1
simple programs.
Understand and develop application programs using operators, loops and
K1, K2, K5 CO2
functions.
K1, K2, K3, Write programs by applying the class structure as fundamental and
CO3
K5 modular building block.
K1, K2, K3, Analyze the role of inheritance, polymorphism and building reusable code
CO4
K4 in application programs.
Write and evaluate the C++ programs with pointers, file and error
K3, K4, K5 CO5
handling mechanisms.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate

Program List
1. Write a C++ program to find the factorial of the given number using recursive function.
2. Write a C++ program for string manipulation using string handling functions.
3. Write a C++ program to find the biggest among the N numbers.
4. Write a C++ program to perform arithmetic operations using inline functions.
5. Write a C++ program for finding area of different shapes using function overloading.
6. Write a C++ program for displaying personal details using array of objects.
7. Write a C++ program for finding the largest number using friend function.
8. Write a C++ program for complex number addition using constructor.
9. Write a C++ program to join two strings using copy constructor.
10. Write a C++ program to perform arithmetic operations using operator overloading.
11. Write a C++ program to display product details using virtual functions.
12. Write a C++ program for electricity bill preparation using single inheritance.
13. Write a C++ program employee pay bill calculations using multiple inheritances.
14. Write a C++ program to create student mark sheet using multi level inheritance.
15. Write a C++ program to display bank details.

Text Book:
E. Balagurusamy, “Object Oriented Programming With C++”, Six Edition, Tata McGraw Hill, 2013.

21
Reference Books:
1. Ananthi Sheshasaayee, G Sheshasaayee,”Object Oriented Programming With C++”, First Edition,
Margham Publication, 2001.
2. Bjarne Stroustrup, “The C++ Programming Language”, 4th Edition, Addison Wesley, 2013.
3. Anirban Das, Goutam Panigraphi, “Object Oriented Programming With C++”, Second Edition,
Vikas Publishing Pvt Ltd, 2014.
4. M.T.Somashekara, D.S.Guru, H.S.Nagendraswamy and K.S.Mnajunatha, “Object Oriented
Programming with C++”, Second Edition, Vikas Publishing Pvt Ltd, 2012.
E-references:
1. https://en.cppreference.com/w/
2. https://www.tutorialspoint.com/cplusplus/cpp_references.htm
3. https://www.javatpoint.com/cpp-tutorial
4. https://beginnersbook.com/2017/08/c-plus-plus-tutorial-for-beginners
Mapping with Programme Specific Outcomes
PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5

CO1 S H M S L

CO2 S H M S L

CO3 S S H S H

CO4 S S S S H

CO5 H M S S S
S-Strong; H-High; M- Medium; L-Low

22
 Question Paper Pattern
(Common for Major, Allied, Allied Optional and Major Optional Papers)

For EOS Examinations: 70 Marks

The Question Paper is to be divided into THREE Sections.
Section-A Carries 15 Marks, Section-B Carries 25 Marks and Section-C Carries 30 Marks.

Section-A Contains 15 Multiple Choice Questions. (15 x 1 = 15 Marks)

Three Questions from each unit. (Q. No: 1 to 15)

Section-B Contains 5 Either or Choice Questions. (5 x 5 = 25)

Each Question carries 5 Marks. Both (a) and (b) from the same unit.
Q. No.: 16 (a) or (b) to 20(a) or (b)

Section-C Contains 5 Questions out of which, 3 Questions are to be answered. (3 x 10 = 30)

Each Question carries 10 Marks. One Question from each unit. Q. No.: 21 to 25

For CIA Examinations: 30 Marks

Section-A: 10 Multiple Choice Questions. (10 x 1 = 10)

Section-B: Two Questions out of Three. (2 x 5 = 10)

Section-C: One Question out of Two. (1 x 10 = 10)

23