makaut fifth semester rutine , for computer science & engineering

Maulana Abul Kalam Azad University of Technology
(Formerly West Bengal University of Technology)
Syllabus and Curricular Mapping for B. Tech. in Computer Science and Engineering
Effective from Academic Session 2023-24
Page 41 / 81
5 Graph Traversal Algorithm:
11 Implement Breadth First Search (BFS)
Implement Depth First Search (DFS)
SEMESTER – V
THEORY
COURSE OUTCOMES (COs)
On completion of the course students will be able to
Course
Outcomes
Details Action Verb
Knowledge
Level
ESC501.CO1
Identify and define the various phases of lifecycle for a
given project and the appropriate process model depending
on the user requirements in order to develop a cost
effective software product.
Identify K1
ESC501.CO2
Distinguish between a structure chart and a flow chart and
Identify the activities carried out during transform.
Distinguish K4
ESC501.CO3
Choose between the coding style(structured or OO)and
Perform Code review, Code analysis, build process
Choose K3
ESC501.CO4
Judge appropriate software testing techniques to the
quality of a software product at modules, integration, and
system granularity levels.
Judge K5
ESC501.CO5
Apply the principles, processes and main knowledge areas
for Software Project Management
Apply K3
ESC501.CO6
Design different types of UML diagram with knowledge
when and why use a particular type of dig based on the
software product requirements
Design K6
Mapping of COs with POs and PSOs (Course Articulation Matrix):
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 2 2 1 - - - - 2 3 3 2
CO2 3 3 2 2 2 - 1 - - 1 - 3 3 2
CO3 3 1 3 2 2 1 - - - - - 3 2 2
CO4 3 2 2 2 3 2 - - - - 1 3 3 3
CO5 3 3 2 2 3 - 1 1 - - 2 3 3 3
CO6 3 3 2 2 3 - - - - - 2 3 2 2
AVG. 3 2.5 2.33 2 2.5 1.33 1 1 0 1 1.75 3.00 2.66 2.33
University Syllabus :
Unit Content Hrs/Unit
1 Overview of System Analysis & Design , Business System Concept, System Development Life Cycle,
Waterfall Model , Spiral Model, Feasibility Analysis, Technical Feasibility, Cost- Benefit Analysis,
COCOMO model. [10L]
10
2 System Design – Context diagram and DFD, Problem Partitioning, Top-Down And Bottom-Up design;
Decision tree, decision table and structured English; Functional vs. Object- Oriented approach. [5L]
5
Course Title: Software Engineering Code: ESC501
Type Of Course: Theory Course Designation: Compulsory
Semester: 5th
Contact Hours: 3L/week
Continuous Assessment: 25 Marks Final Exam: 70 Marks
Writer: Course Coordinator Approved by HoD (convenor of DAB)

Page 42 / 81
3 Coding & Documentation – Structured Programming, OO Programming, Information Hiding, Reuse,
System Documentation. [4L] Testing – Levels of Testing, Integration Testing, Test case Specification,
Reliability Assessment, Validation & Verification 12 Metrics, Monitoring & Control. [8L]
12
4 Software Project Management – Project Scheduling, Staffing, Software Configuration Management,
Quality Assurance, Project Monitoring. [7L]
7
5 Static and dynamic models, why modeling, UML diagrams: Class diagram, interaction diagram:
collaboration diagram, sequence diagram, state chart diagram, activity diagram, implementation diagram.
[10 L]
10
Course
Outcomes
Details Action Verb
Knowledge
Level
PCC-CS501.CO1
Understand and list the different stages in the process of
compilation.
Understand K2
PCC-CS501.CO2 Identify different methods of lexical analysis Identify K3
PCC-CS501.CO3 Design top-down and bottom-up parsers Design K6
PCC-CS501.CO4 Identify synthesized and inherited attributes Identify K3
PCC-CS501.CO5 Develop syntax directed translation schemes Develop K3
PCC-CS501.CO6 Develop algorithms to generate code for a target machine Develop K6
CO1 3 3 3 3 2 - - 2 2 3 2 2 3 1
CO2 3 3 3 3 3 1 - - 2 2 1 2 3 2
CO3 3 3 3 1 3 - 2 1 3 - - 2 3 2
CO4 3 3 3 3 - 2 2 2 3 3 2 2 3 2
CO5 3 3 3 3 2 - - 3 - 2 2 2 2 2
CO6 3 3 3 2 3 - - 3 2 2 2 3 3 3
AVG. 3 3 3 2.5 2.6 1.5 2 2.2 2.4 2.4 1.8 2.6 2.83 2
1 Introduction to Compiling [3L] Compilers, Analysis of the source program, The phases of the
compiler, Cousins of the compiler
3
2 Lexical Analysis [6L] The role of the lexical analyzer, Tokens, Patterns, 6 Lexemes, Input
buffering, Specifications of a token, Recognition of a tokens, Finite automata, From a regular
expression to an NFA, From a regular expression to NFA, From a regular expression to DFA,
Design of a lexical analyzer generator (Lex).
6
3 Syntax Analysis [9L] The role of a parser, Context free grammars, Writing a grammar, Top
down Parsing, Nonrecursive Predictive parsing (LL), Bottom up parsing, Handles, Viable
prefixes, Operator precedence parsing, LR parsers (SLR, LALR), Parser generators (YACC).
Error Recovery strategies for different parsing techniques.
9
4 Syntax directed translation [5L] Syntax director definitions, Construction of syntax trees,
Bottom-up evaluation of S attributed definitions, L attributed definitions, Bottom-up evaluation
5
Course Title: Compiler Design Code: PCC-CS501
Type of Course: Theory Course Designation: Compulsory
Semester: 5th

