Semester IV (Second year] Curriculum

Hours per week Credits

Sl.
Type of course Code Course Title
No. Lecture Tutorial Practical Sessional

Theory Papers
Professional
1 PCC- CS401 Discrete Mathematics 3 1 0 0 4
Core Courses
Engineering Computer Organization &
2 PCC-CS 402 3 0 0 0 3
Science Course Architecture
Professional
3 PCC- CS403 Operating Systems 3 0 0 0 3
Core Courses
Professional Design & Analysis of
4 PCC- CS404 3 0 0 0 3
Core Courses Algorithms
Professional Artificial Intelligenec &
5 PCC- CS405 2 0 0 0 2
Core Courses Machine Learning
Humanities
&Social
Sciences Management 1
6 HSMC 401 3 0 0 0 3
including (Organizational Behaviour)
Management
courses
Mandatory
7 MC401 Environmental Sciences 0 0 0 0 0
Courses
Humanities and
social sciences Essential Studies for
8 HSMC402 2 0 0 0 2
including Professionals - IV
Management
Mandatory Mathematics & Statistics -
9 MC402 0 0 0 0 0
Courses IV
Total 19 1 0 0 20
Practical Papers
Engineering Computer Organization &
1 PCC-CS 492 0 0 4 0 2
Science Course Architecture Lab

Professional
2 PCC- CS493 Operating Systems Lab 0 0 4 0 2
Core Courses
Professional Design & Analysis of
3 PCC- CS494 0 0 4 0 2
Core Courses Algorithms Lab
Professional Artificial Intelligenec &
3 PCC- CS495 0 0 2 0 1
Core Courses Machine Learning Lab
Total 0 0 14 0 7
Sessional Papers
Humanities and
social sciences Skill Development for
1 HSMC482 0 0 0 2 1
including Professionals - IV
Management
Innovative PROJ –
2 Innovative Project – II 0 0 0 0 1
Project CS401
Mandatory
Additional Mandatory Additional
3 MAR481 0 0 0 0 0
Requirements Requirements (MAR)-IV
(MAR)
 Massive Open Online
4 MOOCs 421 Course 4.1 (Mandatory for 0 0 0 1 0.5
MOOCs [Link] (Honours))
(Mandatory for
Honours) Massive Open Online
5 MOOCs 422 Course 4.2 (Mandatory for 0 0 0 1 0.5
[Link] (Honours))
Total
0 0 0 4 3
Total
19 1 14 4 30

2nd Year 4th Semester Detailed Syllabus

Course Name: Discrete Mathematics

Course Code: PCCCS401

Semester: 4

Contact Hours: L-T-P: 3-1-0

Credits: 4
Prerequisite: Linear algebra, Calculus

Module 1 [10L]

Sets, Relation and Function: Operations and Laws of Sets, Cartesian Products, Binary
Relation, Partial Ordering Relation, Equivalence Relation, Image of a Set, Sum and Product
of Functions, Bijective functions, Inverse and Composite Function, Size of a Set, Finite and
infinite Sets, Countable and uncountable Sets, Cantor's diagonal argument and The Power Set
theorem, Schroeder-Bernstein theorem.

Principles of Mathematical Induction: The Well-Ordering Principle, Recursive definition,

The Division algorithm: Prime Numbers, The Greatest Common Divisor: Euclidean
Algorithm, The Fundamental Theorem of Arithmetic.

Module 2 [8L]

Basic counting techniques-inclusion and exclusion, pigeon-hole principle, permutation and

combination.

Propositional Logic: Syntax, Semantics, Validity and Satisfiability, Basic Connectives and
Truth Tables, Logical Equivalence: The Laws of Logic, Logical Implication, Rules of
Inference, The use of Quantifiers. Proof Techniques: Some Terminology, Proof Methods
and Strategies, Forward Proof, Proof by Contradiction, Proof by Contraposition, Proof of
Necessity and Sufficiency.

Module 3 [12L]

Algebraic Structures and Morphism: Algebraic Structures with one Binary Operation,
Semi Groups, Monoids, Groups, Congruence Relation and Quotient Structures, Free and
Cyclic Monoids and Groups, Permutation Groups, Substructures, Normal Subgroups,
Algebraic Structures with two Binary Operation, Rings, Integral Domain and Fields. Boolean
Algebra and Boolean Ring, Identities of Boolean Algebra, Duality, Representation of
Boolean Function, Disjunctive and Conjunctive Normal Form

Module 4 [12L]

Graphs and Trees: Graphs and their properties, Degree, Connectivity, Path, Cycle, Sub
Graph, Isomorphism, Eulerian and Hamiltonian Walks, Graph Colouring, Colouring maps
and Planar Graphs, Colouring Vertices, Colouring Edges, List Colouring, Perfect Graph,
definition properties and Example, rooted trees, trees and sorting, weighted trees and prefix
codes, Bi-connected component and Articulation Points, Shortest distances.

