Syllabus 15 New

8/10/2019 Syllabus 15 New

1/49

PG DEPARTMENT OF COMPUTER SCIENCE

Sem Part Sub Code Title of the Paper

III

I 14GT3GS03 Tamil

II 14GE3GS03 English

III 14CS3MC05 Programming in .Net

III 14CS3MC06 Computer rgani!ation an" #r$hite$ture

III 14CS3#C03 ptimi!ation Te$hni%ues

III 14CS3CP05 Programming in .Net & 'a(

I) 14CS3NE01 *e( +esigning 'a( ,,

I) 14C#3S-#1 #nimation 'a(,,

IV

I 14GT4GS04 Tamil

II 14GE4GS04 English

III 14CS4MC0 Programming in /aaIII 14CS4CE1# +ata Stru$ture an" Computer #lgorithm

III 14CS4CE1 Compiler +esign

III 14CS4#C04 Computer Graphi$s

III 14CS4CP06 Programming in /aa & 'a(

I) 14CS4NE02 ) S$ript 'a( ,,

I) 14C#4S-#2 Computer Graphi$s 'a( ,,

V

III 14CS5MC0 /aa Serer Pages /SP7

III 14CS5MC08 9elational +ata(ase Management S:stem

III 14CS5MC10 So;toli"a:s7

VI

III 14CS6MC11 Computer Net


2/49

PROGRAMMING IN NET

SEM !III "OURS ! 4

CODE ! 14CS3MC05 CREDITS ! 4

O#$ECTIVES

o To proi"e the (asi$ ?no


3/49

UNIT IV %1 "our'

Creati-. Me-u'! An"erstan"ing Menu eatures @ Creating Menus @ ConteBt

Menus. Debu..i-. a-d Error "a-dli-.! Ma=or Error T:pes @ +e(ugging @

Error >an"ling. Creati-. (i-do+' Form' U'er Co-trol'! *in"o


4/49


5/49

UNIT V %& "our'

I-put B Output Or.a-iatio-!Peripheral +ei$es & Input&utput Inter;a$e &

Mo"es o; Trans;er & Priorit: Interrupt& +ire$t Memor: #$$ess. Memor/

Or.a-iatio-! Memor: >ierar$h: & Main Memor:uBiliar: Memor:&

#sso$iatie Memor: & Ca$he Memor:&)irtual Memor:.

TE5T #OO6

FComputer S/'tem Ar)hite)ture III E"ition M. Morris Mano Prenti$e

>all o; In"ia Priate 'imite" Ne< +elhi 2011.

U-it I Chapter ! 1

Pg. No. 1& 40U-it II Chapter' ! 2 3

Pg. No. 41&656&82

U-it III Chapter' ! 5

Pg. No. 125&13141&168

215&241

U-it IV ! Chapter' ! 8

Pg. No. 243&300301&31

321&334

U-it V ! Chapter' ! 11.1&11.2 11.4&11.6 H 12

Pg. No. 33&383404&42244&4

REFERENCE #OO6S

1. FComputer Or.a-iatio- i;th E"ition ).Carl >ama$her on?o

G.)ranesi$ Sa;a:es M$Gra< >ill

International E"itions Thir" E"ition 188.


6/49

PROGRAMMING IN NET 3A#

SEM !III "OURS ! 2J1

CODE ! 14CS3CP05 CREDITS ! 2

1. Simple Pro.ram' u'i-. Co-trol'

i7 #rithmeti$ perations.

2. Number Che),i-.

i7 Prime No Per;e$t No #rmstrong No

3. Number Serie' Ge-eratio-

