MCA Semester 2 Syllabus – Gurugram University (GU) NEP 2025-26

CORE

Database Management System Syllabus – Unit-wise Topics

📊 Exam Pattern: 25 Internal + 50 External + 5 Viva + 20 Practical = 100 Marks

Database Management System (CC-A04 | 241/MCA/CC201) — 4 Credits | 100 Marks (25 Internal + 50 External + 5 Viva + 20 Practical). This course provides a comprehensive understanding of database concepts, data modeling, SQL, query processing, transaction management, concurrency control, database security, and recovery mechanisms. Unit I: Database System Concepts and Architecture — Characteristics and advantages of traditional file processing systems versus DBMS, database management systems, three-schema architecture, data independence, data models, schemas and instances, database languages and interfaces, and classification of DBMS. Data modeling concepts including Entity-Relationship (ER) diagrams, relational model constraints, relational database schemas, relational algebra, relational calculus, and Codd's Rules for relational databases. Unit II: Normalization and SQL — Functional dependencies and normalization techniques for relational databases, including normalization concepts from First Normal Form (1NF) to Boyce-Codd Normal Form (BCNF). SQL as a Fourth Generation Language (4GL), SQL components including DDL, DML, DQL, DCL, and TCL. Data definition, data types, constraints, queries, insert, delete and update statements, views, stored procedures, stored functions, database triggers, and SQL injection concepts. Unit III: Query Processing, Optimization and Transaction Processing — Translating SQL queries into relational algebra, basic algorithms for executing query operations, heuristic query optimization, selectivity and cost estimation techniques, and semantic query optimization. Transaction processing concepts including transaction properties (ACID), schedules and recoverability, serializability of schedules, transaction support in SQL, and fundamentals of database security and authorization. Unit IV: Concurrency Control and Database Recovery — Concurrency control techniques including locking mechanisms, timestamp ordering, multiversion concurrency control (MVCC), validation-based concurrency control, granularity of data items, multiple granularity locking, and concurrency control in indexes. Database recovery concepts including deferred update recovery, immediate update recovery, shadow paging, ARIES recovery algorithm, database backup strategies, and recovery from catastrophic failures.

CORE

Data Structures and Algorithms Syllabus – Unit-wise Topics

📊 Exam Pattern: 25 Internal Theory + 50 External Theory + 5 Practical Internal + 20 Practical External = 100 Marks

Data Structures and Algorithms (CC-A05 | 241/MCA/CC202) — 4 Credits | 100 Marks. This course covers fundamental and advanced data structures, their implementation in C/C++, and algorithms for efficient data organization, manipulation, and problem-solving. Unit I: Introduction and Arrays — Data types including primitive, composite, and abstract data types. Concepts, classification, and importance of data structures; comparison of data structures and data types; linear and non-linear data structures. Arrays including single-dimensional and multidimensional arrays, address calculation using row-major and column-major ordering, array operations, vectors, sparse matrices, applications of arrays, and implementation of arrays in C/C++. Unit II: Stacks, Queues and Linked Lists — Representation of stacks and queues using arrays and linked lists. Circular queues, priority queues, and double-ended queues (D-Queues/Deque). Applications of stacks including infix to postfix and prefix conversion and postfix expression evaluation. Linked lists including singly linked lists and operations on linked lists, linked stacks and queues, polynomial representation and manipulation using linked lists, circular linked lists, doubly linked lists, and implementation in C/C++. Unit III: Trees and Heaps — Concepts, representation, and applications of trees and forests. Binary trees, threaded binary trees, binary tree representation of general trees, conversion of forests into trees, binary search trees, height-balanced AVL trees, B-Trees, B+ Trees, and B* Trees. Binary tree traversal methods including preorder, inorder, and postorder traversal, along with recursive algorithms. Heap structures including heap operations, binomial heaps, Fibonacci heaps, skew heaps, and heap sets. Unit IV: Graphs and Graph Algorithms — Graph representation using adjacency matrices and adjacency lists, types of graphs, Euler graphs, Hamiltonian paths and circuits, cut-sets, connectivity and separability, planar graphs, graph isomorphism, graph coloring, covering, and partitioning. Graph algorithms including Breadth-First Search (BFS), Depth-First Search (DFS), Minimum Spanning Tree algorithms (Prim's and Kruskal's), shortest-path algorithms (Dijkstra's and Floyd's), topological sorting, Ford-Fulkerson maximum flow algorithm, and Max-Flow Min-Cut theorem.

CORE

