nd rd

B. Tech. (CSE) 2 Year/ 3 Semester Course Structure and Syllabus for 2019 -20

3rd SEM
THEORY
SL. PAPER CODE PAPER NAME L T P CONTACT CREDIT
NO. HRS./WEEK

01 BS(CS/IT)307 Mathematics- 3 0 0 3 3
III
02 ES(CS/IT)307 Digital 3 0 0 3 3
Electronics
03 PC(CS/IT)301 Computer 3 0 0 3 3
Organization
04 PC(CS/IT)302 Data structure 3 0 0 3 3
&
Algorithms
05 HS(CS/IT)303 Economics for 3 0 0 3 3
Engineers
Sessional
01 ESL(CS/IT)308 Digital 0 0 3 3 1.5
Electronics Lab
02 PCL(CS/IT)303 Computer 0 1 3 4 2
Organization
Lab
03 PCL(CS/IT)304 Data structure 0 1 3 4 2
&
Algorithms Lab
04 PCL(CS/IT)305 IT Workshop 0 1 3 4 2
(python/matlab)
SESSIONAL
01 CLA(CS)-3 Comprehensive 0 0 0 0 1
Laboratory
Assessment
TOTAL 15 3 12 30 23.5
 nd rd
B. Tech. (CSE) 2 Year/ 3 Semester Course Structure and Syllabus for 2019 -20

Mathematics-III
Paper Code: BS(CS/IT)307
Contacts: 40L
Credit: 3

Module 1:Sequences and series [8L]

Convergence of sequence and series, tests for convergence, power series, Taylor’s series. Series for
exponential, trigonometric and logarithmic functions.

Module 2:Multivariable Calculus (Differentiation) [7L]

Limit, continuity and partial derivatives, Chain rule, Implicit function, Jacobian, Directional
derivatives, Total derivative; Maxima, minima and saddle points; Gradient, curl and divergence and
related problems.

Module 3: Multivariable Calculus (Integration) [8L]

Double and triple integrals (Cartesian and polar), change of order of integration in double integrals,
Change of variables (Cartesian to polar).Theorems of Green, Gauss and Stokes (Statement only) and
related problems.

Module 4: Ordinary Differential Equation [9L]

First Order Differential Equation, Exact, Linear and Bernoulli’s equations, Equations of first order but
not of first degree: equations solvable for p, equations solvable for y, equations solvable for x and
Clairaut’s form, general & singular solution.
Second order linear differential equations with constant coefficients, D-operator method, method of
variation of parameters, Cauchy-Euler equation.

Module 5: Graph Theory [8L]

Basic Concept of graph, Walk, Path Circuit, Euler and Hamiltonian graph, diagraph.
Matrix Representation: Incidence & Adjacency matrix.
Tree: Basic Concept of tree, Binary tree, Spanning Tree, KrusKal and Prim’s algorithm for finding the
minimal spanning tree.

Learning Resources:

1. Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley & Sons.

2. Michael Greenberg, Advanced Engineering Mathematics, Pearson.
3. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers.
4. NarsinghDeo, Graph Theory with Applications to Engineering and Computer Science.
5. Derek Holton & John Clark, A First Look at Graph Theory
6. Veerarajan T., Engineering Mathematics for first year, Tata McGraw-Hill, New Delhi.
7. E. L. Ince, Ordinary Differential Equations, Dover Publications.
 nd rd
B. Tech. (CSE) 2 Year/ 3 Semester Course Structure and Syllabus for 2019 -20

Course Outcomes

After completing the course the student will be able to

CO 1: use the tools of power series to analyze engineering problems and apply the concept of
convergence of infinite series in many approximation techniques in engineering disciplines.

CO 2: apply the knowledge for addressing the real life problems which comprises of several variables
or attributes and identify extremum points in different surfaces of higher dimensions.

CO 3: evaluate multiple integrals and apply the techniques to different physical problems.

CO 4: solve first and second order ordinary differential equations by applying different techniques
and also will be able to formulate differential equations for model systems and problems of
engineering sciences.

CO 5: apply the basic concepts of graph theory to network analysis, data analytics and many other
branches of computer science.

Digital Electronics
Code: ES(CS/IT)307
Contacts: 36L
Credit: 3

Module 1: Basic Electronic devices [8L]

PN junction diode, Application of diodes in rectification, Half wave Full wave rectifier and Factors
determining rectifier performance , Transistor, Transistor characteristics for CE, CB and CC mode,
current amplification factors and their relationship, Introduction to JFET, MOSFET and CMOS.

Module 2: Number system, Boolean algebra & logic gates [10L]

Binary numbers & Boolean algebra , Logic gates, Truth Tables and function minimization using
algebraic method, Karnaugh map, , Signed binary number representation with 1’s and 2’s complement
methods, Maxterm, Minterm, Representation in SOP and POS forms ; Realization of Boolean
functions using NAND/NOR gates

