B.Sc.

Computer Science Syllabus – May 2023

MOTHER TERESA WOMEN’S UNIVERSITY

KODAIKANAL

B. Sc. Computer Science

(2023-2024 Onwards)
(As per TANSCHE Framework)

May 2023

Mother Teresa Women’s University, Kodaikanal 1

B.Sc. Computer Science Syllabus – May 2023

B.Sc. Computer Science

1. Introduction

B. Sc. Computer Science

Education is the key to development of any society. Role of higher education is crucial
for securing right kind of employment and also to pursue further studies in best available world
class institutes elsewhere within and outside India. Quality education in general and higher
education in particular deserves high priority to enable the young and future generation of
students to acquire skill, training and knowledge in order to enhance their thinking, creativity,
comprehension and application abilities and prepare them to compete, succeed and excel
globally. Learning Outcomes-based Curriculum Framework (LOCF) which makes it student-
centric, interactive and outcome-oriented with well-defined aims, objectives and goals to
achieve. LOCF also aims at ensuring uniform education standard and content delivery across the
state which will help the students to ensure similar quality of education irrespective of the
institute and location.

Computer Science is the study of quantity, structure, space and change, focusing on
problem solving, application development with wider scope of application in science,
engineering, technology, social sciences etc. throughout the world in last couple of decades and
it has carved out a space for itself like any other disciplines of basic science and engineering.
Computer science is a discipline that spans theory and practice and it requires thinking both in
abstract terms and in concrete terms. Nowadays, practically everyone is a computer user, and
many people are even computer programmers. Computer Science can be seen on a higher level,
as a science of problem solving and problem solving requires precision, creativity, and careful
reasoning. The ever-evolving discipline of computer science also has strong connections to other
disciplines. Many problems in science, engineering, health care, business, and other areas can be
solved effectively with computers, but finding a solution requires both computer science
expertise and knowledge of the particular application domain. Computer science has a wide
range of specialties. These include Computer Architecture, Software Systems, Graphics,

Mother Teresa Women’s University, Kodaikanal 2

B.Sc. Computer Science Syllabus – May 2023

Artificial Intelligence, Computational Science, and Software Engineering. Drawing from a

common core of computer science knowledge, each specialty area focuses on specific
challenges. Computer Science is practiced by mathematicians, scientists and engineers.
Mathematics, the origins of Computer Science, provides reason and logic. Science provides the
methodology for learning and refinement. Engineering provides the techniques for building
hardware and software.

Programme Outcome, Programme Specific Outcome and Course Outcome

Computer Science is the study of quantity, structure, space and change, focusing on
problem solving, application development with wider scope of application in science,
engineering, technology, social sciences etc. The key core areas of study in Mathematics include
Algebra, Analysis (Real & Complex), Differential Equations, Geometry, and Mechanics. The
students completing this programme will be able to present Software application clearly and
precisely, make abstract ideas precise by formulating them in the Computer languages.
Completion of this programme will also enable the learners to join teaching profession, enhance
their employability for government jobs, jobs in software industry, banking, insurance and
investment sectors, data analyst jobs and jobs in various other public and private enterprises.

2. Programme Outcomes (PO) of B. Sc. degree programme in Computer Science

 Scientific aptitude will be developed in Students
 Students will acquire basic Practical skills & Technical knowledge along with domain
knowledge of different subjects in the Computer Science & humanities stream.
 Students will become employable; Students will be eligible for career opportunities in
education field, Industry, or will be able to opt for entrepreneurship.
 Students will possess basic subject knowledge required for higher studies, professional
and applied courses.
 Students will be aware of and able to develop solution oriented approach towards various
Social and Environmental issues.
 Ability to acquire in-depth knowledge of several branches of Computer Science and
aligned areas. This Programme helps learners in building a solid foundation for higher
studies in Computer Science and applications.

Mother Teresa Women’s University, Kodaikanal 3

B.Sc. Computer Science Syllabus – May 2023

 The skills and knowledge gained leads to proficiency in analytical reasoning, which can
be utilized in modelling and solving real life problems.
 Utilize computer programming skills to solve theoretical and applied problems by critical
understanding, analysis and synthesis.
 To recognize patterns and to identify essential and relevant aspects of problems.
 Ability to share ideas and insights while seeking and benefitting from knowledge and
insight of others.
 Mould the students into responsible citizens in a rapidly changing interdependent society.
The above expectations generally can be pooled into 6 broad categories and can be modified
according to institutional requirements:
PO1: Knowledge
PO2: Problem Analysis
PO3: Design / Development of Solutions
PO4: Conduct investigations of complex problems
PO5: Modern tool usage
PO6: Applying to society

3. Programme Specific Outcomes of B.Sc. Degree Programme in Computer Science

PSO1: Think in a critical and logical based manner
PSO2: Familiarize the students with suitable software tools of computer
science and industrial applications to handle issues and solve problems
in mathematics or statistics and real time application related sciences.
PSO3: Know when there is a need for information, to be able to identify,
locate, evaluate, and effectively use that information for the issue or
problem at hand.
PSO4: Understand, formulate, develop programming model with logical
approaches to Address issues arising in social science, business and
other contexts.
PSO5: Acquire good knowledge and understanding to solve specific
theoretical and applied problems in advanced areas of Computer
science and Industrial statistics.

Mother Teresa Women’s University, Kodaikanal 4

B.Sc. Computer Science Syllabus – May 2023

PO6: Provide students/learners sufficient knowledge and skills enabling

them to undertake further studies in Computer Science or Applications
or Information Technology and its allied areas on multiple disciplines
linked with Computer Science.
PO7: Equip with Computer science technical ability, problem solving skills,
creative talent and power of communication necessary for various
forms of employment.
PO8: Develop a range of generic skills helpful in employment, internships &
societal activities. Get adequate exposure to global and local concerns
that provides
PO9: platform for further exploration into multi-dimensional aspects of
Computing sciences.

