⚠️ If you find any broken or incorrect document links, report it here.

MCA Semester 1 Syllabus – Gurugram University (GU) NEP 2024-25

Semester 1 (22 credits) covers C Programming, Operating Systems, Artificial Intelligence, Web Designing Fundamentals, Blockchain Technology, English Communication Level 1, and MDC (Understanding Ambedkar / Introduction to Economics / Fundamentals of Geography / History & Culture of Haryana).

Quick Answer: MCA Semester 1 Syllabus – GU NEP 2020

Total Credits: 22 | Framework: NEP 2020, Scheme PG A1

Exam pattern for core (4-credit) subjects: 25 Internal + 50 External + 5 Practical Internal + 20 Practical External = 100 marks.

MCA Semester 1 Syllabus – Gurugram University (GU) | NEP 2020

📱 Note for Mobile Users: Scroll horizontally to view the complete table
MCA Semester 1 – Credit Distribution (Total: 22 Credits)
Course Code Subject Category Credits Max Marks
241/MCA/CC101 Computer Fundamentals and Programming in C Core (CC) 4 100
(25+50+5+20)
241/MCA/CC102 System Software and Operating Systems Core (CC) 4 100
(25+50+5+20)
241/MCA/CC103 Artificial Intelligence and Applications Core (CC) 4 100
(25+50+5+20)
241/MCA/DS101 Web Designing Fundamentals Elective (DSE) 3 75
241/CSAI/VA101 Blockchain Technology Value Added (VAC) 2 50
241/ENG/AE101 English Communication Skills – Level 1 Ability Enhancement (AEC) 2 50
MDC Pool Understanding Ambedkar OR Introduction to Economics OR Fundamentals of Geography OR History & Culture of Haryana Multidisciplinary (MDC) 3 75
CORE

Computer Fundamentals and Programming in C Syllabus – Unit-wise Topics

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

Computer Fundamentals and Programming in C (CC-A01 | 241/MCA/CC101) — 4 Credits | 100 Marks (25 Internal + 50 External + 5 Viva + 20 Practical). This course introduces the fundamentals of computers, problem-solving techniques, and programming using the C language. Unit I: Computer Fundamentals — Concept of data and information, components of a computer system, input and output devices, CPU components, memory and storage devices, classification of computers, advantages and limitations of computers, and applications of computers. Social concerns of computer technology including positive and negative impacts, computer crimes, viruses, and their remedial solutions. Computer software concepts including system software and application software, overview of operating systems, programming languages (Machine Language, Assembly Language, High-Level Language, and Fourth Generation Language - 4GL), language translators, linker, and loader. Unit II: Problem Solving and C Programming Fundamentals — Problem identification and analysis, algorithms, flowcharts, pseudocode, decision tables, program coding, program testing, and execution. Introduction to C programming including keywords, variables, constants, and the structure of a C program. Unit III: Operators, Expressions and Decision Making — Arithmetic, unary, logical, bitwise, assignment, and conditional operators and expressions. Decision-making constructs using if, if-else, else-if ladder, switch statements, along with break, continue, and goto statements. Unit IV: Loops and Functions — Looping constructs using while, do-while, and for loops, including nested loops. Functions in C including user-defined functions, library functions, function prototypes, passing arguments, passing array arguments, recursion, use of library functions, macro versus functions, and pointers in C.

CORE

System Software and Operating Systems Syllabus – Unit-wise Topics

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

System Software and Operating Systems (CC-A02 | 241/MCA/CC102) — 4 Credits | 100 Marks. This course provides a comprehensive understanding of operating system concepts, process management, memory management, file systems, and disk management, along with comparative studies of modern operating systems. Unit I: Introduction, Processes and Process Scheduling — Concept of Operating Systems, generations of operating systems, types of operating systems, and OS services. Processes including definition, process relationships, process states, state transitions, Process Control Block (PCB), and context switching. Threads including definition, states, benefits, types, and multithreading. Process scheduling concepts including scheduling objectives, types of schedulers, scheduling criteria such as CPU utilization, throughput, turnaround time, waiting time, and response time. Scheduling algorithms including pre-emptive and non-pre-emptive scheduling, FCFS, SJF, SRTF, and Round Robin (RR). Unit II: Inter-process Communication and Deadlocks — Critical section, race conditions, mutual exclusion, producer-consumer problem, semaphores, event counters, monitors, and message passing. Classical IPC problems including Reader-Writer and Dining Philosopher problems. Deadlocks including definition, necessary and sufficient conditions, deadlock prevention, deadlock avoidance using Banker's Algorithm, deadlock detection, and recovery techniques. Unit III: Memory Management and Virtual Memory — Basic concepts of memory management, logical and physical address mapping, contiguous memory allocation, fixed and variable partitioning, internal and external fragmentation, and compaction. Paging concepts including page allocation, hardware support, protection and sharing mechanisms, and limitations of paging. Virtual memory concepts including locality of reference, page faults, working set, dirty page/dirty bit, demand paging, and page replacement algorithms such as Optimal, FIFO, and Least Recently Used (LRU). Unit IV: File Management, Disk Management and Case Studies — Concepts of files, file access methods, file types, file operations, directory structures, file system structure, and file allocation methods including contiguous, linked, and indexed allocation. Disk management topics including disk structure, disk scheduling algorithms (FCFS, SSTF, SCAN, and C-SCAN), disk reliability, disk formatting, boot blocks, and bad blocks. Case studies and comparative analysis of Windows, UNIX, and Linux operating systems.

