hrinfomaths@gmail.com | +91 98721-24534 | +91 98786 24534

Connect with Infomaths.

Follow Us

Popular searches

Notifications

Free demo Classes

🎯 Join Our FREE MCA Entrance Demo Session

Enquiry Now Jun 20, 2026

Admission Open 2027-28

🚀 Admissions Open for MCA Entrance 2027-2028! Join Infomaths and start your journey towards NIMCET, CUET PG, PU MCA, MAH MCA CET & more.

Fill the Form Jun 20, 2026

PU Chandigarh PG Admission Notification 2026

PU Chandigarh PG Admission Notification 2026 | Registration, Important Dates & Fee Details

Learn More Jun 20, 2026

BACHELOR OF COMPUTER APPLICATIONS (B.C.A.)

                 (Under NEP)

Sem Level of Course Course Code Course Title Theory Credits Practical Credits Total Credits
I BCA-DSC-1 (Maj) 101 Introduction to Web Technologies 2 -- 4
I BCA-DSC-1 (Maj) 101P Practical Based on Introduction to Web Technologies -- 2 2
I BCA-DSC-1 (Maj) 102 Fundamentals of Mathematical Statistics 4 -- 4
I BCA-DSC-1 (Min) 103 Problem Solving Through C 2 -- 4
I BCA-DSC-1 (Min) 103P Practical Based on Problem Solving Through C -- 2 2
I CSA-MDC101/201/301 -- E-Commerce 3 -- 3
I AEC-1-101 -- English-1 2 -- 2
I CSA-SEC101/201/301 -- Computer Fundamentals and Personal Computing Software -- 3 3
I PUN-COMPL-1-101 / HCPCOMPL-1-101 -- Punjabi-1 / HCP-1 2 -- 2
I CSA-VAC101/201/301/401 -- Introduction to Blockchain Technology 2 -- 2
I CSA-VAC102/202/302/402 -- Introduction to Computer Hardware 2 -- 2
I CSA-VAC103/203/303/403 -- Digital Empowerment 2 -- 2
I CSA-VAC104/204/304/404 -- Ethics of Artificial Intelligence 2 -- 2


FIRST SEMESTER

Introduction to Web Technologies

Paper Code BCA-DSC-1(Maj)-101
Theory 2
Practical 2
Credits 4
Level L-100
Theory External Marks 45
Theory Internal Marks 05
Number of Theory Hours 30
Practical External Marks 50
Time Duration 3 Hours

Objective

This course enables students to create webpages using HTML, CSS, JavaScript and Dreamweaver.

Learning Outcomes

  • Get familiar with the terms related to World Wide Web.
  • Use front-end website development technologies like HTML and CSS.
  • Know about the basics of JavaScript.
  • Use Dreamweaver for creating web pages.

Note

  • The Question Paper will consist of four units.
  • Examiner will set a total of nine questions comprising two questions from each unit and one compulsory question of short answer type covering the whole syllabus.
  • Students are required to attempt one question from each unit and the compulsory question.
  • All questions carry equal marks unless specified.

UNIT – I

Web Terminology

Web Server, Web Client/Browser, understanding how a browser communicates with a Web Server, Internet, Intranet, Extranet, WWW and URL.

Introduction to HTML

Structure of an HTML program, Paragraph Breaks, Line Breaks, Heading Styles, Drawing Lines, Bold, Italics, Underline and other text effects.

Lists: Unordered Lists, Ordered Lists and Definition Lists.

Adding Images using IMG element with Border, Width, Height, Align and ALT attributes.

Tables: Caption Tag, Width, Border, Cell Padding, Cell Spacing, BGCOLOR, COLSPAN and ROWSPAN attributes.

UNIT – II

Linking Documents

Anchor Tag, External Document References, Internal Document References and Image Maps.

Frames

Understanding Frames, Creating Frames and Targeting Named Frames.

Cascading Style Sheets (CSS)

Style Tag, Link Tag and Types of CSS: Inline, Internal and External CSS.

Forms

Attributes of Form Element, Input Elements such as Text, Password, Button, Submit Button, Reset Button, Checkbox, Radio Button, TextArea, Select and Option.