Text Books and/or Reference Material

Text Books

1. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw – Hill
2. Susanna S. Epp, Discrete Mathematics with Applications,4th edition, Wadsworth
Publishing Co. Inc.
3. C L Liu and D P Mohapatra, Elements of Discrete Mathematics A Computer
Oriented Approach, 3rd Edition by, Tata McGraw – Hill.

Reference books:

1. J.P. Tremblay and R. Manohar, Discrete Mathematical Structure and Its Application
to Computer Science”, TMG Edition, TataMcgraw-Hill
2. Norman L. Biggs, Discrete Mathematics, 2nd Edition, Oxford University Press.
Schaum’s Outlines Series, Seymour Lipschutz, Marc Lipson,
3. Discrete Mathematics, Tata McGraw - Hill

Course Outcomes

CO1. For a given logic sentence express it in terms of predicates, quantifiers, and logical
connectives and ideas relating to integers through concepts of well-ordering principle,
division algorithm, greatest common divisors and congruence.
CO2. For a given a problem, derive the solution using deductive logic & combinatorics and
prove the solution based on logical inference;

CO3. For a given mathematical problem classify its algebraic structure and evaluate Boolean
functions and simplify expressions using the properties of Boolean algebra

CO4. Develop the given problem as graph networks and solve with techniques of graph
theory.

Course Name: Computer Organization & Architecture

Course Code: PCCCS402

Semester: 4

Contact Hours: L-T-P: 3-0-0

Credits: 3
Prerequisite: Digital Electronics

Module 1 [7L]
Introduction to computer organisation & architecture; Basic organization of the stored
program computer and operation sequence for execution of a program. Fetch, decode and
execute cycle, Concept of operator, operand, registers and storage, RTL interpretation of
Instruction format, Instruction sets and addressing modes; Introduction to RISC
architectures. RISC vs CISC architectures. Instruction set of 8085. Instruction Cycle,
Machine Cycles, T-States.
Module 2 [7L]
Commonly used number systems. Fixed and floating-point representation of numbers;
Concept of Overflow and Underflow. Design of adders - ripple carry and carry look ahead
principles. Fixed point multiplication - Unsigned and Signed - Booth's algorithm, carry save
multiplier. Fixed point division - Restoring and non-restoring algorithms. Floating point -
IEEE 754 standard.
Design of ALU. Design of control unit - hardwired and microprogrammed control.
Introduction to x86 architecture. Introduction to Components of a Microprocessor:
Registers, ALU and control & timing.
Module 3 [8L]
Memory organization, semiconductor memory technologies, static and dynamic memory,
memory hierarchy, associative memory. Hierarchical memory technology: Inclusion,
Coherence and locality properties Cache memory organizations - cache size vs. block size,
mapping functions, replacement algorithms, write policies, Techniques for reducing cache
misses;
Virtual memory organization, mapping and management techniques, memory replacement
policies. Memory unit design with special emphasis on implementation of CPU-memory
interfacing. Data path design for read/write access. Memory interleaving;
I/O operations - Concept of handshaking, Polled I/O, program-controlled, interrupt-driven
and DMA, privileged and non-privileged instructions, software interrupts and exceptions.
Programs and processes–role of interrupts in process state transitions, I/O device interfaces
– SCII, USB
Module 4 [8L]
Pipelining: Basic concepts, instruction and arithmetic pipeline; hazards and techniques for
handling hazards. Pipeline optimization techniques;
Introduction to Super scalar, Super-pipelining, Array processor and Vector processor.
Multiprocessor architecture: taxonomy of parallel architectures - Introduction to Flynn’s
Classification; Centralized shared memory architecture, Distributed shared memory
architecture, interconnection networks. Introduction to concurrent access to memory and
cache coherence in parallel processing. Non von-Neumann architectures.

Text Books and/or Reference Material

1. Computer Organization and Architecture: Designing for Performance, William Stallings,

Prentice-Hall India
2. Computer Organization, Carl Hamacher, Zvonko Vranesic and Safwat Zaky, Tata
McGraw Hill
3. Computer Architecture A Quantitative Approach, John L Hennessy and David Patterson,
Morgan Kaufman
4. Structured Computer Organization, Andrew S. Tanenbaum, Prentice-Hall India

5. Computer Architecture & Parallel Processing. Kai Hwang & Briggs, Tata McGraw Hill

6. Computer System Architecture, M. M. Mano, PHI.

7. Computer Organization & Architecture, P N Basu, Vikas Publication

Course Outcomes
CO1: Students would be able to apply instruction set architecture for designing a processor.
CO2: Students would be able to design arithmetic and logic units as well as control units of a
processor.
CO3: Students would be able to understand different types of memory, memory
management, and the connection among the memory, CPU and I/O devices.
CO4: Students would be able to understand parallel processors.
Course Name: Operating Systems

Course Code: PCCCS403

Semester: 4