i7 Sum o; Series i(nona$$i Series

4. String Manipulation

5. +ate an" Time un$tion6. +esign a S$ienti;i$ Cal$ulator program using Control #rra:.

. Sorti-. Pro.ram'

i7 Num(er Sorting

ii7 String Sorting

. Simple program using Mouse Control

8. +esign a Dui! program

10. Tra;;i$ $ontrol signal using Timer Control

11. +esign a TeBt E"itor Program.

12. #ppli$ation using Menu E"itor an" M+I.

13. +esign a Program ;or Ele$tri$it: ill Preparation.

14. +esign a program ;or CI# 9e$or" Preparation.

15. Pa:roll pro$essing using +# Control.

16. Stu"ent +ata(ase Creation using 'E+.

1. Mi$roso;t 9eport Creation.

1. Cr:stal 9eport Creation.


7/49

(E# DESIGNING

SEM !III "OURS ! 2

CODE ! 14CS3NE01 CREDITS ! 2

1. *or?ing


8/49

* D ANIMATION 3A#

SEM !III "OURS ! 2

CODE ! 14C#3S-#1 CREDITS ! 2

1. *or?ing


9/49

PROGRAMMING IN $AVA

SEM !I) "OURS ! 4


O#$ECTIVES

To intro"u$e the (=e$t riente" Programming prin$iples through the

plat;orm in"epen"ent.

'earn the /aa Programming language its s:ntaB patterns an" st:les.

'earn the essentials o; =aa $lass li(rar:.

UNIT I %1 "our'

Fu-dame-tal' of Obe)tOrie-ted Pro.rammi-.! Intro"u$tion& (=e$t&

riente" Para"igm& asi$ Con$epts o; P @ ene;its o; P @ #ppli$ations

o; P @ O4er4ie+ of $a4a 3a-.ua.e! Intro"u$tion&Simple /aa Program @

More o; /aa @ #n #ppli$ation *ith T


10/49

UNIT III %1 "our'

Cla''e'9 Obe)t' a-d Method'! Intro"u$tion +e;ining # Class @ iel"s

+e$laration @ Metho"s +e$laration @ Creating (=e$ts @ #$$essing Class

Mem(ers @ Constru$tors @ Metho"s erloa"ing @ Stati$ Mem(ers @ Nesting o;

Metho"s @ Inheritan$e EBten"ing a $lass @ erri"ing Metho"s @ inal

)aria(les an" metho"s @ inal Classes @ inali!er Metho"s @ #(stra$t Metho"s

an" Classes @ Metho"s an"ling Co"e @ Multiple Cat$h

Statements & Asing inall: Statement @ throo< #pplets +i;;er rom #ppli$ations &

Preparing to TM' Tags @

+ispla:ing Numeri$al )alues @ Getting Input ;rom The Aser&Eent >an"ling.

Ma-a.i-. I-putOutput File' I- $a4a! Intro"u$tion &Con$ept o; Streams @


11/49

Stream Classes @ :te Stream Classes @ Chara$ter Stream Classes @ Asing

Streams @ ther Ase;ul IO Classes @ Asing the ile Class @ InputOutput

EB$eptions @ Creation o; iles @ 9ea"ingO*riting Chara$ters @ 9ea"ingO*riting

:tes @ >an"ling Primitie +ata T:pes @ Con$atenating an" u;;ering iles @

9an"om #$$ess iles @ Intera$tie Input an" output @ ther Stream $lasses.

TE5T #OO6

7Pro.rammi-. (ith $AVA A Primer89 E. alagurusam: Tata M$Graill

Pu(lishing Compan: 'imite" Ne< +elhi i;th E"ition.

U-it I ! Chapter' ! %9 :9 ;

Pg. No. 1&823&3438&4546&61

U-it II ! Chapter' ! 19 ?9 amiltonian

C:$les & -napsa$? Pro(lem.

UNIT V %* "our'

#RANC" AND #OUND The Method !'east Cost 'C7 Sear$h &The 15&

pu!!le#n EBample & Control #(stra$tions ;or 'C&Sear$h & oun"ing & I

ran$hn"&oun" @ 'C ran$hn"&oun" & Tra4eli-. Sale' Per'o-

TE5T #OO6

8Fu-dame-tal' of Computer Al.orithm'8 Ellis >oro


14/49

COMPI3ER DESIGN

SEM !I) "OURS ! 4

CODE ! 14CS4CE1 CREDITS ! 3

O#$ECTIVES

o To gie a (asi$ ?no


15/49

UNIT IV %* "our'

I-termediate Code Ge-eratio- ! )ariants o; S:ntaB Trees @ Three a""ress

$o"e @ T:pes an" "e$larations @ translations o; eBpressions @ t:pe $he$?ing @

$ontrol ;lo< @ (a$?pat$hing @ S


16/49

COMPUTER GRAP"ICS

SEM !III "OURS! 5

CODE ! 14CS4#C04 CREDITS! 4

O#$ECTIVESo To gie a (roa"er un"erstan"ing o; the (asi$s o; graphi$al "ei$es an"

#ppli$ation areas an" to implement the pro$ess o; algorithms an" to

illustrate the graphi$s appli$ations.

o To eBplore the ;eatures o; P>IGS an" P>IGSJ ;un$tions in the C Programs.

UNIT I %1 "our'

A Sur4e/ of )omputer Graphi)'! Computeri"e" "esign @ Presentation

Graphi$s @ Computer #rt @ Entertainment @ E"u$ation an" Training @)isuali!ation @ Image Pro$essing @ Graphi$al user Inter;a$e & O4er4ie+ of

Graphi)' S/'tem'! )i"eo +ispla: +ei$es @ 9aster S$an S:stems @ 9an"om

S$an S:stems @ Graphi$s Monitors an" *or?stations & Input "ei$es &

>ar"$op: +ei$es & Graphi$s So;tomogeneous Coor"inates & Composite Trans;ormations&ther

Trans;ormations @ Trans;ormations et


17/49

UNIT IV %1 "our'

T+oDime-'io-al Vie+i-. ! The )ieierar$hi$al Mo"eling


18/49

% 7Computer Graphi)'8(: Chenna?esaa 9. #laala P>I 'earning Priate

'imite" Ne< +elhi 2008.

* 7Computer Graphi)' Pri-)iple' H Pra)ti)e (: /ames +. ole: #n"ries

)an +am Steen -. einer /ohn . >ughes Se$on" E"ition in C Pearson

