B.Sc.(Hons.

) AI & DS-I (Batch 2025-29

9)

MATA GUJRI COLLEGE, FATEHGARH SAHIB

(AN AUTONOMOUS COLLEGE)

FOUR YEAR UNDERGRADUATE PROGRAMME

(As per NEP 2020)

B. Sc(Hons) in Artificial Intelligence and Data Science

PROGRAMME CODE: BSCHAI
CURRICULUM

(Semester I & II)

ACADEMIC SESSION
2025-26
26 ONWARDS (2025-2029 Batch)

Updated on : BOS Meeting dated 06/05/2025 Approved by Academic Council

1
 B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

B.Sc.(Hons.) in ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

First Year - First Semester Examinations
Session 2025-26 (Batch 2025-29)
MAJ: Discipline Specific Core Course; MAJ Lab : Discipline Specific Practical Course; MIN: Minor Core Courses(Course from Science
disciplines other than Major); MSE: Major Specific Elective Courses; IDC: Inter Disciplinary Courses( Course from Science disciplines
other than Major and Minor disciplines); MDC: Multi-Disciplinary Course(Course from Science disciplines other than Science disciplines
i.e. Humanities and Arts): AEC: Ability Enhancement Course(Course of Modern Indian Languages or English); VAC: Value Added
Courses(Courses of Environmental studies, Drug Abuse, Indian knowledge System, Sports Science, Yoga, etc); SEC: Skill Enhancement
Course(Specially Designed Courses to augment the skill of student); VOC: Vocational Course(To enhance employability of a student)

Course Code Course Course Title Load Marks Distribution Total Credits
Type Allocation Marks

L T P External Internal

BSCHAI -101 MAJ-1 Computer 4 0 0 70 30 100 4

Fundamentals

BSCHAI -102 MAJ-2 Python Programming 4 0 0 70 30 100 4

BSCHAI-102(P) MAJ-2 Software Lab – I 0 0 4 50 -- 50 2

Lab
BSCHAI-103 MIN-1 Mathematical 4 0 0 70 30 100 4
Foundation of
Computer Science

BSCHAI -104 SEC-1 Software Lab – II 1 0 5 100 -- 100 3

(Open OFFICE)

BSCHAI -105 IDC-1 E-Commerce 3 0 0 70 30 100 3

BSCHAI -106 VAC-1 Environment and Road 2 0 0 35 15 50 2

Safety

BSCHAI -107 AEC-1 English Proficiency 2 0 0 35 15 50 2

Through Language and
Literature-I

BSCHAI -108 Pbi Punjabi Compulsory/ 4 0 0 70 30 100 4

Comp.
BSCHAI -108 A Punjabi(Mudla Gyan)

Total 21 3 9 570 180 750 28

The breakup of marks for the continuous assessment for theory paper will be as under

2
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

i Two tests will be conducted during the : 50% of the marks allotted for continuous
semester. (based on the average of two assessment
Mid-Semester Tests)

ii Assignment/Quiz/Presentation/ : 20% of the marks allotted for continuous

NCC/NSS/Sports/Co-curricular assessment
Activities/Class test

iii Class participation & behaviour : 10% of the marks allotted for continuous
assessment

iv Attendance : 20% of the marks allotted for continuous

assessment

S.No Attendance in % Marks

1 65% to less than 70% 1

2 70% to less than 7 5% 2

3 75% to less than 80% 3

4 80% to less than 85% 4

5 85% and above 5

Ms.Rashmi Arora Dr. Dharamveer Sharma Dr. Harmohan Sharma Dr. Rajan Manro

Mr. Navdeep Garg Mr. Mandeep Singh Dr. Navdeep Singh Dr. Harjeet Singh

Mr. Devinder Singh Mr.Mukesh Kumar Ms. Harsimrat Deo Ms. Ritu Walia

Ms. Devinder Kaur Ms. Taranpreet Kaur Dr. Sangeeta Joshi Mr. Birinder Singh Sarao

Ms. Manpreet Kaur Mr.Joga Singh Dr. Kanwaldip Kaur Ubha

3
Approved by BOS Meeting held on 06-05-2005
 B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

B.Sc.(Hons.) in ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

Single Major UG Programme
First Year - Second Semester Examinations
Session 2025-26 (Batch 2025-29)
MAJ: Discipline Specific Core Course; MAJ Lab : Discipline Specific Practical Course; MIN: Minor Core Courses(Course from Science
disciplines other than Major); MSE: Major Specific Elective Courses; IDC: Inter Disciplinary Courses( Course from Science disciplines
other than Major and Minor disciplines); MDC: Multi-Disciplinary Course(Course from Science disciplines other than Science disciplines
i.e. Humanities and Arts): AEC: Ability Enhancement Course(Course of Modern Indian Languages or English); VAC: Value Added
Courses(Courses of Environmental studies, Drug Abuse, Indian knowledge System, Sports Science, Yoga, etc); SEC: Skill Enhancement
Course(Specially Designed Courses to augment the skill of student); VOC: Vocational Course(To enhance employability of a student)
Course Code Course Course Title Load Marks Distribution Total Credits
Type Allocation Marks

L T P External Internal

Object Oriented 4 0 0 70 30 100 4

BSCHAI -201 MAJ-3 Programming using
‘C++’

BSCHAI- MAJ-3 Software Lab – III 0 0 4 50 -- 50 2

201(P) Lab
BSCHAI -202 MAJ-4 Artificial Intelligence 4 0 0 70 30 100 4