Contact Hours: L-T-P: 3-0-0

Credits: 3

Module 1[8L]

Introduction: Generations & Concept of Operating Systems, Types of 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.

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.

Module 2[10L]

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.

Module 3[8L]
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)

Module 4[6L]

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 and performance.

Disk Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN, C-SCAN, Disk
reliability, Disk formatting, Boot-block, Bad blocks

Text book and Reference books:

1. Operating System Concepts Essentials, 9th Edition byAviSilberschatz, Peter Galvin, Greg
Gagne, Wiley Asia Student Edition.

2. Operating Systems: Internals and Design Principles, 5th Edition,William Stallings,

Prentice Hall of India.

3. Operating System Concepts, Ekta Walia, Khanna Publishing House (AICTE

Recommended Textbook – 2018)

4. Operating System: A Design-oriented Approach, 1st Edition by Charles Crowley, Irwin

Publishing

5. Operating Systems: A Modern Perspective, 2 nd Edition by Gary J. Nutt, Addison- Wesley

6. Design of the Unix Operating Systems, 8 th Edition by Maurice Bach, Prentice-Hall of

India

7. Understanding the Linux Kernel, 3rd Edition, Daniel P. Bovet,Marco Cesati, O'Reilly and
Associates
Course Outcomes:

CO1: Create processes and threads.

CO2: Develop algorithms for process scheduling for a given specification of CPU utilization,
Throughput, Turnaround Time, Waiting Time, Response Time.

CO3: For a given specification of memory organization develop the techniques for optimally
allocating memory to processes by increasing memory utilization and for improving the
access time. Design and implement file management system.

CO4: For a given I/O devices and OS (specify) develop the I/O management functions in OS
as part of a uniform device abstraction by performing operations for synchronization between
CPU and I/O controllers.

Course Name: Design & Analysis of Algorithm

Course Code: PCCCS404

Semester: 4

Contact Hours: L-T-P: 3-0-0

Credits: 3
Prerequisite: Data Structure and Algorithms

Module 1[10L]

Introduction: Characteristics of algorithm. Analysis of algorithm: Asymptotic analysis of

complexity bounds – best, average and worst-case behavior; Performance measurements of
Algorithm, Time and space trade-offs, Analysis of recursive algorithms through recurrence
relations: Substitution method, Recursion tree method and Masters’ theorem.

Module 2 [17L]

Fundamental Algorithmic Strategies: Brute-Force, Greedy, Dynamic Programming,

Branchand-Bound and Backtracking methodologies for the design of algorithms; Illustrations
of these techniques for Problem-Solving , Bin Packing, Knap Sack TSP. Heuristics –
characteristics and their application domains.

Module 3 [8L]
Graph and Tree Algorithms: Traversal algorithms: Depth First Search (DFS) and Breadth
First Search (BFS); Shortest path algorithms, Transitive closure, Minimum Spanning Tree,
Topological sorting, Network Flow Algorithm.

Module 4 [7L]

Tractable and Intractable Problems: Computability of Algorithms, Computability classes – P,

NP, NP-complete and NP-hard. Cook’s theorem, Standard NP-complete problems and
Reduction techniques. Advanced Topics: Approximation algorithms, Randomized
algorithms, Class of problems beyond NP – P SPACE.

Text Books and/or Reference Material

1. Introduction to Algorithms, 4TH Edition, Thomas H Cormen, Charles E Lieserson,

Ronald L Rivest and Clifford Stein, MIT Press/McGraw-Hill.

2. Fundamentals of Algorithms – E. Horowitz et al.

3. Algorithm Design, 1ST Edition, Jon Kleinberg and ÉvaTardos, Pearson.

4. Algorithm Design: Foundations, Analysis, and Internet Examples, Second Edition,
Michael T Goodrich and Roberto Tamassia, Wiley.
5. Algorithms—A Creative Approach, 3RD Edition, UdiManber, Addison-Wesley

Course Outcomes:

CO1: For a given algorithm, analyze the worst-case running time of algorithms based on
asymptotic analysis and justify the correctness of algorithms.

CO2: Describe the greedy paradigm and explain when an algorithmic design situation calls
for it. For a given problem develop the greedy algorithms.

CO3: Describe the divide-and-conquer paradigm and explain when an algorithmic design
situation calls for it. Synthesize divide-and-conquer algorithms. Derive and solve recurrence
relation.

CO4: Describe the dynamic-programming paradigm and explain when an algorithmic design
situation calls for it. For a given problem, develop the dynamic programming algorithms, and
analyze them to determine its computational complexity.
Course Name: Artificial Intelligence & Machine Learning

Course Code: PCCCS405

Semester: 4

Contact Hours: L-T-P: 2-0-0

Credits: 2
Prerequisite: Data Structure and Algorithms

Module 1 [5L]:

Introduction to Artificial Intelligence: The Foundations of Artificial Intelligence, The History

