3rd sem course file final for nbabldeacet.ac.in/pdf/coursefile/cs/cse_3rd_sem_coursefile...% / ' ( $...

B.L.D.E.A’s Dr. P. G. Halakatti College of Engineering and Technology, Vijayapur-586103

B.E. Computer Science and Engineering

Department of Computer Science & Engineering (2018-19) Page 1

Department Vision

To provide valuable human resources to the society through Quality Technical

Education and Research with moral values

Department Mission

To educate the students in Computer Science and Engineering by imparting

Quality Technical Education and Research to meet the needs of profession and

society with ethical values.

Programme Educational Objectives (PEOs)

I. A Graduate will be a successful IT professional and function effectively in

multidisciplinary domains.

II. A Graduate will have the perspective of lifelong learning for continuous

improvement of knowledge in Computer Science & Engineering, higher studies,

and research.

III. A Graduate will be able to respond to local, national and global issues by

imparting his/her knowledge of Computer Science & Engineering in

Educational, Government, Financial and Private sectors.

IV. A Graduate will be able to function effectively as an individual, as a team

member and as a team leader with highest professional and ethical standards.




Programme Outcomes(POs) A graduate of the Computer Science and Engineering Program will demonstrate: PO1: Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering specialization to the solution of complex engineering problems. PO2: Problem analysis: Identify, formulate, review research literature, and analyze complex engineering problems reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences PO3: Design/development of solutions: Design solutions for complex engineering problems and design system components or processes that meet the specified needs with appropriate consideration for the public health and safety, and the cultural, societal, and environmental considerations. PO4: Conduct investigations of complex problems: Use research-based knowledge and research methods including design of experiments, analysis and interpretation of data, and synthesis of the information to provide valid conclusions. PO5: Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools including prediction and modeling to complex engineering activities with an understanding of the limitations PO6: The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional engineering practice. PO7: Environment and sustainability: Understand the impact of the professional engineering solutions in societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable development. PO8: Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice. PO9: Individual and team work: Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary settings. PO10: Communication: Communicate effectively on complex engineering activities with the engineering community and with society at large, such as, being able to comprehend and write effective reports and design documentation, make effective presentations, and give and receive clear instructions. PO11: Project management and finance: Demonstrate knowledge and understanding of the engineering and management principles and apply these to one’s own work, as a member and leader in a team, to manage projects and in multidisciplinary environments. PO12: Life-long learning: Recognize the need for, and have the preparation and ability to engage in independent and life-long learning in the broadest context of technological change.

Programme Specific Outcomes (PSOs)

Graduates will be able to

1. Computational skills: Apply the knowledge of Mathematics and Computational Science to solve societal problems in various domains. 2. Programming Skills: Design, Analyze and Implement various algorithms using broad range of programming languages.

3. Product Development Skills: Utilize Hardware and Software tools to develop solutions to IT problems.




Table of Contents

Sl. No. Subject Code Subject Page No.

III Semester 1. 17CS31 Engineering Mathematics-III 04

2. 17CS32 Analog and Digital Electronics 23

3. 17CS33 Data Structures and Applications 36

4. 17CS34 Computer Organization 56

5. 17CS35 Unix and Shell Programming 68

6. 17CS36 Discrete Mathematical Structures 87

7. 17CSL37 Analog and Digital Electronics Laboratory

108

8. 17CSL38 Data Structures Laboratory 110




ENGINEERING MATHEMATICS-III Course Code: 17MAT31 CIE Marks: 40 Contact Hours/Week: 04 SEE Marks: 60 Total Hours: 50 Exam Hours: 03 Semester: III Credits: 04(4:0:0) Course Learning Objectives: The objectives of this course is to introduce students to the mostly used analytical and numerical methods in the different engineering fields by making them to learn Fourier series, Fourier transforms and Z-transforms, statistical methods, numerical methods to solve algebraic and transcendental equations, vector integration and calculus of variations.

MODULES RBT Levels

No. of Hrs

MODULE-I

Fourier Series: Periodic functions, Dirichlet’s condition, Fourier Series of periodic functions with period 2π and with arbitrary period 2c. Fourier series of even and odd functions. Half range Fourier Series, practical harmonic analysis-Illustrative examples from engineering field.

L1 & L2

10

MODULE-II:

Fourier Transforms: Infinite Fourier transforms, Fourier sine and cosine transforms. Inverse Fourier transforms.

Z-transform: Difference equations, basic definition, z-transform-definition, Standard z-transforms, Damping rule, Shifting rule, Initial value and final value theorems (without proof) and problems, Inverse z-transform. Applications of z-transforms to solve difference equations.

L1 & L2

10

MODULE- III:

Statistical Methods: Review of measures of central tendency and dispersion. Correlation-Karl Pearson’s coefficient of correlation-problems. Regression analysis- lines of regression (without proof) –problems

Curve Fitting: Curve fitting by the method of least squares- fitting of the curves of the form, and .

Numerical Methods: Numerical solution of algebraic and transcendental equations by Regula- Falsi Method and Newton-Raphson method.

L1 & L2

10

MODULE- IV :

Finite differences: Forward and backward differences, Newton’s forward and backward interpolation formulae. Divided differences- Newton’s divided

L1 & L2




difference formula. Lagrange’s interpolation formula and inverse interpolation formula (all formulae without proof)-Problems.

Numerical integration: Simpson’s (1/3) and (3/8) rules, Weddle’s rule (without proof) –Problems.

10

MODULE-V:

Line integrals-definition and problems, surface and volume integrals- definition, Green’s theorem in a plane, Stokes and Gauss-divergence theorem (without proof) and problems.

Calculus of Variations: Variation of function and Functional, variation problems. Euler’s equation, Geodesics, hanging chain, problems.

L2 & L3

10

Course Outcomes: On completion of this course, students are able to:

1. Know the use of periodic signals and Fourier series to analyze circuits and system communications.

2. Explain the general linear system theory for continuous-time signals and digital signal processing using the Fourier Transform and z-transform.

3. Employ appropriate numerical methods to solve algebraic and transcendental equations. 4. Apply Green's Theorem, Divergence Theorem and Stokes' theorem in various

applications in the field of electro-magnetic and gravitational fields and fluid flow problems.

5. Determine the extremals of functionals and solve the simple problems of the calculus of variations.

Question Paper Pattern: Note: - The SEE question paper will be set for 100 marks and the marks will be proportionately

reduced to 60.

The question paper will have ten full questions carrying equal marks. Each full question consisting of 20 marks. There will be two full questions (with a maximum of four sub questions) from

each module. Each full question will have sub question covering all the topics under a module. The students will have to answer five full questions, selecting one full question

from each module.




Text Books: T1. B. S. Grewal," Higher Engineering Mathematics", Khanna publishers, 43nd edition, 2015. T2. E Kreyszig, "Advanced Engineering Mathematics”, John Wiley & Sons, - 10th edition 2015.

Reference books: R1.N.P. Bali and Manish Goyal, "A text book of Engineering Mathematics”, Laxmi

publications, 7th Ed., 2010. R2. B.V. Ramana, "Higher Engineering Mathematics", Tata McGraw-Hill, 2006.

R3.H. K. Das and Er. Rajnish Verma, "Higher Engineering Mathematics", S. Chand Publishing, 1st edition, 2011.

1. Prerequisites of the course

This subject requires the student to know about techniques of differentiation, integrations, partial differentiation, differential equations, infinite series, determinants and matrices and vector differentiation.

2. Overview of the course The primary goal of this course is to highlight the essential concepts of (i) Fourier

series (ii) Fourier transforms, difference equation & Z- transform (iii) Statistical and Numerical methods (iv) Finite differences and Numerical Integration (v) Vector integration and calculus of variations. The essential feature of Fourier series is to present a technique for solving problems of the voltage output in circuit and different wave forms. Fourier transforms is studied which will be useful for solving partial differential equations analytically. A Fourier transform when applied to a partial differential equation reduces the number of its independent variables by one. In two dimensional problems, it is sometimes required to apply the transforms twice and the desired solution is obtained by double inversion. Z- Transforms operate not on functions of continuous arguments but on sequences of the discrete integer valued arguments.

Statistics deals with the methods of collection, classification and analysis of numerical data for drawing valid conclusions and making reasonable decisions. It has meaningful applications in production engineering, in the analysis of experimental data, etc. In Numerical methods we discuss some numerical methods for the solution of algebraic and transcendental equations. Interpolation is the technique of estimating the value of a function for any intermediate value of the independent variable. Numerical integration is the process of evaluating a definite integral from a set of tabulated values of the integrand. Vector integral calculus extends the concept of integral calculus to vector functions. The calculus of variations is a powerful tool for the solution of the physical problems like dynamics of rigid bodies and vibration problems.




