semester 3 - rajagiri school of engineering & technology academic... · 3 cs201 discrete...

Rajagiri School of Engineering and Technology

1 Department of Information Technology

SEMESTER 3

PERIOD : AUG 2016 - NOV 2016



RAJAGIRI SCHOOL OF ENGINEERING & TECHNOLOGY

Department of Information Technology

Vision: To evolve into a department of excellence in information technology by the creation

and exchange of knowledge through leading edge research, innovation and services, which

will in turn contribute towards solving complex societal problems and thus building a

peaceful and prosperous mankind.

Mission: To impart high quality technical education, research training, professionalism and

strong ethical values in the young minds for ensuring their productive careers in industry

and academia so as to work with a commitment to the betterment of mankind.

Program Educational Objectives (PEO)

Graduates of Information Technology program shall

PEO 1: Have strong technical foundation for successful professional careers and to evolve as

key-players/ entrepreneurs in the field of information technology.

PEO 2:Excel in analyzing, formulating and solving engineering problems to promote life-

long learning, to develop applications, resulting in the betterment of the society.

PEO 3:Have leadership skills and awareness on professional ethics and codes.

Program Outcomes (PO)

Information Technology Program Students will be able to:

PO 1.Engineering knowledge: Apply the knowledge of mathematics, science,

Engineering fundamentals, and an engineering specialization to the solution of complex

engineering problems.

PO 2.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.

PO 3.Design/development of solutions: Design solutions for complex engineering problems

anddesign 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.

PO 4.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.

PO 5.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.

PO 6.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 theprofessional engineering practice.

PO 7.Environment and sustainability: Understand the impact of the professional

engineeringsolutions in societal and environmental contexts, and demonstrate the

knowledge of, and need for sustainable development.

PO 8.Ethics: Apply ethical principles and commit to professional ethics and responsibilities

andnorms of the engineering practice.

PO 9.Individual and team work: Function effectively as an individual, and as a member

orleader in diverse teams, and in multidisciplinary settings.

PO 10.Communication: Communicate effectively on complex engineering activities with

theengineering community and with society at large, such as, being able to comprehend

and writeeffective reports and design documentation, make effective presentations, and

give and receiveclear instructions.

PO 11.Project management and finance: Demonstrate knowledge and understanding of

theengineering 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.



PO 12. Life-long learning: Recognize the need for, and have the preparation and ability to

engage inindependent and life-long learning in the broadest context of technological

change.

Program Specific Outcomes(PSO)

Information Technology Program Students will be able to:

PSO1: Acquire skills to design, analyse and develop algorithms and implement those using

high-levelprogramming languages.

PSO2: Contribute their engineering skills in computing and information engineeringdomains

like network design and administration, database design and knowledge engineering.

PSO3:Develop strong skills in systematic planning, developing,testing, implementing and

providing IT solutions for different domains which helps in the betterment of life.



INDEX

Sl. No Content Page No

1 Assignment Schedule for S3 IT 7

2 MA201 Linear Algebra & Complex Analysis 8

2.1 Course Information Sheet 9

2.2 Course Plan 14

2.2 Tutorial & Assignment 18

3 CS201 Discrete Computational Structures 29

3.1 Course Information Sheet 30

3.2 Course Plan 35

3.3 Assignment 37

4 IT201 Digital System Design 38

4.1 Course Information Sheets 39

4.2 Course Plan 42

4.3 Tutorial 45

4.4 Assignment 46

5 CS205 Data Structures 47


5.2 Course Plan 53

5.3 Tutorial 54

5.4 Assignment 54

6 IT203 Data Communication 55




6.2 Course Plan 60

6.3 Tutorial 62

6.4 Assignment 62

8 CS231 Data Structures Lab 63


8.2 Lab Schedule 69

8.3 Lab Cycle 70

9 IT231 Digital Circuits Lab 71


9.2 Lab Schedule 76

9.3 Lab Cycle 77



ASSIGNMENT SCHEDULE FOR S4 IT

Week Subject Subject Teacher

2 Linear Algebra and Complex Analysis Yogesh Prasad

2 Discrete Computational Structures Nikhila T Bhuvan

3 Digital System Design Preetha K G

3 Data Structures Mary John

4 Data Communication Abey Abraham

4 Life Skills VinayMenon

5 Linear Algebra and Complex Analysis Yogesh Prasad

5 Discrete Computational Structures Nikhila T Bhuvan

6 Digital System Design Preetha K G

6 Data Structures Mary John

7 Data Communication Abey Abraham

7 Life Skills VinayMenon

Prepared By Approved By

Mary John Mr. Binu A



MA201

LINEAR ALGEBRA

&

COMPLEX ANALYSIS



MA201Linear Algebra & Complex Analysis2

COURSE INFORMATION SHEET

PROGRAMME: ENGINEERING DEGREE: BTECH

COURSE: LINEAR ALGEBRA&COMPLEX

ANALYSIS

SEMESTER: 3 CREDITS: 4

COURSE CODE: MA201

REGULATION:

COURSE TYPE: CORE /ELECTIVE

/BREADTH/S&H

COURSEAREA/DOMAIN: CONTACT HOURS: 3+1 (Tutorial) hours/Week.

CORRESPONDING LAB COURSE CODE : LAB COURSE NAME:

SYLLABUS:

UNIT DETAILS HOURS

I Complex Differentiation

Limit, continuity and derivative of complex functions

Analytic functions,Cauchy –Riemann equation,Laplaces equation,Harmonic functions

Harmonic conjugate

9

II Conformal Mapping

Geometry of Analytic functions,conformal mapping,Mapping w=z^2,conformality of w=e^z

The mapping w=z+1/z Properties of w=1/z

Circles and straight lines,extended complex plane,fixed points

Special linear fractional transformation,cross ratio, cross ratio property-mapping of disks and

half planes

Conformal mapping by w=sinz,w=cosz

10

III Complex Integration

Definition of Complex Line integrals,first evaluation method,second evaluation

method ,cauchys integral theorem,Independencce of path, cauchys integral theorem

for multy connected domains, cauchys integral formula-Derivatives of analytic

finctions,application of Derivatives of analytic finctions,Taylor and Maclaurin series

Power series as Taylor series,laurents series

10

IV

Residue theorem

Singlarities,Zeros,Poles,Essential

singularity,Zeros of an analytic

functions,Residue integration

method,formulas,several

singularities inside the contour

residue theorem,Evalution of

real integral

9

V Linear system of equations

Linear system of equations,Coefficient matrix,Augmented matrix,Gauss Elimination

and back substitution,Elementary row operations,Row equivalent systems,Gauss

elimination –three possible cases,Row echelon form and information from it,Linear

independence –rank of a matrix,vector SpaceDimension-basis,Vector space

R^3,Solution of linear systems,Fundamental theorem of non homogeneous linear

systems, homogeneous linear systems

9



VI Matrix Eigen value Problem

Determination of Eigen values and Eigen vectors,Eigen space,Symmetric

,skewsymmetric and Orthogonal matrices-Simple properties,Basis of Eigen vectors,

Similar matrices,Diagonalisation of a matrix,Principal axis theorem Quadratic forms

9

TOTAL HOURS 52

TEXT/REFERENCE BOOKS:

T/R BOOK TITLE/AUTHORS/PUBLICATION

T Erin Kreyszig:Advanced Engineering Mathematics,10th edition.wiley

R Dennis g Zill&Patric D ShanahanA first course in complex analysis with applications-Jones &Bartlet

publishers

R B.S Grewal-Higher Engineering mathematics,Khanna publishers,New Delhi

R Lipschutz,Linear Algebra,3e(Schaums Series)McGraww Hill Education India2005

R Complex variables introduction and applications-second edition-Mark.J.Owitz-Cambridge publication

COURSE PRE-REQUISITES:

C.CODE COURSE NAME DESCRIPTION SEM

Higher secondary level mathematics To develop basic ideas on matrix operations,

calculus, complex numbers etc

COURSE OBJECTIVES:

1 To equip the students with methods of solving a general system of linear equations

2 To familarize them with the concept of Eigen value and Diagonalisation of a matrix which have many

application in engineering

3 To understand the basic theory of functionsof a complex variable and conformal transformations

COURSE OUTCOMES:

CO1 Students will understand about complex numbers and functions

CO2 Students will get an idea of Conformal mapping

CO3 Students will understand the integration of complex functions

CO4 Students will gain knowledge of various singularities and series expansions

CO5 Students will be able to find the rank of a matrix and solution of equations using matrix theory

CO6 Students will understand the matrix Eigen value problems

PO MAPPING

CO mapping with PO, PSO

PO1 PO2 PO3

P

O

4

PO5 PO6

P

O

7

P

O8 PO9

PO

10

P

O

1

1

P

O

1

2

PSO

1

P

S

O

2

P

S

O

3

CO1 3

CO2 3

CO3 3 1 3



CO4 3 3

CO5 3 3

CO6 3 1 3

EC010

804 L02 3

1.66666

7 3

#

D

I

V

/

0

!

#DIV/

0! #DIV/0!

#

#

#

#

#

#

Mapping to be done based on extent of correlation between specific CO and PO. Refer SAR

Format, June 2015 for details.

* Average of the correlation values of each CO mapped to the particular PO/PSO, corrected to

the nearest whole number

Justification for the correlation level assigned in each cell of the table

above.

PO1 PO2 PO3

P

O

4

P

O

5

PO6 PO

7

PO

8

P

O

9

PO1

0

P

O

1

1

P

O

1

2

PS

O1

P

S

O

2

P

S

O

3

CO1

Fundame

ntal

knowleg

de in

complex

analysis

will help

to

analyze

the

Engineer

ing

problems

ver easily

CO2

Basic

knowled

ge in

Conform

al

mapping

will help

to model

various

problems

in

engineeri

ng fields

Comple

x

analysis

may

address

various

society

related

problem

s

CO3

Complex

integratio

n will

help to

simplify

problems

with high

complexi

ty in

Complex

integrati

on will

help to

design

solutions

to

various

complex



Engineer

ing

engineeri

ng

problems

CO4

Singulari

ties and

Series

expansio

ns will

help to

enrich

the

analysis

of

Engineer

ing

problems

Singulari

ties and

Series

expansio

ns will

help to

design

solutions

to

various

complex

engineeri

ng

problems

CO5

Matrix

theory

will give

a

thorough

knowled

ge in the

applicati

on

problems

Will

able to

analys

e

various

metho

ds of

solutio

ns of

equatio

ns

CO6

Eigen

value,

Eigen

vectors

and

related

theories

will help

to design

several

engineeri

ng

problems

The

solutions

for

various

engineeri

ng

problems

requires

Matrix

theory

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:

SLNO DESCRIPTION PROPOSED

ACTIONS

1 Basic concepts on complex analsis Reading,

Assignments

2 Application of complex analysis in solving various Engineering problems Reading

3 Importance of matrix application in different fields of our society Reading

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN



Application of analytic functions in Engineering

Application of Complex integration in Engineering

Advanced matrix operations

Some applications of eigen values

WEB SOURCE REFERENCES:

1 http://www.math.com/

2 https://www

3 http://www.

4 http

5 http:

DELIVERY/INSTRUCTIONAL METHODOLOGIES:

☐ CHALK & TALK ☐ STUD.

ASSIGNMENT

☐ WEB RESOURCES

☐ LCD/SMART

BOARDS

☐ STUD. SEMINARS ☐ ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT

☐ ASSIGNMENTS ☐ STUD. SEMINARS ☐ TESTS/MODEL

EXAMS

☐ UNIV.

EXAMINATION

☐ STUD. LAB

PRACTICES

☐ STUD. VIVA ☐ MINI/MAJOR

PROJECTS

☐ CERTIFICATIONS

☐ ADD-ON COURSES ☐ OTHERS

ASSESSMENT METHODOLOGIES-INDIRECT

