Department of Electronics and Communication Engineering,

Institute of Engineering and Technology, Deen Dayal Upadhyaya Gorakhpur University, Gorakhpur

Analog Circuits
Course code ECE205
Category Department Course
Course title Analog Circuits (Theory and Lab)
Scheme and Credits Credits 3+1 Semester – IV
Pre-requisites (if any) -
Course Objective:
• To describe and analyze the Diode circuits and basic amplifier models
• To understand the various feedback topologies.
• To describe the concept of Oscillators and their types.
• To understand the basic topology and variants of Current mirror circuits.
• To understand the concept of differential amplifiers.
• To understand the basic concept of Op-Amp and its use in various applications.
• To design basic active filters.
(i) Analog Circuits
Unit-1 Diode circuits, amplifier models: Voltage amplifier, current amplifier, trans-conductance 9 (Lectures)
amplifier and trans-resistance amplifier. biasing schemes for BJT and FET amplifiers, bias
stability, various configurations (such as CE/CS, CB/CG, CC/CD) and their features, small
signal analysis, low frequency transistor models, estimation of voltage gain, input resistance,
output resistance etc., design procedure for particular specifications, low frequency analysis
of multistage amplifiers.
Unit-2 High frequency transistor models, frequency response of single stage and multistage 9(Lectures)
amplifiers, cascode amplifier, various classes of operation (Class A, B, AB, C etc.), their
power efficiency and linearity issues, feedback topologies: Voltage series, current series,
voltage shunt, current shunt, effect of feedback on gain, bandwidth etc., calculation with
practical circuits, concept of stability, gain margin and phase margin.
Unit-3 Oscillators: Review of the basic concept, Barkhausen criterion, RCoscillators (phase shift, 9(Lectures)
Wien bridge etc.), LC oscillators (Hartley, Colpitt, Clapp etc.), non-sinusoidal oscillators.
Current mirror: Basic topology and its variants, V-I characteristics, output resistance and
minimum sustainable voltage (VON), maximum usable load, differential amplifier: Basic
structure and principle of operation, calculation of differential gain, common mode gain,
CMRR and ICMR
Unit-4 Op-Amp design: Design of differential amplifier for a given specification, 9(Lectures)
design of gain stages and output stages, compensation.
Op-Amp applications: Review of inverting and non-inverting amplifiers, integrator and
differentiator, summing amplifier, precision rectifier, Schmitt trigger and its applications,
active filters: Low pass, high pass, band pass and band stop, design guidelines.
(ii) Analog Circuits Laboratory
Note: A minimum of ten experiments from the following should be performed
Exp-1. Characteristic of BJT: Study of BJT in various configurations (such as CE/CS, CB/CG, CC/CD).
Exp-2. BJT in CE configuration: Graphical measurement of h-parameters from input and output
characteristics, measurement of Av, AI, Ro and Ri of CE amplifier with potential divider biasing.
Exp-3. Study of Multi-stage amplifiers: Frequency response of single stage and multistage amplifiers.
Exp-4. Feedback topologies: Study of voltage series, current series, voltage shunt, current shunt, effect
of feedback on gain, bandwidth etc.
Exp-5. Measurement of Op-Amp parameters: Common mode gain, differential mode gain, CMRR,
slew rate.
Exp-6. Applications of Op-Amp: Op-Amp as summing amplifier, difference amplifier, integrator and
differentiator.
Exp-7. Field effect transistors: Single stage common source FET amplifier –plot of gain in dB vs
frequency, measurement of bandwidth, input impedance, maximum signal handling capacity
(MSHC) of an amplifier.
Exp-8. Oscillators: Study of sinusoidal oscillators- RC oscillators (phase shift, Wien bridge etc.).
Exp-9. Study of LC oscillators (Hartley, Colpitt, Clapp etc.),
Exp-10. Study of non-sinusoidal oscillators.
Exp-11. Simulation of amplifier circuits studied in the lab using any available simulation software and
measurement of bandwidth and other parameters with the help of simulation software.
Exp-12. ADC/DAC: Design and study of Analog to Digital Converter.
Exp-13. Design and study of Digital to Analog Converter.
Text/Reference Books:
1. J.V. Wait, L.P. Huelsman and GA Korn, “Introduction to Operational Amplifier theoryand
 Department of Electronics and Communication Engineering,