BSCHAI-203 MIN-2 Fundamentals of 4 0 0 70 30 100 4

Statistics
BSCHAI -204 Software Lab – IV 1 0 5 100 -- 100 3
SEC-2
(Web Designing Lab)

BSCHAI -205 IDC-2 Management 3 0 0 70 30 100 3

Information System

BSCHAI -206 VAC-2 Drug Abuse: Problem, 2 0 0 35 15 50 2

Management and
Prevention

BSCHAI -207 AEC-2 English Proficiency 2 0 0 35 15 50 2

Through Language and
Literature-II

BSCHAI -208 Pbi Punjabi Compulsory/ 4 0 0 70 30 100 4

Comp Mudla Gyan
BSCHAI -208A

Total 21 3 9 570 180 750 28

4
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

The breakup of marks for the continuous assessment for theory paper will be as under

i Two tests will be conducted during the : 50% of the marks allotted for continuous
semester. (based on the average of two assessment
Mid-Semester Tests)

ii Assignment/Quiz/Presentation/ : 20% of the marks allotted for continuous

NCC/NSS/Sports/Co-curricular assessment
Activities/Class test

iii Class participation & behaviour : 10% of the marks allotted for continuous
assessment

iv Attendance : 20% of the marks allotted for continuous

assessment

S.No Attendance in % Marks

1 65% to less than 70% 1

2 70% to less than 7 5% 2

3 75% to less than 80% 3

4 80% to less than 85% 4

5 85% and above 5

Ms.Rashmi Arora Dr. Dharamveer Sharma Dr. Harmohan Sharma Dr. Rajan Manro

Mr. Navdeep Garg Mr. Mandeep Singh Dr. Navdeep Singh Dr. Harjeet Singh

Mr. Devinder Singh Mr.Mukesh Kumar Ms. Harsimrat Deo Ms. Ritu Walia

Ms. Devinder Kaur Ms. Taranpreet Kaur Dr. Sangeeta Joshi Mr. Birinder Singh Sarao

Ms. Manpreet Kaur Mr.Joga Singh Dr. Kanwaldip Kaur Ubha

5
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

Course Code: BSCHAI -101

Course Name: Computer Fundamentals
Maximum Marks: 100 Time: 3 hours
Theory: 70 Marks Pass Marks: 35%
Internal Assessment: 30 Marks
Course Objectives:
● To introduce the students the basics of computer, its organization, Input/output devices etc.
● To introduce the preliminary knowledge of computer, their operations and applications.
● To introduce the various computer languages &Number System.
Course Learning Outcomes:
On successful completion of the course, students will be able to:
● Familiarization with the terms like Operating System, peripheral devices, software etc.
● Represent data in binary form, convert numeric data between different number systems and
perform arithmetic operations in binary
(A) INSTRUCTIONS FOR THE PAPER SETTER
The question paper will consist of three sections UNIT-I, UNIT-II, and UNIT-III, Each of UNIT-I and UNIT-II
will have four questions from the respective Units of the syllabus and each question will carry 12 marks. UNIT-
III will have 11 short answer type questions which will cover the entire syllabus uniformly and will carry 2
marks in all.
(B) INSTRUCTIONS FOR THE CANDIDATES
Candidates are required to attempt two questions each from UNIT-I and UNIT-II. UNIT-III is Compulsory.
UNIT-I
Introduction: Characteristics of Computers, The Evolutions of Computers, Computer Generations,
Classification of computers based on size and application like
NotebookComputers,PersonalComputers,workstations,MainframeSystems,Super Computers, Clients
and Servers etc.
Basic Computer Organization: Block diagram of Computer, Interrelationship between different
units: Input Unit, Output Unit, Storage unit, Arithmetic Logic Unit, Control unit, Central Processing
unit. Instruction Set, Registers, Processor Speed, Types of Processors.
Main Memory: Memory Organization, RAM, ROM, PROM and EPROM, Cache Memory
Input-output Devices: Characteristics of I/O devices, Input Devices(Keyboard, Point-and–draw
Devices, Data scanning Devices, Digitizer, Electronic Card reader, Voice Recognition Devices,
Vision-Input System). Output Devices (Monitors, printers, plotters, Screen Image Projector, Voice
Response System)
UNIT-II
Secondary Storage Devices: Sequential and Direct-Access Devices, Magnetic Tape, Hard Disk,
Optical Disks. Basic principles of Operations, Advantages and limitations.
Types of Software: System Software, Application Software, Overview (function) of different types
of system software’s: Operating Systems, Language Translators. Overview of different types of
Application Software: word Processing, spreadsheet, Database.
Computer languages: Machine Language, Assembly Language, High Level Language, Compiler,
Linker, Interpreter, Object Oriented Programming Languages, Characteristics of Good Programming
Language.

6
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

Number System & Codes: Bit, byte, binary, decimal, hexadecimal, and octal systems, conversion from
one system to the other. Binary Arithmetic: Addition, subtraction and multiplication. Character codes
(ASCII, EBCDIC, BCD, 8421, 2421, Excess-3, Gray, Hamming).

Text Books:
1. P.K Sinha “Fundamentals of IT”,B.P.BPublications
2. PeterNorton “Computers today”.

Reference Books:
1. D. H. Sanders, “Computers Today”, McGrawHill,
2. Satish Jain, “Information Technology",BPB,
3. V. Rajaraman, “Fundamentals of Computers” (2nd edition), Prentice Hall of India,
NewDelhi,
4. B. Ram, “Computer Fundamentals”,Wiley,

Teaching Plan:

Week Content

