M.M.

(DEEMED TO BE UNIVERSITY) , MULLANA (AMBALA) Batch 2020-2024 onwards

B. Tech. (4th Sem)

(Common for CSE, CSE with Specialization in Data Science, CSE with specialization in Cloud Technology & Information Security, CSE with
specialization in Big Data and Analytics, CSE with specialization in Full Stack Development, CSE with specialization in AI & Machine Learning)
BCSE-507 (Operating System)
L T P Continuous evaluation 40
3 0 0 End semester exam 60
Total marks 100
Credits 3.0
Course Objectives:
i) To understand evolution and types of OS and to understand the structure, components and functions of OS.
ii) To learn about Processes, threads and various Scheduling policies.
iii) To understand process concurrency and synchronization.
iv) To understand the principles of concurrency and Deadlocks.
v) To understand various memory management schemes.
vi) To understand virtual memory management, Disk management, I/O management and File systems.
Unit:-1 (9 Hours)
Introduction- Concept of Operating Systems, Generations of Operating systems, Types of operating Systems, OS Services, System
Calls, System programs, Structure of an OS- Layered, Monolithic, Microkernel Operating Systems, Concept of Virtual Machine. Case
study on UNIX and WINDOWS Operating System. Processes - Definition, Process Relationship, Different states of a Process,
Process State transitions, Process Control Block (PCB), Context switching .
Thread- Definition, Various states, Benefits of threads, Types of threads, Concept of Multithreads.
Unit:-2 (9 Hours)
Process Scheduling- Foundation and Scheduling objectives, Types of Schedulers, Scheduling criteria (CPU utilization, Throughput,
Turnaround Time, Waiting Time, Response Time), Scheduling algorithms (Pre-emptive and Non pre-emptive, FCFS, SJF, RR),
Multiprocessor scheduling, Real Time scheduling (RM and EDF). Inter -process Communication- Critical Section, Race Conditions,
Mutual Exclusion, Hardware Solution, Strict Alternation, Peterson’s Solution, The Producer\Consumer Problem, Semaphores, Event
Counters, Monitors, Message Passing, Classical IPC Problems (Reader’s & Writer Problem, Dinning Philosopher Problem etc).
Deadlocks- Definition, Necessary and sufficient conditions for Deadlock, Deadlock Prevention, Deadlock Avoidance (Banker’s
algorithm), Deadlock detection and Recovery.
Unit:-3 (9 Hours)
Memory Management- Basic concept, Logical and Physical address map, Memory allocation- Contiguous Memory allocation (Fixed
and variable partition, Internal and External fragmentation and Compaction), Paging (Principle of operation, Page allocation,
Hardware support for paging, Protection and sharing, Disadvantages of paging). Virtual Memory- Basics of Virtual Memory, Hardware
and control structures, Locality of reference, Page fault, Overlays, Working Set, Dirty page / Dirty bit, Demand paging, Page
Replacement algorithms (Optimal, First in First Out (FIFO), Second Chance (SC), Not recently used (NRU) and Least Recently us ed
(LRU)), Thrashing.
Unit:-4 (9 Hours)
File Management- Concept of File, Access methods, File types, File operation, Directory structure, File System structure, Allocation
methods (contiguous, linked, indexed), Free-space management (bit vector, linked list, grouping), directory implementation (linear list,
hash table), efficiency and performance. Disk Management - Disk structure, Disk scheduling (FCFS, SSTF, SCAN, C -SCAN), Disk
reliability, Disk formatting, Boot-block, Bad blocks. Resource Protection- Mechanism, Policies and Domain of protection, Access
matrix and its implementation, Dynamic Protection Structure.
Course Outcomes: After completion of this course, students will be able to:
i) Describe the important computer system resources and the role of operating system in their management policies and algorithms.
ii) Understand the process management policies and scheduling of processes by CPU .
iii) Evaluate the requirement for process synchronization and coordination handled by operating system.
iv) Describe and analyze the memory management and its allocation policies.
v) Identify, use and evaluate the storage management policies with respect to different storage management technologies.
Instructions for paper setter: All Questions are compulsory. The Question paper is divided in to four sections A, B, C and D.
Section A is compulsory and comprises of 12 questions of one mark each, 3 from each unit. The questions shall be asked in suc h a
manner that there are no direct answers including one word answer, fill in the blanks or multiple choice questions. Section B
comprises of 4 questions of 2 marks each, one from each unit. Section C Comprises of 4 questions of 4 marks each, one from ea ch
unit. Section D Comprises of 4 questions of 6 marks each, one from each unit. There is no overall choice, however internal choice
may be provided in section C and D, if paper setter so desires.
Text Books:
1. Avi Silberschatz, Peter Galvin, Greg Gagne, “Operating System Concepts Essentials”, 9th Edition, Wiley Asia Student Edition.
2. William Stallings,“Operating Systems: Internals and Design Principles”, 5th Edition, Prentice Hall of India.
3. Charles Crowley, “Operating System: A Design-oriented Approach”, 1st Edition , Irwin Publishing.
Reference Books:
1. Gary J. Nutt,“Operating Systems: A Modern Perspective”, 2nd Edition, Addison-Wesley.
2. Maurice Bach, “Design of the Unix Operating Systems”, 8th Edition, Prentice-Hall of India.
3. Daniel P. Bovet, Marco Cesati,“Understanding the Linux Kernel”, 3rd Edition, O’Reilly and Associates.
 M.M. (DEEMED TO BE UNIVERSITY) , MULLANA (AMBALA) Batch 2020-2024 onwards