Module 3: Combinational circuits [10L]

Adder and Subtractor circuits (half & full adder & subtractor); Encoder, Decoder, Comparator,
Multiplexer, De-Multiplexer, Parity Generator and checker.

Module 4: Sequential Circuits [8L]

Flip-flops - SR, JK, Master slave JK, D and T. Register, counter

 nd rd
B. Tech. (CSE) 2 Year/ 3 Semester Course Structure and Syllabus for 2019 -20

References:

1. Morries Mano, Digital Logic Design, PHI

2. Kharate, Digital Electronics, Oxford
3. Leach & Malvino, Digital Principles & Application,Mc Graw Hill
4. D chattopadhyay & P.C.Rakshit. Electronics (Fundamentals and Applications), New Age
International Publishers
5. Malvino, Electronic Principle, McGraw Hill.
6. Millman & Halkias, Integrated Electronics, McGraw Hill
7. Boyelstad & Nashelsky, Electronic Devices & Circuit Theory,PHI
8. R.P.Jain, Modern Digital Electronics, McGraw Hill

Course Outcomes

After completing the course the student will be able to

CO 1: identify and understand the difference between analog and digital electronic systems.

CO 2: explain the operation of semiconductor devices from their characteristic curves.

CO 3: represent numbers in various number systems and successfully execute conversions between
different representations.

CO 4: implement various logical operations using combinational logic circuits.

CO 5: design various sequential circuits.

Computer Organization
Code: PC(CS/IT)301
Contacts: 40L
Credits: 3

Module 1: Introduction [3 L]

History of computing, von Neumann machine, Instruction and data, fixed-point and floating point
numbers, errors, IEEE standards

Module 2: Processor design [7 L]

Instruction Set Architecture-Instruction format, opcode optimization; operand addressing; Instruction

implementation-data movement, branch control, logical, Input/output and debugging instructions;
arithmetic instruction implementation–addition and subtraction, multiplication-division, 2’s
complement multiplication; Booth’s algorithm–theory and examples; bit-pair algorithm; high
performance arithmetic

Module 3: Control unit design [ 8 L]

Hardwired control, micro-programmed control design – micro-instruction formats, control

optimization;
 nd rd
B. Tech. (CSE) 2 Year/ 3 Semester Course Structure and Syllabus for 2019 -20

Module 4: Memory subsystem [9 L]

Registers, Memory technology, memory interfacing, Memory hierarchy–introduction to virtual

memory system; cache memory – performance, address mapping, content addressable memory
(CAM)

Module 5: Peripherals [7 L]

Basic properties, bus architectures, interfacing of I/O devices, data transfer schemes –programmed
I/O, DMA, mass storage, RAID

Module 6: Pipelining [6 L]

Pipelining, data path and instructions, speed up, CPI, latency; linear / non-linear pipeline–reservation
table, MAL; super-pipelined and super-scalar processors.

Text Book:

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

2. Behrooz Parhami“ Computer Architecture”, Oxford University Press

Reference Book:

1. Hayes J. P., Computer Architecture & Organisation, McGraw Hill,

2. Hamacher, Computer Organisation, McGraw Hill,
3. N. Senthil Kumar, M. Saravanan, S. Jeevananthan, Microprocessors and Microcontrollers
OUP
4. Chaudhuri P. Pal, Computer Organisation & Design, PHI,
5. P N Basu- Computer Organization & Architecture ,Vikas Pub

Course Outcomes

After completing the course the student will be able to

CO 1: represent numbers in fixed-point and floating-point systems.

CO 2: clearly visualize machine's instruction set architecture (ISA) including basic instruction fetch
and execute cycles, instruction formats, control flow, and operand addressing modes.

CO 3: explain the design and functioning of a machines central processing unit (CPU), the data path
components (ALU, register file) and the control unit.

CO 4: explain organization of memory hierarchies including the basics of cache design and
performance of caches. Apply these ideas to solve numerical problems.

CO 5: explain basic input/output functioning including program controlled I/O and interrupt I/O.

CO 6: analyze processor performance improvement using instruction level parallelism.

 nd rd
B. Tech. (CSE) 2 Year/ 3 Semester Course Structure and Syllabus for 2019 -20

Data Structure and Algorithm

Code: PC(CS/IT)302
Contacts: 38L
Credits: 3

Module 1: Introduction [10L]

Elementary Data Organizations, Data Structure Operations: insertion, deletion and traversal in arrays,
asymptotic Notations, Time-Space trade off, recursion, tail recursion, Tower of Hanoi, recursion tree
and master theorem method of complexity analysis, Linear Search and Binary Search Techniques and
their complexity analysis, finding min max in O(3n/2) time.

Module 2: Stacks and Queues [6L]

