Semester III (Second year) Curriculum Branch/Course:

Computer Science and Engineering

Sl. Type of Course Code Course Title Hours per week Credits Marks
No
L T P
1 Engineering ESC-EC 301 Analog Electronic 3 0 0 3 100
Science Circuits
Course ESC-EC 351 Analog Electronic 0 0 4 2 100
Circuits Laboratory
2 Professional PCC-CSE 301 Data structure & 3 0 0 3 100
Core Course Algorithms
PCC-CSE 351 Data structure & 0 0 4 2 100
Algorithms
Laboratory
3 Professional PCC-CSE 302 IT Workshop (Sci 1 0 0 1 100
Core Course Lab/MATLAB)
Theory
PCC-CSE 352 IT Workshop (Sci 0 0 4 2 100
Lab/MATLAB)
Laboratory
4 Engineering ESC-CSE 302 Digital 3 0 0 3 100
Science Logic
Course ESC-CSE 352 Digital Logic 0 0 4 2 100
Laboratory
5 Basic BSC-M 302 Differential 2 0 0 2 100
Science Calculus
Course
6 Basic BSC-BS 301 Engineering Biology 2 1 0 3 100
Science
Course
7 Humanities HSM-HU 381 Linguistics & 0 0 2 0 100*
& Social Oral
Sciences Communication
including
Management
Course
Total: 23 1000

*Marks for this paper will not reflect in total marks for the semester
 Semester IV (Second year) Curriculum
Branch/Course: Computer Science and Engineering

Sl. Type of Course Code Course Title Hours per week Credits Marks
No
L T P
1 Professional PCC-CSE 401 Discrete Mathematics 3 1 0 4 100
Core Course
2 Professional PCC-CSE 402 Computer 3 0 0 3 100
Core Course Organization
&
Architecture
PCC-CSE 452 Computer 0 0 4 2 100
Organization
&
Architecture
Laboratory
3 Professional PCC-CSE 403 Operating Systems 3 0 0 3 100
Core Course PCC-CSE 453 Operating Systems 0 0 4 2 100
Laboratory
4 Professional PCC-CSE 404 Design & Analysis 3 0 0 3 100
Core Course of Algorithms
PCC-CSE 454 Design & Analysis 0 0 4 2 100
of Algorithms
Laboratory
5 Humanities HSM-HU 401 Economics & 2 0 0 2 100
& Social Accountancy
Sciences
including
Management
Course
6 Mandatory MC-HU 402 Environmental 3 0 0 0 100*
Course Sciences
7 Humanities HSM-HU 481 Business 0 0 2 0 100*
& Social Communication
Sciences
including
Management
Course
Total: 21 800

*Marks for this paper will not reflect in total marks for the semester
DETAILED SYLLABUS
 Semester III (Second year) Curriculum Branch/Course:
Computer Science and Engineering

Sl. Type of Course Code Course Title Hours per week Credits Marks
No
L T P
1 Engineering ESC-EC 301 Analog Electronic 3 0 0 3 100
Science Circuits
Course ESC-EC 351 Analog Electronic 0 0 4 2 100
Circuits Laboratory
2 Professional PCC-CSE 301 Data structure & 3 0 0 3 100
Core Course Algorithms
PCC-CSE 351 Data structure & 0 0 4 2 100
Algorithms
Laboratory
3 Professional PCC-CSE 302 IT Workshop (Sci 1 0 0 1 100
Core Course Lab/MATLAB)
Theory
PCC-CSE 352 IT Workshop (Sci 0 0 4 2 100
Lab/MATLAB)
Laboratory
4 Engineering ESC-CSE 302 Digital 3 0 0 3 100
Science Logic
Course ESC-CSE 352 Digital Logic 0 0 4 2 100
Laboratory
5 Basic BSC-M 302 Differential 2 0 0 2 100
Science Calculus
Course
6 Basic BSC-BS 301 Engineering Biology 2 1 0 3 100
Science
Course
7 Humanities HSM-HU 381 Linguistics & 0 0 2 0 100*
& Social Oral
Sciences Communication
including
Management
Course
Total: 23 1000

*Marks for this paper will not reflect in total marks for the semester
 Course code ESC-EC 301(For Theory)/ ESC-EC 351 (For Laboratory)
Category Engineering Science Course (ESC)
Course title Analog Electronic Circuits (Theory & Laboratory)

Scheme and L T P Credits Semester – III

Credits 3 0 4 5

Pre-requisites (if any)

Theory Syllabus:
Lecture/
Module Detailed Description Tutorial
Period
1. DIODE CIRCUITS: 15L
Ideal and piecewise linear models of diode, graphical analysis; Analysis and design
of circuits-transient switching characteristics of diodes; Power supplies, surge
studies, I²-t curve; Power supply filters. Clipper and Clamper circuits, Zener
Diodes & Its applications, SMPS etc
BJT:
Characteristics of BJT; Ebers-Moll equations and large signal models; inverse
mode of operation, early effect; BJT as an amplifier and switch.
Biasing and dc circuits of BJT
Small signal models, Small signal analysis of CE, CB, CC amplifiers using r e
models, frequency response of amplifiers. Multistage amplifiers (Cascade,
Cascode )
2. FET: 10L
JFET types, Device structure and operation, Volt-amp characteristics.
MOSFET enhancement NMOS, PMOS and CMOS, Device structure and
operation of Volt-amp characteristics. Nonlinearities in MOSFET
Biasing and dc circuits of JFET, MOS. Current source biasing.
Small signal analysis of JFET, MOS amplifiers (CS, CG, Source follower).
3. Power Amplifiers: 10L
Class A, Class B, Class AB Class C, Class- D Circuit operation, transfer
characteristics, power dissipation, and efficiency. Practical BJT and MOS power
transistors; thermal resistance; heat sink design; IC power amplifiers.
Differential and operational amplifiers:
Advantages of differential amplifiers; Ideal operational amplifier(OP-AMP)
parameters, Characteristics.
Inverting and noninverting configurations; Common OPAMP ICs: Gain-frequency
and Slew rate etc.
Applications of Op-AMP:Inverting, Non-Inverting amplifiers; Instrumentation
Amplifier, Integrators, Differentiators; LOG amplifier, Anti Log Amplifier ,
Comparators; Schmitt triggers, Active RC filters.
4. Feedback and oscillators: 7L
Feedback concept and definition; Four basic feedback topologies with real circuits;
Analysis of Series-shunt, series-series, shunt-shunt and shunt-series feedback
amplifiers; stability in feedback amplifiers, frequency compensation;
 Principle of sinusoidal oscillators and Barkhausen criterion; Relaxation oscillation
Active-RC and Active-LC sinusoidal oscillators; Wien Bridge; Phase-Shift;
Quadrature Oscillators; Crystal Oscillators
Application Specific ICs:
Multivibrators, 555 timer as Astable and Monostablemultivibrators , VCO(LM
566) amd PLL (LM 565).
Voltage regulations :
Linear regulators using transistors and opamps. Monolithic regulators. SMPS
Concepts.
Total 42L
Total Week Required: 14
No. Of Week Reserved: 02

