VTU B.E 3rd Sem Computer Science Syllabus

Download the Softcopies of the syllabus below [PDF]


Check 4th Sem CS Syllabus

Subject Code : 10MAT31 IA Marks : 25
Hours/Week : 04 Exams Hours : 03
Total Hours : 52 Exam Marks : 100


Convergence and divergence of infinite series of positive terms, definition and illustrative examples*
Periodic functions, Dirichlet’s conditions, Fourier series of periodic functions of period and arbitrary period, half range
Fourier series. Complex form of Fourier Series. Practical harmonic analysis. [7 hours]

Infinite Fourier transform, Fourier Sine and Cosine transforms, properties, Inverse transforms [6 hours]

Various possible solutions of one dimensional wave and heat equations, two dimensional Laplace’s equation by the
method of separation of variables, Solution of all these equations with specified boundary conditions. D’Alembert’s
solution of one dimensional wave equation. [6 hours]

Curve fitting by the method of least squares- Fitting of curves of the form
y = ax + b, y = ax2 + bx + c, y = aebx, y = axb
Optimization: Linear programming, mathematical formulation of linear programming problem (LPP), Graphical method and simplex
method. [7 hours]


Numerical Solution of algebraic and transcendental equations: Regula-falsi method, Newton – Raphson method.
Iterative methods of solution of a system of equations: Gauss-seidel and Relaxation methods. Largest eigen value and
the corresponding eigen vector by Rayleigh’s power method. [6 hours]

Finite differences: Forward and backward differences, Newton’s forward and backward interpolation formulae.
Divided differences – Newton’s divided difference formula, Lagrange’s interpolation formula and inverse interpolation
formula. Numerical integration: Simpson’s one-third, three-eighth and Weddle’s rules (All formulae/rules without proof) [7 hours]

Numerical solutions of PDE – finite difference approximation to derivatives, Numerical solution of two dimensional
Laplace’s equation, one dimensional heat and wave equations [7 hours]

Difference equations: Basic definition; Z-transforms – definition, standard Z-transforms, damping rule, shifting rule,
initial value and final value theorems. Inverse Z-transform. Application of Z-transforms to solve difference equations.
[6 hours]
Note: *In the case of illustrative examples, questions are not to be set.

Text Books:
1. B.S. Grewal, Higher Engineering Mathematics, Latest edition, Khanna Publishers
2. Erwin Kreyszig, Advanced Engineering Mathematics, Latest edition, Wiley Publications.

VTU 3rd Sem Results


(Common to CSE & ISE)
Subject Code: 10CS36 I.A. Marks: 25
Hours/Week: 04 Exam Hours: 03
Total Hours: 52 Exam Marks: 100

UNIT 1     6 Hours
Introduction: Overview of C++, Sample C++ program, Different data types, operators, expressions, and statements,
arrays and strings, pointers & user-defined types Function Components, argument passing, inline functions,
function overloading, recursive functions

UNIT 2     7 Hours
Classes & Objects – I: Class Specification, Class Objects, Scope resolution operator, Access members, Defining
member functions, Data hiding, Constructors, Destructors, Parameterized constructors, Static data members, Functions

UNIT 3     7 Hours
Classes & Objects –II: Friend functions, Passing objects as arguments, Returning objects, Arrays of objects,
Dynamic objects, Pointers to objects, Copy constructors, Generic functions and classes, Applications
Operator overloading using friend functions such as +, – , pre-increment, post-increment, [ ] etc., overloading <<, >>.

UNIT 4     6 Hours
Inheritance – I: Base Class, Inheritance and protected members, Protected base class inheritance, Inheriting
multiple base classes


UNIT 5     6 Hours
Inheritance – II: Constructors, Destructors and Inheritance, Passing parameters to base class constructors,
Granting access, Virtual base classes

UNIT 6     7 Hours
Virtual functions, Polymorphism: Virtual function, Calling a Virtual function through a base class reference,
Virtual attribute is inherited, Virtual functions are hierarchical, Pure virtual functions, Abstract classes, Using
virtual functions, Early and late binding.

UNIT 7     6 Hours
I/O System Basics, File I/0: C++ stream classes, Formatted I/O, I/O manipulators, fstream and the File classes, File operations

UNIT 8     7 Hours
Exception Handling, STL: Exception handling fundamentals, Exception handling options
STL: An overview, containers, vectors, lists, maps.