Object Oriented Programming Using Java Syllabus – Unit-wise Topics

📊 Exam Pattern: 25 Internal Theory + 50 External Theory + 5 Practical Internal + 20 Practical External = 100 Marks

Object Oriented Programming Using Java (CC-A06 | 241/MCA/CC203) — 4 Credits | 100 Marks. This course introduces Java programming, object-oriented concepts, multithreading, exception handling, packages, interfaces, and GUI development using AWT and Swing. Unit I: Introduction to Java and Language Basics — Evolution of Java, overview and characteristics of Java, Java program compilation and execution process, Java Virtual Machine (JVM), platform independence and portability, security features, relationship between JVM, JRE, and JDK, and introduction to JAR format. Java language fundamentals including constants, data types, variables, scope of variables, type casting, operators, expressions, statements, arrays, and strings. Unit II: Object-Oriented Programming Implementation — Classes, objects, attributes, methods, data encapsulation, reference variables, introduction to methods, constructors, and constructor overloading. Inheritance and polymorphism including basics of inheritance, method overriding, the this keyword, super keyword, final variables, methods and classes, method overloading, method overriding, Java garbage collection, and the finalize() method. Unit III: Interfaces, Packages, Multithreading and Exception Handling — Interfaces and their implementation, differences between interfaces and abstract classes, using extends and implements together. Packages including defining packages, setting CLASSPATH, package naming conventions, creating packages, package accessibility, and using package members. Multithreading concepts including main thread, Java thread model, thread priorities, synchronization, and inter-thread communication. Exception handling including exceptions, try-catch blocks, handling multiple exceptions, finally clause, types of exceptions, and user-defined exceptions. Unit IV: Swing and AWT Programming — Introduction to Swing, Swing class hierarchy, containers, user interface components, and graphics context. AWT concepts including AWT components, component class, container class, and layout managers such as Border Layout, Flow Layout, Grid Layout, Card Layout, GridBag Layout, and Default Layout. Event handling in AWT including event models, listeners, adapters, Action Events, Focus Events, Key Events, Mouse Events, and Window Events.

ELECTIVE (DSE)

Security in Computing Syllabus – Unit-wise Topics

Security in Computing (DSE | 241/MCA/DS201) — 3 Credits | 75 Marks (25 Internal + 50 External) | Duration: 3 hrs. This course covers security fundamentals, malware, network threats, cryptography, authentication, access control, intrusion detection, firewalls, and cyber laws. Unit I: Security Basics and Introduction to Malware — General overview, terminology and definitions, security models, security policy issues. Introduction to malicious code: spyware, ransomware, logic bombs, virus, bacteria and worms, and introduction to anti-malware technology. Unit II: Threats to Network Communications and Authentication — Threats to network communications including interception (eavesdropping and wiretapping), modification, fabrication (data corruption), interruption (loss of service), and port scanning. Introduction to cryptography and classical cryptosystems, steganography vs cryptography. Authentication: identification versus authentication, authentication based on something you know / something you are / something you have, federated identity management, multifactor authentication, secure authentication, and password policies. Unit III: Access Control and Intrusion Detection — Access control: access policies, implementing access control, procedure-oriented access control, role-based access control (RBAC), and CAPTCHAs. Intrusion Detection and Response: goals for intrusion detection systems, types of IDSs — anomaly-based and signature-based. Unit IV: Firewalls and Legal & Ethical Issues — Firewalls: what is a firewall, design of firewalls, types of firewalls, personal firewalls, comparison of firewall types, Network Address Translation (NAT), and example firewall configurations. Legal and Ethical Issues: protecting programs and data — copyrights, patents, trade secrets; information and the law — information as an object, legal issues relating to information, protection for computer artifacts; ethical issues in computer security; introduction to cyber crimes and cyber laws and IT Act 2000.

ABILITY ENHANCEMENT (AEC)

English Language Teaching – AEC Level 2 Syllabus – Unit-wise Topics

