Your Dreams Our Goal

U N I V E R S I T Y
Member of Association of Indian Universities & Approved by UGC (Govt. of India) under 2(f) & 12(B)

FACULTY OF
COMPUTER SCIENCE & ENGINEERING
DEPARTMENT OF COMPUTER SCIENCE & APPLICATION

SCHEME & SYLLABUS

BOOKLET
BCA BATCH 2022-2025
SCHEME & SYLLABUS

BATCH: 2022-25

1|Page
 INDEX

S. No Contents
1 Vision, Mission and Quality Policy of University
2 Knowledge Wheel
3 Preamble
4 About Program and Program Outcomes (POs)
5 Examination System
6 Assessment & Grade Point Average: SGPA, CGPA
7 Guidelines for MOOC Courses
8 Teaching Scheme of all Semesters
9 Teaching Syllabus of all Semesters

Disclaimer: The scheme, syllabus and other materials published in this booklet may be
changed or modified as per the requirement after approval of competent authority. The
decision taken by the management of Poornima University will be final and abiding to all.

Student Details

Name of Student:

Name of Program:

Semester: Year: Batch:

Faculty of:

2|P a g e
 VISION

To create knowledge based society with scientific temper, team spirit and dignity

of labor to face global competitive challenges.

Mission

To evolve and develop skill based systems for effective delivery of knowledge so

as to equip young professionals with dedication and commitment to excellence in

all spheres of life.

Quality Policy

To provide Quality Education through Faculty development, updating of facilities

and continual improvement meeting University norms and keeping stake holders

satisfied.

3|P a g e
 Knowledge Wheel

At Poornima, the academic atmosphere is a rare blend of modern technical as well

as soft skills and traditional systems of learning processes.

4|P a g e
About Program and Program Outcomes (PO):

Title of the Programme: Bachelor of Computer Applications (BCA)

Nature of the Programme: BCA is three-year full-time programme.

Program Outcomes (PO) :

Graduates will be able to:

PO1: Computational information: Appreciate and apply mathematical organization, computing and domain
information for the conceptualization of computing models from clear harms.
PO2: Difficulty Analysis: Talent to classify, significantly evaluate and prepare complex computing problems
using fundamentals of computer knowledge and request domains.
PO3: Drawing / Improvement of Solutions: Facility to transform composite production scenarios and
present-day issues into problems, explore, recognize and propose included solutions using rising technologies.
PO4: Accomplish Investigations of Compound Computing Troubles: Ability to invent and ways
experiments interpret data and present well up to date conclusions.
PO5: Current Implement Procedure: Skill to select recent computing tools, skills and techniques
compulsory for original software solutions
PO6: Proficient Principles: Facility to apply and give expert principles and cyber systems in a universal
monetary situation.
PO7: Ultimate Education: Identify the need for and enlarge the ability to appoint in permanent education as
a Computing qualified.
PO8: Individual and team work: Ability to job as a part or manager in various teams in multidisciplinary
situations.
PO9: Communication: being able to comprehend and write effective reports and design documentation, make
effective presentations, and give and receive clear instructions.
PO10: Life-long learning: Recognize the need for, and have the preparation and ability to engage in
independent and life-long learning in the broadest context of technological change.

5|P a g e
Examination System:

A. Marks Distribution of Theory Course:

THEORY COURSE

ESE (Th.) IE (Th.)

60 40

CIE-I (Th.) MSE (Th.) CIE-II (Th.) Attendance

12 12 6 10

B. Marks Distribution of Practical Course :

PRACTICAL COURSE

ESE (Pr.) IE (Th.)

40 40

CIE-I (Pr.) MSE (Pr.) CIE-II (Pr.) Attendance

20 20 10 10

Th. : Theory, Pr. : Practical, ESE: End Semester Examination, MSE: Mid Semester Examination,
CIE: Continuous Internal Evaluation.

6|P a g e
 Marks Distribution of Attendance:

Guidelines for Marks Distribution of Attendance Component

Total Course Attendance (TCA)

S No. Marks allotted (out of 10)
range in Percentage

1 95% ≤ TCA 10

2 90% ≤ TCA < 95% 9

3 85% ≤ TCA < 90% 8

4 80% ≤ TCA < 85% 7

5 70% ≤ TCA < 80% 6

6 60% ≤ TCA < 70% 5

7 50% ≤ TCA < 60% 4

8 40% ≤ TCA < 50% 3

9 30% ≤ TCA < 40% 2

10 20% ≤ TCA < 30% 1

11 TCA < 20% 0

CO Wise Marks Distribution:

Theory Subject Practical/ Studio Subject
Maximum Marks CO to be Covered CO to be Covered Maximum Marks

CIE-I (Class Test) 12 ( 6 + 6) 1&2 1&2 20 (10 + 10)

MSE 12 ( 6 + 6) 3&4 3&4 20 (10 + 10)

CIE-II (Activity/ 6 (6) 5 5 10 (10)
Assignment )
Attendance 10 - - 10
ESE 60 - - 40
TOTAL 100 - - 100

7|P a g e
Minimum Passing Percentage in All Exams:

S. No. Program Minimum Passing Percentage

in All Exam
ESE Total
Component Component
1 Course Work for Ph. D Registration ------------------- 50 %

2 B. Arch. 45 % 50 %

3 MBA, MHA, MPH, MCA, M. Tech., M. Plan. 40 % 40 %

and M. Des.
4 B. Tech., B. Des., BCA, B.Sc., BVA, B. Voc., 35 % 40 %
BBA, B.Com., B.A. and Diploma
5 B. Sc. (Hospitality & Hotel Administration) 35 % 40 % (Theory) &
50 % (Practical)

Break-up of Internal Exam (Theory):

Class Test
MSE
Quiz (MM: 12)

CIE-II Activity Presentation

(With CO)
EXAM
Assignment
(MM: 12) (2Hr.)

Special Task

8|P a g e
Break-up of Internal Exam (Practical):

Test/ Quiz/
Performance

Record/
Each CIE Pr.
Assignment
and MSE Pr.
Activity
Presentation/ Viva

Any Other

Assessment & Grade Point Average: SGPA, CGPA:

SGPA Calculation
𝑪𝟏 𝑮𝟏 +𝑪𝟐 𝑮𝟐 +⋯………………..𝑪𝒏 𝑮𝒏
SGPA =
𝑪𝟏 +𝑪𝟐 +⋯………………..𝑪𝒏
Where ( as per teaching Scheme & Syllabus) :

∑𝒊 𝑪𝒊 ×𝑮𝒊 Ci is the number of Credits of Courses i,

SGPA = Gi is the Grade Point for the Course i and i = 1, 2…….n
∑ 𝒊 𝑪𝒊
n = number of courses in a programme in the Semester

CGPA Calculation
𝑪𝟏 𝑮𝟏 +𝑪𝟐 𝑮𝟐 +⋯………………..𝑪𝒏 𝑮𝒏
CGPA =
𝑪𝟏 +𝑪𝟐 +⋯………………..𝑪𝒏
Where ( as per teaching Scheme & Syllabus) :

∑𝒊 𝑪𝒊 ×𝑮𝒊 Ci is the number of Credits of Courses i,

CGPA = Gi is the Grade Point for the Course i and i = 1, 2…….n
∑ 𝒊 𝑪𝒊
n = number of courses in a programme of all the Semester up to which
CGPA is computed.

9|P a g e
Grading Table:

Award of Class:

10 | P a g e
Guidelines for MOOC COURSES:

1. Applicable from the session 2020 – 21 onwords, for students aspiring for HONOURS
Degree.
2. The UGC has issued UGC (Credit Framework for Online Learning Courses) Regulation,
2016. These shall apply to all universities established or incorporated by or under a Central Act, a
Provincial Act, or a State/Union Territory Act and all institutions recognized by or affiliated to such
Universities and all institutions deemed to be universities under Section 3 of the UGC Act, 1956.
3. All India Council for Technical Education (AICTE) has introduced Model Curriculum for
Bachelor programs of 4 years/ 3 Years, and additional credits will be required to be done for the
degree of Bachelor program with Honours. These additional credits will have to be acquired with
online courses (MOOCs) as per AICTE.
4. This creates an excellent opportunity for students to acquire the necessary skill set for
employability through massive online courses where the rare expertise of world famous experts from
academics and industry are available.
5. Students are required to complete additional credits through MOOCs within 4 years/ 3years
of time (whatever be applicable time for the completion of registered program) so as to become
eligible for Honours degree as per norms.
6. It is necessary to complete minimum MOOCs credit course as mentioned below for becoming
eligible for the Honours degree in the registered program.
7. MOOC Course Credits shall be calculated as per details given below:
8. Student are required to give the prior information about MOOCs courses to his respective
HOD and COE, in which he/she wants to register for online certification.
9. After getting permission from respective HOD, a student can register for the MOOC
certification courses.
10. After successful completion of the said MOOC course, the student shall submit the certificate
of completion to the respective department. If he/ she fails to provide the certificates of MOOC
courses before last teaching day of the semester then these certificates will not be considered later.

11 | P a g e
Required credits for Honours :

S.No Program Duration Required credits for Honours

1. 2- Year 10- Credits
2. 3- Year 15- Credits
3. 4-Year 20- Credits

NPTEL/ SWAYAM
S. No Equivalent Credits
Course duration (in weeks)
1 4 2
2 8 3
3 12 4

Attached Items:
Open Elective Booklet Annexure-1
Soft Skills Booklet Annexure-2
Value Added Course Booklet Annexure-3

12 | P a g e
Bachelor of Computer Applications
with specialization

Artificial Intelligence and Data Science

Scheme

Batch 2022-25
 POORNIMA UNIVERSITY
Faculty of Computer Science and Engineering
Department of Computer Applications
Name of Program: BCA (With Specialization in Artificial Intelligence & Data Science)
Teaching Scheme for Year I Semester I Batch:2022-25
Teaching Marks
Scheme(Hrs per Distribution

Credits
Week)
Course
Course Name
Code Lecture Tutorials Practical IE ESE Total
(L) (T) (P)

A. University Core Courses

A.1 Theory
BULCSA1101 Environmental Studies 2 - - 40 60 100 2
B. Department Core Courses
B.1 Theory
BCACSA1101 Computer Oriented Numerical &
3 - 40 60 100 3
Statistical Method
BCACCA1102 Programming Fundamentals of C 3 - - 40 60 100 3
BCACCA1103 Web Designing 3 - - 40 60 100 3
BCACCA1104 Computer Organization and Architecture 3 - - 40 60 100 3
BASCCA1105 Fundamentals of Artificial Intelligence 3 - - 40 60 100 3
B.2 Practical
BCACCA1201 Programming Fundamentals of C Lab - - 2 60 40 100 1
BCACCA1202 Web Designing Lab - - 2 60 40 100 1
BCACCA1203 Office Automation Lab - - 2 60 40 100 1
BCACCA1204 Information Technology lab 2 60 40 100 1
C. Department Elective
NIL
D. Open Elective - - -
NIL
Humanities and Social Sciences
including Management courses
E.
OR Ability Enhancement
Compulsory Course(AECC)
BULCHU1201 Foundation English - - 2 60 40 100 1
Skill Enhancement Courses (SEC)
F. OR Project work, Seminar and
Internship in Industry or Elsewhere
NIL
Discipline, VAC & Social Outreach
G.
Talent Enrichment Programme (TEP) - - 2
BCACCA1601 50 - 50 1
Library / MOOC / Online Certificate - - 2
Courses
Non Syllabus Project (NSP) / Industry - - 2
Visit / CRT
Total 17 - 16

Total Teaching Hours 33 23

PU/Batch2022-25/SCHEME/BCA(AI & DS)(SEMItoVI)

 POORNIMA UNIVERSITY
Faculty of Computer Science and Engineering
Department of Computer Applications
Name of Program: BCA (With Specialization in Artificial Intelligence & Data Science)
Teaching Scheme for Year I Semester II Batch:2022-25
Teaching Marks
Scheme(Hrs per Distribution

Credits
Week)
Course
Course Name
Code Lecture Tutorials Practical IE ESE Total
(L) (T) (P)

A. University Core Courses

NIL
A.1 Theory
B. Department Core Courses
B.1 Theory
BCACCA2101 Computer Networks 3 - 40 60 100 3
BCACCA2102 OOPS with Java 3 - - 40 60 100 3
BCACCA2103 Data Structure and Algorithm 3 - - 40 60 100 3
BCACCA2104 Operating System 3 - - 40 60 100 3
BASCCA2105 Introduction to Data Science 3 - - 40 60 100 3
B.2 Practical
BCACCA2201 Operating System Lab - - 2 60 40 100 1
BCACCA2202 OOPS with Java Lab - - 2 60 40 100 1
BCACCA2203 Data Structure and Algorithm Lab - - 2 60 40 100 1
BCACCA2204 Computer Network Lab 2 60 40 100 1
C. Department Elective
NIL
D. Open Elective - - -
As Per Annexure-I 2 2
Humanities and Social Sciences
including Management courses
E.
OR Ability Enhancement
Compulsory Course(AECC)
BULCHU2201 Language Lab - - 2 60 40 100 1
Skill Enhancement Courses (SEC)
F. OR Project work, Seminar and
Internship in Industry or Elsewhere
NIL
Discipline, VAC & Social Outreach
G.
Talent Enrichment Programme (TEP) - - 2
BCACCA2601 50 - 50 1
Library / MOOC / Online Certificate - - 2
Courses
Non Syllabus Project (NSP) / Industry - - 2
Visit / CRT
Total 17 - 16

Total Teaching Hours 33 23

PU/Batch2022-25/SCHEME/BCA(AI & DS)(SEMItoVI)

 POORNIMA UNIVERSITY
Faculty of Computer Science and Engineering
Department of Computer Applications
Name of Program: BCA (With Specialization in Artificial Intelligence & Data Science)
Teaching Scheme for Year II Semester III Batch:2022-25
Teaching Marks
Scheme(Hrs per Distribution

Credits
Week)
Course
Course Name
Code Lecture Tutorials Practical IE ESE Total
(L) (T) (P)

A. University Core Courses

A.1 Theory NIL
B. Department Core Courses
B.1 Theory
BCACCA3101 Relational Database Management System 3 - 40 60 100 3
BCACCA3102 Python Programming 3 - - 40 60 100 3
BCACCA3103 Linux and Shell Script 3 - - 40 60 100 3
BASCCA3104 Introduction to RPA Tools 3 - - 40 60 100 3
B.2 Practical
BCACCA3201 Relational Database Management System - - 2 60 40 100 1
Lab
BCACCA3202 Python Programming Lab - - 2 60 40 100 1
BCACCA3203 Linux and Shell Script Lab 2 60 40 100 1
BASCCA3204 Introduction to RPA Tools - - 2 60 40 100 1
C. Department Elective
BCAECA3111 Digital Marketing
BCAECA3112 Software Engineering 3 - - 40 60 100 3
BCAECA3113 Management Information System
D. Open Elective - - -
As Per Annexure-I 2 2
Humanities and Social Sciences
including Management courses
E.
OR Ability Enhancement
Compulsory Course(AECC)
BULCHU3201 Communication Skills-I - - 2 60 40 100 1
Skill Enhancement Courses (SEC)
F. OR Project work, Seminar and
Internship in Industry or Elsewhere
NIL
Discipline, VAC & Social Outreach
G.
Talent Enrichment Programme (TEP) - - 2
BCACCA3601 50 - 50 1
Library / MOOC / Online Certificate - - 2
Courses
Non Syllabus Project (NSP) / Industry - - 2
Visit / CRT
Total 17 - 16

Total Teaching Hours 33 23

PU/Batch2022-25/SCHEME/BCA(AI & DS)(SEMItoVI)

 POORNIMA UNIVERSITY
Faculty of Computer Science and Engineering
Department of Computer Applications
Name of Program: BCA (With Specialization in Artificial Intelligence & Data Science)
Teaching Scheme for Year II Semester IV Batch:2022-25
Teaching Marks
Scheme(Hrs per Distribution

Credits
Week)
Course
Course Name
Code Lecture Tutorials Practical IE ESE Total
(L) (T) (P)

A. University Core Courses

A.1 Theory NIL
B. Department Core Courses
B.1 Theory
BCACCA4101 Big Data Analysis 3 - 40 60 100 3
BCACCA4102 Design and Analysis of Algorithm 3 - - 40 60 100 3
BASCCA4103 Machine Learning 3 - - 40 60 100 3
BASCCA4104 R Programming 3 - - 40 60 100 3
B.2 Practical
BCACCA4201 Big Data Lab - - 2 60 40 100 1
BCACCA4202 Design and Analysis of Algorithm Lab - - 2 60 40 100 1
BASCCA4203 Machine Learning Lab 2 60 40 100 1
BASCCA4204 R Programming Lab - - 2 60 40 100 1
C. Department Elective
BCAECA4111 Information Security Fundamental
BCAECA4112 Software Project Management 3 - - 40 60 100 3
BCAECA4113 E-Commerce
D. Open Elective - - -
As Per Annexure-I 2 2
Humanities and Social Sciences
including Management courses
E.
OR Ability Enhancement
Compulsory Course(AECC)
BULCHU4201 Communication Skills-II - - 2 60 40 100 1
Skill Enhancement Courses (SEC)
F. OR Project work, Seminar and
Internship in Industry or Elsewhere
BCACCA4401 Industrial Training Seminar-1 2 60 40 100 1
Discipline, VAC & Social Outreach
G.
Talent Enrichment Programme (TEP) - -
BCACCA4601 Library / MOOC / Online Certificate - -
Courses 4 50 - 50 1
Non Syllabus Project (NSP) / Industry - -
Visit / CRT
Total 17 - 16

Total Teaching Hours 33 24

PU/Batch2022-25/SCHEME/BCA(AI & DS)(SEMItoVI)

 POORNIMA UNIVERSITY
Faculty of Computer Science and Engineering
Department of Computer Applications
Name of Program: BCA (With Specialization in Artificial Intelligence & Data Science)
Teaching Scheme for Year III Semester V Batch:2022-25
Teaching Marks
Scheme(Hrs per Distribution

Credits
Week)
Course
Course Name
Code Lecture Tutorials Practical IE ESE Total
(L) (T) (P)

A. University Core Courses

A.1 Theory NIL
B. Department Core Courses
B.1 Theory
BASCCA5101 Deep Learning 3 - 40 60 100 3
BASCCA5102 EDA and Data Visualization 3 - - 40 60 100 3
BASCCA5103 Natural Language Processing 3 - - 40 60 100 3
BASCCA5104 Computer Vision 3 - - 40 60 100 3
B.2 Practical
BASCCA5201 Deep Learning Lab - - 2 60 40 100 1
BASCCA5202 Natural Language Processing Lab - - 2 60 40 100 1
BASCCA5203 Computer Vision Lab 2 60 40 100 1
C. Department Elective
BCAECA5111 Advance Cloud Technology
BCAECA5112 Advanced Data Structure 3 - - 40 60 100 3
BCAECA5113 Data Mining & Warehousing
D. Open Elective - - -
As Per Annexure-I 2 2
Humanities and Social Sciences
including Management courses
E.
OR Ability Enhancement
Compulsory Course(AECC)
BULCHU5201 Human Values & Professional Ethics - - 2 60 40 100 1
BULCHM5202 Leadership & Management Skills - - 2 60 40 100 1
Skill Enhancement Courses (SEC)
F. OR Project work, Seminar and
Internship in Industry or Elsewhere
BCACCA5401 Industrial Training Seminar-II 2 60 40 100 1
Discipline, VAC & Social Outreach
G.
Talent Enrichment Programme (TEP) - -
BCACCA5601 Library / MOOC / Online Certificate - -
Courses 4 50 - 50 1
Non Syllabus Project (NSP) / Industry - -
Visit / CRT
Total 17 - 16

Total Teaching Hours 33 24

PU/Batch2022-25/SCHEME/BCA(AI & DS)(SEMItoVI)

 POORNIMA UNIVERSITY
Faculty of Computer Science and Engineering
Department of Computer Applications
Name of Program: BCA (With Specialization in Artificial Intelligence & Data Science)
Teaching Scheme for Year III Semester VI Batch:2022-25
Teaching Marks
Scheme(Hrs per Distribution

Credits
Week)
Course
Course Name
Code Lecture Tutorials Practical IE ESE Total
(L) (T) (P)

A. University Core Courses

B. Department Core Courses
BCACCA6501 Project/Internship - - 22 60 40 100 11
C. Department Elective: Anyone
NIL
D. Open Elective: Anyone
NIL
Humanities and Social Sciences
including Management courses
E.
OR Ability Enhancement
Compulsory Course(AECC))
Skill Enhancement Courses (SEC) OR
F. Project work, Seminar and Internship
in Industry or Elsewhere
NIL
Discipline, VAC & Social Outreach
G.
Talent Enrichment Programme (TEP)
- - 3 -
BCACCA6601 Library / MOOC / Online Certificate 50 50 1
Courses - - 4 -
Non Syllabus Project (NSP) / Industry Visit - - 4
/ CRT
Total 33

Total Teaching Hours 33 12

PU/Batch2022-25/SCHEME/BCA(AI & DS)(SEMItoVI)

 Semester-I

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 1 of 118

 Semester I
Department Core Courses
Code: BULCSA1101 Environmental Studies 2 Credits [LTP: 2-0-0]

COURSE OUTCOME
Students will be able to:
 Explain the concept of ecology, ecosystem and biodiversity.
 Implement innovative ideas of controlling different categories of Environmental Pollution.
 Explain different environmental issues together with various Environmental Acts, regulations and International
Agreements.
 Summarize social issues related to population, resettlement and rehabilitation of project affected persons and
demonstrate disaster management with special reference to floods, earthquakes, cyclones, landslides.
 Determine the local environmental assets with simple ecosystems and identify local flora and fauna.

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Introduction to Environmental Studies 05
2. Environmental Pollution and its Controls 05
3. Environmental Policies & Practices 05
4. Human Communities and the Environment 05
5. Field Work 04

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to Environmental Studies
 Introduction of Unit
 Multidisciplinary nature of environmental studies
 Concept of sustainability and sustainable development.
 Ecosystem: Structure and function of ecosystem
 Energy flow in an ecosystem: food chains, food webs and ecological succession. Case studies\
 Case studies of the following ecosystems: Forest ecosystem, Grassland ecosystem, Desert ecosystem
 Aquatic ecosystems
 Biodiversity and Conservation

Conclusion &Real Life Application
2. Environmental Pollution and its Controls
 Introduction of Unit
 Environmental pollution: types, causes, effects and controls, Air, water, soil and noise pollution
 Nuclear hazards and human health risks
 Solid waste management: Control measures of urban and industrial waste.
 Pollution case studies

Conclusion &Real Life Application
3. Environmental Policies & Practices

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 2 of 118

  Introduction of Unit
 Climate change, global warming, ozone layer depletion, acid rain and impacts on human communities and
agriculture
 Energy resources: Renewable and non-renewable energy sources, use of alternate energy
sources, growing energy needs, case studies.
 Environment Laws: Environment Protection Act; Air (Prevention & Control of Pollution) Act; Water
(Prevention and control of Pollution) Act; Wildlife Protection Act; Forest Conservation Act.
 International agreements: Montreal and Kyoto protocols and Convention on Biological Diversity (CBD)
 Conclusion &Real Life Application
4. Human Communities and the Environment
 Introduction of Unit
 Human population growth: Impacts on environment, human health and welfare.
 Resettlement and rehabilitation of project affected persons; case studies.
 Disaster management: floods, earthquake, cyclones and landslides.
Conclusion &Real Life Application
5. Field Work
 Introduction of Unit
 Visit to an area to document environmental assets: river/ forest/ flora/fauna, etc.
 Visit to a local polluted site-Urban/Rural/Industrial/Agricultural.
 Study of common plants, insects, birds and basic principles of identification.
 Study of simple ecosystems-pond, river, Delhi Ridge, etc.
 Conclusion &Real Life Application

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Environmental
1 Studies ErachBarucha Latest UGC
2. Environmental
2 Studies Benny Joseph Latest Tata McgrawHill
3. Environmental
3 Studies R. Rajagopalan Latest Oxford University
Press
Reference Books
1. Principles
4 of Environmental Science and P. Venugoplan Rao Latest Prentice Hall of
Engineering India.
2. Environmental
5 Science and Engineering Meenakshi Latest Prentice Hall India.
Online Resources
1. https://www.coursera.org/browse/physical-science-and-engineering/environmental-science-and-sustainability
2. https://www.edx.org/learn/environmental-science
3. https://nptel.ac.in/courses/127105018

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 3 of 118

 Code: BCACSA1101 Computer Oriented Numerical & Statistical Method 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Explain and represent to the various forms of data using statistics.
 Analyse the correlation and regression with their properties
 Explain and determine the basic concepts of probability and their properties.
 Analyse the equal and unequal intervals for Interpolation problem
 Analyse the numerical methods to solve differential equations

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Data representation and Analysis 08
2. Regression and Correlation 08
3. Random variable and Probability distribution 08
4. Interpolation Methods 08
5. Numerical integration and differentiation 08