Text Books:
1. Herbert Schildt: The Complete Reference C++, 4th Edition, Tata McGraw Hill, 2003.

Reference Books:
1. Stanley B.Lippmann, Josee Lajore: C++ Primer, 4thEdition, Pearson Education, 2005.
2. Paul J Deitel, Harvey M Deitel: C++ for Programmers, Pearson Education, 2009.
3. K R Venugopal, Rajkumar Buyya, T Ravi Shankar: Mastering C++, Tata McGraw Hill, 1999.


(Common to CSE & ISE)
Subject Code: 10CS33 I.A. Marks : 25
Hours/Week : 04 Exam Hours: 03 Total
Hours : 52 Exam Marks: 100

UNIT – 1     7 Hours
Digital Principles, Digital Logic: Definitions for Digital Signals, Digital Waveforms, Digital Logic, 7400 TTL
Series, TTL Parameters The Basic Gates: NOT, OR, AND, Universal Logic Gates: NOR, NAND, Positive and
Negative Logic, Introduction to HDL.

UNIT – 2     6 Hours
Combinational Logic Circuits
Sum-of-Products Method, Truth Table to Karnaugh Map, Pairs Quads, and Octets, Karnaugh Simplifications,
Don’t-care Conditions, Product-of-sums Method, Product-of-sums simplifications, Simplification by QuineMcClusky Method, Hazards and Hazard Covers, HDL Implementation Models.

UNIT – 3     6 Hours
Data-Processing Circuits: Multiplexers, Demultiplexers, 1-of-16 Decoder, Encoders, Exclusive-or Gates, Parity
Generators and Checkers, Magnitude Comparator, Programmable Array Logic, Programmable Logic Arrays, HDL
Implementation of Data Processing Circuits

UNIT – 4     7 Hours
Clocks, Flip-Flops: Clock Waveforms, TTL Clock, Schmitt Trigger, Clocked D FLIP-FLOP, Edgetriggered D FLIP-FLOP, Edge-triggered JK FLIP-FLOP, FLIP-FLOP Timing, JK Master-slave FLIP-FLOP,
Switch Contact Bounce Circuits, Various Representation of FLIP-FLOPs, Analysis of Sequential Circuits,
HDL Implementation of FLIP-FLOP


UNIT – 5     6 Hours
Registers: Types of Registers, Serial In – Serial Out, Serial In – Parallel out, Parallel In – Serial Out, Parallel In –
Parallel Out, Universal Shift Register, Applications of Shift Registers, Register Implementation in HDL

UNIT – 6     7 Hours
Counters: Asynchronous Counters, Decoding Gates, Synchronous Counters, Changing the Counter Modulus,
Decade Counters, Presettable Counters, Counter Design as a Synthesis problem, A Digital Clock, Counter
Design using HDL

UNIT – 7     7 Hours
Design of Synchronous and Asynchronous Sequential Circuits: Design of Synchronous Sequential Circuit: Model
Selection, State Transition Diagram, State Synthesis Table, Design Equations and Circuit Diagram,
Implementation using Read Only Memory, Algorithmic State Machine, State Reduction Technique.
Asynchronous Sequential Circuit: Analysis of Asynchronous Sequential Circuit, Problems with
Asynchronous Sequential Circuits, Design of Asynchronous Sequential Circuit, FSM Implementation in HDL

UNIT – 8     6 Hours
D/A Conversion and A/D Conversion: Variable, Resistor Networks, Binary Ladders, D/A Converters, D/A
Accuracy and Resolution, A/D Converter-Simultaneous Conversion, A/D Converter-Counter Method, Continuous
A/D Conversion, A/D Techniques, Dual-slope A/D Conversion, A/D Accuracy and Resolution

Text Book:
1. Donald.P.Leach, Albert Paul Malvino & Goutam Saha: Digital
Principles and Applications, 7thEdition, Tata McGraw Hill, 2010

Reference Books:
1. Stephen Brown, Zvonko Vranesic: Fundamentals of Digital Logic Design with VHDL, 2ndEdition, Tata McGraw Hill, 2005.
2. R D Sudhaker Samuel: Illustrative Approach to Logic Design, Sanguine-Pearson, 2010.
3. Charles H. Roth: Fundamentals of Logic Design, Jr., 5thEdition, Cengage Learning, 2004.
4. Ronald J.Tocci,NealS. Widmer, Gregory L.Moss: Digital Systems Principles and Applications, 10thEdition, Pearson Education, 2007.
5. M Morris Mano: Digital Logic and Computer Design, 10thEdition, Pearson Education, 2008.