English Language Teaching – AEC Level 2 (241/ENG/AE201) — 2 Credits | 50 Marks (15 Internal + 35 External). This course focuses on English Language Teaching (ELT) theories and methods, grammar teaching through literature, and professional communication skills through business English and correspondence. Unit I: ELT – Approaches, Principles and Methods of ELT — English language learning theories, language teaching methods, approaches and principles of English Language Teaching (ELT), and analysis of learners' errors. Unit II: Literature, ELT and Grammar — Teaching English grammar through literature including poetry, fiction, and drama. Grammar games, English functional grammar, and the Indian and Western traditions of grammar. Unit III: Business English and Business Correspondence — Business Correspondence–I including building business vocabulary, news reports, business magazines, business letters, and business travel communication. Business Correspondence–II including writing using technology such as faxes and emails, preparing resumes, and writing minutes of meetings. Examination Pattern — Question 1: Short-answer questions (attempt any four out of six) carrying 8 marks (4 × 2). Question 2: Descriptive/essay question from Unit I (9 marks). Question 3: Descriptive/essay question from Unit II (9 marks). Question 4: Descriptive/essay question from Unit III (9 marks).

SKILL ENHANCEMENT (SEC)

Problem Solving using Python Programming Syllabus – Unit-wise Topics

Problem Solving using Python Programming (SEC | 241/MCA/SE201) — 2 Credits | 50 Marks (5 Internal Theory + 20 External Theory + 5 Practical Internal + 20 Practical External) | Duration: 3 hrs. This Skill Enhancement Course develops algorithmic problem-solving skills and Python programming competence through hands-on practice. Unit I: Fundamentals of Computing and Algorithms — Identification of computational problems, algorithms, building blocks of algorithms (statements, state, control flow, functions), notation (pseudocode, flowchart, programming language), algorithmic problem solving, and simple strategies for developing algorithms (iteration, recursion). Illustrative problems: find minimum in a list, insert a card in a list of sorted cards, guess an integer number in a range, Towers of Hanoi. Unit II: Python Basics — Python interpreter and interactive mode, debugging; values and types: int, float, boolean, string, and list; variables, expressions, statements, tuple assignment, precedence of operators, and comments. Illustrative programs: exchange the values of two variables, circulate the values of n variables, distance between two points. Unit III: Conditionals, Iteration, Functions and Strings — Conditionals: boolean values and operators, conditional (if), alternative (if-else), chained conditional (if-elif-else). Iteration: state, while, for, break, continue, pass. Fruitful functions: return values, parameters, local and global scope, function composition, recursion. Strings: string slices, immutability, string functions and methods, string module. Lists as arrays. Illustrative programs: square root, GCD, exponentiation, sum an array of numbers, linear search, binary search. Unit IV: Lists, Tuples, Dictionaries, Files and Exceptions — Lists: list operations, list slices, list methods, list loop, mutability, aliasing, cloning lists, list parameters. Tuples: tuple assignment, tuple as return value. Dictionaries: operations and methods. Advanced list processing — list comprehension. Illustrative programs: simple sorting, histogram, student marks statement, retail bill preparation. Files and exceptions: text files, reading and writing files, format operator, command line arguments, errors and exceptions, handling exceptions, modules, packages. Illustrative programs: word count, copy file, voter's age validation, marks range validation.

MULTIDISCIPLINARY (MDC)

MDC Options – Semester 2 (Choose One from Pool): Syllabus – Unit-wise Topics

MDC Options – Semester 2 (Choose One from Pool):

Understanding Gandhi (251/MPS/MD201) — 3 Credits | 75 Marks. Unit I: Life and Intellectual Influences — Gandhi's early life in India and South Africa, influence of Tolstoy, Thoreau, Ruskin, Gita, Jain traditions, experiment with truth. Unit II: Gandhi's Political Thought and Social Philosophy — critique of Western civilization, Swaraj and Trusteeship, Satyagraha, Civil Disobedience, religion, communal harmony, influence dialogue. Unit III: Legacy and Contemporary Relevance — Gandhi's influence on global movements, Black movements, environmentalism; Gandhi in Contemporary India: relevance and contestations.

Financial Institution & Market (241/ECO/MD201) — 3 Credits | 75 Marks. Covers Non-Banking Financial Companies (NBFCs), Call Money Market, Gilt-Edged Securities, Equity, Commercial Paper, Mutual Funds, SEBI objectives and functions, Money Market, Stock Market, Government Bonds, Corporate Bonds, Indian financial system.

Geography of Haryana (241/GEO/MD201 — Paper ID 234020) — Physiographic Regions, Semi-Desert Plains, Soils, Rainfall Patterns, Population Growth, Tube Well Irrigation, Rice Cultivation, IT-Based Industries, Railway Network, Khadar, Bhindawas Wildlife Sanctuary, Cyber City of Haryana.

Historical Applications of Tourism (Paper ID 234030) — Heritage tourism, cultural tourism, temple circuits, Mahabalipuram, Kanchipuram, Tanjore, Haryana tourism, rural tourism, travel agencies.