Page 43 / 81
of inherited attributes.
5 Type checking [4L] Type systems, Specification of a simple type checker, Equivalence of type
expressions, Type conversions
4
6 Run time environments [5L] Source language issues (Activation trees, Control stack, scope of
declaration, Binding of names), Storage organization (Subdivision of run-time memory,
Activation records), Storage allocation strategies, Parameter passing (call by value, call by
reference, copy restore, call by name), Symbol tables, dynamic storage allocation techniques
5
7 Intermediate code generation [4L] Intermediate languages, Graphical representation, Three-
address code, Implementation of three address statements (Quadruples, Triples, Indirect triples).
4
8 Code optimization [5L] Introduction, Basic blocks & flow graphs, Transformation of basic
blocks, Dag representation of basic blocks, The principle sources of optimization, Loops in flow
graph, Peephole optimization.
5
9 Code generations [4L] Issues in the design of code generator, a simple code generator, Register
allocation & assignment
4
Course
Outcomes
Details Action Verb
Knowledge
Level
PCC-CS502.CO1
Demonstrate the concepts of Operating System Services,
System calls, structure and types.
Demonstrate K2
PCC-CS502.CO2
Discuss processes and threads for multiprogramming and
multi-threading.
Discuss K6
PCC-CS502.CO3
Develop algorithms for process scheduling for a given
specification of CPU utilization, Throughput, Turnaround
Time, Waiting Time, Response
Develop K3
PCC-CS502.CO4
Explain algorithmic solutions to process synchronization
problems for Inter-Process communication
Explain K5
PCC-CS502.CO5
Analyse the necessary conditions for Deadlock avoidance
and prevention to solve them.
Analyze K6
PCC-CS502.CO6
Explain Memory management, Virtual Memory, I/O
Hardware, File and Disk Management system.
Explain K2
CO1 3 1 1 1 - 2 2 3 2 3 - 2 3 3
CO2 3 2 1 1 2 - - 3 3 1 1 3 3 2
CO3 3 2 3 1 1 - - 2 3 2 2 2 3 2
CO4 3 3 3 2 - - - 3 3 2 2 2 3 2
CO5 3 2 1 1 3 - - 2 3 1 2 2 3 2
CO6 3 2 2 1 - - - 2 2 - 2 1 3 2
AVG. 3 2 1.83 1.167 2 2 2 2.5 2.667 1.8 1.8 2 3.00 2.17
Course Title: Operating Systems Code: PCC-CS502
Type Of Course: Theory Course Designation: Compulsory
Semester: 5th Contact Hours: 3L/week

Page 44 / 81
1 Introduction: Generations Concept of of Operating Operating systems, Systems, Types
of 3 Operating Systems, OS Services, System Calls, Structure of an OS - Layered,
Monolithic, Microkernel Operating Systems, Concept of Virtual Machine. Case study
on UNIX and WINDOWS Operating System.
3
2 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, 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.
10
3 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
IPCProblems: Reader’s & Writer Problem, Dinning Philosopher Problemetc.
5
4 Deadlocks: Definition, Necessary and sufficient conditions for Deadlock, Deadlock
Prevention, Deadlock Avoidance: Banker’s algorithm, Deadlock detection and
Recovery.
5
5 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 , 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 used(LRU).
8
6 I/O Hardware: I/O devices, Device controllers, Direct memory access Principles of I/O
Software: Goals of Interrupt handlers, Device drivers, Device independent I/O
software, Secondary-Storage Structure: Disk structure, Disk scheduling algorithms
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 andperformance. Disk
Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN, C-SCAN, Disk
reliability, Disk formatting, Boot-block, Bad blocks.
6

