school of electrical and computing

SCHOOL

OF

ELECTRICAL AND COMPUTING

DEPARTMENT OF

ELECTRICAL & ELECTRONICS

ENGINEERING

Students Handbook

For

B.Tech IV Semester

Academic Year (2015-2016)

2

VISION AND MISSION OF THE DEPARTMENT

Vision:

To make the department as a centre of excellence in electrical & Electronic

Engineering and make the students to gain in-depth knowledge, and thereby

making them to develop confidence in Research & Development activities for

nation building.

Mission:

To develop full-fledged engineers in the field of Electrical and

Electronics Engineering with an excellent knowledge suitable for

making a successful career either in industry/research or higher

education.

To develop students for Serving society and consolidating the principles

of creative scientific, intellectual investigations and to contribute in

fabricating and developing knowledge in nation building.

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs):

1. Will design, analyze electrical / electronic equipment, system using the

knowledge of Mathematics and Engineering

2. Will provide practical solution to real time industrial & research problems

and pursue higher studies.

3. Will work effectively as individual, teams in various engineering

industries & government enterprises.

4. Will be life long learners & following ethical codes & laid down norm in

their profession.

3

INDEX

S.NO CONTENTS PAGE

NO

List of Courses 7

Academic Schedule 8

1 Course code: U4MAB03

Course Name: Numerical Methods 9

Preamble 9

Pre-requisites 9

Links to other courses 9

Course Educational Objectives 9

Course Outcomes 10

Correlation of COs with Programme

outcomes 10

Syllabus 11

Lecture Plan 13

Revised Bloom’s based Assessment Pattern 17

Sample assessment questions 18

Model Question Paper 19

2 Course Code: U4EEB08

Course Name: AC Machines 23

Preamble 23

Pre-requisites 23



Course Outcomes 24


outcomes 24

Syllabus 25

Lecture Plan 27




4

S.NO CONTENTS PAGE

NO

3 Course code: U4EEB18

Course Name: Digital Logic Circuits 37

Preamble 37

Pre-requisites 37



Course Outcomes 37


outcomes 37

Syllabus 38

Lecture Plan 40





Course Name: Linear Control Systems 48

Preamble 48

Pre-requisites 48



Course Outcomes 49


outcomes 49

Syllabus 50

Lecture Plan 51




5

S.NO CONTENTS PAGE NO

5 Course code: U4CSB01

Course Name: Data Structures & C Programming 60

Preamble 60

Pre-requisites 60



Course Outcomes 60


outcomes 61

Syllabus 61

Lecture Plan 63




6

Course code: U4MEB55

Course Name: Applied Thermodynamics and fluid

Mechanics

73

Preamble 73

Pre-requisites 73



Course Outcomes 73


outcomes 74

Syllabus 74

Lecture Plan 76




6

S.NO CONTENTS PAGE

NO


Course Name: AC Machines lab 85

Preamble 85

Pre-requisites 85



Course Outcomes 86


outcomes 86

Syllabus 87




Course Name: Control Systems lab 90

Preamble 90

Pre-requisites 90



Course Outcomes 91


outcomes 91

Syllabus 92



9

Course code: U4CSB05

Course Name: Data Structure & C Programming

Lab

95

Preamble 95

Pre-requisites 95



Course Outcomes 95


outcomes 96

Syllabus 96



7

B.TECH ELECTRICAL AND ELECTRONICS ENGINEERING

CURRICULUM & SYLLABUS (REGULATIONS B - 2013)

SEMESTER IV

L – Lecture; T – Tutorial; P – Practical; C – Credit

Code No Subjects L T P C

Theory

U4MAB03 Numerical Methods 3 1 0 4

U4EEB08 AC Machines 3 1 0 4

U4EEB18 Digital Logic Circuits 3 0 0 3

U4EEB10 Linear Control Systems 3 1 0 4

U4CSB01 Data Structures & C

programming 3 0 0 3

U4MEB55 Applied Thermodynamics

and fluid Mechanics 3 0 0 3

Practical

U4EEB12 AC Machines lab 0 0 3 2

U4EEB13 Control Systems lab 0 0 3 2

U4CSB05 Data Structures and C

Programming lab 0 0 3 2

Total Credits 27

8

ACADEMIC SCHEDULE

VEL TECH RANGARAJAN Dr.SAGUNTHALA

R&D INSTITUTE OF SCIENCE AND TECHNOLOGY

REVISED ACADEMIC CALENDAR FOR

EVEN SEMESTER ( YEAR 2015-2016 )

Dated - 8th Dec 2015

B.TECH DEGREE

COMMENCEMENT OF 4TH SEM 6TH SEM 8TH SEM

CLASS WORK 6-Jan-16 6-Jan-16 2-Jan-16

UNIT TEST - 1 1-Feb-16 1-Feb-16 NA

MID TERM TEST - 1 /

PROJECT REVIEW 1 22-Feb-16 22-Feb-16 25-Jan-16

MODEL-PRACTICAL-1

/ PROJECT REVIEW -2 29-Feb-16 29-Feb-16 22-Feb-16

UNIT TEST -2 /

PROJECT REVIEW -3 14-Mar-16 14-Mar-16 18-Mar-16

MODEL-PRACTICAL-2

/ PROJECT REVIEW -4 4-Apr-16 4-Apr-16 11-Apr-16

MID TERM TEST - 2 18-Apr-16 18-Apr-16 NA

LAST

INSTRUCTIONAL DAY 30-Apr-16 30-Apr-16 25-Apr-16

EXAMINATIONS

COMMENCEMENT OF

SEMESTER END

PRACTICAL EXAM

4-May-16 4-May-16

END SEM

VIVA VOCE

26-APR-2016

COMMENCEMENT OF

SEMESTER END

THEORY EXAM

9-May-16 9-May-16

DECLARATION OF

RESULTS 6-Jun-16 6-Jun-16 5-May-16

COMMENCEMENT OF

CLASSES FOR NEXT

ACADEMIC YEAR

27-Jun-16 27-Jun-16 NA

LIST OF PUBLIC

HOLIDAYS

AS PER TAMIL NADU STATE

GOVERNMENT PUBLIC HOLIDAYS

NOTE: Academic Calendar is prepared considering 90 Instructional

days per semester

Saturdays will be working except Second Saturdays

9

U4MAB03 NUMERICAL METHODS

1. PREAMBLE

This course provides an introduction to the basic concepts and techniques

of numerical solution of algebraic equation, system of algebraic equation,

numerical solution of differentiation, integration, statistical and ANOVA

methods and their inter- relations and applications to computer science and

engineering, and science areas and develops problem solving skills with

both theoretical and computational oriented problems.

2. PRE-REQUISITE:

Engineering Mathematics-I, Engineering Mathematics-II, Transforms and

Partial Differential Equations.

3. RELATED COURSES

Power system Analysis, power system operation & control and allied

subjects related numerical interpolation and transcendental equation.

4. COURSE EDUCATIONAL OBJECTIVES:

Students under going this course are expected

To develop the mathematical skills of the students in the areas of

numerical methods.

To teach theory and applications of numerical methods in a large number

of engineering subjects which require solutions of linear systems, finding

eigen values, eigenvectors, interpolation and applications, solving ODEs,

PDEs and dealing with statistical problems like testing of hypotheses.

To lay foundation of computational mathematics for post-graduate

courses, specialized studies and research.

L T P C

3 1 0 4

10

5. COURSE OUTCOMES:

On successful completion of this course the students will be able to

CO

Nos. Course Outcomes

Level of learning

domain (Based on

revised Bloom’s

taxonomy)

C01

Apply numerical methods to find our

solution of algebraic equations using

different methods under different conditions,

and numerical solution of system of algebraic

equations.

K3

C02 Apply various interpolation methods and

finite difference concepts. K3

C03

Work out numerical differentiation and

integration whenever and wherever routine

methods are not applicable.

K3

C04

Work numerically on the ordinary

differential equations using different methods

through the theory of finite differences.

K3

C05

Work numerically on the partial differential

equations using different methods through

the theory of finite differences.

K3

6. CORRELATION WITH PROGRAM OUTCOMES:

Course

Out

comes

Program Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 H H L M

CO2 H H L M

CO3 H H L M

CO4 H H L M

CO5 H H L M

11

7. SYLLABUS

UNIT I -SOLUTION OF TRANSCENDENTAL EQUATIONS AND

EIGENVALUE PROBLEMS 9+3

Solution of equations – iteration method – Newton-Raphson Method – solution

of linear system by Gaussian elimination and Gauss-Jordan method – iterative

methods – Gauss-Jacobi and Gauss-Seidel methods – inverse of a matrix by

Gauss-Jordon method –finding the eigenvalues of a matrix by power method

UNIT II -INTERPOLATION 9+3

Lagrangian interpolating polynomials – interpolation with equal intervals –

Newton’s forward and backward difference formulae – central difference

formulae – interpolation with unequal intervals – divided differences –

Newton’s divided difference formula.

UNIT III -NUMERICAL DIFFERENTIATION AND INTEGRATION

9+3

Differentiation using interpolation formulae – numerical integration by

trapezoidal and Simpson’s 1/3 and 3/8 rules – Romberg’s method – two and

three point Gaussian quadrature formulae – double integrals using trapezoidal

and Simpson’s rules.

UNIT IV -NUMERICAL SOLUTION OF ORDINARY DIFFERENTIAL

EQUATIONS 9+3

Single-step methods – Taylor series method – Euler method for first order

equation – Fourth order Runge-Kutta method for solving first and second order

equations – multi-step methods – Milne’s and Adam’s predictor and corrector

methods

UNIT V- NUMERICAL SOLUTION OF PARTIAL DIFFERENTIAL

EQUATIONS 9+3

Classification of second order PDE - finite-difference approximations to partial

derivatives – solution of Laplace and Poisson equations – solution of one-

dimensional heat equation – solution of two-dimensional heat equation -

solution of wave equation.

Total : 45+15(Tutorial) = 60 periods

12

7.1 Text Books

1. S.S. Sastry, Introductory Methods of Numerical Analysis, 4th edition, PHI

Learning Private Limited, New Delhi, 2007.

2. B.S. Grewal and J.S. Grewal, Numerical Methods in Engineering and

Science, 6th edition, Khanna Publishers, New Delhi, 2004.

3. John H. Mathews and Kurtis D. Fink, Numerical Methods using

MATLAB, 4th edition, PHI Learning Private Limited, New Delhi, 2007.

4. C.F. Gerald and P.O. Wheatley, Applied Numerical Analysis, 6th edition,

Pearson Education, Asia, New Delhi, 2006.

7.2 Reference Books

1. A.K. Ray and K.M.Burchandi, Intel Microprocessors Architecture

Programming and Interfacing, McGraw Hill International Edition, 2000

2. Kenneth J Ayala, The 8051 Microcontroller Architecture Programming

and Application, 2nd Edition, Penram International Publishers (India),

New Delhi, 1996.

3. M. Rafi Quazzaman, Microprocessors Theory and Applications: Intel and

Motorola prentice Hall of India, Pvt. Ltd., New Delhi, 2003.

7.3 Online Resources:

www.math.xmu.edu.cn/school/teacher/bai/papers/thesis.pdf

http://www.sosmath.com/calculus/diff/der07/der07.html

www.nptel.iitm.ac.in/courses/Webcourse-contents/IIT...2/node18.html

http://www.math.xmu.edu.cn/school/teacher/bai/papers/thesis.pdf


http://www.nptel.iitm.ac.in/courses/Webcourse-contents/IIT...2/node18.html

13

8.LESSON PLAN

Unit -1 SOLUTION OF TRANSCENDENTAL EQUATIONS AND

EIGENVALUE PROBLEMS

S.

NO TOPICS

TEXT

BOOK1

s.s.sastry

TEXT

BOOK2

B.S.GR

EWAL

Website/ other

resources

Delivery

Method

1 Introduction Chalk

&talk

2

Linear

interpolatio

n methods