B. DETAILED SYLLABUS

Unit Unit Details

1. Data representation and Analysis
 Introduction of Unit
 Statistical diagram: scattered diagram, histogram, ogie curve, pai chart, Use of EXCEL software to
compute statistical measures and diagrammatic representation
 Measure of Central Tendency, Mean, Median, Mode.
 Measure of Dispersion: Range, Quartile Deviation, mean deviation, Coefficient of mean
 Deviation, Standard Deviation
 Conclusion &Real Life Application
2. Regression and Correlation
 Introduction of Unit
 Measure of association between two variables Types of correlation, Karl Pearson‘s Coefficient of
correlation
 Spearman‘s Rank correlation and its interpretations
 Regression Analysis: Concept and difference between correlation and regression, linear regression
equations,
 properties of regression coefficients
 Conclusion &Real Life Application
3. Random variable and Probability Distribution
 Introduction of Unit
 Introduction to basic Probability theory
 Probability Addition, Multiplication, Conditional Probability,
 Baye‘s Theorem and examples,
 Discrete and continuous random variable,
 Introduction of Standard probability distributions: Binomial, Poisson
 Conclusion &Real Life Application
4. Interpolation Methods
 Introduction of Unit

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 4 of 118

  Finite difference, Forward and backward differences, Interpolation and Extrapolation,
 Newton‘s forward interpolation formula, Newton‘s backward interpolation formula,
 Lagrange‘s interpolation formula
Newton‘s divided difference formula
Conclusion &Real Life Application
5. Numerical Integration and differentiation
 Introduction of Unit
 Numerical integration, Gaussian integration Trapezoidal Method, Simpson‘s rule (1/3, 3/8),
 Numerical differentiation Euler‘s method, Modified Euler‘s method, RungeKutta 2nd order method,
Runge Kutta 4th order method,.
 Conclusion &Real Life Application

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Probability and Statistics for Engineers Richard A Johnson Latest Prentice Hall of
India.
2. Introductory Methods of Numerical S.S. Sastry Latest Prentice Hall of India
Analysis
3. Computer Oriented Numerical Methods V. Rajaraman Latest Prentice Hall of India
Reference Book
1. Higher Engineering Mathematics, Grewal B. S. and Grewal J. S, Khanna Publishers, New Delhi, Latest
Edition
2. A textbook of Computer based numerical and Statistical Techniques: A. K. Jaiswal & Anju Khandelwal,
New Age International Publishers
Online Resources
1. https://www.udemy.com/course/computer-oriented-numerical-techniques/

2. https://onlinecourses.swayam2.ac.in/cec22_ma02/preview

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 5 of 118

 Code: BCACCA1102 Programming Fundamentals of C 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Learn data types, loops, functions, array, pointers, string, structures and files.
 Develop conditional and iterative statements to write C programs.
 Implement concept of string using array.
 Allocate memory dynamically using pointers.
 Apply C Programming to solve real time problems.

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Introduction to C Programming 6
2. Decision Making & Looping 6
3. Array and string 8
4. Advance programming in C 8
5. File handling & Additional features 8

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to C Programming

 Introduction of Unit
 Introduction to computer-based problem solving, Program design and implementation issues- Flowcharts
& Algorithms.
 Types of Languages – Machine language, assembly language, high level languages, Assemblers,
Compilers, Interpreters.
 Overview of C, Data Types, Constants & Variables, Literals, Operators & Expressions
 Conclusion & Real Life Application
2. Decision Making & Looping
 Introduction of Unit
 Decision making in C- if statement, if-else statement, Nested if statement, if else if Ladder, Switch case
 Loop control in C – for loop, while loop, do-while loop
Control flow in C- break, continue and goto statement.
Conclusion & Real Life Application
3. Array and string
 Introduction of Unit
 Array- 1D array, 2D array and dynamic array
 Scope rules- Local & global variables.
 Functions-parameter passing, call by value and call by reference, calling functions with arrays, command
line argument, recursion- basic concepts.
 String – String in-build functions.
 Conclusion of the Unit
4. Advance programming in C
 Introduction of Unit
 Pointers- The & and * operator, pointer expression, assignments, arithmetic, comparison, arrays of
pointers, pointers to pointers, initializing pointers, pointers to functions, function retuning pointers.
 Structures- Basics, declaring, referencing structure elements, array of structures, passing structures to

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 6 of 118

 functions, structure pointers, arrays and structures within structures, typedef.
 Unions – Declaration, uses
 Enumerated data-types
 Conclusion of the Unit
5. File handling &Additional features
 Introduction of Unit
 File Handling – The file pointer, file accessing functions-fopen, fclose, putc, getc, fprintf, reading and
writing into a file
 Advance features- storage classes and dynamic memory allocation
 C Preprocessor- #define, #include, #undef, Conditional compilation directives.
 C standard library and header files: Header files, string functions, mathematical functions, Date and Time
functions.
 Conclusion of the Unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

th th
1. Let us C, 6 Edition Yashwant Kanitkar 6 Edition PBP Publication
2. The C programming Language Richieand Kenninghan 2004 BPB Publication,
rd
3. Programming in ANSI C 3 Edition, E.Balagurusamy
rd 3 Edition, 2005 Programming in
2005 ANSI C
Reference Book
1. The C programming Language Richie and Kenninghan PBP Publication,2004
2. Programming in ANSI C 3rd Edition, 2005 Balaguruswmy Tata McGraw Hill
Online Resources

1. https://www.programiz.com/c-programming/examples

2. https://www.w3resource.com/c-programming-exercises

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 7 of 118

 Code: BCACCA1103 Web Designing 3Credits[LTP:3-0-0]

COURSEOUTCOME:
Students will be able to:
 Create an effective web page, including an in-depth consideration of information architecture.
 Become familiar with graphic design principles that relate to web design and learn how to implement theories
into practice.
 Develop skills in analyzing the usability of a web site.
 Plan and conduct user research related to web usability.
 Apply HTML & CSS to solve real time web problems.

A. OUTLINE OF THE COURSE

Unit No. Title of the unit Time required for the

Unit(Hours)
1. Introduction to HTML And Internet 8
2. HTML & CSS 8
3. HTML5, CSS3 8
4. XML 6
5. Practical Website Development 6

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to HTML And Internet

 Introduction, History of internet, Internet Design Principles, Internet Protocols - FTP,TCP/IP, SMTP, Telnet,
etc., Client Server Communication, Web System architecture
 Evolution of the Web, Web architectures, Web clients and servers, Static and Dynamic Web Applications,
Front end and back end web development.
 HTML, CSS, JS, XML; HTTP, secure HTTP, etc; URL, Web Services – SOAP, REST
 Conclusion of the Unit
2. HTML & CSS

 Introduction to Html, Html Document structure, Html Editors, Html element/tag & attributes, Designing
simple page - Html tag, Head tag, Body tag;
 More HTML Tags - Anchor tag, Image tag, Table tag, List tag, Frame tag, Div tag ; Html forms - Input type,
Text area, Select , Button, Images.
 Introduction to CSS, Syntax, Selectors ,Embedding CSS to Html, Formatting fonts, Text & background
color, Inline styles, External and Internal Style Sheets, Borders & boxing
 Conclusion of the Unit
3. HTML5, CSS3

 Introduction to HTML5.
 Introduction to CSS3, New features, Local storage, Web Sockets, Server events, Canvas,
Audio & Video, Geolocation, Microdata, Drag and Drop. Browser life cycle and browser rendering stages.
Service workers
 Conclusion of the Unit

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 8 of 118

 4. XML

 Introduction to XML
 Difference b/w Html & XML, XML editors.
 XML Elements & Attributes XML DTD.
 XML Schema, XML Parser.
 Document Object Model (DOM), XML DOM.
 Conclusion of the Unit
5. Practical website development

 Commonly used Web Servers and browsers, Setting up a server and domain name, website types and
structures,
 Web authoring tools, Web hosting, website maintenance, generating traffic to your website.
 Conclusion of the Unit

C. RECOMMENDEDSTUDYMATERIAL:

S. Text Books: Author Edition Publication

No
1 Practical Web Design for
1. AdrianW. West 2016 Apress 2016
Absolute Beginners
2 Introducing Web Jorg Krause 2017 Apress2017
Development
3 HTML & CSS:The Thomas Powell 2010 McGrawHill
Complete Reference Fifth
Edition
Reference Book
1 HTML and CSS: Design and Build Websites – by Jon Duckett
2 Head First HTML and CSS: A Learner‘s Guide to Creating Standards-Based Web Pages – by Elisabeth Robson
& Eric Freeman Publisher- ORELLY
Online Resources

1 https://www.w3schools.com/html/html_links.asp

2 https://www.tutorialrepublic.com/html-tutorial/html-links.php

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 9 of 118

 Code: BCACCA1104 Computer Organization and Architecture 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Explain the organization of basic computer, its design and the design of control unit.
 Demonstrate the working of central processing.
 Describe the operations and language f the register transfer, micro-operations and input- output organization.
 Organize memory and memory management hardware.
 Elaborate advanced concepts of computer architecture, Parallel Processing, interprocessor communication and
synchronization.

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Basics Of Digital Logics 8
2. Register Transfer and Micro-operation 8
3. Basic Computer Organization 8
4. Modes of Data Transfer and Memory Organization 6
5. Computer Arithmetic. 6

B. DETAILED SYLLABUS

Unit Unit Details

1. Basics of Digital Logics
 Introduction of Unit
 Number systems : Binary number system, Octal &Hexa-decimal number system, Conversion of Number
System, r's & (r-1)'s, Binary arithmetic Operations,
 Logic Gates: AND, OR, NOT GATES and their Truth tables, NOR, NAND & XOR gates.
 Boolean algebra: AND, OR, Inversion, Basic Boolean Law's, DE Morgan‘s theorem, Minimization
techniques: K -Map, Sum of Product & Product of Sum,.
 Conclusion &Real Life Application
2. Register Transfer and Micro-operation

 Introduction of Unit
 Register Transfer Language, Register Transfer, Bus and Memory Transfer: Three state bus buffers,
Memory Transfer.
 Logic Micro-operations: List of Logic micro operations, Shift Micro-operations (excluding H/W
implementation), Arithmetic Logic Shift Unit.
 Conclusion &Real Life Application
3. Basic Computer Organization
 Introduction of Unit
 Instruction Codes, Computer Registers: Common bus system, Computer Instructions
 Instruction formats, Instruction Cycle: Fetch and Decode, Flowchart for Instruction cycle, Register
reference instructions.
Conclusion & Real Life Application
4. Modes of Data Transfer and Memory Organization

 Introduction of Unit
 Control Memory, Address Sequencing, Conditional branching, Mapping of instruction, Subroutines.

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 10 of 118

  Central Processing unit: Introduction of CPU.
 Memory Organization: Memory Hierarchy, Main Memory, Auxiliary Memory,
 Associative Memory, Cache Memory, Virtual Memory
 Conclusion &Real Life Application

5. Computer Arithmetic.

 Introduction of Unit
 Modes of Data Transfer: Priority Interrupt, Direct Memory Access,
 Introduction, Addition and Subtraction,
 Multiplication Algorithms (Booth algorithm), Division Algorithms,
 Input – Output Organization: Peripheral devices, Input – Output interface, Introduction of
Multiprocessors: Characteristics of multi-processors.
 Conclusion & Real Life Application

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1.Computer System Architecture Morris Mano Latest PHI

2.Computer Organization and William Stallings Latest PHI
Architecture
3. Digital Computer Electronics: Malvino Latest TMH
Reference Book
1. Computer Fundamentals Architecture and Organization by Ram B

2. Fundamental of Computer Organization and Design by Sivarama P Dandamudi

Online Resources

1. http://nptel.iitm.ac.in/video.php?subjectId=106102062

2. https://www.geeksforgeeks.org/computer-organization-and-architecture-tutorials/

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 11 of 118

 Code: : BASCCA1105 Fundamentals of Artificial Intelligence 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Analyze various agents in AI
 Apply Search techniques to solve problem
 Solve the Constraint Satisfaction Problems using AI methods
 Implement Adversarial Search in Game Playing
 Solve real world problems using AI techniques

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Introduction to Artificial Intelligence 07

2. Problem solving by Search 08

3. Constraint Satisfaction Problems 07

4. Adversarial Search and Game Playing 07

5. AI applications 07

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to Artificial Intelligence
 Introduction to Artificial Intelligence
 Definition of Artificial Intelligence
 A brief history of Artificial Intelligence
 Why do we study AI?
 What is AI?
 Views of AI: Acting Humanly, Thinking Humanly, Thinking Rationally and Acting Rationally
 Areas of AI
 Agents and environments
 PEAS (Performance measure, Environment, Actuators, Sensors)
 Environment types
 Agent types: Simple reflex agents, Model-based reflex agents, Goal-based agents and Utility-based agents
 Examples of Agent
 Conclusion of the Unit
2. Problem solving by Search
 Introduction of Unit
 Problem-solving agents
 Problem formulation
 Example problems: 8-Puzzle problem and 8-queens problem
 Basic search algorithms
 Un-informed search strategies: Breadth-first search, Depth-first search, Depth-limited search, Uniform-
cost search and Iterative deepening search
 Informed Search Algorithms: Best-first search, Greedy best-first search, A* search, Hill-climbing search,
and Genetic algorithms
 Conclusion of the Unit

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 12 of 118

 3. Constraint Satisfaction Problems
 Introduction to Constraint Satisfaction Problems (CSP)
 Why do we need to consider CSPs?
 Constraint Propagation
 CSP Vs Search problems
 Real-world CSPs
 Finite vs. Infinite CSP
 CSP as a Search Problem : Backtracking search for CSPs, Forward checking for CSPs and Local search
for CSPs
 Conclusion of the Unit
4. Adversarial Search and Game Playing
 Introduction to Adversarial Search and Game Playing
 Games: Definition, Search vs. Games and Game Tree
 Optimal decisions in Games: Mini max algorithm and α-β pruning with example
 Imperfect, real-time decisions
 Partially Observable Games
 State-of-the-Art Game Programs: Chess on Deep Blue, Chess on standard PCs, Checkers on Chinook and
Backgammon: TD-Gammon
 Conclusion of the Unit
5. AI applications
 Introduction of Unit
 Language Models
 Information Retrieval, Extraction
 Natural Language Processing
 Machine Translation
 Speech Recognition
 Expert system: Introduction, phases, architecture, Expert system Vs Traditional system
 Robot, Hardware , Planning, Moving
 Conclusion of the Unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

Artificial Intelligence: A Modern S. Russell Third
1. Approach and P. Edition Prentice Hall
Norvig
2. Prolog: Programming for Artificial I. Bratko Fourth Addison-Wesley
Intelligence edition Educational
Publishers
Inc
Reference Book

Artificial Intelligence: A Systems Approach (Computer Science), Jones and Bartlett Publishers, Inc.; First
1.
Edition, M. Tim Jones.

2. The Quest for Artificial Intelligence, Cambridge University Press, Nils J. Nilsson.
3.
Programming in Prolog: Using the ISO Standard, Fifth Edition, Springer, William F. Clocksin and
Christopher S. Mellish

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 13 of 118

 Online Resources

1. https://onlinecourses.nptel.ac.in/noc21_ge20/preview
2. https://www.coursera.org/learn/introduction-to-ai
3. https://www.javatpoint.com/artificial-intelligence-tutorial

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 14 of 118

 Practical
Code: BCACCA1201 Programming Fundamentals of C Lab 1Credit [LTP: 0-0-2]

Course Outcome: -
Students will be able to:
 Gain concept of functional hierarchical code organization.
 Work with textual information, characters and strings
 Implement file handling concepts
 Implement real time applications using the power of C language features.
 Overcome and solve possible errors during program execution.

A. LIST OF EXPERIMENTS:

1 Given the values of the variables x, y and z, write a program to rotate their values such that x has the
value of y, y has the value of z, and z has the value of x

2 Write a program that reads a floating point number and then displays the right-most digit of the integral
part of the number.

3 Write a C program to calculate the sum of digits of given number.

4 Program to find largest and smallest number from four given number.

5 Program to find whether a year is leap or not

6 Write a C program in which enter any number by the user and perform the operation of Sum of digits of
entered number.

7 Write a C Program to convert Decimal number to Binary number

8 Find the sum of this series upto n terms

1+2+3+4+5+6+………..
9 Program to print Armstrong‘s numbers from 1 to 100.

10 Write a program to convert years into Minute, Hours, Days, Months, Seconds using switch () statements

11 Write a C menu driven program

12 Write a program to generate the various pattern of numbers

13 Write a C Program to print the reverse of an integer number

14 Write a C program to perform the factorial of given number

15 Write a C program in which a function prime that returns 1 if its argument is a prime and return zero
otherwise.

16 Write a C program to calculate factorial of a number using recursion.

17 Write a C program in which enter 10 elements by the user and perform the operation of sorting in
ascending order

18 Write a C program to perform to perform Matrix addition and multiplication operations.

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 15 of 118

 19 Write a program to determine the length of the string and find its equivalent ASCII codes.

20 Write a program to delete all the occurrences of the vowels in a given text. Assume that the text length
will be of one line

21 Write a program to maintain the library record for 100 books with book name, author‘s name,
and edition, year of publishing and price of the book.

B. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Let us C Yashwant Kanetkar 6th Edition PBP Publication

2. The C programming Language Richie and Kenninghan 2nd Edition PBP
2004 Publication,2004
3. Programming in ANSI C E Balaguruswamy 3rd Edition, Tata McGraw Hill
2005
Reference Book
1. The C programming Language by Richie and Kenninghan, PBP Publication,2004

2. Programming in ANSI C 3rd Edition, 2005 byE.Balagurusamy, Tata McGraw Hill

Online Resources

1. https://www.programiz.com/c-programming/examples

2. https://www.w3resource.com/c-programming-exercises

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 16 of 118

 Code: BCACCA1202 Web Designing Lab 1Credit [LTP: 0-0-2]

Course Outcome: -
Students will be able to:
 Apply the principles of creating an effective web page, including an in-depth consideration of information
architecture.
 Become familiar with graphic design principles that relate to web design and learn how to implement theories
into practice.
 Develop skills in analyzing the usability of a web site.
 Evaluate how to plan and conduct user research related to web usability.
 Learn the language of the web: HTML and CSS.

A. LIST OF EXPERIMENTS:

1 Hello World Web Page

a) Create a web page using basic HTML features like tags, attributes, elements and page title.
b) How to install and configure a web server
2 Create a My Profile Page
a) Using text boxes, check boxes, radio buttons and submit buttons.
b) Design a web page using CSS include the following:
i. Control the repetition of image with back ground-repeat property.
ii. Define style for links asa: link, b:active,c:hover,d:visited.
iii. Add customized cursors for links.
3 Create a My Profile Page
a) A more functional web page by making use of headings, paragraphs, lists, images and links.
b) Design a web page using CSS include the following:
i. Use different font styles.
ii. Set back ground image for both the page and single elements on the page.
4 Create XML Http Request and retrieve data from a text file and an XML file.
5 Create the following webpage:
a) Show the class time table in a tabular format.
b) Create a web page using HTML to show your geolocation.
6 Create a webpage using HTML for audio and video player.
7 Create a log in registration form using PHP.
8 Develop a PHP web page to manipulating files such as creating ,writing, reading and uploading.
9 Create a dynamic web page by using PHP conditional operators, loops and strings to create an
dynamic time table page.
10 Develop a PHPweb application track the user as how many times visited and last visited time
11 Develop a static website–I.
12 Develop a static website–II.

B. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1.
1. Practical Web Design for AdrianW. West 2016 Apress 2016
Absolute Beginners
2. Introducing Web Development Jorg Krause 2017 Apress2017
3. HTML & CSS: The Thomas Powell 2010, FifthEdition McGrawHill,
Complete Reference
Reference Book

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 17 of 118

 1. HTML and CSS: Design and Build Websites – by Jon Duckett

2. Head First HTML and CSS: A Learner‘s Guide to Creating Standards-Based Web Pages – by Elisabeth
Robson & Eric Freeman Publisher- ORELLY
Online Resources

1. https://www.w3schools.com/html/html_links.asp

2. https://www.tutorialrepublic.com/html-tutorial/html-links.php

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 18 of 118

 Code: BULCSA1203 Office Automation Lab 1 Credit [LTP: 0-0-2]

Course Outcome: -
Students will be able to:
 Prepare document in MS word using pictures and editing properly.
 Construct forms in MS. Word
 Protect a document from unauthorized access by assigning password
 Prepare worksheet to keep records and how to use mathematical formula in same
 Present a Presentation using MS Power point

A. LIST OF EXPERIMENTS:

1 MS Word
Prepare a document about any tourist destination of your choice with appropriate pictures and editing
features.
2 Prepare a News Paper Layout. Insert appropriate pictures wherever necessary. Use the following Features:
 Three Column and Four Column setting
 Set One or Two Advertisements
 Use Bullets and Numbering.
3
Create a Document consisting of Bio-data. It includes
 A table giving your qualification and /or experience of work. Table should be Bordered and Shaded.
 A Multilevel list giving your areas of interest and further areas of interest. The sub areas should be
numbered as 'a','b', etc while the area should be numbered as '1','2',etc.
 The information should be divided in ―General‖ and ―Academic‖ sections.
 The header should contain ―BIO-DATA ‖while the footer should have page numbers in the format
Page1of 10.
 Assign a password for the document to protect it from unauthorized access.
4
Assume that you are coordinating a seminar in your organization. Write a letter to 10 different IT
companies asking them to participate in the seminar using mail merge facility.
5 Prepare a document which contains template of marks card of students. Assume that there are 10

students. The footer for the document should be 'Poornima University Jaipur'.
6 Prepare a document about any topic In mathematics which uses mathematical symbols. (At least 5
mathematical symbols should be used). Assign a password for the document to protect it from
unauthorized access. Demonstrate the use of Hyperlink Option. Sets margins to your document, a font of
size and double spaced document
7 MS-Excel
Open a new work book, save it as JavaCoffeeBar.xls. In sheet 1 write following sales data for
JavaCoffee bar to show their first 6 months sales.
 Select cell B4:D4 and change the horizontal alignment to center and text to 90degree.
 All titles should be in bold
 Format all cells numbers to currency style and adjust width as necessary.
 Add border to data..
8 Prepare a worksheet to maintain student information. The work sheet should Contain Roll Number,
Name and marks in 5 subjects. (Max Marks is 100).Validate the marks. Calculate the total marks.
Assign the grade according to the following. Assign grade 'A' if the total marks is above 450. From 401
to 449 assign the grade as 'B'. From 351 to 400 assign the Grade as 'C'. From 300 to 350 the grade to be
assigned is 'D'. For the total marks less than 300 No grade is assigned. A student is eligible to get a
grade only when he gets 40 and above in all the subjects. In such cases the grade is―FAIL‖.(Assume
that there are 10 students)
9 Prepare a pay-bill using a worksheet. The work sheet should contain Employee Id, Name ,Designation,

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 19 of 118

 Experience and Basic Salary and Job ID. If Job Id is 1 then DA is 40% of the basic salary. HRA is Rs.
4500. If Job Id is 2 then DA is 35% of the basic salary. HRA is Rs.3500. If Job Id is 3 then DA is 30%
of the basic salary. HRA is Rs. 2500. If Job Id is 4 then DA is 25% of the basic salary and HRA is
RS.2500. For all the other Job ids DA is 20% of the basic salary and HRA is Rs. 1500. For all the
above Job ids PF to be deducted is 4%. For the job ids between1-4 Rs.100 to be deducted as
Professional Tax. Find the netpay.
10 For the above employee worksheet perform the following operations
 Use filter to display the details of employees whose salary is greater than 10,000.
 Sort the employees on the basis of their net pay
 Use advance filter to display the details of employees whose designation is "Programmer‖ and Net