E"u$ation 2008.


19/49

PROGRAMMING IN $AVA 3A#

SEM !I) "OURS ! 3


% Pro.ram' u'i-. 'imple )la''

1.1 Num(er Che$?ing Prime Per;e$t Palin"rome #rmstrong #"am7

1.2 Num(er Generation Prime Per;e$t Palin"rome i(ona$$i7

* Pro.ram' u'i-. Arra/' a-d )o-trol 'tru)ture'

2.1 Num(er Sorting an" Sear$hing

2.2 MatriB Manipulation #""ition Su(tra$tion Multipli$ation an"

Transpose7

2.3 Sta$? an" Dueue operations.: Pro.ram' u'i-. Co-'tru)tor' a-d Method o4erloadi-.

3.1 Ele$tri$it: ill preparation

3.2 CompleB Num(er operation

; Pro.ram' u'i-. Stri-. Method'

4.1 String Sorting an" Sear$hing

4.2 Program using string metho"s

1 Pro.ram' u'i-. I-herita-)e

5.1 Sta;; in;ormation S:stem

5.2 9ail


20/49

V# SCRIPT

SEM !I) "OURS ! *

CODE ! 14CS4NE02 CREDITS ! 2

1. +ispla:ing +ate an" Time.

2. #rithmeti$ operation.

3. Program using "e$ision ma?ing statements

4. Program using 'oops or +o 'oop +o *hile7.

5. Program using sele$tion statement.

6. Program using ;un$tions.

. Program using ;orms. Program using ;rames.

8. Num(er generation o"" een i(ona$$i prime an" palin"rome7

10. Multipli$ation Ta(le $reation using )S$ript.

11. String Manipulation.

12. )ali"ating ;orm elements.


21/49

GRAP"ICS 3A#

SEM !I) "OURS ! *

CODE ! 14CS4S-#2 CREDITS ! 2

3i-e

1. Program to "ra< a 'ine using ++# 'ine #lgorithm

2. Program to "ra< a 'ine using resenhams 'ine #lgorithm

Cir)le