(method of

false

position

28-30 24

www.mii.lt/na/issues/NA

_1101/NA11102.pdf

www.math.xmu.edu.cn/s

chool/teacher/bai/papers/t

hesis.pdf

http://www.sosmath.com/

calculus/diff/der07/der07.

html

www.macalester.edu/arat

ra/edition2/chapter3/chap

t3a.pdf

www.nptel.iitm.ac.in/cou

rses/Webcourse-

contents/IIT...2/node18.ht

ml

www.purplemath.com/m

odules/systlin6.htm

www.slideshare.net/gilan

dio/gauss-elimination-

method

Chalk

&talk

3 Newton’s

method 64-72 32,86

Chalk

&talk

4

Statement

of fixed

point

theorem –

Fixed point

iteration:

x=g(x)

method

Chalk

&talk

5 Solution of

linear 263-266 70,90

Chalk

&talk

http://www.mii.lt/na/issues/NA_1101/NA11102.pdf

http://www.mii.lt/na/issues/NA_1101/NA11102.pdf







http://www.macalester.edu/aratra/edition2/chapter3/chapt3a.pdf







http://www.purplemath.com/modules/systlin6.htm

http://www.purplemath.com/modules/systlin6.htm

http://www.slideshare.net/gilandio/gauss-elimination-method



14

system by

Gaussian

elimination

and Gauss-

Jordon

methods

6

Iterative

methods:

Gauss

Jacobi and

Gauss-

Seidel

methods

34 79,272 Ppt

7

Inverse of

a matrix by

Gauss

Jordon

method

266 72,90 Chalk

&talk

8

Eigen

value of a

matrix by

power

method.

99 Chalk

&talk

Unit2 INTERPOLATION

1 Introduction ppt

2 Lagrangian

Polynomials 101 175 Chalk &talk

3 Divided differences 75 166 Chalk &talk

4 Interpolating with a

cubic spline 393 Chalk &talk

5

Newton’s forward

and backward

difference formulas.

8411 149,148 Chalk &talk

6 Newton’s divide

difference method. 113 ppt

Unit3 NUMERICAL DIFFERENTIATION AND INTEGRATION

1 Introduction Chalk &talk

2 Derivatives from

difference tables Chalk &talk

15

3 Divided differences and

finite differences 111 166,129 Chalk &talk

4

Numerical integration by

trapezoidal and Simpson’s

1/3 and 3/8 rules

218-222 189,190

,191 Chalk &talk

5 Romberg’s method 223 199 Chalk &talk

4

Two and Three point

Gaussian quadrature

formulas

238-242 205 Chalk &talk

5

Double integrals using

trapezoidal and

Simpsons’s rules

245 Chalk &talk

Unit4 NUMERICAL SOLUTION OF ORDINARY DIFFERENTIAL

EQUATIONS


2 Single step methods:

Taylor series method 303 Chalk &talk

3 Euler and modified Euler

methods 307 230,231 Chalk &talk

4

Fourth order Runge –

Kutta method for solving

first and second order

equations

310 237 Chalk &talk

5

Multistep methods:

Milne’s and Adam’s

predictor and corrector

methods.

316-318 242,245 Chalk &talk

Unit5 NUMERICAL SOLUTION OF PARTIAL DIFFERENTIAL EQUATIONS


2

Finite difference solution

of second order ordinary

differential equation

360 129 Chalk &talk

3

Finite difference solution

of one dimensional heat

equation by explicit and

implicit methods

360 332, Chalk &talk

4

One dimensional wave

equation and two

dimensional Laplace and

Poisson equations.

369 270,277 Chalk &talk

16

TUTORIAL OUTLINE:

Tutorial

count Topics to be covered

1 Linear interpolation methods (method of false position)

Newton’s method

2 Solution of linear system by Gaussian elimination and Gauss-

Jordon methods

3 Iterative methods: Gauss Jacobi and Gauss-Seidel methods

Eigen value of a matrix by power method.

4 Lagrangian Polynomials, Divided

differences

5 Interpolating with a cubic spline

Newton’s forward and forward difference formulas.

6 Newton’s forward and backward difference formulas.

Newton’s divide difference method

7 Derivatives from difference tables, Divided differences and

finite differences

8 Numerical integration by trapezoidal and Simpson’s 1/3 and

3/8 rules

Romberg’s method

9 Two and Three point Gaussian quadrature formulas

Double integrals using trapezoidal and Simpsons’s rules.

10 Single step methods: Taylor series method, Euler and

modified Euler methods

11 Fourth order Runge – Kutta method for solving first and

second order equations

12 Multistep methods: Milne’s and Adam’s predictor and

corrector methods.

13 Finite difference solution of second order ordinary differential

equation

14 Finite difference solution of one dimensional heat equation by

explicit and implicit methods

15 One dimensional wave equation and two dimensional Laplace

and Poisson equations.

17

9. REVISED BLOOM’S TAXONOMY BASED ASSESSMENT PATTERN :

Revised

Bloom’s

Category

Internal

University

Examination

%

Session

Test- I

%

Mid

Term

Test I

%

Session

Test- II

%

Mid

Term

Test II

%

Remember(K1) 40 40 40 40 20

Understand(K2) 40 40 40 40 60

Apply(K3) 20 20 20 20 20

Analyse(K4)

Evaluate(K5)

Create(K6)

Revised

Bloom’s

Category

Assignments

I

(CO1 & CO2

addressed)

(max marks in %)

II

(CO3 & CO4

addressed)

(max marks in %)

Remember(K1) 40 40

Understand(K2) 40 40

Apply(K3) 20 20

Analyse(K4)

Evaluate(K5)

Create(K6)

18

10.SAMPLE ASSESSMENT QUESTIONS:

(Minimum three sample questions for each course outcome is required)

Course Outcome 1 (CO1):

1. What is the order of convergence for fixed point iteration?

2. Express 2u xx=u tt in terms of finite difference scheme.

3. Solve by Gauss-Jordan method of iteration the equation.

10x1 + x2 + x3 = 12

2x1 + 10x2 + x3 = 13

2x1 +2x2 + 10x3 = 14


1. Find 10 (1 – ax) (1 – bx2) (1 – cx3) (1 – dx4).

2. State Trapezoidal rule to evaluate n

0

x

x

f x dx .

3. From the given table compute the value of sin 38.

X 0 20 30 40 50

Sin x 0 0.17365 0.34202 0.5 0.64276


1. Find tan-1 x.

2. Obtain the finite difference scheme for the differential equation

3. Evaluate to integral

2 2

1 1

dxdyI =

x + y Using the trapezoidal rule with h = k = 0.8 and h = k = 0.25


1. State a condition for Gauss – Jacobi method of converges.

2. The nth order difference of a polynomial of nth degree.

3. Using Taylor method compute y (0.4) and y(0.6) correct to 4 decimal

places given

1 2 and y(0) =0

dyxy

dx .


1. Write a Formula for modified Eulers method.

2. Give the finite difference Scheme to solve ▼2u=0 numerically.

3. Applying Liebmann’s method, solve Laplace equation ▼2u=0 for the

square region ▼2u=0 for the square region 0≤x≤1, 0≤y≤1 with h=⅓

and u(x, y) =9x2y2 on the boundary.

19



B.Tech DEGREE MODEL QUESTION PAPER

[OUTCOME BASED EDUCATION PATTERN]

Year / Sem Second Year / 4th Sem Duration : 3 Hrs

Subject Code /

Title

U4MAA08/U4MAA03 –

NUMERICAL METHODS Max Marks : 100

Branches EEE

EXECUTION PLAN

S No Activities Time in Minutes

1 To study the Question Paper and choose to attempt 5

2 Part-A 2Minutes *10 Questions 20

3 Part-B 10Minutes * 5 Questions 50

4 Part-C 20Minutes *5 Questions 100

4 Quick revision & Winding up 5

Total 180

Summative Assessment

PART-A (2 Marks) (10*2=20 Marks)

Answer All Questions

1. [CO1] What is the order of convergence for fixed point iteration?

2. [CO1] Express 2u xx=u tt in terms of finite difference scheme.

3. [CO2] Find 10 (1 – ax) (1 – bx2) (1 – cx3) (1 – dx4).

4. [CO2] State Trapezoidal rule to evaluate n

0

x

x

f x dx .

5. [CO3] Find tan-1 x.

6. [CO3] Obtain the finite difference scheme for the differential equation

7. [CO4] State a condition for Gauss – Jacobi method of converges.

8. [CO4] The nth order difference of a polynomial of nth degree.

9. [CO5] Write a Formula for modified Eulers method.

10. [CO5] Give the finite difference Scheme to solve ▼2u=0 numerically.

20

Part – B (6 Marks) (5 * 6 = 30 Marks)


11 (a) [CO1] Solve by Gauss-Jordan method of iteration the equation.

10x1 + x2 + x3 = 12

2x1 + 10x2 + x3 = 13

2x1 +2x2 + 10x3 = 14

[OR]

(b) [CO1] If an approximate root of the equation x ( l- logx) = 0.5 lies

between 0.1 and 0.2 find the value of the root correct to three decimal

places.

12. (a) [CO2] From the given table compute the value of sin 38.

X 0 20 30 40 50

Sin

x 0 0.17365 0.34202 0.5 0.64276

[OR]

(b) [CO2] In an examination the number of candidates who obtained

marks between certain limits was as follows:-

Marks 30 – 40 40 –

50

50 –

60 60 – 70 70 – 80

No. of

Students 50 60 55 45 32

Find the number at candidate whose scores lie between 45 and 50.

13. (a) [CO3] Evaluate to integral 2 2

1 1

dxdyI =

x + y Using the trapezoidal rule with

h = k = 0.8 and h = k = 0.25

[OR]

(b) [CO3] Evaluate 1.4

x

0.2

sinx - ln x + e dx by Simpson’s 3/4 rule.

14 (a) [CO4] Using Taylor method compute y (0.4) and y(0.6) correct to 4

decimal places given

1 2 and y(0) =0

dyxy

dx .

[OR]

(b) [CO4] Using the Runge – kutta method, tabulate the solution of the

system dy

dx = x +z,

dz

dx = x-y, y = 0.5, z =1 when x = 0 at intervals

of h = 0.1 from x = 0.0 to x =0.2.

21

15 (a) [CO5] Applying Liebmann’s method, solve Laplace equation ▼2u=0

for the square region ▼2u=0 for the square region 0≤x≤1, 0≤y≤1 with

h=⅓ and u(x, y) =9x2y2 on the boundary.

[OR]

(b) [CO5] Evaluate the pivotal values of the following equation taking

h=1 and up to one half of the period of the oscillation 16uxx= utt given

u(0,t)=u(5,t)=0, u(x,0)=x2(5-x) and ut(x,0)=0

Part C (10 Marks) (5 * 10 = 50 Marks)


16. (a) [CO1] Solve by Gauss – seidal method of iteration the equation.

10x1 + x2 + x3 = 12 2x1 + 10x2 + x3 = 13 2x1 +2x2 + 10x3 = 14

[OR]

(b) [CO1] If an approximate root of the equation x ( l- logx) = 0.5 lies

between 0.1 and 0.2 find the value of the root correct to three decimal

places.

17. (a) [CO2] From the given table compute the value of sin 38.

x 0 10 20 30 40

Sin x 0 0.17365 0.34202 0.5 0.64276

[OR]

(b) [CO2] In an examination the number of candidates who obtained

marks between certain limits was as follows:-

Marks

30 –

40

40 –

50

50 –

60

60 –

70

70 –

80

No. of

Students 31 42 51 35 31

Find the number at candidate whose scores lie between 45 and 50.

18. (a) [CO3] Evaluate to integral 2 2

1 1

dxdyI =

x + y Using the trapezoidal rule with

h = k = 0.5 and h = k = 0.25

[OR]

(b) [CO3] Evaluate 1.4

x

0.2

sinx - ln x + e dx by Simpson’s 1/3 rule.

22

19. (a) [CO4] Using Taylor method compute y (0.2) and y(0.4) correct to 4

decimal places given 1 2 and y(0) =0dy

xydx

.

[OR]

(b) [CO4] Using the Runge – kutta method, tabulate the solution of the

system dy

dx = x +z,

dz

dx = x-y, y = 0, z =1 when x = 0 at intervals of

h = 0.1 from x = 0.0 to x =0.2.

20. (a) [CO5] Applying Liebmann’s method, solve Laplace equation ▼2u=0

for the square region ▼2u=0 for the square region 0≤x≤1, 0≤y≤1 with

h=⅓ and u(x, y) =9x2y2 on the boundary.

[OR]

(b) [CO5] Evaluate the pivotal values of the following equation taking

h=1 and up to one half of the period of the oscillation 16uxx= utt given

u(0,t)=u(5,t)=0, u(x,0)=x2(5-x) and ut(x,0)=0

23

U4EEB08 AC MACHINES

1. PREAMBLE

This course of AC MACHINES (U4EEB08) is to provide the basic

knowledge of the electrical DC machine, rotating electrical machines.

2. PRE-REQUISITE:

Basic knowledge in Electric circuits AC and DC, power system analysis,

rotating electrical machine and DC machine.

3. LINKS TO OTHER COURSES

Electric Circuit theory, Measurements and Instrumentation and Electrical

machines, control system and power systems.


Students are exposed with

The knowledge of working principle, operations, performance and

applications of three phase and single phase Induction Motors.

The knowledge of special electrical machines.

The knowledge of working principle, operations, performance and

applications of 3φ Synchronous Generators and Synchronous Motors.

Knowledge of d-q model of 3φ rotating magnetic fields

L T P C

3 1 0 4

24

5. COURSE OUTCOMES:


CO


Level of learning

domain (Based on

revised Bloom’s

taxonomy)

C01

Identify the constructional features, principle and

performance, various methods to find regulation

of synchronous generator and two reaction

theory

K4

C02 Discuss working of synchronous motor and

starting methods K3

C03

Identify necessity of revolving magnetic field,

different types of rotor structure, working

principle of operation of Induction motor

K4

C04

Identify equivalent circuit parameters, starters

and their types & control of Induction machine

using No load and Blocked rotor test of an

Induction motor.

K4

C05

Understanding working principle of single phase

Induction motor and importance of Double field

revolving theory and application of special

machines.

K4

6. CORRELATED WITH PROGRAM OUTCOMES:

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11

CO1 H H M M L H H M

CO2 H H M M L H H M

CO3 H H M H L H H M

CO4 H H M H L H H M

CO5 H H L L L H H M

25

7. SYLLABUS

UNIT I SYNCHRONOUS GENERATOR 9+3

Constructional details – Types of rotors – emf equation – Synchronous

reactance – Armature reaction – Voltage regulation – e.m.f, mmf, z.p.f and

A.S.A methods – Synchronizing and parallel operation – Synchronizing torque -

Change of excitation and mechanical input – Two reaction theory –

Determination of direct and quadrature axis synchronous reactance using slip

test – Operating characteristics - Capability curves.

UNIT II SYNCHRONOUS MOTOR 9+3

Principle of operation – Torque equation – Operation on infinite bus bars - V-

curves – Power input and power developed equations – Starting methods –

Current loci for constant power input, constant excitation and constant power

developed.

UNIT III THREE PHASE INDUCTION MOTOR 9+3

Rotating magnetic field-Constructional details – Types of rotors – Principle of

operation – Slip – Equivalent circuit – Slip-torque characteristics - Condition for

maximum torque – Losses and efficiency – Load test - No load and blocked

rotor tests - Circle diagram – Separation of no load losses – Double cage rotors

– Induction generator – Synchronous induction motor.

UNIT IV STARTING AND SPEED CONTROL OF THREE PHASE

INDUCTION MOTOR 9+3

Need for starting – Types of starters – Stator resistance and reactance, rotor

resistance, autotransformer and star-delta starters – Speed control – Change of

voltage, torque, number of poles and slip – Cascaded connection – Slip power

recovery scheme.

UNIT V SINGLE PHASE INDUCTION MOTORS AND SPECIAL

MACHINES 9+3

Constructional details of single phase induction motor – Double revolving field

theory and operation – Equivalent circuit –Performance analysis – Starting

methods of single-phase induction motors - Special machines - Shaded pole

induction motor, reluctance motor, repulsion motor, hysteresis motor, stepper

motor and AC series motor.

Total : 45+15 = 60 periods

26

BEYOND THE SYLLABUS

Universal motor

Capacitor start induction motor

7.1 Text books

1. D.P. Kothari and I.J. Nagrath, ‘Electric Machines’, Tata McGraw Hill

Publishing Company Ltd, 2012.

2. Electrical Machinery by P.S.Bimhra, VII Edition, Khanna

Publisher,2012

3. Electrical Machines by Smarajit Ghosh, Pearson Education,2012

7.2 Reference books

1. Electric Machinery, A.E. Fitzgerald, Charles Kingsley,

Stephen.D.Umans,

Tata McGraw Hill publishing Company Ltd, 2012.

2. J.B. Gupta, ‘Theory and Performance of Electrical Machines’,

S.K.Kataria and Sons, 2012.

3. Sheila. C.Haran, ‘Synchronous, Induction and Special Machines’,

Scitech Publications, 2012.

4. Electrical Machines, by Charles I. Hubert, Pearson Education, 2012.

7.3 Online Resources

www.nptel.com

http://www.nptel.com/

27

8. LESSON PLAN

Content Delivery methods:

1. Lecture 2.Lecture with discussion 3.Lecture with demonstration

4.Tutorial 5.Project 6.Assignments 7.seminar 8.Case study 9.Group

discussion 10.Assynchronous Discussion 11.Any other

Unit 1: SYCHRONOUS GENERATOR

Course Outcome 1 (CO1) : Understand the operating principle, methods

of improving regulation of a Alternator

Sl.

NO Topic

Text

Book 1

(Page

No)

Text

Book 2

(Page

No)

Web Link/

Other

Resources

Delivery

methods

1 Alternators 414-416 NPTEL

1/2/4/6

2 types and constructional

features 418-419

3 EMF equation 417

4 rotating magnetic field 421 NPTEL

5 armature reaction 422

6 load characteristics 426

7 Predetermination of

regulation 430-435 NPTEL

8 Basic ideas of two

reaction theory(PPT) 440

9 Seminar

10 Tutorial

12 Tutorial

13 Tutorial

14 Tutorial

15 Class test

Unit 2: SYNCHRONOUS MOTOR

Course Outcome 2 (CO2) : Analyze the characteristics of dynamic Power

factor compensator

Sl.

NO Topic

Text

Book 1

(Page No)

Text

Book 2

(Page

No)

Web Link/

Other

Resources

Delivery

methods

1 Synchronous motors 619 NPTEL

1/2/4/6 2

Synchronous machines

on infinite bus bars 625 NPTEL

28

3 Phasor diagram-V and

inverted V curves 634 NPTEL

4 current - Hunting and its

suppression 486

5 starting methods(PPT) 470 NPTEL

6 Circuit model 421

7 Circuit of V and inverted

V curves 650

8 Operating Characteristics 445

9 Torque Equation 450

10 Performance

Characteristics 454

11 Transients in

synchronous Motor 615

12 Class test

13 Tutorial

14 Tutorial

15 Tutorial

UNIT III THREE PHASE INDUCTION MOTOR

CO3: Understand the operating characteristics of 3 phase Induction Motor

Sl.

NO Topic

Text

Book 1

(Pg. No)

Text

Book 2

(Pg. No)

Web Link/

Other

Resources

Delivery

Methods

1 Poly phase Induction

motors

561-

565 NPTEL

1/2/4/6

2 types and constructional

features 523

421-

424

3 Equivalent circuit 531 NPTEL

4 starting and speed control 572

5 Induction generators 603 NPTEL

6 Circle Diagram 533-545 564

7 Circle Diagram 533-545 564

8 Power Across Air – gap,

Torque and Output Power 536 NPTEL

9 Cogging and Crawling 580

10 Circuit model 532

11 Torque Equation 530

12 Seminar

13 Tutorial

14 Tutorial

15 Tutorial

29

Unit 4: STARTING AND SPEED CONTROL OF THREE PHASE

INDUCTION MOTOR

Course Outcome 4 (CO4): Students will be able to understand and analyze

major faults in power systems

Sl.

NO Topic

Text

Book 1

(Page

No)

Text

Book 2

(Page

No)

Web

Link/

Other

Resources

Content

delivery

method

1 Starters of Induction

Motor 572 NPTEL

1/2/4/6

2 V/f control 586

3 Star – Delta starter 590 NPTEL

4 Types of Star – Delta

Starter 592

5 Auto Transformer

Starters 596 NPTEL

6 Slip Ring Induction

Motor 612 NPTEL

7 Pole Changing method 630 NPTEL

8

Performance

characteristics of

Induction Motor

652 NPTEL

9

Analyze the control

strategies of 3 phase

Induction Motor

730

10 Effect of Harmonics in

Power system 680 NPTEL

11

Production of Harmonics

due to Power Electronics

devices

696

12 Class Test

13 Tutorial

14 Tutorial

15 Tutorial

30

Unit 5: SINGLE PHASE INDUCTION MOTORS AND SPECIAL

MACHINES

Course Outcome 5 (CO5): Understand the operating principle of Single

Phase Induction and Special Machines.

Sl.

NO Topic

Text

Book 1

(Page

No)

Text

Book 2

(Page

No)

Web

Link/

Other

Resources

Delivery

Method

1 Single phase

induction motors 716 NPTEL

4/6/7

2 constructional

features 718 NPTEL

3 Principle of operation

725 NPTEL

4

equivalent circuit

based on double

revolving field

theory(PPT)

NPTEL

5

Conditions for

maximum power

developed

730 NPTEL

6 hunting 656

7 Equivalent circuit 648

8 types of Induction

Motor 745

9 Torque Equation 656 NPTEL

10 Performance

Characteristics 658 NPTEL

11

Applications of

Single Phase

induction Motor

670

12 Seminar

13 Tutorial

14 Tutorial

15 Tutorial

31

TUTORIAL OUTLINE:

Tutorial

Count TOPIC

1 E.m.f, mmf, Z.p.f and A.S.A methods

2 Two reaction theory – Determination of direct and

quadrature axis synchronous reactance.

3 Power input and power developed equations

4 Slip-torque characteristics

5 Load test - No load and blocked rotor tests

6 Double cage rotors – Induction generator

7 Synchronous induction motor.

8 Types of starters

9 Speed control

10 Slip power recovery scheme.

11 Double revolving field theory and operation

12 No load and blocked rotor test

13 Starting methods of single-phase induction motors

14 Shaded pole induction motor, reluctance motor, repulsion

motor

15 Hysteresis motor, stepper motor and AC series motor.

32

9.REVISED BLOOM’S TAXONOMY BASED ASSESSMENT PATTERN:

Revised

Bloom’s

Category

Internal

University

Examination

%

Session

Test- I

%

Mid

Term

Test I

%

Session

Test- II

%

Mid

Term

Test II

%

Remember 25 40 25 25 25

Understand 25 40 25 25 25

Apply 40 20 40 40 40

Analyse 10 10 10 10

Evaluate

Create

Revised Bloom’s

Category

ASSIGNMENTS

1

(Cos1 &2 addressed)

(Max marks in %)

2

(COs 3 addressed)

(Max marks in %)

Remember 30 30

Understand 20 20

Apply 20 20

Analyze 30 30

Evaluate

Create

33

10. SAMPLE ASSESSMENT QUESTIONS:



1) Describe construction and working of an alternator