B. Tech. (4th Sem)

(Common for CSE, CSE with Specialization in Data Science, CSE with specialization in Cloud Technology & Information Security, CSE with
specialization in Big Data and Analytics, CSE with specialization in Full Stack Development, CSE with specialization in AI & Machine Learning)
BCSE-508 (Design and Analysis of Algorithm)

L T P Continuous evaluation 40
3 0 0 End semester exam 60
Total marks 100
Credits 3.0
Course Objectives:
i) Analyze the asymptotic performance of algorithms.
ii) Apply important algorithmic design paradigms and methods of analysis.
iii) To study about greedy, dynamic, backtracking and branch and bound techniques.
iv) To study various shortest path algorithms.
v) To understand the mathematical criterion for deciding whether an algorithm is efficient, and know many
practically important problems that does not admit any efficient algorithms.
Unit:-1 (8 Hours)
Introduction: Algorithm, Analyzing algorithms, Asymptotic notation, recurrence relations, S orting in linear time.
Problem solving techniques: Introduction to problem solving, Computational problem & its classification, Logic & its
types.
Divide & Conquer strategy: Methodology, Merge sort, Quick sort.
Unit:-2 (10 Hours)
Greedy algorithms: Elements, Activity-selection problem, Optimal Merge Pattern & Huffman code, Job scheduling with
deadline (task scheduling) problem, Knapsack problem, Minimum spanning tree using Kruskal and Prim's algorithm,
Single source shortest paths (Dijkstra's algorithm).
Dynamic programming: Elements, 0/1 Knapsack problem, Matrix-chain multiplication, Longest common subsequence,
All pairs shortest paths (Floyd-Warshall algorithm, transitive closure).
Unit:-3 (9 Hours)
Back Tracking: Overview, 8-Queen problem, Knapsack problem.
Branch and Bound: LC Searching, Bounding, FIFO Branch and Bound, LC Branch and Bound, 0/1 Knapsack Problem,
Traveling Salesman Problem.
Problem Classes: Introduction to P, NP, NP-hard and NP-complete problems.
Unit:-4 (9 Hours)
Directed Acyclic Graph: Topological sort, Strongly connected component, Single source shortest paths for directed
acyclic graphs, Single source shortest path (Bellman-Ford algorithm), Difference constraints and shortest paths.
Flow Network: Ford-Fulkerson method, Maximum bipartite matching.

Course Outcomes: After completion of this course, student is able to:

i) Calculate time complexity of any given algorithm.
ii) Solve real life problems with the help of various problem solving techniques such as Divide Conquer, Greedy ,
Dynamic programming, and Backtracking.
iii) Identify class of particular problem (whether solvable or not).
iv) Apply and implement graph algorithms to solve real life problems.
Instructions for paper setter: All Questions are compulsory. The Question paper is divided in to four sections A, B, C
and D. Section A is compulsory and comprises of 12 questions of one mark e ach, 3 from each unit. The questions shall
be asked in such a manner that there are no direct answers including one word answer, fill in the blanks or multiple
choice questions. Section B comprises of 4 questions of 2 marks each, one from each unit. Sectio n C Comprises of 4
questions of 4 marks each, one from each unit. Section D Comprises of 4 questions of 6 marks each, one from each unit.
There is no overall choice, however internal choice may be provided in section C and D, if paper setter so desires.
Text Books:
1. Cormen, Leiserson and Rivest, “Introduction to Algorithms”, 2nd edition, PHI.
2. Horowitz, Ellis and Sahni, Sartaj, “Fundamentals of Computer Algorithms”, Galgotia Publications.
Reference Books:
1. Aho, Hopcroft and Ullman, “The Design and Analysis of Computer Algorithms”, Addison Wesley.
2. R. B. Patel, “Expert Data Structures with C”, Khanna Publications, 2nd Edition 2004.
 M.M. (DEEMED TO BE UNIVERSITY) , MULLANA (AMBALA) Batch 2020-2024 onwards