Books: Text and/or Reference:

1. Millman & Halkias: Integrated Electronics, TMH.

2. S. Franco: Design with Operational Amplifiers & Analog Integrated Circuits , 3/e,TMH
3. Sedra and Smith: Microelectronic Circuits, 7th edition, The Oxford Series.
4. Behzad Razavi: Fundamentals of Microelectronics 1st edition, Wiley.
5. D. Roy Choudhary, B. Jain S.: Linear Integrated Circuits, 5th edition, New Age Int. Pub.
6. Schilling & Belove: Electronic Circuit: Discrete & Integrated , 3/e ,TMH.
7. Gayakwad R.A: OpAmps and Linear IC’s, PHI.
8. Coughlin and Drisscol – Operational Amplifier and Linear Integrated Circuits – PEA.

Laboratory Syllabus:

Detailed Description Practical

Period
List of Experiments:

1. Design and study the rectifier diode circuits.

2. Design and study the LED circuits
3. Design and study the zener diode circuits.
4. Design and study the d.c biasing BJT, FET circuits.
5. Design and study the amplifier BJT, FET circuits. .
6. Study the Op-amp characteristic.
7. Design and study the Op-amp mathematical circuits.
8. Design and study the Op-amp Difference amplifier circuits.
9. Design and study the Op-amp Active filter circuits.
10. Design and study the Op-amp comparator circuits.
11. Design and study the Oscillator with BJT, FET and Op-amp

Total: 56P
Total Week Required: 14
No. Of Week Reserved: 02
Course outcomes:

After successful completion of the course student will be able to

 Design and study the rectifier diode circuits.
 Design and study the LED circuits
 Design and study the zener diode circuits.
 Design and study the d.c biasing BJT, FET circuits.
 Design and study the amplifier BJT, FET circuits. .
 Study the Op-amp characteristic.
 Design and study the Op-amp mathematical circuits.
 Design and study the Op-amp Difference amplifier circuits.
 Design and study the Op-amp Active filter circuits.
 Design and study the Op-amp comparator circuits.
 Design and study the Oscillator with BJT, FET and Op-amp.

Course code PCC-CSE 301 (For Theory), PCC-CSE 351 (For Laboratory)
Category Profession Core Course (PCC)
Course title Data structure & Algorithms (Theory & Laboratory)

Scheme and L T P Credits Semester – III

Credits 3 0 4 5

Pre-requisites (if ESC-CSE 201 and ESC-CSE 251

any)

Objectives of the course:

 To impart the basic concepts of data structures and algorithms.

 To understand concepts about searching and sorting techniques
 To understand basic concepts about stacks, queues, lists, trees and graphs.
 To enable them to write algorithms for solving problems with the help of fundamental data
structures

Theory Syllabus:

Lecture /
Module Detailed Description Tutorial
Period
1. Introduction: 10L
Basic Terminologies: Elementary Data Organizations, Data Structure
Operations: insertion, deletion, traversal etc.; Analysis of an Algorithm,
Asymptotic Notations, Time-Space trade off.
Searching:
Linear Search and Binary Search Techniques and their complexity analysis.
 2. Stacks and Queues: 10L
ADT Stack and its operations: Algorithms and their complexity analysis,
Applications of Stacks: Expression Conversion and evaluation - corresponding
algorithms and complexity analysis. ADT queue, Types of Queue: Simple
Queue, Circular Queue, Priority Queue; Operations on each types of Queues:
Algorithms and their analysis.

3. Linked Lists: 12L

Singly linked lists: Representation in memory, Algorithms of several
operations: Traversing, Searching, Insertion into, Deletion from linked list;
Linked representation of Stack and Queue, Header nodes, Doubly linked list:
operations on it and algorithmic analysis; Circular Linked Lists: all operations
their algorithms and the complexity analysis.
Trees:
Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded
Binary Tree, Binary Search Tree, AVL Tree; Tree operations on each of the
trees and their algorithms with complexity analysis. Applications of Binary
Trees. B Tree, B+ Tree: definitions, algorithms and analysis.

4. Sorting and Hashing: 10L

Objective and properties of different sorting algorithms: Selection Sort, Bubble
Sort, Insertion Sort, Quick Sort, Merge Sort, Heap Sort; Performance and
Comparison among all the methods, Hashing.
Graph:
Basic Terminologies and Representations, Graph search and traversal
algorithms and complexity analysis.

Total 42L
Total Week Required: 14
No. Of Week Reserved: 02

Books: Text and/or Reference:

1. “Fundamentals of Data Structures”, Illustrated Edition by Ellis Horowitz, Sartaj Sahni,

Computer Science Press.
2. Algorithms, Data Structures, and Problem Solving with C++”, Illustrated Edition by Mark
Allen Weiss, Addison-Wesley Publishing Company
3. “How to Solve it by Computer”, 2nd Impression by R. G. Dromey, Pearson Education.

Laboratory Syllabus:

Module Detailed Description Practical

Period
1. Implementing the concept of ADT 8P

2. Problems on single linked list and doubly linked list 10P

 3. Implementation of different types of binary tree 20P

4. Implementation of different sorting algorithms like merge sort, bubble sort 18P
and problems on graph traversal algorithms

Total: 56P
Total Week Required: 14
No. Of Week Reserved: 02

Books: Text and/or Reference:

1. Fundamentals of Data Structures” , Illustrated Edition by Ellis Horowitz, Sartaj Sahni, Computer
Science Press.
2. Algorithms, Data Structures, and Problem Solving with C++” , Illustrated Edition by Mark Allen
Weiss, Addison-Wesley Publishing Company
3. “How to Solve it by Computer” , 2nd Impression by R. G. Dromey, Pearson Education.

Course outcomes:

 For a given algorithm student will able to analyze the algorithms to determine the time and
computation complexity and justify the correctness.
 For a given Search problem (Linear Search and Binary Search) student will able to
implement it.
 For a given problem of Stacks, Queues and linked list student will able to implement it and
analyze the same to determine the time and computation complexity.
 Student will able to write an algorithm Selection Sort, Bubble Sort, Insertion Sort, Quick
Sort, Merge Sort, Heap Sort and compare their performance in term of Space and Time
complexity.
 Student will able to implement Graph search and traversal algorithms and determine the time
and computation complexity.

Course code PCC-CSE 302 (For Theory), PCC-CSE 352 (For Laboratory)
Category Professional Core Course (PCC)
Course title IT Workshop (Sci Lab/MATLAB) (Theory & Laboratory)

Scheme and L T P Credits Semester – III

Credits 1 0 4 3

Pre-requisites (if any)

Objectives of the course:

 The course is intended to assist undergraduates in learning the basics of programming in general