3. Program to "ra< a Cir$le using

a. Mi" & Point Cir$le #lgorithm

(. resenhams Cir$le #lgorithm

$. +ire$t #lgorithm

4. Program to "ra< a Cir$le haingChanging its Color an" +esign

Ellip'e

5. Program to "ra< an Ellipse using

a. Mi" & Point Ellipse #lgorithm

(. +i;;erent Colours

$. Shout

10. Program to Ma?e a -ite

11. Program o; 9oa" #nimation

12. Program o; S$aling Trans;ormation

13. Program to Moe a Person

14. Program o; Translation Trans;ormation


22/49

$AVA SERVER PAGES

SEM !) "OURS ! 5


O#$ECTIVES

o To intro"u$e the (asi$ $on$epts o; /aa Serer Pages

o To impart programming s?ills in serer&si"e /aa appli$ation "eelopment

an" "eplo:ment.

UNIT I %1 "our'

I-trodu)tio- to Ser4let'! Serlet 'i;e$:$le& EBample& Serlet Classes&

Threa"ing Mo"els&>TTP Sessions. $SP O4er4ie+! >o< /SP o< Tag >an"lers


23/49

UNIT V %1 "our'

Databa'e A))e'' +ith $D#C! erie< o; /+C& /+C +riers&

Conne$ting to a +ata(ase ans ergsten 9eill: Shro;; Pu(lishers H

+istri(uters Pt 't" Thir" E"ition.


24/49

RE3ATIONA3 DATA#ASE MANAGEMENT SSTEM

SEM !) "OURS ! 5

CODE ! 14CS5MC08 CREDITS !5

O#$ECTIVES

o To gie a "eep ?noistor: o; SD' & Chara$teristi$s o; SD'& #"antages o; SD'& SD' in #$tion&

SD' +ata t:pes an" 'iterals & T:pes o; SD' Comman" & SD' perators &

#rithmeti$ perators & Comparison perators & 'ogi$al perators & Set


25/49

perators & perator Pre$e"en$e. Table'9 Vie+' a-d I-de0e' 2uerie' a-d

Sub 2uerie'

UNIT IV %1 "our'

A..re.ate Fu-)tio- Intro"u$tion&General 9ules& CANT7 an"

CANT,7&SAM7)G7&M#7 an" MIN7. I-'ert9 Update a-d Delete

Operatio-' & Cur'or'! Intro"u$tion&Cursor perations&Cursor Positions&

Cursor Co"ing Gui"elines. $oi- a-d U-io-'! /oins&Anions. Pro.rammi-.

+ith S23 Intro"u$tion& Duer: Pro$essing & Em(e""e" SD'& +:nami$ SD'.

Tri..er'! Intro"u$tion& Triggers & T:pes o; Triggers & Trigger s:ntaB&