3. Relevance of the course to this program : Fourier series: Fourier series plays an important role in classical studies of the heat and wave equations like: the study of sound, heat conduction, electromagnetic waves, mechanical vibrations, and signal processing and image analysis. Fourier series is an infinite series representation of periodic function in terms of trigonometric sine and cosine functions. It can be used to solve ordinary and partial differential equations particularly with periodic functions appearing as non-homogeneous terms. Fourier series can be constructed for one period is valid for all values. Harmonic analysis is the theory of expanding functions in Fourier series. Fourier transforms and Z -Transforms: Fourier transform is a powerful tool in diverse field of science and engineering. Fourier transform affords mathematical devices, through which solution of numerous boundary value problems of engineering can be obtained, viz., conduction of heat, transverse oscillations of an elastic beam, free and forced vibrations of membrane transmission lines etc. Z- Transforms play an important role in the field of communication engineering and control engineering at the stage of analysis and representation of discrete time linear shift in variance system.

Statistical Methods and Numerical methods: Statistical methods have meaningful applications in production engineering, the analysis of experimental data, etc. The module also reveals to minimize the error associated with experimental data, using least square method. Numerical analysis provides various techniques to find approximate solution to difficult problems using simplest operations. There are many phenomena where the changes in one variable are related to the changes in the other variable i.e. a simultaneous variation can be measured by the concept of correlation and regression. While, the correlation coefficient measures the closeness, the regression equation is used for prediction or estimation. Numerical methods are easily adoptable to solve algebraic and transcendental equations by using computers.

Finite differences and Numerical integration: For an unknown function given at a set of tabulated values, one can obtain interpolating polynomial and prediction of the unknown function at the specified point, by using the knowledge of finite differences and central differences. Numerical integration can be used for evaluating certain improper integrals and to civil engineers for calculating the amount of earth that must be moved to fill a depression or make a dam. Also, for calculating distance travelled by the particle.

Vector integration and Calculus of Variations: Vector integral calculus has applications in fluid flow, design of underwater transmission cables, and heat flow in stars, study of satellites. Line integrals can be used in the calculation of work done by variable forces along paths in space and the rates at which fluids flow along curves and across boundaries. Green’s theorem, a great theorem of calculus, which converts line integrals to double integrals, evaluates flow and flux integrals across closed plane curves in non-conservative vector fields. Stokes theorem states that the circulation of a vector field around the boundary of a surface in space equals to the integral of the normal component of the curl of the field over the surface.




Gauss divergence theorem, which is important in electricity, magnetism and fluid flow, says that the outward flux of a vector field across a close surface equals the triple integral of the divergence of the field over the region enclosed by the surface. The calculus of variations concerns with finding maximum or minimum value of a definite integral involving a certain function. It has many more applications in fast growth in science and engineering.

4. Applications: Application of optical fiber communications includes telecommunications, data communication video control, and protection switching sensors, image processing and power application.

5. Module wise Plan:

Module-I Title : Fourier series Planned Hours: 10 hrs. Learning Objectives: At the end of this module student should be able to

1) Recall facts and definition of periodic function, Dirichlet’s condition, odd & even function.

2) Interpret the trigonometric series based on Euler’s formula. 3) Recall the techniques of integration when intervals of the functions are given. 4) Express the given function in series form and explain its geometric interpretation. 5) Summarize the nature of even and odd function in Fourier series analysis and find the

Euler’s coefficients. 6) Apply the technique studied in Fourier series to solve Engineering application

problems. 7) Employ the technique of harmonic analysis and determine the Euler’s constants when

numerical data and obtain the periodic function. Lesson Schedule:

Lect. no.

Topics covered Teaching Method

PSOs attained

POs attained

COs attained

Ref Book/ Chapter no.

1 Periodic function – definition, Dirichlet’s condition, even and odd functions

Chalk and Board

1

1, 2, 4, 5 & 11

1 T1/10, T2/11

2 Fourier series of periodic functions with period and with arbitrary period

1 T1/10, T2/11

3 Examples on Fourier expansion of continuous functions over &

1 T1/10, T2/11

4 Examples on Fourier expansion of continuous functions over and

1 T1/10, T2/11

5 Examples on Fourier series expansion of Functions having infinite number of discontinuities

1 T1/10, T2/11




6 Examples on Fourier series expansion of even and odd functions

Chalk and

Board

1

1, 2, 4, 5 & 11

1 T1/10, T2/11

7 Half range Cosine series and examples 1 T1/10, T2/11

8 Half range sine series with examples 1 T1/10, T2/11

9 Practical Harmonic Analysis 1 T1/10, T2/11

10 Illustrative examples from engineering field

1 T1/10, T2/11

Assignment questions COs

Attained

RBT Levels

1. Find the Fourier series

2x1in x)-(2

1x0in x )(

xf hence deduce

that

12

2

)12(

1

8 n

.

2. Find the Fourier series for the function xxf )( in

& . Hence, deduce that 8

....7

1

5

1

3

1

1

1 2

2222

3. Find Fourier series expansion for f(x) defined

23x2in x -

2x2-in )(

xxf given that )()2( xfxf .

4. Expand

3x0in 2x -1

0x3-in 2x 1 )(xf as a Fourier series and deduce

that

12

2

)12(

1

8 n

5. Find the Fourier series to represent

2xin x -2

x0in )(

xxf

deduce that

12

2

)12(

1

8 n

.

6. Obtain the Fourier expansion of 2

)(x

xf

in 0 < x < 2 and deduce

that 4

.....7

1

5

1

3

11

1

1

L1 & L2

L1 & L2




7. Find the Fourier series of (0,3)in )2()( 2xxxf .

8. Expand xxxf sin)( as a Fourier series in the interval (-,) and deduce

that

7.5

1

5.3

1

3.1

1

4

2

9. Find the Fourier series for )1()( 2xxf in the interval

10. Obtain the Fourier expansion of )(0,2over )2()( lxlxxf .

11. Find the Fourier series expansion for f(x) if

x0in x

0x-in )(xf

Deduce that 8

....7

1

5

1

3

1

1

1 2

2222

12. Express )(xf as Fourier cosine series and sine series when

xx

xxf

2

2x0 )(

13. Find the half range cosine series for the function )(xf defined by

lxlx

lxf

2 ) 43(

2x0 x)- 41(

)(

14. current over a period

t sec. 0 T/6 T/3 T/2 2T/3 5T/6 T

A (amp) 1.98 1.30 1.05 1.30 -0.88 -0.25 1.98

Show that there is a direct current part of 0.75 amp in the variable current and obtain the amplitude of the first harmonic.

15. Obtain the Fourier series of ‘y’ up to second

harmonics, using the following table: x: 0 1 2 3 4 5

y=f(x): 9 18 24 28 26 20




Module-II Title: Fourier transforms and Z- transforms Planned Hours: 10 hrs.

Learning Objectives: At the end of this unit student will be able to

1) State the properties of Fourier transforms. 2) Discuss the inverse Fourier transforms which can be applied to obtain the result (deductions). 3) Obtain the Fourier sine, cosine transforms and its inverse transforms also. 4) Analyze the role of transforms in engineering and science. 5) Recall facts and definitions of Z-transforms. 6) Evaluate the Z-transforms of the given function. 7) Interpret the inverse Z-transforms. 8) Discuss the methods for finding the inverse Z-transforms. 9) Apply the Z-transforms to solve the Difference equations. 10) Recognize the techniques of Z-transforms to study the communication engineering and control Engineering problems at the stage of analysis.

Lesson Plan:

Lect. no.


PSOs attaine

d

POs attained

COs attained

Ref Book/

Chapter no.

11 Infinite or complex Fourier transforms and its inversion formulae, with properties

Chalk and Board

1 1, 2, 4, 5, 11

2 T1/22, T2/11

12 Examples 2 T1/22, T2/11

13 Fourier sine transforms and its inversion formulae and examples 2 T1/22, T2/11

14 Fourier cosine transforms and its inversion formulae and examples

2 T1/22, T2/11

15 Examples 2 T1/22, T2/11

16 Difference equations- Basic definitions.

2 T1/23

17 Z-transforms: definitions, standard Z-transforms. Examples, Properties of Z-transforms

2 T1/23

18 Damping rule, Shifting rule, initial value theorem, and final value theorem (without proof)

2 T1/23

19 Inverse Z-transforms and examples 2 T1/23

20 Application of Z-transforms to solve difference equations and examples

2 T1/23




Assignment questions COs Attained

RBT levels

1. Find the Fourier transform of xaexf )( , xxexf )( .

2. Show that the Fourier transforms of

a

aaxf

xin 0

xin x-)( is

2

2

cos1

a

. Hence show that dxt

t2

0

sin

= 2

.

3. Find the Fourier transform of

1: 0

1: 1)(

2

x

xxxf Hence

evaluate a) dxx

