THIRD SEMESTER

Sl. No Sub. Code Subject L-T-S Credits Hours

1 MAC331 Mathematics - III 3-1-0 4 4

2 CSC301 Discrete Mathematics 3-0-0 3 3

3 CSC302 Digital Logic Design 3-0-0 3 3

4 CSC303 Data Structures and Algorithms 3-1-0 4 4

5 PHC331 Physics of Semiconductor Devices 3-0-0 3 3

6 PHS381 Semiconductor Devices Laboratory 0-0-3 1.5 3

7 CSS351 Digital Logic Design Laboratory 0-0-3 1.5 3

8 CSS352 Data Structures and Algorithms Laboratory 0-0-4 2 4

9 XXS381 Co-curricular Activities - III (Optional) 0-0-0 0 0

TOTAL 15-2-10 22 27
CSC 301 Discrete Mathematics 3-0-0 3Credits 3Hours

Department of Computer Science and Engineering

Course Title of the course Program Core Total Number of contact hours Credit
Code (PCR) / Lecture Tutorial Practical Total
Electives (PEL) (L) (T) (P) Hours
CSC 301 Discrete PCR 3 0 0 3 3
Mathematics
Pre-requisites Course Assessment methods (Continuous Assessment (CA), Mid-Term
(MT), End Term (ET))
CA+ MT + ET [CA: 15%, MT: 25%, ET: 60%]
Course ● CO1: Remember the basic terms, definitions and concepts of mathematics.
Outcomes ● CO2: Students will be able to understand the key concepts of discrete mathematics
such as functional mapping, mathematical logic, counting principles, generating
functions, algebraic structures and graph theory.
● CO3: Students will be able to apply the learned concepts to solve various problems.
● CO4: Students will be able to differentiate or relate the various ideas with respect to
problems.
● CO5:Students will be able to judge the formulas and ideas to be applicable to a
problem.
Topics Set Theory: Definition of Sets, Venn Diagrams, complements, cartesian products, power
Covered sets, counting principle, cardinality and countability (Countable and Uncountable sets),
proofs of some general identities on sets, pigeonhole principle. (3L)

Relation: Definition, types of relation (reflexive, symmetric, transitive, antisymmetric,

Equivalence, partial ordering relations), composition of relations, domain and range of a
relation, pictorial representation of relation, properties of relation, Partial Order, Lattice,
Hasse Diagram. (6L)

Function: Definition and types of function, composition of functions, recursively defined

functions, Surjection, Injection, Bijection, Composition of Function, Asymptotic notations:
big-Oh, Theta, big-Omega. (4L)

Propositional logic: Proposition logic, basic logic, logical connectives, truth tables,
tautologies, contradiction, normal forms (conjunctive and disjunctive), modus ponens and
modus tollens, validity, predicate logic, universal and existential quantification. Notion of
proof: proof by implication, converse, inverse, contrapositive, negation, and contradiction,
direct proof, proof by using truth table, Proof by Well ordering principle. (6L)

Combinatorics: Mathematical induction, recursive mathematical definitions, basics of

counting, permutations, combinations, inclusion-exclusion, recurrence relations (nth order
recurrence relation with constant coefficients, Homogeneous recurrence relations),
generating function (closed form expression, properties of G.F., solution of recurrence
relation using G.F, solution of combinatorial problem using G.F.). (8L)

Algebraic Structure: Binary composition and its properties definition of algebraic

structure; Semi group, Monoid, Groups, Abelian Group, properties of groups, Permutation
Groups, Sub Group, Cyclic Group. (6L)
 Graphs: Graph terminology, types of graph, connected graphs, components of graph, Euler
graph, Hamiltonian path and circuits, Degree Sequence, Radius, Diameter, Center of a
graph, Graph coloring, Chromatic number. Planarity of a graph: K(3,3) and K(5). Clique,
Independent set, bipartite graph, Tree: Definition, types of tree (rooted, binary), properties
of trees. (9L)
Text Books, Text Books:
and/or 1. C. L. Liu, Elements of Discrete Mathematics, Tata McGraw Hill.
reference 2. Norman L. Biggs, Discrete Mathematics, Oxford.
material 3. Douglas B. West, Introduction to Graph Theory, Prentice Hall, India.