of Artificial Intelligence, and the State of the Art. Knowledge Representation: A Knowledge-
Based Agent, Knowledge Representation, Reasoning & Logic, Propositional Logic, Inference
in First-Order Logic

Module 2 [6L]:

Search techniques: AI-Problem formulation, solving problems by searching, uninformed

search strategies: depth first search, breadth first search, depth limited search, iterative
deepening search, bi-directional search and others.

Module 3 [6L]:

Introduction to Machine Learning: Machine learning and it’s types; Applications of machine
learning; Issues in machine learning. Modelling and Evaluation: Selecting a model; Training
model - Holdout, k-fold cross-validation, bootstrap sampling; Model representation and
interpretability - under-fitting, over-fitting, bias-variance tradeoff; Model performance
evaluation - Classification, regression, clustering; Performance improvement.

Module 4 [5L]:

Supervised learning – Classification: k-Nearest Neighbour; Decision tree; Naïve Bayes.

Supervised learning – Regression: Linear regression.
Unsupervised learning: k-Means, Association Analysis

Learning Resources:

1. E. Rich and K. Knight, “Artificial intelligence”, TMH, 2nd ed., 1992.

2. N.J. Nilsson, “Principles of AI”, Narosa Publ. House, 1990.
3. D.W. Patterson, “Introduction to AI and Expert Systems”, PHI, 1992.
4. Peter Jackson, “Introduction to Expert Systems”, AWP, M.A., 1992.
 5. R.J. Schalkoff, “Artificial Intelligence - an Engineering Approach”, McGraw Hill Int.
Ed., Singapore, 1992.
6. M. Sasikumar, S. Ramani, “Rule Based Expert Systems”, Narosa Publishing House,
1994.
7. Machine learning Tom Mitchell, McGraw Hill,1997

Course Outcome:

CO1: To develop an understanding of modern concepts in AI and where they can be used.
CO2: To design, implement and apply novel AI techniques based on emerging real-world
requirements
CO3: To understand various key paradigms for machine learning approaches
CO4: To familiarize themselves with the mathematical and statistical techniques used in
machine learning. Students can able to understand and differentiate among various machine
learning techniques.

Course Name: Management 1 (Organizational Behaviour)

Course Code: HSMC401

Semester: 4

Contact Hours: L-T-P: 3-0-0

Credits: 3

Module 1 [6L]

Organizational Behaviour: Definition, Importance, Historical Background, Fundamental

Concepts of OB, Challenges and Opportunities for OB. Personality and Attitudes: Meaning
of personality, Personality Determinants and Traits, Development of Personality, Types of
Attitudes, Job Satisfaction

Module 2 [8L]

Perception: Definition, Nature and Importance, Factors influencing Perception, Perceptual

Selectivity, Link between Perception and Decision Making. Motivation: Definition, Theories
of Motivation - Maslow’s Hierarchy of Needs Theory, McGregor’s Theory X & Y,
Herzberg’s Motivation-Hygiene Theory, Alderfer’s ERG Theory, McClelland’s Theory of
Needs, Vroom’s Expectancy Theory.

Module 3 [10L]

Group Behaviour: Characteristics of Group, Types of Groups, Stages of Group Development,

Group Decision Making. Communication: Communication Process, Direction of
Communication, Barriers to Effective Communication. Leadership: Definition, Importance,
Theories of Leadership Styles.
Module 4 [8L]

Organizational Politics: Definition, Factors contributing to Political Behaviour. Conflict

Management: Traditional vis-a-vis Modern View of Conflict, Functional and Dysfunctional
Conflict, Conflict Process, Negotiation – Bargaining Strategies, Negotiation Process.
Organizational Design: Various Organizational Structures and their Effects on Human
Behaviour, Concepts of Organizational Climate and Organizational Culture.

Text Books and/or Reference Material

1. Robbins, S. P. & Judge, T.A.: Organizational Behavior, Pearson Education, 15th Edn.

2. Luthans, Fred: Organizational Behavior, McGraw Hill, 12th Edn.

3. Shukla, Madhukar: Understanding Organizations – Organizational Theory & Practice in

India, PHI

4. Fincham, R. & Rhodes, P.: Principles of Organizational Behaviour, OUP, 4th Edn.

5. Hersey, P., Blanchard, K.H., Johnson, D.E.- Management of Organizational Behavior

Leading Human Resources, PHI, 10th Edn.

Course Outcomes:

CO1: Understand the concepts, need and importance of management and application of the
various principles of management.

CO2: Critically analyse and understand the process of management and the various
components of the management process.

CO3: Understand, adopt and integrate the individual behavior with the organizational
behavior.

CO4: Acquainted with various components of individual behaviour and how it helps an
organization in bringing in the organizational development and organizational effectiveness
in the global orientation.

Course Name: Environmental Sciences

Course Code: MC401

Semester: 4

Contact Hours: L-T-P: 2-0-0

Credits: 0
Module 1 [5L]