☐ ASSESSMENT OF COURSE OUTCOMES (BY

FEEDBACK, ONCE)

☐ STUDENT FEEDBACK ON FACULTY

(TWICE)

☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY

EXT. EXPERTS

☐ OTHERS

Prepared by Approved by

DBSH (HOD)

https://www/



MA201Linear Algebra & Complex Analysis

COURSE PLAN

Sl.No Module Planned Date Planned

1 1 4-Aug-16 Introduction to complex

numbers

2 1 5-Aug-16 regions in complex plane, limits

of complex nos

3 1 8-Aug-16 continuity and derivative of

complex functions

4 1 9-Aug-16 Analytic functions, egs, simple

problems

5 1 11-Aug-16 CR equations, problems

6 1 12-Aug-16 Laplace equations

7 1 16-Aug-16 Harmonic functions, harmonic

congugate

8 1 18-Aug-16 Problems

9 1 19-Aug-16 problems

10 2 22-Aug-16 Conformal Mapping

11 2 23-Aug-16 Mapping of w=z2 and expz

12 2 25-Aug-16 Problems

13 2 26-Aug-16 inversion properties



14 2 29-Aug-16 linear fractional transformation

15 2 30-Aug-16 Cross ratio

16 2 1-Sep-16 problems

17 2 2-Sep-16 mapping w=sin z

18 2 5-Sep-16 mapping w=cosz

19 2 6-Sep-16 Problems

20 3 20-Sep-16 complex line integrals


22 3 23-Sep-16 cauchys theorems


24 3 27-Sep-16 cauchys integral formula


26 3 30-Sep-16 Taylor and Maclaurins series

27 3 3-Oct-16 problems

28 3 4-Oct-16 Laurents series




30 4 7-Oct-16 Singularities , types


32 4 11-Oct-16 Residue, evaluations

33 4 13-Oct-16 Problems

34 4 14-Oct-16 residue theorem


36 4 18-Oct-16 Evaluation of real integrals. Type

1

37 4 20-Oct-16 Type 2

38 4 21-Oct-16 Type 3


40 5 25-Oct-16 linear eqns

41 5 27-Oct-16 elimination methods





44 5 31-Oct-16 rank and linear indipendance


46 5 4-Nov-16 solution of linear systems

47 5 7-Nov-16 problems

48 6 8-Nov-16 eigen values

49 1 8-Nov-16 eigen vectors problems

50 6 10-Nov-16 types of matrices



53 6 15-Nov-16 diagonalization



56 6 21-Nov-16 quadratic forms





MA201Linear Algebra & Complex Analysis

TUTORIAL & ASSIGNMENT QUESTIONS

State True or False and Justify ( Q.1 a) -1 r))

a) . If f(z) is analytic, then f'(z) exists.

b) . Function f(z) may be differentiable at z = z0, but not analytic near z =

z0.

c) . Function v(x, y) = -3xy2 + x3 is an harmonic function.

d) . The harmonic conjugate of u(x, y) = -2xy is

e) If f(z0) exists, then function f must be continuous at z = z0.

f) If lim z zo f(z) exists, then function f must be continuous at z = z0.

g) . The function f(z) = sin(1/z) is continuous everywhere.

h). The function f(z) = cos(z3) is continuous everywhere.

i). If function f is continuous at z = z0, then f must be differentiable there.

j) If f(z) = | z |2, then for all z, f '(z) = 2z.

k).If f(z) = (iz + 2)2, then f '(z) = 4i - 2z.

l). If f(z) = cos(z3), then f '(z) = - sin(z3).

m). If f(z) = u + iv and the Cauchy-Riemann equations hold for u, v, then f '(z)

must exist.

n). For f = u + iv, the Cauchy-Riemann equations are ux = vy and vx = uy.

o). If f(z) = (x2 - y2 + 2) + 2ixy = u + iv, then the Cauchy-Riemann equations

hold.

p). If f(z) is differentiable, then f '(z) = vy - i uy.

q) A smooth continuous arc is a contour.

r) If C is a contour, then C must be a smooth continuous arc.

2. Define harmonic function. Verify that 22 yx

xu

is a harmonic. Also find

the conjugate harmonic function of u.

3. a) Show that is a harmonic conjugate

of



b) Show that is a harmonic function and find the

harmonic conjugate .

c) Determine where the following functions are harmonic.

and .

d)Find the value of a if u(x, y) = ax2 – y2 + xy is harmonic.

e) Let a, b and c be real constants. Determine a relation among the

coefficients that will guarantee that the function is

harmonic.

4. Let for . Compute the partial derivatives

of and verify that satisfies Laplace's equation.

5. Find an analytic function for the following

expressions. a)

. b) .

c) .

d) .

e) .

f) .

6. Show that are harmonic functions but that their

product is not a harmonic function.

7. Let be a harmonic conjugate of . Show that is the

harmonic conjugate of .

8. Let be a harmonic conjugate of . Show

that is a harmonic function.

9. Suppose that is a harmonic conjugate of and that

is the harmonic conjugate of .



10. Consider the function )sin(),( yeyxu x . Is it harmonic ? If so, find its

harmonic conjugate. Do the same for (a) 33 2),( xyxyxyxu (b)

)cos(),( xeyxu y

TUTORIAL QUESTIONS

11. Prove that 23 32 xyxxu is harmonic and find its harmonic conjugate. Also

find the corresponding analytic function.

12. (i) Show that ex( x cos y – y sin y) is harmonic function. Find the analytic

function f(z) for which ex (x cos y – y sin y) is the imaginary part.

(ii) Find f(z) whose imaginary part is v = x2 – y2 + 2xy – 3x -2y

13. (i) If u + v = (x – y) (x2+4xy +y2) and f(z) = u + iv find f(z) in terms of z

(ii) If u – v = ex(cos y – siny) find f(z) in terms of z

14. Show that the function defined by

is not differentiable at the point even though the Cauchy-Riemann

equations (3-16) are satisfied at the point .

15. Show that the function is nowhere differentiable.

16. Prove that the function

00

052

zif

zifiyxyxzf

satisfies C-R equations at 0z , but it is not analytic at 0z .

17. If f(z) is analytic and uniformly bounded in every domain then

(a)f(z) is zero b) f(z) is constant

(c)f(z) is discontinuous d) None of these



18.a) Does an analytic function exist for

which ? Why or why not?

b)Let 𝑢1(𝑥, 𝑦) = 𝑥2 − 𝑦2 and 𝑢2(𝑥, 𝑦) = 𝑥3 − 3𝑥𝑦2. Find derivative

of

2)( zzf by using the definition.

18. Show that the function )3()3()( 3223 yyxixyxzf is differentiable.

20. If 2|z|)z(f show that )z(f is differentiable only at z = 0.

Module 2

ASSIGNMENT QUESTIONS

1. Show that the transformation 2zw transforms the families of lines hx and

ky into confocal parabolas, having 0w as the common focus.

2. Find the bilinear transformation which maps 1,0,1 of the z-plane anto

1,,1 i of the w-plane. Show that under this transformation the upper half of

the z-plane maps anto the interior of the unit circle 1w .

3. Show that by means of the inversion z

w1

the circle given by 53 z is

mapped into the circle 16

5

16

3w .

b)

.

If u = x3 – 3xy2, show that there exists a function v(x,y) such that w = u + iv is

analytic in a finite region.

c).

Show that

00

0)(

)( 22

2

zif

zifyx

iyxxy

zf is not differentiable at z = 0.



4) Show that the transformation 2/1zw maps the upper half of the inside

of the parabola xccy 222 4 into the infinite strip bounded by

cvu 0,0 where ivuw .

5)Find the image of the hyperbola x2 – y2 = 10 under the transformation w = z2

6).Find the fixed points of the transformation z

zw

96

7)Find the invariant point of the transformation iz

w2

1

8)Find the bilinear transformation that maps z = (1, i, –1) into w=(2, i, –2).

9)Find the image of the circle |z| = 2 by the transformation w = z + 3 +2i

TUTORIAL QUESTIONS

10)Find the image of the circle |z-1| = 1 in the complex plane under the mapping

w = 1

z

11)Find the bilinear transformation which maps the points z1 = -1 z2 = 0 z3 = 1

into the points w1 = 0 w2 = i w3 = 3i respectively

12)Determine the bilinear transformation which maps z1 = 0 z2 = 1 z3 = ∞

into w1 = i w2 = -1 w3 = -i respectively

13)Find the bilinear transformation which transforms (0, -i, -1) into the

points (i, 1, 0)

14) Find the bilinear transformation which maps the points z1 = 2, z2 = i and z3 = 2

onto w1 = 1, w2 = i and w3 = 1 respectively.

15) Show that the transformation

24

45

z

zw maps the unit circle |z|=1 into a circle

of radius unity and centre 1/2.



16)Answer in one or two sentences:

a)The function f(z) = Rez is no where differentiable. Give reason.

b) The transformation zw is not a bilinear transformation. Why?

c) Prove that any bilinear transformation can be expressed as a product of

translation, rotation, magnification or contraction and inversion.

d

e

)

)

)

8

)

)

)

)

)

)

(

K

K

)

)

)

.

MODULE 5

ASSIGNMENT QUESTIONS

1. Solve the following linear system given explicitly or by its augmented

matrix by Gauss elimination method:

a) 4𝑥 − 6𝑦 = −11

−3𝑥 + 8𝑦 = 10

b) [3.0 −0.5 0.61.5 4.5 6.0

]

2. Find the rank and basis for the row space and a basis for the column

space.

a) [0 3 53 5 05 0 10

]

b) [

2 416 8

8 164 2

4 82 16

16 28 4

]

3. Are the following set of vectors linearly independent:

a) [3 4 0 2], [2 −1 3 7], [1 16 −12 −22]

b) [0 1 1], [1 1 1], [0 0 1]

4. Is the given set of vectors a vector space? Give reason. If yes determine the



dimension and find a basis.

a) All vectors in 𝑅3 with 𝑣1 − 𝑣2 + 2𝑣3 = 0

b) All vectors in 𝑅4 with 𝑣1 = 2𝑣2 = 3𝑣3 = 4𝑣4

5. Find the rank of the matrix

[

5−210

−20

−41

1−4

−112

0120

]

6. Solve the linear system by its augmented matrix

[

2513

3−2−14

153

−7

−11−4−32

153

−7

]

7. Is the given set of vectors a vector space give a reason. If yes determine

the dimension and find the basis.( 𝑣1, 𝑣2 … ..denote components)

(a) All vectors in 𝑅3 such that 4 𝑣2+𝑣3 = k

(b) All vectors in 𝑅3 such that 3 𝑣1-2𝑣2 +𝑣3= 0, 4 𝑣1+5𝑣2 = 0

(c) All real numbers.

8. Solve by Gauss elimination method

2w+3x +y-11z = 1

5w -2x +5y -4z =5

w –x+3y -3z =3

3w+ 4x -7y +2z = -7

9.solve the following

a) 4y+3z=8



2x-z=2

3x+2y=5

b)[13 12 −6−4 7 −7311 −13 157

]

10) Which of the following matrices have linearly dependent rows?

A =

100

010

001

B =

987

654

321

C =

2496

9515

832

Tutorial Questions

11) Determine the row-rank of

12) Solve the following linear system.

1. and

2. and

13) Find the condition on a,b,c so that the linear system

is consistent.

14) Let be an n x n matrix. If the system has a non trivial

solution then show that also has a non trivial solution.

15) Solve the system of equations given by:



a)

3 2 10

2 3 8

3 2 5 18

x y z

x y z

x y z

b)

3 2 10

2 3 8

3 2 5 19

x y z

x y z

x y z

c)

1 2 3 4 5

1 2 4

3 4 5

3 10

2 12

2 16

x x x x x

x x x

x x x

d)

3 2 0