Institute of Engineering and Technology, Deen Dayal Upadhyaya Gorakhpur University, Gorakhpur

applications,” Mc Graw Hill, 1992.

2. J. Millman and A. Grabel, “Microelectronics,” 2nd edition, McGraw Hill, 1988.
3. P. Horowitz and W. Hill, “The Art of Electronics,” 2nd edition, Cambridge University
Press, 1989.
4. A.S. Sedra and K.C. Smith, “Microelectronic Circuits,” Saunder's College11 Publishing,4th
edition.
5. Paul R. Gray and Robert G. Meyer, “Analysis and Design of Analog Integrated Circuits,”John
Wiley, 3rd edition.
6. Muhammad H. Rashid, “Electronic Devices and Circuits,” Cengage publication, 2014.

Course Outcomes:
At the end of this course students will demonstrate the ability to:
CO1. Understand the characteristics of diodes and transistors.
CO2. Design and analyze various rectifier and amplifier circuits.
CO3. Design sinusoidal and non-sinusoidal oscillators.
CO4. Understand the functioning of OP-AMP and design OP-AMP based circuits.
CO5. Design LPF, HPF, BPF, BSF.
CO6. Design ADC and DAC.
 Curriculum Structure of B.Tech. (CSE) Effective from session
2022 onwards
DATA STRUCTURE (CSE201)
Credit:3+1
Course Objective: To provide the knowledge of basic data structures and its implementations in context of
writing efficient programs.

I. Introduction: Basic Terminology, Elementary Data Organization, Built in Data Types in C. Algorithm,
Efficiency of an Algorithm, Time and Space Complexity, Asymptotic notations: Big Oh, Big Theta and Big
Omega, Time-Space trade-off. Abstract Data Types (ADT) Arrays: Definition, Single and Multidimensional
Arrays, Representation of Arrays: Row Major Order, and Column Major Order, Derivation of Index
Formulae for 1-D,2-D,3-D and n-D Array Application of arrays, Sparse Matrices and their representations.
Linked lists: Array Implementation and Pointer Implementation of Singly Linked Lists, Doubly Linked List,
Circularly Linked List, Operations on a Linked List. Insertion, Deletion, Traversal, Polynomial
Representation and Addition Subtraction & Multiplications of Single variable & Two variables Polynomial.

II. Stacks and Queues: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked
Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions, Evaluation of postfix
expression, Iteration and Recursion- Principles of recursion, Tail recursion, Removal of recursion Problem
solving using iteration and recursion with examples such as binary search, Fibonacci numbers, and Hanoi
towers. Tradeoffs between iteration and recursion. Queues: Operations on Queue: Create, Add, Delete, Full
and Empty, Circular queues, Array and linked implementation of queues in C, Dequeue and Priority Queue.

III. Searching & Sorting: Concept of Searching, Sequential search, Index Sequential Search, Binary Search.
Concept of Hashing & Collision resolution Techniques used in Hashing. Sorting: Insertion Sort, Selection,
Bubble Sort, Quick Sort, Merge Sort, Heap Sort and Radix Sort.

IV. Trees & Graphs: Basic terminology used with Tree, Binary Trees, Binary Tree Representation: Array
Representation and Pointer (Linked List) Representation, Binary Search Tree, Strictly Binary Tree, Complete
Binary Tree. Extended Binary Trees, Tree Traversal algorithms: Inorder, Preorder and Postorder,
Constructing Binary Tree from given Tree Traversal, Operation of Insertion, Deletion, Searching &
Modification of data in Binary Search. Threaded Binary trees, Traversing Threaded Binary trees. Huffman
coding using Binary Tree. Concept & Basic Operations for AVL Tree, B Tree & Binary Heaps. Graphs:
Terminology used with Graph, Data Structure for Graph Representations: Adjacency Matrices, Adjacency
List, Adjacency. Graph Traversal: Depth First Search and Breadth First Search, Connected Component,
Spanning Trees, Minimum Cost Spanning Trees: Prims and Kruskal algorithm. Transitive Closure and
Shortest Path algorithm: Warshal Algorithm and Dijikstra Algorithm.

Course Outcome (CO)

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