Pay is greater than 20,000 with experience greater than 2yrs
11 Using Excel project the Products ales for any five products for five years.
 Compute the total sales of each product in the five years.
 Compute the total sales of all the products in five year.
 Compute the total sales of all products for each year.
 Represent annual sale of all the products using Pie-Chart.
 Represent annual sales of all products using Bar Chart.
 Represent sale of a product for five years using Pie-Chart.
 Label and format the graphs
12 Create a statement of Telephone Bill Charge for a customer.
 Telephone Calls
 Up to150calls- free
 151to500calls-0.80percall
 501 to1000calls-1.00percall
 1001to2000-1.25percall
 Above2000- 1.40percall
13 Perform Following:
 Using Excel write sales data with columns product, month and sales. Write at least 5 records. Create
Pivot Table chart and Report for the data.
 Create a macro to change the name of worksheet as Macro Example, merge first three columns of
first row and write heading as DATA in green color with yellow background
 Link word document in excel worksheet to show the usage of linking and embedding.
14 MS Power Point
Assume that you are going to give a presentation about Information Technology. (Choose some latest
technologies). The presentation should have minimum 10 slides. Insert appropriate images wherever
necessary. Use proper formatting, Diagrams and tables. Show the usage of action buttons, hyperlinks,
and animations.

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 20 of 118

 Code: BCACCA1204 Information Technology Lab 1 Credit [LTP: 0-0-2]

Course Outcome: -
Students will be able to:
 Identify the peripherals of a computer, components in a CPU and its functions.
 Install operating system like Linux or MS windows on the personal computer. The system should be configured as
dual boot with both windows and Linux.
 Trouble Shoot software/Hardware and Identify defective peripherals
 Configure the TCP/IP setting. Get connected to local area network and access internet
 Surfing the Web and customize the web browser according to their need.

A. LIST OF EXPERIMENTS:

1 Peripherals of a computer, System unit, CPU, Mother Board, FDD, CD ROM Drive,
HDD, Ethernet Card, Monitor, Keyboard, Mouse & Speakers. And there connecting slots with name

2 Different Slots of motherboard and there connections.

3 Installing operating system like Linux or MS windows on the personal computer.
4 Configured system as dual boot with both windows and Linux
5 Disk formatting, partitioning and Disk operating system commands
6 Part1. Identify the hardware/ software problem and fix it .
7 Part2. Identify the hardware/ software problem and fix it to get the computer back to function.

8 Configure the TCP/IP setting in local area network and access the internet.
9 Customize their web browsers with the LAN proxy settings,
 bookmarks, search toolbars and pop up blockers.
 Also, plug-ins like Macromedia Flash and JRE for applets should be configured.

10 Search Engines & Netiquette

How to use the search engines. Effective use of search engines like Google, Yahoo, ask.com
11 Cyber Hygiene: viruses on the internet and install antivirus software
customize the browsers to block pop ups, block active x downloads to avoid viruses and/or worms

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 21 of 118

 Code: BULCHU1201 Foundation English 1Credit [LTP: 0-0-2]

Course Outcome: -
Students will be able to:
 Demonstrate the grammar skills involved in writing sentences and short paragraphs.
 Build up a good command over English grammar and vocabulary to be able to ace error spotting.
 Define unknown words in sentence level context using a picture dictionary or by creating a memory link for
support.
 Analyze and effectively use the conventions of the English language.
 Develop their interest in reading and enhance their oral and silent reading skills along with sharpen their critical
and analytical thinking.

A. LIST OF EXPERIMENTS:

1 Parts of Speech: Theory & Practice through various Exercises

2 Sentence Structures: Theory & Practice through various Exercises

3 Tenses: Theory & Practice through various Exercises

4 Spotting the Errors: Applying the rules and Practice Questions

5 Vocabulary Building-I: Practice by sentence formation

6 Vocabulary Building-II: Practice by sentence formation

7 Paragraph Writing

8 Article Writing

9 Précis Writing

10 Formal & Informal Letter Writing

11 Reading Comprehension- I: Beginner‘s level reading and Answering the Questions (Competitive Exams)

12 Reading Comprehension- II: Intermediate‘s level reading and Answering the Questions (Competitive
Exams)

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 22 of 118

 Code: BCACCA1601 Discipline, VAC & Social Outreach 1 Credit [LTP: 0-0-6]

Course Outcome: -
The objective of Discipline and TEP is to provide students with the opportunities to enhance job
fetching skills and at the same time to cultivate the student’s personal interests and hobbies while
maintaining the good disciplinary environment in the University. TEP is integrated into the
curriculum for holistic development of students through active participate on in various activities
falling in Technical and non-technical categories.

Social outreach, Discipline, TEP -I, VAC & Extra Curricular activities shall be evaluated on the basis of
its sub constituent programme, as a complete one credit course. It shall be counted in calculation of
SGPA but it is not a back log subject. However, the attendance of these classes shall be recorded
and accounted in the total attendance.

Activities included in this category in the FIRST Semester are as follows:

Code Activity Hours Credits

Talent Enrichment Programme(TEP)-I 2

2 1
BCACCA1601 Library / MOOC / Online Certificate Courses

Non Syllabus Project (NSP) / Industry Visit / CRT 2

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 23 of 118

 Semester-II

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 24 of 118

 Semester II
Department Core Courses
Code: BCACCA2101 Computer Networks 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Gain the knowledge of the basic computer network technology and become familiar with layered communication
architectures (OSI and TCP/IP).
 Acquire basics of Framing and Error detection including parity, checksums, and CRC.
 Gain the knowledge of the basic IP configuration used for Networking. Also clear the concept of Logical and
Physical Addressing
 Know the concepts of reliable data transfer and how TCP implements these concepts.
 Learn the principles of WAN routing and the semantics.

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Networking Fundamentals & Internet 09
2. Basics Presentation &Application Layer 07
3. Basics of Transport layer &Network, Layer 08
4. Basicsof Data Link Layer 07
5. Basics of WAN Technology 07

B. DETAILED SYLLABUS

Unit Unit Details

1. Networking Fundamentals & Internet
 Basics of Network & Networking, Types of Networks: LAN, MAN, WAN, Peer-to-Peer & Client/Server,
Workgroup V/S. Domain, Network Topologies. The Internet, Network Devices- NIC, Hub, Switch,
Bridge, Router, Gateways, Firewall, Repeater, CSU/DSU, and modem, Introduction of OSI model, and
TCP/IP Model, Comparison between OSI model & TCP/IP model. Physical Layer: Types of
Transmission Media, Communication Modes, Wiring Standards and Cabling- straight through cable,
crossover cable, rollover cable, Media connectors (Fiber optic, Coaxial, and TP etc.) Switching Methods
(Circuit/Packet Switching) Uni-cast, Multicast, Broadcast
 Conclusion &Real Life Application
2. Basics Presentation &Application Layer
 Presentation Layer protocols:-TLS, SSL, MIME
 Application Layer: Functions and support, Application Layer Protocols: DHCP, DNS, HTTP/HTTPS,
FTP, TFTP, SFTP, Telnet, Email: SMTP, POP3/IMAP, NTP.
 Conclusion &Real Life Application
3. BasicsofTransport layer &Network,Layer
 Transport Layer: Transmission Control Protocol(TCP), User Datagram Protocol (UDP), Overview of
Ports & Sockets
 Network Layer: Internet Protocol (IP), IP standards, versions, functions, The IPv4 Datagram Format,
IPv4 addressing, IPv4 address Classes, IPv4 address types, Default Gateway, Public & Private IP
Address, methods of assigning IP address, Subnet Mask and sub-neting, IPv6 address, types, assignment,
Data encapsulation, Introduction to Routing and Switching concepts.
 Conclusion &Real Life Application

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 25 of 118

 4. Basicsof Data Link Layer
 Application of Data Link Layer: Framing and Error detection and correction. Stop and Wait protocol,
Sliding Window protocols Go-Back-N Protocol, Channel allocation problem, Multiple access protocols:
ALOHA, Carrier sense multiple access protocols. Wireless Networking, Types of Wireless Networks:
Ad-hoc mode, Infrastructure mode, wireless LAN standards: IEEE 802.11a, IEEE 802.11b, IEEE
802.11g, wireless security Protocols: WEP,WPA, 802.1X.
 Conclusion &Real Life Application
5. Basics of WAN Technology
 What Is a WAN?, WAN Switching, WAN Switching techniques Circuit Switching, Packet Switching etc.,
Connecting to the Internet : PSTN, ISDN, DSL, CATV, Satellite-Based Services, Last Mile Fibre,
Cellular Technologies
 Connecting LANs: Leased Lines, SONET/SDH, Packet Switching, Remote Access: Dial-up Remote
Access, Virtual LAN, Virtual Private Networking
 Conclusion &Real Life Application

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. 1. Computer Network AndrewS. Tanenbaum 2013 Pearson

2. Computer Networking: Top Down Kurose. Ross 2017 Pearson
Approach
Reference Book
1. Networking All in One – Doug Lowe 7thedition Publisher- Wiley

Online Resources

1. https://www.edx.org/learn/computer-networking

2. https://www.youtube.com/watch?v=VwN91x5i25g

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 26 of 118

 Code:BCACCA2102 OOPs with Java 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Acquire the concepts and features of object oriented programming
 Learn java's exception handling mechanism, multithreading, packages and interfaces.
 Implement object oriented programming concepts using java
 Apply object oriented programming features and concepts for solving given problem
 Implement the concept of class and objects with access control to represent real world entities.

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Introduction to Java 08
2. Working with classes ,objects and Inheritance 09
3. Packages, Interfaces & Exception Handling 09
4. Multithreaded Programming & Applet 07
5. JAVA Database Connectivity (JDBC) and Java 8 07
Features

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to Java
 Introduction to Unit
 History and Overview of Java
 Object Oriented Programming features.
 Class Fundamentals
 Declaring objects, Assigning object reference variables.
 Literals, variables comments, separators,
 Scope and Life Time of Variables
 Data types - Integers, Floating point, characters, Boolean,
 Type conversion and casting
 Operators - Arithmetic operators, Bit wise operators, Relational Operators, Boolean Logical operators,
Assignment Operator, Operator Precedence.
 Conclusion of unit
2. Working with classes, objects and Inheritance
 Introduction to Unit
 Control Statements – Selection Statements - if, Switch, Iteration Statements - While, Do-while, for Nested
loops, Jump statements.
 Methods - constructors, ―this‖ keyword, finalize ( ) method A stack class, Over loading methods. Using
objects as parameters, Argument passing, Returning objects.
 Recursion, Access control, introducing final, understanding static.
 Introducing Nested and Inner classes.
 Command line arguments.
 Inheritance – Basics, Using super, method overriding, and Dynamic method Dispatch, Using abstract
classes and final with Inheritance.
 Conclusion of Unit
3. Packages, Interfaces & Exception Handling

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 27 of 118

  Introduction to Unit
 Definition and Implementation, Access protection importing packages.
 Interfaces: Definition and implementation.
 Exception Handling – Fundamentals, types, Using try and catch
 Multiple catch clauses
 Nested try Statements,Throw, finally.
 User Defined Exception
Conclusion of Unit
4. Multithreaded Programming & Applet
 Introduction of Unit
 Java thread model – main thread, creating single Multithreading
 Is alive ( ) and join ( ) Methods
 Thread – Priorities, Synchronization
 Inter thread communication, suspending, resuming and stopping threads
 Reading control input, writing control output, Reading and Writing files.
 Applet Fundamentals – AWT package
 AWT Event handling concepts.
 Conclusion of Unit
5. JAVA Database Connectivity (JDBC) and Java 8 Features
 Introduction to Unit
 Database connectivity – JDBC architecture and Drivers.
 JDBC API - loading a driver, connecting to a database, creating and executing JDBC statements
 Handling SQL exceptions.
 Accessing result sets: types and methods.
 JDBC application to query a database.
 Introduction to java 8 features :-Functional Interfaces And Lambda Expressions
 Conclusion of Unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. The complete reference Java –2 Herbert Schildt V TMH.
Edition,
2. SAMS teach yourself Java – 2 Rogers Cedenhead and 3rd Pearson Education
Leura Lemay Edition,
Reference Book
Object Oriented Programming with Java PUBLISHER PHI by M.T. Somashekara (Author), D.S.
1. Guru (Author), K.S. Manjunatha (Author)

2. “Head First Java‖ by Kathy Sierra

Online Resources
1. https://www.programiz.com/java-programming/online-compiler/
2. https://www.tutorialspoint.com/compile_java_online.php
3. https://onecompiler.com/java

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 28 of 118

 Code:BCACCA2103 Data Structures and Algorithms 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:

 Argue the correctness of algorithms using inductive proofs and invariants.

 Analyse worst-case running times of algorithms using asymptotic analysis.
 Analyse time complexities of various searching, sorting.
 Create various applications using stack, queue, tree and graph.
 Able to select relevant data structure to solve the problem.
A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Introduction to Data structures 8
2. Searching and Sorting 8
3. Stack and Queue 8
4. Linked List 9
5. Tree Graphs and their Applications 7

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to Data structures
 Introduction to Unit
 Definition,
 Classification of data structures: primitive and non-primitive
 Elementary data organization
 Time and space complexity of an algorithm (Examples), String processing.
 Definition of dynamic memory allocation
 Accessing the address of a variable
 Declaring and initializing pointers -
 Accessing a variable through its pointer, Meaning of static and dynamic memory allocation, Memory
allocation functions: malloc(), calloc(), free() and realloc().
 Recursion – Definition, advantages, Writing Recursive programs – Binomial coefficient, Fibonacci, GCD.
 Conclusion and Real Life Applications of unit
2. Searching and Sorting
 Introduction to Unit
 Basic Search Techniques - Sequential search, Iterative and Recursive methods, Binary search: Iterative
and Recursive methods, Comparison between sequential and binary search.
 Sorting: General background and definition-Bubble sort, Selection sort, Insertion sort, Merge sort, Quick
sort
 Conclusion and Real Life Applications of unit
3. Stack and Queue
 Introduction to Unit
 Stack – Definition
 Array representation of stack
 Operations on stack: Infix, prefix and postfix notations
 Conversion of an arithmetic expression from Infix to postfix

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 29 of 118

  Applications of stacks.
 Definition of queue
 Array representation of queue
 Types of queue: Simple queue, Circular queue, Double ended queue (deque), Priority queue,
 Operations on all types of Queues
 Conclusion and Real Life Applications of Unit
4. Linked List
 Introduction of Unit
 Definition of linked list
 Components of linked list
 Representation of linked list
 Advantages and Disadvantages of linked list
 Types of linked list: Singly linked list, doubly linked list, Circular linked list
 Operations on singly linked list: creation, insertion, deletion, search and display
 Conclusion and Real Life Applications of Unit
5. Tree Graphs and their Applications
 Introduction to Unit
 Definition : Tree
 Binary tree, Complete binary tree, Binary search tree
 Heap
 Tree terminology: Root, Node, Degree of a node and tree, Terminal nodes, Non-terminal nodes, Siblings,
Level, Edge, Path, depth, Parent node, ancestors of a node
 Binary tree: Array representation of tree, Creation of binary tree.
 Traversal of Binary Tree: Preorder, Inorder and postorder.
 Graphs
 Application of Graphs
 Depth First search, Breadth First search.
 Conclusion and Real Life Applications of Unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Schaum‘s outline series Data structures Lipschutz Latest TMH.

2. Data Structures and program designing using Robert Kruse Latest Pearson Education
‗C‘
Reference Book
1. Introduction to Data Structures in C by-Kamthane PearsonEducation2005

2. Data Structures Using C by-Bandyo Padhyay Pearson Education

Online Resources
1. https://www.gatevidyalay.com/data-structures/

2. https://www.youtube.com/watch?v=QBrDsG3MTkw

3. https://www.tutorialspoint.com/data_structures_algorithms/index.htm

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 30 of 118

 Code: BCACCA02104 Operating System 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
• Know structure and organization of the file system.
• Get concept what a process is and how processes are synchronized and scheduled.
• Acquire different approaches to memory management.
• Use system calls for managing processes, memory and the file system.
• Know the data structures and algorithms used to implement an OS.

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Operating System Overview 08

2. Process Management 08

3. Process Deadlocks 08

4. Memory Management 09

5. File Management 07

B. DETAILED SYLLABUS

Unit Unit Details

1. Operating System Overview

 Introduction of Unit
 Definition, Two views of operating system, Evolution of operating system, Types of OS.
 System Call, Handling System Calls, System Programs, Operating System Structures,
 The Shell, Open Source Operating Systems
 Conclusion of Unit
2. Process Management

 Introduction of Unit
 Process v/s Program, Multi-programming, Process Model, Process States, Process Control Block.
 Threads, Thread v/s Process, User and Kernel Space Threads.
 Inter Process Communication, Race Condition, Critical Section
 Implementing Mutual Exclusion: Mutual Exclusion with Busy Waiting
 Interrupts, Lock Variables, Strict Alteration, Peterson‘s Solution, Test and Set Lock.
 Sleep and Wake-up, Semaphore, Monitors, Message Passing.
 Classical IPC problems: Producer Consumer, Sleeping Barber, Dining Philosopher
Problem
 Process Scheduling: Goals, Batch System Scheduling (First-Come First-Served, Shortest Job First,
Shortest Remaining Time Next), Interactive System Scheduling (Round-Robin Scheduling, Priority
Scheduling, Multiple Queues), Overview of Real Time System Scheduling
 Conclusion of Unit
3. Process Deadlocks

 Introduction of Unit
 Introduction, Deadlock Characterization, Preempt able and Non-preempt able Resources
 Resource – Allocation Graph, Conditions for Deadlock.

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 31 of 118

  Handling Deadlocks: Ostrich Algorithm, Deadlock prevention, Deadlock Avoidance.
 Deadlock Detection (For Single and Multiple Resource Instances), Recovery From
 Deadlock (Through Preemption and Rollback)
 Conclusion of Unit
4. Memory Management

 Introduction of Unit
 Introduction, Monoprogramming vs. Multi-programming, Modeling Multiprogramming,
Multiprogramming with fixed and variable partitions, Relocation and Protection.
 Memory management (Bitmaps & Linked-list), Memory Allocation Strategies
 Virtual memory: Paging, Page Table, Page Table Structure, Handling Page Faults, TLB‘s
 Page Replacement Algorithms: FIFO, Second Chance, LRU, Optimal, LFU, Clock, WS- Clock, Concept
of Locality of Reference, Belady‘s Anomaly
 Segmentation: Need of Segmentation, its Drawbacks, Segmentation with Paging(MULTICS)
 Conclusion of Unit
5. File Management

 Introduction of Unit
 File Overview: File Naming, File Structure, File Types, File Access, File Attributes, File Operations,
Single Level, two Level and Hierarchical Directory Systems, File System Layout.
 Implementing Files: Contiguous allocation, Linked List Allocation, Linked List
 Allocation using Table in Memory, Inodes.
 Directory Operations, Path Names, Directory Implementation, Shared Files
 Free Space Management: Bitmaps, Linked List
 Conclusion of Unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

th
1 Operating system concepts Silberschatz, Galvin, 8
John Wiley and Sons
Gagne edition
2 Modern Operating System 2nd
A.S.Tanenbaum Pearson
Edition
Reference Books
1. Operating Systems-S Halder, Alex A Aravind Pearson Education Second Edition 2016.

Online Resources

1. https://www.coursera.org/courses?query=operating%20system

2. https://hackr.io › tutorials › learn-operating-systems

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 32 of 118

 Code:BASCCA2105 Introduction to Data Science 3 Credits [LTP: 3-0-0]

COURSE OUTCOME

Students will be able to:

 Apply the skills of data preprocessing.

 Identify the relationship between data dependencies using statistics
 Implement machine learning techniques to data science applications.
 Apply various data visualization tools to Data.
 Apply suitable tools for the real world Data Science applications

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Introduction to Data science 06

2. Describing Data 08

3. Machine Learning 08

4. Data Visualizations 07

5. Computing for Data Science 07

B. DETAILED SYLLABUS

Unit Unit Details

1 Introduction to Data science

 Introduction of Unit
 Definition of Data science
 Need for data science
 Benefits and uses
 Facets of data
Data science process
Conclusion of the unit
2 Describing Data

 Introduction of Unit
 Frequency distributions
 Outliers
 Relative frequency distributions
 Cumulative frequency distributions
 Frequency distributions for nominal data
 Interpreting distributions :graphs, averages, mode, median, mean
 Averages for qualitative and ranked data
 Describing variability : range, variance, standard deviation, degrees of freedom, interquartile range
 variability for qualitative and ranked data
Conclusion of the unit
3 Machine Learning

 Introduction of Unit
 Machine learning techniques

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 33 of 118

  Regression Pearson's r value
 Clustering
 k-means algorithm
 Classification
 Types of classification algorithms
Decision tree classification
Conclusion of the unit
4 Data Visualizations

 Introduction of Unit
 Data Visualizations
 The Big Three
 Picking the Most Appropriate Design Style
 Selecting the Appropriate Data Graphic Type
 Web-Based Applications for Visualization Design
 Designing Data Visualizations for Collaboration
Visualizing Spatial Data with Online Geographic Tools.
Conclusion of the unit
5 Computing for Data Science

 Introduction of Unit
 Using Python for Data Science
 Sorting Out the Python Data Types
 Putting Loops to Good use in Python
 Basics of Numpy arrays in Python
 Data manipulation with Pandas
 Using Open Source R for Data Science
 R‘s Basic Vocabulary
 Delving into Functions and Operators
 Doing Data Science with Excel
 Making Life Easier with Excel.
 Conclusion of the unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Introducing Data Science David Cielen, Arno D. B. Fourth Manning
Meysman, and Mohamed Ali Edition
2. Statistics Robert S. Witte and John S. Eleventh Wiley
Witte Edition
3. Python Data Science Handbook Jake Vander Plas O‘Reilly
4. Data Science for Dummies Lillian Pierson Second John Wiley & Sons
Edition publications, 2017
Reference Book
1. Think Stats: Exploratory Data Analysis in Python, Green Tea Press, Allen B. Downey.
Online Resources
1. https://www.edx.org/learn/data-science
2. https://www.udemy.com/courses/development/data-science
3. https://www.coursera.org/browse/data-science

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 34 of 118

 Practical
Code: BCACCA02201 Operating System Lab 1 Credit [LTP: 0-0-2]

Course Outcome: -
Students will be able to:
 Implement basic Scheduling algorithms and memory allocation techniques.
 Implement memory management techniques like MVT and MFT
 Implement memory allocation algorithms.
 Detect deadlocks and avoid them.
 Implement different page replacement algorithms

A. LIST OF EXPERIMENTS:

1. 1Write a C program to simulate the following non-preemptive CPU scheduling algorithms to find turnaround time
and waiting time. a) FCFS b) SJF c) Round Robin d) Priority
2. 2Write a C program to simulate the following file allocation strategies. a) Sequential b) Indexed c) Linked
3. 3Write a C program to simulate multi-level queue scheduling algorithm considering the following scenario. All the
processes in the system are divided into two categories – system processes and user processes. System processes
are to be given higher priority than user processes. Use FCFS scheduling for the processes in each queue
4. 4Write a C program to simulate the MVT and MFT memory management techniques.
5. 5Write a C program to simulate the following contiguous memory allocation techniques a) Worst-fit b) Best-fit c)
First-fit
6. 6Write a C program to simulate paging technique of memory management
7. 7Write a C program to simulate Bankers algorithm for the purpose of deadlock avoidance.
8. 8Write a C program to simulate disk scheduling algorithms a) FCFS b) SCAN c) C-SCAN
9. 9Write a C program to simulate page replacement algorithms a) FIFO b) LRU c) LFU
10. 1Write a C program to simulate page replacement algorithms
0
11. 1Write a C program to simulate producer-consumer problem using semaphores.
1
12. 1Write a C program to simulate the concept of Dining-Philosophers problem.
2

B. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Operating system concepts Silberschatz, Galvin, 8thEditio John Wiley and Sons
Gagne n
2. Modern Operating System A.S.Tanenbaum 2nd Pearson
Edition
Reference Book
1. Operating Systems-S Halder, Alex A Aravind Pearson Education Second Edition 2016.