x

xxx

03 2

cossincos

b) dxx

xxx

03

sincos

.

4. Find the Fourier cosine transform of the function f(x) =

4:0

41:4

10:4

x

xx

xx

5. Find the Fourier cosine transform of -ax-ax xeand e and hence

deduce that amea

dxax

mx

2

cos

022

.

6. Find the Fourier sine transform of 0 # x , 0a ,)(

x

exf

ax

hence

show that aedxxa

x

2sintan01

7. Find the inverse Fourier sine transform of 0 , 1

)(

as eF .

8. Find the Z-transforms of the following:

9. Find the inverse Z-transform of i) ii)

10. Using Z-transform solve the following difference equations : (i) (ii)

2 2

L1 & L2

L1 & L2




Module-III Title : Statistical Methods , Curve fitting and Numerical methods Planned Hours: 10

hrs.

Learning Objectives: At the end of this unit student should be able to

1) Compute Karl Pearson’s coefficient of correlation 2) Define regression and calculate regression coefficients and obtain the lines of regression. 3) Fit curves by least square method.

4) Compute the real root of a given equation by different numerical methods -Regula –Falsi method and Newton-Raphson Method.

5) Estimate the solution to a desired degree of accuracy.

6) Apply the numerical techniques to find the approximate solution of difficult problems. 7) Solve engineering and physical problems applying the numerical methods.

Lesson Plan:

Lect. no.


PSOs attained

POs attained

COs attained

Ref Book/

Chapter no.

21 Review of measures of central tendency and dispersion

Chalk

and

Board

1

1, 2, 4,

5 & 11

3 T1/25.12,13 T2/30.9

22 Define correlation, Karl Pearson’s correlation coefficient formula and Examples

3 T1/25.14 T2/30.9

23 Define regression and regression coefficients. Regression lines Examples.

3 T1/25.16 T2/30.10

24 Fitting of straight line: and examples

3 T1/25.16 T2/30.10

25 Fitting of parabola: and examples

3 T1/24.5 T2/30.3

26 Fitting of curves: and problems

3 T1/24.6 T2/30.4

27 About numerical solutions of algebraic & transcendental equations

3 T1/24.6 T2/30.4

28 Regula-Falsi method and examples 3 T1/28.2

T2/32.1

29 Newton-Raphson method and examples

3 T1/25.12,13 T2/30.9

30 Examples 3 T1/25.12,13 T2/30.9




Assignment questions COs Attained

RBT levels

1. If is the angle between two regression lines show that

.

2. Calculate the coefficient of the correlation between x & y and also the regression lines from the following data :

x : 1 2 3 4 5 8 7 8 9 10

y : 10 12 16 28 25 36 41 49 40 50

3. Find the coefficient of correlation between industrial production & export using the following data:

Production (in crore tons)

55 56 58 59 60 61 62

Export (in crore tons)

35 38 38 39 44 43 45

4. In a partially destroyed laboratory record, only the lines of regression of y on x and x on y are available as

respectively. Calculate and the coefficient of correlation between x &

y.

5. Following table gives the data on rainfall and discharge in a certain river. Obtain the line of regression of y on x,

Rainfall x (in inches)

1.53 1.78 2.60 2.95 3.42

Discharge y (1000 cc)

33.5 36.3 40.0 45.8 53.5

6. Fit a straight line in the least square sense for the data

X 1 3 4 6 8 9 11 14

y 1 2 4 4 5 7 8 9

7. Fit a parabola of second degree parabola for the data

x 1 2 3 4 5 6 7 8 9

3

3

L1 & L2




y 2 6 7 8 10 11 11 10 9

8. Fit a curve for the data

x 5 6 7 8 9 10

y 133 55 23 7 2 2

9. Compute the real root of the following equations by the method of false position method correct to four places of decimal places: a) . b) . c)

. 10. Find a real root of the following equations by Newton’s iterative method

correct to three places of decimals: a) b) c)

L1 & L2




Module-IV Title : Finite differences and Numerical Integration Planned hours: 10 hrs. Learning Objectives: At the end of this unit student should be able to

1) Recall facts and definitions of finite differences, Interpolation and Extrapolation. 2) Compute the missing terms of the given data by using definitions of finite differences. 3) Estimate the value of a function by using various interpolation formulae. 4) Evaluate the definite integral of the unknown function or the value of the definite integral

without calculating the actual integration. 5) Apply numerical integration techniques to find the solution of civil engineering application

problems.

6) Interpret the studied numerical methods for solving the engineering application problems. Lesson Plan:

Lect. no.


PSOs attained

POs attained

COs attained


31 Definitions: Finite differences, Types of finite differences, Interpolation and Extrapolation.

Chalk and Board

Chalk and

Board

1

1

1, 2, 4, 5 & 11

1, 2, 4, 5 & 11

4 T1/29.30, T2/32

32 Newton-Gregory forward and back word interpolation formulae & examples.

4 T1/29.30, T2/32

33 Some more examples 4 T1/29.30, T2/32

34 Newton’s divided difference interpolation formula and examples.

4 T1/29.30, T2/32

35 Lagrange’s inverse interpolation formula and examples. 4

T1/29.30, T2/32

36 Some examples on Interpolation and Extrapolation

4 T1/29.30, T2/32

37 Numerical integration: Theory 4

T1/29.30, T2/32

38 Simpson’s one third rule and examples

4 T1/29.30, T2/32

39 Simpson’s three eighth rule and problems

4 T1/29.30, T2/32

40 Weddle’s rule and examples 4 T1/29.30, T2/32




Assignment questions

COs Attained

RBT levels

1. From the following data estimate the number of persons having income between 2000 and 2500

Income Below500 500-1000 1000-2000 2000-3000 3000-4000

Number of persons

6000 4250 3600 1500 650

2. The table gives the distances in nautical miles of the visible horizon for the given heights in feet above the earth’s surface. X=height: 100 150 200 250 300 350 400

Y=distance: Find the values of Y when X=218 ft and 410 ft.

3. Using Lagrange’s interpolation formula find f(5.0) given

X: 1 3 4 6 9 Y: -3 9 30 132 156

4. Using Newton’s divided difference formula evaluate f(8) and f(15) given,

X: 4 5 7 10 11 13 Y: 48 100 294 900 1210 2028

5. The following table given. The viscosity of an oil as a function of temperature use Lagrange’s formula to find viscosity of oil at a temperature of 140.

Temp 110 130 160 190

Viscosity 10.8 8.1 5.5 4.8

6. Evaluate by dividing the interval in to eight equal parts.

7. Evaluate by applying Weddle’s rule, taking six equal parts.

8. Evaluate the integral by using the Weddle’s rule with h = 0.5.

Compare the result with the actual value.

9. Given Evaluate the integral using Simpson’s three eighth

rule.

10. Evaluate using Simpson’s (1/3)rd rule.

4

4

L1 & L2

L1 & L2




Module-V Title : Vector Integration and Calculus of Variations Planned Hours: 10 hrs.

Learning Objectives: At the end of this unit student should be able to

1. Evaluate the line integrals on given curve in a plane. 2. Compute surface and volume integrals 3. Apply the Green’s theorem, Stoke’s theorem and Gauss-

divergence theorem for problems on integrations. 4. Recall function, functional, variational function. 5. Derive the Euler’s equation 6. Apply Euler’s equation to solve standard problems-

Geodesics, minimal surface of revolution, hanging chain. 7. Evaluate variational problems using Euler’s equations.

Lesson Schedule:

Lect. no.


PSOs attained

POs attained

COs attained


41 About line integrals, problems on line integrals

Chalk and

Board

Chalk and Board

1 1

1, 2, 4, 5, 11

, 2, 4, 5,

11

5 T1/8, T2/21

42 Examples on surface integrals

5 T1/8, T2/21

43 Examples on volume integrals.

5 T1/8, T2/21

44 Green’s and stoke’s theorem, examples on it.

5 T1/8, T2/21

45 Gauss divergence theorem, examples on it.

5 T1/8, T2/21

46 Define variation of function, functional, Derivation of Euler’s equations.

5 T1/8, T2/21

47 Std. variational problems-Geodesics,

5

T1/35, T2/21

48 Std. variational problems-hanging chain.

5

T1/35,

49 Examples on Euler’s equation

5 T1/35,

50 Some more examples 5 T1/35,




Assignment questions COs

Attained RBT levels

1. Show that the shortest distance between two points in a plane is a

straight line.

2. Show that the geodesic on a sphere of radius are its great circles.

3. Find the geodesics on a right circular cylinder of radius .

4. A heavy cable hangs freely under gravity between two fixed points

show that the shape of the cable is a catenary.

5. On which curve the function with

be exremized.