B. Tech. (4th Sem)

(Common for CSE, CSE with Specialization in Data Science, CSE with specialization in Cloud Technology & Information Security, CSE with
specialization in Big Data and Analytics, CSE with specialization in Full Stack Development, CSE with specialization in AI & Machine Learning)
BCSE-509 (Computer Networks)

L T P Continuous evaluation 40
3 0 0 End semester exam 60
Total marks 100
Credits 3.0
Course Objectives:
i) To develop an understanding of modern network architectures from a design and performance perspective.
ii) To introduce the student to the major concepts involved in wide-area networks (WANs), local area networks (LANs) and
Wireless LANs (WLANs).
iii) To provide an opportunity to do network programming.
iv) To provide a WLAN measurement ideas.

Unit:-1 (9 Hours)
Data communication Components: Representation of data and its flow Networks , Various Connection Topology, Protocols and
Standards, OSI model, Transmission Media, LAN: Wired LAN, Wireless LANs, connecting LAN and Virtual LAN
Techniques for Bandwidth utilization: Multiplexing - Frequency division, Time division and Wave division, Concepts on spread
spectrum.
Unit:-2 (9 Hours)
Data Link Layer and Medium Access Sub Layer: Error Detection and Error Correction - Fundamentals, Block coding, Hamming
Distance, CRC; Flow Control and Error control protocols - Stop and Wait, Go back – N ARQ, Selective Repeat ARQ, Sliding Window,
Piggybacking, Random Access, Multiple access protocols -Pure ALOHA, Slotted ALOHA, CSMA/CD,CDMA/CA.
Unit:-3 (9 Hours)
Network Layer: Switching, Logical addressing – IPV4, IPV6; Address mapping – ARP, RARP, BOOTP and DHCP–Delivery,
Forwarding and Unicast Routing protocols.
Unit:-4 (9 Hours)
Transport Layer: Process to Process Communication, User Datagram Protocol (UDP), Transmission Control Protocol (TCP), SCTP
Congestion Control; Quality of Service, QoS improving techniques: Leaky Bucket and Token Bucket algorithm.
Application Layer: Domain Name Space (DNS), DDNS, TELNET, EMAIL, File Transfer Protocol (FTP), WWW, HTTP, SNMP,
Bluetooth, Firewalls, Basic concepts of Cryptography.
Course Outcomes: After completion of this course, students will be able to:
i) Explain the functions of the different layer of the OSI Protocol.
ii) Draw the functional block diagram of wide-area networks (WANs), local area networks (LANs) and Wireless LANs (WLANs)
describe the function of each block.
iii) For a given requirement (small scale) of wide-area networks (WANs), local area networks (LANs) and Wireless LANs (WLANs)
design it based on the market available component.
iv) For a given problem related TCP/IP protocol developed the network programming.
v) Configure DNS DDNS, TELNET, EMAIL, File Transfer Protocol (FTP), WWW, HTTP, SNMP, Bluetooth, Firewalls using open
source available software and tools.
Instructions for paper setter: All Questions are compulsory. The Question paper is divided in to four sections A, B, C and
D. Section A is compulsory and comprises of 12 questions of one mark each, 3 from each unit. The questions shall be
asked in such a manner that there are no direct answers including one word answer, fill in the blanks or multiple choice
questions. Section B comprises of 4 questions of 2 marks each, one from each unit. Section C C omprises of 4 questions of
4 marks each, one from each unit. Section D Comprises of 4 questions of 6 marks each, one from each unit. There is no
overall choice, however internal choice may be provided in section C and D, if paper setter so desires.
Text Books:
1. Data Communication and Networking, 4th Edition, Behrouz A. Forouzan, McGraw- Hill.
2. Data and Computer Communication, 8th Edition, William Stallings, Pearson Prentice Hall India.
3. Computer Networks, 8th Edition, Andrew S. Tanenbaum, Pearson New International Edition.
Reference Books:
1. Internetworking with TCP/IP, Volume 1, 6th Edition Douglas Comer, Prentice Hall of India.2. TCP/IP Illustrated Volume 1, W.
Richard Stevens, Addison-Wesley, United States of America.
 Batch 2020-2024
