Maulana Abul Kalam Azad University of Technology

(Formerly West Bengal University of Technology)

Syllabus and Curricular Mapping for B. Tech. in Information Technology
Effective from Acdemic Session 2023-24

SECOND YEAR

SEMESTER III

Page: 4 / 123
 Maulana Abul Kalam Azad University of Technology
(Formerly West Bengal University of Technology)
Syllabus and Curricular Mapping for B. Tech. in Information Technology
Effective from Acdemic Session 2023-24

COURSE BOOKLET FOR B.TECH (IT)

SECOND YEAR

Page: 38 / 123
 Maulana Abul Kalam Azad University of Technology
(Formerly West Bengal University of Technology)
Syllabus and Curricular Mapping for B. Tech. in Information Technology
Effective from Acdemic Session 2023-24
SEMESTER – III
THEORY

Course Title: Analog & Digital Electronics Code:ESC 301

Type Of Course: Theory Course Designation: Compulsory
Semester: 3rd Contact Hours: 3L/week
Continuous Assessment: 25 Marks Final Exam: 70 Marks
Writer: Course Coordinator Approved by Program Assessment
Committee(PAC)
Pre-requisites: Class XII Mathematics, Physics, Basic knowledge of Computer, Basic Electronics, Basic Electrical.
COURSE OBJECTIVE:
 Explain the principles of analog and digital systems.
 Compare the performance of the digital system over the analog system.
 Prepare analog as well as digital logic circuits.
 Creating a hardware module with some specific application.

COURSE OUTCOMES (COs)

On completion of the course students will be able to
Course Outcomes CO statement Knowledge Level of revised
Bloom’s Taxonomy

ESC301.CO1 Demonstrate the concepts of digital circuits Understanding (Level II)

ESC301.CO2 Discuss between analog and digital system. Creating (Level VI)

ESC301.CO3 Develop the analog circuits to determine for a given outputs. Creating (Level VI)

ESC301.CO4 Explain the different model of analog and digital logic circuits. Evaluating (Level V)

ESC301.CO5 Analyze the outputs for given inputs for particular analog and Analysing (Level VI)
digital circuits.

ESC301.CO6 Explain the principle of different analog and digital electronics Understanding (Level II)
circuits.

Mapping of COs with POs and PSOs (Course Articulation Matrix):

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 1 1 1 - 2 2 3 2 3 - 2 3 3 2
CO2 3 2 1 1 2 - - 3 3 1 1 3 3 2 3
CO3 3 2 3 1 1 - - 2 3 2 2 2 3 2 3
CO4 3 3 3 2 - - - 3 3 2 2 2 3 2 3
CO5 3 2 1 1 3 - - 2 3 1 2 2 3 2 2
CO6 3 2 2 1 - - - 2 2 - 2 1 3 2 1
AVG. 3.00 2.00 1.83 1.17 2.00 2.00 2.00 2.50 2.67 1.80 1.80 2.00 3.00 2.17 2.33

Page: 39 / 123
 Maulana Abul Kalam Azad University of Technology
(Formerly West Bengal University of Technology)
Syllabus and Curricular Mapping for B. Tech. in Information Technology
Effective from Acdemic Session 2023-24
University Syllabus:
Unit Content Hrs/Unit

1 Introduction 9