6. A vector field is given by . Evaluate the

line integral over a circular path given by

7. Evaluate where and is the

portion of the plane in the first octant.

8. Using Green’s theorem, evaluate

where is the plane triangle enclosed by the lines

9. Verify Stoke’s theorem for taken around

the rectangle bounded by the lines

10. Verify Divergence theorem for taken over the

rectangular parallelepiped

5

L2 & L3

8. Portion for Internal Assessment Test

Test Modules COs attained I IA test 1, 2 1& 2 II IA test 3,4 3 & 4 III IA test 5 5




Analog and Digital Electronics

Semester: III Year: 2017-18

Subject Title: Analog and Digital Electronics Subject Code: 15CS32 Number of Lecture Hours/Week 04 IA Marks 40 Total Number of Lecture Hours 50 Exam Marks 60 Credits 04 Exam Hours 03

MODULE - 1 10 Hours

Field Effect Transistors: Junction Field Effect Transistors, MOSFETs, Differences between JFETs and MOSFETs, Biasing MOSFETs, FET Applications, CMOS Devices. Wave-Shaping Circuits: Integrated Circuit(IC) Multivibrators. Introduction to Operational Amplifier: Ideal v/s practical Opamp, Performance Parameters, Operational Amplifier Application Circuits:Peak Detector Circuit, Comparator, Active Filters, Non-Linear Amplifier, Relaxation Oscillator, Current-To-Voltage Converter, Voltage-To- Current Converter.

(Text book 1:- Ch5:5.2, 5.3, 5.5, 5.8, 5.9, 5.1.Ch13: 13.10.Ch 16: 16.3, 16.4)

MODULE - 2 10 Hours

The Basic Gates: Review of Basic Logic gates, Positive and Negative Logic, Introduction to HDL. Combinational Logic Circuits: Sum-of-Products Method, Truth Table to Karnaugh Map, Pairs Quads, and Octets, Karnaugh Simplifications, Don’t-care Conditions, Product-of-sums Method, Product-of sums simplifications, Simplification by Quine-McCluskyMethod, Hazards and Hazard covers, HDL Implementation Models.

(Text book 2:- Ch2: 2.4,2.5. Ch3: 3.2 to 3.11.)

MODULE - 3 10 Hours

Data-Processing Circuits: Multiplexers, Demultiplexers, 1-of-16 Decoder, BCD to Decimal Decoders, Seven Segment Decoders, Encoders, Exclusive-OR Gates, Parity Generators and Checkers, Magnitude Comparator, Programmable Array Logic, Programmable Logic Arrays, HDL Implementation of Data Processing Circuits. Arithmetic Building Blocks, Arithmetic Logic Unit Flip- Flops: RS Flip-Flops, Gated Flip-Flops, Edge-triggered RS FLIP-FLOP, Edgetriggered D FLIP-FLOPs, Edge-triggered JK FLIP-FLOPs.

(Text book 2:- Ch4:- 4.1 to 4.9, 4.11, 4.12, 4.14.Ch6:-6.7, 6.10.Ch8:- 8.1 to 8.5.)

MODULE - 4 10 Hours

Flip- Flops: FLIP-FLOP Timing, JK Master-slave FLIP-FLOP, Switch Contact Bounce Circuits, Various Representation of FLIP-FLOPs, HDL Implementation of FLIP-FLOP. Registers: Types of Registers, Serial In - Serial Out, Serial In - Parallel out, Parallel In - Serial Out, Parallel In - Parallel Out, Universal Shift Register, Applications of Shift Registers, Register implementation in HDL. Counters: Asynchronous Counters, Decoding Gates, Synchronous Counters, Changing the Counter Modulus.(Text book 2:- Ch 8: 8.6, 8.8, 8.9, 8.10, 8.13. Ch 9: 9.1 to 9.8. Ch 10: 10.1 to




MODULE - 5 10 Hours

Counters: Decade Counters, Pre settable Counters, Counter Design as a Synthesis problem, A Digital Clock, Counter Design using HDL. D/A Conversion and A/D Conversion: Variable, Resistor Networks, Binary Ladders, D/A Converters, D/A Accuracy and Resolution, A/D Converter- Simultaneous Conversion, A/D Converter-Counter Method, Continuous A/D

Conversion, A/D Techniques, Dual-slope A/D Conversion, A/D Accuracy and Resolution.

(Text book 2:- Ch 10: 10.5 to 10.9. Ch 12: 12.1 to 12.10)

Text Book:

T1. Anil K Maini, Varsha Agarwal: Electronic Devices and Circuits, Wiley, 2012.

T2. Donald P Leach, Albert Paul Malvino & Goutam Saha: Digital Principles and Applications, 7th Edition, Tata McGraw Hill, 2014

Reference Books:

R1. Stephen Brown, Zvonko Vranesic: Fundamentals of Digital Logic Design with VHDL, 2nd Edition,

Tata McGraw Hill, 2005.

R2. R D Sudhaker Samuel: Illustrative Approach to Logic Design, Sanguine-Pearson, 2010.

R3. M Morris Mano: Digital Logic and Computer Design, 10th Edition, Pearson, 2008.

ANALOG AND DIGITAL ELECTRONICS COURSE PLAN

Course Prerequisites:

1. Basic knowledge of the Analog and digital Electronics which includes Semiconductor devices, number system and basic gates.

Course Overview and its relevance to program:

Analog and Digital Electronic Circuits is one of the important subject in a course in Computer Science and Engineering discipline. An electronic circuit is composed of individual electronic components, such as resistors, transistors, capacitors, inductors and diodes, connected by conductive wires or traces through which electrical current can flow. The combination of components and wires allows various simple and complex operations to be performed: signals can be amplified, computations can be performed, and data can be moved from one place to another.

This subject provides coverage of different topics of analog electronics which includes discrete devices, integrated circuits and the application of the various semiconductor devices which includes FET, MOSFET’s, CMOS, IC 555 timers and their analysis.

The wave shaping circuits, the voltage regulators and finally the OP-AMP circuit and its applications are discussed.




Able to perform the conversion among different number systems; familiar with basic logic gates -- AND, OR & NOT, XOR, XNOR; independently or work in team to build simple logic circuits using basic. Understand Boolean algebra and basic properties of Boolean algebra; able to simplify simple Boolean functions by using the basic Boolean properties. Able to design simple combinational logics using basic gates. Able to optimize simple logic using Karnaugh maps, understand "don't care". Familiar with basic sequential logic components: SR Latch, D Flip-Flop and their usage and able to analyze sequential logic circuits. Understand finite state machines (FSM) concept and work in team to do sequence circuit design based FSM and state table using D-FFs. Familiar with basic combinational and sequential components used in the typical data path designs: Register, Adders, Shifters, Comparators; Counters, Multiplier, Arithmetic-Logic Units (ALUs), RAM. Able to do simple register-transfer level (RTL) design. Able to understand and use one high-level hardware description languages (VHDL or Verilog) to design combinational or sequential circuits. Understand that the design process for today's billion-transistor digital systems becomes a more programming based process than before and programming skills are important.

Course Outcomes:

CO232.1: Recall the basics of diode, BJT, op-amp and Digital electronics.

CO232.2: Acquire knowledge of JFETs and MOSFETs, Operational Amplifier circuits and their applications, Combinational Logic, Simplification Techniques using Karnaugh Maps, Quine McClusky Technique, Operation of Decoders, Encoders, Multiplexers, Adders and Subtractors, Working of Latches, Flip-Flops, Designing Registers, Counters, A/D and D/A Converters.

CO232.3: Apply the gained knowledge in FET applications, op-amp circuits, combinational and sequential circuits, ADC and DAC.

CO232.4: Analyse the of JFETs and MOSFETs based circuits, Operational Amplifier circuits, Simplification Techniques using Karnaugh Maps, Quine McClusky Technique, Synchronous and Asynchronous Sequential Circuits.

CO232.5: Appraise the performance of JFET, MOSFET, OP-Amp, DAC and ADC.

CO232.6: Construct the op-amp based circuits, combinational and sequential logic circuits.

Applications:

1. Analog Electronic Circuits helps in design of analog and digital circuits. 2. Digital electronics used forms the foundation of computer hardware/peripherals and embedded

system.




MODULE-1

MODULE WISE PLAN

Module Numbers: 1 No. of Hours: 10

Learning Objectives: At the end of this module students will be able to:

1. Types of FETs: JFETs and MOSFETs, Construction and operation of JFETs , Construction and operation of MOSFETs, Comparison between JFETs and MOSFETs, Biasing of the MOSFETs, Introduction to CMOS

2. Multivibrator circuits configuration around digital integrated circuits, Multivibrator circuits configured around timer IC 555

3. Difference between an ideal and practical opamp Peak Detector Circuit, Absolute Value Circuit Comparator, Active Filters, Phase Shifters Non-Linear Amplifier, Relaxation Oscillator Current-To-Voltage Converter, Voltage-To-Current Converter, Sine Wave Oscillators

Lesson Plan:

Lecture No.

Topics Covered Teaching Method

POs Attained

PSOs Attained

COs Attained

Text or Reference

Book/Chapter No.

L1

Field Effect Transistors: Junction Field Effect Transistors, MOSFETs,

Chalk & Board

1,2,3,9, 12

1,2

1, 2 T1/5

L2

Differences between JFETs and MOSFETs, Biasing MOSFETs,

Chalk & Board, TPS

1, 2,4 T1/5

L3 FET Applications, CMOS Devices.

Chalk & Board, Simulation

2, 3 T1/5

L4

Wave-Shaping Circuits: Integrated Circuit (IC) Multivibrators.

Chalk & Board, Simulation, TPS

2, 3, 6 T1/13

L5

Introduction to Operational Amplifier: Ideal v/s practical

Chalk & Board, TPS

2, 5 T1/16




Lecture No.


POs Attained

PSOs Attained

COs Attained

Text or Reference

Book/Chapter No.

Opamp, Performance Parameters,

L6

Operational Amplifier Application Circuits: Peak Detector Circuit,

Chalk & Board

2 T1/16

L7 Comparator


2, 3, 6 T1/16

L8 Active Filters Chalk & Board, TPS

2 T1/16

L9

Non-Linear Amplifier, Relaxation Oscillator


2, 3, 6 T1/16

L10

Current-To-Voltage Converter, Voltage-To- Current Converter

Chalk & Board

2 T1/16

Assignment Questions:

Questions Cos

Attained 1. a) With the help of neat diagram, describe the operation of N-channel

