Software Engineering and Project

Course Title Semester V

Management

Course Code MVJ22CS51 CIE 50

Total No. of Contact SEE
40 50
Hours
No. of Contact Total
3 (L: T: P : S:: 3 : 0 : 0 : 0) 100
Hours/week
Credits 3 Exam. Duration 3 Hours

Course objective is to:

1. Outline software engineering principles and activities involved in building large software programs and
identify ethical and professional issues faced by Software Engineers.
2. Describe the process of requirement gathering, requirement classification, requirement specification and
requirements validation.
3. Infer the fundamentals of object-oriented concepts, differentiate system models, use UML diagrams,
apply design patterns and explain the role of DevOps in Agile Implementation.
4. Discuss various types of software testing practices and software evolution processes.
Recognize the importance of Project Management with its methods and methodologies and identify
software quality parameters and quantify software using measurements and metrics. List software quality
standards and outline the practices involved.

Module-1 8 Hours
Introduction: The evolving role of software, Software, The changing nature of software, Software
engineering, A Process Framework, Process Patterns, Process Assessment, Personal and Team Process
Models, Process Technology, Product and Process.
Process Models: Prescriptive models, Waterfall model, Incremental process models, Evolutionary.
process models, Specialized process models.
Requirements Engineering: Requirements Engineering Task, Initiating the Requirements
Engineering process, Eliciting Requirements, Developing use cases, Building the analysis model,
Negotiating Requirements, Validating Requirements, Software Requirement Document (Sec 4.2)
Module-2 8 Hours
Introduction, Modelling Concepts and Class Modelling: What is Object orientation? What is OO
development? OO Themes; Evidence for usefulness of OO development; OO modelling history.
Modelling as Design technique: Modelling, abstraction, The Three models. Class Modelling: Object and
Class Concept, Link and associations concepts, Generalization and Inheritance, A sample class model,
Navigation of class models, Introduction to RUP and UML diagrams

Building the Analysis Models: Requirement Analysis, Analysis Model Approaches, Data modelling

Concepts, Object Oriented Analysis, Scenario-Based modelling, Flow-Oriented Modelling, class Based
modelling, Creating a Behavioral Model.

1
 Module-3 8 Hours
Software Testing: A Strategic Approach to Software Testing, Strategic Issues, Test Strategies for
Conventional Software, Test Strategies for Object -Oriented Software, Validation Testing, System
Testing, The Art of Debugging.
Agile Methodology & DevOps: Before Agile – Waterfall, Agile Development.
Self-Learning Section:
What is DevOps? DevOps Importance and Benefits, DevOps Principles and Practices, 7 C’s of DevOps
Lifecycle for Business Agility, DevOps and Continuous Testing, How to Choose Right DevOps Tools?,
Challenges with DevOps Implementation.
Module-4 8 Hours

Introduction to Project Management: Introduction, Project and Importance of Project Management,

Contract Management, Activities Covered by Software Project Management, Plans, Methods and
Methodologies, Some ways of categorizing Software Projects, Stakeholders, Setting Objectives, Business
Case, Project Success and Failure, Management and Management Control, Project Management life cycle,
Traditional versus Modern Project Management Practices.

Module-5 8 Hours
L4, L5
Activity Planning: Objectives of Activity Planning, When to Plan, Project Schedules, Sequencing and
Scheduling Activities, Network Planning Models, Forward Pass– Backward Pass, Identifying critical path,
Activity Float, Shortening Project Duration, Activity on Arrow Networks.
Software Economics: Evolution of Software Economics, Improving Software
Economics, The old way and the new way. Life-Cycle Phases and Process artifacts
Ref: (SPPM.pdf (nnrg.edu.in))