Reference Books:
1. Ronald L. Graham, Donald E. Knuth and O. Patashnik, Concrete Mathematics,
Pearson Education.
CSC302 Digital Logic Design 3-0-0 3Credits 3Hours

Department of Computer Science and Engineering

Course Title of the course Program Core Total Number of contact hours Credit
Code (PCR) / Lecture Tutorial Practical Total
Electives (PEL) (L) (T) (P) Hours
CSC 302 Digital Logic PCR 3 0 0 3 3
Design
Pre-requisites: Course Assessment methods (Continuous Assessment (CA), Mid-Term
(MT), End Term (ET))
CA+ MT + ET [CA: 15%, MT: 25%, ET: 60%]
Course At the completion of this course students will be able to:
Outcomes ● CO1: Realize the various logic gates and and laws of Boolean algebra. Analyse
different types of digital electronic circuit using various mapping and logical tools.
● CO2: Design and analyses the various combinational circuits.
● CO3: Design and analyses the various sequential circuits.
● CO4: Design and analyse combinational and sequential logic circuits through HDL
models.
● CO5: Synthesis the various logic using ASM charts.
Topics UNIT-I: Switching Circuits, Various number system and their conversions: Arithmetic of
Covered these number systems, Complements, Data Representation: Binary numbers, binary codes, fixed
point representation, floating point representation, Code and their conversions, Addition and
Subtraction on Codes, Error Detection codes (Hamming code etc), representation of signed
binary number in Fixed and Floating Points. (5L)

UNIT-II: Boolean algebra, logic gates, and switching functions, truth tables and switching
expressions, minimization of completely and incompletely specified switching functions,
Karnaugh map and Quine-McCluskey method, multiple output minimization, representation
and manipulation of functions using BDDs, two-level and multi-level logic circuit synthesis.
(10L)
UNIT-III: Combinational logic circuits: Realization of Boolean functions using NAND/NOR
Gates, Decoders, multiplexers. Logic design using ROMs, PLAs and FPGAs. Case Studies.
(8L)

UNIT-IV: Sequential circuits: Clocks, flip-flops, latches, counters and shift registers, finite-
state machine model, synthesis of synchronous sequential circuits, minimization and state
assignment, asynchronous sequential circuit synthesis. (12L)

UNIT-V: ASM charts: Representation of sequential circuits using ASM charts, synthesis of
output and next state functions, data path control path partition-based Design. (7L)

Text Books, Text Books:

and/or 1. Digital Logic Design, M. Morris Mano, Michael D Cilleti, PHI.
reference
material Reference Books:
1. Digital Principles & Application, 5th Edition, Leach & Malvino, McGraw Hill Company.
2. Modern Digital Electronics, 2nd Edition, R.P. Jain. Tata Mc Graw Hill Company
Limited.
CSC303 Data Structures and Algorithms 3-1-0 4 Credits 4 Hours

Department of Computer Science and Engineering

Course Title of the course Program Core Total Number of contact hours Credit
Code (PCR) / Lecture Tutorial Practical Total
Electives (PEL) (L) (T) (P) Hours
CSC 303 Data Structures and PCR 3 1 0 4 4
Algorithms
Pre-requisites Course Assessment methods (Continuous Assessment (CA), Mid-Term
(MT), End Term (ET))
CSC-01 (Introduction to CA+ MT + ET [CA: 15%, MT: 25%, ET: 60%]
Computing)
Course
Outcomes ● CO1: Understanding the fundamental concepts of data, data types and abstract data
types.
● CO2: Implementation of different abstract data types using different data structures.
● CO3: Apply different types of data structures to implement different application
problems.
● CO4: Analysis of the suitability/compatibility of different data structures based on
the types of applications.
● CO5: Design and development of algorithms for real-life applications.

Topics
Covered Introduction to problem solving through computer, Design of algorithm to solve a problem,
Concept of static and dynamic memory allocation, Algorithms and data structures, Concept
of Abstract Data Type (ADT) with examples. (3L)

Efficiency of an algorithm, Asymptotic notations, Time and space complexities, Analysis

of algorithms, Comparing asymptotic running times, Impact of data structure on the
performance of an algorithm. (4L)

