BCA Semester 2 Syllabus – Gurugram University (GU) | NEP 2020
| Course Code | Subject | Category | Credits | Max Marks |
|---|---|---|---|---|
| 240/BCA/CC201 | Data Structures | Core (CC) | 4 | 100 |
| 240/BCA/CC202 | Mathematical Foundations of Computer Science | Core (CC) | 4 | 100 |
| 240/BCA/CC203 | Database Management System | Core (CC) | 4 | 100 |
| 240/BCA/MI201 | Minor/Vocational Course – 2 (One from pool) | Minor (MIC) | 2 | 50 |
| 240/BCA/MD201 | Multidisciplinary Course – 2 (One from pool) | Multidisciplinary (MDC) | 3 | 75 |
| 240/BCA/AE201 | Ability Enhancement Course – 2 (One from pool) | Ability Enhancement (AEC) | 2 | 50 |
| 240/BCA/SE201 | Skill Enhancement Course – 2 (One from pool) | Skill Enhancement (SEC) | 3 | 75 |
| 240/BCA/VA201 | Value Added Course – 2 (One from pool) | Value Added (VAC) | 2 | 50 |
Data Structures Syllabus – Unit-wise Topics
Data Structures (CC-ID4 | 240/BCA/CC201) — 4 Credits | 100 Marks (25 Internal + 50 External + 5 Practical Internal + 20 Practical External) | Duration: 3 hrs. Unit I: Fundamentals and Strings — Data structure definition, data type vs data structure, categories, operations, applications. Algorithm complexity, time-space trade-off, Big-O notation. Strings: introduction, string operations, pattern matching algorithms. Unit II: Arrays and Sorting/Searching — Linear arrays, memory representation, traversal, insertion and deletion. Multidimensional arrays, sparse matrices, 2D array operations. Sorting techniques: Bubble Sort, Merge Sort, Selection Sort, Heap Sort, Insertion Sort. Searching techniques: sequential search, binary search, search trees. Unit III: Stacks, Queues and Linked Lists — Stacks: representation and operations, applications (infix to postfix, expression evaluation). Queues: operations, circular queues, dequeue, priority queues and applications. Linked Lists: singly, doubly, circular; operations (insertion, deletion, traversal, sorting); dynamic memory management. Unit IV: Trees and Graphs — Trees: basic terminology, binary trees, linked list representation, tree operations, binary tree traversal (in-order, pre-order, post-order) with and without recursion, applications. Graphs: definitions, adjacency matrix/list representation, graph traversals (BFS/DFS), shortest path problem, applications. Lab Experiments: Linear search in 2D array, binary search (iterative and recursive), matrix operations (add/subtract/multiply/transpose), quick sort, string operations, call-by-value vs call-by-reference, BST implementation, linked list operations, file operations (insert/delete/update).
Mathematical Foundations of Computer Science Syllabus – Unit-wise Topics
Mathematical Foundations of Computer Science (CC-ID5 | 240/BCA/CC202) — 4 Credits | 100 Marks (30 Internal + 70 External) | Duration: 3 hrs. Theory-only course; no practicals. Unit I: Basic Statistics — Measures of central tendency (Mean, Mode, Median), frequency distribution tables, measures of dispersion (Range, Variance, Standard Deviation), correlation and regression analysis. Unit II: Algorithms and Graph Theory — Algorithm concepts, merits and demerits, fast exponentiation, linear and binary search, Big-O notation, complexity analysis, advantages of logarithmic algorithms. Graph theory: types of graphs, degree of vertex, subgraphs, isomorphic and homeomorphic graphs, adjacency and incidence matrices, Eulerian and Hamiltonian paths and circuits. Unit III: Trees, Recursion and Sorting — Trees, minimum distance trees, minimum weight and minimum distance spanning trees. Recursively defined functions. Merge Sort, Insertion Sort, Bubble Sort, Decimal to Binary conversion. Unit IV: Recurrence Relations and Number Theory — Linear Homogeneous Recurrence Relations (LHRR), LHRR with Constant Coefficients, Divide and Conquer Recurrence Relations (DCRR), recursive procedures. Number theory: mathematical induction, GCD, Euclidean algorithm, Fibonacci numbers, congruences and equivalence relations, public key encryption schemes.
Database Management System Syllabus – Unit-wise Topics
Database Management System (CC-ID6 | 240/BCA/CC203) — 4 Credits | 100 Marks (25 Internal + 50 External + 5 Practical Internal + 20 Practical External) | Duration: 3 hrs. Unit I: Database System Concepts and Architecture — Traditional file processing vs DBMS, characteristics and advantages of DBMS, three-schema architecture, data independence, data models, schemas and instances, database languages and interfaces, classification of DBMS. Data modeling: ER diagrams, relational model constraints, relational algebra and calculus, Codd's Rules. Unit II: Normalization and SQL — Functional dependencies and normalization (1NF to BCNF). SQL as 4GL: DDL, DML, DQL, DCL, TCL components. Data definition, data types, constraints, queries, insert/delete/update statements, views, stored procedures and functions, database triggers, SQL injection. Unit III: Query Processing and Transaction Management — Translating SQL queries into relational algebra, basic algorithms for query operations, heuristic and cost-based query optimization, semantic query optimization. Transaction processing: ACID properties, schedules and recoverability, serializability, transaction support in SQL. Database security and authorization basics. Unit IV: Concurrency Control and Recovery — Locking techniques, timestamp ordering, multiversion concurrency control (MVCC), validation-based concurrency control, granularity of data items, multiple granularity locking, concurrency control in indexes. Recovery techniques: deferred update, immediate update, shadow paging, ARIES recovery algorithm, database backup and catastrophic failure recovery. Lab Experiments: Database creation and SQL queries, insertion/deletion/modification/viewing of records, views, synonyms, sequences, indexes, save points, employee database with constraints, mini projects (Inventory Control, Hospital Management, Railway Reservation, Hotel Management, etc.).
FAQs on BCA Semester 2 Syllabus – Gurugram University (GU)
- What subjects are in BCA Semester 2 at Gurugram University? BCA Semester 2 at Gurugram University: Core – Data Structures (240/BCA/CC201, 4 cr., 100 marks), Mathematical Foundations of Computer Science (240/BCA/CC202, 4 cr., 100 marks), Database Management System (240/BCA/CC203, 4 cr., 100 marks). Plus MIC-2 (2 cr., 50 marks), MDC-2 (3 cr., 75 marks), AEC-2 (2 cr., 50 marks), SEC-2 (3 cr., 75 marks), VAC-2 (2 cr., 50 marks). Total: 24 credits, 600 marks.
- What is the syllabus for Data Structures in BCA Semester 2 at Gurugram University? Data Structures (240/BCA/CC201) is a 4-credit, 100-mark course. Unit I: Data structure fundamentals, Big-O notation, strings, pattern matching. Unit II: Arrays (linear, multidimensional, sparse matrix), sorting (Bubble, Merge, Selection, Heap, Insertion), searching (sequential, binary). Unit III: Stacks, Queues (circular, dequeue, priority), Linked Lists (singly, doubly, circular). Unit IV: Trees (binary trees, traversal — in-order, pre-order, post-order), Graphs (BFS, DFS, shortest path).
- How many credits does BCA Semester 2 carry at Gurugram University? BCA Semester 2 at Gurugram University carries 24 total credits (600 marks) across Core, MIC, MDC, AEC, SEC, and VAC courses.
- What is the syllabus for Mathematical Foundations of Computer Science in BCA Semester 2 at Gurugram University? Mathematical Foundations of Computer Science (240/BCA/CC202) is a 4-credit, 100-mark theory-only course. Unit I: Basic statistics — mean, mode, median, dispersion, correlation, regression. Unit II: Algorithms and graph theory — Big-O notation, complexity analysis, Eulerian and Hamiltonian paths. Unit III: Trees, recursion, and sorting. Unit IV covers further discrete mathematics topics relevant to computer science.
- What is the syllabus for Database Management System in BCA Semester 2 at Gurugram University? Database Management System (240/BCA/CC203) is a 4-credit, 100-mark course with practicals. Unit I: DBMS architecture, ER diagrams, relational model, Codd's Rules. Unit II: Normalization (1NF to BCNF) and SQL — DDL, DML, DQL, DCL, TCL, views, stored procedures, triggers. Units III and IV cover transaction management and further database concepts.