(Common to CSE & ISE)
Subject Code: 10CS34 I.A. Marks : 25
Hours/Week : 04 Exam Hours: 03
Total Hours : 52 Exam Marks: 100

UNIT – 1    6 Hours
Set Theory: Sets and Subsets, Set Operations and the Laws of Set Theory, Counting and Venn Diagrams, A First
Word on Probability, Countable and Uncountable Sets

UNIT – 2     7 Hours
Fundamentals of Logic: Basic Connectives and Truth Tables, Logic Equivalence – The Laws of Logic,
Logical Implication – Rules of Inference

UNIT – 3     6 Hours
Fundamentals of Logic contd.: The Use of Quantifiers, Quantifiers, Definitions and the Proofs of

UNIT – 4     7 Hours
Properties of the Integers: Mathematical Induction, The Well Ordering Principle – Mathematical Induction,
Recursive Definitions


UNIT – 5     7 Hours
Relations and Functions: Cartesian Products and Relations, Functions – Plain and One-to-One, Onto
Functions – Stirling Numbers of the Second Kind, Special Functions, The Pigeon-hole Principle, Function
Composition and Inverse Functions

UNIT – 6     7 Hours
Relations contd.: Properties of Relations, Computer Recognition – Zero-One Matrices and Directed Graphs, Partial
Orders – Hasse Diagrams, Equivalence Relations and Partitions

UNIT – 7     6 Hours
Groups: Definitions, Examples, and Elementary Properties, Homomorphisms, Isomorphisms, and
Cyclic Groups, Cosets, and Lagrange’s Theorem. Coding Theory and Rings: Elements of Coding Theory,
The Hamming Metric, The Parity Check, and Generator Matrices

UNIT – 8     6 Hours
Group Codes: Decoding with Coset Leaders, Hamming Matrices
Rings and Modular Arithmetic: The Ring Structure – Definition and Examples, Ring Properties and
Substructures, The Integers Modulo n

Text Book:
1. Ralph P. Grimaldi: Discrete and Combinatorial Mathematics, , 5th Edition, Pearson Education, 2004.
(Chapter 3.1, 3.2, 3.3, 3.4, Appendix 3, Chapter 2, Chapter 4.1, 4.2, Chapter 5.1 to 5.6, Chapter 7.1 to 7.4,
Chapter 16.1, 16.2, 16.3, 16.5 to 16.9, and Chapter 14.1, 14.2, 14.3).

Reference Books:
1. Kenneth H. Rosen: Discrete Mathematics and its Applications, 7thEdition, McGraw Hill, 2010.
2. Jayant Ganguly: A Treatise on Discrete Mathematical Structures, Sanguine-Pearson, 2010.
3. D.S. Malik and M.K. Sen: Discrete Mathematical Structures: Theory and Applications, Cengage
Learning, 2004.
4. Thomas Koshy: Discrete Mathematics with Applications, Elsevier, 2005, Reprint 2008.


(Common to CSE & ISE)
Subject Code: 10CS35 I.A. Marks : 25
Hours/Week : 04 Exam Hours: 03
Total Hours : 52 Exam Marks: 100

UNIT – 1     8 Hours
BASIC CONCEPTS: Pointers and Dynamic Memory Allocation, Algorithm Specification, Data
Abstraction, Performance Analysis, Performance Measurement

UNIT – 2     6 Hours
ARRAYS and STRUCTURES: Arrays, Dynamically Allocated Arrays, Structures and Unions, Polynomials,
Sparse Matrices, Representation of Multidimensional Arrays

UNIT – 3     6 Hours
STACKS AND QUEUES: Stacks, Stacks Using Dynamic Arrays, Queues, Circular Queues Using Dynamic
Arrays, Evaluation of Expressions, Multiple Stacks and Queues.

UNIT – 4     6 Hours
LINKED LISTS: Singly Linked lists and Chains, Representing Chains in
C, Linked Stacks and Queues, Polynomials, Additional List operations, Sparse Matrices, Doubly Linked Lists


UNIT – 5     6 Hours
TREES – 1: Introduction, Binary Trees, Binary Tree Traversals, Threaded Binary Trees, Heaps.