2) Derive the emf equation of an alternator

3) Explain Blondel’s two reaction theory


1) Explain one method of starting a synchronous motor.

2) Explain the phasor diagram of a synchronous motor operating at

lagging and leading power factor.

3) Explain the working of synchronous motor with different excitations


1) Discuss the different power stages of an induction motor with losses

2) Explain the power flow diagram and torque slip characteristics of

induction motor.

3) Derive the equation for torque developed by an induction motor


1) Discuss the various starting methods of induction motors.

2) Explain the different speed control methods of phase wound induction

motor.

3) Explain in detail the slip power recovery scheme.


1) Explain the principle and operation of AC series motor.

2) Explain the operation of shaded pole induction motor with diagram.

3) Explain the construction and working of stepper motor.

34





Year / Sem SECOND YEAR / 4th Sem Duration : 3 Hrs

Subject Code /

Title

U4EEA08 /

AC MACHINES Max Marks : 100

Branches EEE

EXECUTION PLAN


1 To study the Question Paper and choose to

attempt 5





Total 180




1. [CO1] What are conditions to be satisfied for parallel operation of

alternators?

2. [CO1] List the applications, characteristics of Split phase motors

3. [CO2] Define the locking tendency of the rotor

4. [CO2] List the advantages and disadvantages of stepper motor

5. [CO3] List the applications and characteristics of Capacitor run motor

6. [CO3] If the electromotive force in the stator of and 8-pole induction motor

has a frequency of 50Hz and that in the rotor.

7. [CO4] Define synchronous condenser

8. [CO4] Define step angle.

9. [CO5] Mention the applications of stepper motor.

10. [CO5] Define –Pull out torque of a synchronous motor.

35



11. a) [CO1] Explain in detail about Two reaction theory

[OR]

b) [CO1] Explain in detail about Capability curves.

12. a) [CO2] Draw V-curve and inverted V-curve and Explain

[OR]

b) [CO2] Derive an expression for constant excitation and constant

power developed.

13. a) [CO3] Derive the condition for maximum torque

[OR]

b) [CO3] Explain in detail about Double cage rotors

14. a) [CO4] Describe in detail about slip power recovery scheme

[OR]

b) [CO4] Draw the circuit of star-delta starters and explain

15. a) [CO5] Explain the operation of AC series motor.

[OR]

b) [CO5] Explain the concept of Double revolving field theory



16. (a) [CO1] A salient pole alternator has direct axis and quadrature axis

reactances of 0.8 pu and 0.5 pu respectively. The effective resistance

is 0.02 pu. Compute percentage regulation when the generator is

delivering rated load at 0.8 p.f. lag and lead. Assume rated voltage and

rated current as one per unit.

[OR]

(b) [CO1] Explain armature reaction. What is the effect of armature

reaction at different power factors?

17. (a) [CO2] A 400V, 50Hz, 3 phase, 37.7KW, Y-connected synchronous

motor has a full load efficiency of 88%. The synchronous impedance

of the motor is (0.2+j1.6) W/ph. If the excitation of the motor is

adjusted to have a leading p.f. of 0.9. Calculate full load current.

[OR]

(b) [CO2] Explain about V curves and inverted V curves.

36

18. (a) [CO3] Discuss the different power stages of an induction motor with

losses.

[OR]

(b) [CO3] i) Explain the different losses taking place in an IM.

ii) State the advantage, disadvantage and application of Synchronous

Induction motor.

19. (a) [CO4] Discuss briefly double field revolving theory.

[OR]

(b) [CO4] Explain principle of operation of single phase induction motor

with equivalent circuit.

20. (a) [CO5] Explain about shaded pole induction motor.

[OR]

(b) [CO5] Explain about permanent magnet brushless motor

37

U4EEB18 DIGITAL LOGIC CIRCUITS

1. PREAMBLE

This course aims at providing an extensive knowledge in digital

fundamentals and the various types of digital circuits. This course also helps

to provide a basic knowledge in VHDL programming.

2. PRE-REQUISITE

A basic knowledge of number systems and Logic gates.

3. RELATED COURSES

VLSI Design, VHDL Programming

4. COURSE EDUCATIONAL OBJECTIVES

This course provides an extensive knowledge in

Number base conversions, Boolean Algebra and Logic gates

Design of Combinational Logic circuits and their applications

Design of Synchronous Sequential logic circuits and their applications

Design of Asynchronous Sequential logic circuits and their applications

Various Memory devices and their programming

Various Digital logic families and their characteristics

Programming in VHDL

5. COURSE OUTCOMES

On successful completion of the course, the students will be able to

CO

NOS. Course Outcomes

Level of learning domain

(Based on revised

Bloom’s taxonomy)

C01 Design combinational Logic circuits K6

C02 Design Synchronous sequential Logic circuits K6

C03 Design Asynchronous sequential logic circuits K6