Page 45 / 81
Course Outcomes Details Action Verb
Knowledge
Level
PCC-CS503.CO1
Describe classes, objects, members of a class and
relationships among them needed for a specific
problem.
Describe K1
PCC-CS503.CO2
Explain the features of object-oriented principles
such as encapsulation, polymorphism and
composition of systems based on object identity.
Explain K2
PCC-CS503.CO3
Analyze the concepts of inheritance and its
application in OO design with different design
patterns.
Analyze K4
PCC-CS503.CO4
Discuss simple abstract data types and design
implementations using abstraction functions to
document them.
Discuss K2
PCC-CS503.CO5
Apply some common object-oriented design patterns
and give examples of their use.
Apply K3
PCC-CS503.CO6
Design applications with an event-driven graphical
user interface.
Design K6
CO1 3 3 1 2 - - - 2 - - 2 2 2 1
CO2 3 3 1 3 - - - 1 - - 2 2 2 3
CO3 3 3 2 3 - - - 3 - - 2 2 3 2
CO4 3 3 2 3 - - - 3 - - 2 2 3 2
CO5 3 3 - 1 - - - 2 2 2 2 2 2 1
CO6 3 3 - 3 - - - 3 2 2 2 2 3 2
AVG. 3 3 1.5 2.5 0 0 0 2.33 2 2 2 2 2.5 1.83
1 Abstract data types and theirspecification. How to implement an ADT. Concrete state
space, concrete invariant, abstraction function. Implementing operations, illustrated by
the Text example.
8
2 Features of object-oriented programming. Encapsulation, object identity,
polymorphism – but not inheritance
8
3 Inheritance in OO design. Design patterns. Introduction and classification. The iterator
pattern.
6
4 Model-view-controller pattern. Commands as methods and as objects. Implementing
OO language features. Memory management.
6
5 Generic types and collections GUIs. Graphical programming with Scale and Swing .
The software development process
6
Course Title: Object Oriented Programming Code: PCC-CS503
Semester: 5th

Page 46 / 81
Course
Outcomes
Details Action Verb
Knowledge
Level
HSMC-501.CO1
Recall the concepts of Accounting and Recognize different
systems used in industrial applications.
Recall K1
HSMC-501.CO2
Discuss on the design of appropriate accounting tool
required for real life problems.
Discuss K1
HSMC-501.CO3 Apply and demonstrate the use of Economical concepts. Apply K3
HSMC-501.CO4
Analyze and Simulate a sequential accounting tool for a
system or process appropriate for required accuracy.
Analyze K4
HSMC-501.CO5
Design a sequential economic policy that can work
according to the required specifications.
Design K6
HSMC-501.CO6
Justify a specific accounting technique for an specific
purpose.
Justify K5
CO1 3 - - - - - - - - - - - - -
CO2 - 3 - - - - 1 - - - - - - -
CO3 - - - - 3 - - - - - - - - -
CO4 - - 3 - - - - - - - - - - -
CO5 - - - - - - - - 1 - - - - -
CO6 - - - - - - - - - - - - - -
AVG. 3 3 3 0 3 0 1 0 1 0 0 0 0 0
1 Introduction System- concept, definition, types, parameters, variables and behavior.
Management – definition and functions. Organization structure: i. Definition. ii. Goals.
iii. Factors considered in formulating structure. iv. Types. v. Advantages and
disadvantages. vi. Applications. Concept, meaning and importance of division of
labor, scalar & functional processes, span of control, delegation of authority,
centralization and decentralization in industrial management. Organizational culture
and climate – meaning, differences and factors affecting them. Moral-factors affecting
moral. Relationship between moral and productivity. Job satisfaction- factors
influencing job satisfaction. Important provisions of factory act and labor laws.
6
2 Critical Path Method (CPM) and Programme Evaluation Review Technique
(PERT):
2.1 CPM & PERT-meaning, features, difference, applications.
2.2 Understand different terms used in network diagram. Draw network diagram for a
real life project containing 10-15 activities, computation of LPO and EPO.(Take
minimum three examples). Determination of critical path on network. Floats, its types
and determination of floats. Crashing of network, updating and its applications.
8
3 Materials Management: Material management-definition, functions, importance, 6
Course Title: Introduction to Industrial Management
(Humanities III)
Code: HSMC-501
Semester: 5th Contact Hours: 3L/week

