Mahamaya Technical University,: Noida

MAHAMAYA TECHNICAL UNIVERSITY,
NOIDA

Syllabus

For

B. TECH. SECOND YEAR

Of

COMPUTER SCIENCE & ENGINEERING(CSE)
&
INFORMATION TECHNOLOGY (IT)

(Effective from the Academic Session: 2013-14)

SCHEME OFEVALUATIONOFB.TECH SECONDYEAR
(COMMONTOCSE ANDIT)
SEMESTER III

!"#
$"
!%&'()*
+,-(
!%&'()*.
/(01,-.

2 3 /
4567%6*1,8 !)9(:(

!(..1,867 48- !(:(.*(0
3,*67 +0(-1*
+3 3; 3$3 / 39 /
< ;!=>?@A
BC=>?<
3()981)67 D01*18EA
B%:68 F(9651,%0
GH8)7%-18E B%:68
!,)1,7,EI 68-
/.I)9,7,EIJ
> ? ? <? <? K? = L? = <?? >
K ;!=>?<; M6*9(:6*1).=HHH > < ?

>? K? N? =

<?? = <N? O
> 44=>?N !(8.,0 P
H8.*0%:(8*6*1,8
> < K K? <? >? <N <?? >? <QN N
O +!=>?< R6*6 !*0%)*%0(. > < K K? <? >? <N <?? >? <QN N
N 4+=>?K R1E1*67 R(.1E8 > < K K? <? >? <N <?? >? <QN N
@ +!=>?K R1.)0(*( !*0%)*%0(. > < K K? <? >? <N <?? >? <QN N
Q ;C=>?<

B%:68 S67%(. 68-
/0,T(..1,867 4*91).
K < ?

<? <? K? = L? = <?? +,:U
;%-1*
),%0.(
L V/=>?< V(8(067 /0,W1)1(8)I N? - = N? =

<LAK? NA @ L
<??? KQ

L: Lecture T: Tutorial P: Practical/ Project CT: ClassTest TA: TeachersAssessment
Th: Theory TOT: Total

TA =10 (5 for teachersassessment plus5 for attendance)
TA=20 (10 for teachersassessment plus10 for attendance)
P= 15(4marksfor practical exam. 4marksviva. 4marksfor lab. recordsand 3 marksfor quiz).

Note: AU-301/ AU-401 may beoffered in both theSemesters.A student hasto clear
this subject in second year or in any semester after second year.

SEMESTER IV

L: Lecture T: Tutorial P: Practical/ Project CT: ClassTest TA: TeachersAssessment
Th: Theory TOT: Total

TA =10 (5 for teachersassessment plus5 for attendance)
TA=20 (10 for teachersassessment plus10 for attendance)
P= 15(4marksfor practical exam. 4marksviva. 4marksfor lab. recordsand 3 marksfor quiz)

!"#
$
!%&'()*
+,-(
!%&'()*.
/(01,-.

2 3 /
4567%6*1,8 !)9(:(

!(..1,867 48- !(:(.*(0
3,*67 +0(-1*
+3 3; 3$3 / 39 /
< BC=O?<A
;!=O?@
B%:68 F(9651,%0
GH8)7%-18E B%:68
!,)1,7,EI 68-
/.I)9,7,EIJA
3()981)67 D01*18E
> ? ?

<? <? K? = L? = <?? >
K ;!=O?K

F6.1). ,T !I.*(:
M,-(7718E 68-
!1:%76*1,8
> < ?

>? K? N? = <?? = <N? O
> +!=O?< +,:U%*(0
$0E681X6*1,8
> < K K? <? >? <N <?? >? <QN N
O +!=O?K R6*6 F6.(
M686E(:(8* !I.*(:.
> < K K? <? >? <N <?? >? <QN N
N +!=O?> $&'()* $01(8*(-
/0,E06::18E Y1*9
+ZZ
> < K K? <? >? <N <?? >? <QN N
@ +!=O?O 39(,0I ,T
+,:U%*6*1,8
> < K K? <? >? <N <?? >? <QN N
Q ;C=O?< B%:68 S67%(. 68-
/0,T(..1,867 4*91).
K < ?

<? <? K? = L? = <?? +,:U
;%-1*
),%0.(
L V/=O?< V(8(067 /0,W1)1(8)I N? - = N?

K? A<L @AN L
<??? KQ
SEMESTER III
(COMMONTOCSE AND IT)
AS-306/ AS-406: TECHNICAL WRITING
L : T : P :: 3 : 0 : 0 Credit : 3
Objectiveof TheCourse
3, 1:U60* &6.1) .[177. 18 3()981)67 +,::%81)6*1,8 18 5601,%. T,0:6*. ,T *()981)67
Y01*18E *, M+; 68- .(),8- I(60 CV .*%-(8*. 18 *9( 48E71.9 768E%6E(" B6518E 6)91(5(- *9( &6.1)
.[177. 18 U0,T(..1,867 ),::%81)6*1,8 18 48E71.9 *90,%E9 76&,06*,0I U06)*1)( *(6)918E\ *9(
.*%-(8*. 60( 0(]%10(- *, 7(608 5601,%. T,0:. ,T *()981)67 Y01*18E." +,::%81)6*1,8 1. 8,*
0(.*01)*(- *, T,0:. ,T 5(0&67 18*(06)*1,8 6:,8E *9( U0,T(..1,867." 45(0I U0,T(..1,867 1. 0(]%10(-
*, &( U0,W1)1(8* 18 3()981)67 +,::%81)6*1,8 6. Y(77" !%)9 U0,W1)1(8)I 1. -(.10(- *, &( 6)91(5(-
*90,%E9 )76.. 0,,: 7(60818E ,T -1TT(0(8* T,0:6*. ,T *()981)67 Y01*18E Y91)9 60( %.%677I %.(- 18
68I *()981)67 U0,T(..1,8"
Desired Outcomeof TheCourse
39( .*%-(8*. :%.* &( 6&7( *, ^
G6J C8-(0.*68- +,::%81)6*1,8 6. 6 U0,)(.. 68- )9688(7. ,T 1* 18 E(8(067 68-
3()981)67 +,::%81)6*1,8 18 U60*1)%760"
G&J 2(608 3()981)67 Y01*18E 18)7%-18E .(8*(8)( .*0%)*%0( 68- &( 6&7( *, %8-(0.*68-
68- %.( *()98,7,EI .U()1W1) Y,0-."
G)J D01*( .)1(8*1W1) 60*1)7(.\ .I8,U.1.\ 0(U,0*. G0,%*18( 68- 688%67J 18)7%-18E /0,'()*
68- !6:U7( _(U,0*."
G-J D01*( 3()981)67 #,*(.\ /0,U,.67. 68- ;0*1)7(."
G(J 2(608 *, 0(),0-. :18%*(. ,T :((*18E.\ !(:1860.\ Y,0[.9,U.\ :6[( *()981)67
U0(.(8*6*1,8. 68- 7(608 0(.%:(A+S Y01*18E"
Key Concepts
+,::%81)6*1,8 6. 6 U0,)(.. ,T 18*(06)*1,8 &(*Y((8 ,01E186*,0 68- 0()(15(0"
+,8*(`* ,T 3()981)67 +,::%81)6*1,8 6. :(68. ,T 18-%7E(8)( 18 5601,%. T,0:. 68- T,0:6*. ,T
*()981)67 Y01*18E. 6. 0(]%10(- 18 ,0E681X6*1,8.=*()98,7,E1)67 6. Y(77 6. ),::(0)167"
Writing Skills : !(7()*1,8 ,T Y,0-. 68- U906.(. 18 *()981)67 Y01*18E 7(6-18E *, .(8*(8)(
.*0%)*%0( 6. Y(77 6. 7(8E*9 68- .*0%)*%0( ,T U606E06U9" D01*18E .)1(8*1W1) ;0*1)7(.\ _(U,0*.\
0(),0-18E :18%*(. 68- #,*(.\ 6%*9,018E 68- 0(51(Y ,T _(.(60)9 ;0*1)7(."
SpeakingSkills: /60*1)1U6*1,8 18 M((*18E.\ !(:1860.\ D,0[.9,U. 68- 3()981)67 /0(.(8*6*1,8"
TeachingMethodology
<" 4]%1UU18E *9( .*%-(8* T,0 ),:U(*(8* *()98,=.U()1W1) 3()981)67 +,::%81)6*1,8 18
48E71.9 268E%6E( 68- (86&718E *9( .*%-(8* *, &( U0,W1)1(8* 18 *()981)67 Y01*18E"
K" 39( *(6)9(0 1. 0(]%10(- *, *(6)9 *9( ),%0.( *90,%E9 7()*%0(.\ *%*,0167. 68- .6:U7(. ,T
Y01**(8 *()981)67 T,0:6*."
>" 39( *(6)9(0 :%.* U0,'()* 91:.(7T 6. 6 U0,W1)1(8* (Ù(0* 18 *()981)67 Y01*18E ,T 48E71.9
768E%6E("
O" 39( ),%0.( 96. *, &( *6%E9* 18 .:677 &6*)9(. ., 6. *, E15( 18-151-%67 6**(8*1,8 *,
.*%-(8*. a &,*9\ 18 *9( U0,)(.. ,T 7(60818E *, Y01*( 6. Y(77 6. U60*1)1U6*1,8 18 ),8T(0(8)(.\
.(:1860.\ Y,0[.9,U. 68- U0,'()* U0(.(8*6*1,8."
N" 39( F,,[. .%EE(.*(- 965( U,0*1,8. ,T 3()981)67 +,::%81)6*1,8 18 (6)9 68- 6. .%)9 *9(
.6:( &( *0(6*(- 6. &6.( *(`*." 4Ù68.1,8 ,T *9( U60*. &( %8-(0*6[(8 Y1*9 *9( 9(7U ,T 0(7(568*
:6**(0 *90,%E9 18*(08(*" H8T6)*\ *9( .*%-(8*. &( (8),%06E(- *, (8968)( *9(10 *()981)67 Y01*18E
.[177. &I .(7T 7(60818E"

Unit - I
Communicationa#6*%0( 68- U0,)(.."
Channels of CommunicationaR,Y8 Y60-\ %UY60- 68- 9,01X,8*67 +,::%81)6*1,8"
#(*Y,0[. 68- F6001(0. *, +,::%81)6*1,8"
3()981)67 +,::%81)6*1,8aR(W181*1,8\ $067 68- Y01**(8 3()981)67 +,::%81)6*1,8"
H:U,0*68)( 68- #((- T,0 3()981)67 +,::%81)6*1,8
#6*%0( ,T 3()981)67 +,::%81)6*1,8=;.U()*. 68- b,0:. ,T 3()981)67 +,::%81)6*1,8
3()981)67 +,::%81)6*1,8 ![177.=21.*(818E\ !U(6[18E\ _(6-18E 68- D01*18E GH:U0,518E *9(.(
Y1*9 ),:U0(9(8.1,8.J"

Unit -II
3()981]%(. ,T D01*18E\ !(7()*1,8 ,T Y,0-. 68- U906.(. 18 *()981)67 Y01*18E"
R1TT(0(8)( &(*Y((8 3()981)67 D01*18E 68- V(8(067 D01*18E"
;&.*06)* 68- .U()1W1) Y,0-.
!(8*(8)( .*0%)*%0(\ _(]%1.1*(. ,T .(8*(8)( ),8.*0%)*1,8"
/606E06U9 2(8E*9 68- .*0%)*%0(
c60E,8. 68- +71)9de f

Unit -III
!)1(8*1W1) ;0*1)7( D01*18E"
!I8,U.1. D01*18E\ /0,'()* Y01*18E 68- R1..(0*6*1,8 A39(.1. D01*18E"
Report Writing= :(6818E\ .1E81W1)68)(\ .*0%)*%0( 68- .*I7("
R1TT(0(8* *IU( ,T _(U,0*.=0,%*18( 0(U,0*. 68- 688%67 0(U,0*."
/0,'()* _(U,0*.
!6:U7( _(U,0*.
Technical Articles=86*%0(\ .1E81W1)68)( 68- *IU(."
c,%0867 ;0*1)7(. 68- +,8T(0(8)( /6U(0."

Unit -IV
3()981)67 #,*( M6[18E
M()9681). 68- #,*( D01*18E 3()981]%(."
3()981)67 /0,U,.67.= :(6818E\ .*0%)*%0(\ *IU(. 68- .1E81W1)68)("
3IU(. ,T /0,U,.67.
_(51(Y 68- _(.(60)9 ;0*1)7(."
47(:(8*. ,T 3()981)67 ;0*1)7(."

Unit -V
Meetings-/0(U606*1,8 ,T ;E(8-6\ U60*1)1U6*1,8\ )961018E 68- Y01*18E :18%*(. ,T :((*18E."
+,8T(0(8)(.\ !(:1860.\ 3()981)67 /0(.(8*6*1,8. 68- D,0[.9,U."
S1-(, +,8T(0(8)18E\ *()981)67 -(.)01U*1,8 ,T (8E18((018E ,&'()*.AU0,-%)(. 68- U0,)(..(."
!7,E68 D01*18E\ !U(()9 6-5(0*1.18E"
+S D01*18E\ -1TT(0(8)( &(*Y((8 F1,-6*6\ +S 68- _(.%:(" 3IU(. ,T 0(.%:( 68- *1U. T,0 0(.%:(
Y01*18E"

Text Books &References
<" M ;.906T _1X51\ g4TT()*15( 3()981)67 ),::%81)6*1,8h\ 36*6 M) V06Y B177 4-%)6*1,8 /5*"
2*-"\ K?<K"
K" i651*6 3I6E1\ /6-:6 M1.06\ gF6.1) 3()981)67 +,::%81)6*1,8h\ /BH 2(60818E /5*" 2*-\
K?<K"
>" !68E((*6 !960:6\ F18,- M1.906\ g+,::%81)6*1,8 ![177. T,0 48E18((0. 68- !)1(8*1.*h\ /BH
2(60818E /5* 2*-\ K?<K"
O" b(71)1*I $j R(77 P M1)96(7 M) +60*9I\ g48E7.19 +,77,)6*1,8. 18 ;-568)(- C.("h +6:&01-E(
C815(0.1*I /0(.. K?<?"
N" _6I:,8- M%0U9I" g4..(8*167 48E71.9 V06::60"h +6:&01-E( C815(0.1*I /0(.."
@" !960,8 c" V(0.,8 P !*(5(8 M" V(0.,8" g 3()981)67 D01*18E\ 41E9*9 H:U0(..1,8\ K?<>\
/(60.,8 4-%)6*1,8\ H8)"

Performance&Evaluation System
39( .*%-(8*. .9677 Y01*( *Y, 18*(0867 .(..1,867 *(.*. 6. T,0 ,*9(0 .%&'()*. &(.1-(. *9(
(8-=.(:(.*(0 Y01**(8 (`6:." 39( 18*(0867 .(..1,867. Y177 965( 6 Y(1E9*6E( ,T K? :60[. 68- *9(
(8-=.(:(.*(0 *9(,0I (`6:186*1,8 .9677 )600I L? :60[. :6[18E *9( .%&'()* ,T 3()981)67 D01*18E
Y,0*9 <?? :60[."
;..1E8:(8*. 60( *, &( E15(8 *, 0(18T,0)( *9( ),8)(U*. 68- (8.%0( *,*67 %8-(0.*68-18E ,T
*()981)67 Y01*18E"

Suggested web-links:
9**UÂAYYY"(E,O%"),:A
9**UÂAYYY"(8E71.9O*,-6I"),:A
9**UÂAYYY"7(6086:(01)68(8E71.9,8718("),:A
9**UÂA7(608(8E71.9"&01*1.9),%8)17",0EA(8A
9**UÂAYYY"(8E71.)9=917T(8"-(A(8A
9**UÂAYYY"(8E71.9)7%&"),:A
9**UÂAYYY"(8E71.97(60818E"),:A
9**UÂA7(60818E(8E71.9"5,68(Y."),:A
9**UÂAYYY"%.18E(8E71.9"),:A-1)*1,860I"9*:7
9**UÂAYYY":18-*,,7."),:AU6E(.A60*1)7(A8(Y+!kll"9**U

HUMANBEHAVIOUR
(IncludingHuman SociologyandPsychology)
HU-301/ HU-401
Objective of the Course: 39( ),%0.( 18*(8-. *, 1:U60* [8,Y7(-E( 68- 7(60818E ,T
-1TT(0(8* 6.U()*. ,T 9%:68 &(9651,%0 (.U()1677I 18 *9( ,0E681.6*1,867 ),8*(`* *96*
-10()*. 9%:68 &(9651,%0" 391. 96. .U()167 .1E81W1)68)( *, *9( U0,T(..1,867. 6. *9(.(
6.U()*. ,T 9%:68 &(9651,%0 8((-. *, &( 6)),%8*(- T,0 Y917( *6[18E 6 -()1.1,8 Y1*9
0(.U()* *, (8968)(:(8* ,T 9%:68 U0,-%)*151*I"
UNIT-I
+,8)(U*\ #6*%0(\ +9606)*(01.*1).\ +,8)(U*%67 b,%8-6*1,8. 68- H:U,0*68)(\ _,7(. P
![177. ,T B%:68 +6U1*67" B%:68j. i8,Y18E F(9651,%0= ;UU0,6)9(. *, %8-(0.*68-
+,E81*15(\ F(9651,%01.*1) P !,)167 +,E81*15( &(9651,%0\ /0,=.,)167 a F(9651,%0 a #6*%0( 68-
R(*(0:1868*. G!*68-60- F(9651,%0\ ;7*0%1.:\ 4:U6*9IJ"
UNIT-II
/(0)(U*1,8 68- ;**01&%*1,8^ +,8)(U*\ #6*%0(\ /0,)(..\ H:U,0*68)(" M686E(:(8* 68-
F(9651,%067 ;UU71)6*1,8. ,T /(0)(U*1,8" ;**1*%-(^ +,8)(U*\ /0,)(.. 68- H:U,0*68)(\
;**1*%-( M(6.%0(:(8*" ;**1*%-(. 68- D,0[T,0)( R15(0.1*I" /(0.,8671*I^ +,8)(U*\ #6*%0(\
3IU(. 68- 39(,01(. ,T /(0.,8671*I !96U18E\ /(0.,8671*I ;**1*%-( 68- c,& !6*1.T6)*1,8"
2(60818E^ +,8)(U* 68- 39(,01(. ,T 2(60818E"
UNIT -III
M,*156*1,8^ M(6818E\ M6.7,Yj.\ B(0X&(0E\ M)+7(7768-j. 39(,01(. ,T M,*156*1,8\
2(6-(0.91U^ !*I7( 68- 39(,01(. ,T 2(6-(0.91U=3061*\ F(9651,%067 68- !1*%6*1,867
39(,01(.\ +,8W71)* M686E(:(8*^ +,8W71)*^ +,8)(U*\ !,%0)(.\ 3IU(.\ +76..1W1)6*1,8 ,T
+,8W71)* H8*06\ H8-151-%67\ H8*(0U(0.,867\ H8*(0E0,%U 68- $0E681.6*1,867\ _(.,7%*1,8 ,T
+,8W71)*"
UNIT -IV
V0,%U RI86:1).^ 3IU(. ,T V0,%U 68- *9(10 -(5(7,U:(8* .*6E(.\ ),8)(U*\ .*6*%.\ 8,0:.
.1X( 68- ),9(.15(8(.." /,Y(0 68- /,71*1).^ +,8)(U*\ !,%0)(. ,T /,Y(0\ R1.*18)*1,8
&(*Y((8 /,Y(0\ ;%*9,01*I 68- H8W7%(8)(\ ;UU0,6)9(. *, /,Y(0\ /,71*1)67 H:U71)6*1,8. ,T
/,Y(0^ RI.T%8)*1,867 C.(. ,T /,Y(0"
References:
<" #(Y.*0,: c,98 D" = $0E681X6*1,867 F(9651,%0^ B%:68 F(9651,%0 6* D,0[ G36*6 M)
V06Y B177\
K" 2%*968. b0(- = $0E681X6*1,867 F(9651,%0 G36*6 M) V06Y B177\ <?*9 (-1*1,8J
>" M) !968( 2" !*(5(8\ V718,Y M60I ;88 S,8 P !960:6 _6-96 _" = $0E681X6*1,867
F(9651,%0 G36*6 M) V06Y B177J
O" _,&&18. !*(U9(8 /" = $0E681X6*1,867 F(9651,%0 G/(60.,8 4-%)6*1,8J
N" B(0.(I /6%7\ F768)960-\ i(88(*9 B 68- c,98.,8 R(Y(I 4" = M686E(:(8* ,T
$0E681.6*1,867 F(9651,%0^
@" V0((8&(0E c(067- 68- F60,8 _,&(0* ;" = F(9651,%0 H8 $0E681.6*1,8.^ C8-(0.*68-18E
68- M686E18E *9( B%:68 !1-( ,T D,0[ G/0(8*1)( B677 ,T H8-16J
7. LaurieJ. Mullins : Essentialsof Organizational Behaviour, Pearson Learning
L" H68 F0,,[. ^ $0E681X6*1,867 F(9651,%0\ /(60.,8 2(60818E
9. Baron, R.A., Psychology, 5
th
Edition, Pearson

AS-301A:ENGINEERINGMATHEMATICS-III
Group A (AEI,EE,EN,EC,IC,CS,IT,etc.)

1. Title of the course: ENGINEERING MATHEMATICS-III (AS-301A)
2. Work load per week
a. Lecture (L): 3 hrs/week Total Lecture Hours per Semester: 42
b. Tutorials (T): 1 hrs/week Total Tutorial Hours Per Semester: 12+12
c. Total Credits: L+T+P 4
d. One credit is defined as one lecture load per week and two hours of self-
study to be connected with tutorial and assignments.
3. Prerequisites of the course: Engineering Mathematics I & II.
4. Why you need to study this course:
Engineering Mathematics is one of the important tools of engineering .It is essential for an
engineering student to know the mathematical terminology, concept and methods used in various
engineering disciplines.
Course Objective:
Basic idea of the course will be to introduce the concept of Complex analysis, Mathematical
Methods (Fourier analysis, Z-transform and Difference equation), Mathematical Statistics,
Linear Algebra and Numerical Analysis.
5. Learning outcomes expected from the course:
At the completion of this Course, student will have the basic skills required to:
a. Understand the concept of Complex analysis including complex integration and
conformal mapping which are useful to all branches of engineering.
b. The concept of Mathematical Methods helps the students to understand various
transforms which are useful all branches of engineering.
c. The concept of Mathematical statistics will enable the students to understand models
of probability distribution to be tested by statistical methods.
d. Linear algebra is of growing importance in engineering research and teaching
because it forms a foundation of numeric methods.
e. Numerical Methods enable students to evaluation of definite integrals, the solution of
equations and linear systems, the solution of differential equations etc.
Unit-I : Complex Analysis

;867I*1) T%8)*1,8.\ +6%)9I=_1(:688 (]%6*1,8. " +,8T,0:67 :6UU18E GT,0 718(60
*068.T,0:6*1,8J " +6%)9Ij. *9(,0(: \ +6%)9I 18*(E067 T,0:%76" /,Y(0 !(01(.\ 36I7,0
.(01(.\ 26%0(8* .(01(. " m(0,.\ !18E%7601*1(.\ /,7(." _(.1-%( *9(,0(: \ 4567%6*1,8 ,T 0(67
18*(E067. ,T *9( *IU(
2
0
(cos , sin ) f x x dx
68-

-
( ) . f x dx
+

Unit-II : Mathematical Methods

b,%01(0 3068.T,0:\ b,%01(0 .18( 68- ),.18( *068.T,0:.\ /0,U(0*1(. ,T *068.T,0:\
),85,7%*1,8 *9(,0(:\ ;UU71)6*1,8. *, &,%8-60I 567%( U0,&7(:." R1TT(0(8)( (]%6*1,8.
68- 1*. .,7%*1,8 " m=*068.T,0:\ .,:( .*68-60- m=*068.T,0:.\ U0,U(0*1(. ,T m=*068.T,0:"
;UU71)6*1,8 *, -1TT(0(8)( (]%6*1,8."

Unit-III:Mathematical Statistics

47(:(8*. ,T /0,&6&171*I *9(,0I\ F6I(.j. 39(,0(:" _68-,: 56016&7(.\ R1.*01&%*1,8
T%8)*1,8\ /0,&6&171*I M6.. 68- R(8.1*I T%8)*1,8.\ c,18* -1.*01&%*1,8. 68- M60E1867 68-
+,8-1*1,867 -1.*01&%*1,8." 4Ù()*6*1,8 " M,:(8*.\ M,:(8* V(8(06*18E T%8)*1,8 "
![(Y8(.. \ i%0*,.1." F18,:167\ /,1..,8 68- #,0:67 R1.*01&%*1,8."

Unit-IV: Linear Algebra

H8*0,-%)*1,8 *, V0,%U\ _18E 68- b1(7-n" S()*,0 !U6)(.\ .%&.U6)(.\ 218(60
R(U(8-(8)( P H8-(U(8-(8)(\ F6.(. 68- R1:(8.1,8 \ !*68-60- F6.(. ,T _
8
\
+,,0-186*(. Y1*9 0(.U()* *, 6 &6.(.\ ),:U7(:(8*60I .%&.U6)(." !*68-60- 188(0
U0,-%)*\ #,0:\ V06:=!)9:1-* $0*9,E,8671X6*1,8 /0,)(.."

Unit-V: Numerical Techniques

!,7%*1,8 ,T ;7E(&061) 68- 3068.)(8-(8*67 (]%6*1,8. &I #(Y*,8= _6U9.,8 :(*9,- 68-
1*. 06*( ,T ),85(0E(8)(" !,7%*1,8 ,T 718(60 .1:%7*68(,%. (]%6*1,8. &I V6%..= !(1-(7
:(*9,-"H8*(0U,76*1,8\ W181*( -1TT(0(8)(.\ -1TT(0(8)( *6&7(.\ #(Y*,8j. T,0Y60- P
&6)[Y60- -1TT(0(8)( T,0:%76( \ #(Y*,8j. -151-(- -1TT(0(8)( T,0:%76 " #%:(01)67
-1TT(0(8*16*1,8 68- 18*(E06*1,8 G#(Y*,8j. +,*(. o%6-06*%0( T,0:%76 Y1*9,%* U0,,TJ\
306U(X,1-67 0%7(\ !1:U.,8j. <A>
0-
P >AL
*9
0%7(." !,7%*1,8 ,T ,0-1860I 718(60 -1TT(0(8*167
(]%6*1,8. &I /1)60-j. 68- _%8E(=i%**6 O
*9
,0-(0 :(*9,-."
n Questionsshould not beset.

Text Books:

<"/(*(0 $j#(17 ^;-568)( 48E18((018E M6*9(:6*1).\ +(8E6E( 2(60818E

K" !"!" !6.*0I^ H8*0,-%)*,0I M6*9,-. ,T #%:(01)67 ;867I.1.\/0(8*1)(=B677 ,T
H8-16 /5*"2*-"

>" S" i01.986 M%0*9I\ S"/"M61806\ P c"2";0,06^ ;8 H8*0,-%)*1,8 *, 218(60
;7E(&06\ ;TW1716*(- 46.*=D(.* /0(.. /5*"2*-"

O" F"S"_6:686^ B1E9(0 48E18((018E M6*9(:6*1).\ 36*6 M)V06Y a B177
/%&71.918E +," 2*-"

N" !"_"i" HI(8E(0\ _"i" c618\ M6*9(:6*1)67 M(*9,-.\ !(),8- 4-1*1,8\ #60,.6
/%&71.918E B,%.("

ReferenceBooks:

<" 40Y18 i0(I.X1E^ ;-568)( 48E18((018E M6*9(:6*1).\D17(I H8-16"

K" M1)96(7 V0((8&(0E^ ;-568)( 48E18((018E M6*9(:6*1).\ /(60.,8"

>" F"!"V0(Y67^ #%:(01)67 M(*9,-. 18 48EE" P !)1(8)(\ i96886 /%&71.9(0"

O" V17&(0* !*068E^ 218(60 ;7E(&06 68- 1*. 6UU71)6*1,8 \ +(8E6E( 2(60818E"

EE-305: SENSOR AND INSTRUMENTATION
L T P
3 1 2
Objective & Out come of learning
This is intended to be a compulsory course for all branches of Engg. The objective of the course is to
familiarize with different types of main sensors and transducers used in Industry and to familiarize
how signal conditioning is to be carried out for further use. Then how to acquire this data for
computer and to telemeter it over a distance. Some basic fundamental of virtual instrumentation
system and display devices is stressed. This course enables the students to learn the sensors and
transducers & their application course in industry.
Pre-requisite: Basic courses of Electrical and Electronics Engg EE-101/EC-101
Unit-I
Sensors & Transducer, Definition, Classification & Characterization, Displacement Sensors:
Potentiometric, LVDT & Optical Encoder; Accelerometers: Mass & Piezoelectric; Strain Gauges: Wire
& Semiconductor; Pressure Sensor: LVDT based Diaphragm & Piezoelectric, Temperature Sensor:
Thermocouple, RTD, & Liquid in Glass;
Flow Sensor: Ultrasonic, Electromagnetic, Laser & Thermal; Level Sensor: Ultrasonic &
Capacitive; Proximity Sensor, Concept of Smart Sensors:
Unit-II
Signals Definition, Analog Signal Processing Circuits: Bridges, Op-amp Amplifiers, Differential
Amplifiers, Active Filters(Low Pass & High Pass), Frequency to Voltage Convertor, Voltage to
Frequency Convertor, Modulator (AM), & Demodulator (Envelop Detector).
Unit-III
Digital Processing of Analog Signal: Analog Multiplexer Circuit, S/H Circuit, ADC, DAC, Convolution,
Digital Filtering, Digital Telemetry System: PCM Display Devices: Analog (CRT), Digital (LCD, LED)
Recorders: Analog (Magnetic, Strip Chart), Digital Printers.
Unit-IV
Virtual Instrumentation
Instrumentation System, DAQ System, Software for Virtual Instrumentation.
Instrumentation System for Flow, Pressure, and Temperature Measurement
Measurement Errors: Gross errors and systematic errors, Absolute and relative errors, Accuracy,
Precision, Resolution and Significant figures.

Unit-V
Voltmeters and Multi-meters- Introduction, Multi range voltmeter, Extending voltmeter ranges,
Loading, A C voltmeter using Rectifiers Half wave and full wave, Peak responding and True RMS
voltmeters, Q-meter
DC and AC Bridge circuits for resistance, capacitance and inductance measurements.
Signal analysis: wave analyzer, harmonic distortion analyzer, spectrum analyzer.

Text Books
1. DVS Murthy Transducers and Instrumentation, PHI 2
nd
Edition 2013
2. D Patranabis Sensors and Transducers PHI 2
nd
Edition 2013.
3. Ranjan CS (et.al) Instrumentation and Device Systems PHI.
Reference Books
1. Arun K. Ghosh Introduction to measurements and Instrumentation, PHI, 4
th
Edition 2012.
2. A.D. Helfrick and W.D. cooper Modern Electronic Instrumentation & Measurement
Techniques. PHI 2001
3. DAVID A. BELL Electronic Instrumentation & measurement 3
rd
Edition 2013, Oxford
University Press.
4. Hermann K.P. Neubert, Instrument Transducers 2
nd
Edition 2012, Oxford University Press.
Web Resource: NPTEL course.
EE-305P
1. Study of Potentiometric Displacement Sensor.
2. Study of LVDT sensor
3. Study of Thermocouple & RTD sensors.
4. Frequency measurement of supply voltage
5. Study of Ultrasonic Flow Sensor
6. Study of ADC & DAC
7. Study of Proximity Sensors.
8. Acquisition of various sensors Output using USB DAQ.
9. Study of Active Low Pass Filter.
10. Study of Strain Gauges.

CS-301: Data Structures L:T:P ::3:1:2

Prerequisite: Students should be familiar with procedural language like C and concepts of
mathematics

Objective: To make students understand specification, representation, and implementation of
data types and data structures, basic techniques of algorithm analysis, recursive methods,
applications of Data Structures.

Course Outcome: On completion of this course, student should be able to-

1. Understand abstract data types
2. Understand and use arrays and link lists for various operations like insert, delete,
append and concatenate etc.
3. Understand applications of link lists like polynomial addition and multiplication etc.
4. Understand operations on Stacks, Trees, AVL Trees, B-Trees and B+-Trees etc.
5. Understand representation of graphs and their traversal; concept of Minimum
Spanning Tree etc.
6. Understand various sorting and searching algorithms with their time complexities.
7. Understand concept of garbage collection and compaction.

Unit I

Introduction: Basic Terminology, Elementary Data Organization, Algorithm, Efficiency of
an Algorithm, Time and Space Complexity, Asymptotic notations: Big-Oh, Time-Space
trade-off. Abstract Data Types (ADT).
Arrays: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row
Major Order, and Column Major Order, Application of arrays, Sparse Matrices and their
representations.
Stacks: Primitive Stack operations: Push & Pop, Array and Linked Implementation of Stack
in C, Application of stack: Prefix and Postfix Expressions, Evaluation of postfix expression,
Recursion, Tower of Hanoi Problem, Simulating Recursion, Principles of recursion, Tail
recursion, Removal of recursion
Unit II

Queues, Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues,
Array implementation of queues in C, Dequeue and Priority Queue.
Linked lists: Array Implementation and Dynamic Implementation of Singly Linked Lists,
Doubly Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion,
Traversal, Polynomial Representation and Addition, Generalized Linked List. Linked
implementation of stack, queues, Dequeue and Priority Queue.
Unit III
Searching : Sequential search, Binary Search

Sorting: Comparison and Analysis Internal Sorting: Insertion Sort, Selection, Bubble Sort,
Quick Sort, Two Way Merge Sort, Heap Sort, Radix Sort, Practical consideration for Internal
Sorting
Hashing: Hash Function, Collision Resolution Strategies Storage Management: Garbage
Collection and Compaction.
Unit IV
Trees: Basic terminology, Binary Trees, Binary Tree Representation: Array Representation
and Dynamic Representation, Complete Binary Tree, Algebraic Expressions, Extended
Binary Trees, Array and Linked Representation of Binary trees, Tree Traversal algorithms:
Inorder, Preorder and Postorder, Threaded Binary trees, Traversing Threaded Binary trees,
Huffman algorithm.
Search Trees: Binary Search Trees(BST), Insertion and Deletion in BST, Complexity of Search
Algorithm, AVL trees, Introduction to m-way Search Trees, B Trees & B+ Trees.

Unit V
Graphs: Terminology, Sequential and linked Representations of Graphs: Adjacency
Matrices, Adjacency List, Adjacency Multi list, Graph Traversal : Depth First Search and
Breadth First Search, Connected Component, Spanning Trees, Minimum Cost Spanning
Trees: Prims and Kruskal algorithm. Transistive Closure and Shortest Path algorithm:
Warshal Algorithm and Dijikstra Algorithm, Introduction to Activity Networks

Text Books:
1. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein Data Structures
Using C and C++ , Pearson Education.
2. Horowitz and Sahani, Fundamentals of Data Structures, Galgotia Publication.

References:
1. Jean Paul Trembley and Paul G. Sorenson, An Introduction to Data Structures with
applications, McGraw Hill.
2. R. Kruse et al, Data Structures and Program Design in C, Pearson Education.
3. Seymour Lipschutz, Data Structures with C Schaums Outline Series, TMH.
4. G A V Pai, Data Structures and Algorithms, TMH.

Web References
1. http://www.nptel.iitm.ac.in/video.php?subjectId=106102064
2. http://www.cs.auckland.ac.nz/~jmor159/PLDS210/ppt/index.html
3. http://www.informatics.sussex.ac.uk/courses/dats/dats.html
4. http://www.cs.umd.edu/~mount/420/Lects/420lects.pdf

Week Lecture 1 Chapter Lecture2 Chapter Lecture 3 Chapter Lab Meeting
Week-1 Introduction,Elem
entary Data
Organization, Data
Structure
operations
Text-1
chapter-1
Algorithm
Complexity
and Time-
Space tradeoff.
Text-1
chapter-1
Arrays:
Ordered List,
Linear and
Multidimensional
Arrays,
Representations of
Array
Text-1
chapter-1
Array
Operations
and Stack
Operations
using array
Week
-3
Application
of stack:
Week-2 Operations on
Array:
Traversal,
Insertion,
Deletion
Text-1
chapter-1
Application of
arrays, Sparse
Matrices and their
and overview:
Basic Terminology
representations
Text-1
chapter-1
Primitive Stack
operations: Push &
Pop, Array and
Linked
Implementation of
Stack in C,
Text-1
chapter-2
Evaluation of
Expression
Week-3 Application of
stack: Prefix and
Postfix
Expressions,
Evaluation of
postfix expression,
Recursion, Tower
of Hanoi Problem,
Text-1
chapter-2
Simulating
Recursion,
Principles of
recursion, Tail
recursion, Removal
of recursion
Text-1
chapter-3
Queues- Create, Add,
Delete, Full and
Empty, Circular
queues,
Text-1
chapter-4,
Text-2
chapter-3
Recursion,
Queue
Operations
Week-4 Array
Implementation
and Dynamic
Implementation of
Singly Linked
Lists,
Text-1
chapter-4
Operations on a
Linked List-List
Insertion, Deletion,
Traversal
Text-1
chapter-4
Doubly Linked List, Text-1
chapter-4
Single
Linked List
Week-5 Circularly Linked
List,
Text-1
chapter-4,
Text-2
chapter-3
Polynomial
Representation and
Addition,
Text-1
chapter-4
Generalized Linked
List
Text-1
chapter-4
Double
Linked List
and
applications
Week-6 Linked
implementation of
stack, queues,
Dequeue and
Priority Queue.
Text-1
chapter-4
Sequential search,
Binary Search
Text-1
chapter-7
Insertion Sort,
Selection, Bubble
Sort,
Text-1
chapter-6
Text-2 chapter
7
Sorting
Week-7 Quick Sort Text-1
chapter-6
text-2
chapter 7
Two Way Merge
Sort
Text-1
chapter-6,
Text-2
chapter 7
Heap Sort Text-1
chapter-6,
Text-2 chapter
7
Sorting
Week-8 Radix Sort,
Practical
consideration for
Internal Sorting
Text-1
chapter 6
Text-2
chapter 9
Hash Function,
Collision Resolution
Strategies

Text-2
chapter 9
Storage Management:
Garbage Collection
and Compaction.
Text-2 chapter
9
Sorting
Week-9 Trees: Basic
terminology,
Binary Trees,
Binary
Text-1
chapter-5
Tree Representation:
Array
Representation and
Dynamic
Representation,
Text-1
chapter-5
Complete Binary
Tree, Algebraic
Expressions,
Extended Binary
Trees, Array and
Linked
Representation of
Binary trees,
Text-1
chapter-5
Binary Tree
Week-10 Tree Traversal
algorithms:
Inorder, Preorder
and Postorder,
Text-1
chapter-5
Threaded Binary
trees, Traversing
Threaded Binary
trees
Text-1
chapter-5
Huffman algorithm. Text-1
chapter-5
Tree traversal
Week-11 Binary Search
Trees(BST),
Insertion and
Deletion in BST,
Complexity of
Search Algorithm
Text-1
chapter-5
Binary Search
Trees(BST),
Insertion and
Deletion in BST,
Complexity of
Search Algorithm
Text-1
chapter-5
AVL trees,
Introduction to m-way
Search Trees
Reference-3
chapter 7
Binary Search
Tree
Week-12 B Trees & B+
Trees.

Text-1
chapter-8,
reference-3
Graphs:
Terminology,
Sequential and
Text-1
chapter-8,
reference-3
Representations of
Graphs: Adjacency
Matrices, Adjacency
Text-1
chapter-8,
reference-3
Height
balanced tree

Lab. CS-301P

NOTE: More programs can be added to the list

Write Program in C or C++for following:
Array implementation of Stack, Queue, Dequeue, Circular Queue,List.
Programs solving problem of Tower of Hanoi for n disks with and without Tail Recursion.
Implementation of Stack, Queue, Circular Queue, List using Dynamic memory
Allocation.
Implementation of Tree Structures, Binary Tree, Tree Traversal, Binary Search Tree,
Insertion and Deletion in BST.
Implementation of Searching and Sorting Algorithms.
Graph Implementation, BFS, DFS, Min. cost spanning tree, shortest path algorithm.

chapter 7 linked, Applications chapter 7 List, Adjacency Multi
list,
chapter 7
Week-13 Graph Traversal :
Depth First Search
and Breadth First
Search
Text-1
chapter-8
Connected
Component,
Spanning Trees,
Text-1
chapter-8
Minimum Cost
Spanning Trees:
Prims and Kruskal
algorithm
Text-1
chapter-8
Graph
Representatio
n
Week-14 Transistive
Closure and
Shortest Path
algorithm:
Warshal
Algorithm and
Dijikstra
Algorithm
Text-1
chapter-8
Transistive Closure
and Shortest Path
algorithm: Warshal
Algorithm and
Dijikstra Algorithm
Text-1
chapter-8
Introduction to
Activity Networks

Text-1
chapter-8
Shortest Path
EC-302: Digital Design L:T:P ::3:1:2
CourseObjective:
391. ),%0.( 1. 18*(8-(- *, U0,51-( *9( .*%-(8*. Y1*9 6 ),:U0(9(8.15( %8-(0.*68-18E ,T *9(
T%8-6:(8*67. ,T -1E1*67 7,E1) )10)%1*." !*%-(8*. .9,%7- &( 6&7( *, 6867IX(\ -(.1E8\ 68- 1:U7(:(8*
),:&186*1,867 68- .(]%(8*167 )10)%1*."
CoursePrerequisites:
39(0( 60( 8, -(W181*( U0(0(]%1.1*(." B,Y(5(0\ 68 %8-(0.*68-18E ,T F,,7(68 67E(&06 Y177 &(
%.(T%7"
CourseContents:

Unit

Topic Text
Book /
Topics

Lectures
I
a)

b)

c)

Number Systems &Conversions:
F1860I \$)*67 68- B(`6-()1:67 #%:&(0.
#%:&(0 &6.( ),85(0.1,8.
+,:U7(:(8* ,T 8%:&(0.
!1E8(- F1860I #%:&(0.
F1860I +,-(.

Boolean AlgebraAnd Logic Gates:

F6.1) 39(,0(:. 68- U0,U(0*1(. ,T F,,7(68 ;7E(&06
F,,7(68 b%8)*1,8.
+68,81)67 68- !*68-60- b,0:.
$*9(0 2,E1) $U(06*1,8.
R1E1*67 2,E1) V6*(.

Gate-level minimization:
O
i= :6U :(*9,-G %U *, W15( 56016&7(J
/$! .1:U71W1)6*1,8\
R,8j* )60( ),8-1*1,8.
#;#R 68- #$_ 1:U7(:(8*6*1,8\ $*9(0 3Y, 2(5(7 1:U7(:(8*6*1,8.
4`=$_ b%8)*1,8
N
o%18(M)=+7%.[I :(*9,- G36&%760 :(*9,-J"

<"K\<"O
<">
<"N
<"@
<"Q

K"O
K"N
K"@
K"Q
K"L

>"K\>">\>"O
>"N
>"@
>"Q\>"L
>"l
>"<?

2

3

5
II

Combinational Logic :Analysis and Design

O"< *, O"O

+,:&186*1,867 )10)%1*.\
;867I.1. U0,)(-%0(\ -(.1E8 U0,)(-%0(

F1860I 6--(0=.%&*06)*,0\
R()1:67 6--(0

F1860I :%7*1U71(0\
M6E81*%-( ),:U606*,0

R(),-(0.\ 48),-(0.

M%7*1U7(`(0.\ R(:%7*1U7(`(0.

O"<\O"K
O">\O"O
O"N
O"@
O"Q
O"L
O"l\O"<?
O"<<

8
III

SynchronousSequential Logic : Analysisand Design

!(]%(8*167 )10)%1*.\
!*,06E( (7(:(8*.^ 76*)9(. 68-W71U W7,U.\
;867I.1. ,T )7,)[(- .(]%(8*167 )10)%1*.

!*6*( 0(-%)*1,8 68- 6..1E8:(8*.\
R(.1E8 U0,)(-%0("

!91T* 0(E1.*(0.

+,%8*(0.G _1UU7( ),%8*(0. 68- !I8)90,8,%. +,%8*(0.J

N"<\ N"K
N">\N"O
N"N
N"Q
N"L
@"K
@">\@"O

8
IV

Asynchronous Sequential Logic : Analysis and Design

;.I8)90,8,%. .(]%(8*167 7,E1)
;867I.1. U0,)(-%0(

+10)%1* Y1*9 76*)9(.
R(.1E8 U0,)(-%0(\

_(-%)*1,8 ,T !*6*( 68- b7,Y *6&7(.
_6)( T0(( .*6*( 6..1E8:(8*\

B6X60-.
R(.1E8 4`6:U7(

l"<
l"K
l">
l"O
l"N
l"@
l"Q
l"L

8
V
a)

b)

Memory And ProgrammableLogic Devices
_;M
M(:,0I R(),-18E
400,0 R(*()*1,8 68- +,00()*1,8
_$M
/2;
/;2

StateMachineDesign with SMcharts
_(E1.*(0 3068.T(0 2(5(7 #,*6*1,8.
;7E,01*9:1) !*6*( M6)918(.
R(.1E8 4`6:U7(

Q"K
Q">
Q"O
Q"N
Q"@
Q"Q

L"K

L"O
L"N

8

Text Book:
<" gR1E1*67 R(.1E8h\ M" M,001. M68, 68- M" R" +17(**1\ N*9 4-1*1,8\ /(60.,8 4-%)6*1,8
ReferenceBooks:
<" gb%8-6:(8*67. ,T 2,E1) R(.1E8h\ +9607(. B" _,*9\ c0"\ N*9 4-1*1,8\ F0,,[.A+,7(\ 6 -151.1,8
,T 39,:.,8\ K??O"
2. 2. "Digital Principles and Application", D P Leach, A P Malvino and Goutam Saha,
7th Edition, TMH
3. 3. "Digital Design - Principles and Practices" , J F Wakerly, 4th Edition, Pearson
Education
CourseOutcome:
$8 .%))(..T%7 ),:U7(*1,8 ,T *91. ),%0.(\ .*%-(8*. Y177 &( 6&7( *,^
C8-(0.*68- 5601,%. 8%:&(0 .I.*(:. 68- U(0T,0: 8%:&(0 ),85(0.1,8. &(*Y((8
-1TT(0(8* 8%:&(0 .I.*(:.
V618 *9( [8,Y7(-E( ,T 7,E1) E6*(. G;#R\ $_\ #;#R\ #$_\ p$_\ p#$_J
C8-(0.*68- F,,7(68 67E(&06 68- %.( 1* 18 0(U0(.(8*18E\ 6867IX18E\ 68- -(.1E818E
-1E1*67 7,E1) )10)%1*."
C.( i=:6U. 68- 36&%760 M(*9,- *, :181:1X( 68- ,U*1:1X( *Y,=7(5(7 7,E1)
T%8)*1,8. %U *, N 56016&7(."
R(.1E8 6 ),:&186*1,867 7,E1) )10)%1* T0,: E15(8 .U()1W1)6*1,8.
;867IX( 6 E15(8 ),:&186*1,867 )10)%1*. \ -(5(7,U18E 6 *0%*9 *6&7( 68- F,,7(68
(Ù0(..1,8
R(.1E8 .1:U7( .(]%(8*167 7,E1) )10)%1* T0,: E15(8 .U()1W1)6*1,8."
;867IX( *9( &(9651,%0 ,T 6 E15(8 .(]%(8*167 )10)%1*\ U0,-%)18E 68 6UU0,U016*(
.*6*( *6&7( 68- .*6*( -16E06:."
C8-(0.*68- *9( &6.1). ,T^ _$M\ _;M\ /_$M\ /2;\ /;2\ (*)"

Lab.EC- 302 P
CourseObjective:
391. 76& ),%0.( T,)%.(. ,8 -(.1E8 68- 1:U7(:(8*6*1,8 ,T ),:&186*,0167 7,E1) 68- .(]%(8*167 7,E1)
-1E1*67 )10)%1*." !*%-(8*. Y177 -(.1E8\ ),8.*0%)*\ *(.* 68- *0,%&7(.9,,* -1E1*67 )10)%1*. ,T &,*9
),:&186*1,867 68- .(]%(8*167 *IU(. 18 *9( 76&"
CoursePrerequisites:
391. ),%0.( 96. 8, U0(0(]%1.1*(." 39( ),=0(]%1.1*( ),%0.( T,0 *91. 76& 1. 4+=>?K GR1E1*67 R(.1E8J"
CourseContent:

ExpNo
.

Experiment

Objective

ExpectedOutcome
1.

S(01W1)6*1,8 ,T 2,E1)
V6*(

<" 3, .*%-I 68- %8-(0.*68-
8,:(8)76*%0(\ U18=),8W1E%06*1,8\
68- -6*6 .9((*. ,T QO .(01(. 332 H+."
K" 3, 5(01TI 68- 18*(0U0(* *0%*9
*6&7(. T,0 ;#R\ $_\ #$3\ #;#R\
#$_ 4`)7%.15( $_ 68- 4`)7%.15(
#$_ V6*(."
3, E(* T6:171601X(- Y1*9 U18=
),8W1E%06*1,8 ,T -1TT(0(8* *IU(.
,T QO .(01(. 332 H+."

3, E(* T6:171601X(- Y1*9 *9(
R1TT(0(8* /,0*1,8. ,T *9(
-6*6.9((* T,0 6 R1E1*67 H+ 68-
%.18E *9( -6*6.9((* *, E6*9(0
0(7(568* 18T,0:6*1,8 *, %*171X(
*9( H+ 6. 6 +,:U,8(8* 18
68,*9(0 R1E1*67 2,E1) +10)%1*"

2.

C.18E #;#R 68- #$_
E6*(. 6. %815(0.67
7,E1) E6*(.
<" 3, 0(671X( 6 E15(8 7,E1) T%8)*1,8.
Y1*9 *9( 9(7U ,T %815(0.67 E6*(=
#;#R V6*(
K" 3, 0(671X( 6 E15(8 7,E1) T%8)*1,8.
Y1*9 *9( 9(7U ,T %815(0.67 E6*(=#$_
V6*(
>" 3, 0(671X( 68 p$_ 68- p#$_ E6*(
%.18E :181:%: 8%:&(0 ,T #;#R
E6*(."
3, &( 6&7( *, %.( #;#R ,0
#$_ E6*(. T,0 *9(
1:U7(:(8*6*1,8 ,T 68I ,*9(0
E6*( 68- 67., T,0 *9(
0(671X6*1,8 ,T 68I E15(8
F,,7(68 T%8)*1,8
3.

R(.1E8 68-
1:U7(:(8*6*1,8 ,T
;--(0. 68-
<" 3, -(.1E8 68- 1:U7(:(8* B67T
;--(0 68- B67T !%&*06)*,0 %.18E
7,E1) E6*(."
!9,%7- &( 6&7( *, %8-(0.*68-
F1860I 6--1*1,8A.%&*06)*1,8
&I 8,*18E -,Y8 *9(
,%*U%* 0(6-18E. ,T
.%:A-1TT(0(8)( 68- *9(
!%&*06)*,0. K" 3, -(.1E8 68- 1:U7(:(8* b%77
;--(0 68- b%77 !%&*06)*,0 %.18E
7,E1) E6*(.
>" 3, -(.1E8 68- 1:U7(:(8* O= &1*
&1860I ;--(0A !%&*06)*,0 " C.18E H+
QOL>
O" 3, -(.1E8 68- 1:U7(:(8* F+R
6--(0 %.18E H+ QOL>
)600IA&,00,Y &1* T,0 -1TT(0(8*
),:&186*1,8. ,T 18U%*."

!9,%7- &( 6&7( *, %8-(0.*68-
*9( -1TT(0(8)( &(*Y((8 F+R
68- F1860I 6--1*1,8

4

R(.1E8 68-
1:U7(:(8*6*1,8 ,T
+,-( +,85(0*(0.
<" 3, -(.1E8 68- 1:U7(:(8* F+R *,
(`)(..=>G 68- 51)( 5(0.6J ),-(
),85(0*(0. %.18E 7,E1) E6*(."
K" 3, -(.1E8 68- 1:U7(:(8* F1860I
*, E06I G68- 51)( 5(0.6 ),-(
),85(0*(0.J %.18E 7,E1) E6*(."
!9,%7- &( 6&7( *,
%8-(0.*68- 68- 1:U7(:(8*
),-(=),85(0.1,8 U0,)(.. %.18E
&6.1) 7,E1) E6*(.

5 R(.1E8 68-
1:U7(:(8*6*1,8 ,T
M6E81*%-(
+,:U606*,0.

<" 3, -(.1E8 68- 1:U7(:(8* K &1*
M6E81*%-( +,:U606*,0 %.18E 7,E1)
E6*(."
K" 3, -(.1E8 68- 1:U7(:(8* L= &1*
M6E81*%-( +,:U606*,0 %.18E H+
QOLN"

3, %8-(0.*68- *9( U0,)(.. ,T
),:U6018E *Y, K=&1* 8%:&(0.
%.18E 7,E1) E6*(.

3, &( 6&7( *, %8-(0.*68-\
68- %.( g4]%1567(8)(
b%8)*1,8h T,0 1:U7(:(8*18E
M6E81*%-( ),:U606*,0."

3, E(* T6:171601X(- Y1*9
M6E81*%-( +,:U606*,0 H+
6 R(.1E8 68-
1:U7(:(8*6*1,8 ,T
/601*I V(8(06*,0.A
+9()[(0.

<" 3, -(.1E8 68- 1:U7(:(8*
,--A(5(8 U601*I )9()[(0 AE(8(06*,0
%.18E H+QO<L?"

3, %8-(0.*68- 68- 5(01TI *9(
),8)(U* ,T 6--18E (5(8 68-
,-- U601*I 18 *9( *068.:1**(-
-6*6

3, %8-(0.*68- 68- 5(01TI *9(
),8)(U* ,T )9()[18E (5(8 68-
,-- U601*I 18 *9( 0()(15(- -6*6
7 R(.1E8 68-
1:U7(:(8*6*1,8 ,T
(8),-(0. 68- -(),-(0.
<" 3, -(.1E8 68- 1:U7(:(8* O *, K
(8),-(0 %.18E 7,E1) E6*(."
K" 3, -(.1E8 68- 1:U7(:(8* > *, L
-(),-(0 %.18E 7,E1) E6*(.
>" 3, .*%-I 68- *(.* H+QOON 68-
H+QO<OQ"
3, &( 6&7( *, %8-(0.*68- 68-
5(01TI *9( ),8)(U*. ,T
(8),-18E 68- -(=),-18E %.18E
&6.1) 7,E1) E6*(.

3, E(* T6:171601X(- Y1*9 *9(
H+. %.(- 6. (8),-(0A-(),-(0
8 R(.1E8 68-
1:U7(:(8*6*1,8 ,T
M%7*1U7(`(0. 68- R(=
:%7*1U7(`(0.
<" 3, -(.1E8 68- 1:U7(:(8* O^<
M%7*1U7(`(0 %.18E 7,E1) E6*(."
K" 3, -(.1E8 68- 1:U7(:(8* <Ô R(=
3, &( 6&7( *, %8-(0.*68- 68-
5(01TI *9( ),8)(U*. ,T -6*6
:%7*1U7(`18E 68- -(=
:%7*1U7(`18E %.18E &6.1) 7,E1)
E6*(.
:%7*1U7(`(0 %.18E 7,E1) E6*(.
>" 3, .*%-I 68- *(.* H+QO<N? 68-
H+ QO<NO
3, E(* T6:171601X(- Y1*9 *9(
%.( ,T -(),-(0 H+ 6. -(=
:%7*1U7(`(0"
9.

R(.1E8 68-
1:U7(:(8*6*1,8 ,T
.91T* 0(E1.*(0.

<" 3, -(.1E8 68- 1:U7(:(8* O=&1*
!H!$\ !H/$\ /H!$ 68- /H/$ .91T*
0(E1.*(0. %.18E b71U= W7,U."
K" 3, -(.1E8 68- 1:U7(:(8*
L= &1* !91T* 7(T*A.91T* 01E9*
0(E1.*(0 %.18E W71U=W7,U.
3, &( 6&7( *, %8-(0.*68- 68-
5(01TI *9( ),8)(U*. ,T !(0167
18=.(0167 ,%*\ !(0167 18=U60677(7
,%*\ /60677(7 18= U60677(7 ,%*
68- /60677(7 18= .(0167 ,%* .91T*
0(E1.*(0 ,U(06*1,8.

10. R(.1E8 68-
1:U7(:(8*6*1,8 ,T
!I8)90,8,%.
68- ;.I8)90,8,%.
+,%8*(0.

<" 3, -(.1E8 68- 1:U7(:(8*
>=&1* .I8)90,8,%. %UA-,Y8 ),%8*(0"
K" 3, 1:U7(:(8* 68- 5(01TI
>=&1* 6.I8)90,8,%. %UA-,Y8
),%8*(0"
>"3, -(.1E8 68- 1:U7(:(8*
.I8)90,8,%. A6.I8)90,8,%. M$R
),%8*(0."
3, &( 6&7( *, -(.1E8 68-
5(01TI *9( %UA-,Y8 ),%8*18E
%.18E .I8)90,8,%.A 01UU7(
),%8*(0.

3, %8-(0.*68- *9( ),8)(U* ,T
gM,-%7%.h 68- 1:U7(:(8* 6
.I8)90,8,%.A6.I8)90,8,%.
),%8*(0 T,0 68I E15(8 M,-%7%.
%.18E :181:%: 8%:&(0 ,T
b71U=W7,U."

MINI PROJECT
11. M181 /0,'()* 18 R1E1*67
R(.1E8
3, -(.1E8\ 1:U7(:(8* 68- 5(01TI 6
:181 U0,'()* %.18E (6.17I 6**6186&7(
U60*.
!*%-(8*. Y177 6)]%10( *9(
6&171*I *, :6[( 718[. 6)0,..
-1TT(0(8* 60(6. ,T [8,Y7(-E(
68- *, E(8(06*(\ -(5(7,U 68-
(567%6*( 1-(6. 68-
18T,0:6*1,8 ., 6. *, 6UU7I
*9(.( .[177. *, *9( U0,'()*
*6.["
!*%-(8*. Y177 6)]%10(
),776&,06*15( .[177. *90,%E9
Y,0[18E 18 6 *(6: *, 6)91(5(
),::,8 E,67."

CourseOutcome:
39( .*%-(8*. 60( (Ù()*(- *, 6)]%10( &6.1) *0,%&7(.9,,*18E .[177. 8()(..60I T,0 *9( -(.1E8
68- 6867I.1. ,T -1E1*67 )10)%1*."
References:
<" gR1E1*67 R(.1E8h\ M" M,001. M68, 68- M" R" +17(**1\ N*9 4-1*1,8\ /(60.,8 4-%)6*1,8
K" gb%8-6:(8*67. ,T 2,E1) R(.1E8h\ +9607(. B" _,*9\ c0"\ N*9 4-1*1,8\ F0,,[.A+,7(\ 6 -151.1,8
,T 39,:.,8\ K??O"
>" S10*%67 26& D(&.1*( 9**UÂAYYY"576&"),"18A\
9**UÂAYYY"-1E1*67"11*[EU"(08(*"18A-()A18-(`"U9U

CS-303 : Discrete Structures L:T:P ::3:1:2

Prerequisites: Concepts of Mathematics.

Objective: Introduce propositional and predicate logic, Introduce the basics of integer theory,
counting principles, Introduce and work with important discrete data structures such as sets, relations,
sequences, and discrete functions.
Course Outcome: On completion of this course, student should be able to-
1. Understand the concepts of Set Theory, Relations, Functions, Groups, Abelian
Groups, Rings and Fields.
2. Understand the concepts of Propositional Logic, Predicate Calculus and Quantifiers;
and how to check validity of statements.
3. Understand the concepts of Recurrence Relation and method to solve the Recurrence
Relation using Generating Function.
4. Understand the basic concepts of Graph Theory.

UNIT -I: Basic Structures- Sets, Functions and Relations
Set Theory: Introduction to the theory of sets; combination of sets; multisets; ordered
pairs, power sets; finite and infinite sets; principle of inclusion and exclusion; proofs
of some general identities on sets.
Relations: definitions and properties of relations; relation composition;
representations of relations by binary matrices and digraphs; operations on relations.
closure of relations; reflexive, symmetric and transitive closures. Warshall's algorithm
to compute transitive closure of a relation; equivalence relations and equivalence
classes, partial order sets, combination of partial order sets, Hasse diagram. definition,
properties of lattices bounded, complemented, modular and complete lattice.
Functions: definition, classification of functions, operations on functions.

UNIT -II Techniques of Counting, Induction and recurrence Relation
Recurrence Relation: Recursive definition of functions, Recursive algorithms,
Method of solving recurrences.
Counting: Introduction, Counting Techniques, Pigeonhole Principle, Permutation and
Combinations.
Induction: Mathematical induction, Variants of induction.

UNIT -III Algebric Structures
Algebraic Structures: Definition, Groups, types:Semi Groups,Monoid
Group,Abelian group, properties of groups, Subgroups and order, Cyclic Groups,
Cosets, Lagranges theorem, Normal Subgroups, Permutation and Symmetric groups,
Group Homomorphisms, Definition and elementary properties of Rings and Fields,
Integers Modulo n.

UNIT -IV Logic
Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Algebraic
manipulation of Boolean expressions. Simplification of Boolean Functions, Karnaugh
maps, Logic gates, Digital circuits and Boolean algebra.
Propositional Logic: Proposition, well formed formula, Truth tables, Tautology,
Satisfiability, Contradiction, Algebra of proposition, Theory of Inference.
Predicate Logic: First order predicate, well formed formula of predicate, quantifiers,
Inference theory of predicate logic.

UNIT -V Graphs and Trees
Graphs: Definition and terminology, Representation of graphs, Multigraphs,
Bipartite graphs, Planar graphs, Isomorphism and Homeomorphism of graphs, Euler
and Hamiltonian paths, Graph coloring.
Trees : Definition, Binary tree, applications of trees, Binary tree traversal, Binary
search tree, spanning trees.

Textbook:
1. Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6/e, McGraw-Hill,
2006.
2. Babu Ram et.al., Discrete Mathematics, Pearson Education.
References:
1. C.L. Liu, Elements of Discrete Mathematics, 2nd Edition, McGraw Hill, 1985.
2. Jean Paul Trembley, R Manohar, Discrete Mathematical Structures with Application
to Computer Science, McGraw-Hill, Inc. New York, NY, 1975.
3. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 5/e,
Prentice Hall, 2004.
4. E.R. Scheinerman, Mathematics: A Discrete Introduction, Brooks/Cole, 2000.
5. R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5/e, Addison Wesley, 2004.
Web References
1. nptel.iitm.ac.in/video.php?subjectId=106106094
2. http://www.cs.virginia.edu/~asb/teaching/cs202-spring07/slides.html
3. www.abstractmath.org/MM/dm.pdf.
LAB. CS-303P:
Week-1 introduction to the
theory of sets;
combination of sets;
multisets; ordered
pairs, power sets;
finite and infinite
Text-1
chapter 2
principle of inclusion
and exclusion; proofs of
some general identities
on sets; selected
problems from each
topic
Text-1
chapter 2
Relations: definitions and
properties of relations;
relation composition;
representations of
relations by binary
matrices and digraphs;
Text-1
chapter 8
Lab
Experiment-1
Week-2 Operations on
relations. closure of
relations; reflexive,
symmetric and
transitive closures.
Text-1
chapter 7
Warshall's algorithm to
compute transitive
closure of a relation;
equivalence relations
and equivalence classes
Text-1
chapter 7
Partial order sets,
combination of partial
order sets, Hasse diagram.
Text-1
chapter 7
Lab
Experiment-2
Week-3 definition, properties
of lattices bounded,
complemented,
modular and
complete lattice.

Text-1
chapter 7
Functions: definition,
classification of
functions, operations on
functions

Text-1
chapter 7
Recursive definition of
functions
Text-1
chapter 2
Lab
Experiment-3
Week-4 Recursive algorithms Text-1
chapter 4
Method of solving
recurrences.

Text-1
chapter 6
Growth of functions. Text-1
chapter 6
Lab
Experiment-4
Week-5
Introduction,
Counting Techniques,
Text-1
chapter 6
Pigeonhole Principle,
Permutation and
Combinations
Text-1
chapter 5
Introduction to induction
Text-1
chapter 4
Lab
Experiment-5
Week-6 variants of induction-
weak induction and
structural induction
Text-1
chapter 4
Definition, Groups,
types:Semi
Groups,Monoid Group
Text-1
Chapter 11,
Text-2
Chapter 10
Abelian group, properties
of groups, Subgroups and
order
Text-1
Chapter
11, Text-
2 Chapter
10
Lab
Experiment-6
Week-7 Cyclic Groups,
Cosets,
Text-1
Chapter
11, Text-2
Chapter
10
Normal Subgroups, Text-1
Chapter 11,
Text-2
Chapter 10
Permutation and
Symmetric groups,
Text-1
Chapter
11, Text-
2 Chapter
10
Lab
Experiment7
Week-8 Group
Homomorphisms
Text-1
Chapter
11, Text-2
Chapter
10
Definition and
elementary properties
of Rings and field
Text-1
Chapter 11,
Text-2
Chapter 10
Integers Modulo n Text-1
Chapter
11, Text-
2 Chapter
10
Lab
Experiment-8
Week-9 Boolean Algebra:
Introduction, Axioms
and Theorems of
Boolean algebra,
Text-1
chapter-
10

Algebraic manipulation
of Boolean expressions.
Text-1
chapter-10
Simplification of Boolean
Functions, Karnaugh
maps, Logic gates, Digital
circuits and Boolean
algebra
Text-1
chapter-
10
Lab
Experiment-9
Week-
10
Proposition, well
formed formula,
Truth tables
Text-1
chapter-1
Tautology, Satisfiability,
Contradiction,
Text-1
chapter-1
Algebra of proposition,
Theory of Inference.
Text-1
chapter-1
Lab
Experiment-
10


1. Assume that the universal set U is finite. Given subsets A and B of U, write a program
using bit strings to find the following
a.
b. A B
c. A B
d. A B
e. A B
2. Implement sets which includes simulation of following operations on set
a. Subset
b. Union
c. Intersection
d. Cartesian product
e. Membership
f. Difference
g. Power set
h. Symmetric difference
i. Set Cardinality
3. Using the matrix representation of binary relations on a finite set, write programs to
a. Determine whether the relation is reflexive
b. Determine whether the relation is symmetric
c. Determine whether the relation is transitive
d. Find the matrix representing intersection of two relations
e. Find the matrix representing the union of two relations
4. Write a program to find the matrix representing the transitive closure using the
Warshalls algorithm.
5. Write a code to check whether a function is one to one.

6. Write recursive function to find
a. successor of a number
b. predecessor of a number
c. Ackermanns function for natural numbers m and n.
Week-
11
First order predicate,
well formed formula
of predicate
Text-1
chapter-1
quantifiers Text-1
chapter-1
Inference theory of
predicate logic
Text-1
chapter-1
Lab
Experiment-
11
Week-
12
Graph:Definition and
terminology
Text-1
chapter-8
Representation of
graphs
Text-1
chapter-8
Multigraphs, Bipartite
graphs
Text-1
chapter-8
Lab
Experiment-
12
Week-
13
Planar graphs,
Isomorphism and
Homeomorphism of
graphs
Text-1
chapter-8
Euler and Hamiltonian
paths
Text-1
chapter-8
Graph coloring. Text-1
chapter-8
Lab
Experiment-
13
Week-
14
Definition, Binary
tree, applications of
trees
Text-1
chapter-9
Binary tree traversal Text-1
chapter-9
Binary search tree,
spanning trees.

Text-1
chapter-9
Lab
Experiment-
14
7. Write programs using recursion for each of the following. Also formulate and solve
recurrences for them.
a. Greatest Common Divisor of two numbers
b. Linear Search
c. Binary Search
8. Given a positive integer n and a nonnegative integer not exceeding n, write a program
to find the number of r-permutations and r-combinations of a set with n elements
9. Given a positive integer n, write a program to list all the combinations of the set
{1,2,3..., n}
10. Write functions to simulate-
a. AND
b. OR
c. NOT
d. XOR
e. NAND
f. NOR
11. Write functions to implement the logical expressions-
a. p AND (p OR q )
b. NOT p OR q
c. (p AND q) OR ( NOT p AND NOT q )
12. Write a program to simulate K-map to simplify the 3 variable Boolean expression
13. Write a program for binary tree traversal
14. Write a program for graph traversal
a. DFS
b. BFS
Human Values & Professional Ethics
(Syllabus for the Value Education Course to be introduced in MTU Colleges/Institutes)
Subject Code-AU-301/AU-401
Course Objective
This introductory course input is intended
a. To help the students appreciate the essential complementarily between VALUES
and SKILLS to ensure sustained happiness and prosperity which are the core
aspirations of all human beings.
b. To facilitate the development of a Holistic perspective among students towards life,
profession and happiness, based on a correct understanding of the Human reality and
the rest of Existence. Such a holistic perspective forms the basis of value based living
in a natural way.
c. To highlight plausible implications of such a Holistic understanding in terms of
ethical human conduct, trustful and mutually satisfying human behavior and mutually
enriching interaction with nature.
Thus, this course is intended to provide a much needed orientational input in Value Education
to the young enquiring minds.
Course Methodology
The methodology of this course is universally adaptable, involving a systematic and
rational study of the human being vis--vis the rest of existence.
It is free from any dogma or value prescriptions.
It is a process of self-investigation and self-exploration and not of giving sermons.
Whatever is found as truth or reality is stated a proposal and the students are
facilitated to verify it in their own right based on their Natural Acceptance and
Experiential Validation
This process of self-exploration takes the form of a dialogue between the teacher and
the students to begin with and within the student himself/herself family.
This self-exploration also enables them to evaluate their pre-conditionings and present
beliefs.

Human Values & Professional Ethics
Course Code-AU-301/AU-401
Total No.of Lectures : 28 L-T-P:2-1-
0
Total No.of Practice Sessions: 14 (of 1 hr. each)

Content for Lectures:
Unit-I
Course Introduction - Need, Basic Guidelines, Content and Process for Value
Education
(6)
1. Understanding the need, basic guidelines, content and process for Value Education.
2. Self Exploration-what is it? - its content and process; Natural Acceptance and
Experiential Validation-as the mechanism for self exploration
3. Continuous Happiness and Prosperity-A look at basic Human Aspirations
4. Right understanding, Relationship and Physical Facilities-the basic requirements for
fulfillment of aspirations of every human being with their correct priority
5. Understanding Happiness and Prosperity correctly-A critical appraisal of the current
scenario
6. Method to fulfill the above human aspirations: understanding and living in harmony at
various levels.
Unit-II
Understanding Harmony in the Human Being-Harmony in Myself (6)
7. Understanding human being as a co-existence of the sentient I and the material
Body
8. Understanding the needs of Self (I) and Body - Sukh and Suvidha
9. Understanding the Body as an instrument of I (I being the doer, seer and enjoyer)
10. Understanding the characteristics and activities of I and harmony in I
11. Understanding the harmony of I with the Body: Sanyam and Swasthya; correct
appraisal of Physical needs, meaning of Prosperity in detail
12. Programs to ensure Sanyam and Swasthya
-Practice Exercised and Case Studies will be taken up in Practice Sessions.
Unit-III
Understanding Harmony in the Family and Society -Harmony in Human-Human
Relationship (6)
13. Understanding harmony in the Family- the basic unit of human interaction
14. Understanding values in human - human relationship; meaning of Nyaya and program
for its fulfillment to ensure Ubhay-tripti;
Trust (Vishwas) and Respect (Samman) as the foundational values of relationship
15. Understanding the meaning of Vishwas; Difference between intention and
competence
16. Understanding the meaning of Samman, Difference between respect and
differentiation; the other salient values in relationship
17. Understanding the harmony in the society (society being an extension of family):
Samadhan, samridhi, Abhay, Sah-astitva as comprehensive Human Goals
18. Visualizing a universal harmonies order in society-Undivided Society (Akhand
Samaj), Universal Order (Sarvabhaum Vyawastha) - from family to world family.
-Practice Exercise and Case Studies will be taken up in Practice Sessions.
Unit-IV
Understanding Harmony in the Nature and Existence - Whole existence as Co-existence

(5)
19. Understanding the harmony in the Nature
20. Interconnectedness and mutual fulfillment among the four orders of nature-
recyclability and self-regulations in nature
21. Understanding existence as Co-existence (Sah-astitva) of mutually interacting unites
in all-pervasive space.
22. Holistic perception of harmony at all levels of existence
-Practice Exercise and Case Studies will be taken up in Practice Sessions.
Unit-V
Implications of the above Holistic Understanding of Harmony on Professional Ethics

(5)
23. Natural acceptance of human values
24. Definitiveness of Ethical Human Conduct
25. Basis of Humanistic Education, Humanistic Constitution and Humanistic Universal
Order
26. Competence in professional ethics;
a. Ability to utilize the professional competence for augmenting universal
human order.
b. Ability to identify the scope and characteristics of people friendly eco-
friendly production systems
c. Ability to identify and develop appropriate technologies and management
patterns for above production systems.
27. Case studies of typical holistic technologies, management models and production
systems
28. Strategy for transition from the present state to universal Human Order;
a. At the level of individual: as socially and ecologically responsible
engineers, technologies and mangers.
b. At the level of society: as mutually enriching institutions and organizations

Content for Practice Sessions:
Unit-I
Course Introduction - Need, Basic Guidelines, Content and Process for Value Education
PS 1: Introduction yourself in detail. What are the goals in your life? How do you set your
goals in your life? How do you differentiate between right and wrong? What have been your
achievements and shortcomings in your life? Observe and analyze them.
Expected Outcome: the students start exploring themselves; get comfortable to each other
and to the teacher and start finding the need and relevance for the course.
PS 2: Now a days, there is a lot of voice about many techno-genic maladies such as energy
and natural resource depletion, environment pollution, global warming, ozone depletion,
deforestation, soil degradation, etc. - all these seem to be man-made problems threatening the
survival of life on Earth- What is the root cause of these maladies & what is the way out in
your opinion?
On the other hand, there is rapidly growing danger because of nuclear proliferation,
arms race, terrorism, criminalization of politics, large scale corruption, scams, breakdown of
relationships, generation gap, depression & suicidal attempts, etc - what do you thing, is the
root cause of these threats to human happiness and peace - what could be the way out in your
opinion?
Expected Outcome: the students start finding that technical education without study of
human values can generate more problems than solutions. They also start feeling that lack of
understanding of human values is the root cause of all problems and the sustained solution
could emerge only through understanding of human values and value based living. Any
solution brought fear, temptation or dogma will not be sustainable.
PS 3:
1. Observe that each one of us has Natural Acceptance, based on which one can verify
right or not right for him. Verify this in case of:
(i) What is Naturally Acceptable to you in relationship-Feeling of respect or
disrespect?
(ii) What is Naturally Acceptable to you - to nurture or to exploit others?
Is your living the same as your natural acceptance or different?

2. Out of the three basic requirements for fulfillment of your aspirations-right
understanding, relationship and physical facilities, observe how the problems in your
family are related to each. Also observe how much time & effort your devote for each
in your daily routine.

Expected Outcome

1. The students are able to see that verification on the basis of natural acceptance and
experiential validation through living is the only way to verify right or wrong, and
referring to any external source like text or instrument or nay other person cannot
enable them to verify with authenticity; it will only develop assumptions.
2. The students are able to see that their practice in living is not in harmony with their
natural acceptance most of the time and all they need to do is to refer to their natural
acceptance to remove this disharmony.
3. The students are able to see that lack of right understanding leading to lack of
relationship is the major cause of problems in their family and not the lack of physical
facilities in most of the cases, while they have given higher priority to earning of
physical facilities in their life ignoring relationships and not being aware that right
understanding is the most important requirement for any human being.

Unit-II
Understanding Harmony in the Human Being-Harmony in Myself
PS 4: List down all your desires. Observe whether the desire is related to Self (I) or Body. If
it appears to be related to both, see which part of it is related to Self (I) and which part is
related to Body.
Expected Outcome: the students are able to see that they can enlist their desires and the
desires are not vogue. Also they are able to relate their desires to I and Body distinctly. If
any desire appears related to both, they are able to see that the feeling is related to I while the
Physical facility is related to the body. They are also able to see that I and Body are two
realities , and most of their desires are related to I and not body, while their efforts are
mostly centered on the fulfillment of the needs of the body assuming that it will meet the
needs of I too.
PS 5:
1. (a) Observe that any physical facility you use, follows the given sequence with time:
Necessary & tasteful-unnecessary & tasteful-unnecessary & tasteless-intolerable

(b) In contrast, observe that any feeling in you is either naturally acceptable or not
acceptable at all. If naturally acceptable, you want it continuously and if not
acceptable, you do not want it any moment.

2. List down all your activities. Observe whether the activity is of I or of Body or with
the participation of both I and Body.
3. Observe the activities within I. Identify the object of your attention for different
moments (over a period of say 5 to 10 minutes) and draw a line diagram connecting
these points. Try to observe the link between any two nodes.

Expected Outcome:
1. The students are able to see that all physical facilities they use are required for limited
time in limited quantity. Also they are able to see that in case of feelings, they want
continuity of the naturally acceptable feelings and they do not want feelings which are
not naturally acceptable even for a single moment.
2. The students are able to see that activities like understanding, desire, thought and
selection are the activities of I only, the activities like breathing, palpitation of
different parts of the body are fully the activities of body with the acceptance of I
while the activities they do with their sense organs like hearing through ears, seeing
through eyes, sensing through touch, tasting through tongue and smelling through
nose or the activities they do with their work organs like hands, legs etc. are such
activities that require the participation of both I and body.
3. The students become aware of their activities of I and start finding their focus of
attention at different moments. Also they are able to see that most of their desires are
coming from outside (through preconditioning or sensation) and are not based on their
natural acceptance.
PS 6:
1. Chalk out programs to ensure that you are responsible to your body-for the
nurturing, protection and right utilization of the body.
2. Find out the plants and shrubs growing in and around your campus. Find out their
use for curing different diseases.
Expected Outcome: The Students are able to list down activities related to proper upkeep of
the body and practice them in their daily routine. They are also able to appreciate the plants
wildly growing in and around the campus which can be beneficial in curing different diseases
Unit-III
Understanding Harmony in the Family and Society -Harmony in Human-
Human Relationship
PS 7: From small groups in the class and in that group initiate dialogue and ask the eight
questions related to trust. The eight questions are:
1 a. Do I want to make myself happy? 1b. Am I able to make myself always happy?
2 a. Do I want to make the other happy? 2b. Am I able to make the other always happy?
3a. Does the other want to make him happy? 3b. Is the other able to make him always
happy?
4a. Does the other want to make me happy? 4b. Is the other able to make me always happy?
What is the answer? What is the answer?
Intention (Natural Acceptance) Competence

Let each student answer the questions for himself and everyone else. Discuss the difference
between intention and competence. Observe whether you evaluate your intention &
competence as well as the others & competence.
Expected Outcome: The students are able to see that the first four questions are related to
our Natural Acceptance i.e. intention and the next four to our Competence. They are able to
note that the intention is always correct, only competence is lacking! We generally evaluate
ourselves on the basis of our intention and others on the basis of their competence! We
seldom look at our competence and others intentions as a result we conclude that I am a
good person and other is a bad person.
PS 8:
1. Observe on how many occasions you are respecting your related ones (by doing the
right evaluation) and on how many occasions you are disrespecting by way of under-
evaluation, over-evaluation or otherwise evaluation.
2. Also observe whether your feeling of respect is based on treating the other as yourself
or on differentiations based on body, physical facilities or beliefs.

Expected Outcome: the students are able to see that respect is right evaluation, and only
right evaluation leads to fulfillment in relationship. Many present problem in the society are
and outcome of differentiation (lack of understanding of respect), like gender biasness,
generation gap, caste conflicts, class struggle, dominations through power play, communal
violence, clash of isms, and so on so forth. All these problems can be solved by realizing that
the other is like me as he has the same natural acceptance, potential and program to ensure a
happy and prosperous life for him and for others though he may have different body, physical
facilities or beliefs.
PS 9:
1. Write a note in the form of story, poem, skit, essay, narration, dialogue to educate a
child. Evaluate it in a group
2. Develop three chapters to introduce social science-its need, scope and content in the
primary education of children

Expected Outcome: The students are able to use their creativity for education children. The
students are able to see that they can play a role in providing value education for children.
They are able to put in simple words the issues that are essential to understand for children
and comprehensible to them. The students are able to develop an outline of holistic model for
social science and compare it with the exiting model.
Unit-IV
Understanding Harmony in the Nature and Existence - Whole existence as Co-existence

PS 10: List down units (things) around you. Classify them in for orders. Observe and explain
the mutual fulfillment of each unit with other orders.
Expected Outcome: The students are able to differentiate between the characteristics and
activities of difference orders and study the mutual fulfillment among them. They are also
able to see that human beings are not fulfilling to other orders today and need to take
appropriate steps to ensure right participants (in terms of nurturing, protection and utilization)
in the nature.
PS 11:
1. Make a chart for the whole existence. List down different courses of studies and relate
them to different units or levels in the existence.
2. Choose any one subject being taught today. Evaluate it and suggest suitable modifications
to make it appropriate and holistic.
Expected Outcome: The students feel confident that they can understand the whole
existence; nothing is a mystery in this existence. They are also able to see the
interconnectedness in the nature, and pint out how different courses of study related to the
different units and levels. Also they are able to make out how these courses can be made
appropriate and holistic.
Unit-V
Implications of the above Holistic Understanding of Harmony on Professional Ethics

PS 12: Choose any two current problems of different kind in the society and suggest how
they can be solved on the basis of natural acceptance of human values. Suggest steps you will
take in present conditions.
Expected Outcome: the students are able to present sustainable solutions to the problems in
society and nature. They are also able to see that these solutions are practicable and draw
roadmaps to achieve them.
PS: 13
1. Suggest ways in which you can use your knowledge of Technology/Engineering/
Management for universal human order, from your family to the world family.
2. Suggest one format of humanistic constitution at the level of nation from your
side.

Expected Outcome: The students are able to grasp the right utilization of their knowledge in
their streams of Technology/Engineering/Management to ensure mutually enriching and
recyclable productions systems.
PS:14 The course is going to be over now. Evaluate your state before and after the course in
terms of:
a. Thought b. Behavior c. Work and d. Realization
Do you have any plan to participate in the transition of the society after graduating from the
institute? Write a brief note on it.
Expected Outcome: The students are able to sincerely evaluate the course and share with
their friends. They are also able to suggest measures to make the course more effective and
relevant. They are also able to make us of their understanding in the course for a happy and
prosperous society.
Term Paper
Text Book and Reference Material
a. The text book:
R.R. Gaur, R Sangal, G P Bagaria, 2009, A Foundation Course in Human Values
and Professional Ethics, Excel Books Private Limited, New Delhi
b. Teachers Manual:
R.R. Gaur, R Sangal, G P Bagaria, 2009, Teachers Manual: A Foundation Course
in Human Values and Professional Ethics, Excel Books Private Limited, New Delhi
Video CD of Teacher Orientation Workshop will be made available on website.
c. Reference Books
1. Ivan Illich, 1974, Energy & Equity, The Trinity Press, Worcester, and Haper
Collings, USA.
2. E.F. Schumacher, 1973, Small is Beautiful: a study of economics as if people
mattered, Blond & Briggs, Britain.
3. Sussan George, 1976, How the other Half Dies, Penguin Press, Repreinged 1986,
1991.
4. Donella H, Meadows, Dennis L. Meadows, Jorgen Randders, William W.
Behrens III, 1972, Limits to Growth-Club of Romes report, Universe Books.
5. A Nagraj, 1998, Jeevan Vidya ek Parichay, Divya Path Sansthan, Amarkantak.
6. P.L. Dhar, RR Gaur, 1990, Science and Humanism, Commonwealth Publishers.
7. AN Tripathy, 2003, Human Values, New Age International Publishers
8. Subhas Palekar, 2000, How to practice Natural farming, Pracheen (vaidik) Krishi
Tantra Shodh, Amravati
9. EG Seebauer & Robert L Berry, 2000, Fundamentals of Ethics for Scientists &
Engineers, Oxford University Press
10. M Govindrajran S Natrajan & V.S. Senthil Kumar, Engineering Ethics (including
Human Values), Eastern Economy Edition, Prentice Hall of India Ltd.
11. B.P. Banerjee, 2005, Foundation of Ethics and Management, Excel Books.
12. B.L. Bajpai 2004, Indian Ethos and Modern Management, New Royal Book CO.
Lucknow. Reprinted 2008

d. Relevant websites, CDs, Movies and Documentaries:
1. Value Education website, http://www.uptu.ac.in
2. Story of stuff, http//www.storyofstuff.com
3. AL Gore, An Inconvenient Truth, Paramount Classics, USA
4. Charlie Chaplin, Modern Times, United Artists, USA
5. IIT Delhi, Modern Technology-the Untold Story
6. Anand Gandhi, Right here right now, Cyclewala Production

SEMESTER IV

AS-402: Basics of SystemModelling& Simulation
2"3"/^>"<"?
Course Description:
391. ),%0.( Y177 ),5(0 &,*9 *9(,0(*1)67 P 6UU71)6*1,8 6.U()*. ,T :6*9(:6*1)67 :,-(7718E ,T
(`1.*18E ,0 8(Y &6.1) .I.*(:. *, -(:,8.*06*( *9( ),8)(U*. ,T :,-(7718E\ 6UU0,6)9 68- %.( ,T
.1:%76*1,8 *()981]%(. 68- *9(10 0(76*1,8.91U. *, *9( 0(67 Y,07- .I.*(:."
Course Objectives:
<" 3, U0(.(8* ),8)(U*. ,T ),:U%*(0 :,-(7718E 68- .1:%76*1,8 *, 5601,%. 86*%067\ :68=
:6-(\ .,)167 68- (8E18((018E .I.*(:."
K" 39( ),%0.( Y177 U0,51-( (Ù(01(8)( ,T :,-(7718E P .1:%76*1,8 .U()1W1)677I .%1*(- *,
(8E18((018E .I.*(:. *, .9,Y 9,Y 1* )68 9(7U 18 *9( 6867I.1.\ -(.1E8\ U(0T,0:68)(
(567%6*1,8\ ,U(06*1,867 &(9651,%0 68- 6..(..:(8* ,T U(0T,0:68)( P (TW1)1(8)I Y1*9
0(.U()* *, .U()1W1) E,67."
LearningOutcomes:
<" C8-(0.*68- *9( :,-(7718E ),8)(U*. P *IU(. ,T :,-(7. %.(- *, 0(U0(.(8* -1TT(0(8*
)76..(. ,T 0(67 Y,07- .I.*(:."
K" ;UU7I18E 5601,%. :6*9(:6*1)67 ),8)(U*. P *()981]%(. *, -(W18( U9I.1)67\ 86*%067 P
.,)167 .I.*(:."
>" ;UU7I18E ),8)(U*. ,T ),:U%*(0 .1:%76*1,8 T,0 *IU(. ,T 18U%*.\ .I.*(: :,-(7.\ ,%*U%*
&(9651,%0 68- U(0T,0:68)( (.*1:6*1,8"
O" C8-(0.*68- 9,Y *, (567%6*(\ 5671-6*( P 5(01TI :,-(7. ,T .1:U7( .I.*(:."
N" C8-(0.*68- 9,Y ),:U7(` 68- 9(*(0,E(8(,%. .I.*(:. )68 &( .1:U71W1(- 68- :,-(77(-
T,0 6 .U()1W1) *6.[ 68- *9%. %8-(0.*68- *9( 71:1*6*1,8. ,T :,-(7718E P .1:%76*1,8"
Cognitive Skills learnt:
<" ;&171*I *, :6*9(:6*1)677I :,-(7 68I .I.*(: T0,: 5601,%. W1(7-."
K" ;&171*I *, 1:U7(:(8* .1:U7( 8%:(01)67 67E,01*9:. *, .,75( 5601,%. :,-(7718E (]%6*1,8.
*96* 60( %.(- *, -(.)01&( 0(67 Y,07- .I.*(:."
>" ;&171*I *, .(7()* .%1*6&7( *()981]%(. T,0 E(8(06*18E .I.*(: :,-(7.\ .1:%76*( *9(: ,8
),:U%*(0. 68- (567%6*( *9( .I.*(: U(0T,0:68)("
CoursePre-requisites: /0,&6&171*I P !*6*1.*1)67 M(*9,-
Course Content:
Unit -I: Introduction to SystemModelling& Simulation: GQ 7()*%0(.J
#((- P %.( ,T !1:%76*1,8\ .I.*(: :,-(7.\ 6-568*6E(. P 71:1*6*1,8. ,T :,-(7.\ .1:U71W1(-
0(U0(.(8*6*1,8 ,T ),:U7(` P 760E( .I.*(:.\ /018)1U67. P !*(U. 18 )0(6*18E .I.*(: :,-(7.\
)6U*%018E .I.*(: (8510,8:(8*\ ),:U,8(8*. ,T .I.*(:. 68- .(7()*1,8 ,T 6UU0,U016*( :,-(7718E
*()981]%(. P .1:%76*1,8 :(*9,-,7,E1(.q 0(76*1,8.91U. &(*Y((8 .(7()*(- :,-(7. P .1:%76*1,8
*()981]%(."

Unit -II: SystemModellingConcepts: GL 2()*%0(.J
3IU(. ,T .I.*(: :,-(7.\ ),8*18%,%. P -1.)0(*( .I.*(:.\ ),:U601.,8 ,T 6867I*1)67 P .1:%76*1,8
:(*9,-.\ 45(8* P R6*6 M,-(7718E\ M,-(7 &%17-18E\ R6*6 :,-(7718E P *()981]%(. ,T &%17-18E
%.(T%7 H8U%* R6*6 :,-(7.\ :%7*156016*( P *1:( .(01(. 18U%* :,-(7." !*(U. 18 .I.*(: :,-(7
&%17-18Eq M,8*( +607, M(*9,-\ 5(01W1)6*1,8\ )671&06*1,8 P 5671-6*1,8 ,T :,-(7. T,0 .1:U7(
.I.*(:."
Unit -III: Probability &RandomNumber generation: GQ 2()*%0(.J
R1.)0(*( P +,8*18%,%. _68-,: S6016&7(.\ U0,&6&171*I T%8)*1,8.\ -(.)01U*15( )9606)*(01.*1). ,T 6
R1.*01&%*1,8" 3(.*. ,T BIU,*9(.1. 68- 4.*1:6*1,8 ,T +,8W1-(8)( H8*(0567\ 4.*1:6*1,8 ,T 400,0\
/606:(*(0 4.*1:6*1,8\ V,,-8(..=,T=W1* 3(.*." #%:(01)67 +,:U%*6*1,8 *()981]%(. T,0 +,8*18%,%.
P R1.)0(*( M,-(7." R1.*01&%*(- 26E P +,&Y(& M,-(7."
Unit IV: QueuingSystems & DiscreteSystemSimulation: (@ 2()*%0(.J
M,-(7718E P V(8(06*1,8 ,T ;001567 /6**(08.\ 4Ù,8(8*167 P /,1..,8 -1.*01&%*1,8\ !(051)( 31:(.\
#,0:67 R1.*01&%*1,8 o%(%18E !I.*(:.\ !1:%76*1,8 ,T !18E7( P M%7*1U7( !(05(0 o%(%18E !I.*(:.\
E6*9(018E .*6*1.*1).\ M(6.%018E ,))%U68)I P C*171X6*1,8\ !(051)( R(76I P 3068.1* 31:(.
4.*1:6*1,8"
Unit -V: Real World Application of Simulation: G<K 2()*%0(.J
3068.T(0 218( M,-(7\ H85(8*,0I !I.*(: M,-(7\ R(6-7,)[ R(*()*1,8 M,-(7\ +,:U%*(0 +(8*(0
M,-(7\ c,& !9,U M,-(7\ c%.*=H8=31:( M,-(7\ /1 567%( (.*1:6*1,8\ +6U1*67 0(),5(0I M,-(7\
4),8,:1). ,T H8.%068)( U,71)I\ _(716&171*I 4.*1:6*1,8\ D60068*I /0,&7(: P 4.*1:6*1,8\
+,:U%*(0 #(*Y,0[ M,-(7" H8*(0U0(*6*1,8 ,T +,8W1-(8)( H8*(0567 ,T 6 /606:(*(0"
References & Bibliography:
<" V,0-(8 V" \ !I.*(: !1:%76*1,8\ /0(8*1)( B677"
K" 26Y M" ;5(0177\ !1:%76*1,8 M,-(718E P ;867I.1.\ 36*6 M6)V06Y B177\ #(Y R(791\ O
*9

4-1*1,8"
>" !(8E%U*6 !"\ !I.*(: !1:%76*1,8 P M,-(7718E\ /(60.,8 4-%)6*1,8\ K?<>"
O" F68[.\ +60.,8\ #(7.,8 P #,),0\ R1.)0(*( 45(8* !I.*(: !1:%76*1,8\ /0(8*1)( B677\ O
*9

4-1*1,8 K??N"
N" i7(180,)[ 2" o%(%(18E !I.*(:.= S,7 H^ 39(,0I\ c,98 D1(7I P !,8. H8)\ <lQN"
@" M,001. B" R(V0,,* P M60[ c" !)9(051.9 \ /0,&6&171*I P !*6*1.*1).\ ;--1.,8 D1.(7(I\ >
0-

4-1*1,8\ K??K"
7. Pratiksha Saxena, Modeling and Simulation, Narosa Publishing House,2011
8. Zeigler, Praehofer and Kim, Theory of Modelling and Simulation, 2
nd
Edition, Elsevier, 2013.
C_2^ YYY"18.1E9*:6[(0"),:^ b0(( Y(& &6.(- M%7*1=%.(0 M,-(7718E P !1:%76*1,8
48510,8:(8*"
YYY",)Y":1*"(-%^ +,%0.( ,8 gH8*0,-%)*1,8 *, M,-(7718E P !1:%76*1,8h"
YYY"Y,7T60:"),:A.I.*(:=:,-(7(0^ b,0 .I.*(: :,-(7718E .,T*Y60( P S1.%671X(0"

List of experiments:
<" !1:%76*1,8 ,T !)9(-%718E ;7E,01*9:.^ +/C !)9(-%718E 3()981]%(.^ b+b!\ !cb\ P
/01,01*I !)9(-%718E\ C.18E o%(%18E 39(,0I
K" !1:%76*1,8 ,T R1.[ !)9(-%718E ;7E,01*9:."
>" M,-(7718E M%7*1U7(`(0. P +,8)(8*06*,0. 68- 6UU7I18E ]%(%18E *9(,0I ),8)(U*.
*, -(*(0:18( ,U(06*1,867 U(0T,0:68)( U606:(*(0."
O" !1:%76*1,8 ,T !I.*(: _(716&171*I ,T 68I E15(8 .I.*(: 68- -(*(0:18( 1*. 0(716&171*I
68- 65(06E( T617%0( 06*( &6.(- ,8 *9( E15(8 ),:U,8(8* 0(716&171*I"
N" M,-(7718E ,T 306TW1) &6.(- ,8 E15(8 .*6*1.*1). ,T 306TW1) R(8.1*I P 5(91)7(
9(*(0,E(8(1*I"
@" 3(7(U9,8( 4`)968E( M,-(7718E P +677 06*( P +677 -0,U (.*1:6*1,8 &6.(- ,8
(`)968E( )6U6)1*I"
Q" +,8E(.*1,8 M,-(7718E P ;867I.18E *9( 1:U6)* ,T ),8E(.*1,8 ),8*0,7 67E,01*9:. 18
M,&17( .I.*(:.A +,:U%*(0 8(*Y,0[.A ;..(:&7I 218( ,U(06*1,8."
Note: Studentsshall performpracticals in tutorial periodsusingSci Labwhich is freely
downloadablefromhttp://www.scilab.org/products/scilab http://www.scilab.in/

CS-401: Computer Organization L:T:P ::3:1:2

Course Objectives:
Objective of this course is to have a thorough understanding of the basic structure and
operation of a digital computer, to study the different ways of communicating with I/O
devices and standard I/O interfaces and to study the hierarchical memory system including
cache memories and virtual memory.
The Subject discusses in detail the operation of the arithmetic unit including the algorithms &
implementation of fixed-point and floating-point addition, subtraction, multiplication &
division.

Pre-requisites:
Binary number System and Boolean algebra. Gates and flip flops. Combinational and
sequential logic

UNIT-I
Introduction: - Review of digital logic and gates, Design of adder and subtractor using gates
& K-MAP, functioning of multiplexer, de-multiplexer, flip-flop.
Arithmetic for Computer:- Introduction to number system, negative numbers, addition &
subtraction, logical operation, constructing and A.L.U., multiplications & division, floating
point arithmetic.

UNIT-II
Processor Design:- Processor organization, Processor Level, information representation,
instruction format, Addressing modes (Implied Mode, Immediate mode, register indirect
mode, auto increment or Auto decrement mode, direct addressing mode, indirect addressing
mode, relative addressing mode, index addressing mode), instruction types.

UNIT-III
Control Design: - Basic Concepts, Hardwired Control, Control memory address sequencing,
micro instruction interpretation, CPU control unit, basic concepts of micro programmed
control, micro program sequencer for a control memory, micro instruction formats.

UNIT-IV
Memory Organization:- Classification memories, Memory Hierarchy, Optimization of
memory hierarchy, Virtual Memory, Dynamic Address Translation Scheme addressing
scheme for main memory, segmented memory system, paged segment memory, memory
management policies, High speed memories, characteristics of cache memory, Cache
memory organization, Block replacement policies, interleaved memories, associated
memories.

UNIT-V
System Organization: - Bus arbitration, Programmed I/O (IO addressing, IO instruction),
DMA (Types & procedures), interrupts (procedure, interrupt selection, vectored interrupts),
Concurrency Control, System management.

Text Books:
1. Computer Architecture and Organization, By John P. Hayes, Me Graw Hill.

References:

2. Computer organization and design, by John L. Hennessy 7 David A. Petterson, Morgan
Kaufman.
3. Computer System Architecture, by M. Morris Mano, PHI
Web Resourses:
http://nptel.iitm.ac.in/courses/Webcourse-contents/IIT-KANPUR/CompArchitecture/page1.htm
Lab. CS-401P
Week-1
Review of digital logic &
gates
Any Std
Book
Design of adder and
subtractor using
gates & K-MAP
Any Std
Book
Functioning of
multiplexer, de-
multiplexer, flip-
flop
Any Std
Book
Study of
Breadboard
Based Lab
Week-2
Introduction to number
system, negative numbers
Any Std
Book
Addition &
subtraction, logical
operation,
constructing and
A.L.U.
4.1 T1 Multiplications 4.1 T1
Study of
Simulator
Based Lab
Week-3 Division 4.1 T1
Floating point
arithmetic.
4.3 T1
Revision and
Discussion
- Lab1
Week-4 Processor organization 3.1 T1 Processor Level 2.3 T1 Information
Representation
3.2 T1
Lab2
Week-5 Instruction format 3.3 T1 Addressing Mode 3.3 T1 Addressing Mode 3.3 T1
Lab3
Week-6 Instruction Type 3.3 T1 Revision and
Discussion
- Revision and
Discussion
-
Lab4
Week-7 Basic Concepts 5.1T1
Hardwired Control
5.1T1 Micro instruction
interpretation
5.2T1 Lab5
Week-8 CPU control unit 5.2T1 Basic concepts of
micro programmed
control
5.2T1 Micro program
sequencer for a
control memory
5.2T1 Lab6
Week-9 Micro instruction formats 5.2T1 Revision and
Discussion
- Revision and
Discussion
-
Lab7
Week-10 Classification memories 6.1T1 Memory Hierarchy 6.2T1 Optimization of
memory hierarchy
6.2T1
Lab8
Week-11 Virtual Memory,
Dynamic Address
Translation Scheme
addressing scheme for
main memory
6.2T1 Segmented memory
system, paged
segment memory
6.2T1 Memory
management
policies
6.2T1
Lab9
Week-12 High speed
memories, characteristics
of cache memory
6.3T1 Cache memory
organization, Block
replacement policies
6.3T1 interleaved
memories,
associated memories
6.3T1
Lab10
Week-13 Bus arbitration 7.1T1 Programmed I/O (IO
addressing, IO
instruction)
7.2.T1 DMA (Types &
procedures)
7.2.T1
Lab11
Week-14 Interrupts
(procedure, interrupt
selection, vectored
interrupts)
7.2.T1 Concurrency
Control
7.3.T1 System management 7.3.T1
Lab11

1. Breadboard implementation of flip flops SR, JK, T and D flip flop And verify their
characteristic table.
2. Experiments with clocked flip-flops
3. Design of Counters
4. Breadboard implementation of Counters and Shift Registers.
5. Implementation of arithmetic algorithms.
6. Breadboard implementation of Half/Full Adder and Half/Full Subtractor.
7. Breadboard implementation of Half/Full Adder.
8. Breadboard implementation of 7-segment display.
9. Ripple Carry Adder:( 4 bit ripple carry adder) Using Simulator
10. Carry-look-ahead adder:(4 bit carry lookahead adder) Using Simulator
11. Carry-Save-ahead adder:(4 bit carry lookahead adder) Using Simulator
12. Booth's Multiplier: (Objective of 4 bit Booth's multiplier) Using Simulator

Course Plan
Topic Reference Hour
1.Introduction: - Review of digital logic gates, Design of adder
and subtractor using gates &K-MAP, functioning of multiplexer,
de-multiplexer, flip-flop.
Arithmetic for Computer:-Introduction to number system,
negative numbers, addition &subtraction, logical operation,
constructing and A.L.U., multiplications & division, floatingpoint
arithmetic.
John P.
Hayes
8 Hr
2.Processor Design:- Processor organisation, Processor Level,
information representation,instruction format, Addressing modes
(Implied Mode, Immediate mode, register indirectmode, auto
increment or Auto decrement mode, direct addressing mode,
indirectaddressing mode, relative addressing mode, index
addressing mode), instruction types.
John P.
Hayes
8 Hr
3. Control Design: - Control memory address sequencing, micro
instruction interpretation,CPU control unit, basic concepts of
micro programmed control, micro program sequencerfor a control
memory, micro instruction formats.
John P.
Hayes
8 Hr
4.Memory Organization:- Classification memories, Memory
Hierarchy, Optimization ofmemory hierarchy, Virtual Memory,
Dynamic Address Translation Scheme addressingscheme for main
memory, segmented memory system, paged segment memory,
memorymanagement policies, High speed memories,
characteristics of cache memory, Cachememory organisation,
Block replacement policies, interleaved memories,
associatedmemories.

John P.
Hayes
8 Hr
5. System Organization: - Bus arbitration, Programmed I/O (IO
addressing, IO instruction),DMA (Types & procedures), interrupts
(procedure, interrupt selection, vectored interrupts),Concurrency
Control, System management.
John P.
Hayes
8 Hr

CS-402: Data Base Management Systems L:T:P ::3:1:2

Objective: The main objective of this course is to provide students with the background to
design, implement, and use database management systems. A variety of topics will be
covered that are important for modern databases in order to prepare the students for real
life applications of databases.
Prerequisite: Basic Concepts of Algebra
Unit-I [Text Book 1 and 2] (8 Hours)
Introduction: An overview of database management system, Database System vs. File
System, Database System Concept and Architecture, Data Models, Schema And Instances,
Data Independence And Database Language And Interfaces, Overall Database Structure.
Data modeling using the Entity Relationship Model:
ER model concepts, notation for ER diagram, mapping constraints, keys, Concepts of
Super Key, Candidate Key, Primary Key, Foreign Key, Generalization, Specialization,
Aggregation, Attributes Inheritance, reduction of an ER diagrams to tables, relationship of
higher degree.
Unit-II [Text Book 1] (8 Hours)
Relational data Model and Language: Relational data model concepts, Codds Rule,
Integrity Constraints, Entity Integrity, Referential Integrity, Keys constraints, Domain
constraints, Relational Algebra and Relational Calculus.
Introduction on SQL: SQL data type and literals. Types of SQL commands: DDL
commands (Create, Alter and Drop), DML commands (Insert, Update and Delete), SQL
operators and their procedure. Tables, Views and Indexes. Queries and Sub Queries.
Aggregate Functions. Joins, Unions, Intersection, Minus.
Unit-III [Text Book 1 and 2] (8 Hours)
Overview of PL/SQL, Cursors, Triggers, and Procedures.
Data Base Design & Normalization: Functional Dependencies, Inference Rules, Normal
Forms, First, Second, Third Normal Forms, BCNF, Inclusion Dependence, Loss Less Join
Decompositions, Normalization Using FD, MVD And Fourth Normal Forms, JD and Fifth
Normal Forms, Alternative Approaches to Database Design.
Unit-IV [Text Book 2] (8 Hours)
Transaction Processing Concept: Transaction System, Recoverability, Recovery From
Transaction Failures, Log Based Recovery, Checkpoints, Shadow Paging, Cascading
Rollback, ARIES, Testing of Serializability, Serializability of Schedules, Conflict & View
Serializable Schedule.
Introduction to Distributed Database, Multimedia Database and Object-Oriented Database.
Unit-V [Text Book 3] (8 Hours)
Concurrency Control Techniques: Concurrency Control, Locking Techniques for
concurrency control, Two-phase locking protocol, Deadlock Handling, Time stamping
protocols for concurrency control, Thomas write rule, validation based protocol, multiple
granularities, Multi version schemes, Recovery with concurrent transaction.
Overview of Big Data
Text Books
1. Korth, Silberschatz, Sudarshan, Database Concepts, 6
th
Edition, McGraw Hill Pub.
2. Elmasri, Navathe, Fundamentals of Database Systems, 6
th
Edition, Addison Wesley.
3. Ramkrishnan, Gehrke, Database Management System, 3
rd
Edition, McGraw Hill

Reference Books
1. Date C J, An Introduction to Database Systems, Addision Wesley
2. ONeil, Databases, Elsevier Pub.
3. Leon & Leon, Database Management Systems, Vikas Publishing House
4. Bipin C. Desai, An Introduction to Database Systems, Gagotia Publications
5. Majumdar & Bhattacharya, Database Management System, TMH
Web References
1. NPTEL Material at http://nptel.iitm.ac.in/video.php?subjectId=106106093
2. ISTE Workshop on DBMS, Video Lectures and Content available at
http://www.it.iitb.ac.in/nmeict/eVideos/DBMSMAIN/content/content.htm
l
Lab. CS-402P

Write the queries for Data Definition and Data Manipulation Language.

1. Write syntax for creating the following tables:
STUDENT (Roll_No, Name, Branch, Year, Section, Hostel, F_name, Address)
BOOK (Book_id, Title, Author, Publisher, Cost, Copies)
TRANSACTION (Roll_No, Book_Id, Date_Issue, Date_Return, Fine)
Add Primary Key and Foreign key to appropriate attributes in the above mentioned
tables. Add a constraint on Book table for accepting value in Copies attribute not less
than 0.
2. Write SQL command to add a new field DOB in the STUDENT table.
3. Write SQL command to drop Fine column from TRANSACTION table.
4. Insert at least 5 records in each table.
5. Update title of books from Database Management Systems to DBMS.
6. Delete all entries from the Hostel column of STUDENT table.
7. Write SQL Queries for the following:
(a) To display the details of all students
(b) Display the records of (a) in ascending order of Roll_No.
(c) To display all Networking Books in the Library
(d) To display those books which have Computer word in their title (like Computer
Fundamentals, Computer Graphics etc.)
(e) To display all the books which have been issued so far
(f) To display the books which have not been issued so far
(g) To display all the students of 4
th
year CSE branch who are staying in Hostel
(h) To display the students names who have not returned the books issued to them.
(i) To display the student names who have been issued DBMS book by Korth.
(j) To display the students who have not issued any book so far.
(k) To display the students who have been issued at least one book.
(l) To display the title of the second costliest book.
(m) To display the students who have not returned the book more than 6 weeks.
(n) To display the student names along with all the books issued to them.
(o) To display the students of IV year from CSE branch who have been issued
Graphics book(s) for more than 15 days, which have not been returned.

8. Create view to access the students details only from 4
th
year of CSE branch.

9. Create an index on Title column of BOOK Table.

10. Write PL/SQL program to display the name of the student of 4
th
year in CSE branch
whose Roll_No is 1005.

11. Write appropriate programme in PL/SQL for restricting user to enter the data in
BOOK table on Sunday and also beyond the working hours (say after 5 PM).

12. Write PL/SQL program to display 5 costliest books in the library.
Lecture Plan
Unit
No.
Lect.
No.
Lecture Contents Reference
I 1 Database System Concept & Architecture. Korth, Silberschatz,
Sudarshan, Database
Concepts, McGraw Hill

Elmasri, Navathe,
Fundamentals of Database
Systems, Addision Wesley
2 Data Model Schema & Instances.
3 Database System Versus File Processing System. Data
Independence
4 Database Language, DDL & DML Statements.
5 E-R Model Concept, Notation for E-R Model.
6 Mapping Constraints & Concepts of Keys.
7 Generalization & Aggregation.
8 Extended E-R Model.
II 9 DDL & DML Statements Using Constraints. Korth, Silberschatz,
Sudarshan, Database
Concepts, McGraw Hill

10 Relational data model concept, Constraints Key.
11 Relational Algebra & calculus, Tuple.
12 Characteristics of SQL & PL/SQL, Types of SQL Commands
& Operators, Tables, Views & Indexes
13 Assertions, Cursors
14 Triggers
15 Queries & sub Queries.
16 Joins, Unions, Minus.
III 17 Functional Dependencies Korth, Silberschatz,
Sudarshan, Database
18 Closure Set, Canonical Form, Key
19 Decomposition, Anomalies & Normalization. Concepts, McGraw Hill

Elmasri, Navathe,
Systems, Addison Wesley
20 Normal Forms based on Functional Dependency
21 Normal Forms based on Functional Dependency
22 Normalization using MVD& JD.
23 Normal Forms based using MVD& JD.
24 Alternative Approaches to Database Design.
IV 25 Transaction System.

Elmasri, Navathe,
Systems, Addison Wesley
26 Testing of Serializability.
27 Serializability of Schedules.
28 Recoverability, Recovery from Transaction Failure.
29 Checkpoints, Log Based Recovery
30 Shadow Paging, ARIES.
31 Distributed Database
32 Multimedia Database, Object-Oriented Database.
V 33 Concurrency Control Techniques.
Ramkrishnan, Gehrke,
Database Management
System, McGraw Hill

34 Locking based Techniques, 2PL, Deadlock
35 Timestamp-Ordering Protocol.
36 Validation Based Protocol.
37 Multiple Granularities.
38 Multi-version Time stamp Ordering Protocol.
39 Recovery with concurrent transaction
40 Introduction to Big Data

CS-403:Object Oriented Programming with C++ L:T:P ::3:1:2
PREREQUISITES
Students should be familiar with the basic discipline and the idea behind each of the main
programming paradigms.
OBJECTIVES
The objectives of this course are:
To understand and express the essential and interesting features of an application
in the complex real world, an object-oriented model is built around.
Familiarize with the development artifacts of object oriented systems.
Understand the principals of objects encapsulation, inheritance, and
polymorphism that form the foundation for object-oriented systems development.
Familiarize with object oriented programming environment. The programming
language specified is C++ that is one of the standard programming languages used
in the industry and also forms the base of all object oriented languages.
Introduction to the basic concepts of object oriented modeling.
To be familiar with the Unified Modeling Language (UML).It is an object-
oriented language for specifying, visualizing, constructing, and documenting the
artifacts of software systems, as well as for business modeling.

LEARNING OUTCOME
Develop an understanding of Object Oriented Systems.
Develop hands on expertise in C++.
Unit I
Object Modeling: structured approach versus Object Oriented Approach, Objects and
classes, links and association, generalization and inheritance, aggregation, abstract class,
multiple inheritance, metadata, candidate keys, constraints.
(Text Book 2-chpt3, 4, 5, Text Book 1-chpt 1, 2,3)
Dynamic Modeling: Events and states, operations, nested state diagrams and concurrency,
advanced dynamic modeling concepts, a sample dynamic model.
(Text Book 1-CH 5)
Unit II
Functional Modeling: Data flow diagram, specifying operations, constraints, a sample
functional model. OMT (object modeling techniques) methodologies, examples and case
studies to demonstrate methodologies, comparison of methodologies: OMT with SA/SD,
JSD. (Text Book 1-chpt 6, Text Book 2-chpt 16)
Modeling with UML: UML terminology, Introduction of Things, Relationships and
Diagrams of UML. (Ref. Book 1 chpt 9)(Text Book 1-chpt 5)
Unit III
Introduction: History of C++, Advantage, Need, C++ Program Structure. Classes and
objects: Class and Objects Creation, Constructors and Destructors, Access Specifiers, Inline
Functions, Default Function Arguments, Static keyword, Function overloading Arrays as
Class Member. Arrays of Object. String. The Standard C++ String Class. Operator
Overloading: Overloading Unary Operators. Overloading. Binary Operators.
(Text Book3 CH-7)
Unit -IV
Friend Functions, Friend Classes, Pointers and Class Objects: This Pointer, Pointers to
objects, Memory Management: New and Delete, Garbage collection Inheritance:
Concepts, Access Modifiers, Inheritance Types.
Polymorphism Concepts: Virtual methods, Compile time Polymorphism, Run time
Polymorphism.
(Text book 3, Text Book4)
Unit -V
Managing Console I/O operations: C++ stream classes, Managing unformatted and
formatted Console I/O operations, Managing output with manipulations
Streams and File I/O File streams, Streams with file handling, String streams, Built-in
streams.
Templates and Exceptions: Function Templates, Class Templates, Exceptions, throw () and
catch (), The Standard Template Library: Introduction Algorithms, Sequence Containers,
Iteators, Specialized Iteators, Associative Containers, Storing User- Defined Object, Function
Objects.
(Text Book 3, Text Book 4)

Text Books:
1. James Rumbaugh etal, Object Oriented Modeling and Design, PHI
2. Ivar Jacobson etal, Object Oriented Software Engineering: A Use Case Driven
Approach, Pearson Education
3. E. Balagurusamy, Object Oriented Programming with C++, TMH
4. Robert Lafore, Object Oriented Programming in C++, Techmedia Publication.
References:
1. Atul Kahate, Object Oriented Analysis & Design, TMH.
2. Yogesh Singh, Ruchika Malhotra,Object Oriented Software Engineering, PHI.
3. Herbert Sehlidt, The Complete Reference c++, TMH.
4. Schaum's Outline of Programming with C++, TMH.
Web References:
http://nptel.iitm.ac.in/courses/Webcoursecontents/IIScBANG/System%20Analysis%20and%20Design/pdf/PPTs/mod9.p
df
Lab CS-403P
Week Lecture 1 Chapter Lecture2 Chapter Lecture 3 Chapter Lab
Meeting
Week-1 Object
Modelling
Objects and
classes
links and
association
Text Book2
Ch-1,2
Text Book2
Ch-1,2
generalization
and
inheritance
Text Book1 CH
1,2,3
aggregation, abstract
class
Text Book1-
CH 1,2,3
Study of
Use Case
Diagram

Week-2
multiple
inheritance,
Text Book 1-
CH 1,2,3
Text Book 2-
chpt3, 4
metadata,
candidate
keys,
constraints
Text Book1
CH6, Text
Book2-CH 16
Dynamic Modelling:
Events and states,
operations
Text Book1CH
5
Study of
Sequence
Diagram

Week-3 Nested state
diagrams and
concurrency,
Text
Book1CH 5
advanced
dynamic
modelling
concepts
Text Book 1-
CH 5
Sample dynamic
model.
Text Book 1-
CH 5
advanced
dynamic
modeling
concepts
Week-4
Functional
Modelling:
Data flow
diagram
Text Book 1-
CH6, Text
Book2 CH 16
Specifying
operations,
constraints, a
sample
functional
model.
Text Book1
CH6, Text
Book2-CH 16
OMT (object modelling
techniques)
methodologies
Text Book1
CH6, Text
Book2 CH 16
Study of
State chart
Diagram

Week-5 Examples and
case studies to
demonstrate
methodologies
, comparison
of
methodologies
: OMT with
SA/SD, JSD.
Text Book1
CH6, Text
Book2 CH16
(refer to web
references)
Examples
and case
studies to
demonstrate
methodologi
es,
comparison
of
methodologi
es: OMT
with SA/SD,
JSD.
Text Book1-
CH6, Text
Book2-
CH16(refer to
web
references)
Modelling with UML:
UML terminology,
Ref. Book1
CH 9
Case
Studies
Week-6
Relationships
and Diagrams
of UML.
Ch-9
Ref:Book1
Testing
Object
Oriented
Systems:
Introduction
, State Based
testing.
(Ref. Book 2,
chpt 9)

Testing Object
Oriented Systems:
Introduction, State
Based testing

Ref. Book2,
chpt 9
Case
Studies
Week-7 Introduction:
History of C++,
Advantage,
Need, C++
Program
Text Book 4
CH-1
Text Book3
CH-5,Text
Classes and
objects: Class
and Objects
Creation
Text Book3-
CH6,Text Book
4 CH-6
Text
Constructors and
Destructors,
Access Specifiers,
Book3 CH-
4,Text Book4
CH-13

Creating
Classes,
Constructo
rs
,Destructor
s & Access
Assignments, Case Studies and Programs on the following are to be done in
the lab
Use Case Diagram
Sequence Diagram
Structure Book 4 CH-6 Specifier
Week-8 Inline
Functions,
Default
Function
Arguments

Text Book4
CH-11

Static
keyword,
Function
overloading
Text Book4
CH-7

Arrays as Class
Member
Arrays of Object

Text
Book3 CH-15

Inline
functions,
Static
Keyword,
Arrays of
objects
Week-9 String. The
Standard C++
String Class.
Text
Book3 CH-15

Overloading
Unary
Operators.
Text Book3
CH-7,
Text Book4
CH-8.

Overloading. Binary
Operators

Text Book3
CH-7,
Text Book4
CH-8.

Overloadin
g and
Friend
Keyword
Week-10 Friend
Functions,
Friend Classes,

Text Book
4,CH-11
Pointers and
Class Objects:
This Pointer,
Pointers to
objects
Text Book3
CH-9

Memory
Management: New
and Delete, Garbage
collection
Text Book3
CH-9.

Pointers
and
memory
manageme
nt
Week -11 Inheritance:
Concepts,
Access
Modifiers,
Text Book3
CH-8

Inheritance
Types.

Text Book3
CH-8

Polymorphism
Concepts: Virtual
methods, Compile time
Polymorphism, Run
time Polymorphism
Text Book 3
CH-9
Inheritance
Week-13
Managing
Console I/O
operations
C++ streams,
c++stream
classes ,
unformatted
I/O
Text Book 3
CH-10
Templates
and
Exceptions:
Function
Templates,
Class
Templates,
Exceptions,
throw () and
catch (),
Text Book3
CH-12,13
. Streams and File I/O
File streams, Streams
with file handling,
String streams, Built-in
streams
Text Book3
CH-10,11
Polymorphi
sm and File
Handling
Week-14 The Standard
Template
Library:
Introduction,
Algorithm,
Text Book3
CH-14.Text
Book CH-15.
Sequence
Containers,
Iteators,
specialized
iteators
Text Book3
CH-14.Text
Book CH-15.
Associative Containers,
Storing User- Defined
Object, Function
Objects.

Text Book3
CH-14.Text
Book4 CH-15.
Templates
and
Exception
Handling
Advanced dynamic modeling concepts
State chart Diagram
Creating Classes, Constructors ,Destructors & Access Specifier
Inline functions, Static Keyword, Arrays of objects
Overloading and Friend Functions
Pointers and memory management
Inheritance
Polymorphism and File Handling
Templates and Exception Handling

CS-404:Theory of Computation L:T:P ::3:1:2

Prerequisite: Discrete Structures.
Objective: Introduce concepts in automata theory and theory of computation, Identify
different formal language classes and their relationships, Design grammars and recognizers
for different formal languages, Prove or disprove theorems in automata theory using its
properties , Determine the decidability and intractability of computational problems.
Learning Outcome: On completion of this course, student should be able to-
1. Understand formal languages, grammars, automata and their relationships.
2. Able to design Finite Automata (FA) and understand the equivalence of DFA and
NFA and Regular Language.
3. Able to construct the equivalent DFA with the minimum number of states.
4. Determine whether a given language is regular (by constructing an automaton or with
the pumping lemma).
5. Clean a given grammar and transform a CFG into a normal form.
6. Design PDA for given CFL. Construct a PDA for a given context free grammar, and
vice versa.
7. Construct a Turing machine for given language.
8. Understand the concept of Undecidability.

Unit I
Introduction; Alphabets, Strings and Languages; Automata and Grammars, Deterministic
finite Automata (DFA)-Formal Definition, Simplified notation: State transition graph,
Transition table, Language of DFA, Nondeterministic finite Automata (NFA), NFA with
epsilon transition, Language of NFA, Equivalence of NFA and DFA, Minimization of Finite
Automata, Distinguishing one string from other, Myhill-Nerode Theorem .

Unit II
Regular expression (RE) , Definition, Operators of regular expression and therr precedence,
Algebraic laws for Regular expressions, Kleens Theorem, Regular expression to FA, DFA to
Regular expression, Arden Theorem, Non Regular Languages, Pumping Lemma for regular
Languages. Application of Pumping Lemma, Closure properties of Regular Languages,
Decision properties of Regular Languages, FA with output: Moore and Mealy machine,
Equivalence of Moore and Mealy Machine, Applications and Limitation of FA.

Unit III
Chomsky Hierarchy of Grammars: Type0, 1, 2 and 3 Grammars. Context free grammar
(CFG) and Context Free Languages (CFL): Definition, Examples, Derivation , Derivation
trees, Ambiguity in Grammar, Inherent ambiguity, Ambiguous to Unambiguous CFG,
Simplification of CFGs, Normal forms for CFGs: CNF and GNF, Closure properties of
CFLs, Decision Properties of CFLs: Emptiness, Finiteness and Membership, Pumping lemma
for CFLs,

Unit IV
Push Down Automata (PDA): Description and definition, Instantaneous Description,
Language of PDA, Acceptance by Final state, Acceptance by empty stack, Deterministic
PDA, Equivalence of PDA and CFG, CFG to PDA and PDA to CFG, Two stack PDA

Unit V (8 Hours)
Turing machines (TM): Basic model, definition and representation, Instantaneous
Description, Language acceptance by TM, TM as Computer of Integer Functions, Variants of
Turing Machine, Universal TM, Churchs Thesis, Recursive and Recursively Enumerable
Languages, Enumeration

Computability : Concepts, Introduction to complexity theory, Introduction to
Undecidability, Halting Problem, Post Correspondence Problem(PCP), Modified PCP

Text Books:
1. John E Hopcroft, Rajeev Motwani, Jeffrey D Ullman, Introduction to Automata
Theory, Languages and Computation, Pearson Education
2. Peter Linz, An Introduction to formal language and automata, Third edition, Narosa
Publication.

References:
1. Kamala Krithivasan, Rama R, Introduction to Formal Languages, Automata Theory
and Computation, Pearson Education
2. Martin J. C., Introduction to Languages and Theory of Computations, TMH
3. Papadimitrou, C. and Lewis, C.L., Elements of the Theory of Computation, PHI
4. K.L.P. Mishra and N.Chandrasekaran, Theory of Computer Science : Automata,
Languages and Computation, PHI
5. Cohen D. I. A., Introduction to Computer theory, John Wiley & Sons
3. John E Hopcroft, Jeffrey D Ullman, Introduction to Automata Theory, Languages
and Computation, Narosa Publication.
6.

Web References
1. www.nptel.iitm.ac.in/courses/106106049/
2. http://infolab.stanford.edu/~ullman/ialc.html
3. http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-045j-
automata-computability-and-complexity-spring-2011/lecture-notes/

Lab. CS-404P
Week-1 Introduction and
application,
Automata and
Grammars
Text-2-
Chapter-1
Deterministic finite
Automata (DFA)-Formal
Definition, Simplified
notation: State transition
graph, Transition table,
Text-1-
Chapter-2
DFA and Language of
DFA
Text-
1Chapter-2
Lab
Experiment-1
Week-2 Nondeterministic
finite Automata
(NFA), NFA with
epsilon
transition,
Language of NFA
Text-
1Chapter-2
Equivalence of NFA and
DFA
Text-1-
Chapter-2
Equivalence of
epsilon NFA and
DFA,
Text-1-
Chapter-2
Lab
Experiment-2
Week-3

Minimization of
Finite Automata
Text-1-
chapter-4
Distinguishing one string
from other, Myhill-
Nerode Theorem .

Reference
6 -
Chapter-3
Regular expression
(RE), Definition,
Operators of regular
expression and their
precedence,
Text-1-
chapter-3
Lab
Experiment-3
Week-4
Algebraic laws for
Regular
expressions,
Kleens Theorem
Text-1-
chapter-3
and
Reference 5
Regular expression to
FA, DFA to Regular
expression, Arden
Theorem,
Text-1-
chapter-3
and
reference -
4
Regular Languages,
Pumping Lemma for
regular Languages.
Application of
Pumping Lemma,
Text-1-
chapter-4
Lab
Experiment-4
Week-5 Closure
properties of
Regular
Languages,
Text-1-
chapter-4
Decision properties of
Regular Languages
Text-1-
chapter 4
FA with output:
Moore and Mealy
machine,
Reference -
1
Lab
Experiment-5
Week-6 Equivalence of
Moore and Mealy
Machine,
Applications and
Limitation of FA.

Reference-1 Context free grammar
(CFG) and Context Free
Languages (CFL):
Definition, Examples,
Text-2-
chapter-5
Derivation ,
Derivation trees,
Text-2-
chapter-5
Lab
Experiment-6
Week-7 Ambiguity in
Grammar,
Inherent
ambiguity,
Ambiguous to
Unambiguous
CFG
Text-2-
cahpter-5
Simplification of CFGs
Text-2-
chapter-6
Normal forms for
CFGs-CNF
Text-2-
chapter-6
Lab
Experiment-7
Week-8 Normal Form-
GNF
Text-2-
chapter-6
Reference 6
Closure properties of
CFLs, Decision
Properties of CFLs:
Emptiness, Finiteness
Text-2-
chapter-8
Pumping lemma for
CFLs
Text-2-
chapter-8
Lab
Experiment-8


1. Write a C program to generate strings up to length 15 with the indivisible symbols like {0,1},
{a, b}, {+,-}.
2. Write a C program which reads a program written in any programming language and then
perform lexical analysis. The output of program should contain the tokens i.e. classification
as identifier, special symbol, delimiter, operator, keyword or string. It should also display the
number of identifiers, special symbol, delimiter, operator, keyword, strings and statements.
3. Write a C program to check whether a given grammar is type-0, type-1, type-2 or
type-3.
4. Write a C program to convert NFA to DFA
5. Write a C program to convert NFA with epsilon moves to NFA
6. Write a C program that accepts any Context Free Grammar (use appropriate data
structure
to store CFG) and then print it in the proper format.
Chapter 4 and Membership
Week-9 Push Down
Automata (PDA):
Description and
definition,
Text-1-
chapter-6
Instantaneous
Description

Text-1-
chapter-6
Languages of PDA,
Acceptance by Final
state,
Text-1-
chapter-6
Lab
Experiment-9
Week-10 Acceptance by
empty stack
Text-1-
chapter-6
Deterministic PDA
Text-1-
chapter-6
Equivalence of PDA
and CFG, CFG to PDA
Text-1-
chapter-6
Lab
Experiment-
10
Week-11 PDA to CFG Text-1-
chapter-6
Two stack PDA Reference
5-chapter-
21
Turing machines
(TM): Basic model,
definition and
representation,
Instantaneous
Description,
Text-1-
chapter-8
Lab
Experiment-
11
Week-12 TM as accepter Text-1-
chapter-8
Language acceptance by
TM,
Text-1-
chapter-8
TM as Computer of
Integer Functions
Text-1-
chapter-8
Lab
Experiment-
12
Week-13 Variants of Turing
Machine
Text-2-
chapter-10
Universal TM, Turing
Churchs Thesis

Text-1-
chapter-9
Recursive and
Recursively
Enumerable
Languages,
Enumeration
Text-1-
chapter-9
Lab
Experiment-
13
Week-14 Computability :
Concepts,
Introduction to
complexity theory,
Introduction to
Undecidability,
Text-1-
chapter-9
Halting Problem

Text-1-
chapter-9
Post Correspondence
Problem(PCP),
Modified PCP,
Text-1-
chapter-9
Lab
Experiment-
14
7. Write a program to remove NULL productions from a given CFG
8. Write a program to remove UNIT productions from a given CFG
9. Write a program to remove useless symbols from a given CFG
10. Write a C program to convert CFG to CNF
11. Write a C program to convert CFG to GNF
12. Write a program for recognition of a given string using CKY algorithm. Use a
subprogram for generation of string (*) of various length. (Length u to 8 and * of 0,1).
13. Write a C program to convert PDA to CFG
14. Write a C program to convert CFG to PDA

Mahamaya Technical University,: Noida

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Mahamaya Technical University,: Noida

Uploaded by

Copyright:

Available Formats

MAHAMAYA TECHNICAL UNIVERSITY,

You might also like