UNIT – III

JavaScript

Features, Tokens, Data Types, Variables, Operations, Control Constructs, Strings, Arrays, Functions, Core Language Objects, Client Side Objects and Event Handling.

Applications related to client-side form validation.

Other Built-In Objects in JavaScript

String Object, Math Object and Date Object.

User Defined Objects

Creating User Defined Objects, Instances and Objects within Objects.

UNIT – IV

Creating Web Pages using Dreamweaver

Introduction to Dreamweaver, Understanding Workspace Layout, Managing Websites, Creating a Website, Using Dreamweaver Templates, Adding New Web Pages, Text and Page Formatting, Inserting Tables, Lists and Images, Adding Links.

Suggested Reading

Essential Reading

  1. Wanger & Wyke : JavaScript Unleashed, Pearson, Latest Reprint, New Delhi.
  2. Bayross, Ivan : HTML, DHTML, JavaScript, BPB Publications, Latest Reprint.

Further Reading

  1. Joseph Lowery : Adobe Dreamweaver CS6 Bible, Wiley India.
  2. Kogent Learning Solutions Inc : Dreamweaver CS5 in Simple Steps, Wiley India.

Practical Based on Paper – BCA-DSC-1(Maj)-101

Introduction to Web Technologies

Paper Code BCA-DSC-1(Maj)-101P
Time Duration 3 Hours
Number of Practical Hours 60

Note

Paper will be set at the time of examination.

Due weight-age may be given to the Practical Notebook and Assignments during evaluation.

Fundamentals of Mathematical Statistics

Paper Code BCA-DSC-1(Maj)-102
Theory 4
Practical -
Credits 4
Level L-100
Theory External Marks 90
Theory Internal Marks 10
Number of Theory Hours 60
Time Duration 3 Hours

Objective

This course enables students to learn the basic techniques of Statistical Methods. After completing this course, students will be able to solve various financial, scientific and engineering field problems.

Learning Outcomes

  • Understand the basics of data collection and statistical techniques.
  • Use and calculate various measures of central tendency such as mean, median, mode, range and deviation.
  • Understand the basics of correlation, measuring techniques and its types.
  • Gain insight into regression analysis, its types and methods of calculation.

Note

  • The question paper will consist of four units.
  • Examiner will set a total of nine questions comprising two questions from each unit and one compulsory question covering the whole syllabus.
  • Students are required to attempt one question from each unit and the compulsory question.
  • All questions carry equal marks unless specified.
  • Students can use only basic non-programmable calculators.
  • Log tables are allowed and may be provided for computation.

UNIT - I

Basic Statistics

Types of Statistics, Different Statistical Techniques, Steps in Statistical Investigation, Uses and Limitations of Statistics.

Collection of Data: Sources of collecting primary and secondary data, limitations of secondary data, criteria for evaluating secondary data, organization of data, graphs of grouped frequency distribution, tabulation of data and parts of table.

Measures of Central Tendency

Arithmetic Mean: Simple Arithmetic Mean, methods of calculation, Arithmetic Mean in individual series, discrete series and continuous series, Weighted Arithmetic Mean, Combined Arithmetic Mean.

Geometric Mean: Simple Geometric Mean, methods of calculation, Geometric Mean in individual series, discrete series and continuous series, Weighted Geometric Mean, Combined Geometric Mean.

Harmonic Mean: Simple Harmonic Mean, methods of calculation, Harmonic Mean in individual, discrete and continuous series, Weighted Harmonic Mean, Combined Harmonic Mean.

UNIT - II

Median and Partition Values

Methods of calculating Median in individual, discrete and continuous series.

Partition Values: Quartiles, Quintiles, Hexiles, Septiles, Octiles, Deciles and Percentiles.

Mode

Methods of calculating Mode in individual, discrete and continuous series.

Range and Deviation

Computation of Range, Inter Quartile Range, Percentile Range, Mean Deviation, Standard Deviation, Variance, Coefficient of Standard Deviation, Coefficient of Variation, Combined Standard Deviation and correcting incorrect Standard Deviation.