Different Classes of Amplifiers - (Class-A, B, AB and C - basic concepts, power, efficiency;

Recapitulation of basic concepts of Feedback and Oscillation, Phase Shift, Wein Bridge oscillators
Astable & Monostable Multivibrators; Schimtt Trigger circuits, 555 Timer.

2 Binary Number System & Boolean Algebra (recapitulation); BCD, ASCII, EBDIC, Gray codes and 11
their conversions; Signed binary number representation with 1’s and 2’s complement methods, Binary
arithmetic, Venn diagram, Boolean algebra (recapitulation); Representation in SOP and POS forms;
Minimization of logic expressions by algebraic method. Combinational circuits - Adder and
Subtractor circuits (half & full adder & subtractor); Encoder, Decoder, Comparator, Multiplexer,
DeMultiplexer and Parity Generator.

3 Sequential Circuits - Basic Flip-flop & Latch, Flip-flops -SR, JK, D, T and JK Master-slave Flip 10
Flops, Registers (SISO, SIPO, PIPO, PISO) Ring counter, Johnson counter Basic concept of
Synchronous and Asynchronous counters (detail design of circuits excluded), Design of Mod N
Counter.

4 A/D and D/A conversion techniques – Basic concepts (D/A :R-2-R only A/D: successive 6
approximation. Logic families- TTL, ECL, MOS and CMOS - basic concepts.

GATE syllabus (If applicable for GATE):

GATE syllabus content Mapping unit of university syllabus

Encoder, Decoder, Comparator, Multiplexer, Unit 2

DeMultiplexer and Parity Generator.

Sequential Circuits Unit 3

A/D and D/A conversion techniques – Basic concepts Unit 4

(D/A: R-2-R only A/D: successive approximation.
Logic families- TTL, ECL, MOS and CMOS - basic
concepts.

RESOURCES:

1. G.Nagrath, Analog Electronics, PHI

2. Analog Electronics, A.K. Maini, Khanna Publishing House
3. Microelectronics Engineering –Sedra & Smith-Oxford.
4. Principles of Electronic Devices & circuits—B L Thereja & Sedha—S Chand
5. Digital Electronics – Kharate – Oxford
6. Digital Electronics – Logic & Systems by J.Bigmell & R.Donovan; Cambridge Learning.
7. Digital Logic and State Machine Design (3rd Edition) – D.J.Comer, OUP
8. Electronic Devices & Circuit Theory – Boyelstad & Nashelsky - PHI
9. Bell-Linear IC & OP AMP—Oxford

Page: 40 / 123
 Maulana Abul Kalam Azad University of Technology
(Formerly West Bengal University of Technology)
Syllabus and Curricular Mapping for B. Tech. in Information Technology
Effective from Acdemic Session 2023-24

Course Title: Data Structure & Algorithm Code: PCC-CS301

Type of Course: Theory Course Designation: Compulsory
Semester: 3rd Contact Hours: 3L/week
Continuous Assessment: 25 Marks Final Exam: 70 Marks
Writer: Course Coordinator Approved by Program Assessment
Committee(PAC)

Pre-requisites: ES-CS 201 (Basic Computation and Principles of C), BS-M101 &BS-M201 (Mathematics), basics
of set theory

COURSE OBJECTIVE:
 To understand data structures and its utility
 To learn the implementation of data structure concepts in C programming
 To understand the importance of run time analysis
 To apply appropriate algorithm for proficiently solving a problem

COURSE OUTCOMES (COs)

On completion of the course students will be able to
Knowledge Level of
Course
CO statement revised Bloom’s
Outcomes
Taxonomy
Examine proposed algorithm and compare run time performance with Analyzing (Level IV)
PCC-CS301.CO1
suitable contemporary methods.
PCC-CS301.CO2 Explain a pseudo code using specific data structure. Understanding (Level II)
Analyzing (Level IV)
PCC-CS301.CO3 Compare and analyze the different sorting techniques.

PCC-CS301.CO4 Select most suitable method for a particular problem solving. Applying (Level III)
PCC-CS301.CO5 Recall the steps of an algorithm to calculate the intermediate result. Remembering (Level I)
Develop new methods by incorporating suitable data structure for
PCC-CS301.CO6 Creating (Level VI)
problem solving.

Mapping of COs with POs and PSOs (Course Articulation Matrix):

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 1 2 - - - - - - - - 2 - - -
CO2 3 3 2 - - - 2 - 3 2 - 1 2 - 3
CO3 3 2 2 - 3 - 1 - - 1 - - - 2 -
CO4 3 2 2 3 1 1 - - 3 - - - - 2 -
CO5 3 2 2 2 2 2 2 1 3 1 - - 2 3 1
CO6 3 3 3 2 2 2 - 1 3 - 2 - 3 - 1
AVG. 3.0 2.17 2.17 2.33 2.0 1.67 1.67 1.0 3.0 1.33 2.0 1.5 2.33 2.33 1.67

Page: 41 / 123
 Maulana Abul Kalam Azad University of Technology
(Formerly West Bengal University of Technology)
Syllabus and Curricular Mapping for B. Tech. in Information Technology
Effective from Acdemic Session 2023-24
University Syllabus :

Unit Content Hrs/Unit

1 Introduction: Basic Terminologies: Elementary Data Organizations, Data Structure Operations: 10
insertion, deletion, traversal etc.; Analysis of an Algorithm, Asymptotic Notations, Time-Space
trade off. Searching: Linear Search and Binary Search Technique sand their complexity
analysis.
2 Stacks and Queues: ADT Stack and its operations: Algorithms and their complexity analysis, 9
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: Singly linked lists: Representation in memory, Algorithms of several operations: 10
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: Objective and properties of different sorting algorithms: Selection Sort, 9
Bubble Sort, Insertion Sort, Quick Sort, Merge Sort, Heap Sort; Performance and Comparison
among all the methods, Hashing. Graph: BasicTerminologies and Representations, Graph search
and traversal algorithms and complexity analysis.

GATE syllabus (If applicable for GATE):

GATE syllabus content Mapping unit of university syllabus

Programming in C. Recursion. Arrays, Unit 1
Stacks, Queues Unit 2
Trees, binary search trees, binary heaps, graphs Unit 3

RESOURCES:

1. “DataStructuresAndProgramDesign In C”,2/E byRobertL. Kruse, BruceP. Leung.

2. “FundamentalsofDataStructuresofC”byEllisHorowitz,SartajSahni,SusanAnderson-freed.
3. “DataStructuresinC”byAaron M. Tenenbaum.
4. “DataStructures”byS. Lipschutz.
5. “DataStructuresUsingC”byReemaThareja.
6. “DataStructureUsingC”,2/ebyA.K.Rath,A.K. Jagadev.
7. “IntroductiontoAlgorithms”byThomasH.Cormen,CharlesE.Leiserson,RonaldL.Rivest,CliffordStein.

Course Title: Computer Organization Code: PCC-CS302

Type of Course: Theory Course Designation: Compulsory
Semester: 3rd Contact Hours: 3L/week
Continuous Assessment: 25 Marks Final Exam: 70 Marks
Writer: Course Coordinator Approved by Program Assessment
Committee(PAC)
Pre-requisites: ES-CS 201 Introduction to Computing, ES-EE 101 Basic Electronics Engineering.

COURSE OBJECTIVE:
 Explain the organization of basic computer, its design.
 Demonstrate the working of central processing unit and RISC and CISC Architecture.
 Understand the principles of combinational and sequential logic circuits to design basic components
 Illustrate addressing modes, instruction formats, instruction sets, instruction cycle, and instruction pipeline
with different hazards.

Page: 42 / 123
 Maulana Abul Kalam Azad University of Technology
(Formerly West Bengal University of Technology)
Syllabus and Curricular Mapping for B. Tech. in Information Technology
Effective from Acdemic Session 2023-24
 Compare the performance of different levels components in memory hierarchy with respect to average
memory access time.
 Illustrate I/O interface, different asynchronous I/O data transfer- strobe and handshaking, various modes of
I/O-programmed I/O, interrupt driven I/O, and DMA.

COURSE OUTCOMES (COs)

On completion of the course students will be able to
Course Outcomes CO statement Knowledge Level of
revised Bloom’s
Taxonomy
PCC-CS302.CO1 Explain the structural and functional organization of a Understanding (Level II)
computer system.
PCC-CS302.CO2 Discuss the integer and floating point number representations Analysing (Level IV)
and the operations applied on it.
PCC-CS302.CO3 Demonstrate different circuit designs using basic gates and Applying (Level III)
hardware architectures.
PCC-CS302.CO4 Define the addressing modes, instruction formats, and Remembering (Level I)
instruction pipeline.
PCC-CS302.CO5 Analyze various components of memory hierarchy in terms of Analysing (Level IV)
access time, cost.
PCC-CS302.CO6 Explain the concept of I/O interfacing and various taxonomy of Understanding (Level II)
I/O data transfer.

Mapping of COs with POs and PSOs (Course Articulation Matrix):

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 1 1 1 - - - - - - - 1 3 2 1
CO2 3 3 2 2 1 - - - - - - 1 3 2 1
CO3 3 2 3 2 1 - - - - - - 1 3 2 2
CO4 3 3 2 1 - - - - - - - 1 3 1 1
CO5 3 2 1 1 - - - - - - - 1 3 1 1
CO6 3 2 2 1 - - - - - - - 1 3 1 1
AVG. 3.00 2.17 1.83 1.33 1.00 0 0 0 0 0 0 1.00 3.00 1.50 1.17

University Syllabus:

Unit Content Hrs/Unit

1 Basic organization of the stored program computer and operation sequence for execution of a 8
program. Role of operating systems and compiler/assembler.
Fetch, decode and execute cycle, Concept of operator, operand, registers and storage, Instruction
format. Instruction sets and addressing modes. [7L]
Commonly used number systems. Fixed and floating point representation of numbers. [1L]
2 Overflow and underflow. 8
Design of adders - ripple carry and carry look ahead principles. [3L]
Design of ALU. [1L]
Fixed point multiplication -Booth's algorithm. [1L]
Fixed point division - Restoring and non-restoring algorithms. [2L]
Floating point - IEEE 754 standard. [1L]
3 Memory unit design with special emphasis on implementation of CPU-memory interfacing. [2L] 10
Memory organization, static and dynamic memory, memory hierarchy, associative memory. [3L]
Cache memory, Virtual memory. Data path design for read/write access. [5L]

Page: 43 / 123
 Maulana Abul Kalam Azad University of Technology
(Formerly West Bengal University of Technology)
Syllabus and Curricular Mapping for B. Tech. in Information Technology
Effective from Acdemic Session 2023-24
4 Design of control unit - hardwired and micro-programmed control. [3L] 10
Introduction to instruction pipelining. [2L]
Introduction to RISC architectures. RISC vs CISC architectures. [2L]
I/O operations - Concept of handshaking, Polled I/O, interrupt and DMA. [3L]

GATE syllabus (If applicable for GATE):

GATE syllabus content Mapping unit of university syllabus

Machine instructions and addressing modes Unit 1
ALU Unit 2
Memory hierarchy: cache, main memory and secondary Unit 3
storage;
Data-path and control unit. Instruction pipelining. I/O Unit 4
interface (interrupt and DMA mode)

RESOURCES:

1. Mano, M.M., “Computer System Architecture”, PHI.

2. Behrooz Parhami “ Computer Architecture”, Oxford University Press
3. Hayes J. P., “Computer Architecture & Organisation”, McGraw Hill,
4. Hamacher, “Computer Organisation”, McGraw Hill,
5. N. senthil Kumar, M. Saravanan, S. Jeevananthan, “Microprocessors and Microcontrollers” OUP
6. Chaudhuri P. Pal, “Computer Organisation & Design”, PHI,
7. P N Basu- “Computer Organization & Architecture” , Vikas Pub

Course Title: Mathematics-III Code: BSC 301

Type Of Course: Theory Course Designation: Compulsory
Semester: 3rd Contact Hours: 2L/week
Continuous Assessment: 25 Marks Final Exam: 70 Marks
Writer:Course Coordinator Approved by Program Assessment
Committee(PAC)
Pre-requisites: BS-M201 Mathematics-2.

COURSE OBJECTIVE:
 To know basic Concept of probability and distribution.
 To know the sampling distribution and maximum likelihood estimation of statistical parameters.
 To know testing of hypothesis for small samples.
 To know basic Concept of graph theory, graph coloring.
 To understand the basic algebraic structures and their elementary properties.

Page: 44 / 123
 Maulana Abul Kalam Azad University of Technology
(Formerly West Bengal University of Technology)
Syllabus and Curricular Mapping for B. Tech. in Information Technology
Effective from Acdemic Session 2023-24
COURSE OUTCOMES (COs)
On completion of the course students will be able to
Course Outcomes CO statement Knowledge Level of revised
Bloom’s Taxonomy
Demonstrate the concept of convergence of infinite series in Understanding (Level II)
BSC 301.CO1 many approximation techniques in engineering
disciplines.
Explainthe tools of power series and Fourier series to Evaluating (Level V)
BSC 301.CO2 analyze engineering problems and apply it to solve different
problems by expressing functions in suitable series form.
Apply the knowledge for addressing the real life problems Applying (Level III)
which comprises of several variables or
BSC 301.CO3
attributes and identify extremum points of different surfaces
of higher dimensions.
Demonstrate the knowledge of double and triple integral in Understanding (Level II)
different fields of Engineering to find area, volume and shape
BSC 301.CO4
of different objects and also to get some physical properties
like centre of gravity, moment of inertia, etc.
Solve and model many core engineering problems with Applying (Level III)
application of ODE of 1st order and higher order,
BSC 301.CO5
Simultaneous Linear Differential Equation, Improper Integral
and Laplace Transform.
Identify and solve different type of graphs and Applying (Level III)
BSC 301.CO6 Analyze/Model application of Graph Theory in Information
Science.

Mapping of COs with POs and PSOs (Course Articulation Matrix):

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 2 2 - - - - - - - - - 2 - 1
CO2 3 3 3 - - - - - - - 2 - 3 - 1
CO3 3 3 3 - - - - - - - 1 - 2 - 1
CO4 3 3 3 - - - - - - - 2 - 3 - -
CO5 3 3 2 - - - - - - - 1 - 2 - 1
CO6 3 2 2 - - - - - - - - - 3 - 1
AVG. 3.00 2.67 2.50 0 0 0 0 0 0 0 1.50 0 2.50 0 1.00

University Syllabus:

Unit Content Hrs/Unit

1 Convergence of sequence and series, tests for convergence, power series, Taylor’s series. Series for exponential, 8
trigonometric and logarithmic functions.
2 Limit, continuity and partial derivatives, Chain rule, Implicit function, Jacobian, Directional derivatives, Total 7
derivative; Maxima, minima and saddle points; Gradient, curl and divergence and related problems.
3 Double and triple integrals (Cartesian and polar), change of order of integration in double integrals, Change of 8
variables (Cartesian to polar). Theorems of Green, Gauss and Stokes (Statement only) and related problems
4 First Order Differential Equation, Exact, Linear and Bernoulli’s equations, Equations of first order but not of first 9
degree: equations solvable for p, equations solvable for y, equations solvable for x and Clairaut’s form, general &
singular solution. [5L] Second order linear differential equations with constant coefficients, D-operator method,
method of variation of parameters, Cauchy-Euler equation. [4L]
5 Basic Concept of graph, Walk, Path Circuit, Euler and Hamiltonian graph, diagraph. Matrix Representation: 8
Incidence & Adjacency matrix. Tree: Basic Concept of tree, Binary tree, Spanning Tree, KrusKal and Prim’s
algorithm for finding the minimal spanning tree.

Page: 45 / 123
 Maulana Abul Kalam Azad University of Technology
(Formerly West Bengal University of Technology)
Syllabus and Curricular Mapping for B. Tech. in Information Technology
Effective from Acdemic Session 2023-24
RESOURCES:

Text Books:
1. Banerjee A., De S.K. and Sen S.: Mathematical Probability, U.N. Dhur & Sons.
2. Gupta S. C and Kapoor V K: Fundamentals of Mathematical Statistics, Sultan Chand & Sons.
3. Mapa S.K. :Higher Algebra (Abstract & Linear), Sarat Book Distributors.
4. Sen M.K., Ghosh S. and Mukhopadhyay P.: Topics in Abstract Algebra, University Press.
5. West D.B.: Introduction to Graph Theory, Prentice Hall.
References:
1. Babu Ram: Discrete Mathematics, Pearson Education.
2. Balakrishnan: Graph Theory (Schaum’s Outline Series), TMH.
3. Chakraborty S.K and Sarkar B.K.: Discrete Mathematics, OUP.
4. Das N.G.: Statistical Methods, TMH.
5. Deo N: Graph Theory with Applications to Engineering and Computer Science, Prentice Hall.
6. Khanna V.K and Bhambri S.K. : A Course in Abstract Algebra, Vikas Publishing House.
7. Spiegel M R., Schiller J.J. and Srinivasan R.A. : Probability and Statistics (Schaum's Outline Series), TMH.
8. Wilson: Introduction to graph theory, Pearson Edication.

Course Title: Economics for Engineers (Humanities-II) Code: HSMC 301

Type Of Course: Theory Course Designation: Compulsory
Semester: 3rd Contact Hours: 3L/week
Continuous Assessment: 25 Marks Final Exam: 70 Marks
Writer: Course Coordinator Approved by Program Assessment
Committee(PAC)
Pre-requisites: N.A.
COURSE OBJECTIVES:
 Understanding the Decisionmakingprocess.
 Knowing about Inflation And Price Change.
 Calculating PresentWorthAnalysis, Return Analysis.
 Understanding Accounting.

COURSE OUTCOMES (COs)

On completion of the course students will be able to
Course CO statement Knowledge Level of
Outcomes revised Bloom’s
Taxonomy
Recall the concepts of Accounting and Recognize different systems Remembering (Level I)
HSMC 301.CO1 used in industrial applications.
Discuss on the design of appropriate accounting tool required for real Creating (Level VI)
HSMC 301.CO2
life problems.
HSMC 301.CO3 Demonstrate the use of Economical concepts. Understanding (Level II)
Analyze and Simulate a sequential accounting tool for a system or Analyzing (Level IV)
HSMC 301.CO4 process appropriate for required accuracy.
Design a sequential economic policy that can work according to the Creating (Level VI)
HSMC 301.CO5 required specifications.
Justify a specific accounting technique for a specific purpose. Evaluating (Level V)
HSMC 301.CO6

Page: 46 / 123
 Maulana Abul Kalam Azad University of Technology
(Formerly West Bengal University of Technology)
Syllabus and Curricular Mapping for B. Tech. in Information Technology
Effective from Acdemic Session 2023-24
Mapping of COs with POs and PSOs (Course Articulation Matrix):

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 - - - - - - - - - - - - - -
CO2 - 3 - - - - 1 - - - - - - - -
CO3 - - - - 3 - - - - - - - - - -
CO4 - - 3 - - - - - - - - - - - -
CO5 - - - - - - - - 1 - - - - - -
CO6 - - - - - - - - - - - - - - -
AVG. 3.00 3.00 3.00 0.00 3.00 0 1.00 0.00 1.00 0.00 0.00 0.00 0 0 0

University Syllabus:

Unit Content Hrs/Unit

1 1. Economic Decisions Making – Overview, Problems, Role, Decision making process. 9
2. Engineering Costs & Estimation – Fixed, Variable, Marginal & Average Costs, Sunk Costs,
Opportunity Costs, Recurring And Nonrecurring Costs, Incremental Costs, Cash Costs vs Book
Costs, Life-Cycle Costs; Types Of Estimate, Estimating Models - PerUnit Model, Segmenting
Model, Cost Indexes, Power-Sizing Model, Improvement & Learning Curve, Benefits.
2 3. Cash Flow, Interest and Equivalence: Cash Flow – Diagrams, Categories & Computation, 9
Time Value of Money, Debt repayment, Nominal& Effective Interest.
4. Cash Flow & Rate of Return Analysis – Calculations, Treatment of Salvage Value, Annual
Cash Flow Analysis, Analysis Periods; Internal Rate of Return, Calculating Rate of Return,
Incremental Analysis; Best Alternative Choosing an Analysis Method, Future Worth Analysis,
Benefit-Cost Ratio Analysis, Sensitivity and Breakeven Analysis. Economic Analysis In The
Public Sector -Quantifying And Valuing Benefits & drawbacks.
3 5. Inflation and Price Change – Definition, Effects, Causes, Price Change with Indexes, Types 9
of Index, Composite vs Commodity Indexes, Use of Price Indexes In Engineering Economic
Analysis, Cash Flows that inflate at different Rates.
6. Present Worth Analysis: End-Of-Year Convention, Viewpoint Of Economic Analysis
Studies, Borrowed Money Viewpoint, Effect Of Inflation & Deflation, Taxes, Economic
Criteria, Applying Present Worth Techniques, Multiple Alternatives.
7. Uncertainty In Future Events - Estimates and Their Use in Economic Analysis, Range Of
Estimates, Probability, Joint Probability Distributions, Expected Value, Economic Decision
Trees, Risk, Risk vs Return, Simulation, Real Options.
4 8. Depreciation - Basic Aspects, Deterioration & Obsolescence, Depreciation And Expenses, 9
Types Of Property, Depreciation Calculation Fundamentals, Depreciation And Capital
Allowance Methods, Straight-Line Depreciation Declining Balance Depreciation, Common
Elements Of Tax Regulations For Depreciation And Capital Allowances.
9. Replacement Analysis - Replacement Analysis Decision Map, Minimum Cost Life of a New
Asset, Marginal Cost, Minimum Cost Life Problems.
10. Accounting – Function, Balance Sheet, Income Statement, Financial Ratios Capital
Transactions, Cost Accounting, Direct and Indirect Costs, Indirect Cost Allocation.

RESOURCES:

1. JamesL.Riggs,DavidD.Bedworth,SabahU.Randhawa:EconomicsforEngineers4e,TataMcGraw-Hill
2. DonaldNewnan,TedEschembach,JeromeLavelle:EngineeringEconomicsAnalysis,OUP
3. JohnA.White,KennethE.Case,DavidB.Pratt:PrincipleofEngineeringEconomicAnalysis,JohnWiley
4. SullivanandWicks:EngineeringEconomy,Pearson
5. R.PaneerSeelvan:EngineeringEconomics,PHI
6. MichaelRLindeburg:EngineeringEconomicsAnalysis,ProfessionalPub

Page: 47 / 123
 Maulana Abul Kalam Azad University of Technology
(Formerly West Bengal University of Technology)
Syllabus and Curricular Mapping for B. Tech. in Information Technology
Effective from Acdemic Session 2023-24
SEMESTER-III
PRACTICAL

Course Title: Analog and Digital Electronics lab Code:ES-CS391

Type Of Course: Practical Course Designation: Compulsory
Semester: 3rd Contact Hours: 4P/week
Continuous Assessment: 40 Marks Final Exam: 60 Marks
Writer: Course Coordinator Approved by Program Assessment
committee (PAC)

Pre-requisites: Class XII Mathematics, Physics, Basic knowledge of Computer, Basic Electronics, Basic Electrical.
COURSE OBJECTIVE:
 Explain the principles of analog and digital systems.
 Compare the performance of the digital system over the analog system.
 Prepare analog as well as digital circuits.
 Creating a hardware module with some specific application.

COURSE OUTCOMES (COs)

On completion of the course students will be able to
Course Outcomes CO statement Knowledge Level of
revised Bloom’s
Taxonomy
ES-CS391.CO1 Demonstrate the concepts of circuits Understanding (Level II)

ES-CS391.CO2 Discuss between analog and digital system. Creating (Level VI)

ES-CS391.CO3 Develop the analog circuits to determine for a given outputs. Creating (Level VI)

ES-CS391.CO4 Explain the different model of analog and digital circuits. Evaluating (Level V)

ES-CS391.CO5 Analyze the outputs for given inputs for particular analog and Analysing (Level VI)
digital circuits.

ES-CS391.CO6 Explain the principle of different analog and digital circuits. Understanding (Level II)

Mapping of COs with POs and PSOs (Course Articulation Matrix):

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 3 1 1 - - - - - - 1 3 3 2
CO2 3 3 3 2 3 - - 2 - - - 2 3 1 3
CO3 3 3 3 2 3 - - 2 1 - - 2 3 2 3
CO4 3 3 3 2 3 - - 2 - - 1 2 3 3 3
CO5 3 3 3 2 3 - - 1 1 - 1 2 3 3 2
CO6 3 3 2 1 1 - - - 1 - - 1 3 3 1
AVG. 3.00 3.00 2.83 1.67 2.33 0 0 1.75 1.00 0 1.00 1.67 3.00 2.50 2.33

Page: 48 / 123
 Maulana Abul Kalam Azad University of Technology
(Formerly West Bengal University of Technology)
Syllabus and Curricular Mapping for B. Tech. in Information Technology
Effective from Acdemic Session 2023-24
University Syllabus:
Unit Content Hrs/Unit
ANALOG: At least any two of the following
1 DesignaClassAamplifier.-Analog 3
2 DesignaPhase-ShiftOscillator.-Analog 3
3 DesignofaSchmittTriggerusing555timer. –Analog 3

DIGITAL : At least any five of the following

4 DesignaFullAdderusingbasicgatesandverifyitsoutput/DesignaFullSubtractorcircuitusingbasicgatesandverifyits 3
output. - Digital
5 ConstructionofsimpleDecoder&Multiplexercircuitsusinglogicgates. - Digital 3
6 RealizationofRS /JK/Dflip flopsusinglogicgates. - Digital 3
7 DesignofShiftRegisterusingJ-K/DFlipFlop. - Digital 3
8 RealizationofSynchronousUp/Downcounter. - Digital 3
9 Design ofMOD-NCounter. - Digital 3
10 StudyofDAC- Digital 3

RESOURCES:

1. G.Nagrath, Analog Electronics, PHI

2. Analog Electronics, A.K. Maini, Khanna Publishing House
3. Microelectronics Engineering –Sedra & Smith-Oxford.
4. Principles of Electronic Devices & circuits—B L Thereja & Sedha—S Chand
5. Digital Electronics – Kharate – Oxford
6. Digital Electronics – Logic & Systems by J.Bigmell & R.Donovan; Cambridge Learning.
7. Digital Logic and State Machine Design (3rd Edition) – D.J.Comer, OUP
8. Electronic Devices & Circuit Theory – Boyelstad & Nashelsky - PHI
9. Bell-Linear IC & OP AMP—Oxford
10. P. Raja- Digital Electronics- Scitech Publications.
11. Morries Mano- Digital Logic Design- PHI.
12. R. P. Jain- Modern Digital Electronics, 2/e ,McGraw Hill.
13. H. Taub & D. Shilling, Digital Integrated Electronics- McGraw Hill.
14. D.Ray Chaudhuri- Digital Circuits-Vol-I & II, 2/e- Platinum Publishers.
15. Tocci, Widmer, Moss- Digital Systems,9/e- Pearson.

Course Title: Data Structure & Algorithm Code: PCC-CS391

Type of Course: Practical Course Designation: Compulsory
Semester: 3rd Contact Hours: 4P/week
Continuous Assessment: 40 Marks Final Exam: 60 Marks
Writer: Course Coordinator Approved by Program Assessment
Committee(PAC)
Pre-requisites: ES-CS 201 (Basic Computation and Principles of C)

COURSE OBJECTIVE:
 To understand data structures and its utility
 To understand roles of linear and nonlinear data patterns
 To implement data structure concepts in C programming
 To apply appropriate data structure in in different problem solving

Page: 49 / 123
 Maulana Abul Kalam Azad University of Technology
(Formerly West Bengal University of Technology)
Syllabus and Curricular Mapping for B. Tech. in Information Technology
Effective from Acdemic Session 2023-24
COURSE OUTCOMES (COs)
On completion of the course students will be able to
Knowledge Level of
Course
CO statement revised Bloom’s
Outcomes
Taxonomy
PCCCS391.CO1 Develop and test C programs to implement searching and sorting Creating (Level VI)

PCCCS391.CO2 Make use of appropriate two dimensional data structures for solving Applying (Level III)
a given problem
PCCCS391.CO3 Analyze various operations using stack and queue Analyzing (Level IV)
PCCCS391.CO4 Analyze problems to use the variants of linked list and solve real life Analyzing (Level IV)
problems
PCCCS391.CO5 Demonstrate the use of non-linear data structures for a given Understanding (Level II)
problem solving
PCCCS391.CO6 Select appropriate hash functions that result in a collision free Evaluating (Level V)
scenario for data storage and retrieval

Mapping of COs with POs and PSOs (Course Articulation Matrix):

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 1 1 - - - - - - - - 3 - - 3
CO2 3 1 1 1 - - - - 2 2 - 3 2 2 3
CO3 3 2 2 - - - 1 - - 1 - - 3 2 2
CO4 3 3 2 3 2 3 2 1 2 - - 3 3 3 2
CO5 3 - 2 3 - - 2 1 2 1 - 3 2 3 3
CO6 3 1 2 2 2 - - 1 2 - 2 - 2 3 3
AVG. 3.0 1.6 1.67 2.25 2.0 3.0 1.67 1.0 2.0 1.33 2.0 3.0 2.4 2.6 2.67

University Syllabus:

Unit Content
1 Linear Data Structure
1 Implementation of array operations
2 Stacks and Queues: adding, deleting elements Circular Queue: Adding & deleting elements
3 Merging Problem: Evaluation of expressions operations on Multiple stacks & queues:
4 Implementation of linked lists: inserting, deleting, inverting a linked list. Implementation of stacks &
queues using linked lists
5 Polynomial addition, Polynomial multiplication
2 Non Linear Data Structure
6 Recursive and Non-recursive traversal of Trees
7 Threaded binary tree traversal. AVL tree implementation
8 Application of Trees. Application of sorting and searching algorithms
9 Hash tables implementation: searching, inserting and deleting, searching & sorting techniques.

RESOURCES:

1. “DataStructuresAndProgramDesign In C”,2/E byRobertL. Kruse, BruceP. Leung.

2. “FundamentalsofDataStructuresofC”byEllisHorowitz,SartajSahni,SusanAnderson-freed.
3. “DataStructuresinC”byAaron M. Tenenbaum.
4. “DataStructures”byS. Lipschutz.
5. “DataStructuresUsingC”byReemaThareja.

Page: 50 / 123
 Maulana Abul Kalam Azad University of Technology
(Formerly West Bengal University of Technology)
Syllabus and Curricular Mapping for B. Tech. in Information Technology
Effective from Acdemic Session 2023-24
6. “DataStructureUsingC”,2/ebyA.K.Rath,A.K. Jagadev.
7. “IntroductiontoAlgorithms”byThomasH.Cormen,CharlesE.Leiserson,RonaldL.Rivest,CliffordStein.

Course Title: Computer Organization Lab Code: PCC-CS392

Type of Course: Practical Course Designation: Compulsory
Semester: 3rd Contact Hours: 4P/week
Continuous Assessment: 40 Marks Final Exam: 60 Marks
Writer: Course Coordinator Approved by Program Assessment
Committee(PAC)
Pre-requisites: EC 191 Basic Electronics Engineering and PCC-CS302 Computer Organization

COURSE OBJECTIVE:
 Analyze the behavior of various logic gates.
 Design the combinational circuits for basic components of computer system and applications.
 Analyze the operational behavior and applications of various flip-flops.
 Design Arithmetic logic units and different types of memory blocks.

COURSE OUTCOMES (COs)

On completion of the course students will be able to

Course CO statement Knowledge Level of

Outcomes revised Bloom’s
Taxonomy
CS393.CO1 Demonstrate the behaviour of various integrated chips (IC): multiplexer, Understanding (Level II)
decoder, encoder, comparator and verify corresponding truth tables.
CS393.CO2 Design of an adder/subtractor composite unit. Creating (Level VI)

CS393.CO3 Develop the design of a BCD adder. Applying (Level III)

CS393.CO4 Construct the design of a carry-look ahead-adder. Applying (Level III)
CS393.CO5 Experiment with an arithmetic and logic units using multiplexer unit for Applying (Level III)
single bit and multi bit arithmetic operations.
CS393.CO6 Examine read write operation using RAM IC and cascade two RAM ICs Analying (Level IV)
for vertical and horizontal expansion.

Mapping of COs with POs and PSOs (Course Articulation Matrix):

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 2 1 1 1 - - - 2 - - 1 3 1 -
CO2 3 3 2 1 1 - - 1 2 - - 2 3 1 -
CO3 3 3 2 1 1 - - 1 2 - - 2 3 1 -
CO4 3 3 2 1 1 - - 1 2 - 1 2 3 1 -
CO5 3 3 2 2 1 - - 1 2 - 1 2 3 2 -
CO6 3 3 2 2 1 - - 1 2 - - 1 3 2 -
AVG. 3.00 2.83 1.83 1.33 1.00 0 0 1.00 2.00 0 1.00 1.67 3.00 1.33 0

Page: 51 / 123
 Maulana Abul Kalam Azad University of Technology
(Formerly West Bengal University of Technology)
Syllabus and Curricular Mapping for B. Tech. in Information Technology
Effective from Acdemic Session 2023-24
University Syllabus

Unit Content
1. FamiliaritywithIC-chips,e.g.
a)Multiplexer,
b)Decoder,
c)Encoder
b) ComparatorTruthTableverificationandclarificationfromData-book.
2. DesignanAdder/Subtractorcompositeunit.
3. DesignaBCDadder.
4 Designofa‘Carry-Look-Ahead’Addercircuit.
5. Useamultiplexerunittodesign acompositeALU.
6 UseALUchipformultibitarithmeticoperation.
7. ImplementreadwriteoperationusingRAMIC
8. (a)&(b)CascadetwoRAMICsforverticalandhorizontalexpansion.

