| 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 |
| 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 |
This course enables students to create webpages using HTML, CSS, JavaScript and Dreamweaver.
Web Server, Web Client/Browser, understanding how a browser communicates with a Web Server, Internet, Intranet, Extranet, WWW and URL.
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.
Anchor Tag, External Document References, Internal Document References and Image Maps.
Understanding Frames, Creating Frames and Targeting Named Frames.
Style Tag, Link Tag and Types of CSS: Inline, Internal and External CSS.
Attributes of Form Element, Input Elements such as Text, Password, Button, Submit Button, Reset Button, Checkbox, Radio Button, TextArea, Select and Option.
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.
String Object, Math Object and Date Object.
Creating User Defined Objects, Instances and Objects within Objects.
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.
| Paper Code | BCA-DSC-1(Maj)-101P |
|---|---|
| Time Duration | 3 Hours |
| Number of Practical Hours | 60 |
Paper will be set at the time of examination.
Due weight-age may be given to the Practical Notebook and Assignments during evaluation.
| 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 |
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.
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.
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.
Methods of calculating Median in individual, discrete and continuous series.
Partition Values: Quartiles, Quintiles, Hexiles, Septiles, Octiles, Deciles and Percentiles.
Methods of calculating Mode in individual, discrete and continuous series.
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.
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.
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.
| 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 |
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.
Steps in developing a program, Data Flow Diagram, Algorithm Development, Flowchart, Testing and Debugging.
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.
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.
Decision making with IF statement, IF-Else, Nested IF-Else, else-if Clause.
While loop, do-while loop, for loop, nested for loop.
Decision using switch statement and goto statement.
Library Functions, User Defined Functions, Global and Local Variables, Function Declaration, Function Calling and Definition.
Methods of parameter passing, recursion, storage classes in C.
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.
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.
Declaring and Initializing String Variables, Reading and Writing Strings, String Handling Functions: strlen(), strcpy(), strcmp(), strcat().
Declaration of Structures, Structure Initialization, Accessing Structure Members, Arrays of Structures, Nested Structures, Structures with Pointers, Union.
Introduction to Files, Opening and Closing Files, Basic Input and Output Operations on Files.
| Paper Code | BCA-DSC-1(Min)-103P |
|---|---|
| Time Duration | 3 Hours |
| Number of Practical Hours | 60 |
Paper will be set at the time of examination.
Due weight-age may be given to the Practical Notebook and Assignments during evaluation.
| 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 |
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.
Binary, Octal, Decimal and Hexadecimal Number Systems and their conversions.
Binary Addition, Subtraction, Multiplication and Division.
8-Bit Signed Arithmetic, Signed Magnitude, 1’s Complement and 2’s Complement Methods.
Fixed Point and Floating Point Representation.
Types of Codes, BCD, Excess-3, Gray Code, ASCII and EBCDIC.
Error Detecting and Correcting Codes: Parity, Block Parity, Checksum, CRC and Hamming Codes.
Fan In, Fan Out, Propagation Delay, Power Dissipation, Noise Margin, IC Logic Families.
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.
Conversion of Circuits using NAND and NOR Gates only.
Half Adder, Full Adder, Serial and n-bit Parallel Adder, Full Adder using two Half Adders.
Half Subtractor, Full Subtractor, n-bit Full Subtractor using 1’s and 2’s Complement.
Decoder and Encoder.
4x16 and 5x32 Decoder using 2x4 and 3x8 Decoders.
Multiplexer, Demultiplexer and their applications.
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.
SISO, SIPO, PISO, PIPO Registers.
Asynchronous n-bit Counter, Up-Down Counter, Synchronous Counter, Applications and Comparison.
| 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 |
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.
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.
AI Problems, Agents and Environments, Structure of Agents.
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.
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.
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.
| Paper Code | BCA-DSC-2(Maj)-202P |
|---|---|
| Time Duration | 3 Hours |
| Number of Practical Hours | 60 |
Paper will be set at the time of examination.
Due weight-age may be given to the Practical Notebook and Assignments during evaluation.
| 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 |
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.
Introduction to OOP, Difference between OOP and Procedure Oriented Programming.
Concepts of Object, Class, Encapsulation, Abstraction, Polymorphism and Inheritance.
Applications of OOP.
Scope Resolution Operator, Member Dereferencing Operators, Memory Management Operators, Manipulators and Type Cast Operator.
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.
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.
Declaration and Definition of Constructors.
Types of Constructors: Default Constructor, Parameterized Constructor and Copy Constructor.
Destructors: Definition and Uses.
Concept of Operator Overloading, Overloading Unary and Binary Operators.
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.
Definition and Applications of Data Abstraction, Encapsulation and Polymorphism.
Static and Dynamic Polymorphism, Virtual Functions and Pure Virtual Functions.
Definition of Exception Handling, Throwing Mechanism, Catching Mechanism and Rethrowing Exceptions.
Opening and Closing Files, Binary File Operations, Structures and File Operations, Classes and File Operations, Random File Processing.
| Paper Code | BCA-DSC-2(Min)-203P |
|---|---|
| Time Duration | 3 Hours |
| Number of Practical Hours | 60 |
Paper will be set at the time of examination.
Due weight-age may be given to the Practical Notebook and Assignments during evaluation.