2 2 5 0

5 3 2 0

x y z

x y z

x y z

16) Row reduce

0431

4202

8532

.

17)

.

What is the rank of

321

502

213

A ?

18) Find conditions on the constant a such that the linear system

3

5 4

4

x y z a

ax y z

x ay z a

has zero, one or infinitely many solutions

19) Classify these systems as either consistent or inconsistent. If the system

is consistent, further categorize it as underdetermined or uniquely

determined. Explain why the system fits into that category. Also, explain

what this means graphically for each system.

1.2x1 + 3x2 = 9 and 3x1 + 4 x2 = 13

2.3x1 + 4x2 = 7 and 9x1 + 12x2 = 21

3. 2x1 + 3x2 = 8 and 3x1 + 4x2 = 11

20) For what values of and -the following systems have no solution, a

unique solution and infinite number of solutions.

a.

b.

c.



d.

e.

Module 6

Assignment Problems

1. Find the eigenvalues and eigenvectors of the matrix

222

254

245

A

540

032

210

A

2. Find the eigenvalues and the eigenvectors of A where

(i)

53

20A

(ii)

10

50A

(iii)

466

353

331

A

3. Find the eigenvectors of

75.075.0

5.13A

4. Find the eigenvalues and eigenvectors of

005.0

5.05.05.0

105.1

][A

5. What are the eigenvalues of



2.7062

05.759

0037

0006

][A

6. Find the eigenvalues and eigenvectors for the following matrices 2 3

1 2A

2 1

2 0B

1 2 3

0 2 1

2 0 3

C

7. Find the eigenvalues and eigenvectors for the following matrices

53

64A

8. Find the eigenvalues and eigenvectors for the following matrices

9. Determine whether the following vectors in 4 are linearly dependent

or independent.

(1, 3, -1, 4), (3, 8, -5, 7), (2, 9, 4, 23).

10. Which of the following matrices have linearly dependent rows?

A =

100

010

001

B =

987

654

321

C =

2496

9515

832

51

122A

200

020

012

A



CS201

DISCRETE

COMPUTATIONAL

STRUCTURES



CS201 Discrete Computational Structures


RAJAGIRI SCHOOL OF ENGINEERING & TECHNOLOGY


CS 201:DISCRETE COMPUTATIONAL STRUCTURES

PROGRAMME:COMPUTER SCIENCE AND

ENGINEERING

DEGREE: BTECH

COURSE: DISCRETE COMPUTATIONAL

STRUCTURES

SEMESTER: III CREDITS: 4

COURSE CODE: CS 201

REGULATION: 2015

COURSE TYPE: CORE

COURSE AREA/DOMAIN: Logic Development CONTACT HOURS: 3+1(Tutorial) hours/Week.

CORRESPONDING LAB COURSE CODE (IF ANY): LAB COURSE NAME:

SYLLABUS:

UNIT DETAILS HOURS

I Review of elementary set theory : Algebra of sets – Ordered pairs and Cartesian products – Countable and Uncountable sets

Relations :- Relations on sets –Types of relations and their properties – Relational matrix and the

graph of a relation – Partitions – Equivalence relations - Partial ordering- Posets – Hasse

diagrams - Meet and Join – Infimum and Supremum

Functions :- Injective, Surjective and Bijective functions - Inverse of a function- Composition

10

II Review of Permutations and combinations, Principle of inclusion exclusion, Pigeon Hole

Principle,

Recurrence Relations:

Introduction- Linear recurrence relations with constant coefficients– Homogeneous

solutions – Particular solutions – Total solutions

Algebraic systems:- Semigroups and monoids - Homomorphism, Subsemigroups and submonoids

9

III Algebraic systems (contd…):-

Groups, definition and elementary properties, subgroups, Homomorphism and

Isomorphism, Generators - Cyclic Groups, Cosets and Lagrange’s Theorem

Algebraic systems with two binary operations- rings, fields-sub rings, ring homomorphism

8

IV Lattices and Boolean algebra :- Lattices –Sublattices – Complete lattices – Bounded Lattices - Complemented Lattices –

Distributive Lattices – Lattice Homomorphisms.

Boolean algebra – sub algebra, direct product and homomorphisms

10

V Propositional Logic:- Propositions – Logical connectives – Truth tables

Tautologies and contradictions – Contra positive – Logical equivalences and implications

Rules of inference: Validity of arguments.

8

VI Predicate Logic:-

Predicates – Variables – Free and bound variables – Universal and Existential Quantifiers

9



– Universe of discourse.

Logical equivalences and implications for quantified statements – Theory of inference :

Validity of arguments.

Proof techniques: Mathematical induction and its variants – Proof by Contradiction – Proof by Counter

Example – Proof by Contra positive.

TOTAL HOURS 54


Text Books 1. Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to Computer

Science”, Tata McGraw–Hill Pub.Co.Ltd, New Delhi, 2003.

2. Ralph. P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied Introduction”, 4/e, Pearson

Education Asia, Delhi, 2002.

References: 1. Liu C. L., “Elements of Discrete Mathematics”, 2/e, McGraw–Hill Int. editions, 1988.

2. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete Mathematical Structures”, Pearson

Education Pvt Ltd., New Delhi, 2003

3. Kenneth H.Rosen, “Discrete Mathematics and its Applications”, 5/e, Tata McGraw – Hill Pub. Co. Ltd.,

New Delhi, 2003.

4. Richard Johnsonbaugh, “Discrete Mathematics”, 5/e, Pearson Education Asia, New Delhi, 2002.

5. Joe L Mott, Abraham Kandel, Theodore P Baker, “Discrete Mathematics for Computer Scientists and

Mathematicians”, 2/e, Prentice-Hall India, 2009.



Maths they studied at school level

COURSE OBJECTIVES:

1 To introduce mathematical notations and concepts in discrete mathematics that is essential for computing

2 To train on mathematical reasoning and proof strategies.

3 To cultivate analytical thinking and creative problem solving skills

COURSE OUTCOMES:

SiNO DESCRIPTION Blooms’

Taxonomy

Level

C201.1 Students will be able to identify and apply operations on discrete structures

such as sets, relations and functions in different areas of computing

Apply

(level 3 )

C201.2

Students will be able to verify the validity of an argument using propositional

and predicate logic.

Validate

(level 4)

C201.3 Construct



Students will be able to construct proofs using direct proof, proof by

contraposition, proof by contradiction and proof by cases, and by

mathematical induction.

(level 5)

C201.4

Students will be able to solve problems using algebraic structures.

Solve/Apply

(level 3 )

C201.5

Students will be able to solve problems using counting techniques and

combinatorics.

Solve/Apply

(level 3 )

C201.6

Students will be able to apply recurrence relations to solve problems in

different domains.

Apply

(level 3 )

CO-PO AND CO-PSO MAPPING

P

O

1

PO

2

PO

3

PO

4

PO

5

PO

6

PO

7

PO

8

PO

9

PO1

0

PO1

1

PO1

2

PSO

1

PSO

2

PSO

3

C201.1 3 2 1 - _ _ _ _ _ _ _ _ 3 _ _

C201.2 3 3 1 - _ _ _ _ _ _ _ _ 3 _ _

C201.3 3 3 - _ _ _ _ _ _ _ _ - _ _

C201.4 3 2 - _ _ _ _ _ _ _ _ _ 3 _ _

C201.5 3 2 2 _ _ _ _ _ _ _ _ - _ _

C201.6 3 2 2 - _ _ _ _ _ _ 3 _ _

C201

overall

3 2 2 3

JUSTIFICATIONS FOR THE MAPPING

Mapping LOW/MEDIUM/HIGH Justification

CS201.1-PO1 H The concepts of discrete structures can be used to solve various

complex engineering problems

CS201.1-PO2 M The knowledge about the discrete computational structures will help

them to reach conclusions about the complexity and methodologies for

solving real life problems

CS201.1-PO3 L Discrete structures can aid in the representation of various real life

problems

CS201.1-PSO1 H The set theory is widely used in design, analyse and develop

algorithms and implement them using high-level programming

languages.

CS201.2-PO1 H The validity of facts can be verified using predicate and propositional

logic

CS201.2-PO2 H The real life events can be represented and verified using Mathematical

logic

CS201.2-PO3 L Reasoning is made possible for engineering problems

CS201.2-PSO1 H The predicate and propositional logic can be used in validating facts

which could be used in implement them using high-level programming

languages.

CS201.3 -PO1 H The reasoning and inferences made by them can be substantiated by the

various proof techniques

CS201.3-PO2 H The proof techniques can be used to verify the complex engineering



solutions

CS201.4-PO1 H Algebraic structures can be used to visualize the complex engineering

problems involving sets of data

CS201.4-PO2 M The similarity and characteristics of data can be analyzed using

algebraic principles

CS201.4-PSO1 H Algebraic structures can be used to develop algorithms in security

related applications.

CS201.5-PO1 H The arrangement and combinations of data to be taken for different

problems can be identified

CS201.5-PO2 M Counting techniques can be used to reach conclusions in the problems

involving huge data

CS201.6-PO1 H It can be used to compare and contrast the complexity of algorithms

that were developed

CS201.6-PO2 M It helps to analyze the complexity and choose the best method for the

particular problem

CS201.6-PO3 M All algorithms can be compared using a single measure to identify the

amount of computations involved in them so that the optimal one can

be identified

CS201.6-PSO1 H Will be able to apply recurrence relations to solve problems in different

domains.

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:

Si

NO

DESCRIPTION PROPOSED

ACTIONS

RELEVANCE

WITH POs

RELEVANCE

WITH PSOs

1 Graph Theory and its applications Seminar 1 1

2 Applications of lattice, mathematical logic etc in

the field of computer Science and Information

Technology

Guest Lecture 1,2,3 1,2

3 Plotting graph for a function Class lecturing

along with the

topic of

function

1

PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST

LECTURER/NPTEL ETC

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:

Si

NO

DESCRIPTION PROPOSED

ACTIONS

RELEVANCE

WITH POs

RELEVANCE

WITH PSOs

1 Different types of numbers and

their properties

Class Assignment 1,3 3


1 http://web.stanford.edu/class/cs103x/cs103x-notes.pdf

2 https://www.tutorialspoint.com/discrete_mathematics/discrete_mathematics_recurrence_relation.htm

3 http://nms.lu.lv/wp-content/uploads/2016/04/21-linear-recurrences.pdf

4 http://wwwhome.cs.utwente.nl/~infrieks/MHMI/2005.jk.pdf

5 http://nicolas.thiery.name/macs358/Notes/AlgebraicStructures.pdf




CHALK & TALK STUD.

ASSIGNMENT

WEB

RESOURCES

LCD/SMART

BOARDS

STUD.

SEMINARS

☐ ADD-ON COURSES


ASSIGNMEN

TS

STUD.

SEMINARS

TESTS/MODEL

EXAMS

UNIV.

EXAMINATIO

N

STUD. LAB

PRACTICES

STUD. VIVA ☐ MINI/MAJOR

PROJECTS

☐CERTIFICATIONS

☐ ADD-ON

COURSES

☐ OTHERS


ASSESSMENT OF COURSE OUTCOMES

(BY FEEDBACK, ONCE)

STUDENT FEEDBACK ON FACULTY

(TWICE)

☐ ASSESSMENT OF MINI/MAJOR

PROJECTS BY EXT. EXPERTS

☐ OTHERS


Nikhila T Bhuvan Binu A

HOD, DIT




COURSE PLAN

l.No Module Planned

Date

Planned

1 1 4-Aug-16 Review of elementary set theory



4 1 9-Aug-16 Relations

5 1 11-Aug-16 Relations: Types of relations and properties

6 1 12-Aug-16 Relations : matrix and graphical representations

7 1 16-Aug-16 Relations : Partitions and Partial ordering

8 1 18-Aug-16 Relations : Meet & Join, Infimum and supremum

9 1 19-Aug-16 Functions : types

10 1 22-Aug-16 Functions cont...

11 2 23-Aug-16 Review of Permutations and combinations

12 2 25-Aug-16 Review of Permutations and combinations

13 2 26-Aug-16 Pigeon Hole Principle

14 2 29-Aug-16 Recurrence : Intro....

15 2 30-Aug-16 Recurrence Relation : Types

16 2 8-Sep-16 Homogeneous,Particular,Total Solutions

17 2 19-Sep-16 Algebraic systems..

18 2 20-Sep-16 Algebraic Systems cont...

19 3 22-Sep-16 Algebraic structures : Groups and Properties

20 3 23-Sep-16 Algebraic structures : Groups- subgroups

21 3 26-Sep-16 Algebraic structures : Groups- homomorphism and isomorphism

22 3 27-Sep-16 Algebraic structures : Groups- Generators-cyclic groups,cosets

23 3 29-Sep-16 Lagrange's theorem

24 3 30-Sep-16 Algebraic structures : Rings,subrings



25 3 3-Oct-16 Algebraic structures : Fields

26 4 4-Oct-16 Lattice and Boolean Algebra..

27 4 6-Oct-16 Sublattice..

28 4 7-Oct-16 Complete lattice

29 4 24-Oct-16 Bounded lattice

30 4 25-Oct-16 Complemented lattice

31 4 27-Oct-16 Distributive lattice

32 4 28-Oct-16 Lattice homomorphism

33 4 31-Oct-16 Boolean algebra...

34 4 1-Nov-16 Boolean Algebra cont..

35 5 3-Nov-16 Propositional logic

35 5 3-Nov-16 Propositional logic

36 5 4-Nov-16 Tautologies and truth tables

37 5 7-Nov-16 Propositional logic: contradictions and contra positive

38 5 8-Nov-16 Logical Equivalence and implications

39 5 10-Nov-16 Rules of inference

40 5 11-Nov-16 Rules of inference

41 6 14-Nov-16 Predicate Logic

42 6 15-Nov-16 Universal and Essential qualifiers

43 6 17-Nov-16 Universe of discourse

44 6 18-Nov-16 Logical equivalence and implications

45 6 21-Nov-16 Theory of Inference

46 6 22-Nov-16 Proof of Techniques : Mathematical induction

47 6 24-Nov-16 Proof by contradiction : Mathematical induction




ASSIGNMENT 1

Assignment No. 1

1) Write a C program to check whether,