1-2 Introduction: Characteristics of Computers, The Evolutions of Computers,

Computer Generations, Classification of computers based on size and application
like Notebook Computers, Personal Computers, workstations, Mainframe
Systems, Super Computers, Clients and Servers etc.
3-4 Basic Computer Organization: Block diagram of Computer, Interrelationship
between different units: Input Unit, Output Unit, Storage unit, Arithmetic Logic
Unit, Control unit, Central Processing unit. Instruction Set, Registers, Processor
Speed, Types of Processors.

5-6 Input-output Devices: Characteristics of I/O devices, Input Devices(Keyboard,

Point-and–draw Devices, Data scanning Devices, Digitizer, Electronic Card
reader, Voice Recognition Devices, Vision-Input System). Output Devices
(Monitors, printers, plotters, Screen Image Projector, Voice Response System).

7-8 Secondary Storage Devices: Sequential and Direct-Access Devices, Magnetic

Tape, Hard Disk, Optical Disks. Basic principles of Operations, Advantages and
limitations.

7
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

9-10 Types of Software: System Software, Application Software, Overview

(function)of different types of system software’s: Operating Systems, Language
Translators. Overview of different types of Application Software: word
Processing, spreadsheet, Database.
11-12 Computer languages: Machine Language, Assembly Language, High Level
Language, Compiler, Linker, Interpreter, Object Oriented Programming
Languages, Characteristics of Good Programming Language.
13-14 Number System & Codes: Bit, byte, binary, decimal, hexadecimal, and octal
systems, conversion from one system to the other.
15 Binary Arithmetic: Addition, subtraction and multiplication. Character codes
(ASCII, EBCDIC, BCD, 8421, 2421, Excess-3, Gray, Hamming).

8
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

Course Code: BSCHAI -102

Course Name: Python Programming
Maximum Marks: 100 Time: 3 hours
Theory: 70 Marks Pass Marks: 35%
Internal Assessment: 30 Marks
Course Objectives:
● To introduce students to a powerful programming language – Python
● To gain knowledge of various programming concepts.
Course Learning Outcomes:
After Completion of this course the students will be able to
● Read, understand and trace the execution of programs written in Python language.
● Analyze the real life problems and write a program in Python to solve the problem.
(A) INSTRUCTIONS FOR THE PAPER SETTER
The question paper will consist of three sections UNIT-I, UNIT-II, and UNIT-III, Each of UNIT-I and UNIT-II
will have four questions from the respective Units of the syllabus and each question will carry 12 marks. UNIT-
III will have 11 short answer type questions which will cover the entire syllabus uniformly and will carry 2
marks in all.
(B) INSTRUCTIONS FOR THE CANDIDATES
Candidates are required to attempt two questions each from UNIT-I and UNIT-II. UNIT-III is Compulsory.
Unit-I
Program Planning: Algorithms, characteristics and Examples of algorithms, Flowcharts, symbols used
in flowcharts, Examples of flowcharts, Pseudocode.
Programming Fundamentals: Designing a Program, identifiers, keywords, constants, variables.
Data types: Strings and numbers, Lists, tuple, Dictionaries, displaying output, User input, type
conversion, basic string operations & methods, format specifiers
Operators: Arithmetic, Relational, Logical, Bitwise, Assignment operators and expressions.
Decision Structures: If, If_else, if_elif_else, nested if decision flow statements.
Unit-II
Repetition Structures: while loop, for loop, sentinels, continue and break statements
Functions: Prototype, definition and calling, formal, actual and default arguments, value returning
functions, methods of parameter passing to functions, recursive function, Function overloading, Local
variables and scope.
Exception Handling: Exceptions, try, except, finally and raise
Files: Introduction to file, attributes of files, operation of files, Types of files, input and output in files.

References:
1. T. Budd, Exploring Python, TMH, 1st Ed, 2011
2. How to think like a computer scientist : learning with Python / Allen Downey, Jeffrey Elkner, Chris Meyers.
1st Edition

9
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

Teaching Plan:

Week Content

1-2 Program Planning: Algorithms, characteristics and Examples of algorithms,

Flowcharts, symbols used in flowcharts, Examples of flowcharts, Pseudocode.

3-4 Programming Fundamentals: Designing a Program, identifiers, keywords, constants,

variables.

5-6 Data types: Strings and numbers, Lists, tuple, Dictionaries, displaying output, User
input, type conversion, basic string operations & methods, format specifiers

7-8 Operators: Arithmetic, Relational, Logical, Bitwise, Assignment operators and

expressions.
Decision Structures: If, If_else, if_elif_else, nested if decision flow statements.

9-10 Repetition Structures: while loop, for loop, sentinels, continue and break statements

11-12 Functions: Prototype, definition and calling, formal, actual and default arguments,value
returning functions, methods of parameter passing to functions, recursive function,
Function overloading, Local variables and scope.

13-14 Exception Handling: Exceptions, try, except, finally and raise

Files: Introduction to file, attributes of files, operation of files, Types of files, input and
output in files.

10
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

Course Code: BSCHAI-102(P)

Course Name: Software Lab- I
External Examination: 50 Maximum Time: 3 Hrs.
Min Pass Marks: 35%

Course Objectives:

This laboratory course will comprise as exercises to supplement what is learnt under paper BSCHAI-102
Python Programming.
Course Learning Outcomes:
After Completion of this course the students will be able to
● Write program code in Python to solve real world problems.
● Debug a program.
The break up of marks for the practical will be as under
i. Lab Record (External Evaluation) 10 Marks
ii. Viva Voce (External Evaluation) 20 Marks
iii. Program Development and Execution (External Evaluation) 20 Marks