and programming MATLAB in particular.
  Basics of programming in MATLAB will be covered, with the goal of having students become
comfortable enough to continue learning MATLAB and other programming languages on their
own.

Theory Syllabus:

Lecture
Module Detailed Description /
Tutorial
Period
1. Introduction: 3L
Data types and variables: Introduction to MATLAB, Data Types, and Conversions
of Data types, MATLAB Variables, Keywords and Constant, Session Command.
MATLAB Operators and Operations: Operators (Arithmetic, Relational, Logical,
Bitwise), Set Operations, Operator Precedence, Mathematical Functions.

2. Programming in MATLAB: 3L
Script and Function: Decision Making, Loops, branches, Functions, Working on
Script File (Creating, Saving and Executing), MATLAB I/O, Formatted I/O
Method.

3. Arrays and Graphics: 4L

Matrices and Arrays: Introduction to Matrices, Operations on Arrays/Matrices,
Manipulations of Arrays/Matrices, Expansion of Matrix Size, Reduction of
Matrices/Arrays order, Graphics: Introduction to plot, Basic 2-D Plots( Style
options, Labels, Axis control, etc.), specialized 2-D Plots, drawing multiple plots.

4. File Handling: 4L
Introduction to file handling, working on files, accessing of Text File, Saving/
Loading MATLAB Variables, reading data without opening file, reading and
writing Excel.
Debugging:
Introduction to debugging, Break points, debugger, stepping, watching variable
values, debugging commands.

Total 14L
Total Week Required: 14
No. Of Week Reserved: 02

Books: Text and/or Reference:

1. “Delores M. Etter, David C. Kuncicky, Holly Moore, “Introduction to MATLAB 7.0”,

Pearson.
2. Rudra Pratap, “Getting Started with MATLAB”, OXFORD University Press.
3. Agam Kumar Tyagi, “MATLAB and Simulink for Engineers”, University Press.
Laboratory Syllabus:
Module Detailed Description Practical
Period
1. Familiarization of MATLAB Software. 6P

2. Data files and Data types, Basic Mathematics 8P

3. Operations on matrix and Other operations 11P

4. Working with M files 15P

5. MATLAB Plots 8P

6. Familiarization of GUI Design 8P

Total: 56P
Total Week Required: 14
No. Of Week Reserved: 02

Books: Text and/or Reference:

1. Y. Kirani Singh and B.B. Chaudhuri, Matlab Programming , Prentice Hall India Learning
Private Limited
2. Ashok Kumar Goel, Manoj Kumar Sharma and Raj Kumar Bansal ,MATLAB and its
Applications in Engineering, Pearson
3. S. Swapna Kumar and S. V. B. Lenina, MATLAB: Easy Way of Learning, Prentice Hall
India Learning Private Limited

Course outcomes:

At the end of the course, students will be able to

 Use MATLAB for programming purposes
 Learn and explore MATLAB further on their own.
 Use this learning experience to learn other programming languages.

Course Code ESC–CSE 302 (Theory), ESC–CSE 352 (Lab)

Category Engineering Science Course (ESC)
Course Title Digital Logic (Theory and Laboratory)
L T P Credits
Scheme and Credits Semester III
3 0 4 5
Pre-requisites (if any) ---

Objectives of the course:

 To impart the basic concepts of digital logic circuits.

 To understand different forms of combinatorial circuits.
 To understand the concepts of logic states and sequential circuits
 Theory Syllabus:

Lecture /
Module Detailed Description Tutorial
Period
1. Number system and codes: 4L
Decimal, binary, octal and hexadecimal number systems. Arithmetic operations
and conversion of one number system to another. Signed and floating point
representations of binary numbers. 1’s complement and 2’s complement
representations. Binary codes, natural BCD codes; Excess-3, Alphanumeric and
Gray codes
2. Logic gates and Boolean algebra: 4L
Basic logic gates -NOT, AND, OR, NAND, NOR, XOR and XNOR –
operations, truth tables and Venn diagram representations; Universal gates;
Buffers and Tri-State Buffers, postulates and laws of Boolean algebra, De
Morgan’s theorem; Canonical forms of expressions, Min terms and Max terms,
SOP and POS forms.
3. Simplification of logic expressions: 4L
Simplification and minimization of logic expressions using Boolean algebra, K-
maps, and Quinn Mc-Clusky methods; Use of Don’t Care terms.
4. Combinational logic and combinatorial circuits: 6L
Arithmetic circuits- Half adder, Full adder and Subtractor circuit using logic
gates, Multiplexers and De-multiplexers, Decoders, Encoders, Priority
encoders, Parity Generator and Checkers, Comparators.
5. Sequential Logic and Circuits: 22L
Introduction to Sequential logic: Circuits with feedback, Concept of a logical
state; Clock Signal – Setup time, Hold time, Level and Edge Triggering,
Synchronous and Asynchronous inputs, Understanding Meta-stability.
Latches and Flip-flops: Latches – R-S latch, D-latch, Clocked D-latch; Flip-flop
as memory element; R-S, J-K, D and T type flip-flops and their conversions;
master-slave configuration
Registers and Counters: Registers - Left, Right, Serial, Parallel and Universal
Shift; Counters: How it counts? Synchronous and Asynchronous Counters;
Binary, Modulo-N and Arbitrary Sequence Counters; Ring and Johnson
(twisted ring) Counters
Finite State Machine: Fault Analysis and Synthesis.

6. Concepts of Programmable logic devices: 2L

Programmable and gated array devices (PLDs) for designing combinatorial
circuits- PAL, PLA.

Total 42L
Total Week Required: 14
No. Of Week Reserved: 02
Suggested Text and/or Reference Books:

1. A.Anand Kumar, Fundamental of digital circuits, Prentice Hall India

2. M. Mano, Digital design, Pearson Education
3. T.L.Floyd, R.P.Jain , Digital Fundamentals Pearson Education
4. Contemporary Logic Design, Randy H. Katz, Addision-Wesley Publishing Company
5. Fundamentals of Logic Design, Charles H. Roth, Larry N. Kinney, Cengage Learning
6. Stephen H. Unger, The Essence of Logic Circuits, IEEE-Wiley Press

Course Outcomes:

Students will be able to

 Design different combinatorial circuits based on several combinational logic
 Design sequential circuits with clear concepts of logic states
 Inculcate the concepts of finite state machines and their impact on theoretical computer science
 Realize programmable hardware circuits and devices

Laboratory Syllabus:

Module Detailed Description Practical

Period
1 Realization of AND, OR, NOT & XOR gates using universal gates (NAND, 6P
NOR) and verification of De Morgan’s theorem
2 Realization of different combinatorial circuits such as adder, subtractor, 18P
multiplexor etc using logic gates
3 Realization of different sequential circuits such as flip-flops, shift-registers or 18P
counters using logic gates
Total: 42P
Total Week Required: 14
No. Of Week Reserved: 02

Suggested Text and/or Reference Books:

1. A.Anand Kumar, Fundamental of digital circuits, Prentice Hall India

2. M. Mano, Digital design, Pearson Education
3. T.L.Floyd, R.P.Jain , Digital Fundamentals Pearson Education
4. Contemporary Logic Design, Randy H. Katz, Addision-Wesley Publishing Company
5. Fundamentals of Logic Design, Charles H. Roth, Larry N. Kinney, Cengage Learning
6. Stephen H. Unger, The Essence of Logic Circuits, IEEE-Wiley Press

Course Outcomes:

Students will be able to

 Implement hands-on different combinatorial and sequential circuits and verify their functionality
against respective truth tables
Course code BSC-M 302
Category Basic Science Course
Course title Differential Calculus

Scheme and L T P Credits Semester – III

Credits 2 0 0 2

Pre-requisites (if any)

Detailed contents:
Detailed Description Lecture /
Module Tutorial
Period
1. Successive Derivatives, Leibnitz’s Theorem, Points of inflexion, Concavity and 8L
Convexity, Curvature and Asymptotes.

2. Limit, Continuity and Differentiability of functions of several variables, Partial 12L

Derivatives and their geometrical interpretation, increments and differentials,
derivatives of composite and implicit functions, Derivatives of higher orders and
their commutativity, Euler’s Theorem on homogeneous functions, Jacobian,
Taylor’s and Maclaurin’s expansion, Maxima and Minima, Lagrange’s method
of multipliers.
3. Functional Analysis 8L
Metric space-Definition with examples; Holder inequality and Minkowski
inequality;
Properties of metric space; Separable metric space with examples; Convergence,
Cauchy sequence.
Normed Space with examples; Banach Space-Definition with examples; Inner
Product Space and Hilbert Space; Properties of Inner Product Space.
Total 28L
Total Week Required: 14
No. Of Week Reserved: 02

Books: Text and/or Reference:

1. Mathematical Analysis- S. C. Malik, Savita Arora, New Age Publishers

2. Differential Calculus- Shanti Narayan, S Chand & Co Ltd, 2005
3. Functional Analysis-B. Limaye, New Age International Publishers
4. Functional Analysis- P.K. Jain, New Age International Publishers
5. Calculus and Analytical Geometry-Thomas and Finney, Addison Wiseley Publisher
6. Calculus- J. Stewart, Cengage Learning, 2011.

Course outcomes: After completing the course the students will be able to
 Interpret both continuous and differentiable functions geometrically and analytically and apply Leibnitz
Rule for successive differentiation.
 Develop skills and knowledge for standard concepts in multivariate calculus with abilityto compute points
of inflexion, Concavity and Convexity, Curvature and Asymptotes.
 Deduce derivatives of composite and implicit functions, derivatives of higher orders, Taylors and
Maclaurin’s series expansion of multivariate functions.
 Comprehend the basics of functional analysis including the concept of metric space, its basic properties as
well as Hilbert and Banach Space to identify the applications of distance based dissimilarity in different
engineering sciences.
 Course code BSC-BS 301
Category Basic Science Courses (BSC)
Course title Engineering Biology

Scheme and L T P Credits Semester – III

Credits 2 1 0 3

Pre-requisites (if any)

Theory Syllabus:
Detailed Description Lecture /
Module Tutorial
Period
Introduction
Purpose: To convey that Biology is as important a scientific discipline as
Mathematics, Physics and Chemistry. Bring out the fundamental differences
between science and engineering by drawing a comparison between eye and
camera, Bird flying and aircraft. Mention the most exciting aspect of biology as
01. an independent scientific discipline. Why we need to study biology? Discuss how 4L+2T
biological observations of 18th Century that lead to major discoveries. Examples
from Brownian motion and the origin of thermodynamics by referring to the
original observation of Robert Brown and Julius Mayor. These examples will
highlight the fundamental importance of observations in any scientific inquiry.
Classification
Purpose: To convey that classification per se is not what biology is all about. The
underlying criterion, such as morphological, biochemical or ecological be
highlighted. Hierarchy of life forms at phenomenological level. A common thread
weaves this hierarchy Classification. Discuss classification based on (a)
02. cellularity- Unicellular or multicellular (b) ultrastructure-prokaryotes or 3L+2T
eucaryotes. (c) energy and Carbon utilization -Autotrophs, heterotrophs,
lithotropes (d) Ammonia excretion – aminotelic, uricotelic, ureotelic (e) Habitata-
acquatic or terrestrial (e) Molecular taxonomy- three major kingdoms of life. A
given organism can come under different category based on classification. Model
organisms for the study of biology come from different groups. E.Coli,
S.Cerevisiae, D. Melanogaster, C. elegance, A. Thaliana, M. musculus
Genetics
Purpose: To convey that “Genetics is to biology what Newton’s laws are to
Physical Sciences”. Mendel’s laws, Concept of segregation and independent
assortment. Concept of allele. Gene mapping, Gene interaction, Epistasis.
03. Meiosis and Mitosis be taught as a part of genetics. Emphasis to be give not to the 3L+1T
mechanics of cell division nor the phases but how genetic material passes from
parent to offspring. Concepts of recessiveness and dominance. Concept of
mapping of phenotype to genes. Discuss about the single gene disorders in
humans. Discuss the concept of complementation using human genetics.
Biomolecules
Purpose: To convey that all forms of life has the same building blocks and yet the
manifestations are as diverse as one can imagine. Molecules of life. In this context
04. 4L+1T
discuss monomeric units and polymeric structures. Discuss about sugars, starch and
cellulose. Amino acids and proteins. Nucleotides and DNA/RNA. Two carbon units
and lipids.
 Enzymes
Purpose: To convey that without catalysis life would not have existed on earth.
Enzymology: How to monitor enzyme catalysed reactions. How does an enzyme
05. 3L+2T
catalyse reactions? Enzyme classification. Mechanism of enzyme action. Discuss at
least two examples. Enzyme kinetics and kinetic parameters. Why should we know
these parameters to understand biology? RNA catalysis.
Information Transfer
Purpose: The molecular basis of coding and decoding genetic information is
06. universal. Molecular basis of information transfer.DNA as a genetic material. 3L+1T
Hierarchy of DNA structure- from single stranded to double helix to nucleosomes.
Concept of genetic code. Universality and degeneracy of genetic code. Define gene
in terms of complementation and recombination.
Macromolecular analysis
Purpose: To analyse biological processes at the reductionistic level. Proteins-
07. structure and function. Hierarch in protein structure. Primary secondary, tertiary and 3L+2T
quaternary structure. Proteins as enzymes, transporters, receptors and structural
elements.
Module 8: Metabolism
Purpose: The fundamental principles of energy transactions are the same in physical
and biological world. Thermodynamics as applied to biological systems.
08. Exothermic and endothermic versus endergonic and exergonic reactions, Concept of 2L+2T
Keq and its relation to standard free energy, Spontaneity, ATP as an energy
currency. This should include the breakdown of glucose to CO 2 + H2O (Glycolysis
and Krebs cycle) and synthesis of glucose from CO 2 and H2O (Photosynthesis).
Energy yielding and energy consuming reactions, Concept of Energy charge.
Microbiology
Concept of single celled organisms, Concept of species and strains. Identification
09. 3L+1T
and classification of microorganisms, Microscopy, Ecological aspects of single
celled organisms, Sterilization and media compositions, Growth kinetics.
Total 28L+14T
Total Week Required 14
No. Of Week Reserved 02