i. Two sets are equal.

ii. Union of two sets

iii. Intersection of two sets

2) Write a C program with recursion to,

i. Display the Fibonacci series

ii. Solve Tower of Hanoi

Assignment No. 2

1) Solve the recurrence relation, 6yn+2 –yn-1 –yn=0 with y0 =0, y1 =1.

2) Solve the Recurrence Relation yn+2 +6yn+1 +9yn = 2n with y0 = y1 =0.

3) Find all Sublattices of <Sn,D> for n=12.

4) Let (G,*) and (G’, *’) be two groups and let f: G->G’ be a homomorphism from G to

G’, then show that,

i. If e is the identity in G and e’ is the identity in G’ then f(e) = e’.

ii. If a EG, then f(a-1) = (f(a)) 0-1.

iii. If H is a subgroup of G, then f(H) ={ f(h) | hEH}.

Assignment No. 3

1) Show that (∃x) (F(x) ^ S(x)) ->(y) (M(y) -> W(y)) if (x) (F(x)-> ¬S(x) follows

2) Show that ¬P follows from ¬ (P^¬Q), ¬Q V R and ¬R.

3) Show that R -> S can be derived from the premises P ->( Q -> S), ¬R V P and Q.

4) Prove by mathematical induction that n! ≤ nfor any integer n ≥ 1.



IT201

DIGITAL SYSTEM

DESIGN



IT201 Digital System Design


PROGRAMME: BTech INFORMATION TECHNOLOGY DEGREE: BTECH

COURSE: DIGITAL SYTEM DESIGN SEMESTER: III CREDITS: 4

COURSE CODE: IT201

REGULATION:2015

COURSE TYPE:CORE

COURSE AREA/DOMAIN: CONTACT HOURS: 3+1 (Tutorial) hours/Week.

CORRESPONDING LAB COURSE CODE (IF ANY):IT 231 LAB COURSE NAME:Digital Circuits Lab

SYLLABUS:

MODULE DETAILS HOURS

I Number systems – Decimal, Binary, Octal and

Hexadecimal – conversion from one system to another –representation of negative numbers –

representation of BCD numbers – character representation – character coding schemes – ASCII –

EBCDIC etc

Addition, subtraction, multiplication and division of binary numbers (no algorithms). Addition and

subtraction of BCD, Octal and Hexadecimal numbers

Representation of floating point numbers – precision –addition, subtraction, multiplication and

division of floating point numbers

10

II Introduction — Postulates of Boolean algebra – Canonical and Standard Forms — logic functions

and gates

Methods of minimization of logic functions — Karnaugh map method and Quine- McClusky

method

Product-of-Sums Simplification — Don’t-Care

Conditions.

9

III Combinational Logic: combinational Circuits and design procedure — binary adder and subtractor

— multi—level NAND and NOR circuits — Exclusive-OR and Equivalence Functions.

Implementation of combination logic: parallel adder,

carry look ahead adder, BCD adder, code converter,

magnitude comparator, decoder, multiplexer, demultiplexer, parity generator.

9

IV Sequential logic circuits: latches and flip-flops – edge triggering and level-triggering — RS, JK, D

and T flipflops — race condition — master-slave flip-flop.

Clocked sequential circuits: state diagram — state

reduction and assignment — design with state equations

7

V

Registers: registers with parallel load - shift registers universal shift registers – application: serial

adder.

Counters: asynchronous counters — binary and BCD ripple counters — timing sequences —

synchronous counters — up-down counter, BCD counter, Johnson

counter, Ring counter

8

VI Memory and Programmable Logic: Random-Access

Memory (RAM)—Memory Decoding—Error Detection and Correction — Read only Memory

(ROM), Programmable Logic Array (PLA).

HDL: fundamentals, combinational logic, adder, multiplexer.

Case Study : Implementation of 4-bit adder and 4-bit by 4-bit multiplier using VHDL

Arithmetic algorithms: Algorithms for addition andsubtraction of binary and BCD numbers,

algorithms for floating point addition and subtraction , Booth’s Algorithm

10

TOTAL HOURS 53



T Mano M. M., Digital Logic & Computer Design, 4/e, Pearson Education, 2013.

T Charles H Roth ,Jr, LizyKurian John, Digital System Design using VHDL,2/e, Cengage Learning

R Floyd T.L. Digital Fundamentals , Universal Bookstall

R Rajaraman V. and T. Radhakrishnan, An Introduction to Digital Computer Design, 5/e,

Prentice Hall India Private Limited, 2012.

R Leach D. Malvino A.P. &Saha – Digital Principles and Applications- Tata McGraw Hill

R Harris D. M. and, S. L. Harris, Digital Design and Computer Architecture, 2/e, Morgan



Kaufmann Publishers, 2013



Computer Basics S1S2

COURSE OBJECTIVES:

1 To impart an understanding of the basic concepts of Boolean algebra and digital circuit design.

2 To provide familiarity with the design and implementation of different types of practically used combinational and

sequential circuits.

3 To provide an introduction to Hardware Description Language

4 To expose the students to basics of arithmetic algorithms

COURSE OUTCOMES:

Sl No

DESCRIPTION

Blooms’

Taxonomy

Level

C201.1

Understand the basic concepts of Number systems and its usage Knowledge

(Level 1)

C201.2 Apply the basic concepts of Boolean algebra for the simplification and implementation of

logic functions using suitable gates namely NAND, NOR etc.

Understand

(level 2)

C201.3 Design simple Combinational Circuits such as Adders, Subtractors, Code Convertors,

Decoders, Multiplexers, Magnitude Comparators etc.

Apply

(Level 3)

C201.4 Design Sequential Circuits such as different types of Counters, Shift Registers, Serial Adders,

Sequence Generators.

Apply

(Level 3)

C201.5

Use Hardware Description Language for describing simple logic circuits.

Analyze

(Level 4)

C201.6 Apply algorithms for addition/subtraction operations on Binary, BCD and Floating Point

Numbers.

Apply

(Level 3)


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

C201.1 1 _ _ _ _ _ _ _ _ _ _ _ _ _ _

C201.2 3 2 1 _ _ _ _ _ _ _ _ _ 1 _ _

C201.3 - 2 3 2 _ _ _ _ _ _ _ _ _ _ 2

C201.4 _ 2 3 2 _ _ _ _ _ _ _ _ _ _ 2

C201.5 _ 1 1 1 _ _ _ _ _ _ _ _ - _ 1

C201.6 1 _ 1 _ _ _ _ _ _ _ _ _ 1 _ _

C201 2 3 3 2 _ _ _ _ _ _ _ _ 1 _ 2

GAPES IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:

SNO DESCRIPTION PROPOSED

ACTIONS

1 Simulation Tools Demo

2 Practical use of number system Assignment

3 Practical use of flip flops Seminar

4 Design of circuits Practical



5 Application of flip flops in computers Practical

PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC

JUSTIFICATIONS FOR CO-PO MAPPING

MAPPING LOW/MEDIUM/HIGH JUSTIFICATION

C201.1-PO1 L An understanding of various number systems and helps the students in

the better way of connecting with digital computer

C201.2-PO1 H Knowledge of Boolean algebra helps the students in circuit designing

C201.2-PO2 M Analysis of circuit provide the students for better understanding of

digital circuits

C201.2-PO3 L Can help the students in design of simple circuit using gates

C201.2-PSO1 L Acquire skills to develop tools for simplifying Boolean expression

C201.3-PO2 M A complexity analysis of the engineering solutions could to provide

Information to provide valid conclusions

C201.3-PO3 H Designing of complex combinational circuits

C201.3-PO4 M Choose a simplified circuit for implementing a combinational circuit

using an appropriate simplification method

C201.3-PSO3 M Choosing the appropriate method to implement the function will help

in a better analysis of the circuit

C201.4-PO2 M Having knowledge in Boolean function, students could develop

sequential circuits

C201.4-PO3 H Knowledge of Flip flops could be used to reduce the complexity of the

sequential circuit

C201.4-PO4 M Having the knowledge in various sequential circuit design principles

students could analyze the problem and come to a conclusion on which

design principle to be used

C201.4-PSO3 M Choosing the appropriate method to implement the sequential circuit

will help in a better analysis of the circuit

C605.5-PO3 L Lower Bound theory could be used to reduce the complexity of

algorithms during designing it.

C605.5-PO4 L Knowledge of Lower Bound theory could be used to reduce the

complexity of algorithms during design of complex problems.

C201.5-PO2 L Knowledge of hardware description language to understand the concept

of simple circuits

C201.5-PO3 L Having knowledge of hardware description language students could

able to analyze the circuits

C201.5-PO4 L Having knowledge of hardware description language students could

able to design complex circuits

C201.5-PSO3 L Students could able to implementing and testing the circuit

C201.6-PO1 L Knowledge in Engineering fundamentals to help the students to do

mathematical calculations using various algorithms

C201.6-PO3 L Apply the algorithms on various number systems

C201.6-PSO1 L Developing new algorithms for various numbers system manipulations


1 Design of Counters

2 Design of small logical circuits beyond the scope of assignment

3 Programmable logic design

4 Analogue interface for digital circuits

5 Digital to analogue conversion




1 nptel.iitm.ac.in

2 http://www.asic-world.com/digital/tutorial.html

3 http://zebu.uoregon.edu/~rayfrey/432/DigitalNotes.pdf

4 http://www.technologystudent.com/elec1/dig1.htm