Com(ining Trigger T:pes& Setting Inserte" )alues&+isa(ling an" Ena(ling

Triggers&9epla$ing Triggers&+ropping Triggers"antages an" 'imitations

o; Triggers.

UNIT V %1 "our'

Databa'e Se)urit/ Intro"u$tion +ata(ase Enironment & +ata Se$urit:

9is?s @ CompleB user management re%uirements & +imensions o; +ata(ase

Se$urit: +ata Se$urit: 9e%uirements +ata(ase Asers @ Prote$ting the "ata


26/49

. U-it V ! Chapters 2 2 28 30

P. No. 53 & 63

REFERENCE #OO6S

1. 7Data #a'e S/'tem Co-)ept'8 B#(raham Sill(erS$hat! >en"r: . -orth S.

Sun"rashan 5th E"ition The M$Graill Companies 2006.

2. 7Data #a'e Ma-a.eme-t S/'tem8 B 9a?esh saini M.M.S.9authan #(ha:

SaBena in"u sharma )a:u E"u$ation o; In"ia irst E"ition 2010.


27/49

SOFT(ARE ENGINEERING

SEM !) "OURS ! ;


O#$ECTIVES

o To impart so;t


28/49

UNIT V %1 "our'

Soft+are Mai-te-a-)e! Enhan$ing Maintaina(ilit: +uring +eelopment&

Managerial #spe$ts o; So;till International E"ition 20069eprint 2013.


29/49

OPERATING SSTEM

SEM !) "OURS ! ;

CODE ! 14CS5CE2# CREDITS ! 3

O#$ECTIVES

o To gie a "eep ?no


30/49

UNIT V %1 "our'

File Ma-a.eme-t! erie< @ ile rgani!ation an" #$$ess @ &Trees & ile

+ire$tories @ ile Sharing @ 9e$or" lo$?ing. Computer Se)urit/ Threat'!

Computer Se$urit: Con$epts @ Threats #tta$?s an" #ssets @ Intru"ers @

Mali$ious So;t


31/49

SOFT(ARE PRO$ECT MANAGEMENT

SEM !) "OURS ! ;

CODE ! 14CS5CE2 CREDITS ! 3

O#$ECTIVES

To un"erstan" the $on$epts o; So;t


32/49

EBtreme programming P7& S$rum & Managing iteratie pro$esses & Sele$ting

the most appropriate pro$ess mo"el

UNIT III

Soft+are Effort E'timatio- Intro"u$tion & *here are estimates "oneL &

Pro(lems


33/49

TE5T #OO6

7Soft+are Proe)t Ma-a.eme-t8 o( >uges Mi?e Cotterell 9a=i( Mall i;th

e"ition Tata M$Gra< >ill E"u$ation Priate 'imite" Eighth reprint 2013.

U-it I ! Chapter' ! %9 * %%%%19*%*%:J

Pg. No. 1&44

U-it II ! Chapter' ! :9 ; :%:%%9 ;%;%=J

Pg. No. 4&66 6&84

U-it III ! Chapter' ! 19 ? 1% 1%19 ?% ?%?J

Pg. No. 8&11126&153

U-it IV ! Chapter' !


34/49

$AVA SERVER PAGES 3A#

SEM !) "OURS ! 1


1. Simple Serlet Program

2. Simple /SP program TM'

3. Simple /SP TM'

4. +ispla:ing +:nami$ Message


35/49

RD#MS 3A#

SEM !) "OURS ! 1


1. *or?ing


36/49

* D ANIMATION 3A#

SEM !III "OURS ! 2

CODE ! 14C#5S-03 CREDITS ! 2

1. *or?ing


37/49

SOFT(ARE TESTING

SEM !) "OURS !

CODE ! 14CS5SS01 CREDITS ! 2

O#$ECTIVES

o To improise the So;to< to "o la$? oB Testing .

UNIT III

I-te.ratio- Te'ti-.@ *hat is Integration Testing @ Integration Testing as a

t:pe o; Testing @ Integration Testing as a phase o; Testing @ S$enario Testing @

+e;e$t ash. Performa-)e Te'ti-. Metho"olog: ;or Per;orman$e Testing @

Tools ;or Per;orman$e @ Pro$ess ;or Per;orman$e Testing

UNIT IV

S/'tem a-d A))epta-)e Te'ti-. S:stem Testing erie< @ un$tional

S:stem Testing @ Non @ un$tional Testing @ #$$eptan$e TestingRe.re''io-

Te'ti-.! 9egression Testing& T:pes o; 9egression Testing&*hen to "o

9egression TestingL&>o< to "o 9egression TestingL & est Pra$ti$es in

9egression Testing.


38/49

UNIT V

Or.a-iatio- Stru)ture' for Te'ti-. Team' +imensions o; rgani!ation

Stru$tures @ Stru$tures in Single @ Pro"u$t Companies @ Stru$tures ;or Multi&

Pro"u$t Companies @ E;;e$ts o; Glo(ali!ation an" Geographi$all: +istri(ute"

Teams on Pro"u$t Testing @ Testing Seri$es rgani!ations @ Su$$ess a$tors

;or Testing rgani!ation.

TE5T #OO6

% 7Soft+are Te'ti-. Pri-)iple' a-d Pra)ti)e'89 Sriniasan +esi?an an"