UNIT - III

Correlation Analysis

Definition and types of correlation: Positive, Negative, Simple, Multiple, Partial, Total, Linear and Non-Linear Correlation.

Need of Correlation Analysis, Correlation and Causation, Techniques for Measuring Correlation: Scatter Diagram Method and Graphic Method.

Karl Pearson’s Coefficient of Correlation: Correcting incorrect coefficient, grouped series calculation, Probable Error, Coefficient of Determination.

Spearman’s Rank Correlation: Calculation of rank correlation, difference between Rank Coefficient and Karl Pearson’s coefficient, Coefficient of Concurrent Deviation.

UNIT - IV

Regression Analysis (Linear Regression)

Definition, Difference between Correlation and Regression, Types of Regression Analysis: Simple, Multiple, Partial, Total, Linear and Non-Linear.

Objectives of Regression Analysis, Regression Lines, Regression Equations, Normal Equations and Regression Coefficients.

Properties of Regression Coefficient, Standard Error of Estimate, Regression Coefficient in grouped data, Uses and Limitations of Regression Analysis.

Suggested Readings

  1. Gupta S.C. and Kapoor V.K. : Fundamentals of Mathematical Statistics, Sultan Chand & Sons.
  2. Gupta S.P. : Statistical Methods, S. Chand, 2003.
  3. Affi A.A. : Statistical Analysis: A Computer Oriented Approach, Academic Press Inc., 1979.

Problem Solving Through C

Paper Code BCA-DSC-1(Min)-103
Theory 2
Practical 2
Credits 4
Level L-100
Theory External Marks 45
Theory Internal Marks 05
Number of Theory Hours 30
Practical External Marks 50
Time Duration 3 Hours

Objective

The objective of this course is to make students understand programming language concepts, control structures, data handling, functions and arrays.

After completing this course, students will be able to analyze real-life problems and write programs in C language to solve them effectively.

The main emphasis of this course is on problem-solving skills.

Learning Outcomes

  • Understand the programming concepts.
  • Learn the practical usage of C programming language.
  • Solve programming problems using C language.
  • Gain in-depth knowledge of strings, arrays, functions and file handling.
  • Develop applications based on programming concepts.

Note

  • The Question Paper will consist of four units.
  • Examiner will set a total of nine questions comprising two questions from each unit and one compulsory question covering the whole syllabus.
  • Students are required to attempt one question from each unit and the compulsory question.
  • All questions carry equal marks unless specified.

UNIT - I

Programming Process

Steps in developing a program, Data Flow Diagram, Algorithm Development, Flowchart, Testing and Debugging.

Fundamentals of C Language

History of C, Character Set, Identifiers and Keywords, Constants and Types of Constants, Variables and Data Types.

Rules for constructing integer, real and character constants, and variables.

Operators and Expressions

C Instructions, Arithmetic Operators, Relational Operators, Logical Operators, Assignment Operators, Type Conversion in Assignments, Hierarchy of Operations.

Standard and Formatted Statements, Structure of a C Program, Compilation and Execution.

UNIT - II

Decision Control Structure

Decision making with IF statement, IF-Else, Nested IF-Else, else-if Clause.

Loop Control Structure

While loop, do-while loop, for loop, nested for loop.

Case Control Structure

Decision using switch statement and goto statement.

Functions

Library Functions, User Defined Functions, Global and Local Variables, Function Declaration, Function Calling and Definition.

Methods of parameter passing, recursion, storage classes in C.

UNIT - III

Arrays

Introduction to Arrays, Array Declaration, Accessing and Initializing Values, Single and Two-Dimensional Arrays.

Memory Map of Two-Dimensional Arrays, Passing Array Elements to Functions, Call by Value and Call by Reference.

Arrays of Characters, Insertion and Deletion Operations, Searching Elements in Arrays, Using Matrices in Arrays, Passing Entire Arrays to Functions.

Pointers

Pointer Declaration, Address Operator (&), Indirection Operator (*), Pointer and Arrays, Pointers and Two-Dimensional Arrays, Pointer to an Array.