RESOURCES:
1. Mano, M.M., “Computer System Architecture”, PHI.
2. Chaudhuri P. Pal, “Computer Organisation & Design”, PHI,
3. P N Basu- “Computer Organization & Architecture” , Vikas Pub

Course Title: IT Workshop Code:PCC-CS393

Type Of Course: Practical Course Designation: Compulsory
Semester: 3rd Contact Hours: 4P/week
Continuous Assessment: 40 Marks Final Exam: 60 Marks
Writer: Course Coordinator Approved by Program Assessment
committee (PAC)

Pre-requisites: Knowledge of Programming Logic, Experience with a high level language (C/C++,) is suggested.
Prior knowledge of a scripting language and Object-Oriented concepts is helpful but not mandatory.

COURSE OBJECTIVE:
 To master an understanding of scripting & the contributions of scripting languages
 Design real life problems and think creatively about solutions
 Apply a solution in a program using R/Matlab/Python.
 To be exposed to advanced applications of mathematics, engineering and natural sciences to program real life
problems.

Page: 52 / 123
 Maulana Abul Kalam Azad University of Technology
(Formerly West Bengal University of Technology)
Syllabus and Curricular Mapping for B. Tech. in Information Technology
Effective from Acdemic Session 2023-24
COURSE OUTCOMES (COs)
On completion of the course students will be able to
Course Outcomes CO statement Knowledge Level of
revised Bloom’s
Taxonomy
Interpret the basic syntax of python variables, datatype and Understanding (Level II)
PCC-CS393.CO1
operator in python
PCC-CS393.CO2 Write, test and debug python programs Creating (Level VI)

