0% found this document useful (0 votes)
6 views8 pages

B. Tech (Computer Science & Engineering (AI & ML) ) (3rd Sem)

The document outlines the Semester-III curriculum for a B. Tech in Computer Science & Engineering (AI & ML), detailing courses, credits, and lab components. Key subjects include Analog Electronic Circuits, Data Structures & Algorithms, Object Oriented Programming using C++, Mathematics-III (Differential Calculus), and Technical Writing. Each course includes a breakdown of units and suggested textbooks for further study.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views8 pages

B. Tech (Computer Science & Engineering (AI & ML) ) (3rd Sem)

The document outlines the Semester-III curriculum for a B. Tech in Computer Science & Engineering (AI & ML), detailing courses, credits, and lab components. Key subjects include Analog Electronic Circuits, Data Structures & Algorithms, Object Oriented Programming using C++, Mathematics-III (Differential Calculus), and Technical Writing. Each course includes a breakdown of units and suggested textbooks for further study.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

B.

Tech (Computer Science & Engineering (AI & ML)) Semester- III

B. Tech (Computer Science & Engineering (AI & ML))

S.No. Course Course Title L T P Credit


Code
1 100302 Analog Electronic Circuits 3 0 0 3
2 100304 Data Structure & Algorithm 3 0 0 3
3 100313 Object Oriented Programming using 3 0 0 3
C++
4 100311 Mathematics- III (Differential 2 0 0 2
Calculus)
5 100314 Technical Writing 3 0 0 3
6 100399P Summer Industry Internship-I - - -
4
7 100302P Analog Electronic Circuits Lab 0 0 4 2
8 100304P Data Structure & Algorithm Lab 0 0 4 2
9 100313P Object Oriented Programming using 0 0 4 2
C++ Lab
TOTAL 24

1
B. Tech (Computer Science & Engineering (AI & ML)) Semester- III

Paper Code Analog Electronic Circuits L T P C


100302 3 0 0 3

Unit-1.0 6 hrs.
Diode circuits: P-N junction diode, I-V characteristics of a diode; review of half-
wave and full-wave rectifiers, Zener diodes, clamping and clipping circuits.
Unit-2.0 8 hrs.
BJT circuits: Structure and I-V characteristics of a BJT; BJT as a switch. BJT as an
amplifier: small- signal model, biasing circuits, current mirror; common-emitter,
common-base and common-collector amplifiers; Small signal equivalent circuits,
high-frequency equivalent circuits.
Unit-3.0 6 hrs.
MOSFET circuits: MOSFET structure and I-V characteristics. MOSFET as a switch.
MOSFET as an amplifier: small-signal model and biasing circuits, common-source,
common-gate and common-drain amplifiers; small signal equivalent circuits - gain,
input and output impedances, trans-conductance, high frequency equivalent circuit.
Unit-4.0 4 hrs.
Differential, multi-stage and operational amplifiers: Differential amplifier; power
amplifier; direct coupled multi-stage amplifier; internal structure of an operational
amplifier, ideal op-amp, non- idealities in an op-amp (Output offset voltage, input bias
current, input offset current, slew rate, gain bandwidth product).
Unit-5.0 8 hrs.
Linear applications of op-amp: Idealized analysis of op-amp circuits. Inverting and
non-inverting amplifier, differential amplifier, instrumentation amplifier, integrator,
active filter, P, PI and PID controllers and lead/lag compensator using an op-amp,
voltage regulator, oscillators (Wein bridge and phase shift). Analog to Digital
Conversion.
Unit-6.0 10 hrs.
Nonlinear applications of op-amp: Hysteretic Comparator, Zero Crossing Detector,
Square-wave and triangular-wave generators. Precision rectifier, peak detector,
Monoshot.
Suggested books:
1. A S Sedra and K. C. Smith, ―Microelectronic Circuits‖, New York, Oxford
University Press, 1998.
2. J. V. Wait, L. P. Huelsman and G. A. Korn, ―Introduction to
Operational Amplifier theory and applications‖, McGraw Hill U. S., 1992.
3. J. Millman and A. Grabel, ―Microelectronics‖, McGraw Hill Education,
1988.
4. P. Horowitz and W. Hill, ―The Art of Electronics‖, Cambridge University
Press, 1989.
5. P.R. Gray, R.G. Meyer and S. Lewis, ―Analysis and Design of Analog
Integrated Circuits‖, John Wiley & Sons, 2001.

2
B. Tech (Computer Science & Engineering (AI & ML)) Semester- III

Paper Code Data Structure & Algorithms L T P C


100304 3 0 0 3