Array, Single and multi-dimensional array, Memory representation (row major and column
major) of array, Insertion, and deletions in array, Advantages and disadvantages of array.
(3L)

Linked list as an ADT, Memory allocation and deallocation for a linked list, Linked list
versus array, Types of linked lists: singly linked list, doubly linked list and circular linked
list, Operations on linked list: creation, display, insertion and deletion (in different
positions), summation, average, maximum, minimum etc. Application of linked list:
representations and operations on polynomials, sparse matrices. (7L)

Stack as an ADT, Main operations (push and pop), auxiliary operations and axioms, Array
implementation of stack, Limitation of array implementation, Linked list implementation of
stack, Applications of stack: Recursion, Function call, Evaluation of postfix expression
using stack, Conversion of infix to postfix using stack. (6L)

Queue as an ADT, Main operations (enqueue and dequeue), Auxiliary operations and
axioms, Array implementation of queue, Limitation of array implementation and Circular
queue, Linked list implementation of queue, Double ended queue (dequeue) Priority queue
and its applications. (5L)
 Binary Tree, Definition and properties, Representation of binary tree in memory: linked
representation, array representation, Binary tree traversal, Preorder, Inorder and Postorder,
Expression tree, Heap and its applications. (5L)

Search trees: Binary search tree, Balanced binary search tree, AVL tree, Red Black tree,
M-way tree, M-way search tree, B tree, B+ Tree. (7L)

Searching: Linear search and binary search. (3L)

Sorting: Bubble, selection, insertion, Quick sort, Merge sort, Heap sort, Radix sort. (7L)

Graphs: Mathematical Properties, Degree, Connectedness, Representation using matrix,

Adjacency list, Directed Graphs, Directed Acyclic Graph. (2L)

Hashing: Hash functions. Collision, Collision resolution techniques: linear probing,

quadratic probing, double hashing, chaining, Rehashing. (4L)

Text Books,
and/or Text Books:
reference 1. R. F. Gilberg and B. A. Forouzan, "Data Structures: A pseudocode approach with C",
material 2nd Edition, CENGAGE Learning.
2. A. V. Aho, J. D. Ullman and J. E. Hopcroft, “Data Structures and Algorithms”, Addition
Wesley.
3. Lipschutz, “Data Structures (Schaum’s Outline Series)”, Tata Mcgraw Hill.
4. E. Horowitz, S. Sahni, S. Anderson-Freed, “Fundamentals of Data Structures in C”,
Universities Press; Second edition (2008).

Reference Books:
1. Y. Langsam, M. J. Augenstein and A. N. Tanenbaum, "Data Structures using C and
C++", Pearson, 2006.

2. Knuth, Donald E. The Art of Computer Programming. 3rd ed. Vols 1&2. Reading, MA:
Addison-Wesley, 1997. ISBN: 0201896834. ISBN: 0201896842. ISBN: 0201896850.

3. Kleinberg and Eva Tardos. Algorithm Design. Addison-Wesley 2005 ISBN-13: 978-
0321295354.
CSS351 Digital Logic Design Laboratory 0-0-3 1.5Credits 3Hours

Department of Computer Science and Engineering

Course Title of the course Program Core Total Number of contact hours Credit
Code (PCR) / Lecture Tutorial Practical Total
Electives (PEL) (L) (T) (P) Hours
CSS351 Digital Logic PCR 0 0 3 3 1.5
Design Laboratory
Pre-requisites Course Assessment methods (Continuous (CT) and End assessment
(EA))
NIL CT+EA [CT: 60%, EA(Laboratory assignment + Viva Voce): 40%]
Course ● CO1: Understand basic gate operations.
Outcomes ● CO2: Realize the boolean function using basic gates in both SOP/POS form.
● CO3: Realize different combinational circuits with basic gates.
● CO4: Understand the basic structure of different digital components- multiplexer,
decoder, encoder etc.
● CO5: Verification of state table of different flip flop using NAND/NOR gate.
Topics 1. Familiarization with IC, study of the data sheet, VCC, Ground. Verification of the
Covered truth tables.
2. Implementation of a given Boolean function using logic gates in both SOP and POS
forms. Verify the Universal logic gate (NAND, NOR).
3. Verify DE Morgan’s law.
4. Implement NAND based logic circuit for any Boolean expression. Verify that a
Boolean expression, e.g. F= AB + A’C’. is functionally complete.
5. Implement a Full adder using Half Adder. Implement the combinational circuit to
realize both Adder and Subtractor together.
6. Implementation and verification of Decoder, Multiplexer, Encoder and Priority
Encoder etc.
7. Implement and verify Ripple Carry Adder, Carry Look Ahead Adder and BCD
Adder.
8. Verification of state tables of RS, JK, T and D flip-flops using NAND & NOR
gates.
9. Implement and verify the 4-bit counter
Text Books, Text Books:
and/or 1. Digital Logic Design, M. Morris Mano, Michael D Cilleti, PHI.
reference
material Others:
1. Laboratory Manual.
CSS352 Data Structures and Algorithms Laboratory 0-0-4 2 Credits 4Hours