Online Resources

1. https://www.coursera.org › courses › query=operating s...

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 35 of 118

 Code: BCACCA2202 OOPS With JAVA Lab 1 Credit[LTP: 0-0-2]

Course Outcome:-
Students will be able to:
 Implement object oriented programming concepts to solve real world problems
 Implement the concept of class and objects with access control to represent real world entities.
 Illustrate different techniques on creating and accessing packages (fully qualified name and import
statements).
 Create concepts on file streams and operations in java programming for a given application programs
 Create the backend connectivity process in java program by using JDBC drivers

A. LIST OF EXPERIMENTS:

1 A. Write a program to print ―Hello World‖ in Java.

B. Write a program to add two numbers
C. Write a program to demonstrate the different access specifiers
D. Write a program which uses different packages
2 A. Write a program to demonstrate inheritance, abstraction, encapsulation and Polymorphism.
B. Write a program to find the factorial of n numbers
C. Write a program to calculate Fibonacci series
D. Write a program to add n numbers and series
3 A. Write a program to create an array and store elements into the array.
B. Write a program to find the sum of elements in an array
C. Write a program to demonstrate switch case, if, if-else and for loop
4 A. Write a program to demonstrate the working of methods.
B. Write a program which has four methods – add(), subtract(), multiply() and divide()
and demonstrate a simple console calculator.
C. Write a program to accept command line arguments and display them to the user
5 A. Write a program to create a package.
B. Write a program to handle different exceptions
6 A.Write a program to demonstrate try-catch, throw and throws.
B. Write a program for user defined exception
7 A. Write a program to read a file
Write a program to write into a file
8 Write a program to demonstrate client server communication (socket programming)
9 Write a program to create threads and manipulate them
10 Write a program to create a user interface to check user authentication.
11 Write a program to create a registration form and save the details into a file
12 Write a program to save and fetch the details from database

B. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1 The complete reference Java –2 Herbert Schildt 5thEdition, TMH.

2 SAMS teach yourself Java – 2 Rogers Cedenhead and 3rdEdition, Pearson Education
Leura Lemay
Reference Book
1 Object Oriented Programming with Java PUBLISHER PHI by M.T. Somashekara (Author), D.S.
Guru (Author), K.S. Manjunatha (Author)

2 “Head First Java‖ by Kathy Sierra

Online Resources
1 https://www.programiz.com/java-programming/online-compiler/
2 https://www.tutorialspoint.com/compile_java_online.php
3 https://onecompiler.com/java

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 36 of 118

 Code: BCACCA2203 Data Structures and Algorithms Lab 1 Credit [LTP: 0-0-2]

COURSE OUTCOME
Students will be able to:

 Argue the correctness of algorithms using inductive proofs and invariants.

 Analyse worst-case running times of algorithms using asymptotic analysis.
 Implement various searching, sorting.
 Create various applications using stack , queue, tree and graph.
 Implement relevant data structure to solve the problem.
A. List of Programs:
1 Use a recursive function to find
a) GCD of two numbers.
b) Use a recursive function to find the Fibonacci series.
c) Factorial
d) Binomial Coefficient
2 Perform the following:
a) Insert an integer into a given position in an array.
b) Deleting an integer from an array.
3 Perform the following:
a) Write a program for linear search
b) Write a program for Binary search
c) Write a program to sort N numbers using bubble sort.
4 Perform the following:
a) Write a program to sort N numbers using insertion sort.
b) Write a program to sort N numbers using selection sort.
c) Write a program to sort N numbers using bubble sort.
5 Write a program to sort N numbers using quick sort.

6 Write a program to sort N numbers using merge sort.

7 Write a C program to create Stack using array.

8 Write a C program to create queue using array.
9 Write a program to create a linked list and to display it.

10 Inserting a node into a singly linked list on various position beginning, after given location and end.

11 Deleting a node into a singly linked list on various position beginning, after given location and end.

12 Write a C program to create stack and queue using linked list.

13 Creating a binary search tree and traversing it using in order, preorder and postorder.

14 Write a C program to implement graph.

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 37 of 118

 B. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Schaum‘s outline series Datastructures Lipschutz Latest TMH.

2. Data Structures and program designing Robert Kruse Latest Pearson Education
using‗C‘
3. Programmingin ANSI C. E. Balaguruswamy Latest TataMcGraw Hill

4. Data Structures Using C Bandyo padhyay Latest Pearson

Education,1999
5. Data Structures Using C Tenenbaum Latest PearsonEducation,20
0
6. Introduction to Data Structures in C Kamthane Latest PearsonEducation200
5

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 38 of 118

 Code:BCACCA2204 Computer Network Lab 1 Credits [LTP: 0-0-2]

COURSE OUTCOME
Students will be able to:

 Use the clamping tool for making Cross and Straight cable and identify network IP
 Create local area network and do file sharing activity
 Configure switch and routers
 Configure WEP and Ethernet.
 Recognize static and dynamic routing
A. List of Programs:

1 Study of different types of Network cables and Practically implement the cross-wired cable and straight through cable
using clamping tool

2 Study/Demonstration of Network Devices and network IP in Detail.

3 Troubleshooting Scenarios Network -I (Basic network command and Network configuration commands.
4 Connect the computers with file sharing in Local Area Network.
5 Creating LAN using different topology using Cisco Packet Tracer
6 Configure DHCP Server using Cisco PacketTracer
7 Performing an Initial Switch Configuration.
8 Performing an Initial Router Configuration
9 Configuring WEP on a Wireless Router
10 Configuring Ethernet and Serial Interfaces.

11 Observing Static and Dynamic Routing

12 Configuring Static and Default Routes.

B. RECOMMENDED STUDY MATERIAL

1. 1. Computer Network AndrewS. Tanenbaum 2013 Pearson

2. Computer Networking: Top Down Kurose. Ross 2017 Pearson
Approach
Reference Book
1. Networking All in One – Doug Lowe 7th edition Publisher- Wiley

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 39 of 118

 Code:BULCHU2201 Language Lab 1 Credits [LTP: 0-0-2]

COURSE OUTCOME
Students will be able to:

 Know the nuances of language through audio- visual experience and group activities.
 Neutralize the accent for intelligibility and develop confidence in speaking with clarity enhancing their
employability skills.
 Demonstrate an understanding of grammatical structures in conversations and discussions.
 Utilize the knowledge of confidence building strategies to manage one's own thoughts and emotions. Identify the
requirements of skills development and apply their learning to sharpen the same.

UNIT
UNIT NAME Hours
NO.
1 Introduction to Communication Skills on Learning Software 6
2 Concepts of Phonetics 4
3 Grammar Practice 6
4 Confidence Enhancement Activities 4
5 Skills Enhancement Activities 5

A. List of Programs:

1. Listening Skills
2. Reading Comprehension
3. Writing Skills
4. Phonetics I
5. Phonetics II
6. Grammar and Common Errors Usage
7. Conversation
8. Role Plays
9. Presentation Skills I
10. Presentation Skills II
11. Group Discussion
12. Interview Skills

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 40 of 118

 Code: BCACCA2601 Discipline, VAC & Social Outreach 1 Credit [LTP: 0-0-6]

COURSE OUTCOME:
The objective of Discipline and TEP is to provide students with the opportunities to enhance job fetching skills
and at the same time to cultivate the student‘s personal interests and hobbies while maintaining the good
disciplinary environment in the University. TEP is integrated into the curriculum for holistic development of
students throughactiveparticipationinvariousactivitiesfallinginTechnicalandnon-technicalcategories.

Social outreach, Discipline, TEP -II, VAC & Extra Curricular activities shall be evaluated on the basis of its sub
constituent programmes, as a complete one credit course. It shall be counted in calculation of SGPA but it is not a
backlog subject. However, the attendance of these classes shall be recorded and accounted in the total attendance.
Activities included in this category in the Second Semester are as follows:

Code Activity Hours Credits

Talent Enrichment Programme(TEP)-II 2
Library / MOOC / Online Certificate Courses 1
2
BCACCA2601
Non Syllabus Project (NSP) / Industry Visit / CRT 2

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 41 of 118

 Semester-III

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 42 of 118

 Semester III
Department Core Courses
Code:BCACCA3101 Relational Database Management System 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:

 Describe DBMS architecture, physical and logical database designs, database modeling, relational, hierarchical
and network models.
 Identify basic database storage structures and access techniques such as file organizations, indexing methods
including B‐tree, and hashing.
 Learn and apply structured query language (SQL) for database definition and database manipulation.
 Demonstrate an understanding of normalization theory and apply such knowledge to the normalization of a
database.
 Identify various transaction processing, concurrency control mechanisms and database protection mechanisms.

A. OUTLINE OF THE COURSE

Unit No. Title of the unit Time required for the Unit (Hours)
1 Introduction to Database Management System 7
2 RDBMS 7
3 SQL 7
4 PL/SQL 8
5 Oracle, Trigger and wrapping 7

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to Database Management System
 Introduction to Database Management System
 Characteristics of database approach
 Advantages of DBMS
 Schemas: Three schema architecture - The external level, the conceptual level and the internal level.
 Data Independence
 Database languages and Interfaces
 Roles of Database Administrator
 Introduction to Data Models (Hierarchical, Network and Relation)
 Entity type, Entity sets, Attributes and keys.
 The ER Model: ER Diagram & Database design with the ER Model

Conclusion of the Unit
2. RDBMS
 Introduction to Distributed Database
 Classification of DBMS
 Introduction to RDBMS
 Relational Model –Concepts
 Relational operations (Insert, delete, update, select, project, rename, union, intersection, minus, Join, division)
 Transactions and ER mapping Examples
 Normalization of RDBMS (1NF, 2NF, 3NF and 4NF) and inference rules.

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 43 of 118

  Conclusion of the Unit

3. SQL
 Introduction to Unit
 DBMS v/s RDBMS
 Introduction to SQL: Data types, Constraints
 Commands in SQL: Create table, Drop command, Alter Queries in SQL
 Statements in SQL (Insert, delete and update)
 Features of SQL
 Manipulation of data
 Tables in SQL

Conclusion of the Unit
4. PL/SQL
 Introduction to PL/SQL
 Approaches to database programming: with function calls, Embedded SQL using CURSORs, Dynamic SQL,
SQL commands in Java, Retrieving multiple triples using Iterators
 Advantages of PL/SQL
 Features of PL/SQL :Blocks structure, Error handling, Input and output designing, variables and constant, data
abstraction, control structures and subprogram
 Fundamentals of PL/SQL : character sets, lexical, delimeters, identifiers, declarations, scope and visibility,
Static and dynamic and static SQL, Implicit and explicit locking
 Conclusion of the Unit
5. Oracle, Trigger and wrapping
 Introduction to Oracle, Trigger and wrapping
 Functions/responsibilities of DBA
 Oracle product details
 Oracle files, System and User process
 Oracle Memory
 Protecting data: Oracle backup & recovery
 Triggers - types, uses, data access for triggers
 PL/SQL Packages and Wrapping
 Conclusion of the Unit

C. RECOMMENDED STUDY MATERIAL:

S. No Text Books: Author Edition Publication

Database System Concepts S. Sudarshan, Henry F. Korth, 6th
1.
McGraw Hill
Avi-Silberschatz Edition
2. SQL, PL/SQL Ivan Bayross Latest BPB
3. Oracle Complete Reference Kevin Loney Latest BPB
Reference Book

1. PL/SQL, best practices, BPB Publications, Steven Feuerstein

2. The Oracle Cook Book, BPB Publications, Liebschuty
3. Oracle A Beginners Guide, TMH Publication, Michael Abbey, Michael J.Corey

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 44 of 118

 Online Resources

1. https://www.tutorialspoint.com/sql/sql-rdbms-concepts.htm
2. https://nptel.ac.in/courses/106106093
3. https://www.coursera.org/learn/introduction-to-relational-databases

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 45 of 118

 Code:BCACCA3102 Python Programming 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Acquire the basic terminology used in computer programming to write, compile and debug programs in Python
programming language.
 Use different data types to design programs involving decisions, loops, and functions for problem solving
 Apply various object oriented programming
 Handle the exceptions which are raised during the execution of Python scripts
 Implement files and classes in the Python programming environment

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1 Introduction to Python Programming 07
2 Python Operators and Control Flow statements 09
3 Data Structures, Python Functions and Packages 09
4 Object Oriented Programming 08
5 File I/O Handling and Exception Handling 09

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to Python Programming
 Introduction to Unit
 What is Python,
 Uses of Python Programming Language / Python Applications
 Features of Python Programming Language
 Python-2 and Python-3 differences
 Python environment setup — Installation and working of IDE
 Running Simple Python scripts to display 'welcome' message.
 Python Data Types: Numbers, String, Tuples, Lists, Dictionary. Declaration and use of data types
 Python building blocks — Identifiers, Keywords, Indention, Variables, Comments
 Conclusion of unit
2. Python Operators and Control Flow statements
 Introduction to Unit
 Basic Operators: Arithmetic, Comparison/ Relational, Assignment, Logical, Bitwise, Membership,
Identity operators, Python Operator Precedence
 Control Flow:
 Conditional Statements (if, if ... else, nested if)
 Looping in python (while loop, for loop, nested loops)
 loop manipulation using continue, pass, break, else.
.Conclusion of Unit
3. Data Structures, Python Functions and Packages
 Introduction to Unit
 Lists, Tuple, Sets, Dictionaries
 String and Slicing
 Use of Python built

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 46 of 118

  User defined functions and its types
 Command-line Arguments
 Python Packages: Introduction, Writing Python packages
 Using standard packages (e.g. math, scipy, Numpy, matplotlib, pandas etc.)
 user defined packages
Conclusion of Unit
4. Object Oriented Programming
 Introduction of Unit
 Creating Classes and Objects
 Inheritance
 Method Overloading and Overriding
 Data Hiding
 Data abstraction, Abstract classes
 Types of Methods : Instance Methods , Static Methods , Class Methods
 Accessing attributes , Built-In Class Attributes
 Destroying Objects
 Conclusion of Unit
5. File I/O Handling and Exception Handling

 Introduction of Unit
 Types of File
 File Objects, File Built-in Function, File Built-in Methods
 File Built-in Attributes
 Read/write operations Reading Text
 Moving cursor in file inbuilt -functions
 Errors in Python : Compile-Time Errors ,Runtime Errors , Logical Errors
 What is Exception?
 try….except…else, try-finally clause
 Regular expressions
 Conclusion of Unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Core Python Programming Chun, JWesley 2007 Pear
son,
2. Head First Python Barry,Paul 2010 ORielly,

Reference Book

1 Learning Python Lutz, Mark O Rielly, 2009

Online Resources
1 https://www.learnpython.org/
2 https://realpython.com/start-here/
3 https://www.programiz.com/python-programming

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 47 of 118

 Code:BCACCA3103 Linux and Shell Script 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Use various Linux commands that are used to manipulate system operations at admin level and a prerequisite
to pursue job as a Network administrator.
 Write Shell Programming using Linux commands.
 Design and write application to manipulate internal kernel level Linux File System.
 Develop IPC-API‘s that can be used to control various processes for synchronization.
 Develop Network Programming that allows applications to make efficient use of resources available on
different machines in a network.

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Introduction to Linux and Linux utilities 07
2. Introduction to shells 08
3. Unix file structure 08
4. Process and signals 07
5. Inter process communication 07

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to Linux and Linux utilities
 Introduction of Unit
 INTRODUCTION TO LINUX AND LINUX UTILITIES: A brief history of LINUX, architecture of
LINUX,
 features of LINUX, introduction to vi editor.
 Linux commands- PATH, man, echo, printf, script, passwd, uname, who, date, stty, pwd, cd, mkdir,
 rmdir, ls, cp, mv, rm, cat, more, wc, lp, od, tar, gzip, file handling utilities, security by file permissions,
 process utilities, disk utilities, networking commands, unlink, du, df, mount, umount, find, unmask,
 ulimit, ps, w, finger, arp, ftp, telnet, rlogin.Text Processing utilities and backup utilities , tail, head ,
 sort, nl, uniq, grep, egrep, fgrep, cut, paste, join, tee, pg, comm, cmp, diff, tr, awk, cpio
 Conclusion of Unit
2. Introduction to shells
 Introduction of Unit
 Introduction to Shells: Linux Session, Standard Streams, Redirection, Pipes, Tee Command,
 Command Execution, Command-Line Editing, Quotes, Command Substitution, Job Control, Aliases,
 Variables, Predefined Variables, Options, Shell/Environment Customization.
 Filters: Filters and Pipes, Concatenating files, Display Beginning and End of files, Cut and Paste,
 Sorting, Translating Characters, Files with Duplicate Lines, Count Characters, Words or Lines,
 Comparing Files.
 Conclusion of Unit
3. Unix file structure
 Introduction of Unit
 Grep: Operation, grep Family, Searching for File Content.
 Sed :Scripts, Operation, Addresses, commands, Applications, grep and sed.
 UNIX FILE STRUCTURE: Introduction to UNIX file system, inode (Index Node), file descriptors,
 system calls and device drivers.
 Conclusion of Unit
4. Process and signals

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 48 of 118

  Introduction of Unit
 PROCESS AND SIGNALS: Process, process identifiers, process structure: process table, viewing
 processes, system processes, process scheduling, starting new processes: waiting for a process,
 zombie processes, orphan process, fork, vfork, exit, wait, waitpid, exec, signals functions, unreliable
 signals, interrupted system calls, kill, raise, alarm, pause, abort, system, sleep functions, signal sets.
 File locking: creating lock files, locking regions, use of read and write with locking, competing
locks,other lock commands, deadlocks.
 Conclusion of Unit
5. Inter process communication
 Introduction of Unit
 INTER PROCESS COMMUNICATION: Pipe, process pipes, the pipe call, parent and child
 processes, and named pipes: fifos, semaphores: semget, semop, semctl, message queues: msgget,
 msgsnd, msgrcv, msgctl, shared memory: shmget, shmat, shmdt, shmctl, ipc status commands.
 INTRODUCTION TO SOCKETS: Socket, socket connections - socket attributes, socket addresses,
 socket, connect, bind, listen, accept, socket communications.
 Awk and perl Programming: Awk pattern scanning and processing language, BEGIN and END patterns,
Awk arithmetic and variables, Awk built in variable names and operators, arrays, strings,
 functions, perl; the chop() function, variable and operators, $_ and $. , Lists, arrays, regular expression
and substitution, file handling, subroutines, formatted printing.
 Conclusion of Unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

Advanced Programming in the UNIX 3rd
1. W. Richard. Stevens Pearson Education
Environment edition
Stephen Kochan, Patrick
2. Unix and shell Programming Latest Sams
Wood

Reference Book
1. Linux System Programming, Robert Love, O’Reilly, SPD.

Advanced Programming in the UNIX environment, 2nd Edition, W.R.Stevens, Pearson

2.
Education.
UNIX Network Programming, W.R. Stevens, PHI.
3.
UNIX for Programmers and Users, 3rd Edition, Graham Glass, King Ables, Pearson Education

Online Resources

1. https://www.tutorialspoint.com/unix/shell_scripting.htm

2. https://www.javatpoint.com/shell-scripting-tutorial

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 49 of 118

 Code:BASCCA3104 Introduction to RPA Tools 3 Credits [LTP: 3-0-0]

COURSEOUTCOME:

Students will be able to:

 Record, Play and Installing UiPath studio
 Apply various data manipulation on different file format
 Implement User Interface Components in UiPath
 Implement codes in Reinforcement Learning
 Apply in real world applications

A. OUTLINEOFTHECOURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1 Robotic Process Automation Concepts 07
2 Sequence and Data Manipulation 08
3 Overview of UiPath 07
4 Control Flow Activities and Selectors 07
5 Automation 07

B. DETAILEDSYLLABUS

Unit Unit Details

1. Robotic Process Automation Concepts

 Introduction to unit
 Introduction to RPA: Scopes and techniques of RPA, About UiPath, The future of automation
 Record and Play: Record and Play, UiPath stack, Installing and Learning UiPath studio, Task recorder
 Conclusion of unit

2. Sequence and Data Manipulation

 Introduction to unit
 Sequence: Sequence, Flowchart and Control Flow, sequencing the workflow, control flow, various types of loops
and decision making, step by step example using sequence, Flowchart and Control Flow.
 Data Manipulation: Variables and scope, Collections, Arguments, Collections, Clipboard management, File
operation, CSV/Excel to data table and vice versa
 Conclusion of unit.
3. Overview of UiPath

 Introduction of unit
 User Interface Components: Ribbon, Toolbars Access, Library panel, project panel, Outline panel, locals panel,
Debugging, Recording, Workflow execution, context menu, properties panel, Designer panel, Universal search bar.
 Workflow Design and UiPath Studio: Layout diagrams, Type of Decisions, switch activity, Flow Decision, Flow
switch, Naming conventions, managing variables in studio, types of variables, Managing arguments, Argument
panel, Types of recording, Automatic recording, Basic, web and desktop automatic recording, Manual recording,
Data scraping, Screen scrapping and its methods
 Conclusion of unit
4. Control Flow Activities and Selectors

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 50 of 118

  Introduction of unit
 Control Flow Activities and Selectors: Assign activity, Delay activity, While activity, Do while activity, If activity,
Switch activity, For each activity and Break activity.
 Selectors and input/output methods: Simple selectors, Generation of Dynamic selectors, passing the variables in
selectors, Input methods, Output methods, Full text, Native, OCR.
 Conclusion of unit
5. Automation

 Introduction of unit
 Excel and PDF Automation: Reading and working with rows of excel, Looping with excel, Working with PDF and
excel files, retrieving data from web.
 Email Automation: Outlook Email activity, Get IMAP mail activity, Get POP3 mail message, get exchange mail
activity, sending and receiving mail messages.
 Orchestrator: Dashboard, Robots, Processes, Jobs, Queues, Schedules, Transaction
 Conclusion of unit

C. RECOMMENDED STUDYMATERIAL:

S. No Text Books: Author Edition Publication

1. Learning Robotic Process Automation with Alok Mani Tripathi Latest Packt
UiPath
Intelligent Control: A stochastic
2. optimization approach by Kaushik Amitava Chatterjee,
Latest Springer edition
Anjan Rakshit
Das Sharma

Reference Book
1.
―Robotic Process Automation- Guide to building robots‖ by Richard Murdoch
2. ―Robotic Process Automation and Risk Mitigation: The Definitive Guide‖ by Mary C. Lacity and Dr. Leslie P.
Willcocks
3. ―Introduction to robotic process Automation‖ by Frank Casale

Online Resources

1. https://www.uipath.com/

2. https://www.udemy.com/course/robotic-process-automation/

3. https://www.coursera.org/specializations/roboticprocessautomation

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 51 of 118

 Practical
Code:BCACCA3201 Relational Database Management System Lab 1 Credits [LTP: 0-0-2]

COURSE OUTCOME
Students will be able to:
 Effectively explain the underlying concepts of database technologies.
 Design and implement a database schema for a given problem-domain.
 Populate and query a database using SQL DML/DDL commands.
 Declare and enforce integrity constraints on a database using a state-of-the-art RDBMS.
 Programming PL/SQL including stored procedures, stored functions, cursors, packages

A. LIST OF EXPERIMENTS:

1 To setup and removal phases of a Student database using the basic Data Definition Language
(DDL) commands:
1. CREATE
2. ALTER
3. DROP
4. RENAME
5. TRUNCATE
2 The routine operation of the Employee database like retrieve, insert and modify by basic Data
Manipulation Language (DML) commands:
1. INSERT
2. UPDATE
3. DELETE
3 To Retrieve data from one or more tables using DATA RETRIEVAL LANGUAGE (DRL)
commands
 SELECT FROM
 SELECT - FROM –WHERE
 SELECT - FROM -GROUP BY
 SELECT - FROM -ORDER BY
 JOIN using SELECT - FROM - ORDER BY
 JOIN using SELECT - FROM - GROUP BY
 UNION
 INTERSET
 MINUS
4 DATA CONTROL LANGUAGE (DCL) and TRANSATIONAL CONTROL LANGUAGE (TCL)
commands.
i. Creating objects: tables, views, users, sequences, Collections etc.
ii. Privilege management through the Grant and Revoke commands
iii. Transaction processing using Commit and Rollback
iv. Save points.
5 Queries for following functions
i. Conversion functions (to_char, to_number and to_date)
ii. string functions (Concatenation, lpad, rpad, ltrim, rtrim, lower, upper, initcap, length,
substr and instr),
iii. date functions (Sysdate, next_day, add_months, last_day, months_between, least,
greatest, trunc, round, to_char, to_date)
6 Simple queries: selection, projection, sorting on a simple table for employee database
i. Small-large number of attributes
ii. Distinct output values
iii. Renaming attributes
iv. Computed attributes
v. Simple-complex conditions (AND, OR, NOT)
vi. Partial Matching operators (LIKE, %, _, *, ?)
vii. ASC-DESC ordering combinations
viii. Checking for Nulls

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 52 of 118

 7 To manipulate data items and returning the results using Group functions or Aggregate functions
and Single Row or scalar functions:
i. Group functions or Aggregate functions: Sum(), Avg(), Min(), Max() and Count()
ii. Single Row or scalar function:Abs(), Power(), Sqrt(), Round(), Exp(), Greastest(),
Least(), Mod(), Floor(), Sign() and Log().
8 Multi-table queries(JOIN OPERATIONS)
i. Simple joins (no INNER JOIN)
ii. Aliasing tables – Full/Partial name qualification
iii. Inner-joins (two and more (different) tables)
iv. Inner-recursive-joins (joining to itself)
v. Outer-joins (restrictions as part of the WHERE and ON clauses)
vi. Using where & having clauses
9 Write Nested queries to retrieve the name of each employee who has a dependent with the same
first name and same sex as the employee using following Nested queries.
i. In, Not In
ii. Exists, Not Exists
iii. Dynamic relations (as part of SELECT, FROM, and WHERE clauses)
10 Write a query to make a list of all project numbers for projects that involve an employee whose last
name is ‗Smith‘, either as a worker or as a manager of the department that controls the project using
the following Set Oriented Operations
i. Union
ii. Difference
iii. Intersection
iv. Division
11 PL/SQL Programming using the following
i. Programs using named and unnamed blocks
ii. Programs using Cursors, Cursor loops and records
12 PL/SQL Programming using
i. Creating stored procedures, functions and packages
ii. Error handling and Exception
iii. Triggers and auditing triggers

B. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1 Database System Concepts S. Sudarshan, Henry F. 6th McGraw Hill
Korth, AviSilberschatz Edition
2 SQL, PL/SQL Ivan Bayross Latest Bpb
3 Oracle Complete Reference Kevin Loney Latest Bpb

Reference Book

1 PL/SQL-Best practices,BPB Publications, Steven Feuerstein

2 The Oracle Cook Book,BPB Publications, Liebschuty

Online Resources

1 https://www.tutorialspoint.com/sql/sql-rdbms-concepts.htm
2 https://nptel.ac.in/courses/106106093
3 https://www.coursera.org/learn/introduction-to-relational-databases

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 53 of 118

 Code:BCACCA3202 Python Programming Lab 1 Credits [LTP: 0-0-2]

COURSE OUTCOME
Students will be able to:
 Write Python code, develop medium-difficulty applications in Python
 Implement Python programs with conditionals and loops
 Apply the concept of List and Dictionary.
 Implement Read and write data from/to files in Python
 Develop Python programs step-wise by defining functions

A. LIST OF EXPERIMENTS:

1 Write a python program to compute the GCD and LCM of two numbers.
2 Write python program to perform following operations on Lists:
a) Create list
b) Access list
c) Update list (Add item, Remove item)
d) Delete list
3 Write a Python program to remove the ―i‖ th occurrence of the given word in a list where words
repeat
4 Write a Python program to count the frequency of words appearing in a string using a dictionary.
5 Write Python program to create a dictionary with key as first character and value as words starting
With that character.
6 Write a Python program to check if a substring is present in a given string.
7 Write a Python program to find the intersection and union of two lists.
8 Write a Python program to find the length of a list using recursion.
9 Writer a Python program to read a file and capitalize the first letter of every word in the file.
10 Write a Python program to read the contents of a file in reverse order
11 Write a python program to create a package (Engg), sub -package( years),modules (sem) and create
staff and student function to module
12 Write a python program to read 3 subject marks and display pass or failed using class and object

B. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1 Core Python Programming Chun, JWesley 2007 Pearson,
2 Head First Python Barry,Paul 2010 ORielly,

Reference Book

1 Learning Python Lutz, Mark, O Rielly, 2009

Online Resources

1 https://www.learnpython.org/
2 https://realpython.com/start-here/

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 54 of 118

 Code:BCACCA3203 Linux and Shell Script Lab 1 Credits [LTP: 0-0-2]

COURSE OUTCOME
Students will be able to:
 Use shell script to create files and handle text documents
 Create child processes, background process and zombies
 Familiarize basic concepts of shell programming
 Demonstrate use of system calls
 Demonstrate Inter process communication

A. LIST OF EXPERIMENTS:

1 Study and Practice on various commands like man, passwd, tty, script, clear, date, cal, cp, mv,ln, rm,
unlink, mkdir, rmdir, du, df, mount, umount, find, unmask, ulimit, ps, who, w.
2 Study and Practice on various commands like cat, tail, head , sort, nl, uniq, grep, egrep,fgrep,cut, paste,
join, tee, pg, comm, cmp, diff, tr, awk, tar, cpio.
3 a) Write a Shell Program to print all .txt files and .c files.
b) Write a Shell program to move a set of files to a specified directory.
4 c) Write a Shell program to display all the users who are currently logged in after a specified time.
d) Write a Shell Program to wish the user based on the login time.
5 a) Simulate cat command. b) Simulate cpcommand.
6 a) Simulate head command. b) Simulate tail command.
7 a) Simulate mv command. b) Simulate nlcommand.
8 Write a program to handle the signals like SIGINT, SIGQUIT, SIGFPE.
9 Implement the following IPC forms
a) FIFO b) PIPE
10 Implement message queue form of IPC.
11 Implement shared memory form of IPC.
12 Write a Socket program to print system date and time (Using TCP/IP).

B. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. UNIX Shell Scripting Randal Michael 2003 Wiley

2. Bash Cookbook Carl Albing, JP 2017 O‘Reilly

Vossen
3. Linux Command Line and Shell Scripting Richard 2015 Wiley
Bible Blum , Christine
Bresnahan
Reference Book
1. Linux Command Line and Shell Scripting Bible 4th Edition by Richard Blum

Online Resources

1. https://www.tutorialspoint.com/unix/shell_scripting.htm

2. https://www.javatpoint.com/shell-scripting-tutorial

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 55 of 118

 Code:BASCCA3204 Introduction to RPA Tools Lab 1 Credits [LTP: 0-0-2]

COURSE OUTCOME
Students will be able to:
 Implement sequence using activity in UiPath Studio
 Implement the screen scrapping using UiPath Studio
 Implement data manipulation on various file format
 Design automation techniques on various file formats and email
 Apply real world application through automation.

A. LIST OF EXPERIMENTS:

1 Install UiPath Studio and record a task

2 Implement sequence in UiPath Studio

3 Implement flowchart in UiPath Studio

4 Implement sequence using the Assign activity, Do While activity, Delay activity, If activity

5 Implement sequence using the Switch activity, While activity, For Each activity, Break activity

6 Generate dynamic selector and pass the variables in selectors

7 Implement and run example of screen scrapping through UiPath Studio

8 Manipulate a set of data using UiPath Studio / Excel

9 Set up and automate Excel and PDF through UiPath Studio

10 Set up and automate Email using UiPath Studio

11 Enable and implement text based automation using UiPath Studio

12 Organize a process through orchestration using UiPath Studio

B. RECOMMENDED STUDY MATERIAL:

S. No Text Books: Author Edition Publication

Robotic Process Automation- Guide 1st
1. Richard Murdoch
to building robot
Robotic Process Automation and Mary C. Lacity and
2. SB Publishing, 2017
Risk Mitigation: The Definitive Guide Dr.Leslie P. Willcocks
3. Introduction to robotic process automation Frank Casale Institute for Robotic
Process Automation,
2015
Reference Book
1. ―Learning Robotic Process Automation with UiPath‖ by Alok Mani Tripathi, Packt

2. ―The Robotic Process Automation Handbook: A Guide to Implementing RPA Systems‖ by Tom Taulli,
Apress, 2020

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 56 of 118

 Online Resources

1. https://www.uipath.com/

2. https://www.udemy.com/course/robotic-process-automation/

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 57 of 118

 Departmental Elective
Code:BCAECA3111 Digital Marketing 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Analyze Digital Marketing, its scope, objectives, opportunities and it challenges To help students develop create
toward the commands of file system.
 Develop and create toward Digital Strategy building & its effectiveness.
 Know alternatives for Dynamic organization to ensure their success in highly competitive sale environment and to
analyze the concept of Internet marketing and its application.
 Analyze the digital tools effectively for Social Media Marketing
 Develop an understanding toward E-mail marketing and its various application

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1 An overview of Digital Marketing 08
2 Digital Marketing Planning and Structure 07
3 Internet Marketing 08
4 Social Media Marketing 07
5 E-mail marketing and Applications 07

B. DETAILED SYLLABUS

Unit Unit Details

1. An overview of Digital Marketing
 Introduction to Digital Marketing
 Different Ways to Market Your Business Online
 Evaluation of Digital Marketing
 Status of Digital Marketing in India
 How Digital Marketing Works
 Traditional vs. Digital Marketing
 New Trends for Online Marketers
 Digital Marketing Strategies
 Impact of Digital Marketing on Business
 Benefits of Digital Marketing
 Drawbacks of Digital Marketing
 Internet Marketing in India – Challenges
 Conclusion of Unit

2. Digital Marketing Planning and Structure

 Creating initial digital marketing plan
 Target group analysis, In bound vs Outbound Marketing,
 Content Marketing, Understanding Traffic, Understanding Leads
 Strategic Flow for Marketing Activities.
 WWW, Domains, Buying a Domain, Website Language & Technology, Core Objective of Website and
Flow
 One Page Website, Strategic Design of Home Page, Optimization of Web sites,

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 58 of 118

  Application of Word Press in Digital Marketing, Application of CSS, HTML & Java Script for web page
design
 Conclusion of Unit
3. Internet Marketing
 Introduction of Unit
 Marketing and Internet
 Market place to Marketspace
 Online buyer behavior, suppliers, Intermediaries Websites
 Types of Websites, Web portals like: B2B, B2C,C2B,C2C, B2E(Business to Employee)
 Social Networking
 The promise and challenges of online marketing
 The Indian Internet Marketing Mix.
 Significance of Internet marketing.
 Traditional vs. Online Marketing
 Conclusion of Unit
4. Social media Marketing
 Introduction of Social Media Marketing
 How Social media marketing works
 Different components or Tools for Social Media Marketing
 Facebook Marketing, Google Ad Words
 YouTube Marketing, Content Marketing
 Meme marketing, Affiliate Marketing
 LinkedIn, Twitter, Instagram
 Keywords with SEO marketing- On page Search Engine Optimisation, Off page SEO, why search
 Engine marketing.
 SEM and its application, Benefits of SEM
 Blogging as a marketing strategy, Types of Blogs, What is Blogging? Benefits of Blogging. Pitfalls of
Blogging.
 Conclusion of Unit
5. E-mail Marketing and Applications

 Introduction of E-mail marketing

 E-mail Marketing - What is it? Why do it and How?
 Types of E-mail Marketing
 Comparison to Traditional Mail
 Opt-in E-mail Advertising
 How to deal with Spam Filter
 Choosing your metrics
 Tracking Landing Pages
 Topl0 Benefits of E-mail Marketing
 E-mail-Marketing Strategy Checklist
 Effective E-mail Marketing Techniques
 Conclusion of Unit

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 59 of 118

 C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

th
1. Digital Marketing Dave Chaffey 7 Pearson
Marketing 4.0: Moving from Traditional to Philip Kotler
2. Latest Pearson
Digital Hardcover

Reference Book
Digital Marketing, Dave Chaffey/Fiona Ellis, Pearson
1
Social Media Marketing All-In-One
2 For Dummies, JanZimmerman and Deborah
3 Digital Marketing Strategy, Simon Kingsnorth, KoganPage

Online Resources
1 https://ejournal.lucp.net/index.php/ijrtbt/article/view/191
2 https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3638929
3 https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3308684

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 60 of 118

 Code: BCAECA3112 Software Engineering 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Gather and specify requirements of the software projects.
 Analyze software requirements with existing tools.
 Differentiate different testing methodologies.
 Apply the basic project management practices in real life projects.
 Work in a team as well as independently on software projects

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1 Software Process Models 8
2 Software Design 8
3 Introduction to Software Testing 10
4 Software Quality Management 8
5 Software Project Management 8

B. DETAILED SYLLABUS

Unit Unit Details

1. Software Process Models
 Introduction to Unit
 How to develop software?
 Different models - Water fall model – Prototyping – evolutionary model- Spiral model– RAD model -
Agile models: Extreme Programming, and Scrum-pros and cons of each model
 Requirements Analysis-Functional and Non-functional requirements,
 Software Requirement Specification(SRS)–Decision tables–DecisionTrees
 Conclusion of the Unit
2. Software Design
 Introduction to Unit
 Overview of design process: High-level and detailed design
 Cohesion and Coupling Design Methodologies
 Function–Oriented software design: Structured Analysis using DFD Structured Design using Structure
 Architectural Design, Interface design, Component Leve ldesign
 Software Reuse and Software Maintenance issues
 Conclusion of the Unit
3. Introduction to Software Testing
 Coding, Code Review, documentation.
 Testing: - Unit testing, Black-box Testing, White-box testing,
 Cyclomatic complexity measure, coverage analysis, mutation testing,
 Debugging techniques, Integration testing, System testing,
 Regression testing.
 Conclusion of theUnit
4. Software Quality Management
 Introduction to Unit
 Overview of SQA Planning
 Software configuration management

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 61 of 118

  Study of ISO9000 &CMM
 Software reverse engineering
 Software reengineering
 Conclusion of the Unit
5. Software Project Management

 Introduction toUnit
 Various phases of Project Management –Planning– Organizing– Staffing– Directing and Controlling,
Metrics for project size estimation
 Software Project Cost Estimation–COCOMO models
 Software Project Scheduling
 CASEtools:CASEdefinitions–CASEClassifications–AnalysisandDesignWorkbenches,Testing
Workbenches
 Conclusion of the Unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Fundamentals of Software Engineering, RajibMall PHI 2018

2. Software Engineering I.Sommerville Pearson Education Asia

Reference Book

1 Software engineering, Roger SPressman

2 An Integrated Approach to Software Engineering, Pankaj Jalote

Online Resources
1 https://www.javatpoint.com/software-engineering-tutorial
2 https://www.geeksforgeeks.org/software-engineering/
3 https://www.tutorialandexample.com/software-engineering-tutorial

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 62 of 118

 Code:BCAECA3113 Management Information System 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Describe the major technological, organizational, behavioral, and ethical issues facing today‘s information
systems professional.
 Describe IT strategy formulation and explain its alignment with organizational strategy.
 Conduct research on and describe, several current and emerging technologies and explain their impact on
corporate performance.
 Explain the difference between supporting a business with technology and driving a business with technology.
 Describe ways in which technology can provide an organization with competitive advantages

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1 Introduction to MIS 07
2 Information and Managerial Effectiveness 08
3 Information Systems 08
4 Information System for Functional Areas and Issues 07
5 New Trends in MIS 07

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to MIS
 Introduction to unit
 Concept, evolution and meaning of MIS;
 Information system for competitive advantage;
 Systems approach to problem solving;
 Challenges in the development of MIS
 MIS function in an organization.
 Conclusion of Unit
2. Information and Managerial Effectiveness
 Introduction of Unit
 Information and Managerial Effectiveness, Information as a corporate resource,
 pervasiveness of information, types of information – operational, tactical and strategic;
 Levels of management and information needs of management; Process of generation of information;
 Quality of information; information systems for finance, marketing, manufacturing,
 research and development and human resource areas.
 Conclusion of Unit
3. Information Systems
 Introduction of Unit
 Information Systems – Information systems and their role in Business systems,
 changing role of information systems, users of information systems;
 Types of information systems – transaction processing systems,
 MIS decision support systems, executive support system;
 Enterprise Resource Planning (ERP) system,
 Business expert system.
 Conclusion of Unit
4. Information System for Functional Areas and Issues
 Introduction of Unit

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 63 of 118

  Information System for Functional Areas – Information for Financial – Marketing Inventory Control –
Production and HR Functions,
 Security Issues Relating to Information Systems,
 threats to information systems, Vulnerability, risk and control measures.
 Conclusion of Unit
5. New Trends in MIS

 Introduction of Unit
 Cloud computing, Big data, CRM technology for Business,
 Data ware housing and artificial intelligence,
 Near field Communication, Super Beam (Only concepts)
 Conclusion of Unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

―Management Information Systems: Second
1. D P Goyal Macmillan
Managerial Perspectives‖ Edition
―Management Information System: Conceptual Gordon Davis and Fourth
2. Pearson
Foundations – Structure and Development‖ Margrethe Olson Edition
3. ―Management Information Systems: Second
D P Goyal Macmillan
Managerial Perspectives‖ Edition

Reference Book

Management Information Systems DANTES/DSST Test Study Guide, Breely Crush Publishing, kindle
1
edition.
Management Information Systems
Author(s):Jawadekar, W. S. Edition: 2nd edition Publisher: Tata McGraw Hill (TMH)
2

Online Resources

1 https://www.coursera.org› courses
2 https://www.tutorialspoint.com› mis_tutorial
3 https://www.javatpoint.com/mis

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 64 of 118

 Code:BULCHU3201 Communication Skill-1 1 Credits [LTP: 2-0-0]

COURSE OUTCOME
Students will be able to:
 Demonstrate depth of understanding, observing complexity, improve insight and develop independent thought and
persuasiveness
 Determine the main ideas of the text by using key details and compare & contrast the most important points with
the help of their perspective
 Practice the qualities of writing style by applying the concepts of sentence conciseness, accuracy, readability,
coherence and by avoiding wordiness or ambiguity.
 Distinguish words and phrases as per their intonation patterns and interpret the audios based on different situations
 Demonstrate the understanding of impactful conversational skills, presentation skills & telephonic conversation
by considering the need of the audience

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1 Intrapersonal/Interpersonal Skills 6
2 Reading Skills 4
3 Writing Skills 6
4 Listening Skills 4
5 Speaking Skills 5

LIST OF ACTIVITIES
1. Self – Awareness & Self-Introduction
2. Goal Setting: Ambition induced, interest induced or environment conditioned
3. Cultivating Conversational Skills
4. Role Plays : Selection of varied plots, characters & settings
5. Reading skills I: Newspaper Reading & General Article Reading
6. Writing Skills I: Story Making by jumbled words
7. Understanding and Applying Vocabulary
8. Listening Skills I: Types and practice by analyzing situational listening
9. Speaking Skills I: JAM
10. PowerPoint Presentation Skills-I
11. Telephonic Etiquettes and Communication
12. Recognizing, understanding and applying communication style (Verbal/Non-Verbal)

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 65 of 118

 Code: BCACCA3601 Discipline, VAC, Social Oureach 1 Credit [LTP: 0-0-6]

COURSE OUTCOME:
The objective of Discipline and TEP is to provide students with the opportunities to enhance job fetching skills
and at the same time to cultivate the student‘s personal interests and hobbies while maintaining the good
disciplinary environment in the University. TEP is integrated into the curriculum for holistic development of
students throughactiveparticipationinvariousactivitiesfallinginTechnicalandnon-technicalcategories.

Social outreach, Discipline, TEP -III, VAC & Extra Curricular activities shall be evaluated on the basis of its sub
constituent programmes, as a complete one credit course. It shall be counted in calculation of SGPA but it is not a
backlog subject. However, the attendance of these classes shall be recorded and accounted in the total attendance.
Activities included in this category in the Third Semester are as follows:
:

Code Activity Hours Credits

Talent Enrichment Programme(TEP)-III 2
Library / MOOC / Online Certificate Courses 1
2
BCACCA3601
Non Syllabus Project (NSP) / Industry Visit / CRT 2

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 66 of 118

 Semester-IV

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 67 of 118

 Semester IV
Department Core Courses
Code: BCACCA4101 Big Data Analysis 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Provide HDFS Concepts and Interfacing with HDFS
 Access and Process Data on Distributed File System
 Manage Job Execution in Hadoop Environment
 Recognize the components of Hadoop and Hadoop Eco-System
 Apply Machine Learning Techniques using R
.
A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Introduction to Big Data And Hadoop 07
2. HDFS(Hadoop Distributed File System) 08
3. Map Reduce 08
4. Hadoop Eco System 07
5. Introduction to Big Data and Hadoop 07

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to Big Data
 Introduction of Unit
 Introduction to Big Data ,Big Data Characteristics
 Types of Digital Data, Introduction to Big Data, Big Data Analytics,
 Relationships and Representations, Graph Databases.
 History of Hadoop, Apache Hadoop, Analysing Data with Unix tools,
 Analysing Data with Hadoop, Hadoop Streaming,
 Hadoop Echo System, IBM Big Data Strategy, Introduction to Infosphere BigInsights and Big Sheets.
Conclusion of Unit
2. HDFS(Hadoop Distributed File System)
 Introduction of Unit
 The Design of HDFS, HDFS Concepts, Command Line Interface,
 Hadoop file system interfaces, Data flow,
 Data Ingest with Flume and Scoop and Hadoop archives,
 Hadoop I/O: Compression, Serialization, Avro and File-Based Data structures
Conclusion of Unit
3. Map Reduce
 Introduction of Unit
 Anatomy of a Map Reduce Job Run, Failures,
 Job Scheduling, Shuffle and Sort,
Task Execution, Map Reduce Types and Formats, Map Reduce Features.
Conclusion of Unit
4. Hadoop Eco System

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 68 of 118

  Introduction of Unit
 Pig : Introduction to PIG, Execution Modes of Pig,
 Comparison of Pig with Databases, Grunt, Pig Latin,
 User Defined Functions, Data Processing operators. Hive : Hive Shell,
 Hive Services, Hive Metastore, Comparison with Traditional Databases,
 HiveQL, Tables, Querying Data and User Defined Functions. Hbase:HBasics, Concepts, Clients,
Example, Hbase V/S RDBMS.
 Big SQL : Introduction
 Conclusion of Unit
5. Data Analytics with R
 Introduction of Unit
 Machine Learning : Introduction, Supervised Learning,
 Unsupervised Learning, Collaborative Filtering.
 Big Data Analytics with BigR.
 Conclusion of Unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Hadoop: The Definitive Guide Tom White Third O‘reily
Editon
2. Big Data Analytics Seema Acharya, 2015 Wiley
Subhasini Chellappan
Reference Book
1. Michael Berthold, David J. Hand, "Intelligent Data Analysis‖, Springer, 2007.

2. Jay Liebowitz, ―Big Data and Business Analytics‖ Auerbach Publications, CRC press (2013)

3. Tom Plunkett, Mark Hornick, ―Using R to Unlock the Value of Big Data: Big Data Analytics with Oracle R

Online Resources

1. http://www.bdbanalytics.ir/media/1121/big-data-analytics_turning-big-data-into-big-money.pdf
2. https://www.techtarget.com/searchbusinessanalytics/definition/big-data-analytics
3. https://www.tutorialspoint.com/hadoop/hadoop_big_data_overview.htm

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 69 of 118

 Code: BCACCA4102 Design and Analysis of Algorithm 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Apply Divide and conquer. Greedy algorithm design techniques.
 Know the dynamic programming concept with solving real word problem
 Work on Pattern matching algorithms.
 Apply randomize algorithms
 Wok for different class of algorithms and difference between them.
.
A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Introduction 06
2. Dynamic Programming, Branch and Bound 06
3. Pattern Matching and Assignment Problem 08
4. Randomized Algorithm 08
5. NP-Hard and NP-Complete Problem 08

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction
 Introduction to Unit
 Algorithm Specification, Algorithm Complexity and Order Notations.
 Divide and Conquer Method: General Method , Binary Search, Merge Sort, Quick sort and stresses‘
matrix multiplication algorithm.
 Greedy Method: General method, Knapsack Problem, Job Sequencing, Optimal Merge Patterns and