Books: Text and/or Reference:

1. N. A. Campbell, J. B. Reece, L. Urry, M. L. Cain and S. A. Wasserman, “Biology: A global approach”,

Pearson Education Ltd, 2014.
2. E. E. Conn, P. K. Stumpf, G. Bruening and R. H. Doi, “Outlines of Biochemistry”, John Wiley and Sons,
2009.
3. D. L. Nelson and M. M. Cox, “Principles of Biochemistry”, W.H. Freeman and Company, 2012.
4. G. S. Stent and R. Calendar, “Molecular Genetics”, Freeman and company, 1978
5. L. M. Prescott, J. P. Harley and C. A. Klein, “Microbiology”, McGraw Hill Higher Education, 2005.

Course Outcomes: After studying the course, the student will be able to

 Describe how biological observations of 18th Century that lead to major discoveries.
 Convey that classification per se is not what biology is all about but highlight the underlying
criteria, such as morphological, biochemical and ecological
 Highlight the concepts of recessiveness and dominance during the passage of genetic material
from parent to offspring
 Convey that all forms of life have the same building blocks and yet the manifestations are as diverse
as one can imagine
  Classify enzymes and distinguish between different mechanisms of enzyme action. Identify
DNA as a genetic material in the molecular basis of information transfer. Analyse biological
processes at the reductionistic level
 Apply thermodynamic principles to biological systems. Identify and classify microorganisms.

Course code HSM-HU 381

Category Humanities and Social Sciences including Management courses
Course title Linguistics & Oral Communication

Scheme and L T P Credits Semester – III

Credits 0 0 2 0
Pre-requisites (if any) -

Laboratory Syllabus:

Module Detailed Description Lecture

1. Concept of Indian English Literature and its Evolution: 09L
Evolution of English Language; Evolution of Past Colonial English; History of
English language in India; Concept of Indian English Literature
2. Phonetics: 05L
Speech organs; Sound of English (vowels, short vowels, long vowels and
consonants)
3. Strategies of Conversation, Group Discussion and Public Speaking: 06L
Difference between conversation and group discussion (GD); use of video cassettes
to decide the strategies to be taken during GD; Practice on contemporary social,
economic, political and educational topics
4. Presentation: 08L
Students will be taught how to make lab presentation using different audiovisual
aids
Total 28L
Total Week Required 14
No. of Week Reserved 02

Text Books:
1. A Text book of English phonetics. T. Balasubramanian. MacMillan Publishers India Ltd. 2013
2. Personality Development and Soft Skills. Barun K. Mitra. Oxford University Press, 2016.
3. Group discussion and interview ( with audio cassette) Prasad. TMH

Reference Books:
1. Soft Skills and Employability Skills. Sabina Pillai, Agna Fernandez. Cambridge University Press, 2018
2. Communication at work place, Alder and Elmhorst. MHI
3. Language, Literature and creativity. Orient Blackswan. 2013

Course outcomes: On completion of the course students will be able to

 Critically analyse and evaluate regional and worldwide implications of emergence of English as a lingua
franca.
 Understand the structure of speech organs and their functions and also be familiar to different types of
phonetic sounds.
 Differentiate between conversation and group discussion and will be able to participate in group discussion
effectively.
 Deliver lab presentation with clarity and impact using different audio-visual aids.
 Semester IV (Second year) Curriculum Branch/Course:
Computer Science and Engineering

Sl. Type of Course Code Course Title Hours per week Credits Marks
No
L T P
1 Professional PCC-CSE 401 Discrete Mathematics 3 1 0 4 100
Core Course
2 Professional PCC-CSE 402 Computer 3 0 0 3 100
Core Course Organization
&
Architecture
PCC-CSE 452 Computer 0 0 4 2 100
Organization
&
Architecture
Laboratory
3 Professional PCC-CSE 403 Operating Systems 3 0 0 3 100
Core Course PCC-CSE 453 Operating Systems 0 0 4 2 100
Laboratory
4 Professional PCC-CSE 404 Design & Analysis 3 0 0 3 100
Core Course of Algorithms
PCC-CSE 454 Design & Analysis 0 0 4 2 100
of Algorithms
Laboratory
5 Humanities HSM-HU 401 Economics & 2 0 0 2 100
& Social Accountancy
Sciences
including
Management
Course
6 Mandatory MC-HU 402 Environmental 3 0 0 0 100*
Course Sciences
7 Humanities HSM-HU 481 Business 0 0 2 0 100*
& Social Communication
Sciences
including
Management
Course
Total: 21 800

*Marks for this paper will not reflect in total marks for the semester
 Course code PCC-CSE 401 (For Theory)
Category Professional Core Course (PCC)
Course title Discrete Mathematics

Scheme and L T P Credits Semester – IV

Credits 3 1 0 4

Pre-requisites (if any)

Objectives of the course:

Throughout the course, students will be expected to demonstrate their understanding of Discrete
Mathematics by being able to do each of the following:
 Use mathematically correct terminology and notation.
 Construct correct direct and indirect proofs.
 Use division into cases in a proof.
 Use counterexamples.
 Apply logical reasoning to solve a variety of problems.

Theory Syllabus:

Lecture /
Module Detailed Description Tutorial
Period
1. Sets, Relation and Function: 8L
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.

2. Basic counting techniques-inclusion and exclusion, pigeon-hole principle, 8L

permutation and combination.
 3. Propositional Logic: 10L
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.
4. Algebraic Structures and Morphism: 8L
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

5 Graphs and Trees: 8L

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.

Total 42L
Total Week Required: 14
No. Of Week Reserved: 02

Books: Text and/or Reference:

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.
4. J.P. Tremblay and R. Manohar, Discrete Mathematical Structure and It’s Application to
Computer Science”, TMG Edition, Tata McGraw-Hill
5. Norman L. Biggs, Discrete Mathematics, 2nd Edition, Oxford University Press.
6. Schaum’s Outlines Series, Seymour Lipschutz, Marc Lipson, Discrete Mathematics, Tata
McGraw – Hill

Course Outcomes:

 For a given logic sentence express it in terms of predicates, quantifiers, and logical connectives
 For a given a problem, derive the solution using deductive logic and prove the solution based on
