# RGPV Syllabus Of Electronics & Instrumentation Engineering BE 3rd Semester

B.E. 301 – ENGINEERING MATHEMATICS II

**Unit I **

Fourier Series: Introduction of Fourier series , Fourier series for Discontinuous functions, Fourier series for even and odd function, Half range series Fourier Transform: Definition and properties of Fourier transform, Sine and Cosine transform.

**Unit II **

Laplace Transform: Introduction of Laplace Transform, Laplace Transform of elementary functions, properties of Laplace Transform, Change of scale property, second shifting property, Laplace transform of the derivative, Inverse Laplace transform & its properties, Convolution theorem, Applications of L.T. to solve the ordinary differential equations

**Unit III **

Second Order linear differential equation with variable coefficients : Methods one integral is known, removal of first derivative, changing of independent variable and variation of parameter, Solution by Series Method

**Unit IV **

Linear and Non Linear partial differential equation of first order: Formulation of partial differential equations, solution of equation by direct integration, Lagrange’s Linear equation, charpit’s method. Linear partial differential equation of second and higher order: Linear homogeneous and Non homogeneous partial diff. equation of nth order with constant coefficients. Separation of variable method for the solution of wave and heat equations

**Unit V **

Vector Calculus: Differentiation of vectors, scalar and vector point function, geometrical meaning of Gradient, unit normal vector and directional derivative, physical interpretation of divergence and Curl. Line integral, surface integral and volume integral, Green’s, Stoke’s and Gauss divergence theorem

**References **

(i) Advanced Engineering Mathematics by Erwin Kreyszig, Wiley India

(ii) Higher Engineering Mathematics by BS Grewal, Khanna Publication

(iii) Advance Engineering Mathematics by D.G.Guffy

(iv) Mathematics for Engineers by S.Arumungam, SCITECH Publuication

(v) Engineering Mathematics by S S Sastri. P.H.I.

EI- 302 Data Structures and algorithms

**Unit I**

Structural programming, top-down design., abstract data type, implementation of arrays, triangular arrays, structures, character strings, Pointers dynamic memory management.

**Unit II **

Singly linked list, implementation linked list using arrays, implementation of linked list using dynamic memory allocation circular link list, Josphus problem, doubly linked list, polynomial manipulation using linked list, representation of sparse matrices. Stacks – their concepts and implementation, multiple stacks. Conversion of infix to postfix notation using stack, evaluation of postfix expression, recursion, how recursion- works, queues their concepts and implementation, Queue, primary queues, simulation.

**Unit III**

Trees, Binary tree – their representation and operations, tree traversals, threaded binary trees, conversion of general trees to binary trees, binary expression tree, applications of trees. sequential searching, binary search, height balanced tree and weight balanced trees, multiway search trees, digital search, trees, hashing and collision – resolution techniques.

**Unit IV**

Various sorting algorithms viz. bubble sort, selection sort, inserted sort, Quicksort, merge sort, address calculation sort and heap sort, complexity of the algorithm.

**Unit V**

Graphs, terminology, representation of graphs, reachability, minimum path problem, critical events, Graph traversals, spanning trees, application of graph.

References: 1. Data structures using C: By Tannenbaum 2. Data structures: By Trembley Sorenson 3. Data structures using C: By Rajiv Jindal

EI – 303 Digital Circuits and Systems

**Unit I**

Number systems & codes, Binary arithmetic, Boolean algebra and switching function. Minimization of switching function, Concept of prime implicant, Karnaugh map method, Quine & McCluskey’s method, Cases with don’t care terms, Multiple output switching function.

**Unit II**

Introduction to logic gates, Universal gate, Half adder, Half subtractor, Full adder, Full subtractor circuits, Series & parallel addition, BCD adders, Look-ahead carry generator.

**Unit III**