4. Mapping of Course Learning Outcomes (CLOs) with Programme Outcomes (POs) and
Programme Specific Outcomes (PSOs) can be carried out accordingly, assigning the
appropriate level in the grids:
(put tick mark in each row)
POs PSOs
1 2 3 4 5 6 … 1 2 …
CLO1
CLO2
CLO3
CLO4
CLO5
CLO6
…

Mother Teresa Women’s University, Kodaikanal 5

B.Sc. Computer Science Syllabus – May 2023

5. Highlights of the Revamped Curriculum

 Student-centric, meeting the demands of industry & society, incorporating industrial
components, hands-on training, skill enhancement modules, industrial project, project
with viva-voce, exposure to entrepreneurial skills, training for competitive examinations,
sustaining the quality of the core components and incorporating application oriented
content wherever required.
 The Core subjects include latest developments in the education and scientific front,
advanced programming packages allied with the discipline topics, practical training,
devising mathematical models and algorithms for providing solutions to industry / real
life situations. The curriculum also facilitates peer learning with advanced mathematical
topics in the final semester, catering to the needs of stakeholders with research aptitude.
 The General Studies and Computer Science based problem solving skills are included as
mandatory components in the „Training for Competitive Examinations‟ course at the final
semester, a first of its kind.
 The curriculum is designed so as to strengthen the Industry-Academia interface and
provide more job opportunities for the students.
 The Industrial Statistics course is newly introduced in the fourth semester, to expose the
students to real life problems and train the students on designing a mathematical model to
provide solutions to the industrial problems.
 The Internship during the second year vacation will help the students gain valuable work
experience that connects classroom knowledge to real world experience and to narrow
down and focus on the career path.
 Project with viva-voce component in the fifth semester enables the student, application of
conceptual knowledge to practical situations. The state of art technologies in conducting
a survey in a scientific and systematic way and arriving at a precise solution is ensured.
Such innovative provisions of the industrial training, project and internships will give
students an edge over the counterparts in the job market.
 State-of Art techniques from the streams of multi-disciplinary, cross disciplinary and
inter disciplinary nature are incorporated as Elective courses, covering conventional
topics to the latest – Statistics with R Programming, Data Science, Machine learing.
Internet of Things and Artificial Intelligence etc..
Mother Teresa Women’s University, Kodaikanal 6
B.Sc. Computer Science Syllabus – May 2023

6. Value additions in the Revamped Curriculum:

Semester Newly introduced Components Outcome / Benefits
Foundation Course
To ease the transition of learning
from higher secondary to higher
 Instil confidence among students
I education, providing an overview of
 Create interest for the subject
the pedagogy of learning abstract
Mathematics and simulating
mathematical concepts to real world.
 Industry ready graduates
 Skilled human resource
 Students are equipped with essential
skills to make them employable
 Training on Computing / Computational
skills enable the students gain
knowledge and exposure on latest
computational aspects
 Data analytical skills will enable
students gain internships,
Skill Enhancement papers
I, II, apprenticeships, field work involving
(Discipline centric / Generic /
III, IV data collection, compilation, analysis
Entrepreneurial)
etc.
 Entrepreneurial skill training will
provide an opportunity for independent
livelihood
 Generates self – employment
 Create small scale entrepreneurs
 Training to girls leads to women
empowerment

Mother Teresa Women’s University, Kodaikanal 7

B.Sc. Computer Science Syllabus – May 2023

 Discipline centric skill will improve the

Technical knowhow of solving real life
problems using ICT tools
 Strengthening the domain knowledge
 Introducing the stakeholders to the State-
of Art techniques from the streams of
multi-disciplinary, cross disciplinary and
inter disciplinary nature
 Students are exposed to Latest topics on
Elective papers-
III, IV, Computer Science / IT, that require
An open choice of topics categorized
V & VI strong mathematical background
under Generic and Discipline Centric
 Emerging topics in higher education /
industry / communication network /
health sector etc. are introduced with
hands-on-training, facilitates designing
of mathematical models in the respective
sectors
 Exposure to industry moulds students
into solution providers
IV Industrial Statistics
 Generates Industry ready graduates
 Employment opportunities enhanced
 Practical training at the Industry/
Banking Sector / Private/ Public sector
II-year
organizations / Educational institutions,
Vacation Internship / Industrial Training
enable the students gain professional
activity
experience and also become responsible
citizens.
 Self-learning is enhanced
V  Application of the concept to real
Project with Viva – voce
Semester situation is conceived resulting in
tangible outcome

Mother Teresa Women’s University, Kodaikanal 8

B.Sc. Computer Science Syllabus – May 2023

 Curriculum design accommodates all

category of learners; „Mathematics for
Advanced Explain‟ component will
comprise of advanced topics in
Mathematics and allied fields, for those
VI Introduction of in the peer group / aspiring researchers;
Semester Professional Competency component  „Training for Competitive Examinations‟
–caters to the needs of the aspirants
towards most sought - after services of
the nation viz, UPSC, CDS, NDA,
Banking Services, CAT, TNPSC group
services, etc.
Extra Credits:  To cater to the needs of peer learners /
For Advanced Learners / Honors degree research aspirants
 Knowledge, Problem Solving, Analytical
ability, Professional Competency,
Skills acquired from the Courses
Professional Communication and
Transferrable Skill

9. Consolidated Semester wise and Component wise Credit distribution