M.M. (DEEMED TO BE UNIVERSITY) , MULLANA (AMBALA) onwards

B. Tech. (4th Sem)

(Common for CSE, CSE with Specialization in Data Science, CSE with specialization in Cloud Technology & Information Security, CSE with
specialization in Big Data and Analytics, CSE with specialization in Full Stack Development, CSE with specialization in AI & Machine Learning)
BCSE-510 (Database Management System)

L T P Continuous evaluation 40
3 0 0 End semester exam 60
Total marks 100
Credits 3.0
Course Objectives:
i) To understand the concept of DBMS and RDBMS.
ii) To study the physical and logical database designs & schema.
iii) To understand DDL, DQL, DML and DCL to create, query, update, and manage a database.
iv) To impart knowledge about the concept of Normalization to design & build a database system for different applications.
v) To impart knowledge about concurrency control, recovery techniques and database security of database systems.
Unit:-1 (9 Hours)
Database system architecture- Data Abstraction, Data Independence, Various views of data, data models, Schemes,
Logical database design, Database design issues, Responsibility of database administrator, Three levels architecture of
database systems, Introduction to Client/Server architecture. Data Definition Language (DDL), Data Manipulation
Language (DML). Data models- Entity-relationship model, network model, relational and object oriented data models,
integrity constraints, data manipulation operations.
Unit:-2 (9 Hours)
Relational query languages- Relational algebra, Tuple and domain relational calculus, SQL3, DDL and DML constructs,
Open source and Commercial DBMS - MYSQL, ORACLE, DB2, SQL server. Relational database design- Domain and data
dependency, Armstrong's axioms, Normal forms, Dependency preservation, Lossless design. Query processing and
optimization- Evaluation of relational algebra expressions, Query equivalence, Join strategies, Query optimization
algorithms.
Unit:-3 (9 Hours)
Storage strategies- Indices, B-trees, hashing. Introduction to Query Languages- QBE, integrity constraints, functional
dependencies & normalization (Normal forms – up to 5th Normal Form). Transaction processing- Concurrency control,
ACID property, Serializability of scheduling, Locking and timestamp based schedulers, Multi-version and optimistic
Concurrency Control schemes, Database recovery.
Unit:-4 (9 Hours)
Database Security- Authentication, Authorization and access control, DAC, MAC and RBAC models, Intrusion detection,
SQL injection. Advanced topics- Object oriented and object relational databases, Logical databases, Web databases,
Distributed databases, Data warehousing and data mining.
Course Outcomes: After completion of this course, student should be able to:
i) Understand the concept of DBMS and RDBMS.
ii) Acquire knowledge about the physical and logical database designs & schema.
iii) Understand DDL, DQL, DML and DCL to create, query, update, and manage a database.
iv) Impart knowledge about the concept of Normalization to design and build a database system for different
applications.
v) Explain about concurrency control, recovery techniques and database security of database systems .

Instructions for paper setter: All Questions are compulsory. The Question paper is divided in to four sections A, B, C
and D. Section A is compulsory and comprises of 12 questions of one mark each, 3 from each unit. The questions shall be
asked in such a manner that there are no direct answers including one word answer, fill in the blanks or multiple choice
questions. Section B comprises of 4 questions of 2 marks each, one from each unit. Section C Comprises of 4 questions of
4 marks each, one from each unit. Section D Comprises of 4 questions of 6 marks each, one from each unit. There is no
overall choice, however internal choice may be provided in section C and D, if paper setter so desires.
Text Books:
1. Abraham Silberschatz, Henry F. Korth, S. Sudarshan , “Database System Concepts”, 6th Edition, McGraw-Hill.
2. J. D. Ullman, “Principles of Database and Knowledge – Base Systems”, Vol 1, Computer Science Press.
Reference Books:
1. R. Elmasri and S. Navathe, “Fundamentals of Database Systems”, 5th Edition, Pearson Education.
 Batch 2020-2024