depletion and enhancement MOSFETs. b) With Circuit diagram, explain any two application of FET.

1,2, 4

2. a) Design a voltage divider bias network using a DEMOSFET with supply voltage VDD=16V. IDSS=10mA, Vp=5V to have a quiescent drain current of 5mA and gate voltage of 4V.(Assume the drain resistor RD to be four times the source resistor RS and R2=1kΩ). b) How CMOS can be used as inverting switch?

2,3,4

3. a) Mention and explain the working of any two applications of operational amplifiers.

b) Explain the performance parameters of operational amplifiers.

2,5




MODULE-2

MODULE WISE PLAN


Learning Objectives: At the end of this module students will be able to:

1. Write the truth tables and draw the symbols for OR, AND, NOT, NOR, and NAND gates. 2. Demonstrate the ability to use basic Boolean laws. 3. Use the sum-of-products method to design a logic circuit based on a design truth table. 4. Be able to make Karnaugh maps and Entered variable maps and use them to simplify

Boolean expressions. 5. Use the product-of-sums method to design a logic circuit based on a design truth table. 6. Use Quine-McClusky tabular method for logic simplification. 7. Analyze hazards in logic circuit and provide solution for them. 8. HDL Implementation Models

Lesson Plan:

Lecture No.

Topics Covered

Teaching Method

POs Attained

PSOs Attained

Cos Attained

Text or Reference

Book/Chapter No.

L11. Basic gates NOT, OR, AND

Chalk & Board, TPS, Simulation

1, 2, 3, 5, 9

1,2

1 T2/2

L12. Universal Logic Gates NOR, AND

Chalk & Board, TPS

1 T2/2

L13. Positive and Negative Logic

Chalk & Board 2 T2/2

L14. Introduction to HDL


2 T2/2

L15. Sum of- products Method

Chalk & Board 2,4 T2/3

L16.

Truth Table to Karnaugh Map, Pairs, Quads and Octets

Chalk & Board, TPS

2,4 T2/3

L17.

Karnaugh Simplifications Don’t Care Conditions, Product-of-sums Method

Chalk & Board, TPS

2,4 T2/3

L18. Product-of-sums Simplification

Chalk & Board 2,4 T2/3

L19. Simplification by Quine-McClusky

Chalk & Board, TPS

2,4 T2/3




Lecture No.

Topics Covered

Teaching Method

POs Attained

PSOs Attained

Cos Attained

Text or Reference

Book/Chapter No.

Method

L20.

Hazards and Hazard Covers, HDL Implementation Models


2,5,6 T2/3


Questions COs attained 1. a) What is a logical gate? Realize ((A+B).C)D using only NAND gates.

b) Discuss the positive and negative logic and list the equivalences in positive and negative logic.

c) Find the minimal SOP of the following Boolean functions using K-Map: f(a,b,c,d)=∑m(6,7,9,10,13)+d(1,4,5,11) f(a,b,c,d)= πM (1,2,3,4,10)+d(0,15)

1,2,4

2. a) A digital system is to be designed in which the months of the year is given as input in four bit form. The month January is represented as 0000, February as 0001 and so on. The output of the system should be 1 corresponding to the input of the month containing 31 dys or otherwise it is 0. Consider the excess numbers in the input beyond 1011 as don’t care conditions. For this system of four variable (A,B,C,D) find the following:

i. Write the truth table ii. Boolean expression in ∑m and πM form

iii. Using K-Map simplify the Boolean expression of canonical min term form

iv. Implement the simplified equation using NAND-NAND gates.

b) What is hazard? List the types of hazards and explain static-0 and static-1 hazard.

1,2

3. a) Minimize the following Boolean function using Karnaugh map method f(a,b,c,d)=∑m(5,6,7,12,13) + ∑d(4,9,14,15) b) Apply Quine-Mc Clusky method to find the essential prime implicants for the Boolean expression f(a,b,c,d)=∑ (1,3,6,7,9,10,12,13,14,15)

2,4




MODULE-3

MODULE WISE PLAN

MODULE Numbers: 3 No. of Hours: 10

Learning Objectives: The main objectives of this module are to:

1. Determine the output of a multiplexer or demultiplexer based on input condition 2. Find, based on input conditions, the output of an encoder or decoder 3. Draw the symbol and write the truth table for an exclusive-OR gate 4. Explain the purpose of parity checking 5. Show how a magnitude comparator works 6. Describe a ROM, PROM, EPROM, PAL and PLA 7. Describe characteristic equations of Flip-Flops and analysis techniques of sequential

circuits 8. Describe excitation table of Flip-Flops and explain Conversion of Flip-Flops as synthesis

example

9. Describe operation of basic RS flip-flop and explain the purpose of the additional input on the gated RS flip-flop

10. Show the truth table for the edge-triggered. RS flip-flop, edge-triggered D flip-flop, and edge-triggered JK flip-flop and describe its operation.

Lesson Plan:

Lecture No.


POs attain

ed

PSOs Attaine

d

COs attained

Reference Book/

Unit No.

L21. Multiplexers, Demultiplexers

Chalk and Board, Simulation, TPS

1, 2, 3, 4, 9

1,2

2, 3, 6 T2/4

L22. 1-of-16 Decoder , BCD-to-Decimal Decoders

Chalk and Board

2, 3 T2/4

L23. Seven-segment Decoders, Encoders

Chalk and Board

2, 3 T2/4

L24. EX -OR gates, Parity Generators and Checkers

Chalk and Board, Simulation

2, 3 T2/4

L25. Magnitude Comparator, Programmable Array Logic

Chalk and Board, Simulation, TPS

2, 3, 6 T2/4

L26. Programmable Logic Array, HDL Implementation of Data Processing Circuits


2, 3 T2/4

L27. Arithmetic Building Blocks, Arithmetic Logic Unit

Chalk and Board,

2, 3 T2/6




Lecture No.


POs attain

ed

PSOs Attaine

d

COs attained

Reference Book/

Unit No.

L28. Flip- Flops: RS Flip-Flops Gated Flip-Flops, Edge-triggered RS FLIP-FLOP


1,2, 3 T2/8

L29. Edge triggered D FLIP-FLOPs

Chalk and Board

2, 3, 6 T2/8

L30. Edge-triggered JK FLIP-FLOPs.


2, 3, 6 T2/8


Questions COs attained 1. a) What is multiplexer? Design a 32 to 1 multiplexer using two 16 to 1

multiplexer and one 2 to 1 multiplexer b) Design 7-segment decoder using PLA

2,3,6

2. a) Show that using a 3 to 8 decoder and multi-input OR gate. The following Boolean expressions can be realized simultaneously F1(A,B,C) = ∑m(0,4,6) F2(A,B,C) = ∑m(0,5) F3(A,B,C) = ∑m(1,2,3,7)

b) Implement the Boolean functions expressed by SOP using 8 to 1 MUX. f(A,B,C,D)= ∑m (1,2,5,6,9,12) f(A,B,C,D)= ∑m (0,1,5,6,8,10,12,15)

2,3,6