2
Course Title Computer Network Semester V
Course Code MVJ22CS52 CIE 50
Total No. of Contact Hours 40T + 26P SEE 50
No. of Contact Hours/week 5 (L: T : P :S: 3 :0 :2:0) Total 100
Credits 4 Exam. Duration 3 Hours
Course objective is to: This course will enable students to
1. To develop an understanding of modern network architectures from a design and performance
perspective.
2. To introduce the student to the major concepts involved in network protocols.
3. Get details about Functions of Network layer, Router and delivery of data to host network.
4. Learn the function of mobile networking and switching.
5. Multimedia data transmission in network.

Module-1 8 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, Techniques for Bandwidth utilization: Multiplexing - Frequency division, Time
division and Wave division.
Module-2 8 Hours
Data Link 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.
Medium Access Sub Layer: Switching, Random Access, Multiple access protocols - Pure ALOHA,
Slotted ALOHA, CSMA/CD, CDMA/CA, IEEE802 standard protocols.

Module-3 8 Hours
The Network Layer: Network layer design issues, Logical Addressing: IPV4, IPV6; Address
mapping, routing algorithms, Congestion control algorithms, Internetworking, the network layer in the
internet (IPv4 and IPv6), Quality of Service.

Module-4 8 Hours

Transport Layer: Elements of Transport protocols: Addressing, Connection establishment,

Connection release, Crash recovery, User Datagram Protocol (UDP), Transmission Control Protocol
(TCP), TCP Congestion Control; Quality of Service, QoS improving techniques: Leaky Bucket and
Token Bucket algorithm.

Module-5 8 Hours
Application Layer: Domain Name Space (DNS), DDNS, TELNET, EMAIL, File Transfer Protocol
(FTP), WWW, HTTP, SNMP, Bluetooth, Firewalls; AI in network infrastructure, Self-Healing
Networks.

4
Course Title Theory of Computation Semester V
Course Code MVJ22CS53 CIE 50
Total No. of Contact Hours 53 SEE 50
No. of Contact Hours/week 4 (L: T : P :S: 4: 0: 0 : 0) Total 100
Credits 4 Exam. Duration 3 Hours
Course objective is to:This course will enable students to
1. Acquire knowledge of Automata Theory as the basis of all computer science languages design
2. Understand the concept of Context Free Grammars and Languages
3. Understand the concepts of Turing Machine and Chomskian Languages
4. Acquire knowledge of Decidability.
5. Enrich the knowledge in various phases of compiler ant its use
Module-1 8 Hours
Finite Automata: Mathematical preliminaries and notations – Central concepts of automata theory –
Finite automata -Deterministic Finite Automata - Nondeterministic Finite Automata – Equivalence of
DFA and NFA –Finite Automata with Epsilon transitions - Application of FA

Module-2 8 Hours
Regular Expressions: Regular languages: Regular Expressions – Finite Automata and Regular
Expressions –Applications of Regular Expressions - Regular Grammars.
Problems on CFG, pushdown automata
Module-3 8 Hours
Regular Languages: Properties of regular languages: Pumping lemma for regular languages – Closure
properties of regular languages –Equivalence and Minimization of Finite Automata. C
Problems on Turing Machine, Halting Problem
Module-4 8 Hours
Context Free Grammar: Context Free languages: Context Free Grammars – Parse Trees - Ambiguity in
Grammars and languages– Applications of Context Free Grammars – Pushdown automata (PDA) –
Languages of a PDA -Equivalence of PDA ‘s and CFG ‘s, Conversion of PDA -CFG and CFG - PDA
Problems on Computational Complexity
Module-5 8 Hours
Context Free Languages: Properties of Context Free Languages: Normal Forms (CNF, GNF) for
Context Free Grammars - Pumping lemma for CFL ‘s - Closure properties of CFL
Turing Machines: Turing Machines- Programming Techniques for Turing Machines – MultitapTuring
Machines.
Problems on lexical analysis

7
Course Title Data Visualization Lab Semester V
Course Code MVJ22CSL54 CIE 50
Total No. of Contact Hours 26 SEE 50
No. of Contact Hours/week 2 (L: T : P :S: 0: 0: 2 : 0) Total 100
Credits 1 Exam. Duration 3 Hours