Linear wave shaping circuits, Bistable, Monostable & Astable multivibrator, Schmitt trigger circuits & Schmitt-Nand gates. Logic families: RTL, DTL, All types of TTL circuits, ECL, I2L, PMOS, NMOS & CMOS logic, Gated flip-flops and gated multivibrator, Interfacing between TTL to MOS.

**Unit IV**

Decoders, Encoders, Multiplexers, Demultiplexers, Introduction to various semiconductor memories & designing with ROM and PLA. Introduction to Shift Registers, Counters, Synchronous & asynchronous counters, Designing of Combinational circuits like code converters.

**Unit V**

Introduction of Analog to Digital & Digital to Analog converters, sample & hold circuits and V-F converters.

**References:**

1. M. Mano; “Digital Logic & Computer Design”; PHI.

2. Malvino & Leach; “Digital Principles & Applications”; TMH

3. W.H. Gothman; “Digital Electronics”; (PHI).

4. Millman & Taub; “Pulse, Digital & Switching Waveforms”.(McGraw Hill)

5. R.J. Tocci, “Digital Systems Principles & Applications”.

**List of experiment (Expandable):**

All experiments (wherever applicable) should be performed through the following steps.

Step 1: Circuit should be designed/ drafted on paper.

Step 2: The designed/drafted circuit should be simulated using Simulation S/W (TINA-V7/ PSPICE/ Labview/ CIRCUIT MAKER).

Step 3: The designed/drafted circuit should be tested on the bread board and compare the results with the simulated results.

Step 4: The bread board circuit should be fabricated on PCB prepared on PCB machine.