CO1 Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in memory, used by
the algorithms and their common applications.
CO2 Discuss the computational efficiency of the sorting and searching algorithms.
CO3 Implementation of Trees and Graphs and perform various operations on these data structure.
CO4 Understanding the concept of recursion, application of recursion and its implementation and removal
of recursion.
CO5 Identify the alternative implementations of data structures with respect to its performance to solve a
real-world problem.

Text books:
1. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein, “Data Structures Using C and C++”,
PHI Learning Private Limited, Delhi India

Institute of Engineering and Technology

DDU Gorakhpur University, Gorakhpur, Uttar Pradesh
 Curriculum Structure of B.Tech. (CSE) Effective from session
2022 onwards
2. Horowitz and Sahani, “Fundamentals of Data Structures”, Galgotia Publications Pvt Ltd Delhi India.
3. Lipschutz, “Data Structures” Schaum’s Outline Series, Tata McGraw-hill Education (India) Pvt. Ltd.
4. Thareja, “Data Structure Using C” Oxford Higher Education.
5. AK Sharma, “Data Structure Using C”, Pearson Education India.
6. Rajesh K. Shukla, “Data Structure Using C and C++” Wiley Dreamtech Publication.
7. Michael T. Goodrich, Roberto Tamassia, David M. Mount “Data Structures and Algorithms in C++”,
Wiley India.
8. P. S. Deshpandey, “C and Data structure”, Wiley Dreamtech Publication.
9. R. Kruse etal, “Data Structures and Program Design in C”, Pearson Education.
10. Berztiss, AT: Data structures, Theory and Practice, Academic Press.
11. Jean Paul Trembley and Paul G. Sorenson, “An Introduction to Data Structures with applications”,
McGraw Hill.
12.Adam Drozdek “Data Structures and Algorithm in Java”, Cengage Learning.

Data Structure using C Lab

Write C Programs to illustrate the concept of the following:
1. Sorting Algorithms-Non-Recursive.
2. Sorting Algorithms-Recursive.
3. Searching Algorithm.
4. Implementation of Stack using Array.
5. Implementation of Queue using Array.
6. Implementation of Circular Queue using Array.
7. Implementation of Stack using Linked List.
8. Implementation of Queue using Linked List.
9. Implementation of Circular Queue using Linked List.
10. Implementation of Tree Structures, Binary Tree, Tree Traversal, Binary Search Tree, Insertion and
Deletion in BST.
11. Graph Implementation, BFS, DFS, Minimum cost spanning tree, shortest path algorithm

Institute of Engineering and Technology

DDU Gorakhpur University, Gorakhpur, Uttar Pradesh
 Department of Electronics and Communication Engineering,
Institute of Engineering and Technology, Deen Dayal Upadhyaya Gorakhpur University, Gorakhpur

Digital Electronics & Logic Design