C04 Design Logic memories and their programs K6

C05 Build VHDL programs K6


Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11

CO1 H L L

CO2 L H L H H H H L

CO3 H H H H M L

CO4 H H M H H L L

CO5 H M H M H L

H- High; M-Medium; L-Low

L T P C

3 0 0 3

38

7. SYLLABUS

UNIT I BOOLEAN ALGEBRA AND COMBINATIONAL CIRCUITS 9

Boolean algebra: De – Morgan’s theorem, switching functions and

simplification using K – maps and Quine McCluskey method, Design of adder,

subtractor, comparators, code converters, encoders, decoders, multiplexers and

demultiplexers.

UNIT II SYNCHRONOUS SEQUENTIAL CIRCUITS 9

Flip flops – SR, D, JK and T. Analysis of synchronous sequential circuits –

Design of synchronous sequential circuits – Counters, state diagram – State

reduction – State assignment.

UNIT III ASYNCHRONOUS SEQUENTIAL CIRCUIT 9

Analysis of asynchronous sequential machines – State assignment –

Asynchronous design problem.

UNTI IV PROGRAMMABLE LOGIC DEVICES, MEMORY AND

LOGIC FAMILIES 9

Memories – ROM, PROM, EPROM, PLA, PLD, FPGA – Digital logic families

– TTL, ECL, CMOS. Application & comparison of various digital logic

families

UNIT V VHDL 9

RTL Design – Combinational logic – Types – Operators – Packages –

Sequential circuit – Sub programs – Test benches. (Examples: adders, counters,

flip flops, FSM, Multiplexers / Demultiplexers).

TOTAL: 45 periods

BEYOND THE SYLLABUS:

Static and Dynamic Hazards

Essential Hazards

Xilinx FPGA

39

7.1 Text books

1. Raj Kamal,“Digital Systems-Principles and Design”, 2nd Edition,

Pearson Education,2007.

2. Morris Mano, “Digital Design”, Pearson Education, 2006.

3. Yarbrough, J.M., “Digital Logic, Application and Design”, Thomson,

2002.

4. Digital Systems Design Using VHDL, Charles H. Roth Jr.

7.2 Reference books

1. Roth, C.H., “Fundamentals Logic Design”, 4th Edition, Jaico Publishing,

2002.

2. Floyd and Jain, “Digital Fundamentals”, 8th Edition, Pearson Education,

2003.

3. Wakerly, J.F., “Digital Design Principles and Practice”, 3rd Edition,

Pearson Education, 2002.

4. Tocci, “Digital Systems: Principles and Applications”, 8th Edition,

Pearson Education.


http://www.downloadpdffree.com/digital-systems-principles-and-design-

rajkamal.pdf

http://cmrtc.ac.in/EBooks/Digital%20Systems%20Design%20Using%20

VHDL.pdf

http://www.getbookee.org/morris-mano-digital-design-4th-edition

http://nptel.iitm.ac.in

http://www.downloadpdffree.com/digital-systems-principles-and-design-rajkamal.pdf

http://www.downloadpdffree.com/digital-systems-principles-and-design-rajkamal.pdf

http://cmrtc.ac.in/EBooks/Digital%20Systems%20Design%20Using%20VHDL.pdf

http://cmrtc.ac.in/EBooks/Digital%20Systems%20Design%20Using%20VHDL.pdf

http://www.getbookee.org/morris-mano-digital-design-4th-edition

http://nptel.iitm.ac.in/

40

9. LESSON PLAN

S. No Topics

Text

book 1

(Page No)

Text

book 2

(Page No)

Web

Link/

Other

Resources

Delivery

Method

UNIT I BOOLEAN ALGEBRA AND COMBINATIONAL LOGIC CIRCUITS

1 Number system and codes 8-10 11--12 NPTEL Chalk & Talk

2 Boolean Algebra 11-12 12-13 NPTEL Chalk & Talk

3 Demorgan’s Theorem 13-14 14 NPTEL Chalk & Talk

4 Switching function and

simplification using K-Map 16 16 NPTEL Chalk & Talk

5 Quine- McCluskey Method 18 18 NPTEL Chalk & Talk

6 Design of adder, Subtractor 18 22 NPTEL Chalk & Talk

7 Comparator, Code converter 19 22 NPTEL Chalk & Talk

8 Encoder, Decoder 20 24 NPTEL Chalk & Talk

9 Multiplexer, Demultiplexer 24 26 NPTEL Chalk & Talk

Unit Test – I (CO1)

UNIT II SYNCHRONOUS SEQUENTIAL CIRCUITS

1 Flipflops 29 30 NPTEL Chalk & Talk

2 SR,JK,D,T Flipflops 33 31 NPTEL Chalk & Talk

3 Analysis of sequential

circuits 37 32 NPTEL Chalk & Talk

4 Design of sequential circuits 39 35 NPTEL Chalk & Talk

5 Counters 41 38 NPTEL Chalk & Talk

6 State diagram 42 42 NPTEL Chalk & Talk

7 State reduction 54 45 NPTEL Chalk & Talk

8 State assignment 56 48 NPTEL Chalk & Talk

9 Problems

Mid Term Test – I (CO1 & CO2)

UNIT III ASYNCHRONOUS SEQUENTIAL CIRCUITS

1 Analysis of asynchronous

sequential circuits 66 64 NPTEL Chalk & Talk

2 State assignment 67 68 NPTEL Chalk & Talk

3 Asynchronous design

problem 69 70 NPTEL Chalk & Talk

Unit Test – II (CO3)

UNIT IV PROGRAMMABLE LOGIC DEVICES, MEMORY AND LOGIC

FAMILIES

1 Design of Memories 76 82 NPTEL Chalk & Talk

2 ROM, RAM 78 85 NPTEL Chalk & Talk

3 PLA, PLD, PAL 82 90 NPTEL Chalk & Talk

41

4 Digital logic families 83 100 NPTEL Chalk & Talk

5 TTL 90 105 NPTEL Chalk & Talk

6 ECL 95 106 NPTEL Chalk & Talk

7 CMOS 100 108 NPTEL Chalk & Talk

8 RTL, DTL 104 112 NPTEL Chalk & Talk

9 Application 108 120 NPTEL Chalk & Talk

UNIT V VHDL

1 RTL Design 127 NPTEL PPT

2 Combinational logic 130 NPTEL PPT

3 Types 144 NPTEL PPT

4 Operators 149 NPTEL PPT

5 Packages 152 NPTEL PPT

6 Sequential circuit 154 NPTEL PPT

7 Sub programs 160 NPTEL PPT

8 Test benches 163 NPTEL PPT

9 Examples 180 NPTEL PPT

Mid Term Test – II (CO3, CO4 &CO5)

42

9.REVISED BLOOM’S TAXONOMY BASED ASSESSMENT PATTERN :

Revised

Bloom’s

Category

Internal University

Examination

%

Session

Test- I

%

Mid Term

Test I

%

Session

Test- II

%

Mid Term

Test II

%

Remember 20 20 20 20 20


Apply 15 15 15 15 15

Analyse 20 20 20 20 20

Evaluate 20 20 20 20 20

Create 5 5 5 5 5

Revised

Bloom’s

Category

Assignments

I

(CO1 & CO2 addressed)

(max marks in %)

II


(max marks in %)

Remember 20 20

Understand 20 20

Apply 15 15

Analyse 20 20

Evaluate 20 20

Create 5 5

43



Course Outcome 1(CO1):

1. Design a combinational logic circuit which has three inputs and the

output is the square of the input.

2. Design a BCD to seven segment display decoder.

3. Simplify the minterms to minimum number of literals(1,3,5,8,10,15)

Course Outcome2 (CO2):

1. Design a sequential logic circuit whose state diagram is given below:

2. Convert the JK flip-flop to SR flip-flop

3. Design a MOD-6 Counter.


1. Design an asynchronous sequential circuit that has 2 inputs x2 and x1,

and one output z. the output is to remain 0 as long as an X1 is 0. The first

change in x2 that occurs while x1 is 1 will cause z to be 1. Z is to remain

1 until x1 returns to 0.Construct a state diagram and flow table.

Determine the output equations.

2. Obtain the primitive flow table for an asynchronous circuit that has 2

input’s x, y and output z. an output z=1, is to occur only during the input

state xy=01 and then if and only if the input state xy=01 is preceded by

the input sequence xy=01, 00, 10, 00, 10, 00.

3. Design an asynchronous sequential circuit with 2 inputs T and C. The

output attains a value of 1 when T = 1 & c moves from 1 to 0. Otherwise

the output is 0

44


1. Design a Suitable ROM to implement the function F=Ʃm( 1,3,6,7).

2. Explain about TTL logic.

3. Differentiate PAL and PLA.


1. Write a HDL code for 8:1 MUX using behavioral model.

2. Write the HDL description of the circuit specified by the Following

Boolean

Equations

a. S = xy ‘+ x’ y

b. C =xy

3. Write a behavioral VHDL description of an S-R latch

45





Year / Sem Second Year / 4th Sem Duration : 3 Hrs

Subject Code /

Title U4EEB18 /

DIGITAL LOGIC CIRCUITS Max Marks : 100

Branches EEE

EXECUTION PLAN


1 To study the Question Paper and choose to

attempt 5





Total 180




1. [CO1] State De Morgan's theorem.

2. [CO1] Give examples for weighted codes.

3. [CO2] List drawback of SR flipflop

4. [CO2] Define synchronous sequential circuit

5. [CO3] Define FPGA

6. [CO3] List the factors used for measuring the performance of digital logic

families.

7. [CO4] Define turing machine

8. [CO4] List the drawbacks in designing asynchronous sequential machines

9. [CO5] List the advantages of hardware languages

10. [CO5] Write VHDL code for half adder in data flow model.

46



11. (a) [CO1] Design A Full Adder And A Full Subtractor.

[OR]

b). [CO1] A combinational circuit is defined by the following three

Boolean functions

F1 = x’y’z’+xz

F2= xy’z’+x’y

F3= x’y’z+xy

12. a) [CO2] Design the circuit with a decoder and external gates.

[OR]

b) [CO2] A sequential circuit has 2D ff’s A and B an input x and output

y is specified by the following next state and output equations.

A (t+1)= Ax + Bx

B (t+1)= A’x

Y= (A+B) x’

(i) Draw the logic diagram of the circuit.

(ii) Derive the state table.

(iii) Derive the state diagram.

13. a) [CO3] Design an asynchronous sequential circuit that has 2 inputs x2

and x1, and one output z. the output is to remain 0 as long as an X1 is

0. The first change in x2 that occurs while x1 is 1 will cause z to be 1.

Z is to remain 1 until x1 returns to 0. Construct a state diagram and

flow table. Determine the output equations.

[OR]

b) [CO3] Design a circuit with inputs A and B to give an output z=1

when AB=11 but only if A becomes 1 before B, by drawing total state

diagram, primitive flow table and output map in which transient state

is included.

14. a) [CO4] Explain in detail about PLA with a specific example.

[OR]

b). [CO4] Implement the following function using PLA.

A (x, y, z) = m (1, 2, 4, 6)

B (x, y, z) = m (0, 1, 6, 7)

C (x, y, z) = m (2, 6)

15. a) [CO5] Write a HDL code for state machine to BCD to ex–3 codes

Converter.

[OR]

b) [CO5] Write a behavioural VHDL description of the 4 bit counter.

47



16. a) [CO1] Simplify the following Boolean function by using Tabulation

method F (w, x, y, z) =m (0, 1, 2, 8, 10, 11, 14, 15)

[OR]

b) [CO1] Simplify the following Boolean functions by using K’Map in

SOP & POS. F (w, x, y, z) = m (1, 3, 4, 6, 9, 11, 12, 14)

17. a) [CO2] Design a counter with the following repeated binary

sequence:0, 1, 2, 3, 4, 5, 6.use JK Flip- flop.

[OR]

b). [CO2] Derive the state table and state diagram of the sequential circuit

shown in figure.

18. a) [CO3] Design a asynchronous sequential circuit with 2 inputs T and C.

The output attains a value of 1 when T = 1 & c moves from 1 to 0.

Otherwise the output is 0.

[OR]

b) [CO3] Design an Asynchronous sequential circuit using SR latch with

two inputs A and B and one output y. B is the control input which,

when equal to 1, transfers the input A to output y. when B is 0, the

output does not change, for any change in input.

19. a) [CO4] i) A combinational circuit is defined by the functions.

F1 (a, b, c) = m (3, 5, 6, 7)

F2 (a, b, c) = m (0, 2, 4, 7) implement the circuit with a PLA.

ii) Write short notes on semiconductor memories

[OR]

b) [CO4] i) compare the various digital logic families.

ii) Write notes on FPGA.

20. a) [CO5] Write an HDL data flow description of a 4 bit adder subtractor

of Unsigned numbers use the conditional operator

[OR]

b) [CO5] Write the HDL gate level description of the priority encoder.

48

U4EEB10 LINEAR CONTROL SYSTEMS

1. PREAMBLE

This course aims to provide a basic knowledge about what is a control system ,

its significance, transfer function , open and closed loop systems, time domain

and frequency domain analysis and its specifications , stability , error constants

and designing of compensators viz., lag, lead and lag lead compensators and

significance of P,PI and PID controllers.

2. PRE-REQUISITE:

Knowledge in Laplace transforms, Electric circuits and Complex variables

3. RELATED COURSES

Electric Circuit theory, Modern Control Theory, Power Electronic Drives and