11
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

Course Code: BSCHAI-103

Course Name: Mathematical Foundation of Computer Science

Maximum Marks: 100 Time: 3 hours

Theory: 70 Marks Pass Marks: 35%
Internal Assessment: 30 Marks
Course Objectives:
● To develop logical thinking and its application to computer science
Course Learning Outcomes:
After Completion of this course the students will be able to
● Construct simple mathematical proofs and possess the ability to verify them
● Specify and manipulate basic mathematical objects such as sets, functions, and relations and will also be
able to verify simple mathematical properties that these objects possess
(A) INSTRUCTIONS FOR THE PAPER SETTER
The question paper will consist of three sections UNIT-I, UNIT-II, and UNIT-III, Each of UNIT-I and UNIT-II
will have four questions from the respective Units of the syllabus and each question will carry 12 marks. UNIT-
III will have 11 short answer type questions which will cover the entire syllabus uniformly and will carry 2
marks in all.
(B) INSTRUCTIONS FOR THE CANDIDATES
Candidates are required to attempt two questions each from UNIT-I and UNIT-II. UNIT-III is Compulsory.

UNIT-I

Set Theory: Sets, Type of sets, Set operations, Principle of Inclusion-Exclusion, Cartesian product of sets.
Logic : Propositions, Implications, Precedence of logical operators, Translating English sentences into logical
expressions, Propositional equivalence Principle of Mathematical induction.
Relations: Relations and diagraph, n-ary relations and their applications, properties of relations, representing
relations, closure of relation, equivalence relation, operation on relations, partial ordering.

UNIT-II

Functions: Functions, One-to-one Functions, Onto Functions, Inverse and Composition of Functions
Graphs: Introduction to Graph, Graph terminology, Representing graphs and Graph Isomorphism, Connectivity,
Euler Paths and Circuits, Hamiltonian paths and circuits, Shortest Path Problems, Planar Graphs.
Trees : Trees, labeled trees, Tree Traversal, Undirected trees, Spanning Trees, Minimum spanning trees.

Text Book :

1. Discrete Mathematical Structures-Bernard Kolman, Robert C. Busby, Sharon C. Ross, 4th Edition,
Pearson Education Asia.
Reference Books :
1. Discrete Mathematics-Richard Johnsonbaugh, 5th Edition, Pearson Education, Asia.
2. Elements of Discrete Mathematics, Second Edition, Tata McGraw Hill.
3. Discrete Mathematics, Seymon Lipschutz & Max Lans Lipson, Tata McGraw Hill.
Teaching Plan:

12
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

Week Content

1-2 Set Theory: Sets, Type of sets, Set operations, Principle of Inclusion-Exclusion, Cartesian
prodouct of sets, Partitions.
3-4 Logic : Propositions, Implications, Precedence of logical operators, Translating English
sentences into logical expressions, Propositional equivalence Principle of Mathematical
induction.
5-6 Relations: Relations and diagraph, n-ary relations and their applications, properties of
relations, representing relations, closure of relation, equivalence relation, operation on
relations, partial ordering.
7-8 Functions: Functions, One-to-one Functions, Onto Functions, Inverse and Composition of
Functions, Floor Function, Ceiling Function.
9-10 Basic Concepts (Only Definition): Big-O Notation, Big-Omega and Big-Theta Notation.
Graphs: Introduction to Graph, Graph terminology, Representing graphs and Graph
Isomorphism, Connectivity, Euler Paths and Circuits, Hamiltonian paths and circuits,
Shortest Path Problems, Planar Graphs.
11-12 Trees : Trees, labeled trees, Tree Traversal, Undirected trees, Spanning Trees, Minimum
spanning trees.
13-14 Revision

15 Revision

13
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

Course Code: BSCHAI-104

Course Name: Software Lab- II

External Examination: 100 Maximum Time: 3 Hrs.

Min Pass Marks: 35%
Course Objectives:

● To facilitate and make the students learn to use open source software.
● To give hands on practice on libre / open office that facilitates them to create documents, spreadsheet
and effective presentations.
Course Learning Outcomes:
● Skill to work with open source software.
● Initiation into the process of writing business letters or job applications, tabulating data, preparing PPTs
etc.
Details of the four tasks and features that would be covered Using word – Accessing, overview of toolbars,
saving files, Using help and resources, rulers, format painter
Word Processing Orientation:
1.Using word to create Resume Features to be covered: - Formatting Fonts in word, Drop Cap in word, Applying
Text effects, Using Character Spacing, Borders and Colors, Inserting Header and Footer, Using Date and Time
option in Word.
2.Creating an Assignment Features to be covered: - Formatting Styles, Inserting table, Bullets and Numbering,
Changing Text Direction, Cell alignment, Footnote, Hyperlink, Symbols, Spell Check, Track Changes
3.Creating a Newsletter Features to be covered: - Table of Content, Newspaper columns, Images from files and
clipart, Drawing toolbar and Word Art, Formatting Images, Textboxes and Paragraphs
4.Creating a Feedback form. Features to be covered: - Forms, Text Fields, Inserting objects, Mail Merge in Word
Spreadsheet Orientation:
1. Creating a Scheduler Features to be covered: - Gridlines, Format Cells, Summation, auto fill, Formatting Text
2.Calculations Features to be covered :- Cell Referencing, Formulae in excel – average, std.deviation, Charts,
Renaming and Inserting worksheets, Hyper linking, Count function, LOOKUP/VLOOKU
3.Performance Analysis Features to be covered: - Split cells, freeze panes, group and outline, Sorting, Boolean
and logical operators, Conditional formatting
Presentation Orientation:
1. Students will be working on basic power point utilities and tools which help them create basic power point
presentation. Topic covered includes :- PPT Orientation, Slide Layouts, Inserting Text, Word Art, Formatting
Text, Bullets and Numbering, Auto Shapes, Lines and Arrows
2. Making their presentations interactive: Hyperlinks, Inserting –Images, Clip Art, Audio, Video, Objects, Tables
and Charts.
3. Interacting Power Point Presentation from the following topics: Global Warming, Pollution,Future of IT
etc
The breakup of marks for the practical will be as under
● Lab Record(External Evaluation) 10 marks
● Viva Voce(External Evaluation) 20marks
● Program Development and Execution(External Evaluation) 20marks