Gopalas


39/49

COMPUTER NET(OR6S

SEM !)I "OURS ! 1


O#$ECTIVES

o To gie a


40/49

UNIT V %1 "our'

The Appli)atio- 3a/er! +NS The +omain Name S:stem7 @ Ele$troni$ Mail

@ The *orl" *i"e *e(@ Multime"ia. Net+or, Se)urit/! Cr:ptograph: @

S:mmetri$ ?e: #lgorithms & Pu(li$ ?e: #lgorithms @ +igital Signatures @

Management o; pu(li$ ?e:s @ Communi$ation Se$urit:.

TE5T #OO6

% F Computer Net+or,' @ #n"re< S. Tanen(aum Pearson Prenti$e >all

#n imprint o; Pearson E"u$ation an" +orling -in"ersle: In"ia7 Pt

'imite" ourth E"ition 2008.

UNIT I ! Chapter 1 1.1 @ 1.67P. No ! %


41/49

DATA MINING

SEM !)I "OURS ! 1


O#$ECTIVES

To proi"e a soli" ;oun"ation on (asi$ $on$epts an" re$ent tren"s in

+atamining.

To gie a (asi$ ?noierar$hies & #ggregate un$tion &'#P perations&

'atti$e o; Cu(oi"s& '#P Serer& 9'#P&M'#P.

UNIT II %1 "our'

Data Mi-i-. ! Intro"u$tion& "ata mining& +ata mining "e;initions&-++ s.

+ata mining @ +MS s. +M @ ther relate" #reas& +M Te$hni%ues& ther

mining pro(lems&Issues an" $hallenges in +M&+M #ppli$ation #reas &+M

#ppli$ations $ase stu"ies. A''o)iatio- Rule'! Intro"u$tionsso$iation rule &

Metho"s to "is$oer asso$iation rulespriori #lgorithm& Partition #lgorithm&Pin$er&Sear$h #lgorithm&+:nami$ Itemset Counting #lgorithm&P&tree

Gro


42/49

UNIT V %1 "our'

(eb Mi-i-. Intro"u$tion&*e( mining&


43/49

MO#I3E COMPUTING

SEM !)I "OURS ! 4


O#$ECTIVES

o To un"erstan" the (asi$ $on$epts o; ne< operating s:stems.

o To un"erstan" the $on$epts o; Mo(ile #"&>o$ an" *ireless Sensor

Netopping Sprea" Spe$trum& >igh Spee" Pa$?et #$$ess 3G

Neto$

Net


44/49

+istri(ute" Net


45/49

C3OUD COMPUTING

SEM !)I "OURS ! 4

CODE ! 14CS6CE3# CREDITS ! 3

O#$ECTIVES

o To impart Clou" Computing s?ills su$h as +eeloping ur


46/49

TE5T #OO6

1. FCloud Computi-. ! (eb ba'ed Appli)atio-' That )ha-.e the (a/

ou (or, a-d Collaborate O-3i-e Mi$hael Miller Pearson

E"u$ation 200.

U-it I ! Chapters 1 2 3

Pg. No. 5 & 4

U-it II ! Chapters 4 5 6

Pg. No. 48 &1

U-it III ! Chapters 81011

Pg. No. 5 &164

U-it IV ! Chapters 12 13 14 15 16 1

Pg. No. 65 & 243

U-it V ! Chapters 18 20

Pg. No. 245 & 24

REFERENCE #OO6S

1. 7Cloud Computi-.! A Pra)ti)al Approa)h89 )elte T. #nton: )elte /.

To(: Elsenpeter 9o(ert Tata M$Gra< @ >il 2010

2. 7Cloud Computi-. B Pri-)iple' a-d Paradi.m'89a=?umar u::a

/ames ro(erg #n"r!e= Gos$ins?i *ile:& In"ia Pt. 't". 2013.

3. 7Cloud Computi-. #ible8arrie Sosins?: *ile:& In"ia Pt. 't" 2013.


47/49

INFORMATION SECURIT

SEM! )I "OURS! 5

CODE! 14CS6CE2 CREDITS! 4

O#$ECTIVES

o To prote$t in;ormation ;rom ha$?ers is an art in the ;iel" o; Computer

S$ien$e.

o This su(=e$t istor: o;

In;ormation Se$urit: @ Se$urit: @ CNSS Se$urit: Mo"el @ Components o; an

In;ormation s:stem @ alan$ing In;ormation Se$urit: an" #$$ess @

#pproa$hes to In;ormation Se$urit: Implementation & The S:stems

+eelopment 'i;e C:$le @ The Se$urit: S:stems +eelopment 'i;e C:$le @

(h/ Se)urit/ i' -eeded !Intro"u$tion @ usiness Nee"s irst @ Threats

#tta$?s @ Se$ure So;t


48/49

UNIT IV %1 "our'

Se)urit/ Te)h-olo./ Pre4e-tio- S/'tem'9 I-tru'io- Dete)tio- a-d Other

Se)urit/ Tool'!Intro"u$tion @ Intrusion +ete$tion an" Preention S:stems @

>one: Pots >one: Nets an" Pa""e" $ell S:stems & S$anning an" #nal:sis

Tools @ iometri$ #$$ess Controls..

UNIT V %1 "our'

U'i-. E-)r/ptio- ! Intro"u$tion @ un"amentals o; Cr:ptolog: & Cipher

Metho"s & Cr:ptographi$ #lgorithms & Cr:ptographi$ Tools @ Proto$ols ;or

Se$ure Communi$ations @ #tta$?s on Cr:ptos:stems.

TE5T #OO6

1. FPri-)iple' of I-formatio- Se)urit/ @ Mi$hael E. *hitman an"

>er(ert /. Mattor" ourth E"ition .Cengage 'earning In"ia Priate 't"Ne< +elhi 2014.

UNIT I ! Chapters 1 2

Pg. No. 1 @ 28 3 & 5

UNIT II ! Chapter 4

Pg. No. 115 @ 166

UNIT III ! Chapters 5 6

Pg. No. 16 @ 236 23 &28

UNIT IV ! Chapter

Pg. No. 21 &336

UNIT V ! Chapter

Pg. No. 33 & 32

REFERENCE #OO6S

% 7I-formatio- Se)urit/ B Theor/ a-d Pra)ti)e8+hiren 9. Patel Prenti$e

>all o; In"ia Priate 't" Ne< +elhi Eastern E$onom: E"ition 200.

* 7I-trodu)tio- to Computer Se)urit/89 Matt ishop Pearson E"u$ation

+orling -in"ersle: In"ia7 Pt. 't" irst E"ition 2011.


49/49

(E# DESIGNING USING OPEN SOURCE B 3A# P"PJ

SEM !)I "OURS ! 2

CODE ! 14CS6S-04 CREDITS ! *

% Creating simple P

* Ase o; $on"itional statements in P>P

: Ase o; looping statements in P>P

; Creating "i;;erent t:pes o; arra:s

1 Asage o; arra: ;un$tions

? Creating user "e;ine" ;un$tions

P

> Creation o; sessions

%& Creation o; $oo?ies

%% Creating simple appli$ations using P>P

%* )ali"ating input

%: ormatting the output.

%; +ata(ase $onne$tiit: in P>P

Syllabus 15 New

Documents

Transcript of Syllabus 15 New