CORE

Artificial Intelligence and Applications Syllabus – Unit-wise Topics

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

Artificial Intelligence and Applications (CC-A03 | 241/MCA/CC103) — 4 Credits | 100 Marks. This course introduces the fundamental concepts of Artificial Intelligence, knowledge representation, AI programming languages, search techniques, reasoning methods, and expert systems. Unit I: Introduction to Artificial Intelligence — History and definition of Artificial Intelligence, emulation of human cognitive processes, knowledge search trade-offs, stored knowledge, semantic networks, abstract views of modelling, elementary knowledge representation, computational logic, analysis of compound statements using logical connectives, predicate logic, knowledge organization and manipulation, and knowledge acquisition techniques. Unit II: Programming and Logics in Artificial Intelligence — Introduction to LISP and other AI programming languages, LISP syntax and numerical functions, distinctions between LISP and PROLOG, input/output operations, local variables, interaction and recursion, property lists and arrays, alternative programming languages, formalized symbolic logic, properties of Well-Formed Formulas (WFFs), non-deductive inference methods, handling inconsistencies and uncertainties, Truth Maintenance Systems (TMS), default reasoning, closed-world assumption, modal logic, and temporal logic. Unit III: Search Methods and Knowledge Representation — Fuzzy logic concepts and applications, probabilistic reasoning, Bayesian probabilistic inference, Dempster-Shafer theory, possible-world representation, ad hoc reasoning methods, structured knowledge representation using graphs, frames, and related structures, object-oriented representation including object classes, messages and methods, simulation examples using OOP programs and languages, search and control strategies, search problems, uninformed (blind) search techniques, and searching AND-OR graphs. Unit IV: Knowledge Organization and Communication in Expert Systems — Matching techniques including exact, partial, and fuzzy matching, RETE matching algorithm, knowledge organization, indexing and retrieval techniques, integration of knowledge in memory organization systems, perception and communication in expert systems, overview of linguistics, basic parsing techniques, semantic analysis, knowledge representation structures, natural language generation, and natural language processing systems.

ELECTIVE (DSE)

Web Designing Fundamentals Syllabus – Unit-wise Topics

Web Designing Fundamentals (DSE-01 | 241/MCA/DS101) — 3 Credits | 75 Marks (15 Internal Theory + 35 External Theory + 5 Practical Internal + 20 Practical External) | Duration: 3 hrs. This course covers the fundamentals of the Internet and World Wide Web, web publishing, HTML-based web development, and Dynamic HTML with CSS. Unit I: Introduction to Internet and World Wide Web — Introduction to Internet and World Wide Web, evolution and history of the World Wide Web, basic features, web browsers, web servers, Hypertext Transfer Protocol (HTTP), overview of TCP/IP and its services, URLs, searching and web-casting techniques, search engines and search tools. Unit II: Web Publishing — Hosting your site, Internet Service Provider (ISP), web terminologies, phases of planning and designing a website, steps for developing a site, choosing contents, home page, domain names, Front Page views, adding pictures, links, backgrounds, relating Front Page to DHTML. Creating a website and markup languages (HTML, DHTML). Unit III: Web Development with HTML — Introduction to HTML, hypertext and HTML, HTML document features, HTML command tags, creating links, headers, text styles, text structuring, text colors and background, formatting text, and page layouts. Unit IV: Advanced HTML and DHTML — Images, ordered and unordered lists, inserting graphics, table creation and layouts, frame creation and layouts, working with forms and menus, working with radio buttons, check boxes, and text boxes. Dynamic HTML (DHTML): features of DHTML, CSSP (Cascading Style Sheet Positioning) and JSSS (JavaScript Assisted Style Sheet), layers of Netscape, the ID attributes, and DHTML events.

VALUE ADDED (VAC)

Blockchain Technology Syllabus – Unit-wise Topics