14
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

Course Code: BSCHAI-105

Course Name: E-Commerce

Maximum Marks: 100 Time: 3 hours

Theory: 70 Marks Pass Marks: 35%
Internal Assessment: 30 Marks
Objectives of the Subject:
● The key concepts related to the regulation of the internet and e-commerce.
● The technologies facilitating electronic business and commercial transactions.
● To provide adequate knowledge and understanding about E-Commerce practices to the students
Course Outcome: After Completion of the subject student should able to understand
● Analyse the impact of E-commerce on business models and strategy.
● Illustrate the major types of E-commerce.
● Explain the process that should be followed in building an E-commerce presence.
● Describe how procurement and supply chains, ERP relate to E-commerce

(A) INSTRUCTION FOR THE PAPER SETTER

The question paper will consist of three sections UNIT-I, UNIT-II, and UNIT-III, Each of UNIT-I and UNIT-II
will have four questions from the respective Units of the syllabus and each question will carry 12 marks. UNIT-
III will have 11 short answer type questions which will cover the entire syllabus uniformly and will carry 2
marks in all.
(B) INSTRUCTIONS FOR THE CANDIDATES

Candidates are required to attempt two questions each from unit I and II and the entire unit III.

UNIT-I

E – Commerce: Meaning, definition, features, functions of E-Commerce, Scope, Benefits and limitations of E-
Commerce – The Internet and India – E-commerce opportunities and challenges for Industries.

Business Models for E-commerce: The Birth of Portals – E-Business Models – Business-to Consumer (B2C) –
Business-to-Business (B2B) – Consumer-to Consumer (C2C) – Consumer to-Business (C2B) – Brokerage Model
– Value Chain Model – Advertising Model.
. UNIT-II

E-marketing – Traditional Marketing Vs .E-Marketing – Impact of E-commerce on markets – Marketing issues in

E-Marketing – Online Marketing – E-advertising – Internet Marketing Trends – E-Branding – Marketing
Strategies.
E-payment Systems: Digital payment Requirements – Digital Token-based E-payment systems – Benefits to
Buyers – Benefits to Sellers – Credit card as E-payment system – Mobile payments – smart card cash payment
system – Micropayment system – E- Cash
Text Book:
1. Ravi Kalakota, Andrew B. Whinston: Frontiers of Electronic Commerce, Addison Wesley.
References:
1. Efraim Turbon, Jae Le, David King, Chung: Electronic Commerce- A managerial perspective, Prentice-Hall
International.
2. Gary P. Schneider, James T. Perry: Electronic Commerce

15
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29
9)

BSCHAI-106

16
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

17
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

BSCHAI -107

18
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

19
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

20
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

21
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

22
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

Course Code: BSCHAI-201

Course Name: Object Oriented Programming using ‘C++’

Maximum Marks: 100 Time: 3 hours

Theory: 70 Marks Pass Marks: 35% Internal
Assessment: 30 Marks
Course Objectives:
● To provide information about concepts of OOPS.
● By the end of the course a student will be capable to design and develop different computer software
applications and to implement various algorithms in programming languages for research purpose.
Course Learning Outcomes:
After Completion of this course the students will be able to
● Apply the concepts of object-oriented programming.
● Analyze the real life problems and write a program in C++ language to solve the problem.
(A) INSTRUCTIONS FOR THE PAPER SETTER
The question paper will consist of three sections UNIT-I, UNIT-II, and UNIT-III, Each of UNIT-I and UNIT-II
will have four questions from the respective Units of the syllabus and each question will carry 12 marks. UNIT-
III will have 11 short answer type questions which will cover the entire syllabus uniformly and will carry 2
marks in all.
(B) INSTRUCTIONS FOR THE CANDIDATES
Candidates are required to attempt two questions each from UNIT-I and UNIT-II. UNIT-III is Compulsory.
UNIT-I

Introduction: Basics of Object Oriented Programming (OOP), Difference between C & C++,
Manipulators, Storage classes. Classes and Objects: Class Declaration and Class Definition, Defining
member functions, inline functions, Nesting of member functions, Members access control, this pointer.
Objects: Object as function arguments, array of objects, functions returning objects, Const member.
Static data members and Static member functions, Friend functions and Friend classes Constructors:
Properties, types of constructors, Dynamic constructors, Constructor overloading. Destructors:
Properties, Virtual destructor. Destroying objects. Rules for constructors and destructors. Array of
objects. Dynamic memory allocation using new and delete operators, Nested and container classes,
Scopes: Local, Global, Namespace and Class.

UNIT-II

