Chaudhary Charan Singh University (CCSU), Meerut conducts a standardized 3-Year (6 Semesters) Bachelor of Computer Applications (BCA) academic program. This comprehensive syllabus guide details every subject across all 6 semesters, complete with Unit-by-Unit topics (Units I to V), university course codes, evaluation marks schemes (External Theory 75M + Internal 25M; Practical 50M), and authoritative textbook recommendations.
Degree Breakdown: 6 Semesters · 30 Theory Papers · 3600 Total Marks
Each semester carries 600 Marks (5 Theory papers × 100 Marks = 500 Marks, plus 2 Practical Lab courses × 50 Marks = 100 Marks). Theory papers consist of 75 Marks External University Examination (3 Hours) and 25 Marks Continuous Internal Assessment (Tests, Assignments & Attendance). Practical papers carry 50 Marks evaluated through code execution and external viva-voce.
CCSU BCA 1st Semester Detailed Syllabus
Open 1st Sem Master Hub →Foundational semester establishing core principles in differential calculus, procedural C programming, computer hardware architecture, managerial functions, and professional business correspondence.
| Code | Course Title | Type | External | Internal | Total | Solved Solution Bank |
|---|---|---|---|---|---|---|
| BCA-101 | Mathematics - I | Theory | 75 Marks | 25 Marks | 100 Marks | Solved PYQs → |
| BCA-102 | Programming Principle & Algorithm | Theory | 75 Marks | 25 Marks | 100 Marks | Solved PYQs → |
| BCA-103 | Computer Fundamentals & Office Automation | Theory | 75 Marks | 25 Marks | 100 Marks | Solved PYQs → |
| BCA-104 | Principles of Management | Theory | 75 Marks | 25 Marks | 100 Marks | Solved PYQs → |
| BCA-105 / 106 | Business Communication | Theory | 75 Marks | 25 Marks | 100 Marks | Solved PYQs → |
| BCA-105 (Result) | Computer Practical: Office Automation Lab | Practical | 50 Marks | — | 50 Marks | Lab Viva (50M) |
| BCA-107 (Result) | Computer Practical: Programming Principle & Algorithm ('C') | Practical | 50 Marks | — | 50 Marks | Lab Viva (50M) |
BCA-101: Mathematics - I
- Unit I (Determinants & Matrices): Definition and properties of determinants, Cramer's rule; Types of matrices, Elementary row operations, Echelon form, Rank of matrix, Consistency and solution of system of linear equations ($AX = B$), Eigenvalues and Eigenvectors, Cayley-Hamilton theorem and inverse computation.
- Unit II (Differential Calculus): Concept of limits, continuity, differentiability; Rolle's theorem, Lagrange's and Cauchy's Mean Value theorems with geometric interpretations, Taylor's and Maclaurin's series with Lagrange's form of remainder.
- Unit III (Successive & Partial Differentiation): $n^{\text{th}}$ order derivatives of standard functions, Leibnitz theorem for product differentiation; Functions of two variables, Partial derivatives, Euler's theorem for homogeneous functions, Total differential, Jacobians and their properties.
- Unit IV (Integral Calculus): Integration by substitution, partial fractions, and by parts; Definite integrals and fundamental properties; Beta and Gamma functions and relationships; Reduction formulas for $\int \sin^n x dx$, $\int \cos^n x dx$, $\int \tan^n x dx$; Application to areas under curves.
- Unit V (Vector Algebra): Scalar and vector products of two and three vectors, Scalar triple product, Vector triple product, Differentiation of vectors, Gradient of scalar field, Divergence and Curl of vector fields with physical interpretations.
- Standard Recommended Books: Higher Engineering Mathematics by Dr. B.S. Grewal (Khanna) · Differential Calculus by Shanti Narayan (S. Chand).
BCA-102: Programming Principle & Algorithm
- Unit I (Problem Solving Foundations): Concept of problem solving, Problem definition, Analysis and Design; Algorithm representation, Characteristics of an algorithm, Flowcharts (standard symbols), Pseudo-code, Decision tables, Structured programming principles.
- Unit II (Overview of C Language): History and features of C, Structure of C program, Compilation and execution cycle; C Tokens: Keywords, Identifiers, Constants, Variables; Data types (Primitive and User-defined), Format specifiers; Operators: Arithmetic, Relational, Logical, Assignment, Increment/Decrement (prefix vs postfix), Bitwise, Conditional; Operator precedence and associativity.
- Unit III (Control Flow & Decision Making): Branching statements: simple if, if-else, nested if-else, else-if ladder, switch-case; Looping constructs: while loop, do-while loop, for loop; Jump statements: break, continue, goto; Nesting of loops and pattern printing.
- Unit IV (Arrays & Strings): Single-dimensional arrays: Declaration, initialization, memory mapping, bounds checking; Multi-dimensional arrays: 2D arrays, Matrix addition, multiplication, transpose; Character arrays and Strings, String manipulation library functions (
strlen,strcpy,strcat,strcmp,strrev), String algorithms without library functions. - Unit V (Functions, Storage Classes & Pointers Basics): Modularity, User-defined functions, Function prototype, Definition, Call by value vs Call by reference; Recursion: Base condition, Factorial, Fibonacci, Tower of Hanoi; Storage classes: auto, register, static, extern (scope and lifetime); Introduction to pointers, Address-of (&) and dereference (*) operators.
- Standard Recommended Books: Programming in ANSI C by E. Balagurusamy (McGraw Hill) · Let Us C by Yashavant Kanetkar (BPB).
BCA-103: Computer Fundamentals & Office Automation
- Unit I (Digital Computer Basics): Introduction to computers, Classification (Micro, Mini, Mainframe, Supercomputer); Generations of computers; Von Neumann architecture block diagram: CPU (ALU, Control Unit), Primary and Secondary memory, Input/Output units, Bus architecture.
- Unit II (Number Systems & Binary Arithmetic): Positional number systems: Decimal, Binary, Octal, Hexadecimal; Inter-conversion rules; Binary addition, subtraction, multiplication, division; Representation of signed numbers: Sign-magnitude, 1's complement, 2's complement subtraction; Binary codes: BCD, ASCII, EBCDIC, Gray code.
- Unit III (Software & Operating Systems): System software vs Application software; Language translators: Assembler, Compiler, Interpreter; Operating system roles and functions; Types of OS: Batch, Multi-user, Time-sharing, Real-time; MS-DOS internal and external commands, Windows GUI elements.
- Unit IV (Office Automation: Word & Excel): MS-Word: Document creation, formatting, tables, header/footer, mail merge, macros; MS-Excel: Worksheets, formulas, relative vs absolute cell referencing, mathematical and statistical functions (SUM, AVERAGE, IF, VLOOKUP), chart generation, pivot tables.
- Unit V (Presentation & Internet Concepts): MS-PowerPoint: Slide creation, layout, design templates, transitions, animations; Internet basics: History, TCP/IP, IP addressing, DNS, Web browsers, Search engines, E-mail protocols (SMTP, POP3, IMAP), FTP.
- Standard Recommended Books: Computer Fundamentals by P.K. Sinha & Priti Sinha (BPB) · Fundamentals of Computers by V. Rajaraman (PHI).
BCA-104: Principles of Management
- Unit I (Nature & Scope of Management): Meaning, definition, and importance of management; Management as an Art, Science, and Profession; Levels of management and managerial skills; Evolution of management thought: Scientific Management (F.W. Taylor), Administrative Theory (Henri Fayol's 14 principles), Hawthorne experiments.
- Unit II (Planning & Decision Making): Meaning, characteristics, and importance of planning; Planning process; Types of plans: Policies, Procedures, Strategies, Budgets; Management by Objectives (MBO); Decision making process, conditions of certainty, risk, and uncertainty.
- Unit III (Organizing & Staffing): Concept, process, and principles of organizing; Organizational structures: Line, Functional, Line & Staff, Matrix; Span of control, Delegation of authority, Centralization vs Decentralization; Staffing: Recruitment sources, Selection procedure, Training methods.
- Unit IV (Directing & Leadership): Elements of directing; Motivation theories: Maslow's Need Hierarchy, Herzberg's Two-Factor Theory, McGregor's Theory X and Y; Leadership styles: Autocratic, Democratic, Laissez-faire; Blake & Mouton Managerial Grid; Communication process and barriers.
- Unit V (Controlling & Modern Trends): Meaning, process, and prerequisites of effective control; Traditional control techniques: Budgetary control; Modern control techniques: PERT/CPM, Balanced Scorecard, Total Quality Management (TQM).
- Standard Recommended Books: Principles of Management by P.C. Tripathi & P.N. Reddy (McGraw Hill) · Management: Tasks, Responsibilities, Practices by Peter F. Drucker.
BCA-105 / BCA-106: Business Communication
- Unit I (Communication Fundamentals): Definition, communication cycle, objectives and functions of business communication; The 7 C's of effective communication (Completeness, Conciseness, Consideration, Concreteness, Clarity, Courtesy, Correctness); Internal and external communication channels; Physical, psychological, and linguistic barriers.
- Unit II (Oral & Non-Verbal Communication): Oral presentation skills, Public speaking, Active listening principles, Non-verbal communication: Kinesics (body language, facial expressions), Proxemics (spatial distance), Paralanguage (voice tone, pitch), Haptics; Conducting and participating in business meetings, Group discussions, and Personal interviews.
- Unit III (Business Correspondence): Principles of business letter writing; Layout and structure of formal letters; Routine business letters: Enquiries and Quotations, Orders and Acknowledgments, Complaint and Adjustment letters, Collection letters; Circulars, Office Memorandums, and Notices.
- Unit IV (Report Writing & Executive Summaries): Meaning and significance of business reports; Classification of reports (Informational, Analytical, Statutory); Structure and components of formal reports (Title page, Table of contents, Executive summary, Body, Recommendations, Bibliography); Visual aids in reporting.
- Unit V (Employment Communication): Writing winning Resumes and Curriculum Vitae (Chronological vs Functional); Writing persuasive Cover Letters and Job Applications; Professional follow-up emails; Workplace etiquette in the digital era.
- Standard Recommended Books: Business Communication by K.K. Sinha (Galgotia) · Effective Technical Communication by M. Ashraf Rizvi (McGraw Hill).
CCSU BCA 2nd Semester Detailed Syllabus
Open 2nd Sem Hub →Covers discrete mathematics, advanced procedural C programming, digital logic gates and hardware organization, organizational psychology, and double-entry bookkeeping.
| Code | Course Title | Type | External | Internal | Total | Curriculum Guide |
|---|---|---|---|---|---|---|
| BCA-201 | Mathematics - II (Discrete Mathematics) | Theory | 75 Marks | 25 Marks | 100 Marks | Unit Guide → |
| BCA-202 | C-Programming (Advanced Concepts) | Theory | 75 Marks | 25 Marks | 100 Marks | Live Notes → |
| BCA-203 | Organization Behavior | Theory | 75 Marks | 25 Marks | 100 Marks | Unit Guide → |
| BCA-204 | Digital Electronics & Computer Organization | Theory | 75 Marks | 25 Marks | 100 Marks | Live Notes → |
| BCA-205 | Financial Accounting & Management | Theory | 75 Marks | 25 Marks | 100 Marks | Unit Guide → |
| BCA-206 | Computer Practical: Advanced 'C' Lab | Practical | 50 Marks | — | 50 Marks | Lab Viva (50M) |
BCA-201: Mathematics - II (Discrete Mathematics)
- Unit I (Sets, Relations & Posets): Review of set operations, Power sets, Cartesian products; Relations, Equivalence relations, Equivalence classes, Partitions of sets; Partially ordered sets (Posets), Chains and anti-chains, Hasse diagrams, Maximal, minimal, greatest, and least elements.
- Unit II (Functions & Pigeonhole Principle): Injective, Surjective, Bijective mappings, Inverse functions, Composition of functions; Mathematical induction (weak and strong); Pigeonhole principle, Generalized pigeonhole principle and applications in combinatorics.
- Unit III (Propositional & Predicate Logic): Propositions, Truth tables, Connectives, Tautologies, Contradictions, Logical equivalences; Rules of inference; Disjunctive Normal Form (DNF) and Conjunctive Normal Form (CNF); Predicate logic, Universal and existential quantifiers.
- Unit IV (Lattices & Boolean Algebra): Lattices as algebraic systems and posets, Bounded lattices, Distributive and Complemented lattices; Boolean algebras, Boolean expressions, Dual of a Boolean expression; Karnaugh maps minimization up to 4 variables.
- Unit V (Graph Theory & Trees): Basic graph terminology, Directed and Undirected graphs, Paths, Cycles, Eulerian and Hamiltonian paths/circuits; Planar graphs, Euler's formula; Trees, Rooted trees, Spanning trees, Minimal spanning trees: Kruskal's and Prim's algorithms.
- Standard Recommended Books: Discrete Mathematics and its Applications by Kenneth H. Rosen (McGraw Hill) · Discrete Mathematical Structures by Kolman, Busby & Ross.
BCA-202: Advanced C-Programming
- Unit I (Pointers & Memory Allocation): Pointer variable definition, Pointer arithmetic, Pointers and 1D/2D arrays, Pointer to pointer; Dynamic memory allocation functions:
malloc(),calloc(),realloc(),free(); Memory leak detection; Dangling pointers and void pointers. - Unit II (Structures & Unions): Structure declaration, initialization, accessing structure members using dot (.) and arrow (->) operators; Nested structures, Array of structures; Passing structures to functions; Self-referential structures; Unions vs Structures, Memory layout, Bit-fields.
- Unit III (File Management in C): Streams and file pointers; File opening modes ("r", "w", "a", "r+", "w+", "rb", "wb"); Character I/O (
fgetc,fputc), String I/O (fgets,fputs), Formatted I/O (fprintf,fscanf); Record I/O:fread()andfwrite(); Random file access:fseek(),ftell(),rewind(). - Unit IV (Preprocessor Directives & Macros): Macro definition, Simple and parameterized macros, Macro vs Inline function; File inclusion (
#include); Conditional compilation:#ifdef,#ifndef,#endif,#else,#elif; Miscellaneous directives:#pragma,#undef,#error. - Unit V (Advanced Concepts): Command line arguments (
int argc, char *argv[]); Pointers to functions and callback functions; Enumerated data types (enum); Bitwise operators (&,|,^,~,<<,>>) and bit masking. - Standard Recommended Books: Let Us C by Yashavant Kanetkar (BPB) · The C Programming Language by Brian W. Kernighan & Dennis M. Ritchie.
BCA-204: Digital Electronics & Computer Organization
- Unit I (Logic Gates & Boolean Simplification): Fundamental gates (AND, OR, NOT), Universal gates (NAND, NOR), Exclusive-OR (XOR, XNOR); Boolean algebra postulates, De Morgan's theorems; Canonical Sum of Products (SOP) and Product of Sums (POS); Karnaugh Map (K-Map) minimization up to 5 variables with Don't Care conditions.
- Unit II (Combinational Logic Circuits): Half Adder, Full Adder, Half Subtractor, Full Subtractor, 4-bit Binary Parallel Adder/Subtractor; Multiplexers (2:1, 4:1, 8:1) and Demultiplexers; Encoders and Priority Encoders; Decoders (2:4, 3:8) and BCD-to-7-segment decoders.
- Unit III (Sequential Logic Circuits): Latches vs Flip-Flops; SR Flip-Flop, Clocked SR, JK Flip-Flop, Race-around condition and Master-Slave JK Flip-Flop; D Flip-Flop and T Flip-Flop; Characteristic tables, Characteristic equations, and Excitation tables.
- Unit IV (Registers & Counters): Registers: Serial-In Serial-Out (SISO), Serial-In Parallel-Out (SIPO), Parallel-In Serial-Out (PISO), Parallel-In Parallel-Out (PIPO); Bidirectional and Universal shift registers; Counters: Asynchronous (Ripple) counter (Mod-8, Mod-10 Decade counter), Synchronous binary counters, Ring counter, Johnson counter.
- Unit V (Memory Organization): Primary memory classification: RAM (SRAM vs DRAM cell design), ROM (PROM, EPROM, EEPROM, Flash); Memory address mapping and decoding; Memory hierarchy: Cache memory concepts, Associative mapping.
- Standard Recommended Books: Digital Logic and Computer Design by M. Morris Mano (Pearson) · Digital Principles and Applications by Malvino & Leach.
BCA-203: Organization Behavior
- Unit I (Introduction to OB): Definition, nature, scope, and objectives of OB; Contributing disciplines to OB (Psychology, Sociology, Anthropology); Models of OB (Autocratic, Custodial, Supportive, Collegial, System); Challenges in modern corporate environments.
- Unit II (Individual Dimensions): Personality determinants, Big Five personality traits, Myers-Briggs Type Indicator (MBTI); Perception process, Factors influencing perception, Attribution theory, Perceptual errors (Halo effect, Stereotyping); Attitude formation and cognitive dissonance.
- Unit III (Motivation & Work Stress): Motivation theories: Maslow, Herzberg, McClelland's acquired needs, Vroom's Expectancy theory; Work stress: Sources of stress, Burnout symptoms, Individual and organizational stress management techniques.
- Unit IV (Group Dynamics & Leadership): Group development stages (Forming, Storming, Norming, Performing, Adjourning); Group cohesiveness and groupthink; Leadership theories: Trait theory, Behavioral styles, Fiedler's Contingency model; Conflict management styles (Thomas-Kilmann model).
- Unit V (Organizational Change & Culture): Nature of organizational change, Forces for change, Resistance to change, Lewin's 3-stage change model (Unfreezing, Changing, Refreezing); Organizational culture dimensions and sustaining workplace values.
- Standard Recommended Books: Organizational Behavior by Stephen P. Robbins (Pearson) · Organizational Behavior by Fred Luthans (McGraw Hill).
BCA-205: Financial Accounting & Management
- Unit I (Accounting Principles & Standards): Meaning, definition, and scope of accounting; Objectives of financial accounting; Accounting concepts and conventions: Business entity, Money measurement, Going concern, Cost concept, Dual aspect, Accrual concept; Overview of Accounting Standards (AS).
- Unit II (Journal, Ledger & Trial Balance): Double-entry bookkeeping system; Classification of accounts (Personal, Real, Nominal) and golden rules of debit and credit; Journalizing transactions; Ledger posting and balancing accounts; Preparation of Trial Balance and rectification of errors.
- Unit III (Final Accounts Preparation): Manufacturing Account, Trading Account, Profit & Loss Account, and Balance Sheet; Accounting adjustments: Closing stock, Outstanding expenses, Prepaid expenses, Accrued income, Depreciation, Provision for bad and doubtful debts.
- Unit IV (Financial Statement Analysis & Ratios): Meaning and tools of financial analysis; Ratio Analysis: Liquidity ratios (Current ratio, Quick ratio), Solvency ratios (Debt-to-Equity, Proprietary ratio), Profitability ratios (Gross profit, Net profit, Return on Capital Employed), Turnover ratios (Stock turnover, Debtors turnover).
- Unit V (Working Capital & Budgeting): Meaning and significance of working capital; Operating cycle concept; Factors determining working capital requirements; Basics of Cash Budget and Break-even Analysis (Cost-Volume-Profit analysis).
- Standard Recommended Books: Financial Accounting for Management by Dr. S.N. Maheshwari (Vikas) · Advanced Accountancy by R.L. Gupta & M. Radhaswamy.
CCSU BCA 3rd Semester Detailed Syllabus
Open 3rd Sem Master Hub →Core computer science engineering curriculum: Object-Oriented Programming (C++), complex non-linear Data Structures, Computer Architecture (8085/RTL), Managerial Economics, and Elements of Statistics.
| Code | Course Title | Type | External | Internal | Total | Solved Solution Bank |
|---|---|---|---|---|---|---|
| BCA-301 | OOP with C++ | Theory | 75 Marks | 25 Marks | 100 Marks | Solved PYQs → |
| BCA-302 | Data Structure Using C & C++ | Theory | 75 Marks | 25 Marks | 100 Marks | Solved PYQs → |
| BCA-303 | Computer Architecture & Assembly Language | Theory | 75 Marks | 25 Marks | 100 Marks | Solved PYQs → |
| BCA-304 | Business Economics | Theory | 75 Marks | 25 Marks | 100 Marks | Solved PYQs → |
| BCA-305 | Elements of Statistics | Theory | 75 Marks | 25 Marks | 100 Marks | Solved PYQs → |
| BCA-306P | Computer Practical: OOPS Lab (C++) | Practical | 50 Marks | — | 50 Marks | Lab Viva (50M) |
| BCA-307P | Computer Practical: Data Structures Lab | Practical | 50 Marks | — | 50 Marks | Lab Viva (50M) |
BCA-301: Object Oriented Programming with C++
- Unit I (OOP Paradigms & Language Features): Limitations of structured programming; Core OOP concepts: Objects, Classes, Data abstraction, Encapsulation, Inheritance, Polymorphism, Dynamic binding, Message passing; C++ tokens, Reference variables, Function prototyping, Call-by-reference, Inline functions, Default function arguments, Function overloading.
- Unit II (Classes, Objects & Methods): Specifying classes, Defining member functions inside and outside class; Memory allocation for objects, Static data members and static member functions; Arrays of objects; Objects as function arguments; Friend functions and Friend classes; Returning objects.
- Unit III (Constructors & Operator Overloading): Constructors concept, Default constructor, Parameterized constructors, Multiple constructors in a class, Constructors with default arguments, Dynamic initialization of objects, Copy constructor, Dynamic constructors, Destructors order; Operator Overloading: Overloading unary operators, Overloading binary operators using member functions and friend functions, Data conversion (basic to class, class to basic, class to class).
- Unit IV (Inheritance & Dynamic Polymorphism): Types of inheritance: Single, Multilevel, Multiple, Hierarchical, Hybrid inheritance; Ambiguity in multiple inheritance, Virtual Base Class (Diamond problem resolution); Abstract classes; Pointers to derived classes,
thispointer, Virtual functions, Pure virtual functions, Early vs Late binding, Internal mechanism of Virtual Method Table (VTABLE) and Virtual Table Pointer (VPTR). - Unit V (Templates, Exception Handling & Files): Generic programming: Function templates with multiple parameters, Class templates; Exception handling model:
try,catch, andthrowblocks, Multiple catch statements, Catch-all handler, Re-throwing exceptions; File streams:ifstream,ofstream,fstream, File open modes, Binary file reading and writing withread()andwrite(). - Standard Recommended Books: Object-Oriented Programming with C++ by E. Balagurusamy (McGraw Hill) · C++: The Complete Reference by Herbert Schildt.
BCA-302: Data Structure Using C & C++
- Unit I (Linear Arrays & Algorithm Analysis): Data structures classification (Primitive, Non-primitive, Linear, Non-linear); Asymptotic notation: Big-O, Omega ($\Omega$), Theta ($\Theta$) notation; Single-dimensional arrays, Address calculation in 1D array; Two-dimensional arrays, Row-Major and Column-Major order address calculation formulas; Sparse Matrices and 3-tuple triplet representation.
- Unit II (Stacks & Queues): Stack Abstract Data Type (ADT), Push and Pop operations, Array implementation, Stack overflow and underflow; Applications of Stack: Polish notation, Infix to Postfix conversion algorithm, Evaluation of Postfix expressions, Recursion handling; Queue ADT, Enqueue and Dequeue operations, Linear Queue limitations, Circular Queue implementation, Deque (Double Ended Queue), Priority Queues.
- Unit III (Linked Lists): Dynamic memory allocation vs arrays; Singly Linked List: Node structure, Insertion at beginning, end, and specific position, Deletion of nodes, Search and traversal; Doubly Linked List: Insertion and deletion operations; Circular Linked List; Polynomial representation and addition using linked lists.
- Unit IV (Trees & Binary Search Trees): Non-linear data structures; Tree terminology (Root, Node, Degree, Depth, Height); Binary Trees, Properties of binary trees, Complete and Full binary trees; Binary Tree traversals: Preorder, Inorder, Postorder (recursive and non-recursive); Binary Search Tree (BST): Insertion, Deletion cases (leaf node, one child, two children), Searching in BST; AVL Trees: Balance factor, Rotations (LL, RR, LR, RL); B-Trees basics.
- Unit V (Graphs, Sorting & Hashing): Graph definitions and representations: Adjacency Matrix and Adjacency Lists; Graph Traversals: Breadth First Search (BFS) and Depth First Search (DFS); Sorting algorithms: Bubble Sort, Insertion Sort, Selection Sort, Quick Sort, Merge Sort, Heap Sort (Time & Space complexities); Hashing: Hash functions, Collision resolution techniques (Chaining, Linear Probing, Quadratic Probing).
- Standard Recommended Books: Data Structures (Schaum's Outlines) by Seymour Lipschutz (McGraw Hill) · Data Structures Using C and C++ by Tanenbaum, Langsam & Augenstein.
BCA-303: Computer Architecture & Assembly Language
- Unit I (Register Transfer & Microoperations): Register Transfer Language (RTL); Inter-register transfer, Bus and memory transfers, Three-state bus buffers; Arithmetic microoperations: Binary adder, Subtractor, Adder-Subtractor circuit, Arithmetic logic shift unit (ALSU); Logic microoperations (16 logic operations); Shift microoperations (Logical, Circular, Arithmetic shifts).
- Unit II (Basic Computer Organization & Instruction Cycle): Instruction codes, Computer registers (AR, PC, DR, AC, IR, TR, INPR, OUTR); Common bus system; Computer instructions: Memory-reference, Register-reference, Input-output instructions; Timing and Control unit; Instruction Cycle phases: Fetch, Decode, Read Effective Address, Execute; Interrupt cycle.
- Unit III (Central Processing Unit & Microprocessor 8085): General register organization, Stack organization (Register stack and Memory stack); Reverse Polish Notation (RPN); Instruction formats: Three-address, Two-address, One-address (Accumulator), Zero-address (Stack) instructions; Addressing Modes: Immediate, Direct, Indirect, Register, Register Indirect, Relative, Indexed, Base Register addressing modes; 8085 Microprocessor architecture, Pin diagram, Flag register, Instruction set.
- Unit IV (Computer Arithmetic & Algorithms): Addition and Subtraction of signed magnitude numbers and 2's complement numbers; Booth's signed-2's complement multiplication algorithm; Restoring and Non-restoring division algorithms; Floating-point arithmetic operations.
- Unit V (Input-Output & Memory Hierarchy): Peripheral devices, I/O Interface, Asynchronous data transfer: Strobe control and Handshaking; Modes of data transfer: Programmed I/O, Interrupt-initiated I/O, Direct Memory Access (DMA): DMA Controller, Bus request (BR) and Bus grant (BG); Memory hierarchy: Main memory, Cache memory, Cache hit ratio, Mapping functions (Direct, Associative, Set-associative mapping), Virtual memory, Page replacement.
- Standard Recommended Books: Computer System Architecture by M. Morris Mano (Pearson) · Microprocessor Architecture, Programming and Applications with the 8085 by Ramesh S. Gaonkar.
BCA-304: Business Economics
- Unit I (Introduction & Fundamental Principles): Meaning, nature, and scope of Managerial Economics; Relationship of managerial economics with other disciplines; Fundamental economic concepts: Incremental principle, Opportunity cost principle, Time perspective, Discounting principle, Equi-marginal principle.
- Unit II (Demand Analysis & Forecasting): Meaning of demand, Law of Demand, Demand curve and schedule, Exceptions to law of demand; Elasticity of Demand: Price elasticity (degrees and measurement methods), Income elasticity, Cross elasticity, Promotional elasticity; Demand forecasting: Qualitative and Quantitative methods (Survey of buyers' intentions, Expert opinion, Trend projection).
- Unit III (Production & Cost Analysis): Production function, Short-run production function: Law of Variable Proportions (Total, Average, and Marginal Product curves, 3 stages of production); Long-run production function: Laws of Returns to Scale, Isoquants, Isocost line; Cost concepts: Fixed vs Variable costs, Explicit vs Implicit costs; Short-run and Long-run cost curves (U-shaped cost curve, Envelope curve).
- Unit IV (Market Structures & Pricing Policies): Classification of market structures; Perfect Competition: Characteristics, Short-run and long-run equilibrium of firm and industry; Monopoly: Features, Price and output determination, Price discrimination (conditions and degrees); Monopolistic Competition: Product differentiation, Selling costs; Oligopoly: Interdependence, Paul Sweezy's Kinked Demand Curve model.
- Unit V (Macroeconomics & National Income): Concepts of National Income: Gross Domestic Product (GDP), Gross National Product (GNP), Net National Product (NNP), Personal Income, Disposable Income; Methods of measuring National Income: Product, Income, and Expenditure methods; Business Cycles: Meaning, Characteristics, Phases (Expansion, Peak, Contraction, Trough), Anti-cyclical policies.
- Standard Recommended Books: Managerial Economics by D.N. Dwivedi (Vikas Publishing) · Managerial Economics by G.S. Gupta (McGraw Hill).
BCA-305: Elements of Statistics
- Unit I (Data Collection & Presentation): Definition, scope, and limitations of statistics; Primary vs Secondary data collection methods; Classification and Tabulation of data; Construction of continuous frequency distributions; Graphical representation: Histogram, Frequency Polygon, Frequency Curve, Cumulative Frequency Curves (Less-than and More-than Ogives).
- Unit II (Measures of Central Tendency): Mathematical and positional averages: Arithmetic Mean (Direct, Shortcut, Step-deviation methods for individual, discrete, continuous series); Combined Arithmetic Mean; Median and Quartiles ($Q_1, Q_3$), Deciles, Percentiles; Mode computation and graphical location; Geometric Mean and Harmonic Mean; Empirical relationship: $\text{Mode} = 3\,\text{Median} - 2\,\text{Mean}$.
- Unit III (Measures of Dispersion & Skewness): Concept of dispersion, Absolute and relative measures; Range, Quartile Deviation (Semi-interquartile range); Mean Deviation from Mean and Median; Standard Deviation ($\sigma$) and Variance, Short-cut computation formulas; Coefficient of Variation ($C.V.$) for comparing consistency; Measures of Skewness: Karl Pearson's and Bowley's coefficients of skewness.
- Unit IV (Correlation & Regression Analysis): Bivariate data, Scatter diagram; Karl Pearson's coefficient of correlation ($r$), Properties of correlation coefficient ($-1 \le r \le +1$, independent of change of origin and scale); Spearman's Rank correlation coefficient for tied and untied ranks; Linear Regression: Regression lines of $Y$ on $X$ and $X$ on $Y$, Regression coefficients ($b_{yx}, b_{xy}$), Angle between two regression lines.
- Unit V (Probability & Index Numbers): Classical, Relative frequency, and Axiomatic definitions of Probability; Addition and Multiplication theorems of probability; Conditional probability, Independent events, Bayes' Theorem; Index Numbers: Meaning, uses, and problems in construction; Weighted aggregate index numbers: Laspeyres', Paasche's, and Fisher's Ideal Index Number; Time Reversal and Factor Reversal tests.
- Standard Recommended Books: Statistical Methods by S.P. Gupta (Sultan Chand & Sons) · Fundamentals of Statistics by S.C. Gupta (Himalaya Publishing House).
CCSU BCA 4th Semester Detailed Syllabus
Open 4th Sem Hub →Advanced second-year curriculum emphasizing raster computer graphics, operating systems process scheduling, software engineering lifecycles, and operations research optimization models.
| Code | Course Title | Type | External | Internal | Total | Curriculum Guide |
|---|---|---|---|---|---|---|
| BCA-401 | Computer Graphics & Multimedia Application | Theory | 75 Marks | 25 Marks | 100 Marks | Unit Guide → |
| BCA-402 | Operating System | Theory | 75 Marks | 25 Marks | 100 Marks | Unit Guide → |
| BCA-403 | Software Engineering | Theory | 75 Marks | 25 Marks | 100 Marks | Unit Guide → |
| BCA-404 | Optimization Techniques (Operations Research) | Theory | 75 Marks | 25 Marks | 100 Marks | Unit Guide → |
| BCA-406 | Mathematics - III | Theory | 75 Marks | 25 Marks | 100 Marks | Unit Guide → |
| BCA-405P | Computer Practical: Computer Graphics & OS Lab | Practical | 50 Marks | — | 50 Marks | Lab Viva (50M) |
BCA-401: Computer Graphics & Multimedia Application
- Unit I (Graphics Hardware & Displays): Video display devices: Cathode Ray Tubes (CRT), Refresh CRT, Color CRT (Beam penetration, Shadow mask); Raster Scan and Random Scan systems; Video controllers, Display processors; Flat-panel displays: LCD, LED, Plasma displays.
- Unit II (Scan Conversion & Output Primitives): Digital Differential Analyzer (DDA) Line generation algorithm; Bresenham's Line Drawing algorithm; Mid-point Circle Generation algorithm; Mid-point Ellipse algorithm; Region filling: Boundary-Fill and Flood-Fill algorithms, Scan-line polygon fill algorithm.
- Unit III (2D Transformations & Clipping): 2D Geometrical transformations: Translation, Scaling, Rotation, Reflection, Shear; Homogeneous coordinates and Composite transformation matrices; Viewing pipeline, World coordinates to Viewing coordinates; Clipping algorithms: Cohen-Sutherland Line Clipping, Sutherland-Hodgman Polygon Clipping.
- Unit IV (3D Graphics & Hidden Surface Removal): 3D Display methods; 3D Transformations: Translation, Scaling, Rotation about arbitrary axes; Parallel and Perspective projections; Visible surface detection algorithms: Back-Face Detection, Depth-Buffer (Z-Buffer) method, A-Buffer method, Depth-Sort (Painter's) algorithm.
- Unit V (Multimedia Systems & Standards): Concepts of multimedia and hypertext; Multimedia elements: Text, Images, Graphics, Audio, Video, Animation; Audio compression (MP3, MIDI); Video standards (MPEG, AVI); Image file formats (BMP, JPEG, GIF, PNG); Principles of animation and morphing.
- Standard Recommended Books: Computer Graphics C Version by Donald Hearn & M. Pauline Baker (Pearson) · Multimedia: Making it Work by Tay Vaughan.
BCA-402: Operating System
- Unit I (Introduction & System Calls): Definition, functions, and evolution of Operating Systems; Types of OS: Batch, Multi-programmed, Time-sharing, Distributed, Real-time OS; Operating System structures: Monolithic, Layered, Microkernel architecture; System calls and system programs; Dual-mode operation.
- Unit II (Process Management & Scheduling): Process concept, Process states and transition diagram, Process Control Block (PCB); Context switching; Threads: User-level and Kernel-level threads; CPU Scheduling: Scheduling criteria, Scheduling algorithms: First-Come First-Served (FCFS), Shortest Job First (SJF), Shortest Remaining Time First (SRTF), Priority Scheduling, Round Robin (RR), Multilevel Queue scheduling.
- Unit III (Process Synchronization & Deadlocks): Inter-process communication, Critical section problem, Peterson's solution, Hardware synchronization (TestAndSet); Semaphores (Counting and Binary), Mutex; Classic synchronization problems: Producer-Consumer, Readers-Writers, Dining Philosophers; Deadlock definition, Necessary conditions, Resource Allocation Graph (RAG); Deadlock prevention, Deadlock avoidance: Banker's Algorithm; Deadlock detection and recovery.
- Unit IV (Memory Management): Logical vs Physical address space; Swapping, Contiguous memory allocation (Fixed and Variable partition, First-fit, Best-fit, Worst-fit); Paging: Hardware implementation, Translation Lookaside Buffer (TLB), Protection; Segmentation; Virtual Memory: Demand paging, Page fault handling, Page replacement algorithms: FIFO, Optimal, Least Recently Used (LRU), Thrashing.
- Unit V (File Systems & Disk Scheduling): File concept, File naming, attributes, and operations; File access methods (Sequential, Direct access); Directory structures (Single-level, Two-level, Hierarchical tree); File allocation methods: Contiguous, Linked, Indexed; Disk structure and Disk scheduling algorithms: FCFS, Shortest Seek Time First (SSTF), SCAN (Elevator), C-SCAN, LOOK, C-LOOK.
- Standard Recommended Books: Operating System Concepts by Silberschatz, Galvin & Gagne (Wiley) · Modern Operating Systems by Andrew S. Tanenbaum.
BCA-403: Software Engineering
- Unit I (Software Process & Life Cycle Models): Software characteristics, Components, Applications, Software crisis; Software Development Life Cycle (SDLC) phases; Process models: Classical Waterfall model, Iterative Waterfall, Prototyping model, Evolutionary model, Spiral model, Rapid Application Development (RAD); Agile software development and Scrum fundamentals.
- Unit II (Requirement Engineering & SRS): Software requirement elicitation techniques; Feasibility study (Technical, Operational, Economic); Functional and Non-functional requirements; Software Requirements Specification (SRS) document structure (IEEE 830 standard); Structured analysis tools: Data Flow Diagrams (DFD - Context and Level-1/2), Data Dictionary, Decision trees, Decision tables.
- Unit III (Software Design & Modularity): Software design principles: Abstraction, Modularity, Information Hiding; Cohesion and Coupling: Types of Cohesion (Functional, Sequential, Communicational, etc.) and Types of Coupling (Data, Stamp, Control, Common, Content); High cohesion and low coupling principle; Architectural styles; Object-Oriented design with UML (Use Case diagrams, Class diagrams, Sequence diagrams).
- Unit IV (Software Testing Techniques): Verification vs Validation; Testing levels: Unit testing, Integration testing (Top-down, Bottom-up), System testing, Acceptance testing (Alpha and Beta testing); Black-Box Testing: Equivalence Class Partitioning, Boundary Value Analysis (BVA), Cause-Effect Graphing; White-Box Testing: Basis Path Testing, Cyclomatic Complexity ($V(G) = E - N + 2P$), Control Structure testing.
- Unit V (Software Maintenance & Metrics): Software maintenance categories: Corrective, Adaptive, Perfective, Preventive; Software cost estimation: Lines of Code (LOC), Function Point (FP) analysis, COCOMO model (Basic, Intermediate, Detailed); Software quality assurance: ISO 9000 certification, SEI-CMM maturity levels (Initial, Repeatable, Defined, Managed, Optimizing).
- Standard Recommended Books: Software Engineering: A Practitioner's Approach by Roger S. Pressman (McGraw Hill) · An Integrated Approach to Software Engineering by Pankaj Jalote.
BCA-404: Optimization Techniques (Operations Research)
- Unit I (Linear Programming Problems - Formulation & Graphical): History and scope of Operations Research; General Linear Programming Problem (LPP) formulation; Assumptions of LPP; Graphical method for solving 2-variable LPP: Feasible region, Corner points, Infeasible solutions, Unbounded solutions, Redundant constraints.
- Unit II (Simplex Method & Artificial Variables): Standard form of LPP, Slack and Surplus variables, Basic feasible solution (BFS); Simplex algorithm for maximization and minimization problems; Degeneracy and cycling; Artificial variable techniques: Big-M (Charnes Penalty) method, Two-Phase Simplex method.
- Unit III (Duality in Linear Programming): Concept of Duality; Formulation of Dual problem from Primal; Primal-Dual relationships; Duality theorems (Fundamental theorem of duality, Weak duality); Economic interpretation of dual variables; Dual Simplex Method algorithm.
- Unit IV (Transportation & Assignment Models): Transportation problem mathematical formulation; Initial basic feasible solution methods: North-West Corner Rule (NWCR), Least Cost Method (LCM), Vogel's Approximation Method (VAM); Optimality test: Modified Distribution (MODI) method; Degeneracy in transportation; Assignment Problem: Mathematical formulation, Hungarian Method for balanced and unbalanced problems.
- Unit V (Game Theory & Sequencing Problems): Two-Person Zero-Sum games; Payoff matrix, Maximin-Minimax principle, Saddle point and pure strategies; Games without saddle points (Mixed strategies): $2 \times 2$ algebraic solution, Dominance property, Graphical method for $2 \times n$ and $m \times 2$ games; Sequencing Problem: Processing $n$ jobs through 2 machines and 3 machines (Johnson's Rule).
- Standard Recommended Books: Operations Research by Kanti Swarup, P.K. Gupta & Man Mohan (Sultan Chand) · Operations Research: An Introduction by Hamdy A. Taha (Pearson).
BCA-406: Mathematics - III
- Unit I (Complex Variables & Analytic Functions): Functions of a complex variable, Limits, Continuity, Derivative of $f(z)$; Analytic functions, Necessary and sufficient conditions for analyticity: Cauchy-Riemann (C-R) equations in Cartesian and Polar forms; Harmonic functions and conjugate harmonics; Milne-Thomson method for constructing analytic functions.
- Unit II (Complex Integration & Series): Line integral of complex functions; Cauchy's Fundamental Theorem; Cauchy's Integral Formula and Cauchy's Integral Formula for higher derivatives; Taylor's series expansion; Laurent's series expansion and classification of singularities (Removable singularity, Pole, Essential singularity).
- Unit III (Calculus of Residues): Residue at a simple pole and pole of order $m$; Cauchy's Residue Theorem; Evaluation of real definite integrals around unit circles: $\int_{0}^{2\pi} f(\cos \theta, \sin \theta) d\theta$.
- Unit IV (Fourier Series): Periodic functions, Dirichlet's conditions; Fourier series expansion for functions of period $2\pi$ and arbitrary period $2L$; Euler's formulas for Fourier coefficients; Fourier series for Even and Odd functions; Half-range Fourier Sine and Cosine series.
- Unit V (Partial Differential Equations): Formation of partial differential equations by elimination of arbitrary constants and arbitrary functions; First-order linear partial differential equations: Lagrange's method ($Pp + Qq = R$); Non-linear partial differential equations of first order: Charpit's method.
- Standard Recommended Books: Advanced Engineering Mathematics by H.K. Dass (S. Chand) · Higher Engineering Mathematics by Dr. B.S. Grewal.
CCSU BCA 5th Semester Detailed Syllabus
Open 5th Sem Hub →Third-year professional development covering relational database engineering, Java enterprise application programming, computer network layers, and numerical algorithm computation.
| Code | Course Title | Type | External | Internal | Total | Curriculum Guide |
|---|---|---|---|---|---|---|
| BCA-501 | Introduction to DBMS | Theory | 75 Marks | 25 Marks | 100 Marks | Unit Guide → |
| BCA-502 | Java Programming & Dynamic Webpage Design | Theory | 75 Marks | 25 Marks | 100 Marks | Unit Guide → |
| BCA-503 | Computer Network | Theory | 75 Marks | 25 Marks | 100 Marks | Unit Guide → |
| BCA-504 | Numerical Methods | Theory | 75 Marks | 25 Marks | 100 Marks | Unit Guide → |
| BCA-505P | Computer Practical: Java & DBMS Lab | Practical | 50 Marks | — | 50 Marks | Lab Viva (50M) |
| BCA-506P | Minor Project / Industrial Training Work | Project | 50 Marks | — | 50 Marks | Project Viva (50M) |
BCA-501: Introduction to DBMS
- Unit I (DBMS Architecture & ER Modeling): File processing systems vs Database Management Systems (DBMS); Advantages of DBMS; 3-level ANSI-SPARC architecture (Internal, Conceptual, External levels); Data independence (Physical and Logical); Data models (Hierarchical, Network, Relational); Entity-Relationship (ER) modeling: Entity sets, Attributes (Simple, Composite, Multi-valued), Relationships, Mapping constraints, Weak entities, Enhanced ER (EER) concepts, ER-to-Relational schema mapping.
- Unit II (Relational Data Model & Algebra): Relational model concepts: Domains, Attributes, Tuples, Relations; Relational constraints: Domain constraints, Key constraints, Entity integrity, Referential integrity (Foreign keys); Relational Algebra: Fundamental operations (Select $\sigma$, Project $\pi$, Union $\cup$, Set Difference $-$, Cartesian Product $\times$, Rename $\rho$), Additional operations (Set Intersection, Natural Join, Theta Join, Outer Joins, Division).
- Unit III (SQL & Integrity Constraints): Structured Query Language (SQL): Data Definition Language (DDL - CREATE, ALTER, DROP, TRUNCATE), Data Manipulation Language (DML - INSERT, UPDATE, DELETE, SELECT), Data Control Language (DCL - GRANT, REVOKE); Table creation with PRIMARY KEY, UNIQUE, NOT NULL, CHECK constraints; Nested subqueries, Correlated subqueries, Aggregate functions (COUNT, SUM, AVG, MIN, MAX), GROUP BY and HAVING clauses; Views and Triggers.
- Unit IV (Relational Design & Normalization): Pitfalls in relational database design (Redundancy, Update anomalies, Insertion/Deletion anomalies); Functional Dependencies (FDs), Closure of a set of FDs, Armstrong's Axioms, Attribute closure; Normalization: First Normal Form (1NF), Second Normal Form (2NF based on full functional dependency), Third Normal Form (3NF based on transitive dependency), Boyce-Codd Normal Form (BCNF); Multi-valued dependencies and 4NF; Lossless-Join decomposition and Dependency Preservation.
- Unit V (Transaction Processing & Concurrency Control): Transaction concepts, Transaction states; ACID properties (Atomicity, Consistency, Isolation, Durability); Concurrent execution problems: Lost updates, Dirty reads, Unrepeatable reads; Serializability: Conflict and View serializability; Concurrency control protocols: Lock-Based protocols (Shared and Exclusive locks), Two-Phase Locking (2PL - Strict 2PL, Rigorous 2PL); Deadlock handling: Deadlock prevention, Deadlock detection using Wait-For Graph (WFG); Database recovery basics.
- Standard Recommended Books: Database System Concepts by Korth, Silberschatz & Sudarshan (McGraw Hill) · Fundamentals of Database Systems by Elmasri & Navathe (Pearson).
BCA-502: Java Programming & Dynamic Webpage Design
- Unit I (Java Core Foundations): History and features of Java (Platform independent, Object-oriented, Robust, Secure); Java Virtual Machine (JVM), Java Runtime Environment (JRE), Java Development Kit (JDK); Bytecode execution; Primitive data types, Variables, Arrays; Control structures; Classes, Objects, Methods, Constructors,
thiskeyword, Garbage collection, Method overloading; Static variables and static methods. - Unit II (Inheritance, Packages & Interfaces): Inheritance basics, Single and Multilevel inheritance; Method overriding, Dynamic Method Dispatch (Runtime polymorphism);
superandfinalkeywords; Abstract classes and methods; Creating and importing Packages, Access protection; Defining and implementing Interfaces, Extending interfaces. - Unit III (Exception Handling & Multithreading): Exception handling hierarchy,
try,catch,finally,throw, andthrowskeywords; Checked vs Unchecked exceptions; Creating Custom Exception classes; Multithreading concepts: Thread life cycle states, Creating threads by extendingThreadclass and implementingRunnableinterface, Thread priority, Thread synchronization (synchronizedmethods and blocks), Inter-thread communication (wait(),notify()). - Unit IV (Java Collections & Applets / GUI): Java I/O streams: Byte streams vs Character streams; Collection Framework:
ArrayList,LinkedList,Vector,HashSet,HashMap; Applet life cycle methods (init,start,paint,stop,destroy), Passing parameters to applets; Event handling: Delegation Event Model, Event listeners and adapters. - Unit V (Dynamic Web Technologies: Servlets, JSP & JDBC): Client-Server web architecture, HTTP protocol (GET vs POST); Java Database Connectivity (JDBC): Driver types, JDBC connections,
Statement,PreparedStatement,ResultSet; Servlet architecture, Servlet life cycle,HttpServlet, Session management (Cookies,HttpSession); JavaServer Pages (JSP): Architecture, JSP Scripting elements (Scriptlets, Expressions, Declarations), JSP directives. - Standard Recommended Books: Java: The Complete Reference by Herbert Schildt (McGraw Hill) · Head First Java by Kathy Sierra & Bert Bates.
BCA-503: Computer Network
- Unit I (Network Models & Physical Layer): Computer network goals and applications; Network classification: LAN, MAN, WAN; Network topologies: Mesh, Star, Bus, Ring, Hybrid; OSI 7-Layer Reference Model and functions of each layer; TCP/IP 4-Layer Architecture; Transmission media: Guided media (Twisted pair, Coaxial cable, Fiber optic) and Unguided media (Radio waves, Microwaves, Infrared); Switching techniques: Circuit switching, Packet switching (Datagram and Virtual circuit), Message switching.
- Unit II (Data Link Layer & MAC Sublayer): Data Link Layer design issues, Framing methods (Character count, Byte stuffing, Bit stuffing); Error detection and correction: Parity check, Longitudinal Redundancy Check (LRC), Cyclic Redundancy Check (CRC), Hamming Code; Flow control protocols: Stop-and-Wait, Sliding Window (Go-Back-N, Selective Repeat); Medium Access Control (MAC): ALOHA (Pure and Slotted), CSMA, CSMA/CD (Ethernet IEEE 802.3), CSMA/CA (Wi-Fi IEEE 802.11).
- Unit III (Network Layer & Routing): Network layer design issues, Store-and-forward packet switching; Routing algorithms: Shortest Path Routing (Dijkstra's Algorithm), Distance Vector Routing (Bellman-Ford, Count-to-Infinity problem), Link State Routing; Congestion control: Leaky Bucket and Token Bucket algorithms; Internetworking: IPv4 addressing, Address classes, Subnetting, Classless Inter-Domain Routing (CIDR), IPv6 structure; Protocols: ARP, RARP, ICMP.
- Unit IV (Transport Layer): Transport service primitives; Multiplexing and Demultiplexing; Connectionless transport: User Datagram Protocol (UDP) segment format and applications; Connection-oriented transport: Transmission Control Protocol (TCP): TCP Segment structure, 3-Way Handshake connection establishment and connection termination, TCP Sliding Window flow control, TCP Congestion control (Slow start, Congestion avoidance).
- Unit V (Application Layer & Security): Domain Name System (DNS) architecture and hierarchical namespace; Electronic Mail architecture and protocols: Simple Mail Transfer Protocol (SMTP), Post Office Protocol (POP3), Internet Message Access Protocol (IMAP); World Wide Web (WWW) and HTTP/HTTPS; File Transfer Protocol (FTP); Network Security basics: Symmetric and Asymmetric key cryptography (RSA overview), Firewalls.
- Standard Recommended Books: Computer Networks by Andrew S. Tanenbaum (Pearson) · Data Communications and Networking by Behrouz A. Forouzan (McGraw Hill).
BCA-504: Numerical Methods
- Unit I (Errors & Roots of Non-linear Equations): Computer arithmetic and rounding errors: Absolute error, Relative error, Percentage error; Solutions of Algebraic and Transcendental equations: Bisection Method, Method of False Position (Regula-Falsi), Newton-Raphson Method, Secant Method, Order of convergence for each method.
- Unit II (Simultaneous Linear Equations): Direct methods for linear systems: Gauss Elimination method, Gauss-Jordan method, LU Decomposition method; Iterative methods: Jacobi's Iteration method, Gauss-Seidel Iteration method, Convergence criteria for iterative methods.
- Unit III (Finite Differences & Interpolation): Difference operators: Forward difference ($\Delta$), Backward difference ($\nabla$), Shift operator ($E$), Central difference ($\delta$), and their algebraic relationships; Newton's Forward Difference interpolation formula; Newton's Backward Difference interpolation formula; Interpolation with unequal intervals: Lagrange's Interpolation formula, Newton's Divided Difference formula.
- Unit IV (Numerical Differentiation & Integration): Numerical differentiation based on Newton's forward and backward interpolation polynomials; Numerical integration formulas: Newton-Cotes Quadrature formula; Trapezoidal Rule; Simpson's $1/3^{\text{rd}}$ Rule; Simpson's $3/8^{\text{th}}$ Rule; Weddle's Rule; Error bounds in integration formulas.
- Unit V (Ordinary Differential Equations): Numerical solution of first-order initial value problems: Taylor's Series method; Picard's method of successive approximations; Euler's Method and Modified Euler's Method; Runge-Kutta Methods: Second-order Runge-Kutta (RK-2) and Fourth-order Runge-Kutta (RK-4) formulas.
- Standard Recommended Books: Introductory Methods of Numerical Analysis by S.S. Sastry (PHI) · Numerical Methods for Scientific and Engineering Computation by Jain, Iyengar & Jain.
CCSU BCA 6th Semester Detailed Syllabus
Open 6th Sem Hub →Graduating semester focusing on system analysis & architecture, digital commerce platforms, information security & cloud infrastructure, and a major capstone project defense.
| Code | Course Title | Type | External | Internal | Total | Curriculum Guide |
|---|---|---|---|---|---|---|
| BCA-601 | Information System: Analysis Design & Implementation | Theory | 75 Marks | 25 Marks | 100 Marks | Unit Guide → |
| BCA-602 | E-Commerce | Theory | 75 Marks | 25 Marks | 100 Marks | Unit Guide → |
| BCA-603 | Network Security / Cloud Computing | Theory | 75 Marks | 25 Marks | 100 Marks | Unit Guide → |
| BCA-604 | Major Project Work & Comprehensive Viva-Voce | Project | 200 Marks | — | 200 Marks | Major Viva (200M) |
| BCA-605 | General Proficiency & Comprehensive Degree Viva | Viva | 100 Marks | — | 100 Marks | Degree Viva (100M) |
BCA-601: Information System: Analysis Design & Implementation
- Unit I (System Concepts & MIS Overview): System definition, characteristics, and components; Open vs Closed systems, Deterministic vs Probabilistic systems; Information hierarchy: Operational, Tactical, and Strategic information; Types of Information Systems: Transaction Processing Systems (TPS), Management Information Systems (MIS), Decision Support Systems (DSS), Executive Information Systems (EIS), Expert Systems.
- Unit II (System Analysis & Investigation): Role and interpersonal skills of a Systems Analyst; System development methodologies; Fact-finding and investigation techniques: Interviews, Questionnaires, On-site observations, Record inspection; Feasibility analysis (Technical, Operational, Economic/Cost-Benefit); Structured analysis tools: Context diagrams, Data Flow Diagrams (DFDs), Data Dictionary, Structured English.
- Unit III (System Design & Interface Engineering): Logical vs Physical system design; Input design: Screen layout principles, Data validation rules, GUI form controls; Output design: Formats of printed and screen reports; Modular design: Top-down and Bottom-up approaches; File and database organization: Sequential, Direct, Indexed-Sequential files.
- Unit IV (System Implementation & Testing): Testing strategies: Unit testing, Integration testing, System testing, Acceptance testing; User training and procedure manuals; System conversion strategies: Direct changeover, Parallel conversion, Pilot operation, Phased cutover; Post-implementation review and system maintenance.
- Unit V (System Security & Audit): Threats to information systems; Hardware and software access controls; Disaster recovery planning (DRP) and business continuity; System audit trails and legal compliances.
- Standard Recommended Books: Analysis and Design of Information Systems by James A. Senn (McGraw Hill) · System Analysis and Design by Elias M. Awad (Galgotia).
BCA-602: E-Commerce
- Unit I (Foundations of E-Commerce): Definition, scope, and evolution of Electronic Commerce; E-Commerce vs Traditional Commerce; Advantages and limitations for businesses, consumers, and society; Drivers of digital commerce; E-Commerce business models: B2B, B2C, C2C, C2B, B2G, G2C, Peer-to-Peer (P2P); Revenue models in digital economy.
- Unit II (E-Commerce Infrastructure & Technologies): Internet architecture, World Wide Web, Intranets and Extranets; Web hosting services, Domain Name System (DNS); Web server software and hardware requirements; Search Engine Optimization (SEO) fundamentals, Web analytics and conversion funnel.
- Unit III (Electronic Payment Systems - EPS): Online transaction processing; Payment methods: Credit cards, Debit cards, Smart cards, Digital Wallets, Unified Payments Interface (UPI), Net Banking, Electronic Fund Transfer (NEFT/RTGS/IMPS); Payment gateways and merchant accounts; Risks and fraud in online payments.
- Unit IV (E-Commerce Security & Legal Framework): Security threats: Phishing, Hacking, Spoofing, Denial of Service (DoS/DDoS); Security safeguards: Symmetric and Asymmetric encryption, Secure Sockets Layer / Transport Layer Security (SSL/TLS), Digital Signatures, Digital Certificates, Public Key Infrastructure (PKI); Information Technology Act 2000 (IT Act) legal provisions, Cyber crimes and penalties.
- Unit V (Digital Marketing & Supply Chain Management): Digital marketing tools: Email marketing, Search engine marketing (SEM), Pay-Per-Click (PPC), Affiliate marketing, Social media advertising; Customer Relationship Management (CRM) in e-commerce; Electronic Data Interchange (EDI): Architecture, EDI standards (EDIFACT, ANSI X12); E-Supply Chain Management integration.
- Standard Recommended Books: E-Commerce: Business, Technology, Society by Kenneth C. Laudon & Carol Guercio Traver (Pearson) · Electronic Commerce: A Manager's Guide by Ravi Kalakota & Andrew B. Whinston.
BCA-603: Network Security / Cloud Computing
- Unit I (Security Foundations & Classical Cryptography): Security goals: Confidentiality, Integrity, Availability (CIA Triad); Types of attacks: Passive attacks (Eavesdropping, Traffic analysis) vs Active attacks (Masquerade, Replay, Modification, Denial of service); Classical encryption techniques: Substitution ciphers (Caesar cipher, Playfair cipher, Hill cipher), Transposition ciphers; Steganography.
- Unit II (Modern Cryptography & Key Management): Symmetric key cryptography: Data Encryption Standard (DES) algorithm structure, Double DES, Triple DES, Advanced Encryption Standard (AES) principles; Asymmetric cryptography: RSA Algorithm (key generation, encryption, decryption, mathematical proof), Diffie-Hellman Key Exchange algorithm; Cryptographic hash functions: MD5, SHA-256; Message Authentication Codes (MAC).
- Unit III (Network Protocols & Firewalls): IP Security (IPsec) architecture: Authentication Header (AH) and Encapsulating Security Payload (ESP), Transport and Tunnel modes; Secure Sockets Layer (SSL) and Transport Layer Security (TLS); Pretty Good Privacy (PGP) email security; Firewalls: Packet filtering firewalls, Stateful inspection firewalls, Application proxy gateways; Intrusion Detection Systems (IDS).
- Unit IV (Cloud Computing Models & Architecture): Definition, characteristics, and historical evolution of Cloud Computing; Cloud service models: Infrastructure as a Service (IaaS), Platform as a Service (PaaS), Software as a Service (SaaS); Cloud deployment models: Public Cloud, Private Cloud, Hybrid Cloud, Community Cloud; Economic benefits and trade-offs.
- Unit V (Virtualization & Cloud Security): Virtualization concepts: Type-1 (Bare-metal) and Type-2 (Hosted) Hypervisors; Server virtualization, Storage virtualization, Network virtualization; Cloud security challenges: Multi-tenancy risks, Data privacy, Vendor lock-in; Overview of major public cloud service providers (AWS, Microsoft Azure, Google Cloud Platform).
- Standard Recommended Books: Cryptography and Network Security by William Stallings (Pearson) · Cloud Computing: Principles and Paradigms by Rajkumar Buyya (Wiley).
CCSU University Examination & Passing Guidelines:
- Theory Minimum Passing Marks: A candidate must secure a minimum of 40% marks in the External University Theory Examination (minimum 30 out of 75 Marks) and 40% marks in aggregate (Internal + External combined, i.e., minimum 40 out of 100 Marks) in each individual course.
- Practical Lab Passing Marks: A candidate must score at least 40% marks in practical code execution and external viva-voce examination (minimum 20 out of 50 Marks).
- Question Paper Blueprint (External 75 Marks · 3 Hours):
- Section A (Compulsory): 5 very short questions of 3 marks each ($5 \times 3 = 15$ Marks). All questions mandatory across units.
- Section B (Short Answer): Attempt 2 out of 3 questions of 7.5 marks each ($2 \times 7.5 = 15$ Marks). Analytical and problem-oriented questions.
- Section C (Long Answer): Attempt 3 out of 5 questions of 15 marks each ($3 \times 15 = 45$ Marks). In-depth program code, mathematical derivations, and architecture proofs.
- Degree Division Criteria: First Division with Distinction (75% and above), First Division (60% to 74.9%), Second Division (50% to 59.9%), Pass Division (40% to 49.9%).
Official CCSU Meerut University Portal
For university notifications, examination schedule updates, admit card download dates, and official university syllabus notifications, consult the Chaudhary Charan Singh University official website.
Visit Official CCSU Meerut Portal →