Total
Parts Sem I Sem II Sem III Sem IV Sem V Sem VI
Credits
Part I 3 3 3 3 - - 12
Part II 3 3 3 3 - - 12
Part III 12 12 12 11 19 21 87
Part IV
4 4 5 6 7 3 29
& Part V
Total 22 22 23 23 26 24 140

Mother Teresa Women’s University, Kodaikanal 9

B.Sc. Computer Science Syllabus – May 2023

*Part I. II , and Part III components will be separately taken into account for CGPA
calculation and classification for the under graduate programme and the other
components. IV, V have to be completed during the duration of the programme as per the
norms, to be eligible for obtaining the UG degree

10. Illustration for B. Sc. Computer Science Curriculum Design

FIRST YEAR
(Academic Year 2023-2024 Onwards)
Semester-I
Course Code Course Title Credits Hours CIA ESE Total
Language – 1:
U23CS1L11 3 6 25 75 100
Tamil/Hindi/Others
U23CS1L21 Language2 – English 3 6 25 75 100
U23CS1C01 Core1 – OOPS using C++ 5 5 25 75 100
U23CS1C02 Core2 – OOPS using C++ Lab 5 5 25 75 100
Elective 1 – Discrete
3 4 25 75 100
Mathematics
SEC1 – Problem Solving
U23CS1SEC1 2 2 25 75 100
Techniques
Foundation Course –
Fundamentals of Information 2 2 25 75 100
Technology
Total 23 30 - - 700

Mother Teresa Women’s University, Kodaikanal 10

B.Sc. Computer Science Syllabus – May 2023

Semester-II
Course Code Course Title Credits Hours CIA ESE Total
Language – 1: 100
U23CS2L12 3 6 25 75
Tamil/Hindi/Others
U23CS2L22 Language2 – English 3 6 25 75 100
Core3 – Data Structures and 100
U23CS2C03 5 5 25 75
Algorithms
Core4 – Data Structures and 100
U23CS2C04 5 5 25 75
Algorithms Lab
Elective 2 – Digital Computer 100
3 4 25 75
Fundamentals
100
U23CS2SEC2 SEC2 – Quantitative Aptitude 2 2 25 75

U23CS2SEC3 SEC3– Web Designing 2 2 25 75 100

Total 23 30 - - 700

SYLLABUS
First Year (Semester – I)
Course Code Credits
Core 1 – OOPS using C++
U23CS1C01 5
Lecture Tutorial Lab Practice Total:(L+T+P)
Hours:4 (L) Per week Hours: 5(T) per week Hours: 0(P) per week Per week: 5
Course Category: Year & Semester: Admission Year:
Core I Year I Semester 2023-2024
Pre-requisite Basic Knowledge of Programming concept
Learning Objectives: (for teachers: what they have to doing the class /lab /field)
 To gain knowledge in C++ language.
 To inculcate fundamental programming skills.

Mother Teresa Women’s University, Kodaikanal 11

 B.Sc. Computer Science Syllabus – May 2023

Course Outcomes: (for students: To know what they are going to learn)
CO1: Remember the program of C++ with its syntax and semantics
CO2: Understand the programming principles in C++ (data types, operators, branching and
looping, arrays, functions, structures, pointers and files)
CO3: Apply the programming principles learnt in real-time problems
CO4: Analyze the various methods of solving a problem and choose the best method
CO5: Code, debug and test the programs with appropriate test cases
Recap: (not for examination) Motivation/previous lecture/relevant portions required for the
course) (This is done during 2 Tutorial hours)
Required
Units Contents
Hours
Principles of object Oriented Programming : Software evolution –
Basic concepts of object Oriented Programming – Benefits of OOPS –
I 15
Object Oriented Language – Application of OOPS – Beginning with
C++.
Token, Expressions and Control Structure Functions : Token –
Keyword – Identifier and constant – Basic Data Types – User defined
data type- Derived data type – Operators in C++ - Scope Resolution
II 15
Operator – Member dereferencing Operator – Manipulators – Type
cast Operators –Expression and their types – Implicit conversion –
Control structures.
Classes and Objects – Constructor and Destructors – Operator
III 15
overloading and Type conversions.
Inheritance: Extending Classes – Pointers, Virtual Function and
IV 15
Polymorphism – Managingconsoles I/O operations.
Working with Files – Templates – Exception Handling.
V 15

Total (Hrs.) 75
Extended Professional Component Questions related to the above topics, from
(is a part of internal component only, Not various competitive examinations
to be included in the External UPSC/TRB/NET/UGC–

Mother Teresa Women’s University, Kodaikanal 12

B.Sc. Computer Science Syllabus – May 2023

Examination question paper) CSIR/GATE/TNPSC/others to be solved (To be

discussed during the Tutorial hour)
Skills acquired from the course Knowledge, Problem Solving, Analytical ability,
Professional Competency, Professional
Communication and Transferrable Skill
Learning Resources:
Text Book:
1. Object oriented Programming with C++ by E. Balagurusamy Tata McGraw Hill
PublishingCompany Limited 1998 Chapter: 1 to 11.
Reference Book:
1. C++, the Complete Reference Herbert Schlitz, 1997.

Course Code Credits

Core 2 - OOPS using C++ Lab
U23CS1C02 5
Lecture Tutorial Lab Practice Total:(L+T+P)
Hours:0 (L) Per week Hours:0 (T) per week Hours:5 (P) per week Per week: 5
Admission Year:
Course Category: Core Year & Semester: I Year I Semester
2023-2024
Pre-requisite Basic Knowledge of Programming concept
Learning Objectives:
 To implement programming skills using C++.
 To impart knowledge and provide efficient solutions for real time problems using
C++ language
Course Outcomes:(for students: To know what they are going to learn)
CO1: Remember and understand how to write programs using the basic syntax and semantics in C++
CO2: Apply the concepts of functions, arrays, pointers and files in programs to solve problems
CO3: Analyze and understand programs written in C++ language
CO4: Evaluate the program execution flow with test cases and apply debugging
CO5: Design algorithms and write programs in C++ language for the given problems