3. a) What is a magnitude comparator? Design and explain 2 bit comparator b) Differentiate between combinational and sequential circuit.

c) Write the Verilog code for the circuit given below.

2,3,6




MODULE-4

MODULE WISE PLAN



1. Show the truth table for the edge-triggered. RS flip-flop, edge-triggered D flip-flop, and edge-triggered JK flip-flop and describe its operation.

2. State the cause of contact bounce and describe a solution for this problem.

3. Understand serial in-serial out, serial in-parallel out, parallel in- parallel out, parallel in-serial out shift registers and be familiar with the basic features of the 74LS91, 74166, 74LS91, 74174 and 7495A register.

4. State various uses of shift register 5. Implementation in HDL

Lesson Plan:

Lecture No.


POs attained

PSOs attained

COs attained

Reference Book/

Unit No.

L31.

FLIP-FLOP Timing, JK Master-slave FLIP-FLOP, Switch Contact, Bounce Circuits

Chalk and Board, TPS

1,2,3,9 1,2

1,2,4 T2/8

L32.

Various Representation of FLIP-FLOPs, HDL Implementation of FLIP-FLOP.


1,2,6 T2/8

L33. Types of Registers Chalk and Board

1,2 T1/9

L34. Serial In-Serial Out, Serial In-Parallel Out

Chalk and Board

2,4 T1/9

L35. Parallel In-Serial Out, Parallel In-Parallel Out,

Chalk and Board

2,4 T1/9

L36. Universal Shift Register Chalk and Board, TPS, Simulation

2,3,4 T1/9

L37. Applications of Shift Registers

Chalk and Board

2,3 T1/9

L38. Register Implementation in HDL, Asynchronous Counters


2,3,6 T1/9,10

L39. Decoding Gates, Synchronous Counters

Chalk and Board

2,3,6 T1/10

L40. Changing the Counter Modulus.

Chalk and Board

2,3,6 T1/10





Questions COs attained 1. a) What is race around condition? With a neat logic diagrams and truth table.

Explain the working of JK master slave flip-flop along with its implementation using NAND gates. b) Derive the characteristic equation for SR, D and JK Flip-flop.

2,3,4

2. a) Mention the differences between synchronous and asynchronous counters. b) Using negative edge triggered JK flip-flop draw the logic diagram of a 4-bit serial in serial out shift register. Draw the waveform to shift the binary number 1010 into this register. Also draw the waveforms for four transitions when J=K=0 (assuming the register has stored 1010 in it).

2,4,6

3. a) With a neat diagram explain how shift register can be applied for serial addition. b) With a neat diagram explain Ring counter. c) What is shift register? With a neat diagram explain 4 bit parallel in serial out shift registers.

2,4,6




MODULE-5

MODULE WISE PLAN

MODULE Numbers: 5 No. of Hours: 10


1. Design and implement Decade Counters, Pre settable Counters

2. Understand Counter Design as a Synthesis problem

3. Be able to do calculations related to variable resistor and binary ladder networks.

4. Recall some of the sections of a typical D/A resolution.

5. Understand A/D conversion using the simultaneous, counter, continuous and dual slope methods.

6. Discuss the accuracy and resolution of A/D converters

Lesson Plan:

Lecture No.


POs attained

PSOs attained

COs attained

Reference Book/ Unit

No.

L41. Decade Counters Chalk and Board

1, 2, 3, 9

1,2

2,4 T1/10

L42. Pre settable Counters, Counter Design as a Synthesis Problem


2,4,6 T1/10

L43. A Digital Clock Chalk and Board

2,4 T1/10

L44. Counter Design using HDL Chalk and Board, Simulation

2,6 T1/10

L45. Variable, Resistor Networks, Binary Ladders


2,4 T1/12

L46.

D/A Converters, D/A Accuracy and Resolution A/D Converter-Simultaneous Conversion

Chalk and Board

2,4 T1/12

L47. A/D Converter-Counter Method

Chalk and Board

2,4 T1/12

L48. Continuos A/D Conversion, A/D Techniques,

Chalk and Board

2,4 T1/12

L49. Dual-Slope A/D Conversion Chalk and Board

2,4 T1/12

L50. A/D Accuracy and Resolution

Chalk and Board

2,4 T1/12





Questions COs attained 1. a) Define counter. Design asynchronous counter for the sequence

0→4→1→2→6→0→4 using JK flip flop and SR flip flop. 2,4,6

2. a) What is a binary ladder? Explain the binary ladder with a digital input of 1000

2,4

3. a) Explain a 2- bit simultaneous A/D converter. b) Explain digital clock with block diagram.

2,4

PORTION FOR THE I.A. TEST

Test Modules

IA Test –I Module-1, Module-2

IA Test –II Module-2, Module-3

IA Test –III Module-4, Module-5




DATA STRUCTURES AND APPLICATIONS Semester: III Year: 2017-18

Subject Code 15CS33 IA Marks 40

Number of Lecture Hours/Week 04 Exam Marks 60

Total Number of Lecture Hours 50 Exam Hours 03

CREDITS - 04

Course objectives: This course will enable students to

Explain fundamentals of data structures and their applications essential for programming/problem solving

Analyze Linear Data Structures: Stack, Queues, Lists Analyze Non-Linear Data Structures: Trees, Graphs Analyze and Evaluate the sorting & searching algorithms Assess appropriate data structure during program development/Problem Solving

Module -1 Teaching Hours

Introduction: Data Structures, Classifications (Primitive & Non Primitive), Data structure Operations, Review of Arrays, Structures, Self-Referential Structures, and Unions. Pointers and Dynamic Memory Allocation Functions. Representation of Linear Arrays in Memory, Dynamically allocated arrays, Array Operations: Traversing, inserting, deleting, searching, and sorting. Multidimensional Arrays, Polynomials and Sparse Matrices. Strings: Basic Terminology, Storing, Operations and Pattern Matching algorithms. Programming Examples. Text 1: Ch 1: 1.2, Ch 2: 2.2 -2.7 Text 2: Ch 1: 1.1 -1.4, Ch 3: 3.1-3.3,3.5,3.7, Ch 4: 4.1-4.9,4.14 Ref 3: Ch 1: 1.4

10 Hours

Module -2

Stacks and Queues Stacks: Definition, Stack Operations, Array Representation of Stacks, Stacks using Dynamic Arrays, Stack Applications: Polish notation, Infix to postfix conversion, evaluation of postfix expression, Recursion - Factorial, GCD, Fibonacci Sequence, Tower of Hanoi, Ackerman's function. Queues: Definition, Array Representation, Queue Operations, Circular Queues, Circular queues using Dynamic arrays, Dequeues, Priority Queues, A Mazing Problem. Multiple Stacks and Queues. Programming Examples. Text 1: Ch 3: 3.1 -3.7 Text 2: Ch 6: 6.1 -6.3, 6.5, 6.7-6.10, 6.12, 6.13

10 Hours




Module – 3 Linked Lists: Definition, Representation of linked lists in Memory, Memory allocation; Garbage Collection. Linked list operations: Traversing, Searching, Insertion, and Deletion. Doubly Linked lists, Circular linked lists, and header linked lists. Linked Stacks and Queues. Applications of Linked lists – Polynomials, Sparse matrix representation. Programming Examples Text 1: Ch 4: 4.1 -4.8 except 4.6 Text 2: Ch 5: 5.1 – 5.10

10 Hours

Module-4

Trees: Terminology, Binary Trees, Properties of Binary trees, Array and linked Representation of Binary Trees, Binary Tree Traversals - Inorder, postorder, preorder; Additional Binary tree operations. Threaded binary trees, Binary Search Trees – Definition, Insertion, Deletion, Traversal, Searching, Application of Trees-Evaluation of Expression, Programming Examples Text 1: Ch 5: 5.1 –5.5, 5.7, Text 2: Ch 7: 7.1 – 7.9

10 Hours

Module-5

Graphs: Definitions, Terminologies, Matrix and Adjacency List Representation Of Graphs, Elementary Graph operations, Traversal methods: Breadth First Search and Depth First Search. Sorting and Searching: Insertion Sort, Radix sort, Address Calculation Sort. Hashing: Hash Table organizations, Hashing Functions, Static and Dynamic Hashing. Files and Their Organization: Data Hierarchy, File Attributes, Text Files and Binary Files, Basic File Operations, File Organizations and Indexing Text 1: Ch 6: 6.1 –6.2, Ch 7:7.2, Ch 8:8.1-8.3 Text 2: Ch 8: 8.1 – 8.7, Ch 9:9.1-9.3,9.7,9.9 Reference 2: Ch 16: 16.1 - 16.7

10 Hours

Graduate Attributes (as per NBA)

1. Engineering Knowledge 2. Design/Development of Solutions 3. Conduct Investigations of Complex Problems 4. Problem Analysis