Page 47 / 81
relationship with other departments. Purchase - objectives, purchasing systems,
purchase procedure, terms and forms used in purchase department. Storekeeping-
functions, classification of stores as centralized and decentralized with their
advantages, disadvantages and application in actual practice. Functions of store, types
of records maintained by store, various types and applications of storage equipment,
need and general methods for codification of stores. Inventory control: i. Definition. ii.
Objectives. iii. Derivation for expression for Economic Order Quantity (EOQ) and
numeric examples. iv. ABC analysis and other modern methods of analysis. v. Various
types of inventory models such as Wilson’s inventory model, replenishment model
and two bin model. (Only sketch and understanding, no derivation.). 3.6 Material
Requirement Planning (MRP)- concept, applications and brief details about software
packages available in market.
4 Production planning and Control (PPC): Types and examples of production. PPC :
i. Need and importance. ii. Functions. iii. Forms used and their importance. iv. General
approach for each type of production. Scheduling- meaning and need for productivity
and utilisation. Gantt chart- Format and method to prepare. Critical ratio scheduling-
method and numeric examples. Scheduling using Gantt Chart (for at least 5-7
components having 5-6 machining operations, with processes, setting and operation
time for each component and process, resources available, quantity and other
necessary data), At least two examples. 4.7 Bottlenecking- meaning, effect and ways
to reduce.
8
5 Value Analysis (VA) and Cost Control:
5.1 VA-definition, terms used, process and importance.
5.2 VA flow diagram. DARSIRI method of VA. Case study of VA-at least two.
Waste-types, sources and ways to reduce them. Cost control-methods and important
guide lines.
4
6 Recent Trends in IM: ERP (Enterprise resource planning) - concept, features and
applications. Important features of MS Project. Logistics- concept, need and benefits.
Just in Time (JIT)-concept and benefits. Supply chain management-concept and
benefits.
4

Page 48 / 81
Knowledge
Level
PEC-IT501B.CO1
Understand the various search techniques, constraint satisfaction
problems along with problem solving techniques in strategic games.
Understand K2
PEC-IT501B.CO2
Apply such techniques in real world problems which involve
perception, reasoning and learning.
Apply K3
PEC-IT501B.CO3
Understand the role of agents and identify ways to evaluate their
performance in achieving goals.
Understand K2
PEC-IT501B.CO4
Understand and Apply Predicate Logic to process natural language
texts.
Apply K3
PEC-IT501B.CO5
Analyze and apply machine learning techniques to solve real world
problems.
Analyze K4
PEC-IT501B.CO6 Design and employ expert systems for the societal needs. Design K6
CO1 3 3 - - - - - - - - - - - -
CO2 - - - - - - - - - - - - 2 -
CO3 - 2 - - - - - - 2 - - - - -
CO4 - - - - - - - - - - - - - 2
CO5 - - 2 3 3 - - - - - - - - -
CO6 3 - - - 3 - - - 3 - - 3 - 2
AVG. 3 2.5 2 3 3 0 0 0 2.5 0 0 3 2 2
1 Introduction [2] Overview of Artificial intelligence- Problems of AI, AI technique, Tic - Tac - Toe
problem.
Intelligent Agents [2] Agents & environment, nature of environment, structure of agents, goal based agents,
utility based agents, learning agents.
Problem Solving [2] Problems, Problem Space & search: Defining the problem as state space search,
production system, problem characteristics, issues in the design of search programs.
6
2 Search techniques [5] Solving problems by searching :problem solving agents, searching for solutions;
uniform search strategies: breadth first search, depth first search, depth limited search, bidirectional search,
comparing uniform search strategies.
Heuristic search strategies [5] Greedy best-first search, A* search, memory bounded heuristic search: local
search algorithms & optimization problems: Hill climbing search, simulated annealing search, local beam
search genetic algorithms; constraint satisfaction problems, local search for constraint satisfaction problems.
Adversarial search [3] Games, optimal decisions & strategies in games, the minimax search procedure,
alpha-beta pruning, additional refinements, iterative deepening.
13
3 Knowledge & reasoning [3] Knowledge representation issues, representation & mapping, approaches to
knowledge representation, issues in knowledge representation
3
4 Using predicate logic [2] Representing simple fact in logic, representing instant & ISA relationship,
computable functions & predicates, resolution, natural deduction.
6
Course Title: Artificial Intelligence Code: PEC-IT501B
Type of Course: Theory Course Designation: Elective
Semester: 5th