Mother Teresa Women’s University, Kodaikanal 13

B.Sc. Computer Science Syllabus – May 2023

Recap:(not for examination) Motivation/previous lecture/relevant portions required for the

course)(This is done during 2 Tutorial hours)
S.No Contents Required Hours
1. Simple Programs
2. Arrays
3. Strings
4. Functions
5. Recursion
6. Structures
7. Pointers
8. Arrays with Structures
9. Arrays with Pointers
75
10. Files
11. Call by value & call by reference method
12. Inline function in C++
13. Function overloading
14. Default Arguments
15. Operator overloading
16. Program using Inheritance
17. Program using polymorphism and virtual functions
18. File concepts
Total(Hrs.) 75
Extended Professional Component Questions related to the above topics, from
(is a part of internal component only, Not various competitive examinations
to be included in the External UPSC/TRB/NET/UGC/CSIR/GATE/TNPSC/oth
Examination question paper) ers to be solved (To be discussed during the
Tutorial hour)
Skills acquired from the course Knowledge, Problem Solving, Analytical ability,
Professional Competency, Professional
Communication and Transferrable Skill

Mother Teresa Women’s University, Kodaikanal 14

B.Sc. Computer Science Syllabus – May 2023

Learning Resources:
Recommended Texts
1. Object oriented Programming with C++ by E. Balagurusamy Tata McGraw Hill
PublishingCompany Limited 1998 Chapter: 1 to 11.

Reference Book:
1. C++, the Complete Reference Herbert Schlitz, 1997.

Mother Teresa Women’s University, Kodaikanal 15

B.Sc. Computer Science Syllabus – May 2023

Course Code Credits

SBE 1 - Discrete Mathematics
3
Lecture Tutorial Lab Practice Total:(L+T+P)
Hours: 4(L) Per week Hours: 4(T) per week Hours:0(P) per week Per week: 4
Course Category: Year & Semester: Admission Year:
SBE I Year I Semester 2023-2024
Pre-requisite Basic Knowledge of Mathematics
Learning Objectives:
 To understand problem solving method.
 To Understand about Boolean algebra.
 To Describes Relations.
 Students completing this course will be able to evaluate Boolean functions and
simplify expressions using the properties of Boolean algebra..
Course Outcomes: (for students: To know what they are going to learn)
CO1: Know how to solve set and logic problems
CO2: Use of Relations, and Functions
CO3: Use Groups and Lagrange‟s theorem
CO4: Apply the methods for solving Matrix problems
CO5: Use of posets, Hasse diagram , lattice and its properties.
Recap: (not for examination) Motivation/previous lecture/relevant portions required for the
course) (This is done during 2 Tutorial hours)
Required
Units Contents
Hours
Review of theory of sets – Relations – Equivalence Relations –
I 15
partial Order – Function – Binary Operations.
Logic – Introduction – connectives – Truth Table – Tautology –
II 15
Implications – Equivalences.
Groups – Definitions & Examples – Elementary – Properties – Sub
III 15
Groups – Cycle groups – Cosets and Lagrange‟s Theorem – Normal

Mother Teresa Women’s University, Kodaikanal 16

B.Sc. Computer Science Syllabus – May 2023

Subgroups.
Matrices – Special type of Matrices – operations – Inverse of a
Martrices – Elementary Transformation – Rank of Matrix –
IV 15
Simultaneous Linear Equation – Eigen values and Eigen vectors –
Cayley Hamiltion theorem.
Partial Ordering – Posets – Hasse Diagram - Lattices – Properties –
V 15
Sub Lattices – Speciallattices – Boolean Alegbra.
Total (Hrs.) 75
Extended Professional Component Questions related to the above topics, from
(is a part of internal component only, various competitive examinations
Not to be included in the External UPSC/TRB/NET/UGC/CSIR/GATE/ TNPSC/
Examination question paper) others to be solved (To be discussed during the
Tutorial hour)
Skills acquired from the course Knowledge, Problem Solving, Analytical
ability, Professional Competency, Professional
Communication and Transferrable Skill
Learning Resources:
Recommended Texts
1. Modern algebra & S. Arumugam & Thangapandi Issac, New Gamma Publishing
House,Palamkottai.
2. Discrete mathematics by M.K. Venkataramanan and N. Chandrasekaran, nation
publishingCO., Chennai.

Mother Teresa Women’s University, Kodaikanal 17

B.Sc. Computer Science Syllabus – May 2023

Course Code SEC 1 – Problem Solving Techniques Credits

U23CS1SEC1 2
Lecture Tutorial Lab Practice Total:(L+T+P)
Hours: 2(L) Per week Hours: 2(T) per week Hours:0(P) per week Per week: 2
Course Category: Year & Semester: Admission Year:
SEC I Year I Semester 2023-2024
Pre-requisite Basic of Problem-solving skills
Learning Objectives:
 To understand the importance of algorithms and programs, and to know of the
basic problem solving strategies.
 To learn efficient strategies and algorithms to solve standard problems, thus laying a
firm foundation for designing algorithmic solutions to problems.
Course Outcomes:(for students: To know what they are going to learn)
CO1: Understand the systematic approach to problem solving.
CO2: Know the approach and algorithms to solve specific fundamental problems.
CO3: Understand the efficient approach to solve specific factoring-related problems.
CO4: Understand the efficient array-related techniques to solve specific problems.
CO5: Understand the efficient methods to solve specific problems related to text processing.
Understand how recursion works.
Recap:(not for examination) Motivation/previous lecture/relevant portions required for the
course)(This is done during 2 Tutorial hours)
Required
Units Contents
Hours
Introduction: Notion of algorithms and programs – Requirements
for solving problems by computer – The problem-solving aspect:
Problem definition phase, Getting started on a problem, The use of
I specific examples, Similarities among problems, Working 6
backwards from the solution – General problem-solving strategies -
Problem solving using top-down design – Implementation of
algorithms – The concept of Recursion.

