External University Theory (75 Marks) + Internal Assessment (25 Marks) for BCA-401, 402, 403, 404 & 406
Duration: 3 Hours
Section A: Very Short Answer Questions (Mandatory)
5 Qs × 3 Marks = 15 Marks
Mandatory 5 short questions covering OS scheduling definitions, SDLC phases, CG formulas, and Simplex concepts.
Section B: Short Answer Questions
Attempt 2 out of 3 Qs = 15 Marks
Problem-solving questions including CPU scheduling Gantt charts, 2D matrix transformations, and Transportation tables (7.5 marks each).
Section C: Detailed Long Answer Questions
Attempt 3 out of 5 Qs = 45 Marks
Long derivations, Banker's deadlock avoidance, SRS/COCOMO case problems, Simplex iterations, and Fourier transforms (15 marks each). BCA-405 Practical lab is evaluated separately.
Unit I (Display Hardware & Pipelines): Cathode Ray Tube (CRT), refresh rate, raster scan vs random scan displays, color CRT techniques (beam penetration, shadow mask), lookup tables, frame buffers.
Unit II (Scan Conversion Algorithms): DDA line generation algorithm, Bresenham's line algorithm, midpoint circle algorithm, polygon fill algorithms (scan-line polygon fill, boundary-fill, flood-fill).
Unit III (2D Geometric Transformations & Clipping): Translation, scaling, rotation, reflection, shear, homogeneous coordinates and composite matrix transformations. Window-to-viewport transformation, Cohen-Sutherland line clipping algorithm, Sutherland-Hodgman polygon clipping.
Unit IV (3D Graphics & Projections): 3D translation, 3D rotation around arbitrary axes, parallel projection (orthographic, oblique) vs perspective projection (vanishing points).
Unit V (Multimedia Systems & Compression): Digital audio, sampling theorem, image compression standards (JPEG, GIF), MPEG video frames (I, P, B frames).
Recommended Textbook:Computer Graphics C Version by Donald Hearn & M. Pauline Baker (Pearson).
2. BCA-402: Operating System (OS Internals)
Focuses on low-level system software architecture, concurrency, and resource management:
Unit I (OS Overview & Structures): Role of OS, dual-mode execution (user vs kernel), system calls, monolithic vs microkernel architecture, boot process.
Unit II (Process Management & CPU Scheduling): Process Control Block (PCB), process states, context switching, scheduling algorithms (FCFS, SJF, Priority, Round Robin, Multi-level feedback queues), Gantt chart calculations.
Unit V (Storage & File Systems): File access methods, directory structures, disk scheduling algorithms (FCFS, SSTF, SCAN, C-SCAN, LOOK).
Recommended Textbook:Operating System Concepts by Abraham Silberschatz, Peter B. Galvin & Greg Gagne (Wiley).
3. BCA-403: Software Engineering
Teaches structured software development life cycles (SDLC), project estimation, and quality assurance:
Unit I (Software Process Models): Waterfall model, Prototyping model, Spiral model, Incremental model, Agile methodology (Scrum, Sprints).
Unit II (Software Requirements Engineering): Requirement elicitation techniques, feasibility study, SRS (Software Requirements Specification) IEEE 830 standard, Data Flow Diagrams (DFD Level 0, 1, 2), Data Dictionary.
Unit III (Software Design Architecture): Modularity, functional independence, Cohesion (7 levels) vs Coupling (5 levels), Structure Charts, Object-Oriented design principles.
Unit IV (Cost Estimation & Metrics): Function Point (FP) analysis, COCOMO model (Basic, Intermediate, Detailed for Organic, Semi-detached, Embedded systems), Gantt charts and PERT/CPM networks.
Unit V (Software Testing & Maintenance): Verification vs Validation, White-box testing (Cyclomatic complexity, basis path testing) vs Black-box testing (Equivalence partitioning, Boundary value analysis), Unit, Integration, System, and Acceptance testing.
Recommended Textbook:Software Engineering: A Practitioner's Approach by Roger S. Pressman (McGraw Hill).
Mathematical modeling for resource allocation and optimal decision making:
Unit I (Linear Programming Problems - LPP): Formulation of LPP, Graphical method (bounded vs unbounded feasible region), Simplex method, slack and surplus variables.
Unit II (Artificial Variable Techniques): Big-M method (Charnes Penalty method) and Two-Phase Simplex method, degeneracy in LPP.
Unit III (Duality in LPP): Primal-dual formulation, properties of duality, Economic interpretation of dual variables (shadow prices).
Unit IV (Transportation Problems): Mathematical formulation, initial basic feasible solution methods (North-West Corner Rule, Least Cost Method, Vogel's Approximation Method - VAM), optimality test using MODI method (u-v method).
Unit V (Assignment Problems & Game Theory): Hungarian method for balanced and unbalanced assignment problems. Two-person zero-sum games, minimax-maximin principle, saddle points, dominance property.
Recommended Textbook:Operations Research by Kanti Swarup, P.K. Gupta & Man Mohan (Sultan Chand & Sons).
5. BCA-406: Mathematics-III
Advanced engineering mathematics for signal processing and computational modelling:
Unit I (Fourier Series): Periodic functions, Dirichlet's conditions, Euler's formulas, Fourier series expansion for even and odd functions, half-range Fourier sine and cosine series.
Unit II (Laplace Transforms): Definition, linearity property, first and second shifting theorems, Laplace transforms of derivatives and integrals, unit step function, Dirac delta function.
Unit III (Inverse Laplace Transforms): Properties, partial fraction method, convolution theorem, solving ordinary differential equations using Laplace transforms.
Unit IV (Partial Differential Equations - PDE): Formation of PDE, Lagrange's linear equation (Pp + Qq = R), Charpit's method for non-linear equations of first order.
Unit V (Applications of PDE): Method of separation of variables, one-dimensional wave equation, one-dimensional heat conduction equation.
Recommended Textbook:Higher Engineering Mathematics by Dr. B.S. Grewal (Khanna Publishers).
6. BCA-405P: Computer Graphics & Operating Systems Lab
Practical laboratory implementation and external viva-voce examination (50 Marks):
Graphics Experiments: Line generation via DDA and Bresenham algorithms, midpoint circle drawing, 2D transformations (translation, scaling, rotation, reflection) in C/C++, Cohen-Sutherland line clipping simulation.
OS Simulation Experiments: CPU scheduling simulations (FCFS, SJF, Round Robin), Banker's deadlock algorithm, and Unix/Linux shell scripting practice.