logical inference
 For a given a mathematical problem, classify its algebraic structure
 Evaluate Boolean functions and simplify expressions using the properties of Boolean algebra
 Develop the given problem as graph networks and solve with techniques of graph theory.
 Course code PCC-CSE 402 (For Theory),PCC-CSE 452 (For Laboratory)
Category Professional Core Course (PCC)
Course title Computer Organization & Architecture (Theory & Laboratory)

Scheme and L T P Credits Semester – IV

3 0 4 5 [The lab component should
have one hour of tutorial
followed or preceded by
Credits laboratory assignments]

Pre-requisites (if any) ESC-CSE 302

Objectives of the course:

To expose the students to the following:

 How Computer Systems work & the basic principles
 Instruction Level Architecture and Instruction Execution
 The current state of art in memory system design
 How I/O devices are accessed and its principles.
 To provide the knowledge on Instruction Level Parallelism
 To impart the knowledge on micro programming
 Concepts of advanced pipelining techniques

Theory Syllabus:

Lecture /
Module Detailed Description Tutorial
Period
1. Functional blocks of a computer: 10L
CPU, memory, input-output subsystems, control unit.
Instruction set architecture of a CPU – registers, instruction execution cycle,
RTL interpretation of instructions, addressing modes, instruction set. Case study
– instruction sets of some common CPUs.
Data representation:
Signed number representation, fixed and floating point representations,
character representation. Computer arithmetic – integer addition and
subtraction, ripple carry adder, carry look-ahead adder, etc. multiplication –
shift-and add, Booth multiplier, carry save multiplier, etc. Division restoring
and non-restoring techniques, floating point arithmetic.

2. Introduction to x86 architecture. 12L

CPU control unit design:
Hardwired and micro-programmed design approaches, Case study – design of a
simple hypothetical CPU.
Memory system design:
Semiconductor memory technologies, memory organization.
 Peripheral devices and their characteristics:
Input-output subsystems, I/O device interface, I/O transfers – 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

3. Pipelining: 10L
Basic concepts of pipelining, throughput and speedup, pipeline hazards.
Parallel Processors:
Introduction to parallel processors, Concurrent access to memory and cache
coherency.

4. Memory organization: 10L

Memory interleaving, concept of hierarchical memory organization, cache
memory, cache size vs. block size, mapping functions, replacement algorithms,
write policies.

Total 42L
Total Week Required: 14
No. Of Week Reserved: 02

Books: Text and/or Reference:

1. “Computer Organization and Design: The Hardware/Software Interface”, 5th Edition by David A.
Patterson and John L. Hennessy, Elsevier.
2. “Computer Organization and Embedded Systems”, 6th Edition by Carl Hamacher, McGraw Hill
Higher Education.
3. “Computer Architecture and Organization”, 3rd Edition by John P. Hayes, WCB/McGraw-Hill
4. “Computer Organization and Architecture: Designing for Performance”, 10th Edition by William
Stallings, Pearson Education.
5. “Computer System Design and Architecture”, 2nd Edition by Vincent P. Heuring and Harry F.
Jordan, Pearson Education.

Laboratory Syllabus:

Module Detailed Description Practical

Period
1. Realization of different arithmetic units of the CPU 16P

2. Realization of different storage / memory units and interfacing of them 16P

3. HDL design entry and simulation of these components 24P

Total: 56P
Total Week Required: 14
No. Of Week Reserved: 02
Books: Text and/or Reference:

1. “Computer Organization and Design: The Hardware/Software Interface”, 5th Edition by David A.
Patterson and John L. Hennessy, Elsevier.
2. “Computer Organization and Embedded Systems”, 6th Edition by Carl Hamacher, McGraw Hill
Higher Education.
3. “Computer Architecture and Organization”, 3rd Edition by John P. Hayes, WCB/McGraw-Hill
4. “Computer Organization and Architecture: Designing for Performance”, 10th Edition by William
Stallings, Pearson Education.
5. “Computer System Design and Architecture”, 2nd Edition by Vincent P. Heuring and Harry F.
Jordan, Pearson Education.

Course outcomes:

 Draw the functional block diagram of a single bus architecture of a computer and describe the
function of the instruction execution cycle, RTL interpretation of instructions, addressing modes,
instruction set.
 Write assembly language program for specified microprocessor for computing 16 bit
multiplication, division and I/O device interface (ADC, Control circuit, serial port
communication).
 Write a flowchart for Concurrent access to memory and cache coherency in Parallel Processors
and describe the process.
 Given a CPU organization and instruction, design a memory module and analyze its
operation by interfacing with the CPU.
 Given a CPU organization, assess its performance, and apply design techniques to enhance
performance using pipelining, parallelism and RISC methodology

Course code PCC-CSE 403 (For Theory),PCC-CSE 453 (For Laboratory)

Category Professional Core Course (PCC)
Course title Operating Systems (Theory & Laboratory)

Scheme and L T P Credits Semester – IV

Credits 3 0 4 5

Pre-requisites (if any) PCC-CSE 301, PCC-CSE 402

Objectives of the course:

To learn the fundamentals of Operating Systems

 To learn the mechanisms of OS to handle processes and threads and their communication
 To learn the mechanisms involved in memory management in contemporary OS
 To gain knowledge on distributed operating system concepts that includes architecture,
 Mutual exclusion algorithms, deadlock detection algorithms and agreement protocols
 To know the components and management aspects of concurrency management
Theory Syllabus:

Module Detailed Description Lecture /

Tutorial
Period
1. Introduction: 4L
Concept of Operating Systems, Generations 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.

2. Processes: 10L
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.

3. Inter-process Communication: 5L
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.

4. Deadlocks: 5L
Definition, Necessary and sufficient conditions for Deadlock, Deadlock
Prevention, Deadlock Avoidance: Banker’s algorithm, Deadlock detection and
Recovery.

5. Memory Management: 8L
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).
 6. I/O Hardware: 7L
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.

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

Total: 42P
Total Week Required: 14
No. Of Week Reserved: 02

Books: Text and/or Reference:

1. Operating System Concepts Essentials, 9th Edition by AviSilberschatz, 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: A Design-oriented Approach, 1st Edition by Charles Crowley, Irwin
Publishing
4. Operating Systems: A Modern Perspective, 2nd Edition by Gary J. Nutt, Addison-Wesley
5. Design of the Unix Operating Systems, 8th Edition by Maurice Bach, Prentice-Hall of India
6. Understanding the Linux Kernel, 3rd Edition, Daniel P. Bovet, Marco Cesati, O'Reilly and
Associates

Laboratory Syllabus:

Module Detailed Description Practical

Period
1. Basic Unix commands, problems on shell programming 15P

2. Problems on processes and implementation of different operations on processes. 11P

3. Implementation of different inter-process communication mechanisms like 15P

pipes, semaphore etc.

4. Implementing signal handling mechanisms. 5P

5. POSIX Threads : programming with pthread functions (viz. pthread_create, 10P

pthread_join, pthread_exit, pthread_attr_init, pthread_cancel).