Control, Electrical machines, Linear Integrated Circuits



Knowledge in mathematical modeling of various systems

Time and frequency domain analysis and the check the stability

Controllers and compensators based on specifications given.

L T P C

3 1 0 4

49

5. COURSE OUTCOMES:

On successful completion of this course, the students will be able to

CO


Level of learning domain

(Based on revised Bloom’s

taxonomy)

C01

Develop mathematical Model for electrical,

mechanical and Electro mechanical systems and

Obtain transfer function using block diagram

algebra and mason’s gain formula

K2

C02 Calculate various time domain specifications and

describe their significance K2

C03 Construct and analyze the frequency response

plots and root locus K2

C04

Determine the stability of the given system using

time/frequency using time and frequency domain

approach

K3

C05

Design a lag, lead, lag-lead compensators based

on its specifications using root locus and bode

plot approach and Explain the concept of P,PI

and PID Controller

K2


COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 H H L H H M H

CO2 H H L H H M H

CO3 H H L H H M H

CO4 H H L H H M H

CO5 H H L H H M H

50

7.SYLLABUS

UNIT I INTRODUCTION

Introduction to control systems – Control theory concepts - Open loop and

feedback control systems – Mathematics modeling of simple electrical,

mechanical & Electro-mechanical systems –– Determination of transfer

function using Block diagram reduction techniques & Signal flow graphs for

any system

UNIT II TIME DOMAIN ANALYSIS

Introduction –Time Response Analysis - Standard test signals –– Time response

of first order and second order systems for impulse, step and ramp inputs- time

domain specifications – Steady state errors – Static and dynamic error

coefficients

UNIT III ROOT – LOCUS AND FREQUENCY RESPONSE ANALYSIS

Root locus concepts - Construction of root loci –Time and frequency response

correlation (Excluding proof) – Polar plot – Bode plot – Frequency response

specification -Gain margin and phase margin- Constant M circles – Constant N

circles – Nichol’s chart

UNIT IV SYSTEM STABILITY

Stability concepts – Conditions for stability – Routh Hurwitz stability criteria –-

Stability in frequency domain – Nyquist stability criterion – Relative stability

analysis

UNIT V DESIGN OF COMPENSATORS

Performance criteria– Lag – Lead and lag – Lead networks – Compensator

design using bode plots and root locus –Introduction to P, PI, PID controllers

TOTAL : 45+15 =60 periods

7.1.Text books

1. Gopal, M., “Control Systems: Principles and design”, Tata McGraw Hill,

fourth Edition, 2012

2. K. Ogata, Modern Control Engineering, Prentice Hall of India, 2011

7.2. Reference books

1. Naresh K. Shinha,” Control Systems”, 3rd edition ,New Age Publications,

2010 reprint.

2. I.J.Nagrath and M.Gopal, “Control systems Engineering", 5th edition,

New AgeInternational Publications, New Delhi, 2011

3. Nise, N.S., “Control Systems Engineering”, 6th Edition, John Wiley,

2001


www.nptel.com


51

7. LESSON PLAN

Sl.

No. Topic

Text

book 1

(Page

No)

Text

book 2

(Page

No)

Web Link/ Other

Resources

Delivery

Methods

UNIT I: INTRODUCTION

1

Introduction to

control systems –

Control theory

concepts

1-9 1-9 NPTEL Lectures

by Prof Aghase,

Chalk and

board

2

Open loop and

feedback

control systems

1-9,

185,191 1-9

NPTEL Lectures

by Prof Aghase

Chalk and

board

3

Mathematical

modelling of simple

electrical systems

72 NPTEL Lectures

by Prof Aghase

Chalk and

board,

PPT

4

Mathematical

modelling of simple

mechanical systems

141,149 63 NPTEL Lectures

by Prof Aghase

Chalk and

board

5

Mathematical

modelling of simple

electromechanical

systems

112,125,

130

NPTEL Lectures

by Prof Aghase

Chalk and

board

6

Determination of

transfer function

using Block

diagram reduction

techniques

77 17-

18,27-28

NPTEL Lectures

by Prof Aghase

Chalk and

board

7

Determination of

transfer function

using Signal flow

graph

85 NPTEL Lectures

by Prof Aghase

Chalk and

board,PPT

UNIT II TIME DOMAIN ANALYSIS

12 Introduction –Time

Response Analysis 58 159

NPTEL Lectures

by Prof Aghase

Chalk and

board

13 Standard test

signals 159

NPTEL Lectures

by Prof Aghase

Chalk and

board

14

Time response of

first order and

second order

systems for

62,257-

281 161-164

NPTEL Lectures

by Prof Aghase

Chalk and

board,PPT

52

impulse, step and

ramp inputs

15 Steady state errors 284 225 NPTEL Lectures

by Prof Aghase

Chalk and

board

16 Static and dynamic

error coefficients 285-287 225

NPTEL Lectures

by Prof Aghase

Chalk and

board

UNIT III ROOT – LOCUS AND FREQUENCY RESPONSE

ANALYSIS

25

Root locus

concepts -

Construction of

root loci

368-399 269-290 NPTEL Lectures

by Prof Aghase

Chalk and

board

26

Time and

frequency response

correlation,

Frequency

response

introduction

524-529 NPTEL Lectures

by Prof Aghase

Chalk and

board

27 Bode Plot 478-494 403 NPTEL Lectures

by Prof Aghase

Chalk and

board

28 Polar Plot 465 427 NPTEL Lectures

by Prof Aghase

Chalk and

board

29 Constant M and N

circles 537-540

NPTEL Lectures

by Prof Aghase

Chalk and

board,PPT

30 Introduction to

Nichols chart 541-544

NPTEL Lectures

by Prof Aghase

Chalk and

board,PPT

UNIT IV SYSTEM STABILITY

35

Stability concepts –

Conditions for

stability

225-228 NPTEL Lectures

by Prof Aghase

Chalk and

board

36 Routh Hurwitz

stability criteria 234 212-217

NPTEL Lectures

by Prof Aghase

Chalk and

board,PPT

37 Nyquist stability

criterion 458-472 445,454

NPTEL Lectures

by Prof Aghase

Chalk and

board

Relative stability

Analysis 462

NPTEL Lectures

by Prof Aghase

Chalk and

board

UNIT V DESIGN OF COMPONENTS

43

Performance

criteria, Lag

Compensator

308,433 321,493 NPTEL Lectures

by Prof Aghase

Chalk and

board

53

44 Lead Compensator 426 311,502 NPTEL Lectures

by Prof Aghase

Chalk and

board

45 Lag Lead

Compensator 437 330,511

NPTEL Lectures

by Prof Aghase

Chalk and

board

46 Introduction to P PI

and PID controllers

310,328,

335 567

NPTEL Lectures

by Prof Aghase

Chalk and

board

Total Periods 60

TUTORIAL OUTLINE:

Tutorial

Count TOPIC

1 Mathematical modeling

2 Bock diagram reduction

3 Signal flow graph

4 Time response specifications

5 Obtaining time response

6 Steady State Errors

7 Root Locus

8 Bode Plot

9 Polar Plot

10 Nyquist criterion

11 Routh Hurwitz

12 Relative stability analysis

13 Lag /Lead Compensators

14 Lag Lead Compensators

15 PID Controllers

54

9.REVISED BLOOM’S TAXONOMY BASED ASSESSMENT PATTERN :

Revised

Bloom’s

Category

Internal

University

Examination

%

Session

Test- I

%

Mid

Term

Test I

%

Session

Test- II

%

Mid

Term

Test II

%

Remember 40 40 40 40 20


Apply 20 20

Analyse

Evaluate

Create

Revised

Bloom’s

Category

Assignments

I

(CO1 , AND CO2

addressed)

(max marks in %)

II

(CO4, AND CO5 addressed)

(max marks in %)

Remember 40 20

Understand 60 60

Apply 20

Analyse

Evaluate

Create

55

10. SAMPLE ASSESSMENT QUESTIONS:



1. Obtain the Transfer function for mechanical system shown in figure

2. Reduce the block diagram shown in figure (2) and obtain the overall

transfer function

3. For the signal flow graph shown in figure (3), obtain the value of

C(s)/R(s)


1. What are time response specifications.

2. If x is the input and y is the output, of the system described by a

differential equation, 2

2

d y dy+ 4 +8y = 8x

dt dt, determine the undamped

natural frequency, damping ratio, damped natural frequency time for

peak overshoot, and settling time.

56

3. For a system with,

5GH s =

s +5 calculate the generalized error co-

efficients and the steady state error. Assume r(t) = 6 + 5t.


1. Draw the bode plot for the function,

2KsG s =

1+0.2s 1+0.02s .

Determine the value of K for a gain cross over frequency of 20

rad/sec.

2. For a system with ,

400G s H s =

s s +2 s +10. Draw the polar plot.

3. Construct the root locus for the function,

2

K s +2G s H s =

s +1


1. For a system with, 2

40G s H s =

s + 4 s +2s +2 obtain the gain

margin and stability using Nyquist plot

2. For a system with, F(s) = s4 + 22 s3 + 10 s2 + s + k = 0, obtain

marginal value of K, and the frequency of oscillations at that

value of K.

3. State the magnitude and angle criterion for stability


1. Design a phase lead compensator for a unity feedback system given by

the open loop transfer function G(s) = K/[s(s+1)] to the following

specifications (i) phase margin of the system >= 45 deg (ii) steady

state error for unit ramp <=1/15 (iii) gain crossover frequency must be

7.5 rad/sec

2. The forward path transfer function of a unity feedback control system

is given by G(s) = K/[s(s+2)(s+8)] . Design a suitable lag compensator

so that the system meets the following specifications (i) percentage

overshoot <= 16% for unit step input (ii) Steady state error <=0.125

for unit ramp input.

3. Tell about the significance of Integral controller and explain what

happens when Integral controller is added to a system along with the P

controller

57

VEL TECH RANGARAJANDr.SAGUNTHALA




Year / Sem SECOND YEAR / 4th Sem Duration : 3 Hrs

Subject Code /

Title U4EEB10/ LINEAR CONTROL

SYSTEM Max Marks : 100

Branches EEE

EXECUTION PLAN

S No Activities Time in

Minutes






Total 180




1. [CO1] Define transfer function

2. [CO1] Write the Masons Gain formula

3. [CO2] List the time domain specifications

4. [CO2] Define damping ratio.

5. [CO3] Define root locus

6. [CO3] Define gain margin in bode plot.

7. [CO4] What are the conditions for a linear time invariant system to be

stable?

8. [CO4] State the Nyquist criterion for stability

9. [CO5] What are compensators?

10. [CO5] Define integral controller



11. a) [CO1] Derive the transfer function of an armature controlled DC

servomotor.

[OR]

b) [CO1] Explain the Mathematics modeling of control systems

58

12. a) [CO2] Obtain the expression for Time domain specifications.

[OR]

b) [CO2] Discuss about steady state errors for various inputs.

13. a) [CO3] Discuss shortly about the correlation between time and

frequency domain.

[OR]

b) [CO3] Write the procedure for obtaining root locus

14 a) [CO4] Discuss about the three basic cases when checking stability

using Routh Hurwitz Criterion

[OR]

b) [CO4] How to determine the nyquist stability for a given system?

Discuss

15. a) [CO5] Discuss about advantages and disadvantages of P, I and D

controllers individually .

[OR]

b) [CO5] Discuss the procedure for Lag compensator design using bode

plot



16. a) [CO1] For the signal flow graph shown in figure (3), obtain the value

of C(s)/R(s)

[OR]

b) [CO1] Develop the transfer function for the system shown below

59

17. a) [CO2] A unity feed back control system has a open loop transfer

function G(s) = 2

10

ss. Find rise time peak time, percentage overshoot

and settling time for a step input of 12 units.

[OR]

b) [CO2] Obtain the step response of a system whose closed loop transfer

function is given by 10012

1002

ssSR

SC

18. a) [CO3] Obtain the locus of the roots of a system defined by open loop

transfer function G(s) = 42 sss

K

[OR]

b) [CO3] Determine the system gain K for a gain cross over frequency of

5 rad/sec by sketching the bode plot for the given transfer function

G(s) = ss

Ks

02.012.01

2

19. a) [CO4] Determine the range of values of K by sketching the Nyquist

plot for the system whose open loop transfer function is given by

G(s)H(s) = 102 sss

K

[OR]

b) [CO4Determine the stability by constructing a Routh array whose

characteristic equation is s6 + 2s5 + 8s4 + 12s3 + 20s2 + 16s + 16 = 0.

Comment on the number of roots lying on the various places of s-

plane

20. a) [CO5] Design a phase lead compensator for a unity feedback system

given by the open loop transfer function G(s) = K/[s(s+1)] to the

following specifications (i) phase margin of the system >= 45 deg (ii)

steady state error for unit ramp <=1/15 (iii) gain crossover frequency

must be 7.5 rad/sec

[OR]

b) [CO5] Design a lag lead compensator with open loop transfer function

G(s) = K/[s(s + 0.5)] to satisfy the following specifications (i)

damping ratio of the dominant closed loop poles is 0.5 (ii) Undamped

natural frequency of the dominant closed loop poles ωn = 5 rad/sec

(iii) Velocity error constant Kv = 80 sec-1

60

U4CSB01 DATA STRUCTURES & C PROGRAMMING

1. PREAMBLE:

This course provides an introduction to the basic concepts and techniques of