UNIT – 6     6 Hours
TREES – 2, GRAPHS: Binary Search Trees, Selection Trees, Forests, Representation of Disjoint Sets,
CountinBinary Trees, The Graph Abstract Data Type.

UNIT – 7     6 Hours
PRIORITY QUEUES Single- and Double-Ended Priority Queues, Leftist Trees, Binomial Heaps, Fibonacci
Heaps, Pairing Heaps

UNIT – 8     8 Hours
EFFICIENT BINARY SEARCH TREES: Optimal Binary Search Trees, AVL Trees, Red-Black Trees, Splay Trees.

Text Book:
1. Horowitz, Sahni, Anderson-Freed: Fundamentals of Data Structures in C, 2nd
Edition, Universities Press, 2007. (Chapters 1, 2.1 to 2.6, 3, 4, 5.1 to 5.3, 5.5 to 5.11,
6.1, 9.1 to 9.5,10)

Reference Books:
1. Yedidyah, Augenstein, Tannenbaum: Data Structures Using C and C++, 2ndEdition, Pearson Education, 2003.
2. Debasis Samanta: Classic Data Structures, 2nd Edition, PHI, 2009.
3. Richard F. Gilberg and Behrouz A. Forouzan: Data Structures A Pseudocode Approach with C,
Cengage Learning, 2005.
4. Robert Kruse & Bruce Leung: Data Structures & Program Design in C, Pearson Education, 2007


Subject Code : 10CS32 I.A. Marks : 25
Hours/Week : 04 Exam Hours : 03
Total Hours : 52 Exam Marks : 100


UNIT – 1        7 Hours

Transistors, UJTs, and Thyristors: Operating Point, Common-Emitter Configuration, Thermal Runaway, Transistor Switch,
Unijunction, Transistors, SCR.

UNIT – 2        6 Hours
Field Effect Transistors: Bipolar Junction Transistors versus Field Effect Transistors, Junction Field Effect Transistors,
Metal Oxide Field Effect Transistors, Differences between JFETs and MOSFETs, Handling MOSFETs, Biasing MOSFETs, FET
Applications, CMOS Devices, Insulated Gate Bipolar Transistors (IGBTs)

UNIT – 3        6 Hours
Optoelectronic Devices: Introduction, Photosensors, Photoconductors, Photodiodes, Phototransistors, Light-Emitting
Diodes, Liquid Crystal Displays, Cathode Ray Tube Displays, Emerging Display Technologies, Optocouplers

UNIT – 4        7 Hours
Small Signal Analysis of Amplifiers: Amplifier Bandwidth: General Frequency Considerations, Hybrid h-Parameter Model
for an Amplifier, Transistor Hybrid Model, Analysis of a Transistor Amplifier using complete h-Parameter Model, Analysis
of a Transistor Amplifier Configurations using Simplified h-Parameter Model (CE configuration only), Small-Signal
Analysis of FET Amplifiers, Cascading Amplifiers, Darlington Amplifier, Low-Frequency Response of Amplifiers (BJT
amplifiers only).


UNIT – 5      6 Hours
Large Signal Amplifiers, Feedback Amplifier: Classification and characteristics of Large Signal Amplifiers, Feedback
Amplifiers: Classification of Amplifiers, Amplifier with Negative Feedback, Advantages of Negative Feedback, Feedback
Topologies, Voltage-Series (Series-Shunt) Feedback, Voltage-Shunt (Shunt-Shunt) Feedback, Current-Series (SeriesSeries) Feedback, Current-Shunt (Shunt-Series) Feedback.

UNIT – 6      7 Hours
Sinusoidal Oscillators, Wave-Shaping Circuits: Classification of Oscillators, Conditions for Oscillations: Barkhausen
Criterion, Types of Oscillators, Crystal Oscillator, Voltage-Controlled Oscillators, Frequency Stability. Wave-Shaping
Circuits: Basic RC Low-Pass Circuit, RC Low-Pass Circuit as Integrator, Basic RC High-Pass Circuit, RC High-Pass Circuit as
Differentiator, Multivibrators, Integrated Circuit (IC) Multivibrators.

UNIT – 7     7 Hours
Linear Power Supplies, Switched mode Power Supplies: Linear Power Supplies: Constituents of a Linear Power Supply,
Designing Mains Transformer; Linear IC Voltage Regulators, Regulated Power Supply Parameters.
Switched Mode Power Supplies: Switched Mode Power Supplies, Switching Regulators, Connecting Power Converters in
Series, Connecting Power Converters in Parallel