ADT Stack and its operations: Algorithms and their complexity analysis, Applications of Stacks:
Expression Conversion and evaluation – corresponding algorithms and complexity analysis. ADT
queue and types of Queue: Simple Queue, Circular Queue, Operations on each type of Queue:
Algorithms and their analysis.

Module 3: Linked List [6L]

Singly linked lists, Representation in memory, Algorithms of several operations: Traversing,

Searching, Insertion into, Deletion from linked list. Linked List representation of Stack and Queue.
Doubly linked list: operations, space and time analysis. Circular Linked Lists: all operations and
complexity analysis. Floyd-Cycle finding algorithm. [6L]

Module 4: Trees [10L]

Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded Binary Tree, Binary
Search Tree, AVL Tree, binary heap, b-tree; operations on each of the trees and their algorithms with
complexity analysis. Tree traversal algorithms: recursive and iterative. Catalan Number and its
connection to binary trees and stack sortable permutations. Comparison of performance of Heap, array
and insertion priority queues.

Module 5: Hashing [6L]

Hashing: Chaining, probing, Universal hashing function and analysis of various hashing methods.

Text Books:

1. Horowitz, Sahni, Anderson-Freed: Fundamentals of Data Structures in C (Second Edition),

Universities Press, 2008.
2. T.H. Cormen, C.E. Leiserson, R. Rivest and C. Stein: Introduction to
Algorithms,(Second/Third Edition), PHI, 2009.
3. R. Sedgewick: Algorithms in C, Pearson, 2004.
4. Steven S Skiena, Algorithm design manual, 2nd Edition, Springer.

Reference Book:
1. Steven S Skiena, Miguel A. Revilla, Programming Challenges: The Programming Contest
Training Manual (Texts in Computer Science) Springer.
 nd rd
B. Tech. (CSE) 2 Year/ 3 Semester Course Structure and Syllabus for 2019 -20

Course outcomes

After completing the course the student will be able to

CO 1: analyze the algorithm to determine the time and computation complexity.

CO 2: decide based on nature of the search problem which search technique (Linear Search, Binary
Search, hashing) to use when.

CO 3: implement the Stacks, Queues and linked list data structure and apply the same to various
problems

CO 4: apply non linear data structures in searching, insertion and retrieval of data. Analyze the time
complexity of various balanced and unbalanced trees and to apply the data structure to relevant
problems.

Economics for Engineers

Code: HS(CS/IT)303
Contacts: 30L
Credits: 3

Module 1: [6L]

Economic Decision Making – Overview, Role of Engineers in Economic Decision making, Problem
in Economic Decision Making, Decision Making Process.

Engineering Costs & Estimation – Fixed, Variable, Marginal & Average Costs, Step Cost, Product
and Period Cost, Direct and Indirect Cost, , Sunk Costs, Shutdown Cost, Opportunity Costs,
Recurring and Nonrecurring Costs, Incremental Costs, Cash Costs vs. Book Costs, Life-Cycle Costs;
Types Of Estimate, Estimating Models - Per Unit Model, Segmenting Model, Cost Indexes, Power-
Sizing Model, Learning Curve Model, Benefits and difficulties in estimation.

Module 2: [12L]

Cash Flow, Interest and Equivalence: Cash Flow – Diagrams and Cash Flow Statement, Time Value
of Money, Real, Nominal & Effective Interest, Different Interest Formulae.

Cash Flow & Rate Of Return Analysis – Net Present Worth Analysis, Annual Worth Analysis,
Internal Rate Of Return, Future Worth Analysis, Benefit-Cost Ratio Analysis, Sensitivity And
Breakeven Analysis.

Module 3: [6L]

Inflation And Price Change – Definition, Effects, Causes, Price Change with Indexes, Types of
Index, Use of Price Indexes In Engineering Economic Analysis.

Uncertainty In Future Events - Risk, Risk vs. Return, Probability, Expected Value and Variance,
Economic Decision Trees, Simulation.
 nd rd
B. Tech. (CSE) 2 Year/ 3 Semester Course Structure and Syllabus for 2019 -20

Module 4: [6L]

Depreciation and Replacement Analysis - Basic Aspects, Deterioration & Obsolescence, Depreciation
Calculation Fundamentals, Depreciation and Capital Allowance Methods, Replacement Analysis
Decision Map, Minimum Cost Life of a New Asset.

Accounting – Function, Balance Sheet, Income Statement, Financial Ratios, Role and Functions of a
Financial Manager.

Readings:

1. H.L. Bhatia & S.N. Maheswari: Economics for Engineers, Vikas Publishing House Pvt. Ltd.
2. R. Paneer Seelvan: Engineering Economics, PHI.
3. James L. Riggs, David D. Bedworth, Sabah U. Randhawa : Economics for Engineers 4e , Tata
McGraw-Hill
4. Donald Newnan, Ted Eschembach, Jerome Lavelle : Engineering Economics Analysis, OUP
5. Sullivan and Wicks: Engineering Economy, Pearson.
6. Partha Chatterjee: Economics for Engineers, Vrinda Publications.

