BCA Semester 5 Syllabus – Gurugram University (GU)
| Course Code | Subject | Category | Credits | Max Marks |
|---|---|---|---|---|
| 240/BCA/CC501 | Computer Graphics | Core (CC) | 4 | 100 |
| 240/BCA/CC502 | Python Programming | Core (CC) | 4 | 100 |
| 240/BCA/CC503 | Analysis and Design of Algorithms | Core (CC) | 4 | 100 |
| 240/BCA/MI501 | Vocational Course – 1 (One from pool) | Vocational (VOC) | 4 | 100 |
| 240/BCA/INT501 | Internship | Internship | 4 | 100 |
Computer Graphics Syllabus – Unit-wise Topics
Computer Graphics (CC-ID13 | 240/BCA/CC501) — 4 Credits | 100 Marks (25 Internal + 50 External + 5 Practical Internal + 20 Practical External) | Duration: 3 hrs. Unit I: Graphics Primitives — Introduction to computer graphics, basics of graphics systems, application areas, overview of graphics systems, video-display devices, raster-scan and random-scan systems, graphics monitors, workstations and input devices. Output primitives: points and lines, line drawing algorithms (DDA, Bresenham's), midpoint circle and ellipse algorithms. Filled-area primitives: scan-line polygon fill algorithm, boundary fill and flood-fill algorithms. Unit II: 2D Geometric Transforms and Viewing — 2D transformations: translation, scaling, rotation, reflection and shear, matrix representations and homogeneous coordinates, composite transforms, transformation between coordinate systems. 2D viewing: viewing pipeline, viewing coordinate reference frame, window-to-viewport coordinate transformation, viewing functions, Cohen-Sutherland and Cyrus-Beck line clipping algorithms, Sutherland-Hodgman polygon clipping algorithm. Unit III: 3D Object Representation — Polygon surfaces, quadric surfaces, spline representation, Hermite curves, Bezier curves, B-Spline curves, Bezier and B-Spline surfaces. Basic illumination models, polygon-rendering methods. Unit IV: 3D Geometric Transformations and Viewing — 3D transformations: translation, rotation, scaling, reflection and shear, composite transformations. 3D viewing: viewing pipeline, viewing coordinates, view volume, general projection transforms and clipping. Lab Experiments: DDA and Bresenham's line drawing, midpoint circle and ellipse algorithms, scan-line polygon fill, boundary fill and flood fill, 2D transformations (translate/scale/rotate/reflect/shear), composite transformations, Cohen-Sutherland line clipping, Sutherland-Hodgman polygon clipping, Bezier and B-Spline curves, 3D transformations, perspective and orthographic projections.
Python Programming Syllabus – Unit-wise Topics
Python Programming (CC-ID14 | 240/BCA/CC502) — 4 Credits | 100 Marks (25 Internal + 50 External + 5 Practical Internal + 20 Practical External) | Duration: 3 hrs. Unit I: Python Fundamentals — Data types, variables, assignments, immutable variables, numerical types, arithmetic operators and expressions, comments, conditions, boolean logic, logical operators, ranges, control statements (if-else, for, while loops), short-circuit evaluation. Strings and text files, manipulating files and directories (os and sys modules), reading/writing text and numbers, creating and reading formatted files (CSV, tab-separated), string subscript operator, indexing, slicing. Unit II: Data Structures and Functions — Lists, tuples, dictionaries: basic operators, replacing/inserting/removing elements, searching and sorting lists, dictionary literals, adding/removing keys, accessing/replacing values, traversing dictionaries. Function design: hiding redundancy and complexity, arguments and return values, formal vs actual arguments, named arguments. Unit III: Object Oriented Programming and Exception Handling — Classes and OOP: classes, objects, attributes and methods, defining classes, design with classes, data modeling, persistent storage of objects. Encapsulation, information hiding, method signature, classes and instances, abstraction, inheritance, polymorphism, operator overloading (__eq__, __str__, etc.), abstract classes, exception handling with try blocks. Unit IV: GUI Programming with tkinter — Event-driven programming paradigm, tkinter module, creating simple GUI applications, buttons, labels, entry fields, dialogs, widget attributes (sizes, fonts, colors), layouts, nested frames. Lab Experiments: Basic Python programs (variables, conditionals, loops, functions, libraries, errors), data structures (lists, tuples, dictionaries), OOP (classes, inheritance, polymorphism, abstract classes), PyQt for GUIs, NumPy (matrices, vectors, linear algebra), SciPy for numerical computations, Matplotlib for plotting, IPython.
Analysis and Design of Algorithms Syllabus – Unit-wise Topics
Analysis and Design of Algorithms (CC-ID15 | 240/BCA/CC503) — 4 Credits | 100 Marks (25 Internal + 50 External + 5 Practical Internal + 20 Practical External) | Duration: 3 hrs. Unit I: Basic Concepts of Algorithms — Notion of algorithm, fundamentals of algorithmic problem solving, important problem types, analysis framework, asymptotic notations (Big-O, Omega, Theta) and basic efficiency classes. Mathematical analysis of non-recursive and recursive algorithms, recurrence relations, solving recurrence relations using the substitution method. Unit II: Sorting Algorithms — Brute Force approach: Selection Sort, Bubble Sort, sequential search (Linear Search), brute-force string matching. Divide and Conquer strategy: Merge Sort, Quick Sort, Binary Search, Strassen's matrix multiplication. Unit III: Greedy and Dynamic Programming — Greedy approach: Fractional Knapsack problem, Minimum Cost Spanning Tree (Prim's and Kruskal's algorithms), single-source shortest path problem. Dynamic Programming: principle of optimality, multi-stage graph problem, all-pair shortest path, 0/1 Knapsack problem, Travelling Salesperson Problem. Unit IV: Backtracking, Branch and Bound, and Complexity Classes — Backtracking: general method, N-Queen problem, 0/1 Knapsack problem. Branch and Bound: general method, 0/1 Knapsack, Travelling Salesperson problem. Lower bound theory, decision trees, complexity classes P, NP, and NP-Complete problems. Lab Experiments: Sorting techniques (Bubble, Insertion, Selection, Quick, Merge Sort), minimum cost spanning trees, Travelling Salesperson Problem, Longest Path in a DAG, Shortest Path with exactly k edges, maximum edge-disjoint paths, 0/1 Knapsack using Dynamic Programming, tree traversal algorithms, N-Queens Problem.
FAQs on BCA Semester 5 Syllabus – Gurugram University (GU)
- What subjects are in BCA Semester 5 at Gurugram University? BCA Semester 5 at Gurugram University: Core – Computer Graphics (240/BCA/CC501, 4 cr., 100 marks), Python Programming (240/BCA/CC502, 4 cr., 100 marks), Analysis and Design of Algorithms (240/BCA/CC503, 4 cr., 100 marks). VOC-1 (4 cr., 100 marks), Internship (240/BCA/INT501, 4 cr., 100 marks). Total: 20 credits, 500 marks.
- Is there an internship in BCA at Gurugram University? Yes. BCA students at Gurugram University must complete a mandatory internship in Semester 5. Course ID: 240/BCA/INT501. It carries 4 credits and is evaluated for 100 marks.
- How many credits does BCA Semester 5 carry at Gurugram University? BCA Semester 5 at Gurugram University carries 20 total credits (500 marks), including the mandatory 4-credit internship.
- What is the syllabus for Computer Graphics in BCA Semester 5 at Gurugram University? Computer Graphics (240/BCA/CC501) is a 4-credit, 100-mark course with practicals. Unit I: Graphics primitives — line drawing (DDA, Bresenham's), circle and ellipse algorithms, fill algorithms. Unit II: 2D geometric transforms and viewing — translation, scaling, rotation, homogeneous coordinates. Units III and IV cover 3D transformations and clipping algorithms.
- What is the syllabus for Python Programming in BCA Semester 5 at Gurugram University? Python Programming (240/BCA/CC502) is a 4-credit, 100-mark course with practicals. Unit I: Python fundamentals — data types, control statements, file handling. Unit II: Data structures and functions — lists, tuples, dictionaries. Units III and IV cover OOP in Python, modules, and exception handling.
- What is the syllabus for Analysis and Design of Algorithms in BCA Semester 5 at Gurugram University? Analysis and Design of Algorithms (240/BCA/CC503) is a 4-credit, 100-mark course with practicals. Unit I: Algorithm analysis — asymptotic notations, recurrence relations. Unit II: Sorting algorithms — Selection Sort, Bubble Sort, Merge Sort, Quick Sort. Units III and IV cover Greedy, Dynamic Programming, and Backtracking techniques.