Department of Computer Science and Engineering

Course Title of the course Program Core Total Number of contact hours Credit
Code (PCR) / Lecture Tutorial Practical Total
Electives (PEL) (L) (T) (P) Hours
CSS352 Data Structures and PCR 0 0 4 4 2
Algorithms
Laboratory

Pre-requisites Course Assessment methods (Continuous Assessment (CT) and End

assessment (EA))
CSC-01 (Introduction to CT+EA [CT: 60%, EA (Programming assignment + Viva Voce): 40%]
Computing), CSS-51
(Computing Laboratory)
Course
Outcomes ● CO1: Choose appropriate data structures for representation and manipulation of the
data for the given problems.
● CO2: Handle operations like search, insertion, deletion, traversing and sorting on
various data structures.
● CO3: Have knowledge on the applications of linear and non-linear data structures
for real life problems.
● CO4: Able to store and manipulate data in an efficient manner.
● CO5: Able to implement stack, queue, binary tree, etc. using arrays and linked lists.
● CO6: Able to apply the concepts learnt through this course in various domains like
DBMS and compiler.

Topics
Covered 1. Insertion and deletion in arrays using dynamic memory allocation.
2. Linear search, Binary search (recursive, non-recursive).
3. Memory allocation and deallocation for linked list.
4. Operations on linked list: creation, display, insertion and deletion (in different
positions), summation, average, maximum, minimum etc.
5. Array implementation of stack and queue.
6. Linked implementation of stack and queue.
7. Evaluation of postfix expression using stack.
8. Conversion of infix expression to its postfix version using stack.
9. Linked implementation of binary tree and preorder, inorder and postorder traversal
on binary tree.
10. Implementation of binary search tree and operations on it (searching, insertion,
deletion).
11. Implementation of height-balanced binary search tree (AVL tree).
12. Implementation of 2-3 tree.
13. Implementation of Chaining.
14. Implementation of sorting algorithms: Selection sort, insertion sort, bubble sort,
quick sort, heap sort, merge sort, radix sort.
15. Implementation of few basic graph operations (such as breadth first and depth first
traversal, finding minimum spanning tree, shortest path) on graph.
Text Books, Text Books:
and/or 1. S. Lipschutz, “Data Structures (Schaum’s Outline Series)”, McGraw Hill Education;
reference First edition (2017).
material 2. E. Horowitz, S. Sahni, S. Anderson-Freed, “Fundamentals of Data Structures in C”,
Universities Press; Second edition (2008).
3. E. Balagurusamy, "Programming in ANSI C", McGraw Hill Education India Private
Limited, Seventh edition (2017).

Reference Books:
1. B. S. Gottfried, "Programming with C", McGraw Hill Education, Fourth edition (2018).
 Department of Mathematics
Course Title of the course Program Core Total Number of contact hours Credit
Code (PCR) / Lecture Tutorial Practical Total
Electives (L) (T) (P) Hours
(PEL)
MAC331 MATHEMATICS-III PCR 3 1 0 4 4

Pre-requisites Basic knowledge of topics included in MAC01 & MAC02

Course  CO1: Acquire the idea about mathematical formulations of phenomena in physics and
Outcomes engineering.
 CO2: To understand the common numerical methods to obtain the approximate
solutions for the intractable mathematical problems.
 CO3: To understand the basics of complex analysis and its role in modern mathematics
and applied contexts.
 CO4: To understand the optimization methods and algorithms developed for