5 http://www.chem.uoa.gr/applets/appletgates/appl_gates2.html


CHALK & TALK STUD. ASSIGNMENT WEB RESOURCES

LCD/SMART BOARDS STUD. SEMINARS ☐ ADD-ON COURSES


ASSIGNMENTS STUD. SEMINARS TESTS/MODEL EXAMS UNIV. EXAMINATION

☐ STUD. LAB PRACTICES ☐ STUD. VIVA ☐ MINI/MAJOR PROJECTS ☐ CERTIFICATIONS



ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK,

ONCE)

STUDENT FEEDBACK ON FACULTY (TWICE)

☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS ☐ OTHERS


Preetah K G Binu A

(Faculty) (HOD)




COURSE PLAN

Day Topic

1. Introduction to digital systems

2. Number Systems- Decimal, Binary

3. Binary Arithmetic, Signed Numbers

4. Signed number arithmetic

5. Hexadecimal number system

6. Octal Number systems

7. BCD Numbers

8. BCD addition and subtraction

9. Character coding schemes- ASCII, EBCDIC

10. Representation of floating point numbers- precision , addition

11. Floating point numbers- Subtraction, multiplication and division

12. Tutorial

13. Introduction to Boolean algebra- Postulates

14. Canonical and standard forms

15. Logic functions and logic gates

16. Minimization- K Map

17. K map Simplification

18. Quine McClusky method

19. Quine McClusky method

20. Product of sums simplification, Don't care condition

21. Tutorial

22. Combinational circuits-Half and Full Adder s

23. Parallel Adder, Carry Look Ahead Adder

24. BCD Adder

25. Code converter

26. Comparator,

27. Decoder, encoder