Unit-1.0 7 hrs.
Introduction: Basic Terminologies: Elementary Data Organizations, Data Structure
Operations: insertion, deletion, traversal etc.; Analysis of an Algorithm, Asymptotic
Notations, Time-Space trade off.
Unit-2.0 7 hrs.
Stacks and Queues: ADT Stack and its operations: Algorithms and their complexity
analysis, 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 Type of Queues:
Algorithms and their analysis.
Unit-3.0 7 hrs.
Linked Lists: Singly linked lists: Representation in memory, Algorithms of several
operations: 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.
Unit-4.0 7 hrs.
Searching, Sorting and Hashing: Linear Search and Binary Search Techniques and
their complexity analysis. Objective and properties of different sorting algorithms:
Selection Sort, Bubble Sort, Insertion Sort, Quick Sort, Merge Sort, Heap Sort;
Performance and Comparison among all the methods, Hashing.
Unit-5.0 7 hrs.
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.
Unit-6.0 7 hrs.
Graph: Basic Terminologies and Representations, Graph search and traversal
algorithms and complexity analysis.
Suggested books:
1. Algorithms, Data Structures, and Problem Solving with C++‖, Illustrated Edition
by Mark Allen Weiss, Addison-Wesley Publishing Company.
2. ―How to Solve it by Computer‖, 2nd Impression by R.G. Dromey, Pearson
Education.
3. ―Fundamentals of Data Structures‖, Illustrated Edition by Ellis Horowitz, Sartaj
Sahni, Computer Science Press.

3
B. Tech (Computer Science & Engineering (AI & ML)) Semester- III

Paper Code Object Oriented Programming using C++ L T P C


100313 3 0 0 3

Unit-1.0 7 hrs.
Introduction to C++ : Object Oriented Technology, Advantages of OOP, Input- output
in C++, Tokens, Keywords, Identifiers, Data Types C++, Derives data types. The void
data type, Type Modifiers, Typecasting, Constant, Operator, Precedence of Operators,
Strings.
Unit-2.0 8 hrs.
Control Structures and Functions: Decision making statements like if-else, Nested if-
else, goto, break, continue, switch case, Loop statement like for loop, nested for loop,
while loop, do-while loop. Parts of Function, User- defined Functions, Value- Returning
Functions, void Functions, Value Parameters, Function overloading, Virtual Functions.
Unit-3.0 8 hrs.
Classes and Data Abstraction : Structure in C++, Class, Build- in Operations on
Classes, Assignment Operator and Classes, Class Scope, Reference parameters and
Class Objects (Variables), Member functions, Accessor and Mutator Functions,
Constructors, default Constructor, Destructors.
Unit-4.0 5 hrs.
Overloading, Templates and Inheritance: Operator Overloading, Function
Overloading, Function Templates, Class Templates. Single and Multiple Inheritance,
virtual Base class, Abstract Class, Pointer and Inheritance, Overloading Member
Function.
Unit-5.0 7 hrs.
Pointers and Arrays: Void Pointers, Pointer to Class, Pointer to Object, Void Pointer,
Arrays. The keywords try, throw and catch.
Unit-6.0 7 hrs.
Exception Handling: Creating own Exception Classes, Exception Handling
Techniques (Terminate the Program, Fix the Error and Continue, Log the Error and
Continue), Stack Unwinding.
Suggested books:
1. Thinking in C++, Volume 1 & 2 by Bruce Eckel, Chuck Allison, Pearson
Education
2. Mastering C++, 1/e by Venugopal, Tata McGraw Hill.
3. Object Oriented Programming with C++, 3/e by E. Balaguruswamy, Tata
McGraw Hill.
4. Starting Out with Object Oriented Programming in C++, by Tony Gaddis, Wiley
India.
Suggested reference books:
1. The C++ Programming language 3/e by Bjarne Stroustrup, Pearson Education.
2. C++, How to Programme, 4e, by Deitel, Pearson Education.
3. Big C++ by Cay Horstmann, Wiley India.
4. C++ Primer, 3e by Stanley B. Lippmann, JoseeLajoie, Pearson Education.
5. C++ and Object Oriented Programming Paradigm, 2e by Debasish Jana, PHI.
4
B. Tech (Computer Science & Engineering (AI & ML)) Semester- III

6. Programming with C++, 2/e by Ravichandran, Tata McGraw Hill.


7. C++ Programming Black Book by Steven Holzner, Dreamtech Press.

5
B. Tech (Computer Science & Engineering (AI & ML)) Semester- III

Paper Code Mathematics-III (Differential Calculus) L T P C