solving various types of optimization problems.
Topics
Covered Partial Differential Equations (PDE): Formation of PDEs; Lagrange method for solution
of first order quasilinear PDE; Charpit method for first order nonlinear PDE; Homogenous
and Nonhomogeneous linear PDE with constant coefficients: Complimentary Function,
Particular integral; Classification of second order linear PDE and canonical forms; Initial &
Boundary Value Problems involving one dimensional wave equation, one dimensional heat
equation and two dimensional Laplace equation. [14]

Numerical Methods: Significant digits, Errors; Difference operators; Newton's Forward,

Backward and Lagrange’s interpolation formulae; Numerical solutions of nonlinear
algebraic/transcendental equations by Bisection and Newton-Raphson methods; Trapezoidal
and Simpson’s 1/3 rule for numerical integration; Euler’s method and modified Eular's
methods for solving first order differential equations. [14]

Complex Analysis: Functions of complex variable, Limit, Continuity and Derivative;

Analytic function; Harmonic function; Conformal transformation and Bilinear
transformation; Complex integration; Cauchy’s integral theorem; Cauchy’s integral formula;
Taylor’s theorem, Laurent’s theorem (Statement only); Singular points and residues;
Cauchy’s residue theorem. [17]

Optimization:
Mathematical Preliminaries: Hyperplanes and Linear Varieties; Convex Sets, Polytopes
and Polyhedra.
[2]
Linear Programming Problem (LPP): Introduction; Formulation of linear programming
problem (LPP); Graphical method for its solution; Standard form of LPP; Basic feasible
solutions; Simplex Method for solving LPP. [9]

Text Books, Text Books:

and/or 1. An Elementary Course in Partial Differential Equations-T. Amarnath
reference 2. Numerical Methods for scientific & Engineering Computation- M.K.Jain,
material S.R.K. Iyengar & R.K.Jain.
3. Foundations of Complex Analysis- S. Ponnuswami
4. Operations Research Principles and Practices- Ravindran, Phillips, Solberg
5. Advanced Engineering Mathematics- E. Kreyszig
Reference Books:
1. Complex Analysis-L. V. Ahfors
2. Elements of partial differential equations- I. N. Sneddon
3. Operations Research- H. A. Taha

Page 4 of 12
 Program Core Total Number of contact hours
Course
Title of the course (PCR) / Electives Lecture Tutorial Practical Total Credit
Code
(PCR) (L) (T) (P) Hours
Physics of
PHC331 Semiconductor PCR 3 0 0 3 3
Devices
Course Assessment methods: (Continuous (CT) and Midterm (MT) end
Pre-requisites
assessment (EA)):
PHC 01 in 1st year. CT, MT, EA Examination
Course  To introduce students with the different properties of semiconductor materials.
Objectives  To understand the construction and working principal of electronic devises.