Page 49 / 81
Probabilistic reasoning [4] Representing knowledge in an uncertain domain, the semantics of Bayesian
networks, Dempster-Shafer theory, Fuzzy sets & fuzzy logics.
5 Natural Language processing [2] Introduction, Syntactic processing, semantic analysis, discourse &
pragmatic processing.
Learning [2] Forms of learning, inductive learning, learning decision trees, explanation based learning,
learning using relevance information, neural net learning & genetic learning.
Expert Systems [2] Representing and using domain knowledge, expert system shells, knowledge
acquisition.
6
Knowledge
Level
MC- CS501.CO1 Understand Basic Structure of the Constitution of India Understand K2
MC- CS501.CO2 Apply the understanding in Engineering Profession Apply K3
MC- CS501.CO3 Apply Constitutional Values in Engineering Education Apply K3
MC- CS501.CO4
Apply Constitutional Provisions in Policy matters of
CSE
Apply K3
MC- CS501.CO5
Apply Team Spirit and Constitutional Legislative
Provisions for Industrial Design
Apply K3
MC- CS501.CO6
Analyze Constitutional Valuesof Legislation, Executive
& Judiciary in the light of the Professional requirements
of Computer Science Engineering
Analyze K4
CO1 - - - - - 2 - 2 3 1 - 2 1 1
CO2 - - - - - 2 - 2 3 1 - 2 1 1
CO3 - - - - - 2 - 2 3 1 - 2 1 1
CO4 - - - - - 2 - 2 3 1 - 2 1 1
CO5 - - - - - 2 - 2 3 1 - 2 1 1
CO6 - - - - - 2 - 2 3 1 - 2 1 1
AVG. 0 0 0 0 0 2 0 2 3 1 0 2 1 1
1 Introduction: Constitution’ meaning of the term,, Indian Constitution: Sources and
constitutional history, Features: Citizenship, Preamble, Fundamental Rights and
Duties, Directive Principles of State Policy
3
2 Union Government and its Administration : Structure of the Indian Union: Federalism,
Centre- State relationship, President: Role, power and position, PM and Council of
ministers, Cabinet and Central Secretariat, Lok Sabha, Rajya Sabha
6
3 State Government and its Administration Governor: Role and Position, CM and
Council of ministers, State Secretariat: Organisation, Structure and Functions
6
4 Local Administration District’s Administration head: Role and Importance, 8
Course Title: Constitution of India Code: MC- CS501
Type of Course: Theory Course Designation: Elective
Semester: 5th

Page 50 / 81
Municipalities: Introduction, Mayor and role of Elected Representative, CEO of
Municipal Corporation, Pachayati raj: Introduction, PRI: Zila Pachayat, Elected
officials and their roles, CEO Zila Pachayat: Position and role, Block level:
Organizational Hierarchy (Different 4.departments), Village level: Role of Elected and
Appointed officials, Importance of grass root democracy
5 Election Commission Election Commission: Role and Functioning, Chief Election
Commissioner and Election Commissioners, State Election Commission: Role and
Functioning, Institute and Bodies for the welfare of SC/ST/OBC and women
6
SEMESTER – V
PRACTICAL
Course
Outcomes
Details Action Verb
Knowledge
Level
ESC591.CO1
Understand the software engineering methodologies involved in
the phases for project development.
Understand K2
ESC591.CO2
Extract functional and non-functional requirement for given
problem statement.
Extract
K2
ESC591.CO3 Choose between different design strategies for real life problem Choose K3
ESC591.CO4
Develop use case diagrams and activity diagrams, build and test
class diagrams, sequence diagrams and add interface to class
diagrams.
Develop K6
ESC591.CO5
Design Test Script/Test Plan using Black box and White Box
approach.
Design K6
ESC591.CO6 Evaluate Process and Product Metrics using different models. Evaluate K5
Mapping of COs with Pos and PSOs (Course Articulation Matrix):
CO1 2 3 1 1 - - - - - - - - - -
CO2 1 2 2 1 1 1 - - - - - 1 -
CO3 1 1 3 1 2 - 1 - - - - - 3 -
CO4 1 1 3 1 2 - 1 - - - - - 3 -
CO5 3 2 2 2 3 - - - - - - - 2 -
CO6 2 2 2 2 2 - - - - - 2 - 1 -
AVG. 1.66 1.83 2.16 1.33 2 0 1 0 0 0 2 0 2 0
Unit Content
1 Laboratory Experiments:
Problem Analysis and Project Planning -Thorough study of the problem – Identify Project scope,
Objectives and Infrastructure.
2 Software Requirement Analysis – Describe the individual Phases/modules of the project and Identify
Course Title: Software Engineering Lab Code: ESC591
Type of Course: Practical Course Designation: Compulsory
Semester: 5th
Contact Hours: 4P/week

makaut fifth semester rutine , for computer science & engineering

More Related Content

Similar to makaut fifth semester rutine , for computer science & engineering (20)

Recently uploaded (20)

makaut fifth semester rutine , for computer science & engineering