100311 2 0 0 2
Unit-1.0 3 hrs.
Successive Differentiation, Leibnitz’s Theorem. Limit, Continuity and Differentiability
of function for one variable.
Unit-2.0 6 hrs.
Limit, Continuity and Differentiability of function for several variables. Partial
Derivatives, Euler’s Theorem for Homogeneous functions, Total derivatives, Change of
Variables. Maxima and Minima of several Variables. Methods of Lagrange Multipliers.
Taylor’s and Maclaurin’s Theorem with remainders of several variables.
Unit-3.0 5 hrs.
Vector Calculus: Gradient, Divergence and Curl of a Vector and their Physical
Interpretations, Vector Identities. Directional Derivatives. Line, Surface and Volume
integrals, Application of Green’s, Stokes and Gauss Divergence Theorem (Without
Proof).
Unit-4.0 5 hrs.
First Order Ordinary Differential Equations: Exact, Linear and Bernoulli’s
Equations, Euler’s Equations, Equations not of First Degree: Equations Solvable for P,
Equations Solvable for Y, Equations Solvable for X and Clairaut’s Type.
Unit-5.0 6 hrs.
Ordinary Differential Equations of Higher Orders: Second Order Linear Differential
Equations with Variable Coefficients, Method of Variation of Parameters, Cauchy-
Euler Equation; Power Series Solutions; Legendre Polynomials, Bessel Functions of the
First Kind and their properties.
Unit-6.0 3 hrs.
Partial Differential Equations – First Order: First Order Partial Differential
Equations, Solutions of First Order Linear and Non-Linear PDEs.
Suggested books:
1. Introduction to Algorithms, 4th Edition, Thomas H Cormen, Charles E
Lieserson, Ronald L Rivest and Clifford Stein, MITPress/McGraw-Hill.
2. Horowitz & Sahani, "Fundamental of Computer Algorithm", Galgotia.
3. Basse, "Computer Algorithms: Introduction to Design & Analysis",
Addision Wesley.
Suggested reference books
st
1. Algorithm Design, 1 Edition, Jon Kleinberg and Éva Tardos, Pearson.
2. Algorithm Design: Foundations, Analysis, and Internet Examples, Second
Edition, Michael T Goodrich and Roberto Tamassia, Wiley.
3. Algorithms—A Creative Approach, 3RD Edition, UdiManber, Addison-
Wesley, Reading, MA.

6
B. Tech (Computer Science & Engineering (AI & ML)) Semester- III

Paper Code Technical Writing L T P C


100314 3 0 0 3

Unit-1.0 7 hrs.
Introduction: Fundamentals of Technical Writing: Need for Clear and Concise
Technical Writing, Attributes of Technical Writing, Types of Technical Writing,
Benefits of Technical Writing, Technical, Managerial and General Readers, Expressing
versus Impressing, Correct use of Noun, Pronoun, Verb, Adjective, Adverbs, Tense and
Punctuation.
Unit-2.0 7 hrs.
Performing Technical Studies: Types of Technical Studies, General Methodology-
Proposing a Project, Gathering Background Information, Designing Test Plans,
Performing Experiments, Reporting Results. Writing Strategy: Analysis of Readers,
Scope of Writing, Purpose and Objective. Document Options: Document Hierarchy,
Report Types and Selection. Criteria for Good Technical Writing: Technical Content,
Presentation, Language Skills. Writing Style: Elements of Style, Examples of Writing
Styles, Recommended Style, Learn to Prepare Effective Illustrations.
Unit-3.0 7 hrs.
Formal Reports: The Outline and Introduction (Outline, Title, Front Matter, Writing the
Introduction), Writing the Body (Writing a Procedure, Describing Machines/Processes,
Writing Test Results, Writing the Discussion Section), Closure (Conclusions,
Recommendations, References, Abstract, Back Matter, Report Distribution, Saving
Reports)..
Unit-4.0 7 hrs.
Informal Reports: Elements of an Informal Report, Investigation Reports, Service
Work, Action Letters and Proposals. Typical Memo Reports.
Unit-5.0 7 hrs.
Review and Editing: Types of Review and Edit, Review and Editing Methodology,
Examples of Reviews.
Unit-6.0 7 hrs.
Oral Presentations: Types of Oral Presentations, Preparation, Visual Aids,
Impediments to Technical Writing, Maintaining Writing Skills, Measuring Report
Results.
Suggested books:
1. Engineers’ Guide to Technical Writing‖, Kenneth G. Budinski, ASM International.
2. ―Handbook for Technical Writing‖, James H. Shelton, NTC Contemporary Press
3. ―The Technical Writer's Handbook: Writing With Style and Clarity‖, Matt Young,
University Science Books.

Suggested reference books


1. ―A Guide to Technical Writing‖, T. A. Rickard, Franklin Classics.
2. ―Technical Writing‖, S. Jayprakash, Himalaya Publishing House Pvt. Ltd.
3. ―Technical Writing‖, O. N. Pandey.

7
B. Tech (Computer Science & Engineering (AI & ML)) Semester- III

Paper Code Analog Electronic Circuits Lab L T P C


100302P 0 0 4 2
Hands-on experiments related to the course contents of Analog Electronic Theory.

Paper Code Data Structure & Algorithm Lab L T P C


100304P 0 0 4 2
Hands-on experiments related to the course contents of Data Structure & Algorithm Theory.

Paper Code Object Oriented Programming using C++ L T P C


100313P Lab 0 0 4 2

Hands-on experiments related to the course contents of Object Oriented Programming using C++ Theory.

You might also like