Minimal Spaning Tree, Krushkal Algorithm, Prims Algorithm
 Conclusion of Unit
2. Dynamic Programming, Branch and Bound
 Introduction to Unit
 Dynamic Programming: Matrix Chain Multiplication,Longest Common subsequence
 Subseuenceand0/1KnapsackProblem,Allpairs shortest path, Flow shop scheduling
 Branch And Bound: Traveling Salesman Problem, Bounding, FIFO Branch and Bound,
 Backtracking:The8-queensproblem,Hamiltonian cycles Comparison between Dynamic, Backtracking and
Branch Bound
 Conclusion of Unit
3. Pattern Matching and Assignment Problem
 Introduction toUnit
 Pattern Matching Algorithms: Naïve and Rabin Karp string matching algorithms, KMP Matcher and
Boyer Moore Algorithms.
 Assignment Problems: Formulation of Assignment and Quadratic assignment Problem.
 Conclusion of Unit.
4. Randomized Algorithm
 Introduction of Unit.
 ProbabilisticAnalysis&RandomizedAlgorithms:LasVegas algorithm,MonteCarlo algorithms for Min-Cut,
randomized algorithm for 2- SAT.
 Problem definition of Multicommodity flow, Flow shop scheduling and Network capacity

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 70 of 118

  Assignment problems.
 Conclusion of Unit
5. NP-Hard and NP-Complete Problem
 Introduction of Unit.
 Definitions of P, NP-Hard and NP-Complete Problems. Decision Problems. Proving NP- Complete
Problems - Satisfiability problem and Vertex Cover Problem.
 Approximation Algorithms for Vertex Cover and Set Cover Problem
 Conclusion of Unit

C. RECOMMENDED STUDY MATERIAL

Editio
S. No Text Books: Author Publication
n
1. Fundamentals of Computer Algorithms E.Horowitz & S.Sahani Latest Galgotia Publications

2. Introduction to Algorithms Corman, Leiserson & Rivest Latest MIT Press

3 Algorithm Analysis & Design Goodrich, Tamassia Latest Wiley

4. Introduction To The Design & Anany Levitin Latest Pearson Education

Analysis of Algorithm

Reference Book
1. The Algorithm Design Manual by Steve S. Skiena

2. Algorithms by Robert Sedgewick & Kevin Wayne

Online Resources

1. http://openclassroom.stanford.edu/MainFolder/CoursePage.php?course=IntroToAlgorithms
2. http://courses.csail.mit.edu/6.006/spring11/notes.shtml

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 71 of 118

 Code: BASCCA4103 Machine Learning 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Implement reinforcement learning in various applications
 Apply regression methods for prediction
 Solve problems related to classification and clustering using machine learning algorithms
 Apply the performance metrics on machine learning algorithms
 Apply machine learning algorithms to solve the real world application
.
A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Introduction to Machine Learning 07
2. Regression 08
3. Classification 08
4. Clustering 07
5. Performance Metrics 07

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to Machine Learning

 Introduction to Machine Learning

 Definition of Machine Learning
 Working principles of Machine Learning
 Classification of Machine Learning : Supervised Learning, Unsupervised Learning, Reinforcement
Learning
 Supervised Learning: Classification and Regression
 Unsupervised Learning: Clustering and Association
 Reinforcement Learning
 Types of Reinforcement learning : Positive Reinforcement and Negative Reinforcement
 Application of Reinforcement Learning
 Conclusion of Unit
2. Regression

 Introduction to Regression
 Types of Regression: Linear regression and Logistics regression
 Regression and Correlation
 Crosstabs and Scatter plots
 Pearson‘s r
 Regression – Finding The line
 Regression – Describing the line
 Contingency Tables
 Conclusion of Unit
3. Classification

 Introduction of classification
 Classification model building
 Types of Classification Algorithm: Binary Classification and Multi Class Classification

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 72 of 118

  Decision Trees
 Support Vector Machine
 Naïve bayes
 Conclusion of Unit
4. Clustering
 Introduction of clustering
 Clustering Workflow
 Types of Clustering: Centroid-based clustering, Density-based clustering, Distribution-based Clustering
and Hierarchical clustering
 K- means Clustering
 Fuzzy C Means Algorithm – FANNY (Fuzzy Analysis Clustering)
 Gaussian Mixed Models (GMM) with Expectation-Maximization Clustering
 Conclusion of Unit
5. Performance Metrics

 Introduction of Performance metrics

 Performance metrics for Regression : Mean Absolute Error (MAE), Mean Squared Error (MSE), Root
Mean Squared Error (RMSE), R-Squared, Adjusted R-squared
 Performance metrics for classification: Accuracy, Confusion Matrix, Precision, Recall, F1 score, ROC
AUC, Kappa, MCC (Matthews Correlation Coefficient) and Log-loss.
 Performance metrics for clustering : Silhouette Score, Rand Index, Adjusted Rand Index, Mutual
Information, Calinski-Harabasz Index and Davies-Bouldin Index
 Conclusion of Unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

Machine Learning – An Algorithmic
1. Second
Perspective, Chapman and Hall/CRC Machine Stephen Marsland
Edition
Learning and Pattern Recognition Series.
2. First McGraw Hill
Machine Learning Tom M Mitchell
Edition Education

Reference Book

1. Introduction to Machine Learning 3e (Adaptive Computation and Machine Learning Series), Third Edition,
MIT Press, Ethem Alpaydin.
2. Machine Learning: The Art and Science of Algorithms that Make Sense of Data, 1st Edition, Cambridge
University Press, Peter Flach.
3. Learning from Data‖, AML Book Publishers, Y. S. Abu-Mostafa, M. Magdon-Ismail, and H.-T. Lin

Online Resources

1. https://nptel.ac.in/courses/106106139
2. https://www.udemy.com/course/machine-learning-course/
3. https://www.javatpoint.com/machine-learning

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 73 of 118

 Code: BASCCA4104 R Programming 3Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Apply various data structure in R programming
 Create and apply function in R programming
 Design to read different file format into R
 Implement statistics and testing of hypothesis
 Apply graphs and non-parametric testing of hypothesis for real world problems in R

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Introduction to R Environment 08
2. Data Structures and Control Statements 08
3. I/O operations and String Manipulations 07
4. R for Summary Statistics and Parametric Tests 07
5. R for Graphs, Nonparametric Tests and ANOVA 06

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to R Environment
 History and development of R Statistical computing programming language
 Installing R and R studio
 Getting started with R
 Creating new working directory
 Changing existing working directory
 Installing the available packages
 Calling the installed packages
 Variable definition in R
 Simple functions, vector definition and logical expressions
 Matrix calculation and manipulation using matrix data types
 Conclusion of unit
2. Data Structures and Control Statements
 Introduction to different data types, vectors, atomic vectors, types and tests, coercion, lists, list indexing
 Function applying on the lists, adding and deleting the elements of lists, attributes, name and factors ,
matrices and arrays,
 Matrix indexing, filtering on matrix, generating a covariance matrix.
 lapply( ) and sapply( ) on data frames
 Control statements.
 Conclusion of unit
3. I/O operations and String Manipulations
 Introduction to I/O functions in R
 Using of scan( ), readline ( ) function
 Comparison and usage of scan and readline function
 Reading different format files into R: text file, CSV file
 Statistical package files, xls and xlsx files
 Converting from one format to another using in built function

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 74 of 118

  Writing different file format in to the local machine directory
 Basics of string manipulations – grep ( ), nchar ( ), paste( ), sprintf( ), substr( ), regexpr( ), strsplit( )
 Testing of file name with given suffix.
 Conclusion of unit
4. R for Summary Statistics and Parametric Tests

 Descriptive statistics – summary statistics for vectors, making contingency tables, creating contingency
tables from vectors.
 Testing tables and flat table objects, cross tables, testing cross tabulation, recreating original data from
contingency tables, switching class, mean (arithmetic, geometric and harmonic)
 Median, mode for raw and grouped data, measure of dispersion – range, standard deviation, variance,
coefficient of variation, testing of hypothesis – small sample test, large sample test – for comparing mean,
proportion, variance (dependent and independent samples).
 Conclusion of unit
5. R for Graphs, Nonparametric Tests and ANOVA
 Introduction to graphs
 Box-Whisker Plot, Scatter plots, pairs plots, line chart, Pie Chart and Bar Charts
 Non-parametric test: The Wilcoxon U-Test (Mann-Whitney): One and Two-Sample U-Test, Tests for
association: Chi Square Tests
 Yates Correction for 2X2 Tables, single category goodness of fit tests,
 Analysis of Variance for one-way variation and two variation
 Conclusion of unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Beginning R: The statistical Programming Latest John Wiley & Sons,
Dr. Mark Gardener
Language Edition Inc.
2. Latest no starch Press, San
The art of R programming Norman Matloff
Edition Francisco

Reference Book

1. Introduction to Probability and Statistics for Engineers and Scientists, Owen Jones, Robert Maillardet and
Andrew Robinson, latest edition
2. The R Book, Hadley Wickham, CRC Press, latest edition
3. Learning from Data‖, AML Book Publishers, Y. S. Abu-Mostafa, M. Magdon-Ismail, and H.-T. Lin

Online Resources

1. https://www.r-project.org/about.html
2. https://nptel.ac.in/courses/111104100
3. https://www.w3schools.com/r/

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 75 of 118

 Practical
Code: BCACCA4201 Big Data Lab 1Credit [LTP: 0-0-2]

Course Outcome:-
Students will be able:
 Identify the key issues in big data management and experiment with Hadoop framework.
 Develop problem solving and critical thinking skills in fundamental enabletechniques like Hadoop&MapReduce.
 Construct and Explain with structure and unstructured data by using NoSQLcommands.
 Implement fundamental enabling techniques and scalable algorithms for data streaming.

A. LIST OF EXPERIMENTS:

1 Hadoop Installation: Ubuntu & THEL 9 Operating System in stand-alone mode

2 File Management tasks in Hadoop
3 Implement the following Data structures in Java:
 Linked Lists
 Stacks
 Queues
 Set
 Map
4 Word Count Map Reduce program to understand Map Reduce
5 Implement the following file management tasks in Hadoop:
 Adding files and directories
 Retrieving files
 Deleting files
6 Implement Matrix Multiplication with Hadoop Map Reduce
7 Install and Run Pig then write Pig Latin scripts to sort, group, join, project, and filter your data.
8 Install and Run Hive then use Hive to create, alter, and drop databases, tables, views, functions,
and indexes
9 Weather Report POC-Map Reduce Program to analyses time-temperature statistics and generate
report with max/min temperature.
10 Implementing Matrix Multiplication with Hadoop Map Reduce
11 Pig Latin scripts to sort,group,join,project, and filter your data.
12 Hive Databases: Tables,Views,Functions and Indexes

B. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Hadoop in Practice Alex Holmes 2014 Wiley India

2. Big Data Black Book 2016 DT Editorial Services
3. Big Data and Hadoop V.K. Jain 2017 Khanna Publishers
Reference Book
1. Hadoop Practice Guide,‖Jisha Mariam Jose”
2. Hadoop: The Definitive Guide ,‖Tom White‖,O‘Relly
Online Resources

1. https://ia600201.us.archive.org/7/items/HadoopInPractice/Hadoop%20in%20Practice.pdf

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 76 of 118

 Code:BCACCA4202 Design and Analysis of Algorithm Lab 1Credit [LTP: 0-0-2]

Course Outcome: -
Students will be able to:
 Applydivide and conquer method to implement quick sort, merge sort, linear search,and Binary search in C.
 Implement job sequencing using greedy method.
 Find the minimum cost of spanning tree.
 Implement the dynamic programming using branch and bound method.
 Implement the NP-Hard, NP-.Complete problem.

A. LIST OF EXPERIMENTS:

1 Write a C program to implement the Stack using arrays. WritePush(),Pop(),and Display() methods to
demonstrate its working.

2 Write a C program to sort a list of elements using the quick sort algorithm. The elements can be read
from a file.

3 Write a C program to implement a Merge sort algorithm to a list of elements for different values of n and
determine the time required to sort the elements.

4 Find the minimum cost of spanning tree in C using Prim‘s algorithms.

5 Find the minimum cost of spanning tree in C using Kruskal‘s algorithm.

6 Implement 0/1 Knapsack problem using Dynamic Programming in C.

7 Write a C program to find the shortest paths between nodes in a graph using Dijkstra‘s algorithm.

8 Write a C program to Print all the nodes reachable from a starting node in a digraph using BFS method.
Check whether a graph is connected or not using DFS method.

9 Write a C program to implement all pairs shortest paths problem using Floyd‘s algorithm.

10 Write a C program to implement N Queen‘s problem using Back Tracking.

B. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Mastering Algorithms with C Kyle Loudon Latest O‘Reilly

2. Algorithms Illuminated (Part 3): Greedy
Tim Roughgarden 2014 Kindle
Algorithms and Dynamic Programming
Reference Book
1. Data Structures and Algorithms, Made Easy by NarasimhaKarumanchi, Kindle Edition

Online Resources

1. https://www.sanfoundry.com/c-program

2. https://www.thecrazyprogrammer.com/2015/03/c-program-for-n-queens-problem-using-backtracking.html

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 77 of 118

 Code:BASCCA4203 Machine Learning Lab 1 Credits [LTP: 0-0-2]

Course Outcome: -
Students will be able to:

 Apply data preprocessing techniques on data sets.

 Implement regression algorithms on appropriate dataset for prediction.
 Apply classification algorithms on appropriate dataset.
 Apply clustering algorithms on appropriate dataset
 Implement Machine Learning algorithms to solve real world problems

A. LIST OF EXPERIMENTS:

1 To read dataset to pandas data frame and display the first few rows using the & quot; head & quot;
function in Python.
2 To work with Pandas and XlsxWriter
3 To work with csv files in Python and apply preprocessing techniques such as Scaling, Normalization,
Binarization, Standardization and Data Labeling as well as divide the data into train and test split.
4 To implement Simple Linear Regression to predict the House price using datasets from any Data source

5 To implement Logistic Regression to predict the car prices in Python

6
Using logistic regression to recognize hand-written digits (0 to 9) by loading the data set from any Data
Source in Python
7 On a set of email data and build a classifier on the processed emails using a SVM to determine if they
are spam or not. in Python
8 To implement Decision Tree classifier on Pima Indian Diabetes in Python.
9 Using Naïve Bayes with training examples of individuals onto high, medium and low credit-worthiness
in Python.
10 To implement k-mean clustering on simple digits dataset. K-means will try to identify similar digits
without using the original label information in Python

B. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Machine Learning - An Algorithmic ―‖‖, 2nd Edition

Stephen Marsland
Perspective
2. Jiawei Han and 2nd Edition
Data Mining Concepts and Techniques Elsevier
Micheline Kamber
3. Introduction to Machine learning Nils J. Nilsson
Reference Book
1. Introduction to Machine Learning 3e (Adaptive Computation and Machine Learning Series), Third Edition,
MIT Press, Ethem Alpaydin.
2. Machine Learning: The Art and Science of Algorithms that Make Sense of Data, 1 st Edition, Cambridge
University Press, Peter Flach.
Online Resources

1. https://nptel.ac.in/courses/106106182
2. https://www.udemy.com/course/data-science-and-machine-learning-bootcamp-with-python-and-r/
3. https://www.udemy.com/course/complete-python-basic-to-advanced/

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 78 of 118

 Code: BASCCA4204 R Programming Lab 1 Credit [LTP: 0-0-2]

Course Outcome:-
Students will be able to:

 Execute the procedure to read and write different format of data set into R environment

 Apply function in R programming language

 Implement different options in I/O operations in R programming Language,

 Apply statistics and test hypothesis
 Create non-parametric testing of hypothesis in R
.
A. LIST OF EXPERIMENTS:

Part A
1. Install and configure R, set working directory.
2. Install Packages and calling installed packages
3. R studio environment and functionalities of R studio
4. Implement basic R operations (data input, missing values, importing data into R using different formats :
xlsx, CSV, Text files)
5. Use R as a calculator
6. Explore various functionalities of dataframes.
7. Create data set using data frames, list and tables.
8. Create the contingency table for the given raw data.
9. Create the interactive user input code line in r using readline ( ) function.
10. Create the contingency table for the given vector format data.
11. Convert the contingency table to original format of the given data.
12. Analyze and give interpretation of summary statistics for the given data.
13. Calculate mean, median and mode for the grouped data and compare the results for the given data.
14. Analyze the given data for non-parametric tests and give the interpretations.
15. Use R for test the given data
In order to compare the effectiveness of two sources of nitrogen, namely ammonium chloride (NH4Cl)
and urea, on grain yield of Coarse cereal, an experiment was conducted. The results on the grain yield of
Coarse Cereal (kg/plot) under the two treatments are given below.
NH4Cl : 13.4, 10.9, 11.2, 11.8, 14.0, 15.3, 14.2, 12.6, 17.0, 16.2, 16.5, 15.7.
Urea : 12.0, 11.7, 10.7, 11.2, 14.8, 14.4, 13.9, 13.7, 16.9, 16.0, 15.6, 16.0.
Assess which source of nitrogen is better for Coarse Cereal.
Part B

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 79 of 118

 16. Before an increasing in exercise duty on tea, 800 persons out of a sample of 1000 persons were found to
be tea drinkers. After an increasing in duty, 800 people were tea drinkers in a sample of 1200 people.
Using SE of a proportion, state whether there is a significant decrease in consumption of tea after the
increase in the exercise duty.
17. Use R for test the given data
A health status survey in a few villages revealed that the normal serum protein value of children in that
locality is 7.0 g/100ml. A group of 16 children who received high protein food for a period of six months
had serum protein values shown below. Can we consider that the mean serum protein level of those who
were fed on high protein diet is different from that of the general population?
S.No. (Child No.) 1 2 3 4 5 6 7 8
Protein level (g%) 7.10 7.70 8.20 7.56 7.05 7.08 7.21 7.25

S.No. (Child No.) 9 10 11 12 13 14 15 16

Protein level (g%) 7.36 6.59 6.85 7.90 7.27 6.56 7.93 8.56
18. Students were selected to training. Their performance was noted by giving a test and the marks recorded
out of 50. They were given effective 6 months training and again they were given a test and marks were
recorded out of 50.
Students 1 2 3 4 5 6 7 8 9 10
Before training 25 20 35 15 42 28 26 44 35 48
After training 26 20 34 13 43 40 29 41 36 46
By applying the t-test can it be concluded that the students have benefited by the training?
19. 100 individuals of a particular race were tested with an intelligence test and classified into two classes.
Another group of 120 individuals belong to another race were administered the same intelligence test
and classified into the same two classes. The following are the observed frequencies of the two races:
Race Intelligence
Intelligent Non-intelligent Total
Race I 42 58 100
Race II 55 65 120
Total 97 123 220
Test whether the intelligence is anything to do with the race.
20. Obtain the correlation coefficient between the heights of father(X) and of the son (Y) from the following
data
X 65 66 67 68 69 70 71 72
Y 67 68 65 68 72 72 69 71
And also test its significance. Using R functions.
21. Consider the inbuilt data set cars.
22. Find Correlation between possible variables and pairwise correlation
23. Find regression line between appropriate variables
Display the summary statistics and comment on the results

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 80 of 118

 B. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Beginning R: The statistical Dr. Mark

Latest Edition John Wiley & Sons, Inc.
Programming Language Gardener
2. The art of R programming Norman Matloff Latest Edition No starch Press, San Francisco
3. Ken Black Sixth Edition John Wiley & Sons, Inc.
Advanced R
Reference Book
1. Introduction to Probability and Statistics for Engineers and Scientists, Owen Jones, Robert Maillardet and
Andrew Robinson, CRC Press
2. The R Book, Hadley Wickham, CRC Press
Online Resources

1. https://www.r-project.org/about.html
2. https://nptel.ac.in/courses/111104100
3. https://www.w3schools.com/r/

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 81 of 118

 Department Elective
Code:BCAECA4111 Information Security Fundamental 3Credit[LTP:3-0-0]

COURSE OUTCOME
Students will be able to:

 Identify and analyze security problems in computer systems and networks.

 Explain how standard security mechanisms work.
 Develop security mechanisms to protect computer systems and networks.
 Write programs that are more secure.
 Use cryptography algorithms and protocols to achieve computer security

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Introduction to Information Security 07
2. Encryption and Authentication Techniques. 08
3. Risk Management 08
4. Internet Security. 07
5. Network Security 07

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to Information Security
 Introduction to Information Security: Attacks, Vulnerability, Security Goals, Security Services and
mechanisms, Conventional Cryptographic Techniques: Conventional substitution and transposition
ciphers, One-time Pad, Block cipher and Stream Cipher, Steganography .
 Conclusion of the Unit
2. Encryption and Authentication Techniques.
 Symmetric and Asymmetric Cryptographic Techniques : DES, AES, RSA algorithms, International Data
Encryption Algorithm (IDEA), Digital Certificates, Private Key Management, The PKIX Model
Authentication and Digital Signatures
 Conclusion of the Unit
3. Risk Management
 Key management – Kerberos, Program Security : Non-malicious Program errors – Buffer overflow,
Incomplete mediation, Time-of-check to Time-of- use Errors, Viruses, Trapdoors, Salami attack, Man-in-
the- middle attacks, Covert channels
 Conclusion of the Unit
4. Internet Security.
 Internet Security Protocols: Introduction, Basic Concepts, Secure Socket Layer (SSL), Transport Layer
Security (TLS), Secure Hyper Text Transfer Protocol (SHTTP), Time Stamping Protocol (TSP), Secure
Electronic Transaction (SET), SSL Versus SET, 3D Secure Protocol, Electronic Money, Email Security
Wireless Application Protocol (WAP) Security
 Conclusion of the Unit
5. Network Security
 Security in Networks : Threats in networks, Network Security Controls – Architecture, Encryption,
Content Integrity, Strong Authentication, Access Controls, Wireless Security, Honeypots, Traffic flow
security, Firewalls – Design and Types of Firewalls, Personal Firewalls, IDS, Email Security –
PGP,S/MIME

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 82 of 118

  Conclusion of theUnit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

rd
1. Information Security Risk Analysis Thomas R.Peltier 3 Auerbach

Mark Stamp's Information Security: DevenN.Shah, Latest Wiley

2. Principles and Practice(WIND)

InformationSystemsSecurity:SecurityMa NinaGodbole 1st Wiley

3. nagement,Metrics,FrameworksandBestPr
actices
Reference Book

1. Security in Computing, Fourth Edition, by Charles P. P fleeger, Pearson Education

2. Cryptography And Network Security Principles And Practice, Fourth or Fifth Edition, William Stallings,
Pearson

3 Modern Cryptography: Theory and Practice, by Wenbo Mao, Prentice Hall.

Online Resources
1. https://www.sans.org/cyber-security-courses/introduction-cyber-security/

2. https://nptel.ac.in/courses/106106129

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 83 of 118

 Code: BCAECA4112 Software Project Management 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Identify the different project contexts and suggest an appropriate management strategy.
 Practice the role of professional ethics in successful software development.
 Identify and describe the key phases of project management.
 Determine an appropriate project management approach through an evaluation of the business context and scope
of the project.

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Introduction to Software Project Management 07
2. Project Analysis 08
3. Activity Planning and Scheduling 08
4. Risk Management, Resource allocation &Monitoring and 07
control
5. Managing Contracts and people 07

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to Software Project Management
 Introduction of Unit
 Definition of a Software Project (SP), SP Vs. other types of projects activities covered by SPM,
 categorizing SPs, Project management cycle, SPM framework, types of project plan.
 Conclusion of Unit
2. Project Analysis
 Introduction of Unit
 strategic assessment, technical assessment, economic analysis: Present worth,
 future worth, annual worth, internal rate of return (IRR) method,
 benefit-cost ratio analysis, including uniform gradient cash flow and comparison of mutually exclusive
alternatives.
 Conclusion of Unit
3. Activity Planning and Scheduling
 Introduction of Unit
 Objectives of activity planning, Work breakdown structure, Bar chart, Network planning model: Critical
path method (CPM)
 Program evaluation and review technique (PERT)
 Precedence diagramming method (PDM), Shortening project duration, Identifying critical activities.
 Conclusion of Unit
4. Risk Management, Resource allocation &Monitoring and control
 Introduction of Unit
 Nature and identification of risk, risk analysis, evaluation of risk to the schedule using Z-values
 Identifying resource requirements, resource allocation, resource smoothing and resource balancing