Course Objectives:This course will enable students to

● Effective use of Business Intelligence (BI) technology (Tableau) to apply data visualization
● Analyse patterns and relationships in the data.
● Create Dashboard applications and charts.
● Demonstration of advance tools and the results clearly .
● Develop Programs and understand how to work with different formats of data sets.

Sr.No Experiment Name RBT Hours

Level
1 Understanding Data, what is data, where to find data, Foundations for L1 2
building Data Visualizations, Creating Your First visualization?
2 Getting started with Tableau Software using Data file formats, connecting L2 2
your Data to Tableau, creating basic charts (line, bar charts, Tree maps),
Using the Show me panel.
3 Tableau Calculations, Overview of SUM, AVR, and Aggregate features, L3 2
Creating custom calculations and fields.
4 Applying new data calculations to your visualizations, Formatting L2 2
Visualizations, Formatting Tools and Menus, Formatting specific parts of
the view
5 Editing and Formatting Axes, Manipulating Data in Tableau data, Pivoting L1 2
Tableau data.
6 Structuring your data, Sorting and filtering Tableau data, Pivoting Tableau L1 2
data.
7 Advanced Visualization Tools: Using Filters, Using the Detail panel, using L2 2
the Size panels, customizing filters, Using and Customizing tooltips,
Formatting your data with colors.
8 Creating Dashboards & Storytelling, creating your first dashboard and L2 2
Story, Design for different displays, adding interactivity to your Dashboard,
Distributing & Publishing your Visualization.
9 Tableau file types, publishing to Tableau Online, Sharing your L3 2
visualizations, printing, and Exporting.
10 Creating custom charts, cyclical data and circular area charts, Dual Axis L3 2
charts.

9
 Course Title Artificial Intelligence Semester V
Course Code MVJ22CS552 CIE 50
Total No. of Contact Hours 40 SEE 50
No. of Contact Hours/week 3 (L: T : P :S: 3: 0: 0 : 0) Total 100
Credits 3 Exam. Duration 3 Hours
Course objectives: This course will enable the students to:
 Understand fundamental concepts in Artificial Intelligence.
 Understand and analyze the problem-solving techniques and knowledge representation.
 Design intelligent components or programs to meet desired needs.
 Implement, and evaluate computer-based intelligent systems.
 Understand fundamental concepts in Artificial Intelligence.
Module-1
8 Hours

Introduction: AI problems, foundation of AI and history of AI, Intelligent agents: Agents and Environments, The
concept of rationality, The nature of environments, Structure of agents, Problem solving agents, Problem formulation.

Module-2 8 Hours
Knowledge Representation & Reasons: Knowledge – Based Agents, The Wumpus world. Propositional Logic:
Reasoning patterns in propositional logic - Resolution, Forward & Backward Chaining.
Inference in First order logic: Propositional vs. first order inference, Unification & lifting, Forward chaining,
Backward chaining, Resolution.

Module-3 8 Hours
Searching: Searching for solutions, uniformed search strategies – Breadth first search, depth first search, Depth limited
search, Iterative deepening depth first search bi-direction search, Comparing uninformed search strategies. Search with
partial information (Heuristic search), Greedy best first search, A* search, Memory bounded heuristic search, Heuristic
functions.
Local search Algorithms: Hill climbing, Simulated annealing search, Local beam search, Genetic algorithms.

Module-4 8 Hours
Constrain satisfaction problems: Backtracking search for CSPs local search for constraint satisfaction problems.
Game Playing: Games, Minimax algorithm, Optimal decisions in multiplayer games, Alpha-Beta pruning, Evaluation
functions, Cutting of search.

Module-5 8 Hours

Planning: Classical planning problem, Language of planning problems, Expressiveness and extension, planning with
state – space search, Forward state spare search, Backward state space search, Heuristics for state space search, Partial
order planning Graphs, Planning graphs
Learning: what is learning, Forms of learning, Inductive learning, Learning Decision Trees.

12