Passing 2-D Arrays to Functions, Array of Pointers.

UNIT - IV

String Manipulation in C

Declaring and Initializing String Variables, Reading and Writing Strings, String Handling Functions: strlen(), strcpy(), strcmp(), strcat().

Structures and Unions

Declaration of Structures, Structure Initialization, Accessing Structure Members, Arrays of Structures, Nested Structures, Structures with Pointers, Union.

Files in C

Introduction to Files, Opening and Closing Files, Basic Input and Output Operations on Files.

Suggested Readings

  1. Yashavant P. Kanetkar : Let Us C, BPB Publications, New Delhi.
  2. Salaria, R.S. : Test Your Skills in C, Salaria Publications, New Delhi.
  3. C. Balaguruswami : Programming with C Language, Tata McGraw Hill, New Delhi.
  4. Byron S. Gottfried : Programming in C, McGraw Hill Publishers, New York.
  5. M.T. Somashekara : Programming in C, Prentice Hall of India.

Practical Based on Paper – BCA-DSC-1(Min)-103

Problem Solving Through C

Paper Code BCA-DSC-1(Min)-103P
Time Duration 3 Hours
Number of Practical Hours 60

Note

Paper will be set at the time of examination.

Due weight-age may be given to the Practical Notebook and Assignments during evaluation.

Computer Organization

Paper Code BCA-DSC-2(Maj)-201
Theory 4
Practical -
Credits 4
Level L-100
Theory External Marks 90
Theory Internal Marks 10
Number of Theory Hours 60
Time Duration 3 Hours

Objective

This course enables students to understand the working of logic gates, Boolean laws and the basics of digital logic circuits used in computer hardware organization.

The course familiarizes students with the design and implementation of electronic circuits used in arithmetic, logic and shift micro-operations of a microprocessor.

Learning Outcomes

  • Understand number systems, binary arithmetic and computer codes used in digital design.
  • Learn characteristics and working of different logic gates.
  • Design and simplify logic circuits using Boolean algebra and Karnaugh Maps.
  • Demonstrate the working of combinational and sequential circuits used in computer hardware architecture.

Note

  • The Question Paper will consist of four units.
  • Examiner will set a total of nine questions comprising two questions from each unit and one compulsory question covering the whole syllabus.
  • Students are required to attempt one question from each unit and the compulsory question.
  • All questions carry equal marks unless specified.

UNIT - I

Number System and Conversion

Binary, Octal, Decimal and Hexadecimal Number Systems and their conversions.

Binary Arithmetic

Binary Addition, Subtraction, Multiplication and Division.

Signed Arithmetic

8-Bit Signed Arithmetic, Signed Magnitude, 1’s Complement and 2’s Complement Methods.

Information Representation

Fixed Point and Floating Point Representation.

Computer Codes

Types of Codes, BCD, Excess-3, Gray Code, ASCII and EBCDIC.

Error Detecting and Correcting Codes: Parity, Block Parity, Checksum, CRC and Hamming Codes.

UNIT - II

Logic Gates and Characteristics

Fan In, Fan Out, Propagation Delay, Power Dissipation, Noise Margin, IC Logic Families.

Basic Boolean Algebra

Boolean Laws, Duality Principle, DeMorgan’s Theorem, Minterms and Maxterms, Standard Form, Conversion to Canonical Form.

Simplification of Circuit Design using Boolean Expressions and Karnaugh Maps.

Universal Gates

Conversion of Circuits using NAND and NOR Gates only.

UNIT - III

Combinational Circuit Design

Adders

Half Adder, Full Adder, Serial and n-bit Parallel Adder, Full Adder using two Half Adders.

Subtractors

Half Subtractor, Full Subtractor, n-bit Full Subtractor using 1’s and 2’s Complement.

Code Convertors

Decoder and Encoder.

Chip Cascading

4x16 and 5x32 Decoder using 2x4 and 3x8 Decoders.

Multiplexer and Demultiplexer

Multiplexer, Demultiplexer and their applications.

UNIT - IV

Sequential Circuit Design

Flip Flops