Mother Teresa Women’s University, Kodaikanal 18

B.Sc. Computer Science Syllabus – May 2023

Fundamental Algorithms: Exchanging the values of two variables

– Counting - Summation of a set of numbers - Factorial computation
II 6
- Sine function computation - Fibonacci Series generation -
Reversing the digits of an integer – Base Conversion.
Factoring Methods: Finding the square root of a number – The
smallest divisor of an integer – Greatest common divisor of two
III integers - Generating prime numbers – Computing the prime factors 6
of an integer – Generation of pseudo-random numbers - Raising a
number to a large power – Computing the nth Fibonacci number.
Array Techniques: Array order reversal – Array counting or histo-
gramming – Finding the maximum number in a set - Removal of
IV 6
duplicates from an ordered array - Partitioning an array – Finding the
kth smallest element – Longest monotone subsequence.
Text Processing and Pattern Searching: Text line length
adjustment – Left and right justification of text – Keyword searching
V 6
in text – Text line editing – Linear pattern search. Recursive
algorithms: Towers of Hanoi – Permutation generation.
Total (Hrs.) 30
Extended Professional Component Questions related to the above topics, from
(is a part of internal component only, various competitive examinations
Not to be included in the External UPSC/TRB/NET/UGC/CSIR/GATE/ TNPSC/
Examination question paper) others to be solved (To be discussed during the
Tutorial hour)
Skills acquired from the course Knowledge, Problem Solving, Analytical ability,
Professional Competency, Professional
Communication and Transferrable Skill
Learning Resources:
Recommended Texts
1. R. G. Dromey, How to Solve it by Computer, Pearson India, 2007.

Mother Teresa Women’s University, Kodaikanal 19

B.Sc. Computer Science Syllabus – May 2023

Reference Books
1. George Polya, Jeremy Kilpatrick, The Stanford Mathematics Problem Book: With Hints
and Solutions, Dover Publications, 2009 (Kindle Edition 2013).
2. Greg W. Scragg, Problem Solving with Computers, Jones & Bartlett 1st edition, 1996.
Web Resources
 https://onlinecourses.nptel.ac.in/noc22_cs101/preview
 https://onlinecourses.nptel.ac.in/noc19_cs43/preview

Mother Teresa Women’s University, Kodaikanal 20

B.Sc. Computer Science Syllabus – May 2023

Course Code AEC 1 – Fundamentals of Information Credits

U23CS1AEC1 Technology 2
Lecture Tutorial Lab Practice Total:(L+T+P)
Hours: 2(L) Per week Hours: 2(T) per week Hours:0(P) per week Per week: 2
Course Category: Year & Semester: Admission Year:
AEC1 I Year I Semester 2023-2024
Pre-requisite Basics of Computer
Learning Objectives:
 To understand the importance of Information Technology.
 To learn about software and Operation System.
Course Outcomes: (for students: To know what they are going to learn)
CO1: Understand basic concepts and terminology of information technology.
CO2: Have a basic understanding of personal computers and their operation.
CO3: Be able to identify data storage and its usage.
CO4: Get great knowledge of software and its functionalities.
CO5: Understand about operating system and their uses.
Recap: (not for examination) Motivation/previous lecture/relevant portions required for the
course) (This is done during 2 Tutorial hours)
Required
Units Contents
Hours
Introduction to Computers:
Introduction, Definition, .Characteristics of computer,
Evolution of Computer, Block Diagram Of a computer,
I 6
Generations of Computer, Classification Of Computers,
Applications of Computer, Capabilities and limitations of
computer
Basic Computer Organization:
II Role of I/O devices in a computer system. Input Units: 6
Keyboard, Terminals and its types. Pointing Devices,

Mother Teresa Women’s University, Kodaikanal 21

B.Sc. Computer Science Syllabus – May 2023

Scanners and its types, Voice Recognition Systems, Vision

Input System, Touch Screen, Output Units: Monitors and
its types. Printers: Impact Printers and its types. Non Impact
Printers and its types, Plotters, types of plotters, Sound
cards, Speakers.
Storage Fundamentals:
Primary Vs Secondary Storage, Data storage & retrieval
methods. Primary Storage: RAM ROM, PROM, EPROM,
III 6
EEPROM. Secondary Storage: Magnetic Tapes, Magnetic
Disks. Cartridge tape, hard disks, Floppy disks Optical
Disks, Compact Disks, Zip Drive, Flash Drives
Software:
Software and its needs, Types of S/W. System Software:
Operating System, Utility Programs Programming
IV Language: Machine Language, Assembly Language, High 6
Level Language their advantages & disadvantages.
Application S/W and its types: Word Processing, Spread
Sheets Presentation, Graphics, DBMS s/w
Operating System:
Functions, Measuring System Performance, Assemblers,
V Compilers and Interpreters.Batch Processing, 6
Multiprogramming, Multi Tasking, Multiprocessing, Time
Sharing, DOS, Windows, Unix/Linux.
Total (Hrs.) 30
Extended Professional Questions related to the above topics, from various
Component (is a part of internal competitive examinations UPSC/ TRB/ NET/ UGC/
component only, Not to be CSIR/ GATE/ TNPSC/ others to be solved (To be
included in the External discussed during the Tutorial hour)
Examination question paper)

Mother Teresa Women’s University, Kodaikanal 22