Course
Outcomes At the end of the course, a student will be able to:
CO # 1. Describe the different electronic properties of semiconductor materials.
CO # 2. Understand the working principal of electronic devises (PN Diode, Photodetector, Solar cell, Light-
Emitting Diodes, Laser Diodes, JFET, MOSFET, Tunnel Diode, Gunn Diode, IMPATT Diode,
TRAPATT Diode and semiconductor memory).
CO # 3. Apply the knowledge of memory expansion to design required expanded memory for specific
application.
Topics
Covered Module – I: (L – 14 )
Fundamentals of Semiconductor & Semiconductor Devices Fabrication: Introduction to crystal growth,
Intrinsic and extrinsic semiconductors, Fermi level, Conductivity, Mobility and its temperature dependence,
Energy bands of semiconductors, Direct and indirect semiconductor, Variation of energy band with alloy
composition, III-V and II-VI alloy semiconductor, Homo and hetero-structure semiconductor, Effective
masses of carriers in semiconductor, Fermi-Dirac distribution function, Density of states, Carrier
concentrations at equilibrium, Calculation of number density of carriers and their temperature dependence,
Effects of temperature on carrier concentrations, High field effects, Hall effect, Lithography, Optical
lithography and Electron beam lithography..[CO# 1]; [T1, T2, R1]

Module – II: (L –3)

Junction-Diode & Optoelectronic Devices: P-N junction, Contact potential, Band diagram, Degenerate
semiconductors, Photodetector, Solar cell, Light-Emitting Diodes, Internal and external quantum efficiency
etc., Semiconductor Lasers, Population inversion at a junction, Emission spectra for P-N junction Lasers.
[CO# 2]; [T1, T2, R1]

Module – III: (L – 10)

Negative Conductance Microwave Devices: Materials for negative conductance devices, The Gunn effect
and related devices, The transferred electron mechanism, Transit time devices, The IMPATT Diode, the
TRAPATT Diode,Tunnel Diode.. [CO# 2];[ T3, R2]

Module – IV: (L – 9)
JFET and MOSFET: Junction Field Effect Transistors (JFET), Operation, I-V Characteristics etc., MOS
structure, Different MOS structures, Operation of MOS at high and low frequency, Accumulation, Inversion,
strong inversion regions, Metal-Oxide Semiconductor Field Effect Transistors (MOSFET), MOSFET as a
Capacitor, MOSFET as a resistor and related circuits.. [CO# 2]; [T1, R3]

Module – V: (L – 6)
SSemiconductor Memory Device: Semiconductor memory organization, Random Access Memory (RAM)
(static and dynamic), CMOS memory circuits, Charge Coupled Devices (CCD).[CO# 3];[T1, R3]
Text
Books, Text Books
and/or [T1]. Physics of Semiconductor Devices, S M SZE.
reference [T2]. Solid State Electronic Devices, Ben G Streetman & Banerjee
material [T3]. Microwave Solid-State Devices, S Y Liao

References:
[R1]. Semiconductor Physics and Devices, Donald A. Neamen.
[R2]. Microwave Engineering, David M.Pozar.
[R3]. Integrated Electronics, Millman-Halkias.

Mapping of CO (Course outcome) and PO (Programme Outcome)

PO
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
#1 #2 #3 #4 #5 #6 #7 #8 #9 #10 #11 #12 #1 #2 #3
CO
CO#1 3 1 2 1 1 1 1 2 - - 1

CO#2 3 2 1 1 1 1 1 1 1 1 2 1 1 1

CO#3 3 3 2 1 1 1 1 1 1 1 1 1 2 2 1

Correlation levels 1, 2 or 3 as defined below:

1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High)
 Program Core Total Number of contact hours
Course
Title of the course (PCR) / Electives Lecture Tutorial Practical Total Credit
Code
(PCR) (L) (T) (P) Hours
Semiconductor
PHS381 PCR 0 0 3 3 2
Devices Laboratory
Pre-requisites Course Assessment methods: (Continuous (CT) and end assessment (EA)):
PHS 01 in 1st year. CT, EA Examination
Course  To measure different characteristic parameter of semiconductor materials and devices.
Objectives
Course
Outcomes At the end of the course, a student will be able to:
CO # 1. Calculate different characteristic parameter of semiconductor materials.
CO # 2. Measure and understand different characteristic of semiconductor devices.
CO # 3. Draw the current-voltage characteristics of solar cell for calculation of conversion efficiency.

Topics List of Experiments:

Covered 1. To determine the energy bandgap of a semiconductor.
2. Measurement of resistivity of semiconductors by four-probe method at different temperatures.
3. Determination of Hall coefficient of a given semiconductor and its temperature dependence.
4. To determine the value of e/m of an electron by using a cathode ray tube and a pair of bar magnet.
5. Determination of Stefan’s constant.
6. Study of p-n junction diode characteristics.
7. Study of Zener diode characteristics and voltage regulator.
8. Determination of photo conversion efficiency of a Solar cell.

Text
Books, Text Books
and/or [T1]. An advanced course in practical physics, Chattapadhyay and Rakshit.
reference [T2]. Advanced practical Physics, K. G. Mazumdar
material

Mapping of CO (Course outcome) and PO (Programme Outcome)

PO
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
#1 #2 #3 #4 #5 #6 #7 #8 #9 #10 #11 #12 #1 #2 #3
CO
CO#1 3 2 1 1 1 1 2 1 1

CO#2 3 2 1 1 1 1 2 1 1

CO#3 3 2 1 1 1 1 1 1 1 2 2 1

Correlation levels 1, 2 or 3 as defined below:

1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High)