Bistable Circuit, SR Flip Flop, Edge Triggered Flip Flop with Preset and Clear, D Type Flip Flop, Propagation Delay, Setup and Hold Time, JK Flip Flop, Avoidance of Race Around Condition in JK Master Slave Flip Flop, Toggle Flip Flop.

Registers and Shift Registers

SISO, SIPO, PISO, PIPO Registers.

Counters

Asynchronous n-bit Counter, Up-Down Counter, Synchronous Counter, Applications and Comparison.

Suggested Readings

Essential Reading

  1. M. Morris Mano : Digital Logic and Computer Design, Pearson India Education Services Pvt. Ltd., 2016.

Further Reading

  1. F. J. Hill and G. R. Peterson : Introduction to Switching Theory and Logic Design, John Wiley & Sons Inc., 2009.
  2. Thomas L. Floyd : Digital Fundamentals – A Systems Approach, Pearson International, 2013.

Introduction to Artificial Intelligence and Data Science

Paper Code BCA-DSC-2(Maj)-202
Theory 2
Practical 2
Credits 4
Level L-100
Theory External Marks 45
Theory Internal Marks 05
Number of Theory Hours 30
Practical External Marks 50
Time Duration 3 Hours

Objective

This course helps students understand the basics of Artificial Intelligence and Data Science.

It also enables students to analyze, visualize and summarize data using spreadsheet software.

Learning Outcomes

  • Understand the basics of Artificial Intelligence and Data Science.
  • Analyze data using spreadsheet software.
  • Visualize, search and summarize data using spreadsheets.

Note

  • The Question Paper will consist of four units.
  • Examiner will set a total of nine questions comprising two questions from each unit and one compulsory question covering the whole syllabus.
  • Students are required to attempt one question from each unit and the compulsory question.
  • All questions carry equal marks unless specified.

UNIT - I

Introduction to Artificial Intelligence (AI)

Definition of AI, Types of AI, History of AI.

Applications of AI in Healthcare, Education and Agriculture.

Introduction to key technologies of AI: Machine Learning, Deep Learning, Natural Language Processing (NLP), Computer Vision and Robotics.

Ethical Issues and Future of AI.

Problem Solving

AI Problems, Agents and Environments, Structure of Agents.

UNIT - II

Data Science

Introduction to Data Science, Evolution and Need for Data Science.

Types of Data and Applications of Data Science in Various Fields.

Data Science Life Cycle and Project Stages.

Data Collection and Data Pre-Processing: Data Cleaning, Data Integration, Data Transformation, Data Reduction and Data Discretization.

Data Storage and Management, Careers in Data Science.

UNIT - III

Managing Data with Spreadsheet Software

Creating a Database, Sorting and Filtering Data, Custom Sorting and Advanced Filtering.

Defining and Grouping Database Ranges, Applying Data Tools such as Data Validation, Removing Duplicates, Text to Columns and Flash Fill.

Managing Data using Mathematical, Statistical, Trigonometric, String/Text, Date and Time, Logical and Database Functions.

Nested Functions.

UNIT - IV

Data Visualization, Searching and Summarizing

Understanding Chart Types, Creating Embedded Charts, Formatting Charts, Changing Chart Types, Adding Titles, Legends and Gridlines, Printing Charts.

Searching Data using HLOOKUP and VLOOKUP.

Summarizing Data using Pivot Tables.

Analyzing Data using What-if Analysis: Goal Seek, Scenario Manager and Data Table.

Suggested Readings

  1. D. Venu Gopal : Data Science and Artificial Intelligence for Beginners.
  2. Sudhir Reddy Navar : Introduction to AI/ML and Data Science.
  3. C. Raju : Data Science: A Beginner's Guide.
  4. Sharma, A. : Essentials of AI and Soft Computing, PHI Learning, 2024.
  5. Kevin Knight, Elaine Rich and B. Nair : Artificial Intelligence, TMH.
  6. Manish Nigam : Data Analysis with Excel, BPB Publications.
  7. Mali, L. : Libre Office 5.1 Writer, Calc: Math Formula Book – Vol 1, Notion Press.
  8. L. Winston Wayne : Microsoft Excel: Data Analysis & Business Model.