Inheritance: Defining derived classes, Types of inheritance, types of derivation- public, private,
protected, function redefining, constructors in derived class, Types of base classes – abstract and virtual.
Operator overloading: rules for operator overloading binary operator, overloading unary operators.
Function overloading. Polymorphism: virtual functions, late binding, pure virtual functions and abstract
base class Difference between function overloading, redefining, and overriding.

Text Books:
1. E. Balaguruswamy, “Object Oriented Programming with C++”, Tata McGraw’s Hill.

2. Deitel & Deitel, “C++ How to Program”, Pearson Education.

23
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

References:
1. Herbert Schildt, “The Complete Reference C++”, Tata McGraw-Hill.

2. Robert Lafore, “Object Oriented Programming in C++”, Galgotia Publications.

3. Bjarne Strautrup, “The C++ Programming Language”, Addition- Wesley Publication Co.

4. E. Balagurusamy, “ Object Oriented Programming with C++”, Tata McGraw-Hill.

5. Anshuman Sharma, ”Learn Programming in C++”, Lakhanpal Publishers.

Teaching Plan

Week Content

1-2 Introduction: Basics of Object Oriented Programming (OOP), Difference between C &
C++, Manipulators, Storage classes. Classes and Objects: Class Declaration and Class
Definition, Defining member functions, inline functions, Nesting of member functions,
Members access control, this pointer.

3-4 Objects: Object as function arguments, array of objects, functions returning objects, Const
member. Static data members and Static member functions, Friend functions and Friend
classes Constructors: Properties, types of constructors, Dynamic constructors, Constructor
overloading.

5-6 Destructors: Properties, Virtual destructor. Destroying objects. Rules for constructors and
destructors. Array of objects. Dynamic memory allocation using new and delete operators,
Nested and container classes, Scopes: Local, Global, Namespace and Class.

7-8 Inheritance: Defining derived classes, Types of inheritance, types of derivation- public,
private, protected, function redefining, constructors in derived class, Types of base classes
– abstract and virtual.

9-10 Operator overloading: rules for operator overloading binary operator, overloading unary
operators.

11-12 Function overloading. Polymorphism: virtual functions, late binding, pure virtual functions
and abstract base class Difference between function overloading, redefining, and
overriding.

13-14 Revision

15 Revision

24
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

Course Code: BSCHAI-201(P)

Course Name: Software Lab – III

Maximum Marks: 50 Maximum Time: 3 Hrs.

External Examination: 50 Minimum Pass Marks: 35%

Objectives of the Lab

i. To learn how to design C++ classes for code reuse.

ii. To learn how to implement copy constructors and class member functions.

iii. To learn how inheritance and virtual functions implement dynamic binding with polymorphism.

PROGRAMMING USING C++

1. Write a program to find area of rectangle using the concept of classes & object.
2. Write a program to implement the concept of array of object.
3. Write a program to show the use of friend function.
4. Write a program to show the use of constructor overloading.
5. Write a program to show the use of copy constructor.
6. Write a program to show the use of destructors.
7. Write a program to show the use of virtual function.
8. Write a program to implement the concept of multilevel inheritance.
9. Write a program to implement the concept of multiple inheritance.
10. Write a program of unary operator overloading
11. Write a program of Binary operator overloading.
12. Write a program to demonstrate how to insert and extract an object to and from data files.
13. Write a program to count the total number of account objects in a file and then display information
of a particular account object.
The breakup of marks for the practical will be as under:
i. Lab Record (Internal Assessment) 10 Marks
ii. Viva Voce (External Evaluation) 20 Marks
iii. Program Development and Execution(External Evaluation) 20 Marks

25
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

Course Code: BSCHAI -202

Course Name: Artificial Intelligence

Maximum Marks: 100 Time: 3 hours

Theory: 70 Marks Pass Marks: 35%
Internal Assessment: 30 Marks
Course Objectives:
The main purpose of this course is to provide the most fundamental knowledge to the students so that they can
understand what the AI and Data Science is.
Course Learning Outcomes:
Upon Completion of the course, Students will be able to,
● Understand the basic concepts of Artificial Intelligence.
● Acquire fundamentals of Data Science.

(A) INSTRUCTIONS FOR THE PAPER SETTER

The question paper will consist of three sections UNIT-I, UNIT-II, and UNIT-III, Each of UNIT-I and UNIT-II
will have four questions from the respective Units of the syllabus and each question will carry 12 marks. UNIT-
III will have 11 short answer type questions which will cover the entire syllabus uniformly and will carry 2
marks in all.
(B) INSTRUCTIONS FOR THE CANDIDATES
Candidates are required to attempt two questions each from UNIT-I and UNIT-II. UNIT-III is Compulsory.

Unit I
Introduction to Artificial Intelligence: Concept and definition, Elements of AI, History of AI,
Turing Test, Application areas of AI.
Problem solving using AI: Introduction: Defining problem as state space: analyzing problem,
Finding the solution, Representation of AI problem. Example if AI Problems: Tic-Tac-Toe, Water-Jug
problem, 8- Puzzle problem, 8-Queens problem. Search Techniques: Breadth-first, Depth-first,
Depth-limited, Bidirectional search.
Heuristic Search: Introduction, basic concept of heuristic search, Popular game Playing Theories:
Min- Max search Procedure, Alpha -Beta pruning.

Unit-II
Logic: Introduction, propositional calculus, predicate Logic, Resolution, Unification, limitations of
logic.
Introduction to knowledge: Introduction, Types of Knowledge, Knowledge acquisition.
Knowledge Representation Techniques: Introduction, Frames, Semantic Network, conceptual graph,
Conceptual Dependencies, Script, CYC,
Expert System: Introduction to Expert System, Architecture of Expert System, ES Shells.