B.Sc. Computer Science Syllabus – May 2023

Skills acquired from the course Knowledge, Problem Solving, Analytical ability,
Professional Competency, Professional
Communication and Transferrable Skill
Learning Resources:
Recommended Texts
1. Anoop Mathew, S. KavithaMurugeshan (2009), “ Fundamental of Information Technology”,
Majestic Books.
2. Alexis Leon, Mathews Leon,” Fundamental of Information Technology”, 2nd Edition.
3. S. K Bansal, “Fundamental of Information Technology”.

Reference Books
1. BhardwajSushilPuneet Kumar, “Fundamental of Information Technology”
2. GG WILKINSON, “Fundamentals of Information Technology”, Wiley-Blackwell
3. A Ravichandran , “Fundamentals of Information Technology”, Khanna Book Publishing

Web Resources
1. https://testbook.com/learn/computer-fundamentals
2. https://www.tutorialsmate.com/2020/04/computer-fundamentals-tutorial.html
3. https://www.javatpoint.com/computer-fundamentals-tutorial
4. https://www.tutorialspoint.com/computer_fundamentals/index.htm
5. https://www.nios.ac.in/media/documents/sec229new/Lesson1.pdf

Mother Teresa Women’s University, Kodaikanal 23

B.Sc. Computer Science Syllabus – May 2023

First Year (Semester – II)

Course Code Credits
Core 3 – Data Structures and Algorithms
U23CS2C03 5
Lecture Tutorial Lab Practice Total:(L+T+P)
Hours: 5(L) Per week Hours: 5(T) per week Hours:0(P) per week Per week: 5
Course Category: Year & Semester: Admission Year:
Core I Year II Semester 2023-2024
Pre-requisite Basic knowledge in data storage and representations
Learning Objectives: (for teachers: what they have to doing the class/lab/field)
 To impart the basic concepts of data structures and algorithms.
 To acquaint the student with the basics of the various data structures and make
the students knowledgeable in the area of data structures.
 This course also gives insight into the various algorithm design techniques
Course Outcomes: (for students: To know what they are going to learn)
CO1: To introduce the concepts of Data structures and to understand simple linear data
structures.
CO2: Learn the basics of stack data structure, its implementation and application
CO3: Use the appropriate data structure in context of solution of given problem and
demonstrate a familiarity with major data structures.
CO4: To introduce the basic concepts of algorithms
CO5: To give clear idea on algorithmic design paradigms like Dynamic Programming,
Backtracking, Branch and Bound
Recap: (not for examination) Motivation/previous lecture/relevant portions required for the
course)(This is done during 2 Tutorial hours)
Required
Units Contents
Hours
INTRODUCTION TO DATA STRUCTURES:
I Data Structures: Definition- Time & Space Complexity, Arrays: 15
Representation of arrays, Applications of arrays, sparse matrix and its

Mother Teresa Women’s University, Kodaikanal 24

B.Sc. Computer Science Syllabus – May 2023

representation,
Linear list: Singly linked list implementation, insertion, deletion and
searching operations on linear list, Circular linked list: implementation,
Double linked list implementation, insertion, deletion and searching
operations. Applications of linked lists- Dynamic Storage management.
STACKS: Operations, array and linked representations of stack, stack
II applications, infix to postfix conversion, postfix expression evaluation, 15
recursion implementation
QUEUES, TREES & GRAPHS:
Queues: operations on queues, array and linked representations.
Circular Queue: operations,, applications of queues.
III Trees: Definitions and Concepts- Representation of binary tree, Binary 15
tree traversals (Inorder, Postorder , preorder), Binary search trees
Graphs : Representation of Graphs- Types of graphs -Breadth first
traversal – Depth first traversal- -Applications of graphs.
INTRODUCTION TO ALGORITHMS:
INTRODUCTION: Definition of Algorithms- Overview and importance
of algorithms- pseudocode conventions, Asymptotic notations, practical
complexities.
IV 15
Divide-and-Conquer: General Method – Binary Search- Quick Sort-
Merge Sort.
Greedy Method: General method- Knapsack problem- Tree vertex
splitting- Job sequencing with deadlines
DYNAMIC PROGRAMMING, BACKTRACKING & BRANCH &
BOUND
Dynamic programming: General method, Multistage Graphs, All pairs
V shortest path, Single source shortest path. 15
Backtracking: General method, 8 Queens, Graph coloring, Hamiltonian
cycle.
Branch & Bound: General method, Travelling salesperson problem.
Total (Hrs.) 75

Mother Teresa Women’s University, Kodaikanal 25

B.Sc. Computer Science Syllabus – May 2023

Extended Professional Component Questions related to the above topics, from various
(is a part of internal component only, competitive examinations UPSC/TRB/NET/UGC/
Not to be included in the External CSIR/GATE/ TNPSC/ others to be solved (To be
Examination question paper) discussed during the Tutorial hour)
Skills acquired from the course Knowledge, Problem Solving, Analytical ability,
Professional Competency, Professional
Communication and Transferrable Skill
Learning Resources:

Recommended Texts
1. Ellis Horowitz , Sartaj Sahni, Susan Anderson Freed, Second Edition , “Fundamentals of
Data in C”, Universities Press
2. E. Horowitz, S. Sahni and S. Rajasekaran, Second Edition ,“Fundamentals of Computer
Algorithms “ Universities Press