Collecting data, visualizing progress, cost monitoring, earned value analysis, project control
Conclusion of Unit
5. Managing Contracts and people
 Introduction of Unit

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 84 of 118

  Types of contract, stages in contract, placement, typical terms of a contract, contract management,
acceptance
 Managing people and organizing terms: Introduction, understanding behavior,
 Organizational behavior: a back ground, selecting the right person for the job, instruction in the best
methods,
 Motivation, working in groups, becoming a team, decision making, leadership, organizational structures,
conclusion, further exercises,
 Conclusion of Unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Software Project Management Rajiv Mall 5th SE
2. Software Project Management Barry Boehm 3rd Pearson

Reference Book
1. Software Project Management, Bob Hughes and mike cotterel, 5 thedition

Online Resources

1. https://mrcet.com
2. https://www.edutechlearners.com
3. https://www.e-booksdirectory.com

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 85 of 118

 Code: BCAECA4113 E-Commerce 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Describe the impact of E-commerce on business models and strategy.
 Describe the major types of E-commerce.
 Explain the process that should be followed in building an E-commerce presence.
 Identify the key security threats in the E-commerce environment.
 Describe how procurement and supply chains relate to B2B E-commerce.

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Introduction to E-Commerce 07
2. The Network Infrastructure for E-Commerce 08
3. E-Commerce Security and Fraud Issues and Protection 08
4. E-payment systems 07
5. Introduction to Management Information System 07

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to E-Commerce
 Introduction of Unit
 Definitions and Concepts; Defining E-Business; Pure Versus Partial EC;EC Framework
 Classification of EC; Benefits of E-Commerce; Electronic Markets
 Role of Internet and Web in E-Commerce;
 The Limitations and Barriers of EC; Social Networks and Social Network Services;
Conclusion of Unit
2. The Network Infrastructure for E-Commerce
 Introduction of Unit
 The Network Infrastructure for E-Commerce: Introduction to Information Superhighway (I-Way)
 Components of the I-Way, Internet as a network infrastructure. Wireless Application Protocol: Wireless
Application Protocol (WAP);
 Architecture of WAP; Working of WAP; Wireless Technologies: ADSL,
 WiMAX, WLAN, WMAN Wi-Fi, UMTS (3G), LTE (4G), (5G NR)
Security Issues related to Wireless Communications.
Conclusion of Unit
3. E-Commerce Security and Fraud Issues and Protection
 Introduction of Unit
 Basic Ec Security Terminology, The Threats, Attacks, and Attackers, EC Security Requirements:
Confidentiality, Integrity and Availability, Authentication, Authorization and Nonrepudiation;
 Technical Malware attack: Viruses, Worms, and Trojan Horses, Heartbleed, Distributed Denial of
Service, Cryptblocker, Page hijacking, Botnets, Malvertising, ransom ware, sniffing, Non-Technical
malware attack: Social Phishing, Pharming, Identity Theft and Identify Fraud, Spam attacks;
 EC defense Strategy: access control(Authorization and Authentication, Biometric Systems), encryption