Text Books:
1.S.J. Russell and P.Norvig: “Artificial Intelligence: A Modern Approach”, Pearson.
2. Sinan Ozdemir, “Principles of Data Science”, Packt Publishing.

Reference Books:

26
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

1 E.Rich, K.Knight, S.B. Nair: “Artificial Intelligence”, Tata McGraw Hill Ed Pvt Ltd.
2 Joel Grus: “Data Science from Scratch”, O’Reilly.
3 Foster Provost & Tom Fawcett: “Data Science for Business” O’Reilly
4 Roger D. Peng & Elizabeth Matsui: “The Art of Data Science” Lean Publishing.

Teaching Plan

Week Content

1-2 Introduction to Artificial Intelligence: Definitions of AI, Intelligent Agents,

Problem solving.
Knowledge, Reasoning and Planning: Logical Agents, Classical Planning,
Knowledge Representation and Reasoning.
3-4 Learning: Learning from examples, Knowledge in learning.
Communicating, Perceiving and Acting:
Communication, Natural Language Processing, Perception, Robotics.
5-6 Introduction to Data Science: Data Science-a discipline, Landscape-Data to Data
science, Data Growth-issues and challenges, data science process. foundations of
data science.
7-8 Data Exploration and Preparation: Messy data, Anomalies and artefacts in
datasets. Cleaning data.
Data Representation and Transformation: Forms of data-tabular, text data,
graph-based data. Modern databases- text files, spreadsheets, SQL databases,
NoSQL databases, distributed databases, live data streams.
Representation of data of special types-acoustic, image, sensor and network data.
9-10 Computing with Data: Overview of R, Python and Julia.
Data Modeling: Basics of Generative modeling and Predictive modeling.
11-12 Data Visualization and Presentation: Charts-histograms, scatter plots, time series
plots etc. Graphs, 3D Visualization and Presentation
13-14 Revision

15 Revision

27
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

Course Code: BSCHAI-203

COURSE NAME: Fundamentals of Statistics
Maximum Marks: 100 Time: 3 hours
Theory: 70 Marks Pass Marks: 35%
Internal Assessment: 30 Marks
Course Objectives:
● To understand and apply fundamental statistical concepts and terminology.
● Learn to distinguish between different types of data and measurements.
● Use statistical tools to analyze and interpret data.
Course Learning Outcomes:
Upon Completion of the course, Students will be able to,
● Define and explain key statistical terms and concepts, such as mean, median, mode, variance,
and standard deviation.
● Differentiate between types of data and understand their implications for statistical analysis.
● Apply statistical techniques to real-world problems.

(A) INSTRUCTIONS FOR THE PAPER SETTER

The question paper will consist of three sections UNIT-I, UNIT-II, and UNIT-III, Each of UNIT-I and UNIT-II
will have four questions from the respective Units of the syllabus and each question will carry 12 marks. UNIT-
III will have 11 short answer type questions which will cover the entire syllabus uniformly and will carry 2
marks in all.
(B) INSTRUCTIONS FOR THE CANDIDATES
Candidates are required to attempt two questions each from UNIT-I and UNIT-II. UNIT-III is Compulsory.
UNIT - I
Introduction: Meaning and Definitions of Statistics, Data and Data Sources, Types of Statistics,
Importance of Statistics in computers. An overview of central tendency: Arithmetic Mean, Median,
Mode. Relationships of the Mean, Median and Mode.
Dispersion: Meaning and Definition of Dispersion, Significance and Properties of Measuring Variation,
Measures of Dispersion, Range, Interquartile Range or Quartile Deviation, Mean Deviation, Standard
Deviation
UNIT - II
Correlation Analysis: Definition, Scatter diagram, Correlation Graph, Pearson’s Coefficient of
Correlation, Spearman’s Rank Correlation, Limitations of Correlation Analysis.
Regression: Linear Regression, Regression Line of Y on X: Scatter Diagram, Fitting a Straight Line,
Regression Line of X on Y, Properties of Regression Coefficients, Regression Lines and Coefficient of
Correlation, Correlation Analysis Versus Regression Analysis.
Polynomial interpolation: Lagrange, Newton’s Forward Difference, Interpolation, Newton’s Backward
Difference Interpolation, Newton’s Divided Difference Interpolation.

Text Books:
1. S.C. Gupta and V.K. Kapoor, “Fundamentals of Statistics”, Sultan Chand & Sons 2018.
2. Dr. N. D. V. Prasad, “Statistics: Methods and Applications” Excel Books 2008.

Reference Books:

28
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

1. H.S.S. G.K. Ganesh Rao and N.S.G. Reddy, ““Introduction to Mathematical Statistics”,
Himalaya Publishing House 2011.
2. M.A.C. Kothari and G.P. Gupta, “Statistical Methods” , Vikas Publishing House 2004.
3. D.S. Moore, G.P. McCabe, and B.A. Craig, “The Practice of Statistics” W.H. Freeman and
Company.
.

Teaching Plan
Week Content

1-2 Introduction: Meaning and Definitions of Statistics, Data and Data Sources, Types
of Statistics, Importance of Statistics in computers, an overview of central tendency,
Arithmetic Mean, Median, Mode, Relationships of the Mean, Median and Mode.

3-4 Dispersion: Meaning and Definition of Dispersion, Significance and Properties of