Reference Books
1. Seymour Lipschutz ,”Data Structures with C”, First Edition, Schaum‟s outline series in
computers, Tata McGraw Hill.
2. R.Krishnamoorthy and G.Indirani Kumaravel, Data Structures using C, Tata
McGrawHill – 2008.
3. A.K.Sharma, Data Structures using C , Pearson Education India,2011.
4. G. Brassard and P. Bratley, “Fundamentals of Algorithms”, PHI, New Delhi, 1997.
5. A.V. Aho, J.E. Hopcroft, J.D. Ullmann,, “The design and analysis of Computer
Algorithms”, Addison Wesley, Boston, 1974
6. Thomas H. Cormen, C.E. Leiserson, R L.Rivest and C. Stein, Introduction to
Algorithms, Third edition, MIT Press, 2009
7. Sanjoy Dasgupta, C.Papadimitriou and U.Vazirani , Algorithms , Tata McGraw-Hill,
2008.
Web Resources:
 https://archive.nptel.ac.in/courses/106/102/106102064/
 https://nptel.ac.in/courses/106102064

Mother Teresa Women’s University, Kodaikanal 26

B.Sc. Computer Science Syllabus – May 2023

Course Code Credits

Core 4 – Data Structures and Algorithms Lab
U23CS2C04 5
Lecture Tutorial Lab Practice Total:(L+T+P)
Hours:0(L) Per week Hours:0 (T) per week Hours:5(P) per week Per week: 5
Course Category: Year & Semester: Admission Year:
Core I Year II Semester 2023-2024
Pre-requisite Basic skills in problem solving and
Learning Objectives:(for teachers: what they have to doing the class/lab/field)
 To understand and implement basic data structures using C
 To apply linear and non-linear data structures in problem solving.
 To learn to implement functions and recursive functions by means of data structures
 To implement searching and sorting algorithms
Course Outcomes:(for students: To know what they are going to learn)
CO1: Implement data structures using C
CO2: Implement various types of linked lists and their applications
CO3: Implement Tree Traversals
CO4: Implement various algorithms in C
CO5: Implement different sorting and searching algorithms
Recap:(not for examination) Motivation/previous lecture/relevant portions required for the
course)(This is done during 2 Tutorial hours)
Required
List of Exercises:
Hours
Implement the following exercises using C Programming language:
1. Array implementation of stacks
2. Array implementation of Queues
3. Linked list implementation of stacks
75
4. Linked list implementation of Queues
5. Binary Tree Traversals (Inorder, Preorder, Postorder)
6. Implementation of Linear search and binary search
7. Implementation Insertion sort, Quick sort and Merge Sort

Mother Teresa Women’s University, Kodaikanal 27

B.Sc. Computer Science Syllabus – May 2023

8. Implementation of Depth-First Search & Breadth-First Search of

Graphs.
9. Finding all pairs of Shortest Path of a Graph.
10. Finding single source shortest path of a Graph.
Total (Hrs.) 75
Extended Professional Component Questions related to the above topics, from
(is a part of internal component only, various competitive examinations
Not to be included in the External UPSC/TRB/NET/UGC/ CSIR/GATE/ TNPSC/
Examination question paper) others to be solved (To be discussed during the
Tutorial hour)
Skills acquired from the course Knowledge, Problem Solving, Analytical ability,
Professional Competency, Professional
Communication and Transferrable Skill
Learning Resources:

Recommended Texts
1. Ellis Horowitz , Sartaj Sahni, Susan Anderson Freed, Second Edition , “Fundamentals
of Data in C”, Universities Press
2. E. Horowitz, S. Sahni and S. Rajasekaran, Second Edition ,“Fundamentals of
Computer Algorithms “ Universities Press

Reference Books
1. Seymour Lipschutz ,”Data Structures with C”, First Edition, Schaum‟s outline series in
computers, Tata McGraw Hill.
2. R.Krishnamoorthy and G.Indirani Kumaravel, Data Structures using C, Tata
McGrawHill – 2008.
3. A.K.Sharma, Data Structures using C , Pearson Education India,2011.
4. G. Brassard and P. Bratley, “Fundamentals of Algorithms”, PHI, New Delhi, 1997.
5. A.V. Aho, J.E. Hopcroft, J.D. Ullmann,, “The design and analysis of Computer
Algorithms”, Addison Wesley, Boston, 1974

Mother Teresa Women’s University, Kodaikanal 28

B.Sc. Computer Science Syllabus – May 2023

6. Thomas H. Cormen, C.E. Leiserson, R L.Rivest and C. Stein, Introduction to

Algorithms, Third edition, MIT Press, 2009
7. Sanjoy Dasgupta, C.Papadimitriou and U.Vazirani , Algorithms , Tata McGraw-Hill,
2008.

Web Resources:
 https://archive.nptel.ac.in/noc/courses/noc18/SEM1/noc18-cs25/
 https://archive.nptel.ac.in/courses/106/106/106106127/

Mother Teresa Women’s University, Kodaikanal 29

B.Sc. Computer Science Syllabus – May 2023

Course Code Credits

SBE 2 – Digital Computer Fundamentals
U23CS2SBE2 3
Lecture Tutorial Lab Practice Total:(L+T+P)
Hours: 4(L) Per week Hours: 4(T) per week Hours:0(P) per week Per week: 4
Course Category: Year & Semester: Admission Year:
SBE I Year II Semester 2023-2024
Pre-requisite Basic knowledge in Mathematics (numbers, algebra, Gates)
Learning Objectives: (for teachers: what they have to doing the class/lab/field)
 It aims to train the student of the basic concepts of Digital Computer Fundamentals
 To impart the in-depth knowledge of logic gates, Boolean