Basic ideas of environment, basic concepts, man, society & environment, their
interrelationship Mathematics of population growth and associated problems, Importance of
population study in environmental engineering, definition of resource, types of resource,
renewable, non-renewable, potentially renewable, effect of excessive use vis-à-vis population
growth, Sustainable Development. Materials balance: Steady state conservation system,
steady state system with non-conservative pollutants, step function. Environmental
degradation: Natural environmental Hazards like Flood, earthquake, Landslide-causes, effects
and control/management; Anthropogenic degradation like Acid rain-cause, effects and
control. Nature and scope of Environmental Science and Engineering.

Elements of ecology: System, open system, closed system, definition of ecology, species,
population, community, definition of ecosystem- components types and function. Structure
and function of the following ecosystem: Forest ecosystem, Grassland ecosystem, Desert
ecosystem, Aquatic ecosystems, Mangrove ecosystem (special reference to Sundar ban);
Food chain [definition and one example of each food chain], Food web. Biogeochemical
Cycle- definition, significance, flow chart of different cycles with only elementary reaction
[Oxygen, carbon, Nitrogen, Phosphate, Sulphur]. Biodiversity- types, importance, Endemic
species, Biodiversity Hot-spot, Threats to biodiversity, Conservation of biodiversity.

Module 2 [7L]

Atmospheric Composition: Troposphere, Stratosphere, Mesosphere, Thermosphere,

Tropopause and Mesopause. Energy balance: Conductive and Convective heat transfer,
radiation heat transfer, simple global temperature model [Earth as a black body, earth as
albedo], Problems. Green house effects: Definition, impact of greenhouse gases on the global
climate and consequently on sea water level, agriculture and marine food. Global warming
and its consequence, Control of Global warming. Earth’s heat budget. Lapse rate: Ambient
lapse rate Adiabatic lapse rate, atmospheric stability, temperature inversion (radiation
inversion). Atmospheric dispersion: Maximum mixing depth, ventilation coefficient,
effective stack height, smokestack plumes and Gaussian plume model. Definition of
pollutants and contaminants, Primary and secondary pollutants: emission standard, criteria
pollutant. Sources and effect of different air pollutantsSuspended particulate matter, oxides of
carbon, oxides of nitrogen, oxides of sulphur, particulate, PAN. Smog, Photochemical smog
and London smog. Depletion Ozone layer: CFC, destruction of ozone layer by CFC, impact
of other green-house gases, effect of ozone modification. Standards and control measures:
Industrial, commercial and residential air quality standard, control measure (ESP. cyclone
separator, bag house, catalytic converter, scrubber (ventury), Statement with brief reference).

Module 3 [7L]

Hydrosphere, Hydrological cycle and Natural water. Pollutants of water, their origin and
effects: Oxygen demanding wastes, pathogens, nutrients, Salts, thermal application, heavy
metals, pesticides, volatile organic compounds. River/Lake/ground water pollution: River:
DO, 5-day BOD test, Seeded BOD test, BOD reaction rate constants, Effect of oxygen
demanding wastes on river [deoxygenation, reaeration], COD, Oil, Greases, pH. Lake:
Eutrophication [Definition, source and effect]. Ground water: Aquifers, hydraulic gradient,
ground water flow (Definition only) Standard and control: Waste water standard [BOD,
COD, Oil, Grease], Water Treatment system [coagulation and flocculation, sedimentation and
filtration, disinfection, hardness and alkalinity, softening] Waste water treatment system,
primary and secondary treatments [Trickling filters, rotating biological contractor, Activated
sludge, sludge treatment, oxidation ponds] tertiary treatment definition. Water pollution due
to the toxic elements and their biochemical effects: Lead, Mercury, Cadmium, and Arsenic

Module 4 [5L]

Lithosphere; Internal structure of earth, rock and soil Solid Waste: Municipal, industrial,
commercial, agricultural, domestic, pathological and hazardous solid wastes; Recovery and
disposal method- Open dumping, Land filling, incineration, composting, recycling. Solid
waste management and control (hazardous and biomedical waste).

Definition of noise, effect of noise pollution, noise classification [Transport noise,

occupational noise, neighbourhood noise] Definition of noise frequency, noise pressure, noise
intensity, noise threshold limit value, equivalent noise level, L10 (18hr Index) ,n [Link]
pollution control.

Environmental impact assessment, Environmental Audit, Environmental laws and protection

act of India, Different international environmental treaty/ agreement/ protocol.

Text Books and/or Reference Material

1. M.P. Poonia & S.C. Sharma, Environmental Studies, Khanna Publishing House (AICTE
Recommended Textbook – 2018)

2. Masters, G. M., “Introduction to Environmental Engineering and Science”, Prentice-Hall

of India Pvt. Ltd.,1991.

3. De, A. K., “Environmental Chemistry”, New Age International

Course Outcomes:

CO1: Be able to understand the natural environment and its relationships with human
activities.