Question paper pattern:

The question paper will have ten questions. There will be 2 questions from each module. Each question will have questions covering all the topics under a module. The students will have to answer 5 full questions, selecting one full question from each module.

Text Books:

T1. Fundamentals of Data Structures in C - Ellis Horowitz and Sartaj Sahni, 2nd edition, Universities Press,2014

T2. Data Structures - Seymour Lipschutz, Schaum's Outlines, Revised 1st edition, McGraw Hill, 2014




Reference Books:

R1. Data Structures: A Pseudo-code approach with C –Gilberg & Forouzan, 2nd edition, Cengage Learning, 2014.

R2. Data Structures using C, , Reema Thareja, 3rd edition Oxford press, 2012. R3. An Introduction to Data Structures with Applications- Jean-Paul Tremblay & Paul G. Sorenson, 2nd

Edition, McGraw Hill, 2013. R4. Data Structures using C - A M Tenenbaum, PHI, 1989. R5. Data Structures and Program Design in C - Robert Kruse, 2nd edition, PHI, 1996.

DATA STRUCTURES WITH C COURSE PLAN 1) Prerequisites:

1. Fundamentals of C Programming Concepts. 2. Fundamentals of Computer Concepts. 3. Concepts of Algorithms.

2) Course Overview and its relevance to programme: A Computer is a machine that manipulates the information. The study of Computer Science includes the study of how the information is organized in a computer, how it can be manipulated and how it can be utilized efficiently from a programmer’s perspective. Thus, it is exceedingly important for a Student of Computer Science to understand the concepts of information organization and manipulation i.e. Structural arrangement of the Data.

The study of Data Structures is both exciting and challenging. It is exciting because it presents a wide range of programming techniques that makes it possible to solve larger and most complex problems. It is challenging because the complex nature of the data structure brings with it many concepts that change the way we approach the designs of programs.

This course covers the concepts ranging from Pointers to Linked Lists and even the Graphical approach of these concepts like Trees, Graphs etc. 3) Course Outcomes:

C233.6.Design and apply appropriate data structures for solving computing problems.

Applications: 1. Data Structures is applicable in studying Design and Analysis of Algorithms. 2. Data Structures helps in the Design of Microprocessors, Microcontrollers, Compilers, and Text

Editors. 3. Stacks closely relate to the Recursion concept that is used to solve complex practical problems

very easily and efficiently. 4. Linked lists are used in Polynomial Arithmetic. 5. Trees are extensively used in Computer Science to represent Algebraic formulae.

After studying this course, students will be able to: C233.1.Define pointer,structures,union,stack,queue,list,trees,graphs. C233.2.Acquire knowledge of - Various types of data structures, operations and algorithms - Sorting and searching operations - File structures C233.3. Analyse the performance of - Stack, Queue, Lists, Trees, Searching and Sorting techniques C233.4.Express,Design and analyse graph traversal algorithm and hashing functions C233.5 Implement all the applications of data structures in a high-level language




Module wise plan Module -1

Module : 01 No. of Hours: 10 Title: Introduction to Data Structures Learning Objectives: The main objectives of this module are to: 1 Analyze concepts of Pointers, arrays, Structures ,unions 2 Develop knowledge about Static and Dynamic allocations, Algorithms. 3 Write algorithm or Program’s Performance Analysis and Measurement. 4 Develop Array, Dynamically allocated 1D and 2D arrays. 5 Analyze polynomial representations, Sparse matrices. 6 Implement concept of Multi-dimensional array and string operations, storage. Lesson Plan:

Lecture No.


POs attained

COs attained

PSOs attained

Reference Book/

Chapter No.

L1 Introduction: Data Structures, Classifications (Primitive & Non Primitive), Data structure Operations.

Chalk and Board

1,2,3,4,5,9,12

1,2,5 2,3 T1, T2,R3

L2 Review of Arrays, Structures, Self-Referential Structures, and Unions.

Chalk and Board

1,2,5,6 2,3 T1, T2,R3

L3 Pointers and Dynamic Memory Allocation Functions.

Chalk and Board

1,2,5,6 2,3 T1, T2,R3

L4 Representation of Linear Arrays in Memory, Dynamically allocated arrays.

Chalk and Board

1,2,5,6 2,3 T1, T2,R3

L5 Array Operations: Traversing, inserting, deleting, searching, and sorting.

Chalk and Board

1,2,3,5,6 2,3 T1, T2,R3

L6 Multidimensional Arrays, Polynomials.

PPT 1,2,5,6 2,3 T1, T2,R3

L7 Sparse Matrices. Strings: Basic Terminology.

Chalk and Board

1,2,5,6 2,3 T1, T2,R3

L8 Storing, Operations

Chalk and Board

1,2,5,6 2,3 T1, T2,R3

L9 Pattern Matching algorithms.

PPT 1,2,5,6 2,3 T1, T2,R3

L10 Programming Examples PPT 1,2,5,6 2,3 T1, T2,R3 T1,T2: Text book No.1,2 in VTU Syllabus. R3: Reference Book No.3 in VTU Syllabus.





Assignment Questions COs attained Q1)Given the following declarations: int x; double d; int *p; double *q; Which of the following expressions are not allowed? i. p=&x; ii. p=&d; iii. q=&x; iv. q=&d; v. p=x;

1,2

Q2) Write a C program that prints out the integer values of x, y, z in ascending order using pointers.

1,2

Q3) What is a pointer variable? Can we have multiple pointers to a variable? 1,2 Q4)Differentiate between: i. Static memory allocation and Dynamic memory allocation. ii. malloc( ) and calloc( ) functions.

1,2

Q5)Write a C program using pass by reference method to swap two char an two float variables.

1,2

Q6) Give any two advantages and disadvantages of using pointers. 1,2,5 Q7) Write both iterative and recursive C functions to compute n !. 2 Q8) Write both iterative and recursive C functions to compute nth Fibonacci number.

1,2

Q9) Write a C program to add two input matrices using dynamically allocated arrays.

1,2

Q10) Write a C program to multiply two input matrices using dynamically allocated arrays.

1,2,5

Module -2

Module : 02 No. of Hours: 10 Title: Stacks and Queues Learning Objectives: The main objectives of this module are to: 1 Incorporate concept of Stacks and its importance in Program memory. 2 Express concepts of Queue, Circular queue, double ended queue, priority queue and their

applications. 3 Implement applications of Stack like conversion of infix to postfix, evaluation of postfix

,recursion etc. Lesson Plan:

Lecture No.


POs attained COs

attained

PSOs attained

Reference Book/

Chapter No.

L11 Stacks and Queues Stacks: Definition, Stack Operations, Array Representation of Stacks.

Chalk and Board

1,2,3,4,5,9,10,12

1,3,5 2,3 T1, T2

L12 Stacks using Dynamic Arrays, Stack Applications: Polish notation, Infix to postfix conversion,

Chalk and Board

1,3,5,6 2,3 T1, T2

L13 Evaluation of postfix expression,

Chalk and Board

1,3,5,6 2,3 T1, T2




Recursion - Factorial, GCD, Fibonacci Sequence.

L14 Tower of Hanoi, Ackerman's function. Queues: Definition.

Chalk and Board

1,3,5,6 2,3 T1, T2

L15 Array Representation, Queue Operations.

Chalk and Board

1,2,5,6 2,3 T1, T2

L16 Circular Queues, Circular queues using Dynamic arrays.

PPT,Chalk and Board

1,3,5,6 2,3 T1, T2

L17 Dequeues.

Chalk and Board

1,3,5,6 2,3 T1, T2

L18 Priority Queues.

Chalk and Board

1,3,5,6 2,3 T1, T2

L19 A Mazing Problem. Multiple Stacks and Queues. Programming Examples.

PPT, Chalk and Board

1,3,5,6 2,3 T1, T2

L20 Multiple Queues. Programming Examples.

Chalk and Board

1,3,5,6 2,3 T1, T2

T1,T2: Text book No.1,2 in VTU Syllabus.

Assignment Questions: COs attained

Q1) What is a stack? Explain and implement the basic operations on stack using C. 1,3 Q2) Write a C program to implement stacks using dynamic arrays. 1,3,5 Q3) What is Simple Queue? Explain various operations on Queue along with their C functions.

1,3

Q4) Write a C program to implement circular queue. 1,3 Q5) Explain the concept of circular queue using dynamic arrays. Circular queue is efficient than ordinary queue. Discuss.

1,3

Q6) State and explain Initial Maze algorithm. 1,3 Q7) Convert the following Infix expressions into Postfix and Prefix expressions:

i. ( ( A + B ) – C * D ^ E / F ) ii. A + ( B – C ) * D. 1,3,5