and PKI (Symmetric Key Encryption, Asymmetric Key Encryption, Certificate Authority(CA), Secure
Socket Layer(SSL)
 Securing e-commerce networks: Firewalls, Virtual Private Networks, Intrusion Detection Systems(IDS),
intrusion prevention System(IPS).
 Conclusion of Unit

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 86 of 118

 4. E-payment systems
 Introduction of Unit
 Online payment cards (credit cards, charge cards, debit cards, smart cards), processing cards in online,
credit card payment procedure
 e-micro payments, e-checking and its processing in online. Automated clearing house (ACH) network,
mobile payments (Digital wallet)
 mobile payment participants and issues, international payments,
 Emerging EC payment systems and issues: crypto currency, virtual currency. A case study of emerging
trends in online payment system in Nepal.
 Conclusion of Unit
5. Introduction to Management Information System
 Introduction of Unit
 Data, information, computer based information system (CBIS), Information System Resources,
Management information system, Transaction processing (TPS) system,
 decision support system (DSS), and executive information system (EIS), SCM, CRMS and International
Systems: Introduction,
 Supply Chain Management Systems, Customer Relationships Management Systems,
 Enterprise systems and Challenges of Enterprise Systems Implementations- Managing the
implementation, International Information Systems-Outsourcing and off-shoring.
 Conclusion of Unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. E-Commerce-Strategy, Technologies
by David Whitley, TMH
&Applications
2. E-Commerce- The cutting edge of business by Kamlesh K. Bajaj, TMH

Reference Book
1.
E-Commerce through ASP by W Clarke- BPB

Online Resources

1. https://ecommerceguide.com
2. https://ecommerce-platforms.com

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 87 of 118

 Code: BULCHU4201 COMMUNICATION SKILLS-II 1 Credit [LTP: 0-0-2]

COURSE OUTCOME
Students will be able to:

 Develop the ability to identify difficult sounds, words and phrases to strengthen listening and applying these
improved skills in spoken communication.
 Cultivating knack for reading and writing by understanding the nuances of sentence structure and presentation
style.
 Comprehend negotiation and Identify steps for proper negotiation preparation & learn bargaining techniques and
strategies of inventing options for mutual gain.
 Develop a heightened awareness of the potential of digital communication and apply their knowledge in creating
documents considering the needs of the netizens.
 Propose their outlook through exposure to new and different experiences and ideas and enrich their understanding
of the issues under discussion.

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Introduction to E-Commerce 07
2. The Network Infrastructure for E-Commerce 08
3. E-Commerce Security and Fraud Issues and Protection 08
4. E-payment systems 07
5. Introduction to Management Information System 07

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to E-Commerce
 Introduction of Unit
 Advanced Listening & Speaking Skills
 Conclusion of Unit
2. The Network Infrastructure for E-Commerce
 Introduction of Unit
 Advanced Reading & Writing Skills
 Conclusion of Unit
3. E-Commerce Security and Fraud Issues and Protection
 Introduction of Unit
 Art of Negotiation Skills
 Conclusion of Unit
4. E-payment systems
 Introduction of Unit
 Email Etiquettes
 Conclusion of Unit
5. Introduction to Management Information System
 Introduction of Unit
 Group Discussion
 Conclusion of Unit

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 88 of 118

 A. LIST OF EXPERIMENTS:
1 Listening Skills II: Analysis of videos/audios by famous personalities

2 Speaking Skills II: Extempore, Debate etc.

3 Public Speaking: Key Concepts, Overcoming Stage Fear

4 Story-Telling Skills: Techniques of Story Telling, Prompts for story creation

5 Situational Conversational Skills

6 PowerPoint Presentation Skills-II

7 Reading Skills II: Technical Writings, Research Papers& Articles

8 Writing Skills II: Blog Writing &Review Writing

9 Picture Perception & Discussion

10 Art of Negotiation: Identify the qualities of successful and unsuccessful negotiators. Identify different
negotiation situations to practice during class.

11 Email Etiquettes

12 Group Discussion: Dos &Don‘ts, Informal GD

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 89 of 118

 Code: BCACCA4601 Discipline, VAC, Social Outreach 1 Credit [LTP: 0-0-4]

COURSE OUTCOME:
The objective of Discipline and TEP is to provide students with the opportunities to enhance job fetching skills
and at the same time to cultivate the student‘s personal interests and hobbies while maintaining the good
disciplinary environment in the University. TEP is integrated into the curriculum for holistic development of
students through active participation in various activities falling in Technical and non-technical categories.

Social outreach, Discipline, TEP -IV, VAC & Extra Curricular activities shall be evaluated on the basis of its sub
constituent programmes, as a complete one credit course. It shall be counted in calculation of SGPA but it is not a
backlog subject. However, the attendance of these classes shall be recorded and accounted in the total attendance.
Activities included in this category in the Fourth Semester are as follows:
:

Code Activity Hours Credits

Talent Enrichment Programme(TEP)-IV
Library / MOOC / Online Certificate Courses 4 1
BCACCA3601
Non Syllabus Project (NSP) / Industry Visit / CRT

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 90 of 118

 Semester-V

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 91 of 118

 Semester V
Department Core Courses
Code: BASCCA5101 Deep Learning 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Design Perceptron Learning Algorithm
 Apply Back propagation techniques in various problems
 Implement Convolutional Neural Network using different architecture
 Design Recurrent Neural Network by Back propagation
 Implement deep learning techniques for real world applications

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Basics of Deep Learning 10
2. Artificial Neural Network 09
3. Convolutional Neural Network 07
4. Recurrent Neural Network 07
5. Encoder and Decoder 08

B. DETAILED SYLLABUS

Unit Unit Details

1. Basics of Deep Learning

 Introduction of Unit
 History of Deep Learning,
 A brief review of the existing deep learning models such as Alexnet, VGG16, Resnet etc.
 Physiology of a human neuron, McCulloch Pitts Neuron, Thresholding Logic
 Perceptrons, Perceptron Learning Algorithm and Convergence, Multilayer Perceptrons (MLPs),
Representation Power of MLPs
 Conclusion of Unit
2. Artificial Neural Network

 Introduction of Unit
 Sigmoid Neurons, Gradient Descent,
 Feed forward Neural Networks, Representation Power of Feed forward Neural Networks
 Back propagation
Conclusion of Unit
3. Convolutional Neural Network

 Introduction of Unit
 Width and Depth of Neural Networks, Activation Functions: RELU, LRELU, ERELU
 Convolutional Neural Networks, LeNet, AlexNet, ZF-Net, VGGNet, GoogLeNet, ResNet
 Object Detection, RCNN, Fast RCNN, Faster RCNN, YOLO
Transfer learning
Conclusion of Unit
4. Recurrent Neural Network

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 92 of 118

  Introduction of Unit
 Recurrent Neural Networks, Back propagation Through Time (BPTT), Vanishing and Exploding
Gradients, Truncated BPTT
 Gated Recurrent Units (GRUs), Long Short Term Memory (LSTM) Cells, Solving the vanishing gradient
problem with LSTMs
 Conclusion of Unit
5. Encoder and Decoder

 Introduction of Unit
 Encoder Decoder Models, Attention Mechanism,
 Attention over images, Hierarchical Attention
 Variational auto encoders
 Introduction to GANs (Generative Adversarial Network)
 Conclusion of Unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

Good fellow, Ian, Yoshua Fourth
1. Deep learning MIT press
Bengio, and Aaron Courville Edition
Neural Networks and Deep Learning: First
2. Charu C. Aggarwal Springer
A Textbook Edition

Reference Book
Bishop, Christopher. Neural Networks for Pattern Recognition. New York, NY: Oxford University Press,
1.
1995.
2. Bishop, Christopher M. Pattern Recognition and Machine Learning. Springer, 2006.
3. Wolfe, J., et al. Sensation and Perception. Sunderland, MA: Sinauer Associates, 2005.

Online Resources

1. https://nptel.ac.in/courses/106106184
2. MIT Introduction to Deep Learning | 6.S191
3. 70 - An overview of deep learning and neural networks

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 93 of 118

 Code: BASCCA5102 EDA and Data Visualization 3 Credits [LTP: 3-0-0]

COURSE OUTCOME

Students will be able to:

 Identify the types of data using statistical methods

 Create dataset in file format such as XML and JSON
 Apply data preprocessing techniques
 Create data visualization using various types of charts
 Apply visualization techniques for various data analytics tasks

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit
(Hours)
1. Introduction to EDA 7
2. Data on files 6
3. Cleaning the data, symbolic data analysis 9
4. Introduction to data visualization 6
5. Basics of data visualization 7

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to EDA
 Introduction to exploratory analysis
 Introduction to statistics and data science
 Central tendency (mean, mode, median).
 Categorical data: Contingency tables, correspondence analysis
 Review measurement scale
 Properties of data
 Conclusion of unit
2. Data on files
 Introduction to unit.
 Types of data formats
 snowball sampling
 for-mats
 XML and JSON formats
 Conclusion of Unit
3 Cleaning the data, symbolic data analysis
 Introduction to Unit
 Cleaning and exploring the data.
 Preparing data for basic regression and cluster analysis
 Clustering problem
 The foundation of symbolic data analysis
 Clustering and optimization
 Leaders method
 Agglomerative method
 Conclusion of Unit

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 94 of 118

 4. Introduction to data visualization
 Introduction to unit.
 Acquiring and Visualizing Data, Applications of Data Visualization
 Keys factors of Data Visualization (Control of Presentation, Faster and Better JavaScript processing)
 Exploring the Visual Data Spectrum
 Charting Primitives (Data Points, Line Charts, Bar Charts, Pie Charts, Area Charts)
 Conclusion of Unit
5. Basics of data visualization
 Reading Data from Standard text files
 Basic Table Data (Building a table, Using Semantic Table, Configuring the columns)
 Assuring Maximum readability (Styling your table, Increasing readability, Adding dynamic
Highlighting)
 Including computations
 Using data tables library
 Relating data table to a chart.
 Conclusion of Unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

Visualizing data: Exploring and explaining data Ben Fry
1. O'Reilly
with the processing environment
Thomas D. Nadeau, Ken Gray
2. Visual story telling with D3 2015 Pearson
Ritchie S. King

Reference Book
1.
W.L. Martinez and A.R. Martinez. Exploratory Data Analysis with MATLAB, Chapman &Hall/CRC,

Online Resources

1. https://slideplayer.com/slide/3443501/
2. https://www.udemy.com/courses/search/?src=ukw&q=ASP.NET
3. https://www.tableau.com/learn/articles/data-visualization
D.

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 95 of 118

 Code:BASCCA5103 Natural Language Processing 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:

 Identify the significance of natural language processing in solving real-world problems

 Implement POS tagging using HMM
 Apply Syntactic and Semantic Parsing methods
 Solve problems of sentimental analysis
 Apply deep learning models in NLP to solve real world problems

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit
(Hours)
1. Introduction to NLP 06
2. Language Modeling: N-gram and POS Tagging 07
3. Syntactic and Semantic Parsing 08
4. Text Analysis, Summarization and Extraction 07
5. Deep Learning and NLP 08

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to NLP

 Introduction to Unit
 What is NLP? Why NLP is Difficult?
 History of NLP, Advantages of NLP, Disadvantages of NLP
 Components of NLP, Applications of NLP
 The problem of ambiguity
 Phases of NLP
 Why NLP is Difficult?
 NLP APIs
 NLP Libraries
 Difference Between Natural language and Computer language
Conclusion of unit
2. Language Modeling: N-gram and POS Tagging

 Introduction to Unit
 Language Modeling with N-gram
 Simple N-gram models, Smoothing (basic techniques)
 Parts-of-speech Tagging
 Rule based POS Tagging
 TBL POS Tagging
POS tagging using HMM
Conclusion of Unit
3. Syntactic and Semantic Parsing

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 96 of 118

  Introduction to Unit
 Basic concepts: top down and bottom up parsing
 Treebank;
 Syntactic parsing: CKY parsing;
 Statistical Parsing basics: Probabilistic Context Free Grammar (PCFG); Probabilistic CKY Parsing of
PCFGs.
 Vector Semantics; Words and Vector;
 Measuring Similarity; Semantics with dense vectors
 SVD and Latent Semantic Analysis;
 Embedding from prediction: Skip-gram and CBOW
 Introduction to Word Net
Conclusion of Unit
4. Text Analysis, Summarization and Extraction

 Introduction of Unit
 Sentiment Mining
 Text Classification
 Text Summarization, Information Extraction
 Named Entity Recognition
 Relation Extraction
 Question Answering in Multilingual
 Setting; NLP in Information Retrieval, Cross-Lingual IR
Conclusion of Unit
5. Deep Learning and NLP

 Introduction to Unit
 Feature Extraction :
 Embedding
 Type of embedding
 Word2Vec and Glove
 Uses of deep learning models in NLP.
 sentiment analysis
 Conclusion of Unit

C. RECOMMENDED STUDY MATERIAL

A.
S. No Text Books: Author Edition Publication
―Speech and language processing: An Jurafsky D. and Martin 2nd Upper Saddle
Introduction to Natural Language Processing, J. H Edition River, NJ:
1. Prentice-Hall,
Computational Linguistics, and Speech
2008
Recognition‖,
Natural Language Processing with Python Edward Loper, Ewan 1st Pearson
2. Klein, and Steven Bird Edition Education
O‘Reilly
Media
3. Computer Vision: Models, Learning, and Simon Prince 2nd Cambridge
Inference Edition University
Press
Reference Book

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 97 of 118

 1. ―Speech and language processing: An Introduction to Natural Language Processing,
Computational Linguistics, and Speech Recognition‖,
2. Computer Vision: Models, Learning, and Inference
Online Resources
1. https://www.nlp.com/nlp-online-course/
https://www.mygreatlearning.com/academy/learn-for-free/courses/introduction-to-natural-language-
2.
processing
3. https://www.futurelearn.com/courses/cloudswyft-msft-natural-language-processing-advanced

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 98 of 118

 Code:BASCCA5104 Computer Vision 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Apply visual perception and cognition in computer vision
 Implement Image Transformation techniques in in computer vision
 Implement Supervised and Unsupervised algorithms to solve the problems
 Solve the problems related to Object detection and recognition
 Apply various real time problem in computer vision

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Introduction to Eyes and Images 06
2. Visual Perception and Cognition 07
3. Low Level Image Analysis 08
4. High Level Image Analysis 08
5. Introduction for Saliency and Scene Classification 07

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to Eyes and Images
 Introduction to Unit
 Introduction to Computer Vision: What is computer vision? Vision Problem and how computer vision is a
solution?
 Human Eye: Basic physiology, Signals from retina to brain, Visual cortex
 Formation of Images: Electromagnetic Spectrum, Visible Bands, Multi-channel image, A matrix view of
image, pixels and DN values, gray levels
 Basic Terminology, Brightness, Contrast, Intensity, Illumination, Hue, Saturation
 Color Models: RGB, HSI, CMYK
 Camera lens and Photogrammetry
 Different types of imagery data
 Conclusion of Unit
2. Visual Perception and Cognition
 Introduction to Unit
 Need to study visual perception and cognition in computer vision; difference between Perception and
Cognition; Understanding perception as a prerequisite for cognition
 From senses to interpretation, psychophysics,
 Visual angle, foveal acuity, gabor patches
 2-D Perception: Gestalt Principles (Whole is not the sum of parts), Marr's Theory: From primal sketch to 3-
D models, Illusions: Müller-Lyer illusion, Optical illusion, Ponzo illusion
 Saliency and attention model of perception
 Cognitive resonance
 Conclusion of Unit
3. Low Level Image Analysis

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 99 of 118

  Introduction to Unit
 Photo and image; image operations; Difference between low level and high level features
 Definition of kernel or filters, Basic image filter: high pass, low pass, band pass (Convolution)
 Low level features: SIFT, HOG, fourier; Image Transformation: Rotation, Translation, Resampling
 Image gradient, edge detection: robert, sobel, prewitt, canny
Morphological operators: Erosion, dilation
Conclusion of Unit
4. High Level Image Analysis
 Introduction to Unit
 Image processing steps: segmentation, detection, identification/recognition
 Types of image segmentation: region based, edge based, object based, threshold based, clustering based,
semantic; Image segmentation models: watershed model, region growing-region merging,
 Supervised and Unsupervised clustering, K-Means and ISODATA
 Object detection, Object recognition, Data labeling
 Conclusion of Unit
5. Introduction for Saliency and Scene Perception
 Introduction to Unit
 Introduction of Saliency: Neither unique nor well-defined; Saliency and salient objects/regions
 Need of saliency in computer vision, Relation of saliency with human vision
 Introduction to various well-known saliency models; Benchmark dataset
 Image Classification, Scene Perception: constructing a scene though salient objects; The Gist Phenomenon:
Understanding the whole before parts
 Conclusion of Unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Rafael C. Gonzales and Fourth Pearson International
Digital image processing
Richard E. Woods Edition Edition
2. Computer Vision: Algorithms and Second
R. Szeliski Springer
Applications Edition
3. David Forsyth and Jean Second Pearson International
Computer Vision: A Modern Approach
Ponce Edition Edition
4. Vision 1982
David Marr The MIT Press
Edition
Reference Book
Anil Kumar Jain, Fundamentals of digital image processing, Prentice Hall Information and System Sciences,
1.
1988
2. Wolfe, J., et al. Sensation and Perception. Sunderland, MA: Sinauer Associates, 2005.
3. Wolf PR. Elements of photogrammetry. New York: McGraw-Hill; 1974.
Monica S. Castelhano, and Carrick C. Williams, Elements of Scene Perception (Elements in Perception),
4.
Cambridge University Press; New edition, 2021
Online Resources
1. https://ieeexplore.ieee.org/xpl/conhome/1000147/all-proceedings
2. https://link.springer.com/conference/eccv

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 100 of 118

 Practical
Code: BASCCA5201 Deep Learning Lab 1Credit [LTP: 0-0-2]

Course Outcome:-
Students will be able:
 Implement a real world application based object detection model by using CNN.
 Implement the various deep learning algorithms in Python.
 Apply different deep learning frameworks like Keras, Tensor flow, PyTorch, Caffe etc.
 Design hyper parameters of CNN for achieving the desired outcomes.
 Design the test procedures to assess the efficacy of the developed model.

A. LIST OF EXPERIMENTS:

1 Implement a python program to recognise characters. Use MNIST dataset for the same.
2 Implement SVM/Softmax classifier for CIFAR-10 dataset: (i) using KNN, (ii) using 3 layer neural
network.
3 Implement the concept of transfer learning to classify an image dataset by using pre trained model.
4 Study the effect of batch normalization and dropout in neural network classifier
5 Improve the Deep learning model by tuning hyper parameters
Implement the CNN based image segmentation using on the online available dataset by using :
6 ● Mask RCNN,
7 ● UNet,
8 ● SegNet
Object detection with single-stage and two-stage detectors by using:
9 ● Yolo,
10 ● FRCNN
11 Image Captioning with LSTMs
12 Image generation using GAN

B. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Deep learning with Python Francois Chollet 2021 Edition Manning

Publications
Reference Book
1. Deep learning with Tensor Flow.Packt Publishing Ltd, 2017, Zaccone, Giancarlo, Md RezaulKarim, and
Ahmed Menshawy.
2. Explore neural networks with Python", Packt Publisher, 2017.
3. Antonio Gulli, Sujit Pal "Deep Learning with Keras", Packt Publishers, 2017.
Online Resources

1. https://www.tensorflow.org/datasets/catalog/mnist
2. Online communities available at Stack overflow, and Github
3. 70 - An overview of deep learning and neural networks (Youtube Channel)

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 101 of 118

 Code: BASCCA5202 Natural Language Processing Lab 1Credit [LTP: 0-0-2]

Course Outcome:-

Students will be able:

 Create systems for various NLP problems with moderate complexity.
 Implement various NLP software libraries and data sets publicly available.
 Implement semantics and pragmatics of English language for text processing
 Implement real time applications of computer vision.
 Design and develop practical and innovative image processing and computer vision applications or systems

A. LIST OF EXPERIMENTS:

1
Write a program to tokenize the sentence into words for the further analysis (using Python Function)
2 Write a program to normalize the sentence to eliminate the unwanted punctuation, converting into lower case
or upper case of the entire document, expanding abbreviation, numbers into words and canonicalization

3 Write a program that splits the following string ―Hello there SAM‖ into list and iterate over th list using 3
different methods

 List as a Iterable
 Using Range
4 Convert the following sentence into tokens ―NLP is Fun,you must learn it ‖ into lowercase

 Without splitting
 With splitting
5
Write a program to Get the word cloud for the yelp Review data set
6
Write a program for Amazon review dataset to find the maximum number of words used. Get the output for
the frequently occurred word in the given data? And also visualize the test data.
7 Perform the sentiment analysis, classifying comments using various machine learning model on IMDB
review data set using BOW technique

8 Perform the sentiment analysis, classifying comments using various machine learning model on IMDB
review data set using TF-IDF technique

9 Write a program to perform n-gram analysis on Amazon review data set and also compare result while
performing different type of n-gram analysis on the given dataset

10 Write a program to perform name entity reorganization on the sentence given below ―European authorities
fined Google a record $5.1 billion on Wednesday for abusing its power in the mobile phone market
and ordered the company to alter its practices”

11 Write a program to perform email filtering on Spam Mails Dataset available on Kaggle.
12 Write a program to perform survey analysis and the Dataset available is available on Kaggle.

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 102 of 118

 B. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

―Speech and language processing: An
Upper Saddle River,
1. Introduction to Natural Language Jurafsky D. and Martin 2nd
NJ: Prentice-Hall,
Processing, Computational Linguistics, J. H Edition
2008
and Speech Recognition‖,
2. 1st
Natural Language Processing with Python Edward Loper, Ewan Pearson Education
Edition

Reference Book

1. ―Speech and language processing: An Introduction to Natural Language Processing,

Computational Linguistics, and Speech Recognition‖,
2. Computer Vision: Models, Learning, and Inference

Online Resources

1. https://www.nlp.com/nlp-online-course/
2. https://www.mygreatlearning.com/academy/learn-for-free/courses/introduction-to-natural-language-
processing

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 103 of 118

 Code:BASCCA5203 Computer Vision Lab 1 Credit [LTP: 0-0-2]

Course Outcome:
Students will be able to:
 Apply preprocessing techniques on images
 Apply basic filters to extract the features of image
 Implement Image Transformation techniques in in computer vision
 Implement Supervised and Unsupervised algorithms to solve the problems
 Apply various real time problem in computer vision
.

A. LIST OF EXPERIMENTS:

1 Download an image and perform the following tasks:

● Read and show the image
● Generate Histogram of Image
● Visualize the image as a matrix and mention the range of DN values.
● Mention the bit depth and channel of Image
2 To the above processed image, calculate the basic metadata (mean, median, mode, skewness, max, min,)
of each band in the image.
3 Perform the basic low-level features based preprocessing operations (Histogram stretching, noise
removal, resampling) on the same image.
4 Calculate the basic low level features (SIFT, HOG) of the image and generate the output for each.
5 Calculate the fourier image of the original downloaded image and generate the output after applying the
high pass and low pass filters
6 Implement the basic filters (Robert, Sobel, Prewitt) to extract the orientation features and mention the
weights of the used filters.
7 Calculate the gradient of the image and apply a Canny edge detector filter with different threshold to get
the best segmented image as output.
8 Apply high level segmentation algorithms (Region growing-region merging and watershed) and generate
the output.
9 Choose an object of your choice and download at least 100 images of the chosen object (through web
scraping). Apply two saliency models (Achanta and Itti &Kotch) over 4-5 images.
10 Label the object (Either box or region based) for the 100 downloaded images by using the image
processing toolbox of MATLAB.
11 Prepare a CNN based model (ACFdetector) and train the network with the earlier 100 labeled images.
Any other object detector model can also be used.
12 Test the network and mention the training parameters.

B. RECOMMENDED STUDY MATERIAL

S. Text Books: Author Edition Publication

No
1. Digital Image Processing Using Rafael C. Gonzalez, Richard 3rd Gatesk
MATLAB E. Woods, Steven L. Eddins, Edition Publishin
g
Reference Book
1. Simon Prince, Computer Vision: Models, Learning, and Inference, 2012.
2. David Forsyth, Jean Ponce, Computer Vision: A Modern Approach, 2002.
Online Resources
1. https://www.epfl.ch/labs/cvlab/data/
2. Online communities available at Stackoverflow, and Github

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 104 of 118

 Department Elective
Code: BCAECA5111 Advanced Cloud Technology 3Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:
 Describe the types of medical robots and the concepts of navigation and motion replication.
 Discuss about the sensors used for localization and tracking
 Summarize the applications of surgical robotics
 Outline the concepts in Rehabilitation of limbs and brain machine interface
 Classify the types of assistive robots. Analyze the design characteristics, methodology and technological choices
for medical robots

A. OUTLINE OF THE COURSE

Time required for the

Unit No. Title of The Unit
Unit (Hours)
1. Introduction 07
2. Communications and Networking in the Cloud Computing &Protocols 08
3. Fundamentals Of Online Robots &IOT Architecture 08
4. Mobile Robots and Cloud Computing with Web of Things 07
5. Remote Mobility in the Cloud Computing &IOT Applications 07

B. DETAILED SYLLABUS

Unit Unit Details

Introduction

1. 1  Introduction of Unit
 Overview and background, Brief history of cloud computing and robotics.
 Network Robotics, ROS, MatLab
 Data Center and remote-device communication , Wireless network and Robot
 Different Types of Antennas &Characteristics of Antenna
 Privacy and Security Issues in the cloud network.
 Conclusion of Unit
2. Communications and Networking in the Cloud Computing &Protocols
 Introduction of Unit
 The Internet ,Wired Communication Links
 Wireless Links – Properties of Networked Telerobotics
 Building a Networked Telerobotic system
 State command Presentation ,Command Execution/ State Generation , Collaborative Control
 Protocol Standardization for IoT , Efforts – M2M and WSN Protocols
 SCADA and RFID Protocols ,Issues with IoT Standardization ,
 Unified Data Standards – Protocols – IEEE802.15.4
 BACNet Protocol– Modbus – KNX – Zigbee
 Network layer ,APS layer , Security
 Conclusion of Unit
3. Fundamentals Of Online Robots & IOT Architecture
 Introduction of Unit
 Introduction – Robot Manipulators , Teleoperation – Teleoperation on a local network
 Teleoperation via a constrained link.
 IoT Open source architecture (OIC), OIC Architecture &Design principles

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 105 of 118

  IoT Devices and deployment models- IoTivity : An Open source IoT stack
 Overview-IoTivity stack architecture,Resource model and Abstraction.
 Conclusion of Unit
4. Mobile Robots and Cloud Computing with Web of Things

 Introduction of Unit
 Introduction to networked robot system on the Web, Software Architecture and design – Interface design.
 Web of Things versus Internet of Things ,Two Pillars of the Web
 Architecture Standardization for WoT, Platform Middleware for WoT
 Unified Multitier WoT Architecture
WoT Portals and Business Intelligence.
Conclusion of Unit
5. Remote Mobility in the Cloud Computing & IOT Applications

 Introduction of Unit
 Autonomous Mobile Robot on the Web ,
 Mobile Mini Robots ,Performance of Mobile Robots controlled through WEB
 Handling Latency in Internet based Tele operation
 Case Study Computer Networked Robotics
 Online Robots and the Robot Museum.
 IoT applications for industry: Future Factory Concepts, Brownfield IoT
 Smart Objects, Smart Applications. Study of existing IoT platforms /middleware
 IoT- A, Hydra etc.
 Conclusion of Unit

B. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

1. Handbook of Cloud Computing BorkoFurht, Armando 2010 Springer Science
Escalante &Business,
2. Cloud Robotics – Distributed Robotics using Joao Pedro, Carvalho 2016 Coimbra
Cloud Computing Rosa,
Reference Book

1. Robots and Sensor Clouds

2. Networking Humans, Robots and Environments

3. Emergent Trends in Robotics and Intelligent Systems

Online Resources
https://www.simplilearn.com/cloud-solutions-architect-masters-program-
training?utm_source=google&utm_medium=cpc&utm_term=cloud%20course&utm_content=17438038281-
1. 138244819140-602766657095&utm_device=c&utm_campaign=Search-TechCluster-Cloud-
AbsoluteBroadKeywords-IN-Main-AllDevice-adgroup-Cloud-Course-
Broad&gclid=EAIaIQobChMIra3uw7Gs-AIVEBsrCh0BAgqsEAAYASAAEgLJlvD_BwE
https://www.ibm.com/in-en/cloud/internet-of-
2. things?utm_content=SRCWW&p1=Search&p4=43700052658173554&p5=e&gclid=EAIaIQobChMInZHDz
7Gs-AIVvp1LBR0V-gHmEAAYASAAEgLJpfD_BwE&gclsrc=aw.ds

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 106 of 118

 Code:BCAECA5112 Advanced Data Structures 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:

 Explain the basic principles and operations of data structures.

 Analyze algorithms and to determine algorithm correctness and time efficiency class.
 Apply Hashing, Disjoint sets and String Matching techniques for solving problems effectively.
 Apply the concepts of advanced Trees and Graphs for solving problems effectively.
 Analyze the given scenario and choose appropriate Data Structure for solving problems.

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Hashing 07
2. Priority Queues (Heaps) 08
3. Trees 07
4. Graphs Algorithms 07
5. Disjoint Sets and String Matching 07

B. DETAILED SYLLABUS

Unit Unit Details

1. Hashing
 Introduction to Hashing
 Hash Function
 Separate Chaining
 Hash Tables without linked lists: Linear Probing, Quadratic Probing, Double Hashing, Rehashing, Hash
Tables in the Standard Library
 Universal Hashing
 Extendible Hashing.
 Conclusion of Unit
2. Priority Queues (Heaps)
 Introduction to Priority Queues (Heaps)
 Model
 Simple implementations
 Binary Heap: Structure Property, Heap Order Property,
 Basic Heap Operations: insert, delete, Percolate down
 Other Heap Operations
 Introduction toBinomial Queues
 Binomial Queue Structure
 Binomial Queue Operations
 Implementation of Binomial Queue
 Priority Queues in the Standard Library.
 Conclusion of Unit
3. Trees
 Introduction to Trees
 AVL: Single Rotation, Double Rotation
 B-Trees
 Multi-way Search Trees – 2-3 Trees

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 107 of 118

  Searching for an Element in a 2-3 Tree
 Inserting a New Element in a 2-3 Tree
 Deleting an Element from a 2-3 Tree
 Red-Black Trees
 Properties of red-black trees: Rotations, Insertion, Deletion.
Conclusion of Unit
4. Graphs Algorithms
 Introduction to Graphs Algorithms
 Elementary Graph Algorithms: Topological sort
 Single Source Shortest Path Algorithms: Dijkstra‘s, Bellman-Ford, All-Pairs Shortest Paths: Floyd-
Warshall‘s Algorithm
 Conclusion of Unit
5. Disjoint Sets and String Matching
 Introduction to Disjoint Sets
 Equivalence relation
 Basic Data Structure
 Simple Union and Find algorithms
 Smart Union and Path compression algorithm.
 Introduction to String Matching
 The naive string-matching algorithm
 The Rabin-Karp algorithm
 The Knuth-Morris-Pratt algorithm.
 Conclusion of Unit

C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

Data Structures and Algorithm Analysis in 4 th
1. Mark Allen Weiss Pearson
C++ Edition
Thomas H Cormen,
Charles E. Leiserson, 3 rd
2. Introduction to Algorithms The MIT Press.
Ronald L. Rivest, Edition
Clifford Stein
Reference Book
1. Fundamentals of Computer Algorithms, 2nd Edition, 2009, University Press Pvt. Ltd, Ellis Horowitz, Satraj
Sahani and Raja sekharam.
2. Advanced Data Structures, Oxford University Press, 2018, ReemaThareja, S. Rama Sree.

Online Resources
1. https://www.coursera.org/learn/advanced-data-structures
2. https://ocw.mit.edu/courses/6-851-advanced-data-structures-spring-2012/
3. https://nptel.ac.in/courses/106106133
4. https://www.mooc-list.com/search/node?keys=Advanced+Data+Structures
5. https://freevideolectures.com/course/2279/data-structures-and-algorithms

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 108 of 118

 Code:BCAECA5113 Data Mining and Warehousing 3 Credits [LTP: 3-0-0]

COURSE OUTCOME
Students will be able to:

 Explain the types of the data to be mined and present a general classification of tasks.
 Apply preprocessing methods for any given raw data.
 Extract interesting patterns from large amounts of data.
 Choose and employ suitable data mining algorithms to build analytical applications
 Explain the organization of data in the form of data warehouse

A. OUTLINE OF THE COURSE

Unit No. Title of The Unit Time required for the Unit (Hours)
1. Introduction to Data Mining 07
2. Association Rule Mining 07
3. Classification 08
4. Cluster Analysis 07
5. Data warehousing 07

B. DETAILED SYLLABUS

Unit Unit Details

1. Introduction to Data Mining
 Introduction to Data Mining
 Data Mining Tasks
 Components of Data Mining Algorithms
 Data Mining supporting Techniques
 Major Issues in Data Mining
 Measurement and Data
 Data Preprocessing
 Data sets
 Conclusion of Unit
2. Classification
 Introduction to Classification
 Basic Concepts
 Decision Tree induction
 Bayes Classification Methods
 Rule Based Classification
 Model Evaluation and Selection
 Techniques to Improve Classification Accuracy
 Classification: Advanced concepts
 Bayesian Belief Networks
 Classification by Back Propagation
 Support Vector Machine
 Classification using frequent patterns.
 Conclusion of Unit

3. Cluster Analysis
 Introduction to Cluster Analysis

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 109 of 118

  Basic concepts and Methods
 Partitioning methods
 Hierarchical methods
 Density Based Methods
 Grid Based Methods
 Evaluation of Clustering
 Advanced Cluster Analysis: Probabilistic model based clustering, Clustering High Dimensional Data,
Clustering Graph and Network Data, Clustering with Constraints.
 Conclusion of Unit
4. Association Rule Mining and Visualization
 Introduction to Association Rule Mining
 Large Item sets
 Basic Algorithms
 Parallel and Distributed Algorithms
 Comparing Approaches
 Incremental Rules
 Advanced Association Rule Techniques
 Measuring the Quality of Rules
 Introduction to Visualization
 Visualization of Multidimensional Data
 Diagrams for Multidimensional visualization
 Visual Data Mining
 Data Mining Applications
 Case Study: WEKA.
Conclusion of Unit
5. Data warehousing

 Introduction to Data warehousing

 Data warehousing components
 Multi dimensional data model
 Data warehouse architecture
 Data warehouse implementation
 Mapping the data warehouse to multiprocessor architecture
 OLAP
 Need
 Categorization of OLAP Tools
 Introduction to Data Cube
 Data Cube Technology: Efficient Methods for Data Cube Computation
 Exploration and Discovery in Multidimensional Databases
 Conclusion of Unit

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 110 of 118

 C. RECOMMENDED STUDY MATERIAL

S. No Text Books: Author Edition Publication

Data Mining Concepts and Techniques Jiawei Han and Third Elsevier
1.
Micheline Kamber Edition
Principles of Data Mining David J. Hand, Heikki Latest
2. (Adaptive Computation and Machine Mannila and Padhraic
Learning) Smyth
3. Data Mining: Introductory and Advanced Margaret H Dunham Latest
Topics
Reference Book

1. Insight into Data Mining Theory and Practice, Eastern Economy Edition, Prentice Hall of India, 2006, K.P.
Soman, Shyam Diwakar and V. Ajay
Data Mining: Practical Machine Learning Tools and Techniques, Elsevier, Second Edition, Ian H.Witten and
2.
Eibe Frank.
Data Warehousing, Data Mining & OLAP, Tata McGraw – Hill Edition, 35th Reprint 2016, Alex Berson and
3.
Stephen J.Smith.
Online Resources

1. https://www.javatpoint.com/data-mining
2. https://nptel.ac.in/courses/106105174
3. https://onlinecourses.swayam2.ac.in/cec20_cs12/preview

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 111 of 118

 Code:BULCHU5201 HUMAN VALUES & PROFESSIONAL ETHICS 1 Credit [LTP: 0-0-2]

Course Outcomes:

On successful completion of the course the learners will be able to:

 Explain the importance of human values and learn from others‘ experiences to become the conscious practitioners
of the same.
 Enhance their self-esteem, confidence and assertive behaviour to handle difficult situations with grace, style, and
professionalism
 Distinguish among various levels of professional ethics while developing an apprehension of them as a process in
an organization
 Implement emotional intelligence to achieve set targets and excel in interpersonal as well as intrapersonal
 Demonstrate knowledge of personal beliefs and values and a commitment to continuing personal reflection and
reassessment

UNIT
UNIT NAME Hours
NO.
1 Introduction to Human Values 6
2 Study of Self 4
3 Introduction to Professional Ethics 4
4 Emotional Intelligence 6
5 Life Skills & Value Education 5

LIST OF LABS
1. Human Values: Love & Compassion
2. Truth, Non-Violence, Righteousness
3. Peace, Service, Renunciation (Sacrifice)
4. Self-Esteem: Do's and Don‘ts to develop positive self-esteem
5. Self-Assertiveness: Development of Assertive Personality
6. Ambition & Desire: Self & Body (concepts & differences )
7. Professional Ethics: Personal & Professional Ethics
Emotional Intelligence: Skill Building for Strengthening the Elements of Self-awareness, Self-regulation, Internal
8.
motivation, Empathy, Social skills
9. Governing Ethics & Ethics Dilemma
10. Profession, Professionalism & Professional Risks
11. Professional Accountabilities & Professional Success
12. Life Skills & Value Education

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 112 of 118

Code: BULCHU5202 LEADERSHIP & MANAGEMENT SKILLS 1 Credit [LTP: 0-0-2]

Course Outcomes:

On successful completion of the course the learners will be able to

 Integrate their apprehensions into their leadership skills development process
 Demonstrate knowledge of the working environment impacting business organizations and exhibit an
apprehensions of ethical implications of decisions
 Assess leadership styles and sharpen the managerial skills to communicate effectively and facilitate decision
making in relation with self-management, stress management and conflict management
 Generate a creative thinking, something beyond the obvious answers and solution to a specific problem.
 Explain the significance of trust and team skills, creating new innovative ideas with the help of brainstorming and
learn work etiquettes.

UNIT NO. UNIT NAME Hours

1 Leadership Skills 4
2 Entrepreneurial Skills 4

3 Managerial Skills: Self –Management, Stress Management & Conflict Management 6

4 Creative Thinking & Design Thinking 6

5 Team Building & Confidence Building 5

LIST OF LABS
1. Leadership Skills: Stages of development
2. Leadership Skills I: Attributes of great leaders, decision making, activities to enhance such qualities
3. Leadership Through Biographies
4. Entrepreneurial Skills: Traits & Competencies of an Entrepreneur
5. Managerial Skills: Conflict Management
6. Self-Management: Challenges & Solutions
7. Stress Management : Causes of stress and regulation
8. Creating Business Plans: Problem Identification and Idea Generation
9. Design Thinking: Transforming Challenges into Opportunities
10. Creative Thinking & Analytical Thinking: Presentation
11. Team building: Developing teams and team work
12. Confidence Building : Improving engagement, communicating effectively & activities to facilitate decision making

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 113 of 118

 Code: BCACCA5601 Discipline, VAC, Social Outreach 1 Credit [LTP: 0-0-4]

COURSE OUTCOME:
The objective of Discipline and TEP is to provide students with the opportunities to enhance job fetching skills
and at the same time to cultivate the student‘s personal interests and hobbies while maintaining the good
disciplinary environment in the University. TEP is integrated into the curriculum for holistic development of
students through active participation in various activities falling in Technical and non-technical categories.

Social outreach, Discipline, TEP -V, VAC & Extra Curricular activities shall be evaluated on the basis of its sub
constituent programmes, as a complete one credit course. It shall be counted in calculation of SGPA but it is not a
backlog subject. However, the attendance of these classes shall be recorded and accounted in the total attendance.
Activities included in this category in the Fourth Semester are as follows:
:

Code Activity Hours Credits

Talent Enrichment Programme(TEP)-V
Library / MOOC / Online Certificate Courses 4 1
BCACCA3601
Non Syllabus Project (NSP) / Industry Visit / CRT

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 114 of 118

 Semester VI
Code:BCACCA6501 Project/Internship 11 Credit [LTP: 0-0-22]

Part A
The students will undertake a project as part of their final semester of BCA. The students can do
independent projects or can take up projects in groups of two or more depending on the complexity of
the project. The maximum group size will be four and in case of team projects there should be a clear
delineation of the responsibilities and work done by each project member. The projects must be
approved by the mentor assigned to the student. The mentors will counsel the students for choosing the
topic for the projects and together they will come up with the objectives and the process of the project.
From there, the student takes over and works on the project.
If the student chooses to undertake an industry project, then the topic should be informed to the
mentor, and the student should appear for intermediate valuations. Prior to undertaking this project the
students undergo a bridge course.

Bridge Course:
The bridge course ensures that all the students have the correct prerequisite knowledge before their
industry interface. The purpose of a bridge course is to prepare for a healthy interaction with industry
and to meet their expectations. It would be difficult to establish standards without appropriate
backgrounds and therefore to bridge this gap, students are put through two week mandatory classroom
participation where faculty and other experts will give adequate inputs in application based subjects, IT
and soft skills.

The Project:
Each student will be allotted a Faculty Guide and an Industry Guide during the
internship/project work. Students need to maintain a Project Diary and update the project progress,
work reports in the project diary. Every student must submit a detailed project report as per the
provided template. In the case of team projects, a single copy of these items must be submitted but
each team member will be required to submit an individual report detailing their own contribution to
the project.

Each student/group should be allotted a supervisor and periodic internal review shall be conducted
which is evaluated by panel of examiners.

Project Evaluation Guidelines:

The Project evaluator(s) verify and validate the information presented in the project report. The break-
up of marks would be as follows:
1. Internal Evaluation
2. External Assessment
3. Viva Voce

Internal Evaluation:
Internal Evaluation of project need to evaluate Internal Project work based on the following criteria:
 Project Scope, Objectives and Deliverables
 Research Work, Understanding of concepts
 Output of Results and Proper Documentation
 Interim Reports and Presentations– Twice during the course of the project

The Components of the Interim Reports are given below:

First Interim Report:

 A study on the existing software/app/product in the market
 The proposed software/app/product with the additional features
 The technical requirements
 The proposed work flow scheme - including the work allocation for each of the team
members
 A Presentation

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 115 of 118

 Second Interim Report:
 The refined design and scheme/data-flow
 The Course Progress – The percentage completion
 Plan for the project completion
 A Presentation

External Evaluation:
 The Project evaluator(s) perform the External Assessment based on the following criteria.
 Understanding of the Project Concept
 Delivery Skill
 The Final Project Report
 Originality and Novelty

Part B The Final Project Report Details:

The report should have a excel sheet that documents the work of every project
member
 The project report should be documented in the following format:
1. Acknowledgements
2. Project Synopsis
3. Introduction
4. Existing system and proposed system
5. Project Background
a. Overview
b. Objectives
c. Development Requirements
d. Other Resources
e. Issues that needed to be considered
f . Preparation done
6. Requirements Analysis
7. Design Architecture (Based on your respective Specialization)
8. (Project Oriented Topics)
9. (Project Oriented Topics)
10. Future enhancement
11. Screen shots
12. Summary
13. Appendices
14. References
Part C Viva Voce
Handling questions
 Clarity and Communication Skill

Marking Scheme:
1. Internal Evaluation: 35% of Total Marks
2. External Evaluation: 50% of Total Marks
3. Viva Voce: 15 % of Total Marks

For e.g., If the total mark for the project is 100, then

 Internal Evaluation = 35 marks

The break-up of marks is shown below:-

 Interim Evaluation 1: 10 marks
 Interim Evaluation 2: 10 marks
 Understanding of concepts: 5 marks
 Programming technique: 5 marks
 Execution of code : 5 marks

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 116 of 118

  External Evaluation = 50 marks

The break-up of marks is shown below:-

 Project Report: 15 marks

 Explanation of project working: 10 marks
 Execution of code: 10 marks – (if done in industry, a standalone
 module can be reprogrammed and submitted. Error
 rectification etc can be included by the evaluator)
 Participation in coding: 15 marks
 Viva Voce = 15 marks

The break-up of marks is shown below: -

 Questions related to project: 10 marks

 Questions related to technology: 5 marks
 The Project evaluator(s) verifies and validates the information presented in the project
report.

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 117 of 118

 Code:BCACCA6601 Discipline, VAC & Social Outreach 1 Credit [LTP: 0-0-11]

OVERVIEW AND OBJECTIVES:

 The objective of Discipline and TEP is to provide students with the opportunities to
enhance job fetching skills and at the same time to cultivate the student‘s personal
interests and hobbies while maintaining the good disciplinary environment in the
University. TEP is integrated into the curriculum for holistic development of students
through active participation in various activities falling in Technical and non-technical
categories.

 Discipline and Talent Enrichment Programme (TEP)-VI shall be evaluated on the basis of
its sub constituent programmes, as a complete Two credit course. It shall be counted in
calculation of SGPA but it is not a backlog subject. However, the attendance of these classes
shall be recorded and accounted in the total attendance

**************************Happy Learning********************************

PU/Batch 2022-25/FCE/Syllabus/BCA (AI & DS) Page 118 of 118