28. Multiplexer, demultiplexer `

29. Parity generator

30. Tutorial

31. Sequential circuits- Flip flops

32. RS JK flip flop

33. D ,T Flip flop

34. Master slave FF, Race condition

35. Clocked circuits- Sequential diagram

36. Reduction and assignment, design with state equations

37. Sequential circuit-design with state equations

38. Counters- Asynchronous counters Binary and BCD

39. Ripple counters

40. Synchronous counters-up down counters

41. Synchronous counters-BCD counters

42. Registers-Shift registers

43. Universal shift registers

44. Johnson counter, ring counter



45. Tutorial

46. Memory -Introduction , RAM

47. Error correction, detection

48. Rom

49. PLA

50. HDL

51. CASE STUDY

52. CASE STUDY

53. Arithmetic algorithms- Addition

54. Arithmetic algorithms

55. Arithmetic algorithms -BCD

56. Algorithm for floating point addition

57. Booths Algorithm

58. Tutorial

59. Revision

60. Question Paper Discussion




TUTORIAL 1

1. (11012 + 24 8 + F1416 ) * 410and give the result in binary.

2. (11112 + 2410+ C8416) / 1810 and give the result in base 8.

3. Perform the following addition.

a) 5AC16+9BF16 b) 56C16+D4516

4. Find the BCD representation of the following Decimal numbers and perform the

addition using the rules of BCD addition..

a) 873+ 156 b) 867+253

5. Convert the each of the gray code numbers to binary number.

a)110101001110 b) 101101111011

TUTORIAL 2

1. Design a 3-bit asynchronous up counter, using T flip-flops.

2. Distinguish between synchronous and asynchronous counters.

3. Draw a diagram showing how to construct an edge-triggered SR flip-flop from ANDgates,

NAND gates and inverters.

4. Simplify the expression F(A, B, C, D) = ∑(4, 8, 9, 10, 11, 12, 14, 15) using K map

5. Convert F(A,B,C,D) = (0,1,3,5,9,11,13,15) into the minterm form and

Implement the function with a multiplexer and other necessary logic gates.

Show the implementation table using A as input and B,C,D as the selectors.




ASSIGNMENT 1

1. Describe the ASCII and EBCDIC code in detail.

ASSIGNMENT 2

2. Draw 5 and 6 variable K map and mark the minterms in it.

ASSIGNMENT 3

1. Implement the following Boolean functions using simple AND, OR and NOT logic gates(do

not simplify the functions):

2 . Reduce the following expressions, using Boolean algebraic methods. State the relevant law

or postulate used at each step.

3. Using only the theory of Boolean algebra and algebraic manipulation, simplify the following

Boolean expressions to a minimum number of literals:

3. Write the following functions in shorthand “╥ ” product of maxterms form:

5. Write the following functions in shorthand “∑” sum of minterms form:



CS205

DATA STRUCTURES



CS205 Data Structures


PROGRAMME : Information Technology DEGREE : BTECH

COURSE : Data Structures SEMESTER : IV

CREDITS : 4

COURSE CODE : CS205

REGULATION : 2016 COURSE TYPE: CORE

COURSE AREA/DOMAIN : CONTACT HOURS : 3+1 (Tutorial) ours/Week.

CORRESPONDING LAB COURSE CODE (IF

ANY) : CS231 LAB COURSE NAME : Data Structures Lab

SYLLABUS:

UNIT DETAILS HOURS

I

Introduction to programming methodologies – structured approach, stepwise

refinement techniques, programming style, documentation – analysis of

algorithms: frequency count, definition of Big O notation, asymptotic analysis of

simple algorithms. Recursive and iterative algorithms.

9

II

Abstract and Concrete Data Structures- Basic data structures – vectors and arrays.

Applications, Linked lists:- singly linked list, doubly linked list, Circular linked

list, operations on linked list, linked list with header nodes, applications of linked

list: polynomials.

9

III

Applications of linked list (continued): Memory management, memory allocation

and de-allocation. First-fit, best-fit and worst-fit allocation schemes.

Implementation of Stacks and Queues using arrays and linked list, DEQUEUE

(double ended queue). Multiple Stacks and Queues, Applications.

9

IV

String: - representation of strings, concatenation, substring searching and deletion.

Trees: - m-ary Tree, Binary Trees – level and height of the tree, complete-binary

tree representation using array, tree traversals (Recursive and non-recursive),

applications. Binary search tree – creation, insertion and deletion and search

operations, applications.

10

V

Graphs – representation of graphs, BFS and DFS (analysis not required)

applications.

Sorting techniques – Bubble sort, Selection Sort, Insertion sort, Merge sort, Quick

sort, Heaps and Heap sort. Searching algorithms (Performance comparison

expected. Detailed analysis not required)

9

VI Linear and Binary search. (Performance comparison expected. Detailed analysis

not required) Hash Tables – Hashing functions – Mid square, division, folding,

digit analysis, collusion resolution and Overflow handling techniques.

10

TOTAL HOURS 56



T Samanta D., Classic Data Structures, Prentice Hall India, 2/e, 2009.

T Richard F. Gilberg, Behrouz A. Forouzan, Data Structures: A Pseudocode Approach with C,

2/e, Cengage Learning, 2005.



R Horwitz E., S. Sahni and S. Anderson, Fundamentals of Data Structures in C, University Press

(India), 2008.

R Aho A. V., J. E. Hopcroft and J. D. Ullman, Data Structures and Algorithms, Pearson

Publication,1983.

R Peter Brass, Advanced Data Structures, Cambridge University Press, 2008

R Lipschuts S., Theory and Problems of Data Structures, Schaum’s Series, 1986.

R Wirth N., Algorithms + Data Structures = Programs, Prentice Hall, 2004.

R Hugges J. K. and J. I. Michtm, A Structured Approach to Programming, PHI, 1987.

R Martin Barrett, Clifford Wagner, And Unix: Tools For Software Design, John Wiley, 2008

reprint.



BE101-05 Introduction to Computer and Problem

Solving Basics In Programming Concepts 1

COURSE OBJECTIVES:

1 To impart a thorough understanding of linear data structures such as stacks, queues and their

applications.

2 To impart a thorough understanding of non-linear data structures such as trees, graphs and their

applications.

3 To impart familiarity with various sorting, searching and hashing techniques and their

performance comparison.

4 To impart a basic understanding of memory management.

COURSE OUTCOMES:

SNO DESCRIPTION Blooms’ Taxonomy Level

CS205.1 Compare different programming methodologies and define

asymptotic notations to analyze performance of algorithms.

Understand, Analyze,

Evaluate (level 2 ,4 and 5)

CS205.2 Use appropriate data structures like arrays, linked list, stacks and

queues to solve real world problems efficiently.

Knowledge, Apply

(level 1 and 3)

CS205.3 Represent and manipulate data using nonlinear data structures like

trees and graphs to design algorithms for various applications. Apply (level 3)

CS205.4 Illustrate and compare various techniques for searching and sorting. Analyze and Evaluate

(level 4 and 5 )



CS205.5 Appreciate different memory management techniques and their

significance.

Knowledge

(level 1)

CS205.6

Illustrate various hashing techniques. Knowledge, Analyze (level

1 and 4)


PO

1

PO

2

PO

3

PO

4

PO

5

PO

6

PO

7

PO

8

PO

9

PO1

0

PO1

1

PO1

2

PSO

1

PSO

2

PSO

3

CS205.1 2 2 1 _ _ _ _ _ _ _ _ _ 2 _ _

CS205.2 3 2 2 1 _ _ _ _ _ _ _ _ 2 2 _

CS205.3 3 2 2 2 _ _ _ _ _ _ _ _ 2 2 _

CS205.4 3 1 2 1 _ _ _ _ _ _ _ _ 2 1 _

CS205.5 3 2 _ _ _ _ _ _ _ _ _ _ 2 - _

CS205.6 3 2 2 _ _ _ _ _ _ _ _ _ 3 - _

CS205

Overall

Level

3 2 2 1 _ _ _ _ _ _ _ _ 2 3 _


MAPPING LOW/MEDIU

M/HIGH JUSTIFICATION

CS205.1-PO1 M Computation of complexity of algorithms helps to write efficient

algorithms to solve complex problems.

CS205.1-PO2 M This helps in analyzing complex engineering problems and the

complexity computed helps to substantiate our conclusions.

CS205.1-PO3 L

Knowledge on different programming methodologies and complexity

analysis helps to design efficient solutions for complex engineering

problems.

CS205.1-

PSO1

M Basic knowledge in complexity analysis and different programming

methodologies helps to develop efficient programs.

CS205.2-PO1 H Study of basic linear data structures helps to find solutions of complex

engineering problems.

CS205.2-PO2 M Use of appropriate data structures helps to identify and analyzecomplex

engineering problems

CS205.2-PO3 M Study of data structures helps to design solutions for complex engineering

problems

CS205.2-PO4 L

Knowledge on basic data structures helps in of experiments, analysis and

interpretation of data, and synthesis of the information to provide valid

conclusions.

CS205.2-

PSO1 M

This basic knowledge helps to acquire skills to design, analyse and

develop algorithms and implement those using high-level programming

languages.

CS205.2- M This knowledge helps to contribute their engineering skills in computing



PSO2 and information engineering domains like network design and

administration, database design and knowledge engineering.

CS205.3-PO1 H Study of nonlinear data structures and their applications help to find out

solutions of complex engineering problems.

CS205.3-PO2 M

Study of nonlinear data structures and their applications help to identify,

formulate, review research literature, and analyze complex engineering

problems

CS205.3-PO3 M

Knowledge about nonlinear data structures helps to design solutions for

complex engineering problems and design system components or

processes

CS205.3-PO4 M Use these concepts in design of experiments, analysis and interpretation

of data, and synthesis of the information to provide valid conclusions.

CS205.3-

PSO1 M

Study of nonlinear data structures helps to acquire skills to design,

analyze and develop algorithms and implement those using high-level

programming languages.

CS205.3-

PSO2 M

Knowledge in these concepts helps to contribute their engineering skills

in computing and information engineering domains like network design

and administration, database design and knowledge engineering.

CS205.4-PO1 H Knowledge in searching and sorting helps to find out the solution of

complex engineering problems.

CS205.4-PO2 L

Searching and sorting concepts helps to identify, formulate, review

research literature, and analyze complex engineering problems reaching

substantiated conclusions.

CS205.4-PO3 M These concepts helps to design solutions for complex engineering

problems and design system components or processes

CS205.4-PO4 L Helps in design of experiments, analysis and interpretation of data, and

synthesis of the information to provide valid conclusions.

CS205.4-

PSO1 M

These concepts helps to acquire skills to design, analyse and develop

algorithms and implement those using high-level programming

languages.

CS205.4-

PSO2 L

They can contribute their engineering skills in computing and information

engineering domains like network design and administration, database

design and knowledge engineering.

CS205.5-PO1 H Memory management concepts and allocation schemes helps to solve


CS205.5-PO2 M Study of memory management concepts helps to identify, formulate,

review research literature, and analyze complex engineering problems

reaching substantiated conclusions

CS205.5-

PSO1 M

Helps them to acquire skills to design, analyse and develop algorithms

and implement those using high-level programming languages.

CS205.6-PO1 H Study of hashing techniques helps acquire basic knowledge and to solve


CS205.6-PO2 M Knowledge in hashing techniques helps to identify, formulate, review

research literature, and analyze complex engineering problems

CS205.6-PO3 M These helps to design solutions for complex engineering problems and



design system components.

CS205.6-

PSO1 H

Knowledge in hashing helps to acquire skills to design, analyse and

develop algorithms and implement those using high-level programming

languages.


SNO DESCRIPTION PROPOSED ACTIONS

1 File Structures Seminar

PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY

VISIT/GUEST LECTURER/NPTEL ETC

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS / DESIGN:

1 Minimum Spanning Tree


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

2 www.cs.auckland.ac.nz

3 www.mec.ac.in

4 www.cs.cmu.edu

5 www.bowdoin.edu

6 www.cse.iitkgp.ac.in

7 www.cs.wcupa.edu

8 www.csbdu.in

9 www.bvicam.ac.in

10 www.courses.cs.vt.edu


CHALK & TALK STUD. ASSIGNMENT WEB

RESOURCES

LCD/SMART BOARDS STUD. SEMINARS ADD-ON

COURSES


ASSIGNMENTS STUD.

SEMINARS

TESTS/MODEL

EXAMS

UNIV.

EXAMINATION

STUD. LAB

PRACTICES ☐ STUD. VIVA

☐ MINI/MAJOR

PROJECTS ☐ CERTIFICATIONS

☐ ADD-ON

COURSES ☐ OTHERS


ASSESSMENT OF COURSE OUTCOMES (BY

FEEDBACK, ONCE)

STUDENT FEEDBACK ON

FACULTY (TWICE)

☐ ASSESSMENT OF MINI/MAJOR PROJECTS

BY EXT. EXPERTS ☐ OTHERS

Prepared by Approved byMs.

Mary John Mr.Binu A




COURSE PLAN

Sl.No Day Module Topics

1 Day 1 3 Introduction

2 Day 2 3 Basic Data Structures

3 Day 3 3 Arrays

4 Day 4 3 Sparse Array

5 Day 5 3 Vector

6 Day 6 3 Stack, Queue

7 Day 7 3 Double Ended Queue

8 Day 8 2 Singly Linked List

9 Day 9 2 SLL- Deletion

10 Day 10 2 Doubly Linked List

11 Day 11 2 DLL-Deletion

12 Day 12 2 Applications

13 Day 13 2 Polynomials

14 Day 14 2 Memory Management

15 Day 15 4 Allocation Schemes

16 Day 16 4 Representation of strings

17 Day 17 4 Concatenation

18 Day 18 4 Searching and Deletion

19 Day 19 4 Substring

20 Day 20 4 Tree

21 Day 21 4 Tree Traversals

22 Day 22 4 Binary Tree

23 Day 23 4 Insertion, Search

24 Day 24 4 Deletion

25 Day 25 5 Graph

26 Day 26 5 BFS

27 Day 27 5 DFS

28 Day 28 5 Bubble Sort, Selection Sort

29 Day 29 5 Heap Sort

30 Day 30 5 Merge Sort

31 Day 31 5 Quick Sort

32 Day 32 5 Insertion Sort

33 Day 33 6 Linear Search

34 Day 34 6 Binary Search

35 Day 35 6 Hash Tables

36 Day 36 6 Midsquare, Division

37 Day 37 6 Folding, Digit Analysis

38 Day 38 6 Collision Resolution

39 Day 39 6 Overflow Handling Techniques

40 Day 40 1 Introduction to programming methodologies



41 Day 41 1 Stepwise refinement techniques

42 Day 42 1 Programming Style

43 Day 43 1 Analysis of algorithms

44 Day 44 1 Frequency Count

45 Day 45 1 Big O Notation

46 Day 46 1 Asymptotic Analysis of simple algorithms

47 Day 47 1 Recursive Algorithms

48 Day 48 1 Iterative Algorithms


TUTORIAL 1

1. Write an algorithm to check parenthesis matching.

2. Write an algorithm to evaluate arithmetic expressions.

3. Write an algorithm to convert infix to prefix expression.

4. Write an algorithm to perform the following operations

Length of string

String Concatenation

Sting Reverse

String Copy

5. Write an algorithm to solve tower of Hanoi problem.


ASSIGNMENT 1

Assignment I

Write short note on

Hash Tables

Hashing functions

Collusion resolution

Overflow handling techniques.

Assignment II

Write short note on:

Programming Methodologies

Structured Approach

Recursive and Iterative algorithms



IT203

DATA COMMUNICATION



IT203 Data Communication



PROGRAMME: INFORMATION TECHNOLOGY DEGREE: BTECH

COURSE: DATA COMMUNICATION SEMESTER: III CREDITS: 3

COURSE CODE: IT203

REGULATION:2016

COURSE TYPE:CORE

COURSE AREA/DOMAIN:COMMUNICATION CONTACT HOURS: 3+0 (Tutorial) hours/Week.

CORRESPONDING LAB COURSE CODE (IF ANY):Nil LAB COURSE NAME:Nil

SYLLABUS:

MODULE DETAILS HOURS

I Communication model Simplex, half duplex and full duplex transmission. Time

Domain and Frequency Domain concepts - Analog& Digital data and signals -

Transmission Impairments - Attenuation, Delay distortion, Noise - Different

types of noise, Channel capacity -Shannon's Theorem –

Transmission media- twisted pair, Coaxial cable, optical fiber, terrestrial

microwave, satellite microwave.

7

II Synchronous and Asynchronous transmission. Sampling theorem - Encoding

digital data into digital signal - NRZ, Biphase, Multilevel binary- Encoding

digital data into analog signals - ASK, FSK, PSK 8

III Encoding analog data into digital signals - PCM, PM, DM – Encoding analog

data into analog signals - AM, FM, PM. Multiplexing - TDM, FDM, WDM

& DWDM Encoding techniques, Spread spectrum-The concept of spread

spectrum – frequency hopping spread spectrum – direct sequence spread

spectrum – code division multiple access

8

IV Purpose of encoding, Instantaneous codes, Construction of instantaneous codes.

Construction of basic source codes. Huffman coding, Arithmetic coding, ZIP

coding.

Error Detecting and correcting codes. Error detection - parity check,

Forward Error Correction. Block codes, Convolution codes.

7

V Cyclic codes: - Generator polynomial, Generator and Parity check matrices,

Encoding of cyclic codes, Syndrome computation and error detection - CRC,

VRC.

Decoding of cyclic codes, BCH codes, RS codes, Burst error correction.

7

VI Hamming codes, Encoding and decoding of systematic and unsystematic

Codes

Basic principles of switching - circuit switching, packet switching, message

switching.

Basics of wireless communication, Introduction to WiFi, WiMax, GSM,

7



GPRS.

TOTAL HOURS 44



R Stallings W., Data and Computer Communications, 8/e, Prentice Hall, 2007. R Forouzan B. A., Data Communications and Networking, 4/e, Tata McGraw Hill, 2007. 9

R Tanenbaum A. S and D. Wetherall, Computer Networks, Pearson Education, 2013

R Schiller J., Mobile Communications, 2/e, Pearson Education, 2009.

R

Ranjan Bose ,Information Theory, Coding and Cryptography 2nd Edition:, Tata McGraw-

Hill, New Delhi, 2008

R Simon Haykin,Communication Systems: John Wiley & Sons. Pvt. Ltd

R Taub& Schilling, Principles of Communication Systems: Tata McGraw-Hill

R Das, Mullick&Chatterjee, Principles of Digital Communication: Wiley Eastern Ltd.

R Error Control Coding Fundamentals and Applications: Prentice Hall Inc.



COURSE OBJECTIVES:

1 Build an understanding of the fundamental concepts of data transmission

2 Familiarize the student with the basics of encoding of analog and digital data

3 Preparing the student for understanding advanced courses in computer networking

COURSE OUTCOMES:

Sl No

DESCRIPTION

Blooms’

Taxonomy

Level

C203.1 Explain Data Communications concepts and its components.

Knowledge

(Level 1)

C203.2

Identify the different types of Transmission media and their functions

within a network.

Analyze

and

evaluate

(level 4and

level 5 )

C203.3 Independently understand encoding, decoding , error correction and

error detection in data communication

Understand

(Level 2)

C203.4

To understand switching principles and basics of wireless communication

Understand

(Level 2)




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

C203.1 3 _ 1 _ _ _ _ _ _ _ _ 2 _ 2 -

C203.2 - 3 - _ _ _ - _ _ - _ 3 - 3 _

C203.3 - 3 3 2 _ _ _ _ _ _ _ 1 _ - -

C203.4 3 - - - _ 1 _ _ _ _ _ 2 _ _ 3

C203 3 3 2 2 _ 1 - _ _ - _ 2 2 3


SNO DESCRIPTION PROPOSED

ACTIONS

1 Familiarization of Parabolic Antenna Assignment

2 Digital Communication Fundamentals and Applications Topic beyond syllabus

3 Cellular Communication Techniques Topic beyond syllabus



MAPPING LOW/MEDIUM/HIGH JUSTIFICATION

C203.1-PO1 H Students could knowledge about basic communication concepts

C203.1-PO2 H Knowledge of various transmission impairments in the communication

channels helps students in problem analysis.

C203.1-PO12 M Information acquired from the basic transmission media techniques

provides lifelong learning in the context of technological change.

C203.1-PSO2 M Having the knowledge about the working of Transmission media helps

in the study and design of communication networks.

C203.2-PO3 M Studies about the various encoding techniques helps the students to

understand various transmission modes.

C203.2-PO12 H Students gain the ability to cope up with modulation methods used for

communication after learning about the basic encoding techniques.

C203.2-PSO2 H Students will be able to assess and evaluate different analogand digital

modulation techniques used for communication.

C203.3-P02 H Knowledge of Error detection and correction of codes helps students in

problem analysis.

C203.3-PO3 H Studies about the various encoding and decoding techniques helps the

students to fix up error correction and detection of source code

transmission.

C203.3-PO4 M Understanding the various encoding and decoding techniques helps in

analyzing research based works.

C203.3-PO12 L Information acquired from the error detection and correction provides

lifelong learning in the context of technological change.

C203.4-PO1 H Students could apply the knowledge of various switching techniques

used in communication.

C203.4-PO6 L Students gain the ability to cope up with the technology change after

learning about the basic wireless communication concepts.

C203.4-PO12 M Information acquired from the fundamentals of wireless

communication provides lifelong learning in the context of

technological change.

C203.4-PSO3 H The students could analyze and interpret the switching mechanism used

over communication and could effectively plan and implement

mechanisms on the applications.




1 Cellular Communication Techniques

2 FM Stereo Broadcasting

3 Digital Communication Fundamentals and Application


1 nptel.iitm.ac.in

2 https://en.wikipedia.org/wiki/FM_broadcasting

3 https://www.cyut.edu.tw/~yfahuang/huang/ch02.pdf

4 https://en.wikipedia.org/wiki/Parabolic_antenna

5 http://www.tutorialspoint.com/wimax/wimax_wifi_comparison.html



LCD/SMART BOARDS STUD. SEMINARS ☐ ADD-ON COURSES



☐ STUD. LAB PRACTICES ☐ STUD. VIVA ☐ MINI/MAJOR PROJECTS ☐ CERTIFICATIONS




ONCE)


☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS ☐ OTHERS


Abey Abraham Binu A

(Faculty) (HOD)




COURSE PLAN

Course Plan

Sl.No Module Planned Date Planned

1 1 3-Aug-2016 Communication model Simplex, half duplex and

full duplex transmission

2 1 4-Aug-2016 Simplex, half duplex and full duplex transmission

3 1 5-Aug-2016 Analog& Digital data and signals

4 1 5-Aug-2016 Transmission Impairments - Attenuation, Delay

distortion,Noise - Different types of noise

5 1 8-Aug-2016 Channel capacity -Shannon's Theorem

6 1 10-Aug-2016 Transmission media- twisted pair,Coaxial cable,

optical fiber

7 1 11-Aug-2016 terrestrial microwave, satellite

microwave.(problems)

8 2 12-Aug-2016

Synchronous and Asynchronous

transmission,Sampling theorem -Encoding digital

data into digital signal

9 2 17-Aug-2016 NRZ, Biphase, Multilevel binary

10 2 23-Aug-2016 Encoding digital data into analog signals - ASK

11 2 24-Aug-2016 FSK,PSK

12 2 25-Aug-2016 Encoding analog data into digital signals - PCM

13 2 26-Aug-2016 PM, DM

14 2 26-Aug-2016 Encoding analog data into analog signals - AM

15 2 31-Aug-2016 FM, PM.

16 3 1-Sep-2016 Multiplexing - TDM, FDM

17 3 2-Sep-2016 WDM & DWDM Encoding techniques

18 3 7-Sep-2016 Spread spectrum-The concept of spread spectrum

– frequency hopping spread spectrum

19 3 8-Sep-2016 direct sequence spread spectrum – code division

multiple access

20 4 22-Sep-2016 Purpose of encoding, Instantaneous codes

21 4 23-Sep-2016 Construction of instantaneous Codes



22 4 23-Sep-2016 Construction of instantaneous Codes

23 4 28-Sep-2016 Construction of basic source codes. Huffman

coding

24 4 29-Oct-2016 Arithmetic coding, ZIP coding.

25 4 30-Aug-2016 Error Detecting and correcting codes

26 4 5-Oct-2016 Error detection - parity check,Forward Error

Correction.

27 4 6-Oct-2016 Block codes, Convolution codes.

28 4 13-Oct-2016 Block codes, Convolution codes.

29 5 14-Oct-2016 Cyclic codes: - Generator polynomial, Generator

and Parity check matrices

30 5 19-Oct-2016 Encoding of cyclic codes

31 5 20-Oct-2016 Syndrome computation and error detection

32 5 21-Oct-2016 CRC, VRC

33 5 26-Oct-2016 Decoding of cyclic codes

34 5 27-Oct-2016 BCH codes

35 5 28-Oct-2016 RS codes

36 5 28-Oct-2016 Burst error correction

37 6 2-Nov-2016 Hamming codes

38 6 3-Nov-2016 Encoding and decoding of systematic and

unsystematic codes

39 6 4-Nov-2016 Basic principles of switching - circuit switching,

packet switching, message switching

40 6 9-Nov-2016 Basics of wireless communication, Introduction to

WiFi

41 6 10-Nov-2016 WiMax, GSM

42 6 11-Nov-2016 GPRS




TUTORIAL 1

1. If we need to send 265Kbs data over noiseless channel with a bandwidth 20 KHz.

How many signal levels do we need?

2. Consider an extremely noisy channel in which SNR is 3162.the bandwidth of channel

is 3000Hz.Find the capacity of the channel?

3. If SNRDb is 36 and channel bandwidth is 2 MHz. Find channel capacity?

4. Draw the sine wave signal of frequency modulation and amplitude modulation.

5. What are the difference between FM and AM?

6. An analog signal carries 4 bits per signal element. If 1000 signal elements are

transmitted per second. Find the bit rate?

7. An analog signal has a bit rate of 8000bps and a baud rate of 1000 baud.How many

data elements are carried by each signal element?How many levels of data signal

elements do they need?

8. If we want to digitize the human voice containing frequency of 4000 hz,assuming that

there are 8 bits per symbol. What will be the bit rate?

9. Describe about QAM,QPSK,DPSK

10. A message source produces two independent systems A and B with probabilities 0.4

and 0.6 respectively. Calculate the efficiency of the source and hence its redundancy

.if the symbols are received in average with every 100 symbols. calculate the

transmission rate of the system.

11. There are source alphabet with 6 symbols x1,x2,x3,x4,x5,x6 and probabilities

0.4,0.2,0.2,0.1 ,0.07 and 0.03 respectively. obtain the Huffman code.


ASSIGNMENT 1

1. Describe about Parabolic Antenna

2. Explain in detail about different types of noises.



CS231

DATA STRUCTURES LAB



CS231 Data Structures Lab


PROGRAMME: INFORMATION TECHNOLOGY DEGREE: BTECH

COURSE: DATA STRUCTURES LAB SEMESTER: III CREDITS: 1

COURSE CODE: CS231

REGULATION: 2016

COURSE TYPE: CORE

COURSE AREA/DOMAIN: PROGRAMMING, DATA

STRUCTURES AND ALGORITHMS

CONTACT HOURS: 3 Lab hours/Week.

CORRESPONDING LAB COURSE CODE (IF ANY): NIL LAB COURSE NAME:NA

SYLLABUS:

List of Exercises/Experiments : (Minimum 12 are to be done) 1. Implementation of Stack and Multiple stacks using one dimensional array. ** 2. Application problems using stacks: Infix to post fix conversion, postfix and pre-fix evaluation, MAZE problem etc. ** 3. Implementation of Queue, DEQUEUE and Circular queue using arrays. 4. Implementation of various linked list operations. ** 5. Implementation of stack, queue and their applications using linked list. 6. Implementation of trees using linked list 7. Representation of polynomials using linked list, addition and multiplication of polynomials. ** 8. Implementation of binary trees using linked lists and arrays- creations, insertion, deletion and traversal. ** 9. Implementation of binary search trees – creation, insertion, deletion, search 10. Application using trees 11. Implementation of sorting algorithms – bubble, insertion, selection, quick (recursive and non-recursive), merge sort (recursive and non-recursive), and heap sort.** 12. Implementation of searching algorithms – linear search, binary search.** 13. Representation of graphs and computing various parameters (in degree, out degree etc.) - adjacency list, adjacency matrix. 14. Implementation of BFS, DFS for each representation. 15. Implementation of hash table using various mapping functions, various collision and overflow resolving schemes.**



16. Implementation of various string operations.

17. Simulation of first-fit, best-fit and worst-fit allocations. 18. Simulation of a basic memory allocator and garbage collector using doubly linked list. ** mandatory.

LAB CYCLE

List of Exercises/Experiments : (Use C Programming language/ Minimum 12 are to be done)

1. Implement stack using one dimensional array.

2. Implement infix to postfix conversion and perform postfix evaluation.

3. Implement linked list operations.

4. Implement stack using linked list.

5. Implement queue using one dimensional array.

6. Implement queue using linked list.

7. Implement circular queue using array.

8. Implement double ended queue.

9. Implement polynomial using linked list and perform operations addition and

multiplication.

10. Implement circular linked list.

11. Implementation of linear search.

12. Implementation of binary search.

13. Implementation of bubble sort.

14. Implementation of selection sort.

15. Implementation of quick sort.

16. Implementation of merge sort.

17. Implement binary tree using linked list.

18. Implementation of string operations.



1 Horowitz ,Sahni & Anderson Freed, Fundamentals of Data Structures in C, 2nd ed., Universities Press, Hyderabad, 2009

2 Seymour Lipschutz, Data Structures , Schaum’s Outlines, Tata McGraw Hill , New Delhi, 2006

3 Samanta D., Classic Data Structures, Prentice Hall India, 2/e, 2009.



4 Richard F. Gilberg, Behrouz A. Forouzan, Data Structures: A Pseudocode Approach with C,

2/e, Cengage Learning, 2005.



B101-

05

Introduction to Computing and Problem Solving

Fundamentals of C programming

language

Fundamentals of Python programming

Bridge Course

S1

COURSE OBJECTIVES:

1 To implement basic linear and non-linear data structures and their major operations.

2 To implement applications using these data structures.

3 To implement algorithms for various searching and sorting techniques

COURSE OUTCOMES:

Students will be able to

SNO DESCRIPTION

CS 231.1 Appreciate the importance of structure and abstract data type, and their basic usability in different applications

CS 231.2 Analyze and differentiate different algorithms based on their time complexity.

CS 231.3 Implement linear and non-linear data structures using linked lists.

CS 231.4 Understand and apply various data structure such as stacks, queues, trees,

graphs, etc. to solve various computing problems.

CS 231.5 Implement various kinds of searching and sorting techniques, and decide when

to choose which technique.

CS 231.6 Identify and use a suitable data structure and algorithm to solve a real world problem


PO

1

PO

2

PO

3

PO

4

PO

5

PO

6

PO

7

PO

8

PO

9

P0

10

PO

11

PO

12

PSO

1

PSO

2

PSO

3

CS231.1 2 - - - - - - - - - - - 1 - -

CS231.2 - - 3 2 - - - - - - - - 3 - -

CS231.3 2 - 3 - - - - - - - - - 3 - -

CS231.4 1 - 2 3 - - - - - - - - 2 - 1

CS231.5 1 2 2 1 - - - - - - - - 1 - 2

CS231.6 - - 3 2 - - - - - - - - 2 - 2



CS231

CS

231(overa

ll level)

- - 3 1 - - - - - - - - 2 - 2


Mapping LOW/MEDIUM/HIGH Justification

CS231.1-PO1 M The knowledge of structure and abstract data type can be applied

to solve complex problems.

CS231.1-PSO1 L These fundamental concepts of datastructures can be applied to

solve complex problems

CS231.2-PO3 H Efficient algorithms can be designed based on their time

complexity.

CS231.2-PO4 M Analysis of algorithms helps to select suitable algorithms and reach

valid conclusions.

CS231.2-PSO1 H Complexity analysis can be applied in research and other

innovative areas.

CS231.3-PO1 M The knowledge can be enhanced by implementing the data

structure using any programming language

CS231.3-PSO1 H The implementation of data structures helps to design solutions to


CS231.4-PO1 M The knowledge about the various data structures can be applied to

solve complex engineering problems.

CS231.4-PO3 H The knowledge about various data structures can be applied to

design efficient solutions to complex engineering problems

CS231.4-PSO1 H The knowledge about various data structures can be applied to

design efficient solutions to complex engineering problems

CS231.5-PO1 L The knowledge of searching and sorting algorithms can be applied

to solve complex engineering problems.

CS231.5-PO2 M The knowledge of searching and sorting algorithms can be appled

to analyze problems and reach conclusions.

CS231.5-PO3 M The knowledge of searching and sorting algorithms can be applied

to design solutions to complex problems.

CS231.5-PO4 L The knowledge of searching and sorting algorithms can be applied

in analysis and interpretation of data

CS231.5-PSO1 L The knowledge of searching and sorting algorithms can be applied

in analysis of problems and design solutions.

CS231.5-PSO3 M This fundamental knowledge can be used in research and other

areas.

CS231.6-PO3 H This helps to design an efficient solution to complex problems.

CS231.6-PO4 M This knowledge helps in suitable representations and thereby

interpretation of data can be done efficiently

CS231.6-PSO1 M The knowledge of data structures help to analyze and design

solutions to complex problems.

CS231.6-PSO3 M This is a core fundamental concept in programming which can be

applied in research area also.



GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS: NIL

SNO DESCRIPTION

1 Introduction to C programming Language

2 Circular doubly linked list

3 Application of various data structures



1 AVL TREES

2


1 http://www.cse.iitk.ac.in/users/dsrkg/cs210/applets/sortingII/mergeSort/mergeSort.html

3 www.cse.unt.edu/~rada/CSCE3110/Lectures/Trees.ppt

4 cslibrary.stanford.edu/110/BinaryTrees.pdf

5 cslibrary.stanford.edu/103/LinkedListBasics.pdf

6 www.nptel.iitm.ac.in/video.php?subjectId=106105085

7 www.iitg.ernet.in/cse/?page_id=220



LCD/SMART BOARDS STUD. SEMINARS ADD-ON COURSES



STUD. LAB PRACTICES STUD. VIVA MINI/MAJOR PROJECTS CERTIFICATIONS

ADD-ON COURSES OTHERS



ONCE)


ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS OTHERS


Ms. Jisha G (H.O.D)

http://www.cse.iitk.ac.in/users/dsrkg/cs210/applets/sortingII/mergeSort/mergeSort.html



CS231 Data Structures Lab

LAB SCHEDULE

Sl.No Date Planned

1 1-Aug-16 Revision - Simple C programs

2 8-Aug-16 Revision - Simple C Programs - Arrays

3 22-Aug-16 Revision

4 29-Aug-16 Program 1

5 19-Sep-16 Program 5

6 26-Sep-16 Program 2

7 3-Oct-16 Program 3 & 4

8 17-Oct-16 Program 6 , 7 or 8 or 10

9 24-Oct-16 Program 9

10 31-Oct-16 Program 11 & 12

11 7-Nov-16 Program13, 14, 15, 16 ( Any two programs)

12 14-Nov-16 Program 17 or 18

13 21-Nov-16 Lab Exam



DataStructures Lab

LAB CYCLE

Course No. Course Name L-T-P - Credits Year of Introduction

CS231 DATA

STRUCTURES LAB

0-0-3-1 2016

Pre-requisite: CS205 Data structures

Course Objectives 1. To implement basic linear and non-linear data structures and their major operations.

2. To implement applications using these data structures.

3. To implement algorithms for various sorting techniques.

List of Exercises/Experiments : (Use C Programming language/ Minimum 12 are to be done)

19. Implement stack using one dimensional array.

20. Implement infix to postfix conversion and perform postfix evaluation.

21. Implement linked list operations.

22. Implement stack using linked list.

23. Implement queue using one dimensional array.

24. Implement queue using linked list.

25. Implement circular queue using array.

26. Implement double ended queue.

27. Implement polynomial using linked list and perform operations addition and multiplication.

28. Implement circular linked list.

29. Implementation of linear search.

30. Implementation of binary search.

31. Implementation of bubble sort.

32. Implementation of selection sort.

33. Implementation of quick sort.

34. Implementation of merge sort.

35. Implement binary tree using linked list.

36. Implementation of string operations.



IT231

DIGITAL CIRCUITS LAB



IT231 Digital Circuits Lab


PROGRAMME: Information Technology DEGREE: B.TECH

COURSE: Electronic : Digital Circuits Lab SEMESTER: 3 CREDITS: 1

COURSE CODE: : IT231

REGULATION: 2015

COURSE TYPE: CORE

COURSE AREA/DOMAIN: CONTACT HOURS: 3 hrs.

CORRESPONDING LAB COURSE CODE

(IF ANY):

LAB COURSE NAME: Nil

SYLLABUS:

List of Exercises / Experiments (Minimum of 8 mandatory out of 10)

1. Realization of functions using basic and universal gates.

2. Adders and Subtractors(Any four)

i) Half adder using NAND and NOR only.

ii) Full adder using NAND and NOR only.

iii) Full adder using two half adders

iv) Halfsubtractor using NAND and NOR only.

v) Full subtractor using NAND and NOR only.

3. 2/3 bit binary comparator.

4. BCD to Decimal and BCD to 7 segment decoder & display

5. Multiplexers, De-multiplexers using gates and ICs. (74150, 74154)

6. Realization of combinational circuits using MUX & DEMUX.

7. Realization of flip flops using gates. (Any four)

i) RS flip-flops

ii) T flip-flops

iii) D flip-flops

iv) JK flip-flops



v) Master Slave flip-flops

8. Random sequence generator.

9. Realisation of Shift Registers.

10. Counters (using flip flops)

i) Synchronous counters

ii) Asynchronous counters

iii) Ring counter

iv) Johnson counter

Class Project (Minimum one mandatory per group) i) Implementation of digital clock

ii) Implementation of digital timer

iii) Implementation of event counter

iv) Implementation of token display



1 Mano M. M., Digital Logic & Computer Design, 4/e, Pearson Education, 2013.

2 Floyd T. L., Digital Fundamentals, 10/e, Pearson Education, 2009.

3 M. Morris Mano, Computer System Architecture, 3/e, Pearson Education, 2007. Harris D. M.

and, S. L. Harris, Digital Design and Computer Architecture, 2/e, Morgan Kaufmann

Publishers, 2013

4 Tokheim R. L., Digital Electronics Principles and Applications, 7/e, Tata McGraw Hill, 2007.

5 Mano M. M. and M. D Ciletti, Digital Design, 4/e, Pearson Education, 2008.

6 Rajaraman V. and T. Radhakrishnan, An Introduction to Digital Computer Design, 5/e,

Prentice Hall India Private Limited, 2012.

7 Leach D, Malvino A P, Saha G, Digital Principles and Applications, 8/e, McGraw Hill

Education, 2015.



IT201 Digital System Design To understand principles of Logic

Systems and Circuits, thereby

enabling the student to obtain the

platform for studying Computer

Architecture and Design

3rd

COURSE OBJECTIVES:

1 To familiarise various types of gates

2 To realize adders, subtractors, flip flops

3 To Realise shift registers and counters.

4 To assemble digital circuits using ICs and study the performance.

COURSE OUTCOMES:



SlNo DESCRIPTION

1 On completion of the course the students will familiarize with different logic gates and

IC’s

2 On completion of the course the students can design digital circuits such as adders,

subtractors and comparators

3 Students will be capable of designing counters and shift registers

4 Students will be capable of designing higher level digital systems.

CO-PO-PSO MAPPING

CO No. Programme Outcomes (POs)

Programme-specific

Outcomes (PSOs)

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3

1 3 3 2 1 2

2 3 3 3 2 1 2

3 3 3 3 3 2 1 2

4 3 3 3 3 2 2

IT231 3 3 3 3 2 1 2

JUSTIFICATION FOR THE CORRELATION LEVEL ASSIGNED IN EACH CELL OF THE TABLE

PO1 PO2 PO3

PO

6

PO

9

PO

12

PSO

1

PSO

2

PSO

3

CO1

Study of

Logic

gates

Boolean

Algebra

and its

minimizat

ion

- -

Individual

and group

assignment

s

Study of

different

logic gate

IC’s

Boolean

Algebra

and its

minimiza

tion is

used to

design

and

impleme

nt digital

circuits

- -

CO2

Truth

table and

Sop

simplific

ation

Analysis

of

combinati

onal logic

circuits

Design

of

combi

nationa

l logic

circuits

-

Individual

and group

assignment

s and

design

problems

Study of

different

digital

circuits

and

applicatio

ns

Design

and

impleme

ntation of

combinat

ional

logic

circuits

- -

CO3

Truth

table and

excitatio

n table

for flip

flops

Analysis

of Shift

registers

and its

applicatio

n

Design

of

counte

rs

Counter

circuits are

needed for

most of the

social

related

digital

system

Individual

and group

assignment

s and

design

problems

Study of

different

sequential

circuits

and its

applicatio

ns

Design

and

impleme

ntation of

counter

logic

circuits

- -

CO4

Logic

gates,

Flip

Flops

Analysis

of digital

circuits

used in

day to day

life

Design

circuits

like

digital

display

, event

counte

Design

circuits like

digital

display,

event

counters ,

token

Individual

and group

assignment

s and

decoder

circuits

-

Design

of digital

circuits

used in

various

applicati

ons.

- -



rs ,

token

display

, etc

display, etc

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION EQUIREMENTS:

SlNo DESCRIPTION PROPOSEDACTIONS PO

MAPPING

1 Self starting Counters, Code Converters Assignment 1,2,3

PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST

LECTURER/NPTEL ETC


SlNo DESCRIPTION PO

MAPPING

1 Advanced design level questions solving skills by lab work to have a

wider scope of subject beyond syllabus.

1,2,3,4,6


1 http://nptel.iitm.ac.in/courses/Webcourse-contents/IIT-

%20Guwahati/digital_circuit/frame/

2 http://www.electronics-tutorials.ws/logic/logic_1.html


☐ CHALK & TALK ☐ STUD. ASSIGNMENT ☐ WEB RESOURCES

☐LCD/SMART

BOARDS

☐STUD. SEMINARS ☐ ADD-ON COURSES


☐ ASSIGNMENTS ☐STUD.

SEMINARS

☐ TESTS/MODEL

EXAMS

☐ UNIV.

EXAMINATION

☐ STUD. LAB

PRACTICES

☐ STUD. VIVA ☐ MINI/MAJOR

PROJECTS

☐

CERTIFICATIONS

☐ADD-ON

COURSES

☐ OTHERS


☐ ASSESSMENT OF COURSE OUTCOMES

(BY FEEDBACK, ONCE)

☐ STUDENT FEEDBACK ON

FACULTY

☐ASSESSMENT OF MINI/MAJOR

PROJECTS BY EXT. EXPERTS

☐ OTHERS


NeethuRadhaGopan (HOD)




LAB SCHEDULE

Sl.No Date Planned Action

1 9-Aug-16 Realization of functions using basic and

universal gates. Completed

2 16-Aug-16 Half adder using NAND and NOR only. Completed

3 23-Aug-16 Full adder using NAND and NOR only. Completed

4 30-Aug-16 Full adder using two half adders Completed

5 6-Sep-16 Half subtractor using NAND and NOR

only Completed

6 13-Sep-16 2/3 bit binary comparator. Completed

7 20-Sep-16 Multiplexers, De-multiplexers using gates

and ICs. (74150, 74154) Completed

8 27-Sep-16 Realization of flip flops using gates- SR,

JK, D and T Flip Flop Completed

9 4-Oct-16 Synchronous counters Completed

10 18-Oct-16 Asynchronous counters Completed

11 25-Oct-16 Ring counter & Johnson counter Completed

12 1-Nov-16 Random sequence generator. Completed

13 8-Nov-16 Realisation of Shift Registers. Completed

14 15-Nov-16 Practical Exam Completed




LAB CYCLE

Sl.No Experiment

1 Realization of functions using basic and universal gates.

2 Half adder using NAND and NOR only.

3 Full adder using NAND and NOR only.

4 Full adder using two half adders

5 Half subtractor using NAND and NOR only

6 2/3 bit binary comparator.

7 Multiplexers, De-multiplexers using gates and ICs. (74150, 74154)

8 Realization of flip flops using gates- SR, JK, D and T Flip Flop

9 Synchronous counters

10 Asynchronous counters

11 Ring counter & Johnson counter

12 Random sequence generator.

13 Realisation of Shift Registers.

Class Project

1. Implementation of digital clock

2. Implementation of digital timer

3. Implementation of event counter

4. Implementation of token display

semester 3 - rajagiri school of engineering & technology academic... · 3 cs201 discrete...

Documents