Practical Based on Paper – BCA-DSC-2(Maj)-202

Introduction to Artificial Intelligence and Data Science

Paper Code BCA-DSC-2(Maj)-202P
Time Duration 3 Hours
Number of Practical Hours 60

Note

Paper will be set at the time of examination.

Due weight-age may be given to the Practical Notebook and Assignments during evaluation.



Object Oriented Programming using C++

Paper Code BCA-DSC-2(Min)-203
Theory 2
Practical 2
Credits 4
Level L-100
Theory External Marks 45
Theory Internal Marks 05
Number of Theory Hours 30
Practical External Marks 50
Time Duration 3 Hours

Objectives

By the end of this course, students will be able to write C++ programs using advanced language features, utilize object-oriented programming techniques, use the standard C++ library and explore advanced C++ concepts.

Learning Outcomes

  • Understand the features and importance of Object-Oriented Programming concepts.
  • Use inheritance, polymorphism and dynamic binding to develop programs.
  • Gain better understanding of reusable components using C++ programming.
  • Develop large software applications using modular and bottom-up approaches.

Note

  • The Question Paper will consist of four units.
  • Examiner will set a total of nine questions comprising two questions from each unit and one compulsory question covering the whole syllabus.
  • Students are required to attempt one question from each unit and the compulsory question.
  • All questions carry equal marks unless specified.

UNIT - I

Principles of Object-Oriented Programming

Introduction to OOP, Difference between OOP and Procedure Oriented Programming.

Concepts of Object, Class, Encapsulation, Abstraction, Polymorphism and Inheritance.

Applications of OOP.

Special Operators

Scope Resolution Operator, Member Dereferencing Operators, Memory Management Operators, Manipulators and Type Cast Operator.

Structure of C++ Program and Classes

Class Declaration, Data Members, Member Functions, Private and Public Members.

Creating Objects, Accessing Class Data Members and Member Functions.

Member Function Definition inside and outside class declaration.

UNIT - II

Functions and Objects

Friend Function, Inline Function, Static Data Members, Function Overloading, Arrays within a Class, Arrays of Objects.

Objects as Function Arguments: Pass by Value, Pass by Reference, Pointers to Objects.

Constructors and Destructors

Declaration and Definition of Constructors.

Types of Constructors: Default Constructor, Parameterized Constructor and Copy Constructor.

Destructors: Definition and Uses.

Operator Overloading

Concept of Operator Overloading, Overloading Unary and Binary Operators.

UNIT - III

Inheritance

Concept of Inheritance, Base Class, Derived Class, Visibility Modes: Public, Private and Protected.

Types of Inheritance: Single Inheritance, Multilevel Inheritance, Multiple Inheritance, Hierarchical Inheritance, Hybrid Inheritance and Nesting of Classes.

Ambiguity in Multiple Inheritance and Protected Members.

Polymorphism

Definition and Applications of Data Abstraction, Encapsulation and Polymorphism.

Static and Dynamic Polymorphism, Virtual Functions and Pure Virtual Functions.

UNIT - IV

Exception Handling

Definition of Exception Handling, Throwing Mechanism, Catching Mechanism and Rethrowing Exceptions.

File Processing

Opening and Closing Files, Binary File Operations, Structures and File Operations, Classes and File Operations, Random File Processing.

Suggested Readings

  1. E. Balaguruswamy : Object Oriented Programming with C++, TMH, 2008.
  2. Bjarne Stroustrup : The C++ Programming Language, Addison-Wesley Publishing Company, 2009.
  3. Robert Lafore : Object Oriented Programming in Turbo C++, Galgotia Publications, 2003.
  4. Salaria, R. S. : Object Oriented Programming Using C++, Khanna Book Publishing Co. (P.) Ltd., New Delhi.

Practical Based on Paper – BCA-DSC-2(Min)-203

Paper Code BCA-DSC-2(Min)-203P
Time Duration 3 Hours
Number of Practical Hours 60

Note

Paper will be set at the time of examination.

Due weight-age may be given to the Practical Notebook and Assignments during evaluation.