CO2: Be able to apply the fundamental knowledge of science and engineering to assess
environmental and health risk.

CO3: Be able to understand environmental laws and regulations to develop guidelines and
procedures for health and safety issues.
CO4: Be able to solve scientific problem-solving related to air, water, noise and land
pollution.

Course Name: Computer Organization and Architecture Lab

Course Code: PCCCS492

Semester: 4

Contact Hours: L-T-P: 0-0-4

Credits: 2
Prerequisite: Digital Electronics Lab

Module 1:[6L]

1. HDL introduction
2. Basic digital logic base programming with HDL

Module 2:[5L]

3. 8-bit Addition, Multiplication, Division

4. 8-bit Register design

Module 3:[5L]

5. Memory unit design and perform memory operations.

6. 8-bit simple ALU design

Module 4:[6L]

7. 8-bit simple CPU design

8. Interfacing of CPU and Memory

Learning Resources:
1. Computer Organization and Architecture: Designing for Performance, William Stallings,
Prentice-Hall India

2. Computer Organization, Carl Hamacher, ZvonkoVranesic and SafwatZaky, Tata McGraw

Hill

3. Computer Architecture A Quantitative Approach, John L Hennessy and David Patterson,

Morgan Kaufman

4. Structured Computer Organization, Andrew S. Tanenbaum, Prentice-Hall India

5. Computer Architecture & Parallel Processing. Kai Hwang & Briggs, Tata McGraw Hill

6. Computer System Architecture, M. M. Mano, PHI.

7. Computer Organization & Architecture, P N Basu, Vikas Publication

Course Outcomes:

CO1: Identify the strength and limitations of theoretical models and establish a relationship
between measured data and underlying physical principles.

CO2: Specify appropriate equipment and procedures/algorithms, implement these

procedures/algorithms, analyze and interpret the resulting data.

CO3: Design and build a software/hardware part to meet desired specifications and tests it
using appropriate testing strategy and/or equipment.

CO4:Able to design Memory unit and perform memory [Link] to design 8-bit
simple ALU and 8-bit simple CPU.

Course Name: Operating Systems Lab

Course Code: PCCCS493

Semester: 4

Contact Hours: L-T-P: 0-0-4

Credits: 2

Module1 [4L]
Managing Unix/Linux Operating System
Creating a bash shell script, making a script executable, shell syntax (variables, conditions,
control structures, functions, commands). Partitions, Swap space, Device files, Raw and
Block files, Formatting disks, Making file systems, Superblock, I-nodes, File system
checker, Mounting file systems, Logical Volumes, Network File systems, Backup schedules
and methods Kernel loading, init and the inittab file, Run-levels, Run level scripts. Password
file management, Password security, Shadow file, Groups and the group file, Shells,
restricted shells, user-management commands, homes and permissions, default files,
profiles, locking accounts, setting passwords, Switching user, Switching group, Removing
users & user groups.

Module2 [6L]
Process
Starting new process, replacing a process image, duplicating a process image, waiting for a
process, zombie process.

Signal
signal handling, sending signals, signal interface, signal sets.

Module3 [10L]
Semaphore
Programming with semaphores (use functions semctl, semget,semop,
set_semvalue, del_semvalue, semaphore_p, semaphore_v).

Module4 [10L]
POSIX Threads
Programming with pthreadfunctions (viz. pthread_create, pthread_join,
pthread_exit, pthread_attr_init, pthread_cancel)

Inter-process communication

pipes(use functions pipe, popen, pclose), named pipes(FIFOs, accessing FIFO), message
passing & shared memory(IPC version V).

Course Outcomes:

CO1: To familiarize students with the architecture of Unix OS.

CO2: To provide necessary skills for developing and debugging programs in the UNIX
environment.

CO3: To Simulate CPU Scheduling Algorithms. (FCFS, RR, SJF, Priority, Multilevel
Queuing).

CO4: Students will be able to learn how to allocate the resources in an optimized manner.

Course Name: Design & Analysis of Algorithm Lab

Course Code: PCCCS494

Semester: 4

Contact Hours: L-T-P: 0-0-4

Credits: 2
Prerequisite: Data Structure & Algorithms

Module1 [8L]

Divide and Conquer:

1. Implement Binary Search using Divide and Conquer approach

2. Implement Merge Sort using Divide and Conquer approach

3. Implement Quick Sort using Divide and Conquer approach

4. Find Maximum and Minimum element from an array of integers using Divide and Conquer
approach

Dynamic Programming:

5. Implement Matrix Chain Multiplication

6. Implement all pair of Shortest path for a graph (Floyd- Warshall Algorithm)

7. Implement 0/1 Knapsack Problem

Module2 [6L]

Branch and Bound:

8. Implement 15 Puzzle Problem

Backtracking:

9. Implement 8-Queen problem

10. Graph Coloring Problem Hamiltonian Problem