Implement use of conditionals and loops statement in python Applying (Level III)
PCC-CS393.CO3
programs.
Use functions and represent Compound data using Lists, Applying (Level III)
PCC-CS393.CO4
Tuples and Dictionaries
Definethe use of string and list datatype in proficiency level. Evaluating (Level V)
PCC-CS393.CO5

Articulatethe concepts of object oriented programming like Applying(Level III)

PCC-CS393.CO6
exception handling.

Mapping of COs with POs and PSOs (Course Articulation Matrix):

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 3 2 2 - - - - - - 1 3 3 2
CO2 3 3 3 2 2 - - 1 - - - 2 3 1 3
CO3 3 3 3 2 2 - - 1 1 - - 2 3 2 3
CO4 3 3 3 2 2 - - 1 - - 1 2 3 3 3
CO5 3 3 3 2 2 - - 1 1 - 1 2 3 3 2
CO6 3 3 2 2 2 - - - 1 - - 1 3 3 1
AVG. 3.00 3.00 2.83 2.00 2.00 0 0 1.00 1.00 0 1.00 1.67 3.00 2.50 2.33

University Syllabus:
Programming with Python

Unit Content
1 Introduction History, Features, Setting up path, Working with Python, Basic Syntax, Variable and Data
Types, Operator
2 Conditional Statements If, If- else, Nested if-else, Looping, For, While, Nested loops
3 Control Statements Break, Continue, Pass
4 String Manipulation Accessing Strings, Basic Operations, String slices, Function and Methods
5 Lists Introduction, Accessing list, Operations, Working with lists, Function and Methods
6 Tuple Introduction, Accessing tuples, Operations, Working, Functions and Methods
7 Dictionaries Introduction, Accessing values in dictionaries, Working with dictionaries, Properties
8 Functions Defining a function, Calling a function, Types of functions, Function Arguments, Anonymous
functions, Global and local variables
9 Modules Importing module, Math module, Random module, Packages, Composition, Input-Output Printing
on screen, Reading data from keyboard, Opening and closing file, Reading and writing files, Functions
10 Exception Handling Exception, Exception Handling, Except clause, Try? finally clause, User Defined
Exceptions.

Page: 53 / 123