UNIT – 8     6 Hours
Operational Amplifiers: Ideal Opamp versus Practical Opamp, Performance Parameters, Some Applications: Peak
Detector Circuit, Absolute Value Circuit, Comparator, Active Filters, Phase Shifters, Instrumentation Amplifier, NonLinear Amplifier, Relaxation Oscillator, Current-To-Voltage Converter, Voltage-To-Current Converter, Sine Wave

Text Book:
1. Anil K Maini, Varsha Agarwal: Electronic Devices and Circuits, Wiley, 2009.
(4.1, 4.2, 4.7, 4.8, 5.1 to 5.3, 5.5, 5.6, 5.8, 5.9, 5.13, 5.14, 6.1, 6.3, 7.1 to 7.5, 7.10 to 7.14, Listed topics only from 8, 10.1,
11, 12.1, 12.2, 12.3, 12.5, 13.1 to 13.6, 13.9, 13.10, 14.1, 14.2, 14.6, 14.7, 15.1, 15.5 to 15.7. 16.3, 16.4, 17.12 to 17.22)

Reference Books:
1. Jacob Millman, Christos Halkias, Chetan D Parikh: Millman’s Integrated Electronics – Analog and Digital Circuits and
Systems, 2nd Edition, Tata McGraw Hill, 2010.
2. R. D. Sudhaker Samuel: Electronic Circuits, Sanguine-Pearson, 2010.


(Common to CSE & ISE)
Subject Code : 10CSL37 I.A. Marks : 25
Hours/Week : 03 Exam Hours : 03
Total Hours : 42 Exam Marks : 50

1. Using circular representation for a polynomial, design, develop, and execute a program in C to accept
two polynomials, add them, and then print the resulting polynomial.

2. Design, develop, and execute a program in C to convert a given valid parenthesized infix arithmetic
expression to postfix expression and then to print both the expressions. The expression consists of
single character operands and the binary operators + (plus), – (minus), * (multiply) and / (divide).

3. Design, develop, and execute a program in C to evaluate a valid postfix expression using stack. Assume
that the postfix expression is read as a single line consisting of non-negative single digit operands and
binary arithmetic operators. The arithmetic operators are + (add), – (subtract), * (multiply) and / (divide).

4. Design, develop, and execute a program in C to simulate the working of a queue of integers using an
array. Provide the following operations:
a) Insert
b) Delete
c) Display
5. Design, develop, and execute a program in C++ based on the following requirements; An EMPLOYEE
class is to contain the following data members and member functions:
Data members:
Employee_Number (an integer),
Employee_Name (a string of characters),
Basic_Salary (an integer),
All_Allowances (an integer),
IT (an integer),
Net_Salary (an integer).
Member functions:
To read the data of an employee, to calculate Net_Salary and to print the values of all the data
All_Allowances=123% of Basic,
Income Tax (IT)=30% of the gross salary (= basic_Salary_All_Allowance),
Net_Salary = Basic_Salary + All_Allowances – IT)

6. Design, develop, and execute a program in C++ to create a class called STRING and implement the
following operations. Display the results after every operation by overloading the operator <<.
i) STRING s1 = “VTU”
iii) STIRNG s3 = s1 + s2; (Use copy constructor)

7. Design, develop, and execute a program in C++ to create a class called STACK using an array of integers and to implement the following operations by overloading the operators + and – ;

i) s1=s1 + element; where s1 is an object of the class STACK and element is an integer to be pushed on
to top of the stack.
ii) s1=s1- ; where s1 is an object of the class STACK and – operator pops off the top element. Handle
the STACK Empty and STACK Full conditions. Also display the contents of the stack after each
operation, by overloading the operator <<.

8. Design, develop, and execute a program in C++ to create a class called LIST (linked list) with member
functions to insert an element at the front of the list as well as to delete an element from the front of
the list. Demonstrate all the functions after creating a list object.

9. Design, develop, and execute a program in C to read a sparse matrix of integer values and to search the
sparse matrix for an element specified by the user. Print the result of the search appropriately. Use the
triple <row, column, value> to represent an element in the sparse matrix.

10. Design, develop, and execute a program in C to create a max heap of integers by accepting one element
at a time and by inserting it immediately in to the heap. Use the array representation for the heap.
Display the array at the end of insertion phase.