Module3 [6L]

Greedy Method:

11. Knapsack Problem Job sequencing with deadlines

12. Minimum Cost Spanning Tree by Prim's Algorithm Minimum Cost Spanning Tree by

Kruskal's Algorithm

Module4 [4L]

Graph Traversal Algorithm:

13. Implement Breadth First Search (BFS). Implement Depth First Search (DFS)

14. Implement Single Source shortest Path for a graph (Dijkstra , Bellman Ford Algorithm)

Course Outcomes:

CO1: For a given algorithm, analyze worst-case running times of algorithms based on
asymptotic analysis and justify the correctness of algorithms.

CO2: Describe the greedy, divide and conquer, and dynamic programming etc. Algorithmic
paradigms and explain when these algorithmic design situations call for it.

CO3: For a given model engineering problem, model it using a graph and write the
corresponding algorithm to solve the problems.

CO4: Explain the ways to analyze randomized algorithms (expected running time,
probability of error).

Course Name: Artificial Intelligence & Machine Learning Lab

Course Code: PCCCS495

Semester: 4

Contact Hours: L-T-P: 0-0-2

Credits: 1
Prerequisite: Data Structure & Algorithms

Module 1

Lab 1:

To implement Depth first search, Breadth first search

Lab 2:

To implement A* search

Module 2:

Lab 3:

Implement Perceptron. and to write a program to implement AND OR gates using

Perceptron.

Lab 4:

Implementation of Decision Tree Classifier.

Lab 5:

Implementation of Random Forest Classifier.

Lab 6:

To study Long Short-Term Memory for Time Series Prediction

Module 3

Lab 7:

To study Convolutional Neural Network and Recurrent Neural Network

Lab 8:
To study ImageNet, Google Net, ResNet convolutional Neural Networks

Module 4

Lab 9:

To implement K-Mean’s algorithm

Lab 10:

To implement K-Nearest Neighbour algorithm

Lab 11:

To implement Naïve Bayesian Classifier

Course Outcome:

CO1: To develop an understanding of modern concepts in AI and where they can be used.
CO2: To design, implement and apply novel AI techniques based on emerging real-world
requirements
CO3: Students will be able to understand various key paradigms for machine learning
approaches
CO4: Students to familiarize themselves with the mathematical and statistical techniques
used in machine learning. Students are able to understand and differentiate among various
machine learning techniques.

Course Code : HSMC 402

Course Title : ESP-IV
Credit : 2
Pre-Requisites : Basic Social Science from primary to high school, NCERTs

Course Objective:
1. To learn about basic of History to know about our past and to implement it in our daily
life.
2. To learn about the Political System of Our Country.
3. To learn the concepts of Basics of Geography and Economics from which Students will
acquire knowledge for Competitive exams.

Course Outcome
At the end of the course the students will be able
CO1. To inculcate human values and ethical thinking among students.

CO2. To prepare the stage for facing different levels of civil service and other competitive
examinations.
CO3. To prepare the ground for making them aware of the happenings, cultural historical and
developmental aspects of the country as well as global affairs
CO4. Learning current affairs with technique.

SYLLABUS:

Modul Description Hour Blooms PO(1..1

e s Level 2)
No. Mappin
g
1. 6 L1 PO6,
Laws of Society:
(Remember) PO7,
Central Legislative System of India, L2 PO8
State Legislative System of India, (Understand)
Indian Judiciary L4 (Analyse)
2. 12 L1 PO6,
Heritage of India:
(Remember) PO7,
Islam and Early Muslim Invaders, Delhi L2 PO8
Sultanate, Bhakti and Sufi Movement. (Understand)
L3 (Apply)
L4 (Analyze)
3. 12 L1 PO6,
Know Our Country:
(Remember) PO7,
Rivers of India, Vegetation of India, L2 PO8
Climate of India, Transport of India. (Understand)
L3 (Apply)
L4 (Analyze)

4. 6 L1 PO6,
Revenue and Expenditure of India,
(Remember) PO7,
India and World and Universal
L2 PO8
Human Values: Tax System of India,
(Understand)
Balance of Payment, Industrial L3 (Apply)
Reforms, Monthly Current Affairs L4 (Analyze)
Magazine, Realising existence and co-
existence at all levels, Holistic
perception of Harmony in existence.
Learning Resources:
Text Books:
1. NCERT Books from class 8-12.
Reference Books:

1. Indian Constitution- [Link]

2. Indian Economy-Ramesh Singh
3. History of Modern India- Bepan Chandra
4. Geography of India- Majid Hussain
5. Current Affairs Magazine of IEM-UEM

Course Code : HSMC482

Course Title : SKILL DEVELOPMENT FOR PROFESSIONALS - IV
Credit : 1
Pre-Requisites : Basic Mathematics, General English from primary to high
school.
L-T-P : 2-0-0 (Total Contact Hrs. 2)

Course Outcome
At the end of the course the students will be able

