23

Linear Integrated Circuits Semester III

Course Code BRA306C CIE Marks 50
Teaching Hours/Week (L: T:P: S) 3:0:0:0 SEE Marks 50
Total Hours of Pedagogy 40 hours Total Marks 100
Credits 03 Exam Hours 03
Examination nature (SEE) Theory

Course Objectives:
The objectives of this course are to:
1. Understand the basic concepts of OP-AMP circuits
2. Analyze the applications of operational amplifiers
3. Understand special function ICs and wave form Generators using operational amplifiers circuits
4. Compared sign issues, advantages, disadvantages and limitations of communication systems.

Teaching-Learning Process (General Instructions)

These are sample Strategies, which teachers can use to accelerate the attainment of the various courseoutcomes.
1. Lecturer method (L) does not mean only the traditional lecture method, but a different type of
teaching method may be adopted to develop the outcomes.
2. Show Video/animation films to explain the functioning of various communication systems.
3. Encourage collaborative (Group) Learning in the class.

Module-1
IC Fabrication:
IC classification, fundamental of monolithic IC technology, epitaxial growth, masking and etching,
diffusion of impurities. Realization of monolithic ICs and packaging. Fabrication of diodes, capacitance,
resistance, FETs and PV Cell.
8 Hours
Module-2
Characteristics of Opamp:
Ideal OP-AMP characteristics, DC characteristics, AC characteristics, differential amplifier; frequency
response of OP-AMP; Basic applications of op-amp — Inverting and Non-inverting Amplifiers, summer,
differentiator and integrator-V/I& I/V converters.
8 Hours
Module-3
Applications of Opamp:
Instrumentation amplifier and its applications for transducer Bridge, Logand Antilog Amplifiers- Analog
multiplier & Divider, first and second order active filters, comparators, multivibrator, wave form generators,
clippers, clampers, peak detector, S/H circuit, D/A converter (R-2R ladder and weighted
resistor types), A/D converters using opamps.
8 Hours
Module-4
Timers:
Functional block, characteristics of 555 Timer and its PW application—IC-566 voltage controlledoscillator
IC; 565-phase locked loop IC, AD 633Analog multiplier ICs.
8 Hours
Module-5
Applications:
AD623 Instrumentation Amplifier and its application as load cell weight measurement — IC voltage
regulators –LM78XX, LM79XX; Fixed voltage regulators its application as Linear power supply—
LM317, 723Variability voltage regulators, switching regulator-SMPS—ICL8038 function generator IC.
8 Hours

@#15102023
 24

Course Outcome (COs) (Course Skill Set)

At the end of the course, the student will be able to :
CO1. Design linear and non-linear applications of OP–AMPS
CO2. Design ADC and DAC using OP–AMPS
CO3. Generate wave forms using OP–AMP CircuitsCO4.
Analyze special function ICs
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 40% of the maximum marks (20 marks out of 50) and for the SEE
minimum passing mark is 35% of the maximum marks (18 out of 50 marks). A student shall be deemed to
have satisfied the academic requirements and earned the credits allotted to each subject/ course if the student
secures a minimum of 40% (40 marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation)
and SEE (Semester End Examination) taken together.

Continuous Internal Evaluation:

1. For the Assignment component of the CIE, there are 25 marks and for the Internal Assessment Test
component, there are 25 marks.
2. The first test will be administered after 40-50% of the syllabus has been covered, and the second testwill
be administered after 85-90% of the syllabus has been covered
3. Any two assignment methods mentioned in the 22OB2.4, if an assignment is project-based then only one
assignment for the course shall be planned. The teacher should not conduct two assignments at theend of
the semester if two assignments are planned.
4. For the course, CIE marks will be based on a scaled-down sum of two tests and other methods of
assessment.
Internal Assessment Test question paper is designed to attain the different levels of Bloom’staxonomy as
per the outcome defined for the course.

Semester-End Examination:
Theory SEE will be conducted by University as per the scheduled timetable, with common question
papers for the course (duration 03 hours).
1. The question paper will have ten questions. Each question is set for 20 marks.
2. There will be 2 questions from each module. Each of the two questions under a module (with a
maximum of 3 sub-questions), should have a mix of topics under that module.
3. The students have to answer 5 full questions, selecting one full question from each module.
4. Marks scored shall be proportionally reduced to 50 marks