Linear and non linear data Structures and Analyze the various algorithm.

2. PRE-REQUISITE:

Fundamentals of Computing

3. RELATED COURSES:

Java and Internet programming

4. COURSE EDUCATIONAL OBJECTIVES: Students undergoing this course are expected to

Be exposed to the concepts of ADTs

Learn linear data structures – list, stack, and queue.

Learn non-linear data structures – Tree, graph etc

Be exposed to sorting, searching, hashing algorithms

5. COURSE OUTCOMES:

Students undergoing this course are able to:

CO


Level of learning

domain (Based on

revised Bloom’s

taxonomy)

C01 Identify user defined data types, linear data

structures for solving real world problems. K1

C02

Write modular programs on non linear data

structures and algorithms for solving engineering

problems efficiently.

K2

C03 Illustrate some of the special trees and Hashing

Techniques. K3

C04 State what is an undirected graph, directed graph

and apply BFS and DFS to traverse a graph K3

C05 Demonstrate knowledge of sorting algorithms

and their run-time complexity. K3

L T P C

3 0 0 3

61

6. CORREALATION WITH PROGRAM OUT COMES:

Course

outcomes

Programme outcomes


CO1 L L L L

CO2 M M M

CO3 H H H H

CO4 H H H H

CO5

7. SYLLABUS :

UNIT I LINEAR DATA STRUCTURE 9

Introduction - Abstract Data Type (ADT) – The List ADT – Array

Implementation – Linked List Implementation – Cursor Implementation – The

Stack ADT – The Queue ADT – Applications of Stack, Queue and List.

UNIT II TREES 9

Introduction to trees - Tree Traversal - Binary Trees - Definitions – Expression

Tree – Binary Tree Traversals - The Search Tree ADT – Binary Search Trees -

AVL Tree.

UNIT III SPECIAL TREES & HASHING 9

Splay Tree – B-Tree - Priority Queue - Binary Heap – Threaded Binary Tree.

Hashing - Separate Chaining – Open Addressing – Linear Probing – Quadratic

Probing – Double Hashing –Rehashing

UNIT IV GRAPH 9

Introduction to Graphs - Topological Sort – Shortest-Path Algorithms –

Unweighted Shortest Paths –Dijkstra’s Algorithm – Minimum Spanning Tree –

Prim’s Algorithm- Kruskal’s Algorithm – Breadth first search – Depth-First

Search – Undirected Graphs – Biconnectivity.

UNIT V SORTING & SEARCHING 9

Sorting algorithm- Insertion sort- Selection sort- Shell sort-Bubble sort- Quick

sort- Heap sort-Merge sort- Radix sort - Searching – Linear search - Binary

search.

Total : 45 periods

62

BEYOND THE SYLLABUS:

Graph Travesal

7.1 Text Book:

1. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, Second

Edition, Pearson Education, 2005.

7.2 Reference Books:

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, “Data Structures and

Algorithms”, Pearson Education, First Edition Reprint 2003.

2. R. F. Gilberg, B. A. Forouzan, “Data Structures”, Second Edition,

Thomson India Edition, 2005.

3. Ellis Horowitz, Sartaj Sahni, Dinesh Mehta, “Fundamentals of Data

Structure”, Computer Science Press, 1995.


1. http://simplenotions.wordpress.com/2009/05/13/java-standard-data-

structures-big-o-notation/

http://simplenotions.wordpress.com/2009/05/13/java-standard-data-structures-big-o-notation/

http://simplenotions.wordpress.com/2009/05/13/java-standard-data-structures-big-o-notation/

63

8. LESSON PLAN

S.No Topics

Text

book 1

(Page

No)

Text

book 2

(Page

No)

Web

Link/

Other

Resources

Delivery

Method

UNIT I INTRODUCTION

1 Abstract data

type(ADT) 57

Chalk

& talk

2

The List ADT-

simple array

implementation of

lists-linked list-

programming

details-common

errors

58-65

Chalk

& talk

3 Array

implementation 59

Chalk

& talk

4 Linked list

implementation 67-68

Chalk

& talk

5 Cursor

implementation 73

Chalk

& talk

6

Stack ADT-stack

model-

Implementation of

stacksApplications

78-87

Chalk

& talk

7

Queue ADT

-Queue model

-Array

implementation of

queue-

Application of

queue

95-100

Chalk

& talk

8

Application of

stack queue and

list

87-100

Chalk

& talk


64

UNIT II TREES

9 Introduction to

trees 105

Chalk

& talk

10 Tree traversal 107

PPT

11

Binary trees

-implementation

111

PPT

12 Expression Trees 113

Chalk

& talk

13 Binary tree

traversal 112

Chalk

& talk

14

Search tree ADT

-Make empty

-find -Find Min

and Find max

-Insert-delete

-Average case

analysis

116-123

PPT

15 Binary search

tress 116-123

Chalk

& talk

16

AVL Trees

-single rotation

-double rotation

126-131

Chalk

& talk

Mid Term Test – I (CO1 & CO2)

UNIT III SPECIAL TREES AND HASHING

17

Splay trees

-A Simple data

-Splaying

139-142

Chalk

& talk

18 B Trees 149

Chalk

& talk

19 Priority queues 193-194

Chalk

& talk

20

Binary Heap-

structure

property-heap

195-102

Chalk

& talk

65

order property-

basic heap

operations-other

heap operations

21 hashing 165

Chalk

& talk

22 Separate chaining 168

Chalk

& talk

23 Open addressing 173

Chalk

& talk

24 Linear probing 173

PPT

25 Quadratic probing 176

Chalk

& talk

26 Double hashing 180

PPT

27 rehashing 181

Chalk

& talk

UNIT IV GRAPHS

28 Introduction to

graphs 299

Chalk

& talk

29 Topological sort 302

PPT

30 Shortest path

algorithms 306

Chalk

& talk

31 Un weighted

shortest path 307

PPT

66

32 Dijikstra’s

algorithm 311

Chalk

& talk

33 Minimum

spanning tree 329

Chalk

& talk

34 Prim’s algorithm 330

PPT

35 Kruskal’s

algorithm 332

PPT

36 Depth first search 335

Chalk

& talk

37 Undirected graphs 336

NPTL

videos

38 biconnectivity 338

Chalk

& talk

Mid Term Test – II (CO3 & CO4)

UNIT V SORTING & SEARCHING

39 Sorting algorithm 235

Chalk

& talk

40

Insertion sort-the

algorithm-

analysis of

insertion sort

236-237

Chalk

& talk

41 Shell sort 240

PPT

42

Quick sort-

picking the pivot-

partitioning

strategy-small

251-261

Chalk

& talk

67

arrays-actual

Quick sort

routines-analysis

of quick sort-A

linear expected

time algorithm for

selection

43 Heap sort 242-244

Chalk

& talk

44 Merge sort 246-248

Chalk

& talk

45 Radix sort Web

PPT

46 Searching RB -

2(27)

Chalk

& talk

47 Linear search RB-

2(27)

PPT

48 Binary search RB-

2(34)

Chalk

& talk

68

9. REVISED BLOOM’S TAXONOMY BASED ASSESSMENT

PATTERN:

Revised

Bloom’s

Category

Internal University

Examination

%

Session

Test- I

%

Mid Term

Test I %

Session

Test- II

%

Mid Term

Test II

%

Remember 100 50 40 40 40

Understand 50 30 30 30

Apply 30 30 30

Analyse

Evaluate

Create

Revised

Bloom’s

Category

Assignments

I


(max marks in %)

II


(max marks in %)

Remember

Understand

Apply 80 70

Analyse 20 30

Evaluate

Create

69




1. Write down the definition of data structures?

2. Define Algorithm?

3. Define Space Complexity and explain it with any search algorithm?


1. Define file structure?

2. What are the components used by line search algorithm?

3. Define Recursion with programmatic illustration?


1. What is heap memory?

2. Define heap structure

3. Write and explain the best case notation for Merge Sort?


1. What is Red black tree?

2. Difference between Binary tree and recursive binary tree?

3. Write about operations in linked linear lists


1. Define linear search?

2. Calculate the time complexity for the following loop?

Loop definition: for i,n

For(i=0,j=1;i<=n,j<=n;i+1,j+1)

3. Explain heap sort?

70





Year/Sem SECOND YEAR/IV SEM Duration-3 hrs

SubjectCode/

Title

U4CSB01

DATA STRUCTURES & C

PROGRAMMING Max Marks-100

Branch EEE

Execution Plan

Sl.No Activities Time(Minutes)


2 Part-A 2 Minutes * 10 Questions 20

3 Part-B 10 Minutes * 5 Questions 50

4 Part-C 20 Minutes * 5 Questions 100


Total 180


PART-A (10 × 2 marks = 20 marks)

(Answer ALL Questions. Each question carries 2 marks.)

1. [CO1] Write down the definition of data structures?

2. [CO1] Define Algorithm?

3. [CO2] Define file structure?

4. [CO2] What are the components used by line search algorithm?

5. [CO3] What is heap memory?

6. [CO3] Define heap structure

7. [CO4] What is Red black tree?

8. [CO4] Difference between Binary tree and recursive binary tree?

9. [CO5] Define linear search?

10. [CO5] Calculate the time complexity for the following loop?

Loop definition: for i,n For(i=0,j=1;i<=n,j<=n;i+1,j+1)

71

PART-B (6 × 5 marks = 30 marks)

(Answer ALL Questions. Each question carries 5 marks.)

11. (a) [CO1] Define Space Complexity and explain it with any search

algorithm?

[OR]

(b) [CO1] Define depth of recursion with an example?

12. (a) [CO2] Define Recursion with programmatic illustration?

[OR]

(b) [CO2] What is a Fibonacci sequence?

13. (a) [CO3] Write and explain the best case notation for Merge Sort?

[OR]

(b) [CO3] Define Worst fit, Best fit and first fit

14. (a) [CO4] Write about operations in linked linear lists

[OR]

(b) [CO4] Explain in detail about insertion sort.

15. (a) [CO5] Explain heap sort?

[OR]

(b) [CO5] Explain shortest path algorithm with example?

PART-C (5 × 10 marks = 50 marks)

(Answer ALL questions. Each question carries 10 marks)

16. (a) i)[CO1] Develop an algorithm to compute the sums for the first n

terms S=1+ (1/2) + (1/3) +…. (5)

ii) [CO1] Discuss in detail about the implementation of the algorithm. (5)

[OR]

(b) i) [CO1] Write an algorithm to reverse the digits of a decimal number. (5)

ii)[CO1] Write an algorithm to compute the Fibonacci series for ‘n’

terms.(5)

17. (a) i)[CO2] Write a ‘c’ program to multiply two polynomials. (5)

ii) [CO2] Write a ‘c’ program to add two polynomials. (5)

[OR]

(b) i) [CO2] Write an algorithm to convert infix to postfix expression and

explain it with example (5)

ii) [CO2] Write an algorithm to evaluate a postfix expression and

explain it with example (5)

72

18. a) [CO3] Write a C program to perform Merge sort and analyze time

complexity of the Same.

[OR]

b) [CO3] State & explain the algorithm to perform Shell sort. Also

analyze the time Complexity.

19. a) [CO4] Formulate an algorithm to find the shortest path using

Dijkstra’s algorithm and explain with example

[OR]

b) [CO4] Explain garbage collection with their variations.

20. a) [CO5] Explain in detail about Merge sort and bubble sort.

[OR]

b) [CO5] Explain in detail about linear search and binary search.

73

U4MEB55 APPLIED THERMODYNAMICS AND FLUID

MECHANICS

1. PREAMBLE

This course introduces the Laws of Thermodynamics and its applications

towards Gas Turbines & Steam Boilers and Turbines. It also discusses about the

Concepts, Properties, Statics and Kinematics of a Fluid and understanding its

Dynamics of Fluid flow.

2. PRE-REQUISITE

Basic Mechanical and Civil Engineering.

Engineering Physics.

Engineering Chemistry.

3. LINKS TO OTHER COURSES

Energy Engineering.

Renewable Energy.

4. COURSE EDUCATIONAL OBJECTIVES


The basics of systems and surroundings of heat and mass transfer

The basic concepts about the Laws of Thermodynamics.

The working principles of Gas Turbines and Steam Boilers.

The fluid concepts and properties and its relation to Heat and pressure.

The fluid’s static Kinematics and Dynamics.

5. COURSE OUTCOMES:


CO


Level of learning

domain (Based on

revised Bloom’s

taxonomy)

C01 Understand the concepts and environment of

thermal engineering

K1

C02 Emphasize the basic laws of thermodynamics

and its applications.

K1

C03 Demonstrate the working of Gas turbines and

Steam boilers

K3

C04 Synthesize the concepts & properties of Fluids K3

C05 Apply the static dynamics and kinematics of the

fluid flow

K3

L T P C

3 0 0 3

74


Course

Out

comes

PROGRAM OUTCOMES


CO1 L L L L

CO2 L L L

CO3 H H H H

CO4 H H H

CO5 H H H H

7. SYLLABUS

UNIT I: BASIC CONCEPTS ON THERMAL ENGINEERING 9

Classical approach: Thermodynamic systems- Boundary- Control volume-

system and surroundings- Universe- properties- state process- cycle-

equilibrium- work and heat transfer- point and path functions.

UNIT II: LAWS OF THERMODYNAMICS 9

First law of thermodynamics for open and closed systems- First law applied to

control volume- SFEE equations(Steady flow energy equations)- Second law of