To enhance their problem solving skills, to improve the basic mathematical & Logical Skills for
CO1.
any type of competitive examinations.

CO2. To get best possible training for the them students through continuous training module.

CO3. To find themselves sound for the campus recruitment program’s aptitude Test.

CO4. To enhance problem solving skill using fast track techniques without using calculator.

Course Objective:
1. To enhance the aptitude & analytical skill of students with multiple tricky
approaches.
2. To prepare the students for various competitive examinations & professional
exams

Course Content:
Modul Description Hour Blooms PO(1..1
e s Level 2)
No. Mappin
g
1. Quantitative Aptitude 6 L1 PO1,
Permutation & Combination, Probability, (Remember) PO2,
 Geometry, Mensuration L2 PO10
(Understand)
L4 (Analyse)
2. Logical Reasoning 12 L1 PO1,
1) Seating Arrangement (Remember) PO2,
a) Circular seating arrangement L2 PO10
b) Square seating Arrangement (Understand)
c) Line Arrangement L3 (Apply)
2) Calendar And Clock L4 (Analyze)
3) Miscellaneous Problems

3. Verbal English 12 L1 PO1,

1) Sentence Corrections (Remember) PO2,
2) Fill the blanks with appropriate L2 PO10
words/articles/preposition/verbs/ad (Understand)
verbs/conjunction. L3 (Apply)
3) Reading Comprehension L4 (Analyze)
(Advance Level)
4) Vocabulary

Learning Resources:
Reference Books:
1. Objective General English- S.P Bakshi
2. English Grammar and Competition-S.C Gupta
3. Fast Track Objective Arithmetic- Rajesh Verma
4. Advance Maths- Rakesh Yadav
5. Verbal and Non-Verbal Reasoning- R.S Agarwal
6. A new approach to Reasoning- BS Sijwali
7. Quantitative Aptitude-R.S Agarwal

Course Code: MC-402 Category: Basic Science Course

Course Title: Mathematics & Statistics - IV Semester : Fourth (All streams)

L-T-P: 3-1-0 Credits: 0

Pre-Requisites: BSC-103, BSC-203, BSC-301

Course Outcomes (CO):

CO1. Apply numerical methods to solve engineering problems.

CO2. To understand basics of Laplace and Fourier transform to solve engineering problems.
CO3. Understand the basic ideas of statistics with different characterisation of a univariate and
bivariate data set

CO4. Apply statistical tools for analysing data samples and drawing inference on a given data set.

Numerical Methods (Lecture hours 22): Solution of polynomial and transcendental equations –
Bisection method, Newton-Raphson method and Regula-Falsi method. Finite differences, Relation
between operators, Interpolation using Newton’s forward and backward difference formulae.
Interpolation with unequal intervals: Newton’s divided difference and Lagrange’s formulae.
Numerical Differentiation, Numerical integration:Trapezoidal rule and Simpson’s 1/3rd and 3/8 rules.

Ordinary differential equations: Taylor’s series, Euler and modified Euler’s methods. Runge-Kutta

method of fourth order for solving first and second order equations. Milne’s and Adam’s predicator
corrector methods.

Module-2: Transform Calculus (Lecture hours 10)

Laplace Transform, Properties of Laplace Transform, Laplace transform of periodic functions.

Finding inverse Laplace transform by different methods, convolution theorem. Evaluation of integrals
by Laplace transform, solving ODEs by Laplace Transform method. Fourier transforms.

Module 3: Applied Statistics (lecture Hours 8) Curve fitting by the method of least squares- fitting
of straight lines, second degree parabolas and more general curves. Test of significance: Large sample
test for single proportion, difference of proportions, single mean, difference of means, and difference
of standard deviations.

Module 4: Small samples (lecture Hours 4) Test for single mean, difference of means and
correlation coefficients, test for ratio of variances - Chi-square test for goodness of fit and
independence of attributes.

Suggested Text/Reference Books

(i) G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9th Edition, Pearson,
Reprint,2002.

(ii) Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons, 2006.

(iii) B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36th Edition, 2010.

(iv) P. G. Hoel, S. C. Port and C. J. Stone, Introduction to Probability Theory, Universal Book Stall,
2003(Reprint).
(v) S. Ross, A First Course in Probability, 6th Ed., Pearson Education India, 2002.

(vi) Lipschutz S., and Lipson M.L.: Probability (Schaum's Outline Series), TMH.

(vii) John E. Freund, Ronald E. Walpole, Mathematical Statistics, Prentice Hall

(viii) [Link]: C Language and Numerical Methods.

(ix) Dutta & Jana: Introductory Numerical Analysis.

(x)[Link]: Numerical Mathematical Analysis.

(xi) Jain, Iyengar , & Jain: Numerical Methods (Problems and Solution).

(xii) Balagurusamy: Numerical Methods, Scitech.

(xiii) [Link]: Numerical Methods, Khanna Publishing House.