algebra, combinational circuits and sequential circuits.
Course Outcomes: (for students: To know what they are going to learn)
CO1: Identify the logic gates and their functionality.
CO2: Perform number conversions from one system to another system
CO3: Understand the functions of combinational circuits
CO4: Perform number conversions.
CO5: Perform Counter design and learn its operations.
Recap:(not for examination) Motivation/previous lecture/relevant portions required for the
course)(This is done during 2 Tutorial hours)
Required
Units Contents
Hours
Number System sand Codes: Number System–Base
I Conversion – Binary Codes – Code Conversion. Digital Logic: 12
Logic Gates – Truth Tables – Universal Gates.
Boolean Algebra: Laws and Theorems – SOP, POS Methods –
Simplification of Boolean Functions– Using Theorems, K-Map,
Prime–Implicant Method–Binary Arithmetic: Binary Addition –
II 12
Subtraction – Various Representations of Binary Numbers–
Arithmetic Building Blocks–Adder–Subtractor.

Mother Teresa Women’s University, Kodaikanal 30

B.Sc. Computer Science Syllabus – May 2023

Combinational Logic: Multiplexers – Demultiplexers –

III Decoders – Encoders –Code Converters–Parity Generator sand 12
Checkers.
Sequential Logic: RS, JK, D, and T Flip-Flops – Master-Slave
IV 12
Flip-Flops. Registers: Shift Registers–Types of Shift Registers.
Counters: Asynchronous and Synchronous Counters - Ripple,
V Mod, Up- Down Counters– Ring Counters. Memory: Basic 12
Terms and Ideas –Types of ROMs –Types of RAMs.
Total (Hrs.) 60
Extended Professional Component Questions related to the above topics, from various
(is a part of internal component only, competitive examinations UPSC/TRB/NET/UGC/
Not to be included in the External CSIR/GATE/ TNPSC/ others to be solved (To be
Examination question paper) discussed during the Tutorial hour)
Skills acquired from the course Knowledge, Problem Solving, Analytical ability,
Professional Competency, Professional
Communication and Transferrable Skill
Learning Resources:

Recommended Texts
1. V. Rajaraman and T.Radhakrishnan, Digital Computer Design, Prentice HallofIndia,2001
2. D .P. Leach and A. P. Malvino, Digital Principle sand Applications–TMH–Fifth Edition–
2002.
3. M. Moris Mano, Digital Logic and Computer Design,PHI,2001.

Reference Books
1. T.C. Bartee, Digital Computer Fundamentals, 6th Edition, Tata McGraw Hill,1991.

Web Resources
 https://onlinecourses.swayam2.ac.in/cec19_cs06/preview
 https://onlinecourses.swayam2.ac.in/cec21_cs17/preview

Mother Teresa Women’s University, Kodaikanal 31

 B.Sc. Computer Science Syllabus – May 2023

Course Code SEC 2 – Quantitative Aptitude Credits

U23CS2SEC2 2
Lecture Tutorial Lab Practice Total:(L+T+P)
Hours: 2(L) Per week Hours:2 (T) per week Hours:0(P) per week Per week: 2
Course Category: Year & Semester: Admission Year:
SEC I Year II Semester 2023-2024
Pre-requisite Basic knowledge of English, Mathematics
Learning Objectives:(for teachers :what they have to doing the class/lab/field)
 To improve the quantitative skills of the students
 To Train the students for competitive examinations
 To increase the chances of employability
 Effort has been made to accommodate fundamental, mathematical aspects to instill
confidence among students.
 Enrich their knowledge and to develop their logical reasoning thinking ability.
Course Outcomes:(for students: To know what they are going to learn)
After successful completion of this course, students will have the knowledge and skills to
 CO1: to Understand the basic concepts of Quantitative Aptitude and Arithmetic techniques.
 CO2: to attempt aptitude questions in various competitive exams like CAT, CMAT, IBPS,
 UPSC, Railways, and Banks etc.
CO3: Solve the problems easily by using Short-cut method with time management which will
be helpful to them to clear the competitive exams for better job opportunity.
CO4: Analyze the Problems logically and approach the problems in a different manner.
Recap: (not for examination) Motivation/previous lecture/relevant portions required for the
course)(This is done during 2 Tutorial hours)
Required
Units Contents
Hours
Numbers-HCF and LCM of numbers – Decimal fractions-
Simplification – Square roots and cube roots - Average-
I 6
problems on Numbers

Mother Teresa Women’s University, Kodaikanal 32

B.Sc. Computer Science Syllabus – May 2023

Problems on Ages - Surds and Indices - percentage - profits 6

II
and loss - ratio and proportion-partnership-Chain rule.
Time and work - pipes and cisterns - Time and Distance - 6
problems on trains -Boats and streams - simple interest -
III
compound interest - Logarithms - Area –Volume and surface
area – races and Game sofskill.
Permutation and combination – probability – True Discount- 6
IV Bankers Discount
Height and Distances-Odd man out & Series.
Calendar - Clocks - stocks and shares - Data representation -
V 6
Tabulation – Bar Graphs-Pie charts-Linegraphs
Total (Hrs.) 30
Extended Professional Component Questions related to the above topics, from various
(is a part of internal component only, competitive examinations UPSC/TRB/NET/UGC/
Not to be included in the External CSIR/GATE/ TNPSC/ others to be solved (To be
Examination question paper) discussed during the Tutorial hour)
Skills acquired from the course Knowledge, Problem Solving, Analytical ability,
Professional Competency, Professional
Communication and Transferrable Skill
Learning Resources:
Recommended Texts

1. R. S. Aggarwal, Quantitative Aptitude (Fully solved), Reprint 2016, S. Chand.

Reference Books

1. R.V. Praveen, Quantitative Aptitude and Reasoning, 2nd Revised Edition 2013,
Prentice-Hall of India Pvt.Ltd.

2. G. K. Ranganath, C. S. Sampangiram and Y. Rajaram, A text Book of business

Mathematics, 2008, Himalaya Publishing House.
Web Resources
 Web resources from NDL Library, E-content from open-source libraries

Mother Teresa Women’s University, Kodaikanal 33