thermodynamics- Heat engines- Refrigerators and heat pumps- Carnot cycle-

Carnot theorem.

UNIT III: GAS TURBINES AND STEAM BOILERS 9

Open and closed cycle gas turbines- Ideal and actual cycles- Brayton cycle-

cycle with reheat, inter cooling and regeneration- Application of gas turbines for

aviation and power generation.

Formation of steam- Properties of steam- Use of steam tables and charts- Steam

power cycle (Rankine) - Modern features of high pressure boilers- Mountings

and accessories.

UNIT IV: FLUID CONCEPTS & PROPERTIES 9

Fluid – definition, real and ideal fluids - Distinction between solid and fluid -

Units and dimensions - Properties of fluids - density, specific weight, specific

volume, specific gravity, viscosity, capillary and surface tension,

compressibility and vapour pressure – Temperature influence on fluid properties

- Fluid statics –Absolute and gauge pressures – pressure measurements by

manometers and pressure gauges.

UNIT V: FLUID STATICS KINEMATICS AND DYNAMICS 9

Fluid Kinematics - Flow visualization - types of flow – lines of flow - velocity

field and acceleration. Fluid dynamics – Euler’s equation of motion – Euler’s

75

equation of motion along a streamline – Bernoulli equation and its application –

Venturi, orifice and flow nozzle meters – Pitot tube.

Total: 45 Periods

7.1 Text books

1. P.K. Nag, ‘Basic and Applied Engineering Thermodynamics’, Tata

McGraw Hill, New Delhi, 2002.

2. B.K. Sachdeva, ‘Fundamentals of Engineering Heat and Mass

Transfer (SI Units)’, New Age International (P) Limited, Chennai,

2003.

3. Bansal, R.K., “Fluid Mechanics and Hydraulics Machines”, (5th

edition), Laxmi publications (P) Ltd, New Delhi, 1995

7.2.Reference books

1. Rogers and Mayhew, ‘Engineering Thermodynamics – Work and Heat

Transfer’, Addision Wesley, New Delhi, 1999.

2. Eastop and McConkey ‘Applied Thermodynamics’, Addison Wesley,

New Delhi. 1999.

3. M.L. Mathur and F.S. Metha, ‘Thermal Engineering’, Jain Brothers,

New Delhi, 1997.

4. B.K. Sankar, ‘Thermal Engineering’, Tata McGraw Hill, New Delhi,

1998

7.3 Online Resources

www.nptel.com


76

8.LESSON PLAN

Sl.

No Topics

Text

book1

(Page

No)

Text

book 2

(Page

No)

Web Link/ Other

Resources

Delivery

Method


1

Classical

approach:

Thermodyn

amic

systems

2-7 5-9

http://www.brighthubengi

neering.com/thermodyna

mics/3733-what-is-a-

thermodynamic-system/

PPT

2 Boundary 8 9-11

http://mechanicalinventio

ns.blogspot.in/2012/06/w

hat-is-system-boundary-

and-surrounding.html

Chalk &

Talk

3 Control

volume 9 15

http://www-

mdp.eng.cam.ac.uk/web/l

ibrary/enginfo/aerotherm

al_dvd_only/aero/fprops/

cvanalysis/node10.html

Chalk &

Talk

4

system and

surrounding

s- Universe

10 20

http://chemwiki.ucdavis.e

du/Physical_Chemistry/T

hermodynamics/A_Syste

m_And_Its_Surroundings

Chalk &

Talk

5

properties-

state

process-

cycle-

equilibrium

11-13 22

http://web.mit.edu/16.unif

ied/www/FALL/thermod

ynamics/notes/node11.ht

ml

Chalk &

Talk

6

work and

heat

transfer

48-62 26-28

https://www.boundless.co

m/chemistry/textbooks/bo

undless-chemistry-

textbook/thermochemistr

y-6/introduction-to-

thermodynamics-58/heat-

and-work-276-3605/

Chalk &

Talk

7

point and

path

functions.

50-51 32

http://www.ecourses.ou.e

du/cgi-

bin/ebook.cgi?topic=th&c

hap_sec=01.3&page=the

ory

Chalk &

Talk

UNIT TEST-1

77

Unit Test – II (CO2)

8

First law of

thermodyna

mics for

open and

closed

systems

78-80 38

http://www.learnengineer

ing.org/2013/03/frist-law-

of-thermodynamics-open-

system.html

Chalk &

Talk

9

First law

applied to

control

volume-

SFEE

equations

(Steady

flow energy

equations)-

103-106 42


ied/www/FALL/thermod

ynamics/notes/node19.ht

ml

Chalk &

Talk

10

Second law

of

thermodyna

mics

132 56

http://hyperphysics.phy-

astr.gsu.edu/hbase/thermo

/seclaw.html

Chalk &

Talk

11 Heat

engines 133-135 62



/heaeng.html

Chalk &

Talk

12

Refrigerato

rs and heat

pumps

137 63


ied/www/SPRING/propul

sion/notes/node24.html

ppt

13 Carnot

cycle 146 74



/carnot.html

Chalk &

Talk

14 Carnot

theorem. 150 75

http://www.thebigger.co

m/chemistry/thermodyna

mics/second-law-of-

thermodynamics/give-its-

Chalk &

Talk

MID TERM-1

Unit Test – III (CO3)

15

Open and

closed cycle

gas turbines

478 86

http://www.authorstream.

com/Presentation/ikram0

175-826586-open-and-

closed-cycle-gas-turbine/

Chalk &

Talk

16 Ideal and

actual cycles 491 92

http://nptel.ac.in/courses/I

IT-

MADRAS/Applied_Ther

Chalk &

Talk

78

modynamics/Module_5/6

_Deviation_of_Actual_C

ycle_from_ideal_Cycle.p

df

17

Brayton

cycle- cycle

with reheat,

inter cooling

and

regeneration

566 93

http://nptel.ac.in/courses/

101101001/downloads/In

tro-Propulsion-Lect-

18.pdf

Chalk &

Talk

18

Application

of gas

turbines for

aviation and

power

generation.

580 93-95

http://www.wartsila.com/

energy/learning-

center/technical-

comparisons/gas-turbine-

for-power-generation-

introduction

Video

Lectures

19

Formation of

steam-

Properties of

steam-

615 99

http://mes2005.tripod.co

m/Steam_and_its_propert

ies.pdf

Chalk &

Talk

20

Use of steam

tables and

charts

308 101

http://www.engineersedg

e.com/thermodynamics/st

eam_tables.htm

Chalk &

Talk

21

Steam power

cycle

(Rankine)

691 102

http://nptel.ac.in/courses/I

IT-

MADRAS/Applied_Ther

modynamics/Module_5/2

_%20Rankinecycle.pdf

Chalk &

Talk

22

Modern

features of

high pressure

boilers

701 103

http://me-

mechanicalengineering.co

m/high-pressure-boilers-

features-and-advantages/

Chalk &

Talk

23

Mountings

and

accessories

703 108

http://engineering.myindi

alist.com/2013/to-study-

the-working-and-

function-of-mounting-

accessories-in-boiler-

bme-lab-manual/

PPT

UNIT TEST-2

Unit Test – IV (CO4)

24 Fluid –

definition, 1 112

http://mechteacher.com/fl

uid/

Video

Lectures

79

real and

ideal fluids

25

Distinction

between

solid and

fluid

1 114


112104118/lecture-1/1-4-

dif-sol-fluid.htm

Chalk &

Talk

26 Units and

dimensions 1-2 116

http://www.engineeringto

olbox.com/terminology-

units-d_963.html

Chalk &

Talk

27

Properties of

fluids -

density,

specific

weight,

specific

volume,

specific

gravity,

viscosity,

capillary and

surface

tension

2 118

http://elearning.vtu.ac.in/

12/enotes/FM/Unit1-

VMR.pdf

Chalk &

Talk

28

compressibil

ity and

vapour

pressure

21-22 120

http://aliveblogs.com/bul

k-modulus-

compressibility-and-

vapor-pressure/

Chalk &

Talk

29

Temperature

influence on

fluid

properties

17-19 122

http://www.engineersedg

e.com/thermodynamics/ef

fect_temp_fluid_prop.ht

m

Chalk &

Talk

30 Fluid statics 35 123

http://www.physics.umd.

edu/courses/Phys260/aga

she/S09/notes/lecture4.pd

f

Chalk &

Talk

31

Absolute and

gauge

pressures –

pressure

measurement

s by

manometers

and pressure

41 140 http://www.nist.gov/calib

rations/upload/pmc-2.pdf

Chalk &

Talk

80

gauges

32

Fluid

Kinematics-

Flow

visualization

- types of

flow.

163 145

http://elearning.vtu.ac.in/

12/enotes/FM/Unit2A-

VK.pdf

Chalk &

Talk

33 lines of flow 163-

165 148


112104118/lecture-7/7-

7_streamline.htm

Chalk &

Talk

34

velocity field

and

acceleration.

174 150

https://ecourses.ou.edu/cg

i-

bin/ebook.cgi?doc=&topi

c=fl&chap_sec=03.4&pa

ge=theory

Chalk &

Talk

35 Fluid

dynamics 259 165

http://www.livescience.co

m/47446-fluid-

dynamics.html

Chalk &

Talk

36

Euler’s

equation of

motion

260-

261 170


112104118/lecture-12/12-

3_euler_eqn_motion.htm

Chalk &

Talk

37

Euler’s

equation of

motion along

a streamline

261 180

http://www.codecogs.co

m/library/engineering/flui

d_mechanics/fundamenta

ls/eulers-equation.php

Chalk &

Talk

38

Bernoulli

equation and

its

application

265 185

http://www.efm.leeds.ac.

uk/CIVE/CIVE1400/Sect

ion3/bernoulli-apps.htm

Chalk &

Talk

39

Venturi,

orifice and

flow nozzle

meters

265-

285 190

http://www.brighthubengi

neering.com/hydraulics-

civil-engineering/52906-

orifice-flow-nozzle-and-

venturi-meter-for-pipe-

flow-measurement/

Chalk &

Talk

40 Pitot tube. 285-

286 195

http://www.engineeringto

olbox.com/pitot-tubes-

d_612.html

Chalk &

Talk

81

9. BLOOM’S TAXONOMY BASED ASSESSMENT PATTERN

Revised

Bloom’s

Category

Internal

University

Examination

%

Session

Test- I

%

Mid

Term

Test I

%

Session

Test- II

%

Mid

Term

Test II

%

Remember 100 40 40 40 20

Understand 40 40 40 60

Apply 20 20 20 20

Analyse

Evaluate

Create

Revised

Bloom’s

Category

Assignments

I


(max marks in %)

II


(max marks in %)

Remember 40 40

Understand 40 40

Apply 20 20

Analyse

Evaluate

Create

82




1. Describe System and Surroundings.

2. Explain Equilibrium in thermodynamics forms.

3. Explain point and path functions.


1. Explain First law of Thermodynamics.

2. What is a Heat Engine?

3. Explain a heat pump.


1. Explain thermodynamic loop.

2. What is a steam table?

3. Explain Ideal and Actual Loops.


1. Explain Viscosity.

2. What is gauge pressure?

3. Differentiate Solids and Fluids.


1. Explain fluid flow.

2. What is a pitot tube?

3. Explain Euler’s equation

83



B.Tech DEGREE MODEL QUESTION


Year / Sem SECOND YEAR / 4th Sem Duration: 3 Hrs

Subject

Code / Title

U4MEB55 /

APPLIED THERMODYNAMICS AND

FLUID MECHANICS

Max Marks : 100

Branches EEE

EXECUTION PLAN







Total 180




1. [CO1] Describe System and Surroundings.

2. [CO1] Explain Equilibrium in thermodynamics forms.

3. [CO2] Explain First law of Thermodynamics.

4. [CO2] What is a Heat Engine?

5. [CO3] Explain thermodynamic loop.

6. [CO3] What is a steam table?

7. [CO4] Explain Viscosity.

8. [CO4] What is gauge pressure?

9. [CO5] Explain fluid flow.

10. [CO5] What is a pitot tube?

84

Part-B (6 Marks) (5 x 6=30 Marks)

Answer All Question

11. (a) [CO1] Explain point and path functions.

[OR]

(b) [CO1] Explain in terms of Thermodynamics, the boundary conditions

of an object.

12. (a) [CO2] Explain a heat pump.

[OR]

(b) [CO2] Explain a Refrigerator.

13. (a) [CO3] Explain Ideal and Actual Loops.

[OR]

(b) [CO3] what is a Gas Turbine.

14. (a) [CO4] Differentiate Solids and Fluids.

[OR]

(b) [CO4] Explain the basic properties of Fluids.

15. (a) [CO5] Explain Euler’s equation.

[OR]

(b) [CO5] Explain the working of a Pitot tube.

Part-C (10 Marks) (5 x 10=50 Marks)

Answer all Questions

16. (a) [CO1] Explain the properties of System, Space and Surroundings.

[OR]

(b) [CO1] Explain Work and Heat transfer.

17. (a) [CO2] Derive Carnot’s theorem.

[OR]

(b) [CO2] Define SFEE equations.

18. (a) [CO3] what is Rankine Cycle?

[OR]

(b) [CO3] Explain the applications of Gas Turbines.

19. (a) [CO4] what are the temperature influences of fluid properties?

[OR]

(b) [CO4] Explain the pressure measurement process of fluids by

manometers and pressure gauges.

