SVIET STUDENT ZONE

Probability, Statistics & Queuing Theory

Instruction: 3 Periods & 1 Tut /week

Univ. Exam : 3 Hours

Sessional Marks: 30

Univ-Exam-Marks:70

Probability: Definitions of probability, Addition theorem, Conditional probability,Multiplication theorem, Bayes theorem of probability and Geometric probability.

Random variables and their properties, Discrete Random variable, Continuous Randomvariable, Probability Distribution joint probability distributions their properties,Transformation variables, Mathematical expectations, probability generating functions.

Probability Distributions / Discrete distributions: Binomial, Poisson Negative binominaldistributions and their properties. (Definition, mean, variance, moment generatingfunction., Additive properties, fitting of the distribution.)

Continuous distributions: Uniform, Normal, exponential distributions and their roperties.Curve fitting using Principle of Least Squares.

Multivariate Analysis: Correlation, correlation coefficient, Rank correlation, RegressionAnalysis, Multiple Regression, Attributes, coefficient of Association, X² – test forgoodness of fit, test for independence.

Sample, populations, statistic, parameter, Sampling distribution, standard error,unbiasedness, efficiency, Maximum likelihood estimator, notion & interval estimation.Testing of Hypothesis: Formulation of Null hypothesis, critical region, level ofsignificance, power of the test.

Small Sample Tests: Testing equality of .means, testing equality of variances, test ofcorrelation coefficient, test for Regression Coefficient.

Large Sample tests: Tests based on normal distribution

Queuing theory: Queue description, characteristics of a queuing model, study statesolutions of M/M/1: α Model, M/M/1 ; N Model.

Text Book:

Probability, Statistics and Random Processes by T.Veerarajan, Tata McGraw Hill

Reference Book:

Probability & Statistics with Reliability, Queuing and Computer Applications by Kishor S. Trivedi , Prentice Hall of India ,1999

Elements of Electrical Engineering

Instruction: 3 Periods & 1 Tut /week

Univ. Exam : 3 Hours

Sessional Marks: 30

Univ-Exam-Marks:70

Magnetic circuits: Definitions of magnetic circuit, Reluctance, Magneto-motive force), magnetic flux, Simple problems on magnetic circuits, Hysterisis loss.

Electromagnetic Induction : Faraday’s laws of Electromagnetic Induction, Induced E.M.F., Dynamically induced E.M.F., Statistically induced EMF, Self Inductance, Mutual Inductance.

D.C. Generators: D.C.Generator principle, construction of D.C. generator, E.M.F equation of D.C. generator, Types of D.C. generator, Efficiency, Characteristics of D.C. generator, Efficiency, Applications of D.C. generator

D.C. Motors: D.C. Motor principle, working of D.C.Motors. significance of back E.M.F., Torque equation of D.C. Motors, Types of D.C. Motors, Characteristics of D.C. Motors, Speed control methods of D.C. Motors, Applications of D.C. Motor. Testing of D.C. Machines : Losses and Efficiency, Direct load test and Swinburne’s test.

A.C. Circuits: Introduction to Steady State Analysis of A.C. Circuits, Single and Balanced 3 Phase Circuits.

Transformers: Transformer principle, EMF equation of transformer, Transformer on load, Equivalent circuit of Transformer, Voltage regulation of Transformer, Losses in a Transformer, Calculation of Efficiency and Regulation by Open circuit and Short circuit Tests.

Three phase Inductance Motor: Induction Motor working principle. Construction of 3 Phase induction Motor, Principle of operation. Types of 3 phase induction Motor., Torque Equation of Induction Motor., slip – Torque characteristics., Starting Torque, Torque under running condition., Maximum Torque Equation., Power stages of Induction Motor., Efficiency Calculation of Induction Motor by direct loading.

Alternator: Alternator working principle, EMF equation of Alternator, Voltage Regulation by Sync. Impedance method.

Synchronous Motor: Synchronous Motor principle of Operation, Construction., Methods of starting of synchronous motor

Text Book:

"Elements of Electrical Engineering and Electronics" by V.K.Mehta, S. Chand & Co

Reference Book:

"A First Course in Electrical Engineering" by Kothari.

Electronics

Second year - First Semester

Instruction: 3 Periods & 1 Tut /week

Univ. Exam : 3 Hours

Sessional Marks: 30

Univ-Exam-Marks:70

I. Semiconductors :

Electronic Emission from metal carrier concentration in an intrinsic Semiconductors open circuited PN junction – diffusion.

II. PN Junction Diode :

PN Junction Diode, VI Characteristics of PN Junction Diode, capacitate effects in PN Junction Diode, Quantitative theory of PN Junction Diode.

III. Special Devices:

Principles, Working of zero diode, Tunnel diode, Varactor diode, Schottky diode, SCR and UJT.

IV. Transistors:

The bipolar junction Transistor – Operation of PNP and NPN Transistors – Transistor Circuit configurations- characteristics of a CE configurations – h parameter, low frequency small signal equivalent circuit of a Transistor.

V. Transistor Biasing and thermal stabilization:

Transistor Biasing, stabilization, Different methods of transistor biasing – Fixed bias, Collector feedback bias – self bias – Bias compensation.

VI. Field Effect Transistors:

Junction Field Effect Transistors (JFET) – JFET characteristics, JFET Parameters, Small equivalent circuit – MOSFETS – Depletion and Enhancement MOSFETS.

VII. Rectifying circuits:

Half wave and full wave rectifiers – Bridge rectifiers – rectifier efficiency, Ripple and regulation – Shunt capacitor filter – Zener regulation.

VIII. Transistor Amplifiers:

CE, CB, CC amplifier configurations – Analysis using h- parameters – Multistage amplifier – RC coupled amplifier – frequency response curve and bandwidth.

Text Book:

Electronic Device and Circuits by Sanjeev Gupth.

Reference:

Integrated Electronics by Millman & Halkias.

Data Structures Lab

Instruction: 3 Periods / week

Univ. Exam : 3 Hours

Sessional Marks: 50

Univ-Exam-Marks: 50

1. Write a program to implement the operations on stacks.

2. Write a program to implement the operations on circular queues

3. Write a program for sorting a list using Bubble sort and then apply binary search.

4. Write a program to create a binary search tree and for implementing the in order, preorder, post order traversal using recursion

5. Write a program for finding the Depth First Search of a graph, and Breadth First Search of a graph

6. Write a program for converting a given infix expression to postfix form

7. Write a program for evaluating a given postfix expression

8. Write a program for implementing the operations of a dequeue

9. Write a program for the representation of polynomials using circular linked list and for the addition of two such polynomials

10. Write a program for quick sort

11. Write a program for Heap sort

12. Write a program for Merge sort.

13. a) Write a program for finding the transitive closure of a digraph

b) Write a program for finding the shortest path from a given source to any vertex in a digraph using Dijkstra’s algorithm

Electronics Lab

Instruction: 3 Periods / week
Univ. Exam : 3 Hours
Sessional Marks: 50
Univ-Exam-Marks: 50

1. P-N Junction Diode Characteristics
2. Zener diode Characteristics
3. Transistor as Switch
4. CE characteristics
5. CE Amplifier
6. FET Characteristics
7. Half-Wave Rectifier
8. Full-Wave Rectifier