11. Design, develop, and execute a program in C to implement a doubly linked list where each node
consists of integers. The program should support the following operations;
i) Create a doubly linked list by adding each node at the front.
ii) Insert a new node to the left of the node whose key value is read as an input.
iii) Delete the node of a given data if it is found, otherwise display appropriate message.
iv) Display the contents of the list. (Note; Only either (a,b and d) or (a, c and d) may be asked in the

12. Design, develop, and execute a program in C++ to create a class called DATE with methods to accept
two valid dates in the form dd/mm/yy and to implement the following operations by overloading the
operators + and -. After every operation the results are to be displayed by overloading the operator <=d2 and no_of_days is an integer.
ii) d2 = d1 + no_of_days; where d1 is a DATE object and no_of_days is an integer.

13. Design, develop, and execute a program in C++ to create a class called OCTAL, which has the
characteristics of an octal number. Implement the following operations by writing an appropriate
constructor and an overloaded operator +.
i) OCTAL h = x; where x is an integer.
ii) int y = h + k; where h is an OCTAL object and k is an integer. Display the OCTAL result by overloading
the operator < 14. Design, develop, and execute a program in C++ to create a class called BIN_TREE that represents a
Binary Tree, with member functions to perform inorder, preorder and postorder traversals. Create a
BIN_TREE object and demonstrate the traversals.
Note: In the examination each student picks one question from a lot of all the 14 questions


(Common to CSE & ISE)
Subject Code : 10CSL38 IA Marks : 25
Hours/Week : 03 Exam Hours : 03
Total Hours : 42 Exam Marks : 50

1. a) Design and construct a suitable circuit and demonstrate the working of positive clipper, double-ended clipper
and positive clamper using diodes.
b) Demonstrate the working of the above circuits using a simulation package.

2. a) Design and construct a suitable circuit and determine the frequency response, input impedance, output
impedance, and bandwidth of a CE amplifier.
b) Design and build the CE amplifier circuit using a simulation package and determine the voltage gain for two
different values of supply voltage and for two different values of emitter resistance.

3. a) Design and construct a suitable circuit and determine the drain characteristics and transconductance
characteristics of an enhancement-mode MOSFET.
b) Design and build CMOS inverter using a simulation package and verify its truth table.

4. a) Design and construct a Schmitt trigger using Op-Amp for given UTP and LTP values and demonstrate its working.
b) Design and implement a Schmitt trigger using Op-Amp using a simulation package for two sets of UTP and LTP
values and demonstrate its working.

5. a) Design and construct a rectangular waveform generator (OpAmp relaxation oscillator) for given frequency and
demonstrate its working.
b) Design and implement a rectangular waveform generator (OpAmp relaxation oscillator) using a simulation
package and demonstrate the change in frequency when all resistor values are doubled.

6. Design and implement an astable multivibrator circuit using 555 timer for a given frequency and duty cycle.


7. a) Given a 4-variable logic expression, simplify it using Entered Variable Map and realize the simplified logic
expression using 8:1 multiplexer IC.
b) Design and develop the Verilog /VHDL code for an 8:1 multiplexer. Simulate and verify its working.

8. a) Realize a J-K Master / Slave Flip-Flop using NAND gates and verify its truth table.
b) Design and develop the Verilog / VHDL code for D Flip-Flop with positive-edge triggering. Simulate and verify its

9. a) Design and implement a mod-n (n<8) synchronous up counter using J-K Flip-Flop ICs and demonstrate its working.

b) Design and develop the Verilog / VHDL code for mod-8 up counter. Simulate and verify its working.

10. a) Design and implement a ring counter using 4-bit shift register and demonstrate its working.
b) Design and develop the Verilog / VHDL code for switched tail counter. Simulate and verify its working.

11. Design and implement an asynchronous counter using decade counter IC to count up from 0 to n (n<=9) and
demonstrate its working.

12. Design and construct a 4-bit R-2R ladder D/A converter using OpAmp. Determine its accuracy and resolution.


1. In the examination, each student picks one question from the lot of questions, either from Part-A or from Part-B.
About half the students in the batch are to get a question from PartA while the rest are to get the question from Part-B.
2. Any simulation package like MultiSim / Pspice etc may be used.

Download Softcopies of Computer Science 3rd Semester 2006 Syllabus below

9 Responses

Leave a reply