Course code ECE202
Category Department Course
Course title Digital Electronics & Logic Design (Theory and Lab)
Scheme and Credits Credits 3+1 Semester –III
Pre-requisites (if any) -
Course Objective:
• To introduce the concept of digital and binary systems
• To analyze and design MSI devices.
• To design and analyze sequential logic circuits.
• To design and analyze Logic families and semiconductor memories.
• To design and analyze Logic families and semiconductor memories.
• To understand the different Logic families and semiconductor memories
(i) Digital Electronics & Logic Design
Unit-1 Logic simplification and combinational logic design: Binary codes, codeconversion, 9 (Lectures)
review of Boolean algebra and Demorgans theorem, SOP &
POS forms, Canonical forms, Karnaugh maps up to 6 variables, tabulationmethod.
MSI devices like comparators, multiplexers, encoder, decoder, driver &
multiplexed display, half and full adders, subtractors, serial and paralleladders, BCD adder,
barrel shifter and ALU.
Unit-2 Sequential logic design: Building blocks like S-R, JK and Master-Slave JK FF, edge triggered 9(Lectures)
FF, state diagram, state reduction, design of sequential circuits, ripple and synchronous
counters, shift registers, finite state machines, design of synchronous FSM, algorithmic state
machines charts. Designing synchronous circuits like pulse train generator, pseudo random
binary sequence generator, clock generation.
Unit-3 Logic families and semiconductor memories: TTL NAND gate,specifications, noise margin, 9(Lectures)
propagation delay, fan-in, fan-out, tristate TTL, ECL, CMOS families and their interfacing,
memory elements,
concept of programmable logic devices like FPGA, logic implementation using programmable
devices.
Unit-4 Digital-to-Analog converters (DAC): Weighted resistor, R-2R ladder, resistor string etc. 9 (Lectures)
analog-to-digital converters (ADC): single slope, dual slope, successive approximation, flash
etc. switched capacitor circuits: Basic concept, practical configurations, application in
amplifier, integrator,
ADC etc.
(ii) Digital Electronics & Logic Design Laboratory
Note: A minimum of ten experiments from the following should be performed
EXP-1 Introduction to digital electronics lab- nomenclature of digital ICs, specifications, study of
the data sheet, Concept of Vcc and ground, verification of the truth tables of logic gates using
TTL ICs.
EXP-2 Implementation of the given Boolean function using logic gates in both SOP and POS
forms.
EXP-3 Verification of state tables of RS, JK, T and D flip-flops using NAND & NOR gates.
EXP-4 Implementation and verification of Decoder using logic gates.
EXP-5 Implementation and verification of Encoder using logic gates.
EXP-6 Implementation of 4:1 multiplexer using logic gates.
EXP-7 Implementation of 1:4 demultiplexer using logic gates.
EXP-8 Implementation of 4-bit parallel adder using 7483 IC.
EXP-9 Design, and verify the 4-bit synchronous counter.
EXP-10 Design, and verify the 4-bit asynchronous counter.
EXP-11 Implementation of Mini Project using digital integrated circuits and other components.

Text/Reference Books:
1. R.P. Jain, “Modern Digital Electronics,” Tata McGraw Hill, 4th edition, 2009.
2. A. Anand Kumar, “Fundamental of Digital Circuits,” PHI 4th edition, 2018.
3. W.H. Gothmann, “Digital Electronics- An Introduction to Theory and Practice,” PHI, 2nd
edition, 2006.
4. D.V. Hall, “Digital Circuits and Systems,” Tata McGraw Hill, 1989.
5. A. K. Singh, “Foundation of Digital Electronics & Logic Design,” New Age Int.Publishers.
 Department of Electronics and Communication Engineering,
Institute of Engineering and Technology, Deen Dayal Upadhyaya Gorakhpur University, Gorakhpur

6. Subrata Ghosal, “Digital Electronics,” Cengage publication, 2nd edition, 2018

Course outcomes:
At the end of this course students will demonstrate the ability to:
CO1. Design and analyze combinational logic circuits.
CO2. Design and analyze modular combinational circuits with MUX / DEMUX, Decoder &
Encoder
CO3. Design & analyze synchronous sequential logic circuits.
CO4. Analyze various logic families.
CO5. Design ADC and DAC and implement in amplifier, integrator, etc.
CO6. Design & build mini project using digital ICs.
 Curriculum Structure of B.Tech. (CSE) Effective from session
2022 onwards
IT Workshop (Sci Lab/MATLAB) (CSE202)
Credit:1+2
Course Objective: To Impart the knowledge to the students with MATLAB software with technical
computing environment.

I.INTRODUCTION TO SIMULATION SOFTWARE: About SCILAB/MATLAB, SCILAB/MATLAB

System, Starting and Quitting SCILAB/MATLAB. EXPRESSIONS: Variables Numbers, Operators
Functions, Expressions. FLOW CONTROL: If, else, and else if, switch and case, for, while, continue, break
try - catch, return. COMMAND WINDOW: The format Function, Suppressing Output, Entering Long
Statements, Command Line Editing.

II.MATRICES AND ARRAYS: Entering Matrices sum and transpose, subscripts, colon Operator, magic
Function. WORKING WITH MATRICES: Generating Matrices, the load Function, M-Files,
Concatenation, Deleting Rows and Columns, Linear Algebra, Arrays Multivariate Data, Scalar Expansion,
Logical Subscripting, find Function.

III.SCRIPTS & FUNCTIONS: Scripts, Functions, Global Variables, Passing String Arguments to
Functions, eval Function, Function Handles, Vectorization, Pre allocation. OTHER DATA STRUCTURE:
Multidimensional Arrays, Cell Arrays, Characters and Text, Structures.