Q8) Write an algorithm to evaluate a valid postfix expression. Trace the algorithm with a sample input.

1,3,6

Q9) Write a C program to convert a given valid parenthesized infix expression to postfix.

1,3,5

Q10) Using the Stacks, write a C program to reverse an input string and check for palindrome. Display appropriate messages.

1,3,5




Module -3

Module : 03 No. of Hours: 10 Title: Linked Lists: Learning Objectives: The main objectives of this module are to: 1 Define the concept of Linked lists and its applications. 2 Implement the concept of Polynomial arithmetic using linked lists. 3 Apply operations on linked lists and the Doubly linked list. Lesson Plan:

Lecture No.

Topics Covered Teachin

g Method

POs attained COs

attained

PSOs attaine

d

Reference Book/ Chapter

No. L21 Linked Lists: Definition,

Representation of linked lists in Memory.

Chalk and Board

1, 2, 3, 4, 5, 10, 12

1,3,5,6 2,3 T1, T2

L22 Memory allocation; Garbage Collection. Linked list operations: Traversing,

Chalk and Board

1,3,5,6 2,3 T1, T2

L23 Searching, Insertion.

Chalk and Board

1,3,5,6 2,3 T1, T2

L24 Deletion. Doubly Linked lists operations.

Chalk and Board

1,3,5,6 2,3 T1, T2

L25 Circular linked lists, and header linked lists.

Chalk and Board

1,2,5,6 2,3 T1, T2

L26 Linked Stacks

Chalk and Board

1,3,5,6 2,3 T1, T2

L27 Linked Queues.

Chalk and Board

1,3,5,6 2,3 T1, T2

L28 Applications of Linked lists – Polynomials

Chalk and Board

1,3,5,6 2,3 T1, T2

L29 Sparse matrix representation.

Chalk and Board

1,3,5,6 2,3 T1, T2

L30 Programming Examples

Chalk and Board

1,3,5,6 2,3 T1, T2



Q1) With a neat diagram, explain the following operations on a singly linked list. i. Insert front, rear ii. Delete front, rear iii. Display.

1,3

Q2) Write a C program to implement all the above operations on a singly linked list. Q3)Write a C program to implement Stacks using linked list.

1,3,5




Q4) Write a C program to implement Queues using linked list. 1,3 Q5)Write an algorithm to add two polynomials. Trace the algorithm with sample input.

1,3

Q6) Write the C functions to: i. Reverse a linked list ii. Concatenate two lists.

1,3

Q7) List the advantages of doubly linked list over the singly linked list. 1,3,5 Q8) Write a C function to insert a node at the specified position in a doubly linked list.

1,3,6

Module -4

Module : 04 No. of Hours: 10 Title: Trees Learning Objectives: The main objectives of this module are to: 1 Define the importance of Trees: Binary and Threaded binary trees. 2 Write implementation of Trees and their traversals. Lesson Plan:

Lecture No.


POs attained COs

attained

PSOs attained

Reference Book/

Chapter No.

L31 Trees: Terminology, Binary Trees.

Chalk and Board

1,2,3,4,5,7,11,12

1,2,3,6 2,3 T1,T2

L32 Properties of Binary trees, Array and linked Representation of Binary Trees.

Chalk and Board

1,2,3,6 2,3 T1,T2

L33 Binary Tree Traversals – Inorder.

PPT,Chalk and Board

1,2,3,6 2,3 T1,T2

L34 Postorder, Preorder.

Chalk and Board

1,2,3,6 2,3 T1,T2

L35 Additional Binary tree operations. Threaded binary trees.

Chalk and Board

1,2,3,6 2,3 T1,T2

L36 Binary Search Trees – Definition, Insertion.

Chalk and Board

1,2,3,6 2,3 T1,T2

L37 Deletion, Traversal, Searching.

Chalk and Board

1,2,3,6 2,3 T1,T2

L38 Application of Trees.

PPT,Chalk and Board

1,2,3,6 2,3 T1,T2

L39 Evaluation of Expression.

Chalk and Board

1,2,3,6 2,3 T1,T2


Chalk and Board

1,2,3,6 2,3 T1,T2





Assignment Questions: COs attained Q1) Explain with an example: i. Trees ii. Degree of a Tree iii. Binary Tree iv. Priority Queues

1,2,3,6

Q2) Prove that (i) the maximum number of nodes on level i of a binary tree is 2i-1, i ≥ 1. (ii) the maximum number of nodes in a binary tree of depth k is 2k – 1, k ≥ 1.

1,2,3,6

Q3) Write a recursive C function for inorder traversal of a binary tree and trace it with a sample input.

1,2,3,6

Q4) Write a recursive C program to implement inorder, preorder and postorder traversals of a binary tree.

1,2,3,6

Q5) Write the C functions to: i. Count the number of leaf nodes in a binary tree. ii. Copy a binary tree.

1,2,3,6

Q6) Explain the concept of Threaded binary tree with a neat diagram showing its memory representation.

1,2,3,6

Module -5

Module : 05 No. of Hours: 10 Title: Graphs Learning Objectives: The main objectives of this module are to: 1 Define Depth First search, Breadth First Search. 2 Implement the hashing functions 3 Learn Sequential, Indexed Sequential, Random access File organizations Lesson Plan:

Lecture No.


POs attained COs

attained

PSOs attained

Reference Book/

Chapter No.

L41 Graphs: Definitions, Terminologies.

Chalk and Board

1,2,3,4,5,7,11,12

1,2,4,5,6 2,3 T1,T2, R2

L42 Matrix and Adjacency List Representation Of Graphs, Elementary Graph operations.

Chalk and Board

1,2,4,5,6 2,3 T1,T2, R2

L43 Traversal methods: Breadth First Search and Depth First Search.

Chalk and Board

1,2,4,5,6 2,3 T1,T2, R2

L44 Sorting and Searching: Insertion Sort.

Chalk and Board

1,2,4,5,6 2,3 T1,T2, R2

L45 Radix sort, Address Calculation Sort.

Chalk and Board

1,2,4,5,6 2,3 T1,T2, R2

L46 Hashing: Hash Table organizations, Hashing Functions, Static and Dynamic

Chalk and Board

1,2,4,5,6 2,3 T1,T2, R2




Hashing. L47 Files and Their

Organization: Data Hierarchy, File Attributes.

Chalk and Board

1,2,4,5,6 2,3 T1,T2, R2

L48 Text Files and Binary Files, Basic File Operations.

Chalk and Board

1,2,4,5,6 2,3 T1,T2, R2

L49 File Organizations and Indexing.

Chalk and Board

1,2,4,5,6 2,3 T1,T2, R2


Chalk and Board

1,2,4,5,6 2,3 T1,T2, R2

T1,T2: Text book No.1,2 in VTU Syllabus. R2: Reference Book No.2 in VTU Syllabus.


Q1) Define: i. Graph ii. Directed Graph iii. Subgraphs iv. Path v. Cycle. 1,2,4,5,6 Q2) Explain with an example the representation of Graphs as:

i. Adjacency Matrix ii. Adjacency Lists. 1,2,4,5,6

Q3)Distinguish between Static and Dyanamic Hashing. 1,2,4,5,6 Q4)Describe sequential and Indexed File structures 1,2,4,5,6 Q5)With suitable example, explain depth first search and breadth first search algorithms.

1,2,4,5,6

Q6)Define BFS. Expalin briefly how it differs from DFS. 1,2,4,5,6 Assignment 1: Q1) Develop a structure to represent a Vehicle having properties like: No. of wheels, Fuel, Seating capacity, Registration No. Create two variables each for a Two-wheeler and a Four-wheeler category and print the relevant data.

1,2,5

Q2) There are two arrays A and B, A contains 25 elements whereas B contains 30 elements. Write a function to create the array C that contains only those elements that are common to both A and B

1,2,5

Q3) Write a program to implement find and replace utility. The program should ask the user to enter two words, one to be searched and other to replace the searched word.

1,2,5

Q4) write a C program to find the number of nodes in a binary tree at each level. 1,2,5

Q5) Evaluate the following postfix expression using a stack and show the contents of stack after execution of each operation : 50,40,+,18, 14,-, *,+

1,2,5

Assignment 2:

Q1) With a neat diagram, explain the linked representation of the sparse matrix 1,3,5,6




by taking a 4 x 4 sparse matrix. Q2) a linked list contains some positive and negative numbers, using this linked list, write a program to create two separate linked list one containing all positive numbers and other containing all negative numbers.

1,3,5,6

Q3) Construct a binary tree whose preorder traversal is K L N M P R Q S T and inorder traversal is N L K P R M S Q T

1,3,5,6

Q4)

3rd sem course file final for nbabldeacet.ac.in/pdf/coursefile/cs/cse_3rd_sem_coursefile...% / ' ( $...

Documents