Total: 56P
Total Week Required: 14
No. Of Week Reserved: 02
Books: Text and/or Reference:
1. “ Your Unix: The Ultimate Guide”, Sumitabha Das, McGraw Hill
2. “ Shell Programming”, Y. Kanetkar , BPB Publication
3. “ Unix Network Programming”, W. R.Stevens , PHI
4. “ Design Unix Operating System”, Bach, PHI
5. “ The Unix Programming Environment”, Kerninghan and Pike, PHI

Course outcomes:

 The objective of the course is to provide introduction to operating system design and concept
of process, process lifecycle and scheduling approaches.
 Understanding advanced concepts in operating systems.
 Learning principles of Distributed and multiprocessor operating systems

Course code PCC CSE 404 (For Theory), PCC-CSE 454 (For Laboratory)
Category Professional Core Course (PCC)
Course title Design and Analysis of Algorithms (Theory & Laboratory)

Scheme and L T P Credits Semester – IV

Credits 3 0 4 5

Pre-requisites ESC-CSE 201

Objectives of The Course:

 Analyze the asymptotic performance of algorithms.

 Write rigorous correctness proofs for algorithms.
 Demonstrate a familiarity with major algorithms and data structures.
 Apply important algorithmic design paradigms and methods of analysis.
 Synthesize efficient algorithms in common engineering design situations.

Theory Syllabus:

Lecture /
Module Detailed Description Tutorial
Period
1. Introduction: 12L
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.
 2. Fundamental Algorithmic Strategies: 12L
Brute-Force, Greedy, Dynamic Programming, Branch and 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.

3. Graph and Tree Algorithms: 8L

Traversal algorithms: Depth First Search (DFS) and Breadth First Search
(BFS); Shortest path algorithms, Transitive closure, Minimum Spanning Tree,
Topological sorting, Network Flow Algorithm.

4. Tractable and Intractable Problems: 6L

Computability of Algorithms, Computability classes – P, NP, NP-complete and
NP-hard. Cook’s theorem, Standard NP-complete problems and Reduction
techniques.

5. Advanced Topics: 4L
Approximation algorithms, Randomized algorithms, Class of problems beyond
NP – P SPACE.

Total 42L
Total Week Required: 14
No. Of Week Reserved: 02

Books: Text and/or Reference:

1. “Introduction to Algorithms”, Fourth Edition Thomas H Cormen, Charles E Lieserson, Ronald L

Rivest and Clifford Stein, MIT Press/McGraw-Hill.
2. “Fundamentals of Algorithms”, E. Horowitz , Sartaj Sahni, Sanguthevar Rajasekara, Computer
Science Press
3. “Algorithm Design”, First 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”, Third Edition, UdiManber, Addison-Wesley, Reading, MA.

Laboratory Syllabus:

Module Detailed Description Practical

Period
1. Simulation and Analysis of different sorting and searching algorithms under 10P
various conditions.

2. Implementation and Analysis of various algorithmic strategies to solve the 28P

different standard problems.

3. Implementation and Analysis of different Graph and Tree Related Algorithms. 10P

4. Implementation of different standard NP complete problems. 8P

 Total: 56P
Total Week Required: 14
No. Of Week Reserved: 02

Books: Text and/or Reference:

1. T.H. Coreman, C.E. Leiserson, R. L.. Rivest and C. Stein, Introduction to Algorithms, The MIT
Press.
2. E.Horowitz, S..Sahani and S. Rajasekaran, Fundamentals of Computer Algorithms, Universities
Press.
3. S. Baase and A. V. Gelder, Computer Algorithms: Introduction to Design and Analysis, Pearson
4. G. Bassard and P. Bartly, Fundamentals of Algorithmics, Prentice Hall India Learning Private
Limited
5. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Algorithms, Prentice
Hall India Learning Private Limited
6. J. Kleinberg and E. Tardos, Algorithm Design, Pearson.

Course outcomes:

 For a given algorithms analyze worst-case running times of algorithms based on asymptotic
analysis and justify the correctness of algorithms.
 Describe the greedy paradigm and explain when an algorithmic design situation calls for it. For a
given problem develop the greedy algorithms.
 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.
 Describe the dynamic-programming paradigm and explain when an algorithmic design situation
calls for it. For a given problems of dynamic-programming and develop the dynamic
programming algorithms, and analyze it to determine its computational complexity.
 For a given model engineering problem model it using graph and write the corresponding algorithm
to solve the problems.
 Explain the ways to analyze randomized algorithms (expected running time, probability of error).
 Explain what an approximation algorithm is. Compute the approximation factor of an
approximation algorithm (PTAS and FPTAS).

Course code HSM-HU401

Category Humanities and Social Sciences including Management Courses
Course title Economics and Accountancy

Scheme and L T P Credits Semester – IV

Credits 2 0 0 2
Pre-requisites (if any) Basic understanding of market, economic transactions, cost and price, banking
functions, national income etc.

Theory Syllabus:
Lecture /
Module Detailed Description
Tutorial Period
1 Definition of Economics 2L
Concept of economic activities and economic agents, the concept of market as an
 institution, distinction between micro and macro theory, the basic concept of price.

2 The concept of consumption and demand 3L

Marshallian and indifference curve theory -- basic concepts-- derivation of law of
demand- demand function, market demand curve – elasticity of demand – different
form of elasticity of demand – relation between elasticity, expenditure, ARSMR
3 The theory of production 2L
Isoquant and isocost function – AP, MP, AC, MC curves. Their relationship –
concept of short run and long run cost consume – law of variable proportion and
returns to scale.
4 Concept of product pricing 4L
Profit maximization objective – short run long run equilibrium conditions of firm
and industry, the industry supply curve and its relation with externalities, price
determination, Monopoly, equilibrium condition, concept of monopoly power,
oligopoly: basic concept of non callusives forms.
5 Behavioristic goals by firm: sales maximization 1L
6 National income and accounting analysis 2L
Concept of GDP, GNP and NNP, Methods of measuring national income.
7 Consumption and saving function, investment, determination of equilibrium 2L
national income, concept of multiplier and accelerator.
8 Concept of inflationary gap, demand pull and cost push inflation 2L
: anti- inflationary policies, basic idea
9 Principles of banking, Central bank, Commercial Banks and other financial 2L
institutions: basic concepts and functions
10 Basic accounting concepts& Recording of the primary books 4L
Fundamental concepts of accountancy, Golden Rules of Accounts, Principle of
double entry system, financial statements and their nature.
Different types of the primary books, recording of transactions, preparation of the
cash books and journal proper.
Ledger and Trial Balance, Final Account, Cash Book, Depreciation Methods.

11 Financial Accounting(Elementary Treatment) 4L

FinancialRatioAnalysis,Cashflowanalysis, Fundsflowanalysis, Comparative
financial statements-Analysis&Interpretationoffinancial statements. Concepts Of
Investments : Risks and return evaluation of investment decision, Average rate of
return , Payback Period , Net Present Value, Internal rate of return
Total: 28 L
Total Week Required: 14
No. of Week Reserved: 02