IV.GRAPHICS: Plotting Process, Editing Process, Preparing Graphs, Basic Plotting Functions, Mesh
&Surface Plot, and Image Reading & Writing, Printing graphics. SIMULINK

Course Outcome (CO)

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

CO1 Understand the need for simulation/implementation for the verification of mathematical functions.
CO2 Understand the main features of the MATLAB/SCILAB program development environment to
enable their usage in the higher learning.
CO3 Implement simple mathematical functions/equations in numerical computing environment such as
MATLAB/SCILAB.
CO4 Interpret and visualize simple mathematical functions and operations thereon using plots/display.
CO5 Analyze the program for correctness and determine/estimate/predict the output and verify it under
simulation environment using MATLAB/SCILAB tools.

Text books
1. MATLAB and its Applications in Engineering, Rajkumar Bansal, Pearson Publishers, ISBN-10:
2. 8131716813, 2009.
3. A Guide to MATLAB: For Beginners & Experienced Users By: Kevin R. Coombes, John E.
4. Osborn, Garrett J. Stuck
5. SCILAB (a Free Software to Matlab),Er. HemaRamachandran and Dr. Achutsankar Nair, S. Chand
6. Publishers, ISBN-10: 8121939704,2011
7. Introduction to SCILAB by Rachna Verma and Arvind Verma
8. SCILAB—A Beginner‘s Approach by Anil Kumar Verma
9. http://in.mathworks.com/
10. https://www.scilab.org/resources/documentation/tutorials

IT Workshop Lab (Sci Lab/MATLAB)

1. Addition, subtraction and multiplication of two matrices.
2. Verify whether the given matrix is singular or non-singular and compute its inverse if applicable.
3. Sorting of 1-D array and searching of an array/matrix. Also, list the set of numbers that obey a
common condition in an array/matrix using find( ).
Institute of Engineering and Technology
DDU Gorakhpur University, Gorakhpur, Uttar Pradesh
Curriculum Structure of B.Tech. (CSE) Effective from session
2022 onwards
4. Solve simultaneous equations (maximum of three) using Cramer‘s rule. [Simultaneous equations
may be obtained by applying KCL or KVL for a circuit and they can be solved for voltages or
currents, respectively]
a) Show that log10(A*B) =log10 A+ log10 B and log10(A/B) =log10 A-log10 B
b) Plot the voltage across capacitor during charging Vc=V0[1-e -(t/RC)]
c) Plot a straight line for the given slope and intercept using different plot attributes.
d) Differentiate and integrate y=mx+c, separately, and display the results on the same plot.
5. Plot y1=A*sin(2πf1t), y2=B*cos(2πf2t) and y3=A*sin(2πf1t)+B*cos(2πf2t), in time and
6. frequency (after computing DFT or FFT) domains as subplots and infer the results.
7. Integrate and differentiate sin(x) and display the results on the same plot in different colors. Also
display sin(x) on the same plot.
8. Compute mean, median, standard deviation and variance of a set of data using formulae and verify
using built-in functions.
9. Find all the even and prime numbers between two numbers (range).
10. Demonstrate (a) reading and display image, (b) converting color image to gray and black-and-white
and plotting their histograms, and (c) conversion of image file formats.
11. Compare the results of the built-in and user-defined function to compute cos(x) [the series cos(x)=1-
(x2/2!)+(x4/4!)- (x6/6!)+ … can be used]
12. Write a program to compute roots of a quadratic equation ax2 +bx+c=0 given a, b and c.

Institute of Engineering and Technology

DDU Gorakhpur University, Gorakhpur, Uttar Pradesh
 .

B.A./B.Sc. II (SEMESTER-III) PAPER-I

ALGEBRA
Class: B.A. / B.Sc.
Year: SECOND Semester: THIRD

Subject: MATHEMATICS
Course Code: MAT 201 (B030301T) Course Title: ALGEBRA

Course outcomes:
CO1: Group theory is one of the building blocks of modern algebra. Objective of this course is tointroduce
students to basic concepts of Group theory and their properties.

CO2: A student learning this course gets a concept of Integers, Group and their properties. This course will lead
the student to basic course in advanced mathematics particularly in Algebra.