Course Outcome

After completing the course the student will be able to

CO 1: explain the role and scope of Engineering Economics and apply the process of economic
decision making.

CO 2: analyze the different concepts of cost and apply different cost estimation techniques.

CO 3: explain the concepts of cash flow, time value of money and different interest formulas and
create cash flow diagrams for different situations and apply different interest formulae to solve
associated problems.

CO 4: apply various analytical methods like net present worth analysis, internal rate of return
analysis, future worth analysis, benefit –cost ratio analysis, break-even analysis , sensitivity analysis
etc. to evaluate different engineering projects.

CO 5: explain the process of inflation and apply different price indices to quantify the effects of
inflation.

CO 6: state and explain the concepts of risk, return and uncertainty and incorporate the effect of
uncertainty in economic analysis by using various concepts like probability, expected value, variance,
decision trees and simulation.

CO 7: explain the concepts of depreciation and replacement analysis and solve associated problems of
depreciation.

CO 8: interpret and apply the various concepts of Accounting like balance sheet, income statement
and financial ratio analysis and understand the role and functions of a Financial Manager
 nd rd
B. Tech. (CSE) 2 Year/ 3 Semester Course Structure and Syllabus for 2019 -20

Digital Electronics Lab.

Code: ES(CS/IT)308
Contacts: 3P
Credit: 1.5

Group 1: Experiments on Analog Electronics

1. I-V characteristics of semiconductor diode.

2. Input and output characteristics of BJT in CE configuration

3. Output and transfer characteristics of JFET in CS configuration.

Group 2: Experiments on Digital Electronics
1. Logic function realization using logic gates.

2. Design and implementation of half adder and full adder

3. Design and implementation of parity generator and checker

4. Construction of simple Decoder & Multiplexer circuits.

5. Realization of RS / JK / D flip flops using logic gates.

Computer Organization Lab.

Code: PCL(CS/IT)303
Contacts: 3P + 1T
Credits: 2

1. Familiarity with IC-chips, e.g. a) Multiplexer , b) Decoder, c) Encoder b) Comparator Truth

Table verification and clarification from Data-book.

2. Incremental circuit.

3. Design an Adder/ Subtractor composite unit .

4. Design a BCD adder.

5. Design of a ‘Carry-Look-Ahead’ Adder circuit.

6. Use a multiplexer unit to design a composite ALU .

7. Design counter circuit.

8. Implement read write operation using RAM IC.

9. (a) & (b) Cascade two RAM ICs for vertical and horizontal expansion.
 nd rd
B. Tech. (CSE) 2 Year/ 3 Semester Course Structure and Syllabus for 2019 -20

Data Structure & Algorithm Lab

Code: PCL(CS/IT)304
Contacts: 3P + 1T
Credits: 2

1. Application of array insertion, deletion and traversal operations in solving problems.

2. Linear Search, Binary Search Techniques and time complexity comparison.

3. Application of binary search like divide and conquer technique in various array related O (log
n) problems.

4. Implementation and applications of Stacks and queues using arrays.

5. Implementation of Singly linked lists, Linked representation of Stack and Queue.

6. Implementation of Binary Search Tree.

7. Application of binary trees in solving various problems.

8. Array implementation of binary heap.

9. Comparison of performance of binary Heap and array as priority queues.

10. Implementation of B-Tree.

11. Implementation of Chaining and probing techniques of collision resolution in hashing.

Application of hashing in appropriate problems.

IT Workshop
Code: PCL(CS/IT)305
Contacts: 3P + 1T
Credits: 2

1. Python Introduction

2. NumPy Introduction

3. Numpy Arrays & Numerical Operations on Numpy Arrays

4. Python, Numpy and Probability

5. Weighted Choices and Weighted Samples

6. Creation of Synthetic Test Data

 nd rd
B. Tech. (CSE) 2 Year/ 3 Semester Course Structure and Syllabus for 2019 -20

7. Matrix Arithmetic

8. Reading and Writing ndarrays

9. Matplotlib Introduction

10. Histograms

11. Contour Plots

12. Pandas Introduction

13. Pandas DataFrames & Data Files

14. Data Visualization with Pandas and Python

15. Python, Pandas and Timeseries

Study Material:

https://www.python-course.eu/numerical_programming_with_python.php

Course Outcome

After completing the course the student will be able to

CO 1: do numerical computations efficiently.

CO 2: exploit the parallelism in vector operations to implement mathematical calculations.

CO 3: generate synthetic test data.

CO 4: employ matrix parallelism to solve algebraic problems.

CO 5: plot graphs of functions with appropriate representation

CO 6: implement various data visualization techniques.