Text Books/ Reference Books:

1) Samuelson: Economics, Tata McGrawHill
2) A. Koutsoyiannis: Modern Economics Theory, Palgrave Macmillan
3) Hasengreen: Introduction to Accounting,
4) V. Mote, S. Paul, G. Gupta(2004), Managerial Economics, Tata McGraw Hill
5) Misra, S.K. and Puri (2009), Indian Economy, Himalaya
6) JoydebSarkhel, Micro Economics Theory,Kolkata Book Syndicate
7) JoydebSarkhel, Macro Economics Theory,Kolkata Book Syndicate
8) Hanif Mukherjee, Modern Accountancy, Tata McGrawHill
9) Khan and Jain, Financial Management, Tata McGrawHill
10) J.M.Pandey, Financial Management, Vikas Publishing House
 Course Outcomes: After completing the course the students will be able to
 Know and identify economic activities and why problem of choice arises and how this concept can be applied to
practical field in micro and macro level; Acquire the knowledge of different types of markets and market
mechanism and how prices are fixed there with changing demand, supply and elasticity and how they are regulated
 Enable them to comprehend different types costs and to carry out cost analysis and how they affect production in
the short run and long run period; Explain national income and how they are measured and what are its impacts on
the national economy and standard of living of a country
 Have a clear concept of inflation and its different types and how they affect organizational budget and national
budget and standard of living of a country; Understand banking system and its role in the development and growth
of a country and how these facilities can be availed for the growth of the particular organization/ firm
 Understand the business language and concept of Accounting and Accounting Cycle, Accounting Equation and
different accounting terms like asset, liability, capital, income, expenditure etc. to understand financial health and
strength of a particular organization.
 Know the concepts of financial management and how top management test the financial health of a concern and
exercises financial control using different accounting tools like comparative financial statement analysis, ratio
analysis, cash flow and fund flow analysis etc.
 Realize time value of money and use of different capital investment appraisal techniques such as NPV, IRR,
Profitability Index, Payback period etc. to test the feasibility of a project.

Course code MC-HU402

Category Mandatory Course (MC)
Course title Environmental Science

Scheme and L T P Credits Semester – IV

Credits 3 0 0 0

Pre-requisites (if any)

Theory Syllabus:
Detailed Description Lecture/
Module Tutorial
Period
General concepts of ecosystem and environment:
Concepts of Environmental Science and engineering, structure and functions in
1 ecosystem, Energy flow in ecosystem in context of first law and second law of 06L
thermodynamics, Impact of anthropogenic activities on environment, Pollution as
undesirable by product of development
Environmental physics:
Greenhouse gases and global warming, climate change mechanism due to greenhouse
gases, Global warming potential, Energy-source and distribution in India, renewable and
2 non-renewable energy resources, conventional vs nonconventional energy, nuclear 06L
power and solar energy, noise pollution–source, effects, types, measuring instruments
and control methods
 Environmental chemistry:
Chemical composition air, water and soil, water quality analysis in context of BOD and
3 COD. Environmental monitoring: brief idea on air and water, soil quality parameters and 05L
their estimation.
Environmental modelling:
4 Air pollution modelling –Gaussian pollution model for estimation of GLC, numerical 05L
problem related to it. Streeter-Phelps simulation and first order BOD rate equation.
Environmental Biology:
5 Bioaccumulation and biomagnifications of toxic discharges, Threats to biodiversity. 05L
Bioremediation and phyto -remediation in reducing toxic contamination.
Environmental technology and management:
Solid waste management, radioactive waste –its treatment and management, Waste water
6 treatment procedure, Air pollution (Both particulate and gaseous) management by 05L
technological innovation. ISO :14001

Disaster management:
7 05L
Remote sensing and GIS as tool of disaster management.
Environmental Impact analysis:
8 05L
Definition, need, objectives, methods, preparation of EIA report.
Total 42L
Total week required 14
No. of week reserved 02

Books: Text and/or Reference:

1. Water Supply, Waste Disposal and Environmental Engineering by A.K. Chatterjee, Khanna Publishers, Delhi.
2. Waste Water Engineering by Metcafe & Eddy.
3. Fundamentals of Environment and Ecology by Debapriya De and Debasish De, S Chand & Company Ltd
4. Basic Environmental Engineering and elemental biology by Patra and Singha Aryan Pub. House

Course Outcomes: At the end of this course, students will be able to

 To understand the basic concept of ecosysytem, Energy flow in ecosystem.
 To acquire knowledge on concept of environmental pollution, green house effect, climate change, air
pollution, noise pollution, water pollution, energy source and use of renewable energy.
 To understand the role of chemistry in environmental analysis and monitoring.
 To acquire basic idea to reduce environment pollution by bioaccumulation and bioremediation
 Treatment of solid waste management radioactive waste and air pollution management.
 To apply remote sensing and GIs as tool of disaster management, Environment impact analysis, methods and
preparations of EIA report.

Course code HSM-HU 481

Category Humanities and Social Sciences including Management courses
Course title Business Communication

Scheme and L T P Credits Semester – IV

Credits 0 0 2 0

Pre-requisites (if any)

Laboratory Syllabus:

Module Detailed Description Lecture

Business Communication:
1. Role of Communication in information age; skills necessary for technical
06L
communication; communications in a technical organization; Barriers to the
process of communication
2. Style and organization in technical communication:
Listening, speaking, reading, writing as skills; Objectively, Clarity, Precision as
08L
defining features of technical communication; Transfer of nonverbal to verbal
communication and vice-versa.
Communication and personality development:
Psychological aspects of communication; politeness and etiquette in
3. 08L
communication; cultural factors that influence communication, mannerisms to be
avoided in communication; Language and conflicts resolution.
Various types of Business writings:
4. 06L
Letters, reports, note, memos etc; citation, paraphrasing media review.
Total 28L
Total Week Required 14
No. of Week Reserved 02

Text Books:
1. Effective Business Communication. Herta A. Murphy. McGraw Hill Education. 2017
2. Communication Skills for Technical Students. Farhathullah, T.M.

Reference Books:
1. Effective Technical Communication. M. Ashraf Rizvi. McGraw Hill.
2. The Business letters Handbook. Michael Muckian, John woods
3. Fundamentals of Technical Communication. Menakshi Raman, Sangeeta Sharma. Oxford University Press. 2015
4. Organizational Behavior. Fred Luthans. McGraw Hill

Course Outcomes:
On completion of the course students will be able to:
 Communicate information in a proper technical way using business Jargon.
 Transmit effectively across cultures and to a range of different business audiences improving listening, speaking,
reading and writing skills.
 Develop cognitive ability to construct strong business etiquette and relationship building skills.
 Enhance personality, infuse confidence and enlarge employability in any desired career.