Blockchain Technology (VAC-1 | 241/CS/VA101) — 2 Credits | 50 Marks (15 Internal + 35 External) | Duration: 3 hrs. This Value Added Course introduces blockchain concepts, consensus models, permissioned blockchains, financial applications, and blockchain security. Unit I: Introduction to Blockchain — Overview of blockchain, need for blockchain, history of centralized services, trusted third party, distributed consensus in open environments, Distributed vs Decentralized Network, 51% attack theory, public blockchains, private blockchains, blockchain architecture and working, mining, limitations of blockchain, and applications of blockchain. Unit II: Models for Blockchain — GARAY model, RLA Model, Proof of Work (PoW), Hashcash PoW, PoW attacks and the monopoly problem, Proof of Stake (PoS), hybrid models (PoW+PoS), Proof of Burn, and Proof of Elapsed Time. Unit III: Permissioned Blockchain — Permissioned model and use cases, design issues for permissioned blockchains, state machine replication, consensus models for permissioned blockchain, distributed consensus in closed environment, Paxos, RAFT Consensus, Byzantine General Problem, Byzantine Fault Tolerant system, Lamport-Shostak-Pease BFT Algorithm, and BFT over asynchronous systems. Unit IV: Blockchain in Financial Service and Security — Digital currency, cross-border payments, Stellar and Ripple protocols, Project Ubin, Know Your Customer (KYC), privacy consents, mortgage over blockchain, blockchain-enabled trade, We Trade – Trade Finance Network, supply chain financing, insurance. Blockchain Security: security properties, security considerations for blockchain, Intel SGX, identities and policies, membership and access control, blockchain crypto service providers, privacy in a blockchain system, privacy through Fabric Channels, and smart contract confidentiality.

MULTIDISCIPLINARY (MDC)

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

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

Understanding Ambedkar (251/MPSIR/MD101) — 3 Credits | 75 Marks. Unit I: Life, Context and Intellectual Formation — social background, caste discrimination, influence of Phule, Buddhism, Enlightenment thought. Unit II: Ambedkar's Social and Political Thought — critique of caste, views on democracy, equality, political economy, critique of capitalism and Marxism. Unit III: Legacy and Contemporary Relevance — identity politics in modern India, Dalit movements, Ambedkarite politics, global relevance in Human Rights discourse.

Introduction to Economics (241/ECO/MD101) — 3 Credits | 75 Marks. Covers basic economics concepts including micro vs macro economics, law of supply and demand, economic growth vs development, GDP, sustainable development, mixed economy, capitalist economy.

Fundamentals of Geography (24/GEO/MD101) — 3 Credits | 75 Marks. Unit I: Shape/origin of Earth, maps, latitudes/longitudes, time zones. Unit II: Rocks, landforms, volcanoes, earthquakes, weathering. Unit III: Atmosphere, climate, temperature zones, winds, cyclones. Unit IV: Ocean relief, temperature, salinity, currents.

History and Culture of Haryana (MDC-1) — 3 Credits | 75 Marks. Unit I: Ancient Haryana — Harappan civilization, Vedic civilization, Mahabharata, Yaudheyas. Unit II: Medieval Haryana — Sultanate, Mughal period, Bhakti-Sufi movements. Unit III: Modern Haryana — national movement, Arya Samaj, 1857 revolt, non-cooperation movement. Unit IV: Brief overview of Haryana geography, industries, agriculture, tourism, social welfare schemes.

FAQs on MCA Semester 1 Syllabus – Gurugram University (GU)

  • What subjects are in MCA Semester 1 at Gurugram University? MCA Semester 1 at GU covers: Core – Computer Fundamentals & C Programming (241/MCA/CC101), System Software & Operating Systems (241/MCA/CC102), Artificial Intelligence (241/MCA/CC103). DSE – Web Designing Fundamentals (241/MCA/DS101). VAC – Blockchain Technology (241/CSAI/VA101). AEC – English Communication Skills Level 1 (241/ENG/AE101). MDC – one subject from the university pool. Total: 22 credits.
  • Which MDC can I choose in MCA Semester 1 at Gurugram University? Students can choose from: Understanding Ambedkar (251/MPSIR/MD101), Introduction to Economics (241/ECO/MD101), Fundamentals of Geography (24/GEO/MD101), or History and Culture of Haryana. One MDC (3 credits, 75 marks) is selected from the university's PG pool.
  • How many credits does MCA Semester 1 carry at Gurugram University? MCA Semester 1 at GU carries 22 total credits across Core, DSE, VAC, AEC, and MDC courses.
  • What is the exam pattern for MCA core subjects at GU? Nine questions are set for each 4-credit core subject. Q1 has 7 short parts covering all units (20% marks). Two questions per unit (Q2–Q9); students attempt 5 total — Q1 compulsory plus one from each unit. Marking: 25 Internal Theory + 50 External Theory + 5 Practical Internal + 20 Practical External = 100 marks.
  • Where can I download MCA Semester 1 question papers for GU? Free MCA Semester 1 question papers for Gurugram University are available at /mca/mcasem1 on UniversityNotes.