Syllabus 2nd Year Onwards - Student Study Hub

SEMESTER
III
UMA 201- ENGINEERING MATHEMATICS III
L T P
3 1 2
Unit-I
(10)
Infinite Series: Convergence, divergence and oscillation of an infinite
series, comparison test, p-series, D'Alembert's ratio test, logarithmic,
integral test(all test without proof) for series of positive terms.
Numerical analysis. Unit-II (10)
Solution of algebraic and transcendental equations: Bisection method,
method of false position, secant method, Iteration method Newton-
Raphson method, Generalized Newton-Raphson method.
Solution Of Simultaneous Algebraic Equations : Jacobi's method, Gauss-
Seidal method, relaxation method, fixed point iteration & its
convergence, Eigen values by iteration - Power and Jacobi's
Method. Unit-III (10)
Finite Differences & Interpolation: Forward and Backward difference
operators, Newton's Forward and Backward interpolation formulae,
Central Difference Interpolation formulae, Gauss's forward and
Backward Interpolation formulae, Lagrange's interpolation
formulae and Newton's Divided Difference formulae.
Numerical differentiation and integration: Formulae for derivatives,
Trapezoidal rule, Simpson's 1/3rd and 3/8th rules. Unit-IV (10)
Numerical Methods To Solve Differential Equations: Solution of first
order differential equations using Taylor's series, Euler's,
Picard's and Runge Kutta method upto 4th order, Predictor- Corrector
methods (Adam's and Milne's method ), Simultaneous differential
equations of first order, differential equations of second order. Books |Sr. No.|Name of Book |Author |Publisher |
|1 |Numerical Methods in Engg.|B.S.Grewal |Khanna |
| |& Sciences | |Publishers |
|2 |Numerical methods for |M.K.Jain, |Wiley Eastern |
| |Scientific & Engg. |S.R.K.Iyengar & |Ltd |
| |Computations |R.K.Jain | |
|3 |Computer Oriented |U.Rajaramanm |PRENTICE HALL OF|
| |Numerical methods |Orebtuce |INDIA |
|4 |Introduction to Numerical |C.E.Froberg |Addison Wesley |
| |Analysis | | |
|5 |Advanced Engg. Mathematics|Michael D. Greenberg|Pearson |
| | | |Education |
UMA 201- ENGINEERING MATHEMATICS III LAB Programs to be executed using MATLAB 1. Study different tool box available in MATLAB.
2. Roots of a quadratic equation.
3. Factorial Program
4. Write a code snippet using a for loop that creates a sine wave whose
frequency increments from 0 to 1 Hz over 5 seconds. Turn in the code
and a plot.
5. Simulation of an RC circuit.
6. Study different mathematical functions available in MATLAB.
7. I-V characteristic of a MOSFET.
8. Finding average with a dynamic array.
9. Writing and Reading a binary file.
10. Calculator design using MATLAB GUI.
11. To find the roots of non-linear equation using Bisection
method/Muller's method.
12. To find the roots of non-linear equation using Newton's
method/Muller's method.
13. To solve the system of linear equations using Gauss-Elimination
method.
14. To solve the system of linear equations using Gauss-Seidal iteration
method.
15. To solve the system of linear equations using Gauss-Jordan method.
16. To solve integral equation numerically using Trapezoidal rule.
17. To solve integral equation numerically using Simpson's rule.
18. To find numerical solution of ordinary differential equations by
Euler's method.
19. To find numerical solution of ordinary differential equations by Runga-
Kutta method.
20. To solve a given problem using Newton's forward interpolation formula.
UEC-201 DIGITAL ELECTRONICS
L T P
3 1 2 Unit I
(8)
Binary, octal & Hexadecimal number systems and their inter conversion.
Binary arithmetic (Addition & Subtraction, Multiplication & Division), 1's
& 2's complements, 9's & 10's complement, BCD code, BCD Addition, Gray
Code, Error Detection and Correction , Hamming code. Unit-II
(10) Logic functions (OR, AND, NOT, NAND, NOR, XOR), Elements of Boolean Algebra
(Theorems truth tables and relations) Negative & Positive logic, Saturated
& non saturated logic, fan in, fan-out, Logic IC's, de Morgan's Theorem,
minterms and maxterms.
Karnaugh mapping, K-map representation of logical function for 2, 4,5 & 6
variable, simplification of Boolean equations with the help of K-map,
Various minimization techniques, Quine's method and Quines Mc-Cluskey
method, Half adder, full adder, half subtractor, full subtractor, serial
and parallel binary adder. Unit-III
(8) Introduction and performance criteria for logic families, various logic
families - DCTL, RTL, DTL, TTL & EC working and their characteristics in
brief, MOS Gates and CMOS Gates, comparison of various logic families. Unit-IV
(10) Various kinds of Flip-Flop: RS Flip-Flop, Clocked RS Flip-Flop, Edge
triggered D Flip-Flop, Flip-Flop Switching time, J/K Flip-Flop, JK Master
Slave Flip flop. Shift registers: serial in serial out, serial in parallel
out ,parallel in serial out, parallel in parallel out, Ring counters,
asynchronous counters, synchronous counters.
D/A Converter, A/D Converter, Multiplexers and Demultiplexer, Encoder and
Decoder & their applications. Reference BOOKS | |Name of Book |Author |Publisher |
|S. No | | | |
| |Digital Principles & |Malvino and Leach|TMH |
| |Applications | | |
| |Digital Integrated Electronics|Taub and |TMH |
| | |Schilling | |
| |Digital Circuits and Logic |Samuel C Lee |PHI |
| |Design | | |
| |Pulse, Digital and Switching |Millman and Taub.|TMH |
| |Waveforms | | |
| |Modern Digital Electronics |R.P.Jain |TMH |
| |Digital Fundamentals |Floydd |Pearson Education|
UEC-201 DIGITAL ELECTRONICS LAB
LIST OF EXPERIMENTS
1. Verify truth tables of AND, OR, NOT, NAND, NOR and XOR gates.
2. Implement (i) half adder (ii) full adder using AND - OR gates.
3. Implement full adder using NAND gates as two level realization.
4. Implement full subtractor using 8 to 1 multiplexer.
5. Verify truth tables of RS & JK flip flops and convert JK flip fops
into D type & T type flip fops.
6. Realization of Gates( AND, OR, NOT) with discrete components.
7. (a) Use of 4-bit shift register for shift left and shift right
operations.
(b) Use 4-bit shift register as a ring counter.
8. Implement mod - 10 counter and draw its output wave forms.
9. Implement 4-bit DAC using binary weighted resistance technique/R-
2R ladder network technique.
10. Implement 8 - bit ADC using IC (ADC 0800/0801).
ADDITIONAL EXERCISES:
1. Construct bounce less switch.
2. Construct a pulser of 1 Hz and 10 Hz, 1k Hz and manual.
3. Construct logic state detector.
4. Construct opto - sensor based.
a. Measurement rotational speed of motor.
b. Measurement time elapse between two events.
c. Measurement of linear velocity.
d. Measurement of acceleration.
5. Construct a memory using TTL Circuits. Read and write data onto a
memory from bus.
6. Construct a security latch that can be operated by an identity
card.
UCS-200 DATA STRUCTURE & ALGORITHMS WITH C
L T P
3 1 2 Unit-I
(12)
Introduction: Definition, Classification, Operations on data structures,
mathematical notation and functions, Abstract Data Types (ADT), Algorithm,
Efficiency of an Algorithm, Asymptotic notations, Time-Space trade-off.
Arrays: Definition, Single and Multidimensional Arrays, Representation of
Arrays: Row and Column Major Order, Operations on arrays: Insertion,
Traversal, Searching, Deletion, Application of arrays, Sparse Matrices.
Memory Allocation Schemes: Static & Dynamic Memory Allocation schemes,
Dynamic memory allocation functions.
Linked Lists: Need of dynamic data structures, Implementation of lists,
Operations on lists: Insertion, Deletion, Searching, Doubly linked lists,
Operations on Doubly Linked Lists: Insertion, Del