CO3: The course gives emphasis to enhance students’ knowledge of Permutation groups and Normal subgroups.

CO4: On successful completion of the course students would have acquire knowledge about Integers, Group
and will help him/her in going for higher studies and research.

Credits: 3 Core Compulsory / Elective

Max. Marks: 25+75 Min. Passing Marks: As per UGC/ University CBCS norm.
Total No. of Lectures-Tutorials-Practical (in hours per week): L-T-P: 3-0-0
Unit Topics No. of Lectures

ALGEBRA
I Properties of Integers, Divisor, Division algorithm. Greatest Common Divisor,
Euclidean algorithm, Fundamental theorem of arithmemetic, Congruences and 12
residue classes. Euler ∅ − function and its properties, Euler’s, Fermat’s and
Wilson’s theorem.
II Algebraic Structure, Definition of a group with examples and simple properties,
Subgroups, Generators of a group, Cyclic groups, Order of an element of a group, 11
Centre of group.
III Permutation groups, Cyclic permutation, Transposition, Even and odd permutations,
The alternating group, Cayley’s theorem, Direct products, Coset decomposition, 11
Lagrange’s theorem and its consequences.
IV Homomorphism and isomorphism, Kernel of homomorphism, Normal subgroups,
Simple group, Quotient groups, Fundamental theorem of homomorphism, Theorems 11
on isomorphism.

Three Years B.A. /B.Sc. Mathematics Programme Page 15

 Suggested Readings :
1. I. N. Herstein , Topics in Algebra, Wiley Eastern Ltd, New Delhi, 1975.
2. Joseph. A. Gallian, Contemporary Abstract Algebra, Cengage Learning India Private Limited, Delhi.,
Fourth impression, 2015.
3. P. B. Bhattacharya, S. K. Jain and S. R. Nagpal, First Course in Linear Algebra, Wiley Eastern Ltd.,
New Delhi, 1983.
4. S. Singh and Q. Zameeruddin, Modern Algebra, Vikas Publication House, India.
5. David M. Burton, Elementary Number Theory, Wm. C. Brown Publishers, Dubuque, Iowa 1989.
6. Course Books published in Hindi may be prescribed by the Universities.
Suggestive Digital Platforms/ Web Links:
 National Programme on Technology Enhanced Learning (NPTEL)
 SWAYAM
 Massachusetts Institute of Technology (MIT) Open Learning
 Uttar Pradesh Higher Education Digital Library (UPHEDL)
 National Digital Library of India (NDLI)
This course can be opted as an elective by the students of following subjects: Open to all
Internal Evaluation Methods (Max. Marks: 25)
Internal Evaluation shall be based on Class test, Presentation and Assignment. The marks shall be as follows:
S.No. Assessment Type Max. Marks
1 Class Test-I (Descriptive Questions) 5
2 Class Test-II (Objective Questions) 5
3 Presentation/ Class Interaction 5
4 Assignment 10
Course prerequisites:
To study this course, a student must have passed Mathematics as Major Subject in B.A. /B.Sc.First Year
Programme.

Three Years B.A. /B.Sc. Mathematics Programme Page 16

 Course Code:POL 102 (A060101T)
Course Title: Indian National Movement & Constitution of lndia
Credits: 4+0
Unit Topic
Birth, Growth And The Political Trends In The Indian National Movement
Stages Of Constitutional Development, Making Of The ConstituentAssembly
Philosophy Of Indian Constitution, Citizenship
Fundamental Rights, Fundamental Duties, Directive Principles Of State
Policy
IV History Of Conflict Betwcen Fundamental Rights & Directive Principles,
Process Of Amendment, Concept Of Basic Structure Of Constitution
V Union Executive & Union Legislature
President, Cabinet, Prime Minster, Lok Sabha Rajya Sabha, Spcaker
State Executive & Legislature: Powers, Functions And The Relationship Between
The Governor & Chief Minister, The Legislative Assembly, The Legislative
Council
VI
Judiciary:
Composition, Powers & Jurisdiction Of Supreme Court, High Court, District
Court
VIL Centre-State Relations: Administrative, Legislative &Financial, Special
Provisions For Tribal Arcas And N-E, Composition, Function And Power Of
Election Commission