20. (a) [CO5] What are the applications of Bernoulli’s equation?

[OR]

(b) [CO5] Explain Venturi, Orifice and Flow nozzle meters.

85

U4EEB12 AC MACHINES LAB

1. PREAMPLE: The course AC Machines laboratory provides an introduction to AC machines

(Induction machine and synchronous machine), various methods to determine

regulation of alternator and OC test and SC test for both single and three phase

Induction motor to determine its efficiency.

2. PREREQUSITE: Basic introduction to AC machines, methodologies to determine regulation of

Alternator and types of Induction machines

3. RELATED COURSES: Solid State Drives AC Machines, Control System, and Special Electrical

Machines



The operation of AC Machines.

Experimental skills in determining efficiency and regulation of AC

Machines

L T P C

0 0 3 2

86

5. COURSE OUTCOME:

Students undergoing this course are able to

CO


Level of learning

domain (Based on

revised Bloom’s

taxonomy)

C01

Conduct experiment to calculate voltage regulation of

three phase Alternator using EMF, MMF, ZPF and

ASA methods.

S2

C02 Conduct experiment to obtain V and inverted V curves

of synchronous motor. S2

C03 Determine the efficiency of three phase Induction

motor using load test S3

C04 Calculate the equivalent circuit parameters of Induction

motors using No load test and Blocked rotor test S3

C05 Appreciate different starting methods of single phase

induction motor S2

CO6 Demonstrate the parallel operation of Alternators K3

6. CORRELATION WITH PROGRAMME OUTCOMES:

Course

Out

comes

Programme Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 P10 PO11 PO12

CO1 M M M M M

CO2 M M M M M

CO3 H H H H H

CO4 H H H H H

CO5 M M M M M

CO6 M M M M M

87

7. LIST OF EXPERIMENTS

CYCLE-I

1. Determination of voltage Regulation of three phase alternator by EMF

and MMF methods

2. Determination of voltage Regulation of three phase alternator by ZPF

and ASA methods

3. Slip test on three phase alternators.

4. V and Inverted V curves of Three Phase Synchronous Motor

5. Load test on three-phase induction motor

CYCLE -II

1. No load and blocked rotor test on three-phase induction motor.

2. Separation of No-load losses of three-phase induction motor

3. Load test on single-phase induction motor

4. No load and blocked rotor test on single-phase induction motor

5. Study of different Starting methods of single phase Induction motors

6. Parallel operation of alternators (demonstration)

88

8.ASSESSMENTPATTERN:

RUBRICS FOR INTERNAL ASSESSMENT

Excellent (5) Very Good

(4) Good (3) Average (2) Low (0)

Observation

& Record

(5)

On Time

Submission

with neat

presentation

Submission

before next

lab with

presentation

Submission

on next lab

hour

Late

Submission

Not

Submitted

Experiment

Performance

(5)

On Time

Submission

with neat

presentation

Submission

before next

lab with

presentation

Submission

on next lab

hour

Late

Submission

Not

Submitted

Result

(5)

Clarity and

pleasant

output in

screen

Representin

g output in

better

manner

Partially

visual

clarity in

output

Output shown

in not proper No output

Performance Excellent

(2.5)

Very good

(2.0) Good (1.5) Average (1) Low (0)

Viva Voce

(2.5)

Good

knowledge

in subject

Answering

all questions

Partially

answering

Attempting

for answering

Not

answering

any

questions

Attendance

(2.5)

90% and

above 80-89% 75-79% -

74% and

below

89

9. MODEL QUESTION PAPER

1. Determine of voltage Regulation of three phase alternator by

pessimistic and optimistic methods.

2. Determine of voltage Regulation of three phase alternator by ZPF and

ASA methods

3. Find slip by Slip test on three phase alternators.

4. Find V and Inverted V curves for Three Phase Synchronous Motor

5. Determine efficiency on three-phase induction motor.

6. Determine the losses by No load and blocked rotor test on three-phase

induction motor.

7. Find the losses in same identical machines by Separation of No-load

losses of three-phase induction motor

8. Determine the efficiency of single-phase induction motor.

9. Explain the different Starting methods of single phase Induction

motors.

10. Demonstration the Parallel operation of alternators

90

U4EEB13 CONTROL SYSTEMS LAB

1. PREAMBLE:

The course provides a platform for understanding the basic concepts of linear

control theory and its application to practical systems.

2. PREREQUISTE

Knowledge in Electric Circuit theory, Machines, Laplace Transforms

3. RELATED COURSES

Linear Integrated Circuits, Drives and Control


Students undergoing this course are expected

To determine the transfer functions of various electrical systems

experimentally

To simulate the first order and second order systems

To do the stability analysis of the systems

L T P C

0 0 3 2

91

5. COURSE OUTCOME


CO


Level of learning

domain (Based

on revised

Bloom’s

taxonomy)

C01 Obtain the transfer functions of DC Generator and

motors independently S2

C02 Obtain the transfer functions of DC and AC

Servomotors independently S3

C03 Obtain the step response of the first and second order

systems with and without dead time using MATLAB S2

C04 Perform the stability analysis of linear systems using

MATLAB software. S2

C05 Compare the performance of the various controllers

(P,PI and PID) for servo systems S3

C06 Obtain the step response of type-0 and type-1

system using Analog simulator S2


Course

Out

comes

Programme Outcomes


CO1 M M M M M

CO2 H H H H H

CO3 M M M M M

CO4 M M M M M M

CO5 H H H H H H

CO6 M M M M M

92

7. SYLLABUS

List of Experiments:

CYCLE I 1. Determination of transfer functions of DC Generator.

2. Determination of transfer functions of DC Motor.

3. Determination of transfer functions of DC Servomotor.

4. Determination of transfer functions of AC Servomotor

5. Step response of first order systems(with and without dead time) using

MATLAB

CYCLE II

6. Step response of second order systems(under damped, undamped, over

damped and critically damped) using MATLAB

7. Stability analysis of linear systems (Bode, root locus and Nyquist plot)

using MATLAB

8. DC and AC position control systems with P,PI and PID

9. Design of lag, lead and lag-lead compensator for type-0, type-1 system.

93

8. ASSESSMENT PATTERN:


Excellent

(5)

Very Good


Observation

& Record

(5)

On Time

Submission

with neat

presentation

Submission

before next

lab with

presentation

Submission

on next lab

hour

Late

Submission

Not

Submitted

Experiment

Performance

(5)

On Time

Submission

with neat

presentation

Submission

before next

lab with

presentation

Submission

on next lab

hour

Late

Submission

Not

Submitted

Result

(5)

Clarity and

pleasant

output in

screen

Representin

g output in

better

manner

Partially

visual

clarity in

output

Output

shown in not

proper

No output


(2.5)

Very good

(2.0) Good (1.5) Average (1) Low (0)

Viva Voce

(2.5)

Good

knowledge

in subject

Answering

all questions

Partially

answering

Attempting

for

answering

Not

answering

any

questions

Attendance

(2.5)

90% and

above 80-89% 75-79% -

74% and

below

94

MODEL QUESTION PAPER

1. By experiment obtain the transfer function parameters of a DC generator

2. Obtain the transfer function parameters of Dc motor

3. Obtain the transfer function parameters of Dc servo motor

4. Obtain the transfer function parameters of AC servo motor

5. Consider a open loop system G(s) = 1/s ,check the response for step input

with unity feed back with and without dead time and comment on the

result

6. Given a system with open loop transfer function G(s) = 1/s(s+2) obtain the

closed loop response for a step input.

7. Check the stability of the system with bode, Nyquist and root locus

method for the system with open loop transfer function G(s) =

10/s(s+4)(s+6)

8. Check the response of a lag, lead compensators when connected to a type

1 system and type 2 system .

9. Control the position of the given DC or AC motor with the given trainer

kit.

95

U4CSB05 DATA STRUCTURES & C PROGRAMMING

LAB

1. PREAMBLE:

This course, U3CSB05 Data Structures & C Programming Lab, programs will

be implemented based on lab syllabus, that are related to content which is given

in theory and executed in C & C++ programming language.

2. PRE-REQUISITES:

Computer Practice Laboratory

3. RELATED COURSES:

Compiler Design Lab

Network Lab


Students undergoing this course are expected to

Be familiarized with good programming design methods, particularly

Top- Down design.

Get exposure in implementing the different data structures using C++

Appreciate recursive algorithms.

5. COURSE OUTCOMES:


CO


Level of learning

domain (Based on

revised Bloom’s

taxonomy)

C01 Design and implement C++ programs for

manipulating stacks, queues, linked lists, trees.

S3

C02 Apply good programming design methods for

program development.

S3

C03 Apply the different data structures for

implementing solutions to practical problems.

S3

C04 Develop recursive programs. S2

C05 Develop Programs for Searching and Sorting. S3

L T P C

0 0 3 2

96

6.CORRELATED WITH PROGRAMME OUTCOMES:

Course

Out

comes

Programme Outcomes


CO1 H H H H H H

CO2 H H H H H H

CO3 H H H H H H

CO4 M M M M M M

CO5 H H H H H H

7. LIST OF EXPERIMENTS:

CYCLE I

S.No Experiment name

1 Implementation of Stack using Array

2 Implementation of Queue using Array

3 Implementation of linked list

4 Implementation of stack using linked list

5 Infix to postfix conversion

6 Evaluation of postfix expression

CYCLE II

7 Implementation of Binary Search Tree

8 Implementation of Breadth First Search and Depth First Search

9 Insertion Sort and Bubble Sort

10 Heap Sort

11 Quick Sort

12 Linear and Binary Search.

97

8.ASSESSMENT PATTERN:


Excellent (5) Very Good


Observation &

Record

(5)

On Time

Submission

with neat

presentation

Submission

before next

lab with

presentation

Submission

on next lab

hour

Late

Submission

Not

Submitted

Experiment

Performance

(5)

On Time

Submission

with neat

presentation

Submission

before next

lab with

presentation

Submission

on next lab

hour

Late

Submission

Not

Submitted

Result

(5)

Clarity and

pleasant

output in

screen

Representin

g output in

better

manner

Partially

visual

clarity in

output

Output

shown in not

proper

No output


(2.5)

Very good

(2.0) Good (1.5) Average (1) Low (0)

Viva Voce

(2.5)

Good

knowledge

in subject

Answering

all questions

Partially

answering

Attempting

for

answering

Not

answering

any

questions

Attendance

(2.5)

90% and

above 80-89% 75-79% -

74% and

below

98

MODEL QUESTION PAPER

1. Write a program to Implement Stack using Array.

2. Write a program to Implement Queue using Array.

3. Write a program to Implement linked list.

4. Write a program to Implement stack using linked list.

5. Write a program to Evaluation of postfix expression.

6. Write a program to Implementation of Binary Search Tree.

7. Write a program to Implementation of Breadth First Search and Depth First

Search.

8. Write a program to Insertion Sort and Bubble Sort.

9. Write a C program to make use of Heap Sort.

10. Write a C program to make use of Quick Sort.

11. Write a C program to make use of Linear and Binary Search.

99

PROGRAMME OUTCOMES:

At the time of graduation, students from the Electrical and Electronics

Engineering program will possess:

1. Ability to apply the knowledge in Mathematics, Basic science and

Engineering in all aspects of Electrical and Electronics Engineering.

2. Ability to communicate effectively and to prepare formal technical plans

leading to solutions for Electrical and Electronics systems.

3. The broad theoretical knowledge in the field of Electrical and Electronics

Engineering and methods of applying them to identify, formulate and

solve practical problems

4. Ability to apply the techniques of using appropriate tools to investigate,

analyze, design, simulate and complete systems involving in generation,

transmission and distribution of electrical energy.

5. Ability to assess the feasibility, applicability, optimality and future scope

of power networks and apparatus.

6. Expertise to work in a team and comprehend his/her scope of work,

deliverables and issues in which help is needed by other members of the

team.

7. Familiarity with project management problems and basic financial

principles for a multi-disciplinary work.

8. Ability to align and upgrade themselves to higher learning and research

activities.

9. Ability to participate and succeed in competitive examinations like

GATE, GRE and TOFEL and other competitive Examinations

10. Ability to understanding the impact of professional, social, environmental

and ethical issues and proper use of renewable resources.

11. Ability to apply theoretical in laboratory environment and will be able to

work in in integrated engineering problems.

12. The broad education necessary to understand Project and cost

effectiveness.

100

HOD DETAILS

Head of the Department Contact Number

Dr. P. Chandrasekar 9095195881

COURSE HANDLING FACULTY DETAILS

Name of the course Name of Faculty Contact

Number

U4MAB03

Numerical Methods Mr. P. Sangeetha 7401539964

U4EEB08

AC Machines Mr. P. Karthick 9551869745

U4EEB18

Digital Logic Circuits Mr. K. Ganesan 9840865385

U4EEB10

Linear Control Systems

Dr. A. Abudhahir /

Mr. G. R. Karthi

9940226524 /

9500119413

U4CSB01

Data Structures & C Programming Mrs. M. Uvaneshwari 7299313835

U4MEB55

Applied Thermodynamics and fluid

Mechanics

Mr. D. Surender 9790128848

U4EEB12

AC Machines lab Mr. A. Rajasekar 9994739155

U4EEB13

Control Systems lab Mr. G. R. Karthi 9500119413

U4CSB05

Data Structure & C Programming Lab Mrs. M. Uvaneshwari 7299313835

school of electrical and computing

Documents