1. To study and test of operation of all logic gates for various IC’s (IC#7400,IC#7403,IC# 7408,IC#74332,IC#7486).

2. Verification of Demorgan’s theorem.

3. To construct of half adder and full adder

4. To construct of half subtractor and full subtractor circuits

5. Verification of versatility of NAND gate.

6. Verification of versatility of NOR gate.

7. Designing and verification of property of full adder.

8. Design a BCD to excess-3 code converter.

9. Design a Multiplexer/ Demultiplexer.

EI – 304 Measurement Science & Techniques

**Unit I**

Introduction to measurement: Definition, application and types of measurement System, Accuracy, Precision, sensitivity, Resolution, introduction to static and Dynamic Characteristics, Error and uncertainty analysis, Loading effect.

**Unit II**

Electrical measurement: Construction and operation of moving coil, moving iron, hot iron instrument-Ammeter & voltmeter, Theory and Operation of D’arsonval, Ballistic and vibration Galvanometer, instrument transformers. Extension of instrument ranges.

**Unit III**

R, L, C Measurement: Bridges: Measurement of resistance using Wheatstone bridge, Kelvin’s double bridge, Loss of charge method, ohm meter, meggar Measurement of inductance and capacitance by A.C. bridges: Maxwell’s bridge, Anderson bridge, Schering bridge, Hay’s bridge, Wein’s bridge, Shielding and grounding, Q meter.

**Unit IV**

Digital instruments: Advantages of digital instruments, Over analog instruments, D-A, A-D conversion, Digital voltmeter, Ramp type DVM, Integrating DVM, successive approximation DVM, frequency meter. Display devices: CRO-construction and working, deflection, triggering & synchronization, Time, Phase, Frequency measurement. Storage CRO, Sampling CRO, Digital Oscilloscope. Displays (LED, LCD and seven segment etc)

**Unit V**

Signal generator: Function generator, sweep frequency generator, Pulse and square wave generator, Wave Analysers, Harmonic Distortion Analyser, Spectrum Analyser, frequency counter.

**References:**

1. Modem Electronics Instrumentation, Albert D. Cooper, PHI.

2. Electrical and electronic Measurement by A.K.Sawhney

3. Measurement system by Doebelin

4. Electronic Instrumentation – Kalsi – TMH

**List of Experiments (Expandable): **

All experiments (wherever applicable) should be performed through the following steps.

Step 1: Circuit should be designed/ drafted on paper.

Step 2: The designed/drafted circuit should be simulated using Simulation S/W (TINA-V7/ PSPICE/ Labview/ CIRCUIT MAKER).

Step 3: The designed/drafted circuit should be tested on the bread board and compare the results with the simulated results.

Step 4: The bread board circuit should be fabricated on PCB prepared on PCB machine.

1. Experiments to enhance knowledge pertaining to this subject.

EI – 305 Network Analysis

**Unit I**

Introduction to circuit elements R,L,C and their characteristics in terms of linearity & time dependant nature, voltage & current sources controlled & uncontrolled sources KCL and KVL analysis, Nodal & mesh analysis, analysis of magnetically coupled circuits, Transient analysis :- Transients in RL, RC&RLC Circuits, initial conditions, time constants. Steady state analysis- Concept of phasor & vector, impedance & admittance, Network topology, concept of Network graph, Tree, Tree branch & link, Incidence matrix, cut set and tie set matrices, dual networks, Dot convention, coupling co-efficient, tuned circuits, Series & parallel resonance.

**Unit II**

Network Theorems for AC & DC circuits- Thevenins & Norton’s, Superpositions, Reciprocity, Compensation, Substitution, Maximum power transfer, and Millman’s theorem, Tellegen’s theorem, problems with dependent & independent sources.

**Unit III**

Frequency domain analysis – Laplace transform solution of Integro-differential equations, transform of waveform synthesized with step ramp, Gate and sinusoidal functions, Initial & final value theorem, Network Theorems in transform domain

**Unit IV**

Concept of signal spectra, Fourier series co-efficient of a periodic waveform, symmetries as related to Fourier coefficients, Trigonometric & Exponential form of Fourier series.

**Unit V**

Network function & Two port networks – concept of complex frequency, Network & Transfer functions for one port & two ports, poles and zeros, Necessary condition for driving point & transfer function. Two port parameters – Z,Y, ABCD, Hybrid parameters, their inverse & image parameters, relationship between parameters, Interconnection of two ports networks, Terminated two port network.

**References: **

1. M.E. Van Valkenburg, Network Analysis, (PHI)

2. F.F.Kuo, Network Analysis.

3. Mittal GK; Network Analysis; Khanna Publisher

4. Mesereau and Jackson; Circuit Analysis- A system Approach; Pearson.

5. Sudhakar & Pillai; Circuit & Networks- Analysis and Synthesis; TMH

6. Hayt W.H. & J.E. Kemmerly; Engineering Circuit Analysis; TMH

7. Decarlo lin; Linear circuit Analysis; Oxford

8. William D Stanley : Network Analysis with Applications, Pearson Education

9. Roy Choudhary D; Network and systems; New Age Pub

10. Charles K. Alexander & Matthew N.O. Sadiku: Electrical Circuits :TMH

11. Chakraborti :Circuit theory: Dhanpat Rai

12. B.Chattopadhyay & P.C.Rakshit; Fundamental of Electrical circuit theory; S Chand

13. Nilson & Riedel, Electric circuits ;Pearson

**List of experiments (Expandable):**

All experiments (wherever applicable) should be performed through the following steps.

Step 1: Circuit should be designed/ drafted on paper.

Step 2: The designed/drafted circuit should be

simulated using Simulation S/W (TINA-V7/ PSPICE/ Labview/ CIRCUIT MAKER).

Step 3: The designed/drafted circuit should be tested on the bread board and compare the results with the simulated results.

Step 4: The bread board circuit should be fabricated on PCB prepared on PCB machine.

1. To Verify Thevenin Theorem.

2. To Verify Superposition Theorem.

3. To Verify Reciprocity Theorem.

4. To Verify Maximum Power Transfer Theorem.

5. To Verify Millman’s Theorem.

6. To Determine Open Circuit parameters of Two Port Network.

7. To Determine Short Circuit parameters of a Two Port Network.

8. To Determine A,B, C, D parameters of a Two Port Network

9. To Determine h parameters of a Two Port Network

10. To Find Frequency Response of RLC Series Circuit.

11. To Find Frequency Response of RLC parallel Circuit.

EI – 306 Java (Computer Language)

**UNIT-I**

Basic Java Features – C++ Vs JAVA, JAVA virtual machine, Constant & Variables, Data Types, Class, Methods, Objects, Strings and Arrays, Type Casting, Operators, Precedence relations, Control Statements, Exception Handling, File and Streams, Visibility, Constructors, Operator and Methods Overloading, Static Members, Inheritance: Polymorphism, Abstract methods and Classes

**UNIT–II**

Java Collective Frame Work – Data Structures: Introduction, Type-Wrapper Classes for Primitive Types, Dynamic Memory Allocation, Linked List, Stack, Queues, Trees, Generics: Introduction, Overloading Generic Methods, Generic Classes, Collections: Interface Collection and Class Collections, Lists, Array List and Iterator, Linked List, Vector. Collections Algorithms: Algorithm sorts, Algorithm shuffle, Algorithms reverse, fill, copy, max and min Algorithm binary Search, Algorithms add All, Stack Class of Package java. Util, Class Priority Queue and Interface Queue, Maps, Properties Class, Un-modifiable Collections.

**UNIT–III**

Advance Java Features – Multithreading: Thread States, Priorities and Thread Scheduling, Life Cycle of a Thread, Thread Synchronization, Creating and Executing Threads, Multithreading with GUI, Monitors and Monitor Locks. Networking: Manipulating URLs, Reading a file on a Web Server, Socket programming, Security and the Network, RMI, Networking, Accessing Databases with JDBC: Relational Database, SQL, MySQL, Oracle

**UNIT–IV**

Advance Java Technologies – Servlets: Overview and Architecture, Setting Up the Apache Tomcat Server, Handling HTTP get Requests, Deploying a web Application, Multitier Applications, Using JDBC from a Servlet, Java Server Pages (JSP): Overview, First JSP Example, Implicit Objects, Scripting, Standard Actions, Directives, Multimedia: Applets and Application: Loading, Displaying and Scaling Images, Animating a Series of Images, Loading and playing Audio clips

**UNIT–V**

Advance Web/Internet Programming (Overview): J2ME, J2EE, EJB, XML.

References: 1. Deitel & Deitel, ”JAVA, How to Program”; PHI, Pearson. 2. E. Balaguruswamy, “Programming In Java”; TMH Publications 3. The Complete Reference: Herbert Schildt, TMH 4. Peter Norton, “Peter Norton Guide To Java Programming”, Techmedia. 5. Merlin Hughes, et al; Java Network Programming , Manning Publications/Prentice Hall

**List of Program to be perform (Expandable)**

1. Installation of J2SDK

2. Write a program to show Concept of CLASS in JAVA

3. Write a program to show Type Casting in JAVA

4. Write a program to show How Exception Handling is in JAVA

5. Write a Program to show Inheritance and Polymorphism

6. Write a program to show Interfacing between two classes

7. Write a program to Add a Class to a Package

8. Write a program to demonstrate AWT.

9. Write a program to Hide a Class

10. Write a Program to show Data Base Connectivity Using JAVA

11. Write a Program to show “HELLO JAVA ” in Explorer using Applet

12. Write a Program to show Connectivity using JDBC

13. Write a program to demonstrate multithreading using Java.

14. Write a program to demonstrate applet life cycle.

EI -307 Self Study (Internal Assessment)

Objective of Self Study: is to induce the student to explore and read technical aspects of his area of interest / hobby or new topics suggested by faculty.

Evaluation will be done by assigned faculty based on report/seminar presentation and viva.

EI -308 Seminar / Group Discussion(Internal Assessment)

Objective of GD and seminar is to improve the MASS COMMUNICATION and CONVINCING/ understanding skills of students and it is to give student an opportunity to exercise their rights to express themselves.

Evaluation will be done by assigned faculty based on group discussion and power point presentation.

## Recent Comments