Suggested Learning Resources:

Books
1. D. Roy Choudhry, ShailJain,“Linear Integrated Circuits”, New Age International Pvt. Ltd., Fifth
edition 2018.
2. Sergio Franco, “Design with Operational Amplifiers and Analog Integrated Circuits”, Forth
Edition, Tata McGraw-Hill, 2014.
Reference:
1. Ramakant A.Gayakwad, “OP-AMP and Linear ICs”, 4th Edition, Prentice Hall/ PearsonEducation,
2001.
2. RobertF.Coughlin, Frederick F. Driscoll, “Operational Amplifiers and Linear Integrated Circuits”,
Sixth Edition, PHI, 2001.

Web links and Video Lectures (e-Resources):

1. https://www.digimat.in/nptel/courses/video/108108111/L01.html
2. https://www.digimat.in/nptel/courses/video/108108114/L01.html

Activity Based Learning (Suggested Activities in Class)/ Practical Based learning

1. Design of a differential amplifier.
@#15102023
 25

2. Design and Verification of Applications of Op-amp (Adder, Subtractor, Integrator

Differentiator).
3. Design of Full wave rectifier using 741IC
4. Design of Instrumentation Amplifier using Op-Amp.
5. Design of Triangular wave form generators using 741 IC.

Data Structures and Applications Semester III

Course Code BRA306D CIE Marks 50
Teaching Hours/Week (L:T:P: S) 3:0:0:0 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 03
Examination nature (SEE) Theory
Course Objectives:
The objectives of this course are to:
1. Explain fundamentals of data structures and their applications essential for programming/problem solving
2. Illustrate linear representation of data structures: Stack, Queues, Lists, Trees and Graphs.
3. Demonstrate sorting and searching algorithms.
4. Find suitable data structure during application development/Problem Solving
Teaching-Learning Process (General Instructions)
These are sample Strategies, which teachers can use to accelerate the attainment of the various course
outcomes.
1. Lecturer method (L) does not mean only the traditional lecture method, but a different type of teaching
method may be adopted to develop the outcomes.
2. Show Video/animation films to explain the functioning of various communication systems
3. Encourage collaborative (Group) Learning in the class.
Module-1
Introduction: Data Structures, Classifications (Primitive & Non Primitive), Data structure Operations,
Review of Arrays, Structures, Self-Referential Structures, and Unions. Pointers and Dynamic Memory
Allocation Functions. Representation of Linear Arrays in Memory, Dynamically allocated arrays.
Array Operations: Traversing, inserting, deleting, searching, and sorting. Multidimensional Arrays,
Polynomials and Sparse Matrices.
Strings: Basic Terminology, Storing, Operations and Pattern Matching algorithms. Programming Examples.
8 Hours
Module-2
Stacks: Definition, Stack Operations, Array Representation of Stacks, Stacks using Dynamic Arrays, Stack
Applications: Polish notation, Infix to postfix conversion, evaluation of postfix expression. Recursion -
Factorial, GCD, Fibonacci Sequence, Tower of Hanoi, Ackerman's function.
Queues: Definition, Array Representation, Queue Operations, Circular Queues, Circular queues using
Dynamic arrays, Dequeues, Priority Queues, A Mazing Problem.
8 Hours
Module-3
Linked Lists: Definition, Representation of linked lists in Memory, Memory allocation; Garbage
Collection. Linked list operations: Traversing, Searching, Insertion, and Deletion. Doubly Linked lists,
Circular linked lists, and header linked lists. Linked Stacks and Queues. Applications of Linked lists –
Polynomials, Sparse matrix representation. Programming Examples.
8 Hours
Module-4
Trees: Terminology, Binary Trees, Properties of Binary trees, Array and linked Representation of Binary
Trees, Binary Tree Traversals – In order, post order, pre order; Additional Binary tree operations. Threaded
binary trees, Binary Search Trees – Definition, Insertion, Deletion, Traversal, Searching, Application of
Trees-Evaluation of Expression, Programming Examples. 8 Hours
@#15102023