M.M. (DEEMED TO BE UNIVERSITY) , MULLANA (AMBALA) onwards

2. Serge Abiteboul, Richard Hull, Victor Vianu, “Foundations of Databases”, Reprint, Addison-Wesley.
 M.M. (DEEMED TO BE UNIVERSITY) , MULLANA (AMBALA) Batch 2020-24 Onwards

B. Tech. (4thSem) (Computer Science & Engineering)

BCSE-511 (Agile Development)
L T P Continuous evaluation 40
2 0 0 End semester exam 60
Total marks 100
Credits 2.0
Course Objectives:
i) To understand the agile approach of software development, using scrum framework & methodology .
ii) To provide students with a theoretical as well as practical understanding of agile software development practices and how
small teams can apply them to create high-quality software.
iii) To understand Agile development.
iv) To understand Agile testing.

Unit:-1 (6 Hours)
Fundamentals of Agile :Introduction and background, Challenges of conventional SDLC, Introduction to Agile Software Development, Agile
Manifesto and Principles, Traditional Model vs. Agile Model, classification of agile methods, ethics in agile teams.

Unit-2 (6 Hours)
Agile Scrum Framework :Introduction to Scrum, Project phases, Agile Estimation, Planning poker game, Product backlog, Sprint backlog, Initial
Stages of Building a Requirement Document, Burn down chart, Sprint planning and retrospective, Daily scrum, Scrum roles – Product Owner,
Scrum Master, Scrum Team, Tools for Agile project management.

Unit-3 (6 Hours)
Agile Processes: User story definition, Characteristics and content of user stories, Agile design practices, Role of design Principles including
Single Responsibility Principle, Open Closed Principle, Need and significance of Refactoring, Refactoring Techniques, Continuous Integration.

Unit-4 (6 Hours)
Agile Testing: The Agile lifecycle and its impact on testing, Test-Driven Development (TDD), Testing user stories - acceptance tests and
scenarios, Planning and managing testing cycle, Test automation, Tools to support the Agile tester.

Course Outcome: After completion of this course, students will be able to:
i) Understand the Agile Software Development values and principles, concepts, practices and frameworks.
ii) Understand the Scrum framework, its applicability to software development projects, main roles, events, artifacts and concepts.
iii) Deconstruct user stories into tasks and ideal day estimates.
iv) End a Sprint with Sprint Reviews and Sprint Retrospectives.

Instructions for paper setter: All Questions are compulsory. The Question paper is divided in to four sections A, B, C and D.
Section A is compulsory and comprises of 12 questions of one mark each, 3 from each unit. The questions shall be asked in suc h a
manner that there are no direct answers including one word answer, fill in the blanks or multiple choice questions. Section B
comprises of 4 questions of 2 marks each, one from each unit. Section C Comprises of 4 questions of 4 marks each, one from ea ch
unit. Section D Comprises of 4 questions of 6 marks each, one from each unit. There is no overall choice, however internal choice
may be provided in section C and D, if paper setter so desires.

Text Books:
1. Agile Software Development with Scrum by Ken Schawber, Mike Beedle Publisher: Pearson 2.
2. Agile Software Development, Principles, Patterns and Practices by Robert C. Martin Publisher: Prentice Hall.
3. Agile Testing: A Practical Guide for Testers and Agile Teams by Lisa Crispin, Janet Gregory Publisher: Addison Wesley.

Reference Books:
1. Cohn, M. (2010). Succeeding with Agile: Software Development Using Scrum. Pearson Education, ISBN – 9788131732267.
2. S. Kenneth Rubin, Essential Scrum: A Practical Guide to the Most Popular Agile Process, Pearson Education, March 2015 edition 3.
3. Mike Cohn, User Stories Applied: For Agile Software Development, Addison-Wesley Professional, 1st Edition.
4. Scrum and XP from the Trenches, 2nd Edition. HenrikKniberg, 2015.