Measuring Variation, Measures of Dispersion, Range, Interquartile Range or
Quartile Deviation, Mean Deviation, Standard Deviation.

5-6 Correlation Analysis: Definition, Scatter diagram, Correlation Graph, Pearson’s

Coefficient of Correlation, Spearman’s Rank Correlation, Limitations of
Correlation Analysis.

Regression: Linear Regression, Regression Line of Y on X: Scatter Diagram,

Fitting a Straight Line, Regression Line of X on Y, Properties of Regression
Coefficients, Regression Lines and Coefficient of Correlation, Correlation
Analysis Versus Regression Analysis

7-8 Computer Arithmetic: Basics of Floating point representation of numbers,

arithmetic operation with normalised floating point numbers and its consequences,
errors in numbers, binary representation of numbers.
9-10 Iterative Methods for finding roots: Bisection, False Position, Regula-falsi method,
Secant Method, Newton Raphson, Discuss convergence only without derivation.

11-12 Solution of simultaneous algebraic equations: Gauss elimination method, Gauss-

Seidel iterative method, Jacobi’s Method, Gauss Jordan Method.

13-14 Polynomial interpolation: Lagrange, Newton’s Forward Difference, Interpolation,

Newton’s Backward Difference Interpolation, Newton’s Divided Difference
Interpolation.

15 Revision

29
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

Course Code: BSCHAI -204(P)

Software Lab IV
Maximum Marks: 100 Maximum Time: 3 Hrs.
External Examination: 100 Minimum Pass Marks: 35%
Practical units to be conducted: 45-55

This lab it will cover introduction to HTML and JavaScript.

The breakup of marks for the practical will be as under:

i. Lab Record (Internal Assessment) 10 Marks

ii. Viva Voce (External Evaluation) 20 Marks

iii. Program Development and Execution(External Evaluation) 20 Marks

30
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

Course Code: BSCHAI-205

Course Name: Management Information System

Maximum Marks: 100 Time: 3 hours

Theory: 70 Marks Pass Marks: 35%
Internal Assessment: 30 Marks
Course Objectives:

● To describe the role of information technology and decision support systems in business and record the
current issues with those of the firm to solve business problems.
● To Introduce the fundamental principles of computer-based information systems analysis and design and
develop an understanding of the principles and techniques used.
● To enable students to understand the various knowledge representation methods and different expert
system structures as strategic weapons to counter the threats to business and make business more
competitive.
● To enable the students to use information to assess the impact of the Internet and Internet technology on
electronic commerce and electronic business and understand the specific threats and vulnerabilities of
computer systems.
● To provide the theoretical models used in database management systems to answer business questions
Course Learning Outcomes:

After Completion of this course the students will be able to

● Relate the basic concepts and technologies used in the field of management information systems
● Compare the processes of developing and implementing information systems.
● Outline the role of the ethical, social, and security issues of information systems.
● Translate the role of information systems in organizations, the strategic management processes, with the
implications for the management.
(A) INSTRUCTIONS FOR THE PAPERSETTER
The question paper will consist of three sections UNIT-I, UNIT-II, and UNIT-III, Each of UNIT-I and UNIT-II
will have four questions from the respective Units of the syllabus and each question will carry 12 marks. UNIT-
III will have 11 short answer type questions which will cover the entire syllabus uniformly and will carry 2
marks in all.
(B) INSTRUCTIONS FOR THECANDIDATES
Candidates are required to attempt two questions each from UNIT-I and UNIT-II. UNIT-III is Compulsory.

UNIT-I
Introduction to Management Information System (MIS), Need for MIS, Capabilities of MIS, Benefits of MIS,
MIS activities, Components of MIS, Nature and scope of MIS, MIS Characteristics, Structure of MIS, Types of
MIS, Role of MIS in Global Business, Challenges of MIS.

UNIT-II
Information: Definition, Types of information, Information quality, Dimensions of Information.
System: Definition, Kinds of System: abstract and physical systems, deterministic and probabilistic systems, open
and closed systems, user-machine systems.
System related concepts: Boundary, interface and Black Box. System decomposition and integration, Elements of
System

31
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

Text Books:

1. Jawadekar, W.S., “Management Information Systems”, Tata McGraw Hill Private Limited, New Delhi, 2009.

2. Kenneth C. Laudon and Jane P. Laudon: “Management Information Systems” 9/e, Pearson Education, New
Delhi.

Reference Books:

1. Alex Leon and Mathew Leon: “Data Base Management Systems”, Vikas Publishing House, New Delhi.
2. Goyal, D.P.: “Management Information System”, MACMILLAN India Limited, New Delhi, 2008.

Week Content

1-2 Introduction to Management Information System (MIS), Need for MIS, Capabilities of MIS

3-4 Benefits of MIS, MIS activities, Components of MIS, Nature and scope of MIS, MIS

5-6 Characteristics, Structure of MIS, Types of MIS, Role of MIS in Global Business,
Challenges of MIS.

7-8 Information: Definition, Types of information, Information quality, Dimensions of

Information

9-10 System: Definition, Kinds of System: abstract and physical systems, deterministic and
probabilistic systems,

11-12 open and closed systems, user-machine systems. System related concepts: Boundary,
interface and Black Box.

13-14 System decomposition and integration, Elements of System

15
Revision

32
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

BSCHAI -206

33
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

34
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

35
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

BSCHAI -207

36
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

37
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

38
Approved by BOS Meeting held on 06-05-2005
B.Sc.(Hons.) AI & DS-I (Batch 2025-29 )

39
Approved by BOS Meeting held on 06-05-2005