D e t a i l e ds y l l a b u sM .

S c C S 2 0 0 8 - 0 9 ,b a s e do n t h e d e c i s i o nt a k e n b y B O S , C o m p u t er S c i e n c eA' P S t i '
i J t 0 l / 1 4 . 0 8 . 0 8 , Ivni e w o f t h e g u i d e l i n e iss s u e db y M . P , H i g h e rE d u c a t i o nC o m n t i s s i o n .

DEPARTMENT OF COMPT]TERSCIENCIi

A.P.S.UNIVERSITY,REWA, M.P.
SvllabusFor

M.Sc. in ComputerScience
, n d e r S e l fS u p p o r t i n g )
( T w o y e a r ,F o u r S e m e s t eFr u l l t i m eC o u r s e U

2008-09
Onwards

, w n e r e 'e' r n e c e s s N'r . |
S u b j e ctto t h c a p p r o v a lo f h i g h e r b o d i e sa f t e r d u e a m e n d t n e n itn t h e o r d i n a n c e
 Lducstton L r r r r rr r rr - -- '
lssueo D\ .1l'f ' Htgher
vr rrrc gulu€llllcs

' ena ()l'P')

A ' P ' S 'U n i v e r s i t l 'R
D e p a r t m e not f C o m p u t e rS c i e n c e '
at a glance
f o r M . S c i n C o m p u t e rS c i e n c e
Curriculum
r l 'rr' :-!
S e s s i o n2 0 0 8 - 2 0 0 9
ol Pgte'
Nomonclature
(fh I)tac)

N4S ? 0 ( 2)4
r S c i e n c eI fviathenratt cs
\ls( \-11)l M a t h e m a t i c sf b L t n d a totn

\lS( S-102 S Y S t e mA r c h l t e c t u r e

\ {er'\-lnl LrsinC
D a t aS t r u c t u r e g

D B M S ( D a t aB a s e M
, \ , 1 S r ' s1-0 4
\.1\('s-lfs NLrntcricM
a le t h o d s 10(15)
Scqf!)r x!9-!!03
il-bu,e,tonrv1 l 0 ( i - sI
\ 1 S rS - 1 0 ( ) " ( ) (. l5 )
C ' S1 0 5
S , ' Wl . a b l l l e m s b a s e co in M S c C S 1 0 4 1M S c
I \ 1 S (s - l 0 r
r \'1S(S- I ()lJ

SvstemSo{lrvare l 0 i 1{ ) )
ri^.'s-x'D Softrvare[:ngtneerl 70(24)
ObrectOrientcdPrograt-trm 1(l(24
) r0(I o) i00
\ 1 S (\ - l ( \ 4 r e t uo r l
( l o m p u t eN r0rI1l l { ) rl ( l ) i00
\ J . a t t t et 1 P r r rg r a t t tl t lt t t 10/l5) 100
li)(l5r
\ \\ l.ah fr'1Se (- \
\ 1 S r\ - 2 0 6 . - -(t(
l5 l r()ll5)
\t { \ -rr'
\.1\( \-lf)' : \ \ l . r l . l \ - n r , , i ^ l t ' r l r u ' c ' l' l r \ l

\ l\r \ ill! , { n o l i c a t i o nP r o l e c t

M S C S ( I ' Ilud js!s$s! 1O(21) r 0 (I o ) rjg

. 1 \ t\ - l l r I I I 0 (l ( ) ) 100
i 0 ( 2 4)
.. :r :-l(l-l ( ' o n t p t l t e r( i r a P h l c s 3 ( )l(0 ) r00
70(2,1)
l\l \ li'l lar.r Prrrgranttrttn 1 0 (2 4 I l i ) (l ( ) ) l0()
1 rl - 1lrl r

" ( ) ( l 1) *'l l0()

I0()
iirl{ '\ r l.-conln)crcc
70(24) r 0 {I 0 l
I.Jlgttal lnlagc rlultr5f rrrE' Il)(1
t".- l i l 5 1f l )
70(24) r0(10)
\ 1 s (S - i ( 1 5 )( L . { d r a r c c d C o : " n n u t L 'Ar r c h i t c t : t t r c l0(io) i ()0
7 0 (2 4)
-11T0-
\1\( \--i{l!1{)I Bro-tnfontlatte\ -
70(24) +rxt0-r- -
vfst+^]1)1l]i_ l0(I 5) 100
70(15)
vt ru u '
S i \ \ l - a h ! - p r o b l en r s b a s e c ot t t "'' r0(15) I 100
-U!)-'o! b a s e d o n M S c C S 30l
70(35)
v s (s - . 1 0 ' S u Lab \ l-problems I s(t'

\'1\( \- l(lR Application['ro1cc1

fionrlndustry)
( 5tx M o n t h r e a llil'e f']ro.1ect
ivla.lorPro.ject
& 207' -191I tug-ugg
for Presentation
t Reportln J0o.,n
( * 50o/ofor Pro ( l r a n d T o t a l o f m a r k s= J 0 0 0

p y 4 1 r 1 1l o N .
( ( I ( o N l l N t l o t j s( - ( ) M P R I l . l t : N S l V t 'l
t i o R l Cl S \r B l F ' (
H t r o I t YA N t )P R A C l ' l A
l l -P A S S I N R
I N I ) I V I I )l A (i IQLilRt]t)

necessarr
i n t h e o r c l i n a n c e' r v h e r e v e r
b o d i e sa f t e r d u e n n r e n d n t e n t
S r r b l e c tr o t h e a p p r o r a l o f h i g h e r r1
I
\i

l'-

{l
.\ /r)\.
I
,,'..U"t'
$i'r Wfu'^L
 ' t a i l e ds y l l a b u sM . S c C S 2 0 0 8 - 0 9 b, a s e do n t h e d e c i s i o nt a k e n b y B O S , C o m p u t e rS c i e n c eA, P S U '
My. P , H i g h e r E d u c a t i oC
r 0 l i l 4 . 0 8 . 0 8l n, v i e w o f t h e g u i d e l i n e s i s s u e d b nommission'

Departmentof ComputerScience
A.P.S. University,Rewa (M.P.)
Syllabusfor M.Sc. ComputerScience-First Semester
(Session
2008-2mg)
Paper-(MCS-l0l) -Mathematical foundationof ComputerScienceI: DiscreteMathematics
M a x . M a r k s .7 0
I i m e :J h o u r s M i n . M a r k s 2. 4
UNIT - I
M a t h e m a t i c aLl o g i ca n d S e t t h e o r Y :
Intorduction l -.h et h e o r vo f l n f e r e n c et b r t h e S t a t e r n e nCta l c u l u sT, ' h eP r e d i c a tCe a l c u l u s l,n t ' e r e n o e - l ' h e o r y
'fheory'
, , t ' t h e p r e d i c a t eC a l c u l i r s .S e t I n f f o d u c t i o n .B a s i c [ ] o n c e p t so f S e t T h e o r y , E l e r n e n t a r y
r e p r e s e n t a t lootn D i s c r e t eS t r u c t u r e sR s f B i n a r y R e l a t i o n si n a s e t ,
: e l a t r o n sa n d O r d e r i n g :P r o p e r t i e o
R e l a r r oM n a f r i xa n dt h e G r a p ho f a R e l a t i o nC l r d e r i n gF, u n c t i o n s :
, o m p o s i t i oonf B i n a r yR e l a t i o n sP, a r t i a O
C o m p o s i t oC n ,h a r a c t e r i s t i cNsa, t u r a lN u m b e r s .
TINIT _ II

A l g e b r a i cS t r u c t u r e s :
i n r r o d u c t r o nA.l g e b r a i cS y s t e m s :E x a m p l e sa n d G e n e r a lP r o p e r t i c sD : e f i n r t i o na n d b x a m p l e s .S o m e
e i g e b r a r iS y s t e r n a
- : r r n p lA s n d G e n e r a lP r o p e r t i e sS, e m i g r o u pasn d M o n o i d s :D e f i n i t i o n sa n d E r a m p l e s ,
l l o m o n r o r p h i somf S e m r g r o u pasn d M o n o i d s ,S u b s e m i g r o u p a sn d S u b m o n o i d sG, r a m m a r sa n d l a n g u a g e s
[ ) r s c u s s t oopf ' ( j r a m n r a r s .F g r m a l D e f r n i t i o no f a L a n g u a g eN , o t t o n so f ' S y n t a x A n a l y s i s .P o l i s h
f . r p r e . s r p 1asr r dT h e i r ( ' o m p i l a t i o n . a
C r o u p s .D e f i n i t i o n s n d E , x a m pleS s .u b g r o u p sa n d H o t n o m o r p h i s m .
-fwo
L o s e t sa n dL a g r a n g e 'l s' h e o r e n tN , orntal s u b g r o u p A
s ,l g e b r a i S
c y s t e m ws r th B i n a r yO p e r a t i o n s .

uNtT- lll
Latticesand BooleanAlgebra
l . . f r, , j 1 1 . r 1 ,I. r, ,r t t r i r ,tsr s [ r a r t i a l l rO r d e r c dS et s D e ' t l n i t i oar tn c i[ ; x a n r p l e sS.r - r t n[e) r o p e r l i eo: f l . a l t l c c s .
l . a t r r c ca,s \ l g . c b r a rS c v s t e r l sS s .i r e c tP r o d u cat n d l l o m o m o r p h i s mS.o m e S p e c i a[l - a f t i c e s .
. u b l a t t i c eD
i l \ r i , r c a r\' i g c b r ; i I ) e f i n r t i o na n d E x a n t p l e sS. u b a l g e b r aD. i r e c t p r o d u c ta n d l - l o n l o m o r r p h i s nBr o. o l e a n
i u n t i r t , n s B o o l e a n f - o r n r sa n d F r e e B o o l e a nA l g e b r a .V a l u e so f B o o l e a nE x p r e s s i o nas n d B o o l e a n
i . u p rt r o n s R e p r e s e n t a t i o nf B o o l e a nF u n c t r o n sM . i n i m i z a t i o no f B o o l e a nF u n c t i o n sD , e s i g nE x a m p l e s
L .s r r r gB o o l e a nA l g e b r a .
UNTT_ IV

GraphTheory
I n t r . d u c t r g n .B a s i c C o n c e p t s o f C r a p h . l ' h e o r 1 ' :B a s i c D e f i n i t i o n s .P a t h s .R e a c h a b i l i t , va n d C l o n n e c t e d n e s s .
'lrec in
and lundamenralCircuits: Some Properties of trees, Pendentvertices in a tree, Distance and Centen
of Craphs
ij rreu, Rootgd md Binriry,trees, Spanning ffees, Fundamental Circuits. Matrix Representation
I n c r d e n c eM a r r i r . C i r c u i t M a r r i x , A n a p p l i c a t i o n t o a S w i t c h i n g n e t w o r k . P a t h M a t r i x a n d A d j a c e n c y
Matrrr

I ext-Book:
I I ' r e r r r b l eJ yp & M a n o h a rR D i s c r e t sM a t h e m a r i c S a lt r u c t u r ews i t h A p p l i c a t i o nt o L l o r n p u l eSr c r e n c ei ,M t l
I S I ipchLrtz " F i n r t eM a t h e m a t i c s "S. c h a u mS e r i c s M
. CIJ.

R e f e r e n cBeo o k :
I s l D i s c r e t eM a t h c r n a t r c sM. ( i l l
I r u .C I f ; l e m c n t o
I I ) c r r\ ( i r a p ht h e o n . P l l l

necessary
S u b l e ctto t h e r p p r o v a lo f h i g h e r b o d i e sa f t e r d u e a m e n d m e n ti n t h e o r d i n a n c e, w h e r e v e r

h
\t i
€-'<t'\G-
\-'-".- -
--
\ i.,',-r'''[,,'i'
 ,Computer BOS APSU'
Science'
' a s e do n t h e decision takenby
D e t a i l e ds y l l a b u sM . S c C S 2 0 0 8 - 0 9 b Contmission'
Education
b y M.P.Higher
d t 0 l / 1 4 . 0 b . 0 8I,n v i e w o f t h e g u i d e l i n e si s s u e d

Universify'Rewa( M . P . )
Departmentof Computer SciencerA'P'S'
Semester
Syllabusfor M.Sc' ComputerScience-First
(Session
2008-200$)
SystemA r c h i t e c t u r e
- C-'omputer
Paper(MCS-102)
M a x ' M a r k s7' 0
M i n ' M a r k s2' 4
T i n r e :3 h o u r s

UNIT _ I
B a s i cC o m p u t e rO r g a n i T a t i o n : , . n
of comput€rsD ' 6artaa rr epp
n rr e
p s( e n t a t l ol n
B l o c k d i a g r a m ^E v o l u t i o n o f c o m p u t e rs V S t e m sC. l a s s i f i c a t i o n -
s v s t e m sa n c l ^ t h ei nr t e r c i l n v e r s i o n ' n a r yt : o d e s
B r
c o m p u t e r-sB i n a r y .O c t a l a n d H e x a d e c i m anl r t t , a ' i n g Postitlatcs'
p a r i r y . E r r o r c o r r e o i o nc o d e s ] C o n c e p t so f B o o l e a nA l g e b r a :B a s i c
B ( . D . t l B C D l C ^G r a - v . ' . ( R s ' D ' J K ' T )'
e c h n r q u e sK. a r n a u gM h a p L , o g i gc a t e s .F l i p - F l o p s
c a n o r r i cfablr m .M r n r m r z a t r of n

UNIT-ll
B a s i cB u i l d i n gB l o c k so f C o m p u t e r s :
RipplelRegister transfer' Bus and Memory
llegrsters(Shift Register),Counters(Binary, Up, Down' '
CP.U: introduction' general reglster
transfer, Arithmetic ,shift and logic Ui.io-op"tutions,
- Memory hierarchy,Main memory' Auxiliary
organization,addressingmodes, Memory org*i-lion
V'irtual memory' l)ata transfer:Modes of transfer'
ntemolv-.Associativememory',cache memory.
l ) ' n c h r o n o udsa t at r a n s f e rD
. . \ snr c h r o n . , rat sn c S ' fr4A

tJNll'lll
f 8086/8088
l n t r : r n a l a r c h i t e c t uor e M i c r o p r o c essor: n ^- ...-^^ c^nm regISters
\ o | t r r a r cm o d e lo f 8 0 8 6 i s 8 . M e m o r l A d d r e s sS p a c ea n d D a t ao r g a n i z a t i o nD. a t at y p e s .S e g m e n t
r n d I n d e xr e g i s t e r sS' t a t u sr e g i s r e r '
, a t ar e g i s t e r sP' o i n t e a
. s t r u c i i o np o i n t e r D
a . r l \ 1 e r . o r r S e g m e n t a t i o nl n
8 0 8 6 / 8 8 . c o n v e r t i n gA s s e m b l yL a n g u a g e
T h c S t a c k .l r o A d d r e s sS p a c e .A d d r e s s r n gm o d e so i t h e
n M a c h i n ec o d e . T h e I B M P c a n d i t s D E B U C p r o g r a m '
i n s r r u c r i ot o

UNIT-IV
lntroduction t o 8 0 8 6 / 8 8p r o g r a m m l n g : c t r o n sF. l a g
g O l O r g SD . a t a t r a n-scf^e_rAr_
r iit+hLm_t -: trirc^rI o
ng , rrrcn S h i R a n d R o t a t et n s t rt L
f h e r n s t r u c t i osne t o f t t ' r e s u b r O u t i n eh a n d l t n q
, n t t " ' t t ' n n s -' l u b ' o u t t n e s a n d
c o n t r o l l n S t r u c t l o n sC. o r n p a r e l n s t r u c t l o n .J * n p i n s t r u c t i o n l
s n' t e m t p t st n
s .t r l n g sa n dS t r i n g h a n d l i n g
r n s r r u c t i o nTsh e l o o p a n d l o o p - h a n d l i ntgn s t r u c t i o n S
E 0 8 6 l.n t r o d u c t i otno D O S " B I O Si n t c r r u ppt r o g r a m m r n g

TextBooks:
PHI
I M. Moris Mano: ComputerSystemArchitecture' tnterfai:tng-
W a l t e rA . T r i e b e la n d A l t a r S i n g h : 8 0 8 8 a n d 8 0 8 6m l c r o p r o c e s s o rPsr o g r a m m i n g '
I
s o f t w a r eh. a r d w a r ea n da p p l i c a t i o n sP' H I

ReferencBe ooks:
MGll
I J o h nP H a y e s C : o m p u t e rA r c h i t e i c t u raen dO r g a n i z a t i o n '
Structured Computer Organization' PHI
I AndrervS. Tannenbaum:
I A l b e f i P a u lM a l v i n o : D i g i t a lP r r n c i p l e sT'M H
.1 B R a m . M t c r o p r o . . , ' o ' i & M i c r o c o m p u t eD t a i& S o n s
r ' h a n p aR

wherevernecessar]'
d u e a m e n d m e n li n t h e o r d i n a n c e'
S u b l e c tr o t h e a p p r o v a lo l ' h i g h e r b o d i e sa f t e r

--<-&-
ii
\ , 1' r i L
I
-lh.<- Rvutu*
 .i;;nt'
| e r l s y l | a b u s M . S c C S 2 0 0 8 - 0issued
9 , b ab;'i;;' i s i o n t a k Commission'
s e d o n t h e d e cBoutution entyB.o.S,ComnuterScience.APStj'
r 14.0-8.08,In viewof theguidelines

(M'P')
University'Rewa
Science'A'P'S'
r
es,e
sd;:: il;,t :H lmil:n; o,*
Department of Computer

i:-103): Data Structureusing

:,SemC
Paper (MCS Max.Marks?0
M i n ' l \ { a r k s '2 4
L r l e :J h o u r s Llnit I , ,_ lio functrons.
n r o g r a r n ^S i r n p l e

j,:itTJl'l'.1', T'll
:::":::"'
n1:ji;ili:,"i:3;:'JIlte;L:il$:i:ii:?xiiJi:;;;;;;':;r a v a l u et i o t ' ' a t u t t c t t o n '
i u n c t i o n sr'e t u r n l n g '
, , p - s* , h r l ed. o - w h r l eu n d f o , l o o p f u n c t i o . s
-User-Jefined c l a s s P a r a m e t e r sl y p e '
u u i o * u , i r , S t a t i cR e g i s t e ' l n aE * " * u l S t o r a g e
; . r l & c l o b a lv a r i a b l e s . morettraioneparameters":::t:'"IlXi::#lt::$:::t;"
:;lararion t"*ii"t'*i'tr
of a function' an
strtng
thebreakstructured'
Declaration
: ::renstons)' ""ii"tii"r''"tion'
::' rrra\s.TheC PreProcessors'
'l","rers. and
o,u"lit the co.ceproi pornrers.^rhc.address
polnl?r, ':::'*f,'"li';,,tiil,).]"ill,lil]lllll.
ovnun'i'
:::r:ecrron passing
'l'i::i operators. 1rt:JT;;,' 'u.cl'ons
Struc"""'-''::
.,i.il*t;;;',tff';'T:il5:':,:::',[::':'l'i'lL"'i;";;"res
' n s . l . l i e s r n C ^ m o d e s f o r t l l e s . f u n c tin
ions,,.a''nfileslputchar,,,."nu,,*.'c.putc.iopen.ic}ose.iscant..
- -.r.lseek. ftell' fread tiji*tittf ' e'rrorhandling files
r Unit lll - . ^ ^stocks;
, ^ n l . c operatrons
.
i;; tinte requirements'
and'space
nre9rith1,1n;;;
:i.,.'.i'.t!triftj partI lntroduction: ti'l'T'll'l'iJiil";?
p"lt:;?;;;;'i""'-^"a '?"tl"i;t1iii'lliil
- -r,;\'rppiications iri'lr
"i'*'t'' "'u'iion'
. .". ii,;i,l:*il';]T$:U;'ll;l;j!,': arnrr1.'r
p"r,"o'..
ilfrflflliii1,fii'i,,i, t l t a r r db e s t i t t s t o r a g e
a y j ' . t u ' t t ' t ntunugtttn'' tlrst
block storage.oltu.otion'
. . t. : ,.irr )ron.flxcd "o'ugt
c o l l e c t i o n ' compactlon
- :: :, ilrbage

',t!':j:::: :::::,i:
i
o'"'?'ff;'*?,::il:::ilI
lllilHil
tree.binarytreetraversal' ot
..j:. blnar\n... r.or.r'ri,"ii"""rg."eral
f'l ;:1:i":l:::Bre rs
ad'lh'lj e\aluatton
,, ot".o'raar.h',r..r.

::;^'ri::i"
;:.:: 3::iil,'"#f:t[]#{':xpii;'li
"r *lili]:L".Tjlfill,l"ll1r:il :;-'::::;:;;"
n..,..ppii..u",.
spanning
.earch.
Deprhfirstsearch. exchange
son' tree'sort' partition
-:leclionsort. bubbtesort' merge tunctron
;;?;*h' h a s ht a b l em e t h o dh' a s h i n g
' ' : c h n i q u eLs' n t o '
"-Jli'';
I ert books \\ Itll'(
( iItttr":tl l)rt)gr''IllllllIIlg
ScPress
: A;*;rruu* l;",:T$:ilil:?;'1S'fnrctures'comp
usingc' PHI
4 Tant";;;; l i'' nutuSrmcilres

nntJnoer
l(ertrence N Delhr
PubHouse'
Mullrshrhe,splrir
:i: t o C ' ill::
PllI
r ! R a l a r a m a nlln r r o d u c t i o n
MCI-1
Structures.
Data
r I ,l;::i|:il !il:: ''jJ'ttleseries.
: J P 1 ' r e m b l e v &''trc t ^ o ' ? u weslev
n ' o ' i i n " i ' I n " l " ; ; ' ; nAddisron
P G s r oof" conto;t;';;;;;rnming' tustructures'MGH
r, D' *^"i" Art
i t b - vc o m p u t e r
solve
- R ( r l ) r o m e y :F l o wt o
Rewa( M' P' )
A' P' S'Univer sity'
of ComPuterS ci ence,
Department wlterevernecessllrv
due amendnrenl
i n t h e o r d i n a n c e'
of h i g h e r b o d i e sr f t e r
\ u b J e c tt o t h e u p p r o v a l

gtry&*-
 Commission'
d t 0 l / 1 4 . 0 8 . 0 8I,n v i e w o f t h e g u i d e l i n e si s s u e db y M . P . H i g h e r E d u c a t i o n

Syllabusfor M.Sc.ComputerScience-First Semester

(Session
2008-2m9)
Paper (MCS - 104): DBMS (DatabaseManagementSystems)
\lnr.l\larkr "0
\'lin,Marks )t
Time: 3 hours

UNIT I
B a s i cC o n c e p t :
Data
An lntroduciion to databaseSystem, Basic Data System Terminology, Purpose of DBMS'
& l ' o g i c a lD a t a ' B astc
e f D B M S : S c h e m aS. u b s c h e m am. a p p i n g P
l n d e p e n d e n cAe n, A r c h i t e c t u r o . hysical
B - J ' r e eb a s e d i n d e r ' F ile
F i l e S y s t e m sF, i l e O r g a n i z a t i o n :S e q u e n t i aIl n, d e x S e q u e n t i a H l,osting'
c a s h i n gw i t h i m m e d i a t sep l i t t i n gM
, odel o f R e a lW o r l d .D e t a i l o
s f E - R
O r g a n i . s a r iboans e do n D , v n a m i H
Model.

U N t rt l
ThreeDataModels:
A n O v e r v i e r vo f t h r e eM a i n D a t aM o d e l si . e .H i e r a r c h i c aMl o d e l . N e t w o r kM o d e l ,R e l a t i o n aM l o d c la n d
t h e i rI n t e rc o m p a r i s o nC, o n c e p t o f R e l a r i o nR, e l a t i o n aAl l g e b r a B
: a s i cO p e r a t i o nl i k e U n t o n ,l n t c'rsectiort.
Difference. p r o d u c tJ o i n ,T h e r e l a t i o n aCl a l c u l u sD: o m a i n & T u p l e C a l c u l u s R
. e l a t i o n aDl a t a b a sDeesign:
I n r e g r i t vC o n s t r a i n t sF. u n c t i o n a lD e p e n d e n c yS. i n g l e V a l u e a n d M u l t i V a l u e F u n c t i o n adl e p e n d e n c l .
N o r m a lF o r m s :l . l l . t l l . B o v c e eC o d d ,& I V t h N o r m a lf o r m s lJ o i n D e p e n d e n c l

UNIT III
Query P r o c e s s i n &
g D a t a b a s S
e o f t w a r e :
of Query ProcessingCost' Quen
Qu.ryl Interpretaiion,Equivalence of Expression.Estimation
and
Optimizationby AlgebraicManipulation,Join Algorithms.Typesof Data BaseLanguages.l)rocedural
r . \ o n - p r o c e d u r Lu .i u n g r u g e R
. e l a t i o n a lC o m m e r c i a Ql uery l a n g u a g e s , Q B S
E .Q L : l n t r o d u c t i o n B a sic
S r n r c t u r et h. e P o w e ro f S Q L ( C r e a t i o nI.n s e r t i o nD. e l e t i o n . I n d e x i n &
g M o d i f i c a t i o o
n f D a t a b a s er n
s S Q I -).
q rr c n o p t i m i z a t i o snf f a t e g i e s
I . J N I TI V
\ l a n a g e m e nC t o n s i d e r a t i o n&s F u t u r eT r e n d s :
S e c u r i i r & l n t e g r r t v : l n t r o d u c t i o n .A c c e s sC o n t r o l . ( i r y p t o S y s t e t n s S . tatisticaD l a t a B a s eS e c u r i N .
C o n c u r r e n c yC o n t r o l : T r a n s a c t i o nD . a t a b a s eS y s t e m A r c h l t e c t u r eS . e r r a l i z a b i l i t y[ .- o c k r n g .D a t a b a s e
R e c o v e r yK: i n d s o f F a i l u r e ,R e c o v e r yT e c h n i q u e sO. b j e c t ,A n O v e r v i e wo f O r i e n t e dM o d e l , D i s t r i b u t e d
databasc: Stnrcrure.Tradeoffs.Desisn.Client ServerDatabase, Knowledgedatabases
Text Books:
DataBaseSystem
HenryF Korth& A Silbershatz' l\4Ctl
Concepts.
DataBaseManagement
ArunK. Majumdar& P. Bhattacharya: TMH
S)'stern'

Reference
Books
l. Systems,GalgotiaPub Co Ltd'
JeflieyO. Ullnran . Principlesof Database
2. Bipin C. Desai:An Introductionto Database Systems.GalgotiaPub Co Ltd
J, JamesMartin: Principlesof Database Management, PHI
4. JamesMartin. ComputerDatabase PHI
organization.

A.P.S.
Departmentof ComputerScience, Rewa(M.P.)
University,
S u b j e c t o t h e e p p r o v a lo f h i g h e r b o d i e sa f t e r d u e a m e n d m e n ti n t h e o r d i n a n c e. w h e r e Y e rn e c e s s a r ) '

-=ojq
i.- € r b-ffPu
If,
 . , i l e ds y l l a b u sM ' S c c S 2 0 0 8 - 0 9 b, a s e d
o n t h e d e c i s j o nt a k e n b y B O S , C o m p u t e r
t l l 1 4 ' 0 8 ' 0 8I'n v i e w o f t h e g u i d e l i n e s S c i e n c eA. p s t .
i s s u e db y M . p . H i g h e r E d u c a t i o n
aornnrissi,rr,

Syllabusfor M.Sc. Computer Science-

First Semester
(Session
2009-20001
P a p e r( M C S - 1 0 5 )N u m e r i c j M e t h o d s

Time: 3 hours M a x . M a r k s?. 0

M i n . M a r k s 2. 4
UNIT_I
S t a t i s t i c a lM e t h o d s :
I n t r o d u c t i o nS'a m p l i n g 'F r e q u e n c yd i s t r i b u t i o n ,
M e a s u r e so f c e n f r a lt e n d e n c ; .M e a s u r e s
discreteprobabilirydisrribution:Significance ol.dispersron,
of probabirity.Discrete,Binomiar. p'ission
Distribution' curve fitting, Regressio-n and Normar
& correlation:Linear'i.;;;q;;. fit, Nonrinearfit, porynomrarfit.
of correlation,Multiple' partial& rank corretarion
r.ri!-orsrgnificance:chi squaie.
;T-Tlt"t T-resr

UNIT-II
\ u m e r i c am l e t h o d s| : S o t ^ u t i oonf p o l y n o r n i a l
a n d L i n e a rE q u a t i o n s :
r l r o d u c t l o n .p r o p e r t i e s& E v a l u a t i o n
o f . p o l y n o m i a l E q u a t i o n s ,I t e r a t i v e
r 0 u a t l o nBsi s e c t i o nm e t h o d 'F a l s ep o s i t i o n methods t.or roots t.rf.
method,.Newrun-nupr,ron'methocr
- r : l r sgfc n c e \ l u l l e r n t e t h o d 'f i x e d p o r n t ' o i - r i r n u r t a n cf oorucso m p r e xr o o r s .r a t eo I
m e t h o d .S o l u t i o n
, ; r : : ; r f , l i tm
n e t h o dC . a u x e l i r n i n a t i om
n e t h o dp e q u a t i o n s oj u t i o n b v
, i v o t a lC o n d e n s a t j o n : ' ; ; u s
: : : : i ' ' : \ l a r r i r \ l e t h o d c a u s si o r d a nM a t r i x S e i d e lM e t h o c jG
. a u s sJ o r d a n
r n v e r s i o nE, i g e nv a r u e &s E i g e nv e c t o r s

UNIT_III

u n r e r r c aml e t h o d s2 : I n t e r p o l a t i o n& N u m e r i c a l
Differentiation;
::roducrron.Lrnear i"l..rp9r?119",porynomiar
tierpoJatron'
interporation,-- oitr r.n.. .fabres, Gregory_Newrorr
Newtondivided differenie interpolation, 't-orward)
Llgrung.', rnirrporution(Backward
norsin dtfferences' Hennite interpolation'Piecewiseand ano
riffercnttatb t oynp o l y n o r n i af li t . sprin. interptrationNumerrc,ctr crrlJererrrturton
h r g h e ro r d e .d e r i v a t r v e sE.r r o r si n N u m e r i c a i
differentratio.
i

UNIT-IV

imericalmethodsJ: Numericar Integration& Sotutionof Differentiar

Equation:
wtertc'al
lnregra/tonlntroducrion'
T"rapezordal
rule,Srmpson's
tusstan lrJ rure,
Newton'sthreeerghthrule,
Solution
Quadrature' by Euler'smethod,Taylorseiies,preaictoi-correcto'
fhod'Numerical
solution method,Runge-Kurra
of'partial
differentiai
equarron.
paraboricpanialdifferential
itial
differenriar
equation,t-aplace poisson equarron,
iliiprrcai
equation. equation.iterative
methods.
ft Books;
Balaguruswarny.:
computer
orrented
Statrsticar
l, I & Numericar
Merhods,
MacMiilan
Numerical
algorithms,
computations
in Sc andEngg,Addison
I FrrY,,ff,jt|Xfi::i wesrey
I
Books:
lrerrce
| 'lainM K', Iyengar
S.R.K.& JainR.K.:Numerrcal
Methods
for Scientiflc
& Engineering
I Computation.
EWp
DesaiForrranprogramming& Numerical
Methods EWp
I
I
II
DeRartT".Tt.of
ComputerScience, A.p.S.Universify,
I Rewa(M.p.)
JI sr'llabus
f'r M.sc.computer
' science-First
vsemester
lrrrlJlsr o
r: . -Ye)
| t 0 t h r a p p r o v a lo f h i g h e rb o d i e sa f t e r d u e ----<Y)>=-'
It a m e n d m e n l i n t h e o r d i n a n c e, w h e r e v e r n e c e s s a r \ , .
II
,
i'^)
I , L-'', u [};r^
 .v,. vt rrr( Buruclrnes tssuedbt H i g h e rE d u c a t i o nC o m m t s s t o n .

Syllabus
for M.sc.computerscience-
Second Semester
(Session
2008-20'10)
Paper- (MCS-201)SystemSofiware

Mlr.Marks, 10
l'ime
V i n . l ' r ' l a r k . s2.i

UNIT_I
I r r t r o d u c t i o nt o S y s t e mS o f t w a r e :
1 ' h e S i n t p l i f i e dl n s t r u c t i o n aC
l o m p u t e r( S l C ) : M a c h i n e s t r u c t u r e ( M e m o r y . R e g r s t c r D , araformats.
I n s t n i c t r o nf o r m a t , A d d r e s s i n gm o d e s , l n s r r u c t i o ns e t . l n p u u o u t p u t ) ,
AssemblersB : asic Assembler
I r u n c t i o n(sA S i m p l eS I C a s s e m b l e tra, b l e sa n d r o g i c ) M . a c h i n e - d e p e n d eAnsts e m b l eFr e a t u r e(sl n s t r u c t j o n
l o r m a t sa n d a d d r e s s i n m g o d e s ,P r o g r a mr e l o c a t i o n )M , a c h i n e - i n i e p e n d eAn st s e m b l e [r: e a t u r e(sL r r e r a l s .
Svmbol-defining s t a t e m e n t sE , x p r e s s i o n sp, r o g r a n rb l o c k s , c o n r r o l s e c t i o n sa n d p r o g r a n rl r n k i n g ) .
A s s e r n b l eDr e s i g no p t i o n s( T w o - p a s sa s s e m b l ewr i t h o v e r l a ys t r u c t u r eo. n e - p a s s
a s s e r n b l e rM s .u l t r - p a s s
a s s e m b l e r sI)r,n p l e m e n t a t r o ehxamples.

uNlr - Il
L o a d e r sA n d L i n k e r s ,
Basic LoaderFunctions. Machine dependentloaderfeatures(Relocation,program linking.'Iablesand
loeic. a linking loader), Machine-independent loaderfeatures(Automatic librar_"'search. loadcrupturns.
n v e r l a r p r o g r a m ) .L o a d e r D e s i g n o p t i o n ( L i n k a g ee d i t o r s .D y ' n a m i c
l i n k i n g . B o o t s t r a pl o a c l e r sT) .e x t
. ' Jr t . r r o v er v i e wo f t h ee d i t i n gp r o c e s sl . r s e irn t e r f a c e d i t o rs t r u c t u r e .

uNlr-lll
\lacro processors:
B a s i c M a c r o P r o c e s s oFr u n c t i o n s( M a c r o d e f i n i t i o na n d e x p a n s i o nM . a c r o p r o c e s s orra b l e sa n d i o g i c ) .
\ l a c h i n el n d e p e n d e nMt a c r o P r o c e s s oFr e a t u r e(sC o n c a t e n a t i oonf m a c r o
p a r a m e t e rC s .e n e r a t r oonf [ , r n r o n
'ihtl: '()lldittonan l l a c r o e x p a n s i o n k, e v b o a r dm a c r o p a r a m e t c r s ) ,M a c r o p r o c e s s o D r e s r g no p t i o n s
n i r ! u r : i \c m a c r o e x p a n s i o n .G e n e r a l - p u r p o sl n e a c r o p r o c e s s o r sM
, a c r o p r o c e s s r n gw i t h r n l a n g u a g e
" ' - ' r " \ ' \ r i n t e r a c t i vdee b u g g i n sgi - s t e m sD.e h u g g i n g
f u n c t i o na n dc a p a b i l i t i e R
s .e l a i i o n s hri p
v i t ho t h e r
r ' : 1 : ' r l l t ei r s t e n rI.i s e r - i n t e r f a c rer t e r i a )

UNIT lv
( omoilers
[ 3 a s r cC o m p i l e rF u n c t i o n s( G r a m m a r sL, e x i c a la n a l y s i sS . y n t a c t i ca n a l y s r sC, o d e g e n e r a r r o nM
) .a c h r n e -
I ) e p e n d e ncto m p i l e rF e a t u r e (sl n t e r m e d i a tfeo r m o f t h e p r o g r a m M , a c h i n e - d e p e n d ecnotd c o p r r m r z a r r o n t ,
l r ' l a c h i n c - l n d e p e n dceonm
t p i l e rF e a t u r e s( S t o r a g ea l l o c a t i o nS
, tructured V a r i a b l e sM
, achrne-rnoependenr
codeoptlnlization,Block-structurelanguages). CompilerDesignoptions(Division into passes.lnrerprerers.
P - c o d ec o m p i l e r s ) .I m p l e m e n t a t i oenr a m p l e s .

Text Books :
I L e l a n dL B e c k ; S 1 ' s t e m S o f t w a r e( A n r n t r o d u c t r otno s ) ' s t e n rpsr o g r a m m r n g A
) ^d d r s o n \ \ e s l e r
P u b l i s h i nC g ompanl
I A l f r e d i e f f r e y U l l m a n :P r i n c r p l eosf C o m p i l e rD e s i g nN, a r o s aP u b l i s h r nHg o m e .N e r vD e l h r

R e f e r r e n c eB o o k s :
I : vstemp
I ) M D h a m d h a r eS s r o g r a m m r n&g O p e r a t r n S
g r s r e m s f. M H

S u b ; e c lt o t h e a p p r o v a lo f h i g h e r b o d i e sa f t e r d u e a m e n c l m e n itn t h e o r d i n a n c e, w h e r e v e r ^ n e c e s s a r )

\t !

--(-v-'p,-
i . i,
\r'.'. lrl
 DetailedsyllabusM'sc C-S.2008-09,
basedon thedecision_taken
by Bos,computerscience,
dt 0ll14'08'08,
In viewof theguideir;;;;;;
by M.p. HigherEducationCommission. ApsLr,

Syllabus for M.Sc. Computer

Science_First Semester
(Session
2009_2000t
Paper (MCS-l0S) NumericjMethods

l'ime; J hours
M a x . M a r k s7, 0
Min.Marks.2,f
S t a t i s t i c a lM e t h o d s : UNIT_I
l n t r o d u c t i o nS'a m p l r n gF . - r e q u e n cdl i s t r i b u t i o n ,
o r s c r e tp
e r o b a b i l i rt vi s t r i b u t i o n : M e a s u r e so f c e n t r a lt e n d e n c y
Significance probabilitr, M e a s u r e so t d r s p e r s i o n .
Distribution' curve.fining'Regressro;& ,of o i r . r " , r , B i n o m i a l ,p o i s s i o n
Correlation;Linear'ir*i-rqru., and Normaj
of correlationl r'a"iiiprt, p"*lia ,"unr. fit, Nonrinearfit, porynorniar rit,
lT"Tlttt co.r.iuion.-].ru of significance.
chisquare. r.-tesr

UNIT_II
N u m e r i c aml e t h o d sl . :S o l u t i o n
o f p o l y"n o m i aal n d L i n e a r
I n t r o d u c t i o np' r o p e r l i e s& Equations:
Euur'utri nl
R g r r l o m i a i E q J . J " r r , r t e r a r i v em e t h o d , s
False p"'i'i"''nrethod,.New,"r-trn',,", fbr roots of.
iSll!,:Jrl,3Jl1l';,1.1"n"0' con,piex
roors.
rare
ol method
for
eiirn
nar
on method,;il,'Jilil,lffi"
[?il"ilf,i:l; :"";i;i":i"U;;:m:,.il:il:"j]
method,
MarrixMethod.Gauss.rordan
rr,rutri*
lnu.rrion,Eigenvarues
& Eigenvectors.
#J;;,:i
UNIT_III
\unrerrcalmethods 2: lnterpolation & Numerical Differentiation:
Irtroduction'L'inear p"ry."ri.r int..potution.-'iiff
rnlerpolation' ,interporuttn.
Newtondivided r.n., Tabres,Gregory-Nervton
difference i'nterpotation,
L;gr.;;.,; Iiterporation
Errorsin differences'
Hermite-intero"l.J"",'i';"..*ir.'una-riiir."i",.*"r. (BackwardanrlForward)
i)rfferentlation
bypolynornialfit' hrgher .uon.
Numcrrcurtlt//i,renttrrtttn
o.J.' a.riuutlu.r,
E.ro^ln'Numerical differentiariorr
UNIT_IV
Numericar methods
J: Nu.mericar rntegration& sotutionof Differentiar
,umerit'ul lntegratton:-
ln',oduction, Equation:
riup.rui,iur
trli',oa. ,ut.. simpso.t'l): rule.Newton.sthree
caussian Quadrature'
Solution ershrhruie,
uy e'r.r;, r'ayto,-,.ri.r, prr!icror-corrector
method' Numerical solutionof partiaidiffereniral method.
RLrnpe-KLrrla
partrai difl'erential eqr:',]:rriffiri"iuniur differenrrar
equarion.[-aplace
.q,,0;;;,;,1"ssonequation. equarror.
F.rirprrcai
irerarive
nrerhods
T e x (B o o k :
: computerorjentedStatisticai
] : ?t'ffii||;lr"mv & NumericarMethods,
MacMirran
Numericalalgonthms..orp'urion, r s. una E"s;..
pubtishing aJ;:ii' l;;;r", wesic_r

Reference
Books:
S R K & JainR K Numerical
Methods
ffii,T;;riTfr for Scientific
& Engrneering
-
' Desai: Fortranprogramming& Numerical
MethodsEWp

D e p a r t m e n to f C o m p u t e r
S c i e n c eA
, . p . SU
. n i v e r s i t yR
, e w a( M . p . )
S yl l a b u fo
s r M.S c.C o mputer Science_ First Semester
\,bject to theapproval
o f h i g h e r b o t i i e sa f t e r d u e a r n e n c r m e n (

-,-*+=-
i n t h c o r c r i n a n c e. w h e r e , v e r
 DetailedsyllabusM'Sc cs 2008-09,based
on the decisiontsken by BOS ,computer Science,Apsu,
d t 0 l / 1 4 . 0 8 ' 0 8I ,n v i e w o f t h e g u i d e l i n e si s s u e d
by M.p. HigherEducationcommission,

Department of Computer Science,A.p.S.Universify,

Rewa(M.p.)
syllabusfor M.sc.computerscience-secondsemester
(Session
2008-2009)
paper(MCS_202)
Soffware Engineering
Time:3 hours Max.Marks,70
M i n . M a r k s .2 4

TINIT_I
Introduction The productand the process,
p r o g r a mv s s o f t w a r ep r o d u c t s ,E , m e r g e n c e
e n g i n e e r i nsgo' f t w a r ed w e l o p m e n t l i f e c y c l e of.software
m o d e l s c, l a s s i c awr a i e r f a l l ,i t e r a t i v ew a t e r f a l l ,
e v o l u t i o n 's p i r a l& R A P m o d e l , . o t p u r i r o n protoryprng,
o f v a r i o u sl i r . l y . r . ' r o d e l s , p r o j e c rm a n a g e m e n r
process management process. process,

UNIT. II
S o f t w a r eR e q u i r e m e nA t . n a l y s i s& S p e c i f i c a t i o n
( S R A S ): N e e df o r software requirement
r c q u l r e n t e np tr o c e s sr,e q u . i r e m e natn a l ;s i s , specification.
r e q u u e n t e nstp e c i f i c a t i o nplannrng
, a software
e s t j m a r r opnr.o j e c ts c h e d u l i n gs. t a f f i n g& p e r s o n n e l projecr;
cosr
p l a n n i n gs, o f t w a r econfiguration
managemenl.
. t u l l r t r. r s s u r a n pc lea n ,r i s k r n a n a g e n t e n t . plans:

UNIT.III
5 o f t r r a r eD e s i g n : c r i t e r i a f o r S o f t w a r e
d e s i g n ,s o f t w a r ed e s i g n & d e s i g np r i n c i p l e .
r l l o c l u l el e v e l
" ' : c c - i ' i : ( o u p l i n ga n d c o h e s i o n .d e s i g nn o t a t i o n& s p e c i f i c a t l n s .
' [ ' ' c l \ ) r r c n l ed( 1 d e s r g nm e t h o d o l o g yv. e r i l l c a t i o n ,
e s i g n : B a s r cc o n c e p t sd. e s i g nm c t h o d o l o g v
, ' r ' . c n r ci ide s r g nd.e t a i l e d< i e s i g n & M e r r i c e so. bj c c t . r i e n t e - cr .j f i r n c r r o n

UNIT- IV
Coding and resting : Standardguidelinefor
coding, programmingpractrce,testingfundamentars.
t e s t t n gv' e r i f i c a t i o n
v s v a l i d a t i o n ,b l a c k b o x & w h i " t e ' u o it . r i i n g : { n r t i o n a l unit
ob-ject t e s r i n g ,s t n r c t u r arre s r r n g .
orientedprogramtesting,softwarereliability& qualir.v
assurance, cASE, softwareMarntenance

T'extBooks:

Panka.l Jalote. An lnregralApproachto SofiwareEngineering

, Narosa
l l o g e r sP r e s s m a nS. o f t w a r eE n g i n e e r i n ga ,p r a c t i t r t _ r n e r . s
a p p r a o c hM
, GH

Reference
Books:

R a ; i bM a l l , F u n d a m e n n l oSf o f t w a r e E n g i n e e r i npgH
,l
R i c h a r dF a r l e y S
: o f t w a r e[ : n g i n e e r i nC
g o n c e p tT. M H

S u b J e crto t h e a p p r o v a o
l f h i g h e r b o t i i e sa f t e r t l u e r m e n d m e n t i n
t h e o r d i n a n c e, w h e r e v e r n e c e s s a r y ,

----<49--
il
 M'l'' Hlgner'utrrarru'r
1 4 . 0 8 . 0I8n,v i e wo f t h eg u i d e l i n ei sss u ebdv
(l\{'P')
Unirersitl''Rewa
Departmentof Computer Science'A'P'S'
Second Semester
Syllabusfor M'Sc' ComputerScience-
2008-200q)
(Session

Programrng
Paper(MCS - 203)- ObiectOriented
Max Marks 70
1A
l"intc i hours Min.Mark:

' Bastc
:- Procedural,Structured andobject orientedProgramming(ooP)
to ooP Benefits &
ftroduction
oop : object. c_r11es.^lnheritence.Polymorphism'[eusabilitl' defined
conceprs of user
of C-. piog'u*' basicdata1l^tj.
applicationsof OOp, C'*'andOOP ; Strultur. protot-Ypes'
variable,operators.-t;;,;;;r. uninn on6 enum Functions
datatypes, reference call by reference'function
const argutnentsin ft'nti'nn'' lnline functions'
defaultarguments,
friendand virtualfunctions'
nt'.tfouaittg.
Unit-ll
and encapsulation'public
objects: Declaring a class,
-functionr, -& datahiding
definingan object' constructors'
classesa'd destnrctors,parametrized
& *nrfrr"tors
and privatedata members objectas function'arguments'
tn a class'cop)'const;;;;'' ut'uy'of object' - unary
mrrltiple'constructor
pointer. *.roo-oiij.u;i"; for objects,olerator overloading
the this
reru',ng ob.jecrs.
andbrnan opcrators' tlpe conversions'pointersto functtons'

Unit-lll
& hybrid
a n d d e r i v a t i o ns, r n g l e . . u l t i p l e ,h i e r a r c h r c a l
m u r t i l e v e rm
i.rrcrrrencc rnherrtence and proteciedinheritences'
overriding
,.herirence. consrructorsin multiple inf-.'"rit.nJ.,'private functions and
uirtuai ft'nttions' virtual
rinual
r.ri.,rri).S. methods, arnbiguiry,.;;l;;;;.'pu1e
memberclasses : nestillgof classes
r.nsrrucrors a o.rtruiiors.'ob:ect"slicing.

I
Unit-lV

>!|s4ml(.streanrs.streamclasses.uniorm a t t e*-ur,lpulators'
*ith o p e r a tma'ipulators
d l l odefined
d & f b r m a t r euser rons.nlemoer
crn. manipulatorr. *unu,ni;r;;"i file modes'
funcriorrsof I/o with streams'
rtir"r-,CLurses for filt"t'"u'n operations'file
rvith arguments. handling during file operatrons'
,.*,'RLr. binary I/O,. random access'enor
binary versus & Execptionhandling
line arguments, element",rua"rub"" *unug"*"nt' Templates
command
Text Books:
with C*. ' TMH
t E. Balagurusamy' Object OrientedProgramming
ANSI C'- ' Technredia
t Jess.f-irtt'tt' ieach"Yourself
in Turboc'- ' GalgottaPubltcattons
I Rober-tLafbie.object orientedoro*r*lx'ng

lleferenceBooks :
Wesler
I S t r o u s f f t tTp h. e C P r o g r a m m r nLga n g u a g eA' d d i s o n
TMH
Reference'
2. I';il; i..nirJ.C-" complete
BPB
YashwantKanatkar,Let us C-' '

necessar'l
o r d i n a n c ew
. herever
a f t e rd u e a m e n d m e n it n t h e
S u b r e ctt0 t h e a p p r o v aol f h i g h e rb o d i e s

r/g
---<'&:
K, Lil-$--
.1
I
-
\\ l.l { , t - -
t-

,t\i
 APSL'
D e t a i l e ds y l l a b u sM . S c C S 2 0 0 8 - 0 9 b , a s e do n t h e d e c i s i o nt a k e n b y B O S , C o m p u t e rS c i e n c e '
d t 0 l / 1 4 . 0 8 . 0 8I,n v i e w o f t h e g u i d e l i n e si s s u e db y M ' P ' H i g h e r E d u c a t i o n C o m m i s s i o n '

DePartmentof ComPuterScience
, e w a( M . P . )
A . P . S .U n i v e r s i t yR

. o m p u t eSr c i e n c eS- e C O n d S e m e s t e f
S y l a b u sf o r M . S c C
(Session2008{9 )
Paper (MCS-204) ComPuterNetwork
Max.Marks.70
'[ime: l Viln . M a r k s .2 4
J hours
UNIT_I

I n t r o d u c t i o nt o N e t w o r k s :
O S I R e f ' e r e n cMeo d e l '
B a s i c so f D a r aC o m m u n i c a t i o n sL: A N , M A N . W A N . V a r i o u sL A N T o p o l o g i e s ,
Models' PhysicalLayer: Inter-
]'CP/lP ReferenceModel, Comparisonof OSI and TCP/IP Reference
Software requirententstbr networktng'
Comparisonof various communicationmedia, Hardware and
G e o s t a t i o n a rSya t e l l i t e sL'o w
W i r e l e s sc o m m u n i c a t i o nR: a d i o& m i c r o w a v ec o m m u n i c a t i o nS,a t e l l i t e s :
Orbit.Satellites,overviewof VSAT' BroadbandISDN'
UNIT II
D a t aL i n k L a Y e r :
FramingError Control'Flow Control'
DataLink Layer Designlssues:ServicesProvrdedto Network Layer, - An unrestricted simplex
ErrorCorrectionCodes.Error DetectionCodes.ElementaryData Link?rorocols
Sliding W i n d o w sP rotocols
p r o t o c o ls, r m p l e xs t o p - a n d - w a i l - p r o t o csoi m l ' p l e xp r o t o c ofl o r a n o i s yc h a n n e l '
- Onebit slidingwtndow protocol,protocolusingGo Back n Protocolusingselective repeat
IJNIT III
M e d i u m A c c e s sS u b - l a y e r a n d t h e N e t w o r k L a yer:
- A L O H A , C S M A P r o i o c o l sL. r m i t e d - C o n t e n t i o Pnr o t o c o l sI'E F " ES T ; \ N D A R D
i cc c e s sM e t n o d s
f v , l u l t r pA
R r n g 'C o m p a r i s o on f t h r e e 'B r i d g e s
F O R t - A N s A N D M A N S . S t a n d a r dfsb r E t h e m e tT, o k e nB u s . i ' o k e n
P a t h ' R o u t i n g 'F l o o d i n gF' l o w
i r o m 8 0 2 . xt o 8 0 2 . y . - f h eN e t w o r k l - a y e r :R o u t i n gA l g o r i t h m s : S i o r t e s t
B a s e dR l u t i n g ,B r o a dC a s t - i o u t i n "G
. o u t i n g .H r e r a r c h i c ar o ge . neral P r i n c i p l e s f ' C o n g e s t i ocno n t r o l F l o w
o
P r o t o c o l sI P
. A d d resses
s p e c i f i c a t i o Inn. t e r n e t w o r k i nTg u. n n e l i n gF, r a g m e n t a t i olnP,
UNIT TV
-l'he
T r a n s p o r ta n d A p p l i c a t i o nL a y e r s :
Elementsoi Ttanrpott Protocols: Addressing,establishing connectron'R e l e a s r ncgo n n e c t i o nf l.o r r c o n t r o l
Protocols: TCP senice model TCP
and buffering, multiplexing, crash recovery,lnternet Transport Traditronal
prorocol,TCP connectioninanagement, TaP congestioncontrol, UDP, Network Securit.u-:
" secretkey algorithms' public Ler' D\s
cryptography, two filndamental cryptographic principles.
W o r l d W i d e W e b
D o m a i nn a m es y s t e m sS, N M P .E l e c t r o n i cm a i l '

Text Books :
I r e t w o r k sP' H I
A . S l ' a n e n b a u mC: o m p u t eN

ReferenceBooks :
IJamesMartin:ComputerNeflvorks&Disrributedprocessing'PHI
2 Black:Computer
Uyless PHI
Networks,

necessary'
a m e n d m e n ti n t h e o r d i n a n c e, w h e r e v e r
S u b j e c t o t h e a p p r o v a lo f h i g h e r b o d i e sa f t e r d u e

--eYA^:--
 D e p a r t m e n ot f C o m P u t e rS c i c n c e
A.P.S.Universiry,Rewa(l!t.P.)

. o m p u t eSrc i e n c eS-e c o n d S e m e s t e r
S y l l a b uf so r M . S cC
(Session2008{9 }

Paper (MCS - 205) - AdvancedProgrammingLanguage

l r n r e :3 h o u r s M a x . M a r k s: 7 0
Min.\1arks:2,1

UNITI

l n t r o d u c t i o nt o V B , 1 ' h el n t e g r a t eD developmen e tn v i r o n m e n (Mt e n u b a r , ' f o o l b o x . P r o . l e cEtx p l o r e r .

I , i - o p e r t i er is' i n d o r vo. b j e c t b r o w s e r ) .w o r k i n g w i t h t b r n r s .v a r i a b l e sp, r o c e d u r e( S u b . E v e n t .C e n e r a l )
( n p 1 1 pSlt r u c t u r e( lsf . . . . T h e n . . . . . E l sSee,l e c r , . . . . C aD s eo ,W h i l e .,,, . .L o o p ,F o r . . N e x t ) E ' x i tf o r a n dE x i t
D{)statement. With-Endwith statement,Arrays,Data types,User-Defined Data Types. constants Datarype
J r ) n \ e i - s i oBnu. i l t - i nF u n c t i o n so,p e r a t o r s .
UNITII
\ \ / o r k i n g w i t h c o n t r o J sC l a s s i f l c a t i oonf c o n t r o l ss. t u d yo f v a r i o u sc o n t r o l s(. T e x t b o x . l a b e l .C ' o m r n a n d
'nrt1or. to
o n t r ( ) nh . r t o n .l i s t b o r , c o m b o b o x S c r o l l b a rF. l e r g r i d & B u i l t - l nA c t i v e xc o n t r o l s )w i t h r e s p e c t
p r { ) p e n \ e. v e n ra n d r n e t h o d s .C r e a t i n gC o n f f o lA n a y ( a t D e s i g n - t i m e , a t r u n t i m e ) m
. e n u s m
, o u s ee v e nts
with ob.1ects. fonrs as ob.lect. constmct()rs and
rind dialoghorcs. OLE. OOPS in VB: Oblects,working
{ e s t r u c t o r cs o. l l e c t i o n(sc o l l e c t i o n ) , l a s sm o d u l e .
o b j e c t ,c o n t r o lc o l l e c t i o n C
UNIT III
. \ r l r a n c e dV B p r o g r a m m i n g : D a t a b a s e P r o g r a m m i n gO: D B C . D a t a b a s A e c c e s sm e t h o d sr n V i - l ( D A O '
: i ) . , \ f ) ( ) r R e c o r d s cAt .d v a n c e d a t ac o n t r o l s( d a t al i s t .d a t ac o m b o .d a t ag r i d , H i e r a r c h r c lal e l xg r i d ) .
. i t
: : , : I - \ { . ) l D c b u g g e rC ) v e r v i e o r vf D a t aR e p o rar n dC r y s t aR l e p o n .A c t r v e X C o n t r o l s L
' 'fcatlng
. c t i v e XE x e a n d A c t i v e XD l ' L ' V B Scrtpt
1 - ' 1 ) . 3 i t 1 , , r.nAcc t i r e Xc o n t r o l sO, v e r v i e wo f C O M / D C O M A
s VB Scripts.
. n c t i o n ss. l a t e n l e n rt n
. : , I l . i r l n l o h . l e c t so.p e r a t o r sf u
UNIT IV

\ c r r r e S e r v e rP a g e s : B u i l t i n A S P o b . ; e c t sR : e s p o n soeb j e c t( w r r t e .b u f f e r ,c l e a r .f l u s h . E n d ' r e d i r e c t '

l : r p i r e s .E x p i r eA b s o l u t em e t h o d ) . R e q u e sot b j e c t : F o r mc o l l e c t i o n( Q u e r yS r r i n g ,f o r m ) ' H T T P h e a d e r s '
r e r d r n g t h e F I T T Ph e a d e r sr e q u e s t .S e r v e rv a r i a b l e sm e t h o d E . , n v t r o n n t evnat r t a b l e .C o o k i e s : R e a d t n g
r . L t \ \ ' r r r n e c o o K r c s .l ' r a d o f f s o f c o o k i e s . S e s s i o no b i e c t : S e s s i o nv a r i a b l e A p p l i c a t i o nO b . l e c t :
. e s s i o nv s A p p l i c a t i o no b j e c t G l o b a la s a f i l e . A S P c o m p o n e n t s A d d R o t a t o r '
, t p p l i c a t r o nv a r i a b l e S
( ' o n t e n tl i l k e r a n c lb r o , , v s ecra p a b i l i t r e sS,e r v e ro b 1 . r t 'R e a d i n ga n d w r i t i n g f i l e s o n t h e r v e bs e r v e r A S P
e r r o rr l b j e c t .

'l't'tt
Books
I V 8 6 U n l e a s h e-dT e c h m e d i a
I A S Pu n l e a s e-d' f e c h m e d i a

R r / t r e n c cB o o k s .
, f 8 6 i n 2 l d a y s- T e c h m e d i a
I ' e a c hv o u r s e lV
.. f S P r n 2 I d a y s- T e c h m e d i a
I ' c a c hv o u r s e lA
I.r s r n gV i s u aBl a s i c6 . Q u e

\ r i h t e c t t o t h e a p p r o v a l o f h i g h e r b o d i e sa f t e r d u e a m e n d m e n t t n t h e o r d i n R n c e, w h e r e v e r n e c e s s a r \

r..\

\
l-/
lf \ l,
K. Le-{s)-x-
fl--
--<*t^9-
 r l i r b u s M . S c C S 2 0 0 8 - 0 9 ' b a s e d o n l l t d : :Hi :i g
o hn et arEk deuncbal B OnS
tio C'oCmom
mips us ti oe nr S
' cience'.\P)L'
by M.p.
. . 0 g .l n v i e wo f * , . g " i i . i i n l r l r r " . a

DePartmentof ComPuterSclelce
Rewa(M'P')
L.P.S.UniversitY,
I - Third Semester
Science
Syllabus for M'Sc' ( Computer
(Session2009-10)
System
Paper (MCS - 301) Operating Max.Marks.70
Min.Marks' 24
r r r r , ' J: h < l u r s

UNIT_I

Fir?Management, Management'
;,"":::1"*"#J.T::l-,i:il:l''*unur.,n.n,:
:,'i:i;H":?' felice Multi -
-.Serialp'ott'iing' BatchProcessing'
of op.ruri"g,yri.ms
()ncraiinssvstem..rui..r.'Eiolution svstems'
operating
B;h operating system'Time-sharing
prouramming. Tvpes f"tt1"' Processconcept'
"f;;;;i;; oiJtrlbuted
'y'*lt'
operatrng opt'u'ingsystem'il"::t: Management:
li'.i'time scheduling'
Multipleprocessor
i,chcduling cpii'r.r-'.a"iing,Scheduling'itg;'itlttt'tt'
concepts,
U N I TI I
I ntcr ProcessSYnchronization: RegionandConditional CriticalRegion
if-l.cri,i."f sectionproblem'the Critical
( ()lcurrentprocesses, Deadlock Deadlock
ronirution,Inter p-ro""r,.o.t,n1:u":n, .occurrence'
f roblent.lnrer process--rynit Deadlock and
detection recovery'
o.uarolvt;'j|'u'ji,a";."ir".i """ioance,
. r :,iacrerizarron.
U N I TI I I
'" Partitioned
:l':;,"J::li:T;:::Staticparlitioned mSmory "ll::1,'""i,..Y111,":? --l'ffli::",,:"lnamic
- Address t r a n s l a t i o nD' e s c r t p t o r
M u l t i p l ef e n c er e g i s t e rS' e g m e n t a t i o - n
- . . , r r r a i l r r c r i t i o nc,o m p a c t i o n . Managementof virtual
, .rchrng Paging,Page aliocation'Vinual ";;;;i*t:::ill:':'6tabilitv' Comparisonof various memory management
rrrdnror.y-. page replacement,Replacement-algoriitrms'
. . n n i U u . ,* i t h n n dS h a r a b i l i t y '
t o P r o t e c t i oa
"ie'ente
UNIT IV
ile
r :i l c a n t l D e v i c eM a n a g e m e n t : s t r u c r u r eo r g a n r z a t i o nf'
A c c e s s m e t h o d s 'D i r e c t o r y
r . i l c s y s t e m o r s . a n i z a t t n .F i l e o p e r a t i o n s ' bvnamic^protection S t r u c t ure'
- G o a r so f p r o t e c t i o n A
, c c e s s r n a t r i xm o d e l o f p r o t e c t i o n , Access and
irr..iection devices'Sequential
OtOltu"O' Sharedand v-irtual
isccurityencryption,O.li..-*unugement: tuffering' I/o schedulers' Spoolingsystem"
, rirect Accessdevrces,Channeland Control U;l;;' i/o

'Iext Books:

1 Peterson : operatingSystemconcepts,Sybex.
& Siberschatz

l i e f e r e n c eB o o k s:
M c G r a wH i l l '
I dJ ' J ' D o n o v a n: O p e r a t i n eS y s t e m s '
\ c r t a f lE . M a d n i ka n'oott*"g McGraw Hill
SVslems'ConcJptand Design'
I Milan Melankovic *":lll1l Pub'Co'
' I"";;;;;t"-lt-of ope'uting svstems'
I Andrew
t-ister
l n t r o o u c t i otno O p e r a t i n gS y s t ' d d i t i o nW e s l e y '
e mA
I I)elter ,qn
n e c e s sray .
 ' l l l a b u s M . S cC S 2 0 0 8 - 0 9b , a s e do n t h e d e c i s i o nt a k e n b 1 B O S . C o m p u t e rS c i e n c eA, P S U '
l ) 8 , 0 8 I, n v i e w o f t h e g u i d e l i n e si s s u e db y M . P . H i g h e r E d u c a t i o nC o m m i s s i o n .

t f C o m p u t e rS c i e n c e
D e p a r t m e no
A. P. S. University,Rewa (MP)

Syllabusfor M.Sc.(Computer - Third Semester

Science)
(Session2009-10)

Paper(MCS- 302)- ComputerGraphicsand Multimedia

-f Max.Marks : 70
i n rc : 3 h o ur s
Min.Marks : 24

UNIT I
( i r t r r i e w o f G r a p h i c sS y s t e m sa n d 2 D T r a n s f o r m a i t i o n :
I ) i s p l a vD e v i c e s ,H a r d c o p l d , e v i c e s ,I n t e r a c t i v eI n p u t D e v i c e s ,D i s p l a yp r o c e s s o r sG, r a p h i c sS o f t w a r e .
O u t p u t P r i m i t i v e s :P o i n t s a n d l i n e s , L i n e d r a w i n g a l g o r i t h m s ,C i r c l e g e n e r a t i n ga l g o r i t h m sB a s i c
'I
r a r r s f b r m a t i o nM s .a t r i x R e p r e s e n t a t i o nasn d H o m o g e n e o uC s o o r d i n a t e sC, o m p o s i t eT r a n s f o r m a t i o n s ,
I L c l l e c t i o nS, h e a r ,R a s t e rm e t h o d sf o r t r a n s f o r m a t i o nW s . i n d o w i n ga n d C l i p p i n g : W i n d o w i n gc o n c e p t s .
( i r p p i n ga l g o r i t h r n sW. i n d o w - t o - V i e w p otnr a n s f o r m a t i o n .
UNIT II

J l ) - [ r a n s f o r m a t i o ,nV i e w i n ga n d M o d e l i n g :
l lrreeDimensionalTransformations Rotationaboutan arbitraryaxis, Reflections,
: Basic transformations,
5 ''.:rrs. Transformationsof coordinate system. Projections, Viewing transformations, Software
:r i'iementation. Hardwareimplementation.Hidden surface& Hidden line removal :Classification,Back
i :-r rer'Io\'?1. DepthBuffer method,Scanline method,Hidden line elimination,Curved surfaces.Shading
:-: color models: Modeling light intensities,Displayinglight intensities,Surfaceshadingmethods,Color
,. \ \lodeiine methods: Basic concept,Master coordinatesand modeling transformationstructured
' , . : l l e . .i r m b o lo p e r a t i o n s .

UNIT _ IIT

( ) v e r v i e w o f M u l t i m e d i a : l n t r o d u c t i o nA . u l t i m e d i ae n a b l i n g
. p p l i c a t i o no f m u l t i m e d i a t. e r m i n o l o g y m
tcchnologiesin digital representation, Hardware& Softwarerequirement,multimediastandard,hypertext;
l l ; s r o r y ,n a t u r e l, i n k s ,n a v i g a t i o n& s t r u c t u r eT. h e n a t u r eo f s o u n d , d i g i t i z i n gs o u n d ,p r o c e s s i n sgo u n d .
c o r n p r e s s i of n o r m a t ,M I D I , C o m b i n i n g ,s o u r c e& p i c t u r e ,V i d e o & i m a g ep r o c e s s i n g :D i g i t i z i n gv i d e o ,
r i t l c r s t a n d a r dvsi d e o c o m p r e s s i o nd.i g i t a l v i d e o e d i t i n ga n d p o s t p r o d u c t i o ns, t r e a m e dv i d e o a n d v i d e o
cl r f e r en ci n q .

U N I T- I V
Arrirnation: Capturedanimationand imagesequences, digital cel and spriteanimation,key liame
anrmation, 3D animation,Combiningmedia:synchronization basedpresentation: SMIL (synchronize
rnultimedia language),
integration synchronizepresentation(HTML + TIME), knowledge
accessibility.
b:rscmultimedia, future ECMAScript
direction. syntaxoutline, Multimedia and network:
network and
rt-i):iltortprotocols.
multicasting, protocols
application for multimedia: HTTP,caching; Qualityof service,
,, . I sidcconloutation.

Books:
r ) H e a r na n d B a k e r: C o m p u t e G r r a p h i c sP, r e n t i c e o f I n d i aP v t .L t d
- : r ' r e nl l a r r i n g t o n: C o m p u t e G
r r a p h i c sM
. GH.

i : ' r i c c t o t h e a p p r o v aol f h i g h e rb o d i e sa f t e rd u e a m e n d m e n ti n t h e o r d i n a n c e w
. h e r e v e rn e c e s s a r y .

':Y,*o -
,l*"'w
 llat)us lvl.:tc t-s LUud-uy. oascu oIt tltc uce lStuIt tahcn u\ D\JJ .LUrilpurcr JctEiluc. .{rJL,
t i . 0 8 I, n v i e wo f t h e g u i d e l i n e iss s u e db y M , P . H i g h e rE d u c a t i o nC o m m i s s i o n .

r e l M u l t i m e d i aC, h a p m a nW, i l e y

r c eB o o k :
i w m a n a n dR . F .S p r o u l i: P r i n c i p l e os n l n t e r a c t i vC
e o m p u t eGr r a p h i c sM
. GH.
r K G i l o r . l n t e r a c t i vC
e o m p u t eG r r a p h i c sP, H I .
{ A . P i a s t o ca
k n dG . K a l l e y: T h e o r ya n d P r o b l e m o s f C o m p u t eG
r r a p h i c sM
. GH
\4ultimedia S y s t e mJ, o h nF . K l o e g e lB u f o r d

Departmentof ComputerScience
A. P. S. University,Rewa (MP)

for M.Sc.(Computer
Syllabus - ThirdSemester
Science)
( S e s s i o n2 0 0 9 - 1 0 )

Paper(MCS- 303)- JAVA PROGRAMING

l - i r n c :J h o u r s Max.Marks : 70
M i n . M a r k s: 2 4

UNIT I

l r r t r o d u c t i o n :C . C " & J a v aa c o m p a r i s o nS, t r u c t u r eo f s i m p l eJ a v aP r o g r a mJ, a v at o k e n s ,S t a t e m e n t s .

, z rr t r t u a ln t a c h i n eC. o m m a n dl i n e a r g u m e n t sP, r o g r a m m i n sgt y l e ,C o n s t a n t& s v a r i a b l e sT, y p e c a s t i n g .
' . i , , u sO p e r a t o risn J a v a ,C o n v e r s i o nisn e x p r e s s i o nO s ,p e r a t o r .p.r e c e d e n caen d a s s o c i a t i v i t y . D e c i s i o n
' 'r! and branching:The if statement" the switch statement, the ? operators.the while statement. the do
' :, lent. the tbr statement, jumps in loops, labeledloops, classes,objectsand methods,Constructors,
' - : : . . r do r e r l o a d i n gs,t a t i cm e m b e r sn, e s t i n go f m e t h o d s .

UNIT II

l n , r e n t a n c e :O v e r r i d i n gm e t h o d sf,l n a l v a r i a b l e a s n d m e t h o d s ,f i n a lc l a s s e sa,b s t r a cm t e t h o d sa n d c l a s s e s .
' \ i . : a r , sa n dv e c t o r s: a r r a y s ,v e c t o r sw , r a p p e rc l a s s e sc,o n v e r s i o fnr o m a n d t o p r i m i t i v ec l a s s e si ,n t e r f a c e s ,
r r , t r : k a g eM s .u l t i t h r e a d epdr o g r a m m i n g : c r e a t i n gt h r e a d se. x t e n d i n g
t h e t h r e a dc l a s s s. t o p p i n ga n d b l o c k i n g
t l r r t : a d .l i t ' ec y c l eo f a t h r e a d ,u s i n st h r e a dm e t h o d st.h r e a de x c e p t i o n st h , r e a dp r i o r i q ' .s y n c h r o n i z a t i o n .
i l , l i ) l c n t e n t i nt hge r u n n a b l ei n t e r f a c e ,m a n a g i n ge r r o r sa n d e x c e p t i o n sF. i l e s : I i O e x c e p t i o n sc.r e a t i o no f
i l , c s .c t ) f l c i i t € n a t i&
n gb u f f e r i n gf i l e s

UNIT III

[ : l e t t t : e v e n tS o u r c ee, v e n tl i s t i o n e r ,o v e r v i e wo f e v e n t c l a s s e( sa c t i o ne v e n t ,a d j u s t m e n t e v e ni tte, m e v e n t ,
fc,tusevent, textevent, mouseevent).handling keyboardevent Abstract Window Tool : windows
l r i i r l t x l n e n l z, lc r e a t i n g F r a r n ew i n d o w , h a n d l i n g e v e n ti n f r a m ew i n d o w , d i s p l a y i n gi n f o r m a t i < lw n ithin
u.indorv.label, button, checkboxand textfield controls.String:stringconstrucror,operationson string,
s t n r g s e a r c h i n go.v e r v i e wo f j a v a l i b r a r y ( m a t h c l a s s ,s y s t e mc l a s s ) O v e r v i e wo f
J , )l e c t i 0 n s .

UNIT IV

i i , g a n d A p p l e t s: I n t e r f a c C e o m p o n e n tws i t h s w i n g : S w i n g b u t t o n s ,t e x t I n p u t ,m a k i n gc h o i c e s ,
r.'irr radio and checkbox scroll bars Applets: Applet Basics, life cycle of an Applet.applet
l r , i r z a t r o n a n dt e r m r n a t i o.ns i m p l ea p p l e td i s p l a ym e t h o d, s t a t u sw i n d o w , p a s s i n gp a r a m e t etro a p p l e t,
. , , c I t o t h ea p p r o v aolf h i g h e br o d i eas f t e rd u ea m e n d m e ni nt t h eo r d i n a n c, ew h e r e v enr e c e s s a r y .

'
Lir ,K - ' b- - *w - 1 *----<:.tY-"
,tl"*v',u'
 . ' c sl y l l a b u sM . S c C S 2 0 0 E - 0 9b, a s e do n t h e d e c i s i o nt a k e n b v B O S , C o m p u t e rS c i e n c eA, P S U ,
1 4 . 0 8 . 0 8I n, v i e w o f t h e g u i d e l i n e si s s u e db y M . P . H i g h e r E d u c a t i o n c o m m i s s i o n .

r l c o n t e x ti n t e r f a c e. T h e A p p l e t H T M L T a g sa n d A t t r i b u t e sS. e r v l e t: b a s i c s l, i f e c y c l e o f s e r v l e t a,
l i c s e r v l e t s. e r v l eitn t e r f a c er,e a d i n gs e r v l e t .H a n d l i n gH T T P r e q u e sat n dr e s p o n s e s , h a n d l H i nTgT P
. r r e q u e s t . c o o k i celsa s s u . s i n g C o o k i e ss, e s s i o ntracking.

t'rl Iloctks:
P r o g r a m m i nwgi t h J A V A A p r i m e r sb, y E . B a l a g u r u s a mT y ,M H
C o r eJ A V A 2 V o l u m eI - F u n d a m e n t a lG s ,a r yC o r n e l l C
. . S . H o r s t m a n nS
, u n M i c r o s y s t e mPs r e s s .
C o r eJ A V A 2 V o l u m eI I - A d v a n c e dF e a t u r e sG, a r yC o r n e l l C
, , S.HorstmannS , u nM i c r o s y s t e mPs r e s s .

lleference Books ;

1. MasteringJAVA , TechmediaPub.
LearnAdvancedJavascriptProgramming- yehuda Shiran& Tomer Shiran,BpB.

k>rry

r b l e c t r "trl t ea p p r o v r tol f h i g h e rb o d i e sa f t e rd u e a m e n d m e n ti n t h e o r d i n a n c e, w h e r e v e rn e c e s s a r y .
 lled syllabus lvl.Sc LS /uud-uy' D a s c u u t l l l l c u c L r f , r u r r! o ^ ! r r u - r v v - '
H i g h e rE d u c a t i o nC o m m i s s i o n '
l / 1 4 . 0 8 . 0 8I n, v i e wo f t h e g u i d e l i n eiss s u e db y M . P ,

Departmentof ComPuterScience
A. P. S. University'Rewa (MP)
-
S yl l a b u sfo r M.S c.(C o mputerScience) Thir d Semester
2009- 10)
(S e ssi on
Paper( MCS -304(8) ) : TheoryOf Computation
M a x . M a r k s7' 0
Time:3 hours
Min.Marks.24

UNIT_I

recursivedefinitions,regularexpressions' problemson
Automata Theory: Alphabets,stringslanguages, dift'erent
transition diagram, transition graphs'
regular expressions,flnite automata,transitiJn iable, p r oblem's'
o f K l e e n ' s t h e o r e m w i t h v a r i e t y o f
e r a t n p l eo f t r a n s t t t o ng r a p h s ,K l e e n ' s t h e o r e m ,P r o o f
(NFA) to Deterministic
Nondeterminism P .r o b l e m i sc o n v e r s i o nf r o m N o n d e t e r m i n i s t i cFsi n i t eA u t o m a t a
w i t h o u t p u t M
, o o r em a c h i n e M
, e a l y m a c h i n ed' e c i d a b i l i t y '
F i n i t eA u t o m a t a( D F A ) . F i n i t ea u t o m a t a

UNIT-II
- V a r i o u se x a m p l e ' si n c l u d i n gs y n t a xa n d
P u s h d o w nA u t o m a t a T h e o r y I : C o n t e x t F r e eG r a m m a r s :
. j n l l n t t c - \ . p r o c L t c I | o n(sg r a m m a t i c a lr u l e s ) . B a c k u s n o r m a l form, Parsetree, Regular grammar's:
v a r i o u se x a m p l e s '
D e l l n i t i o nt.h e o r e m& s e x i m p l e s ,C h o m s k y n o r m a lf o r m ,p u s h d o w na u t o m a t a '

UNIT-III

- D e f i n i t i o n ,T h e o r e m 'E x a m p l e sN
' on-
P u s h d o r r nA u t o m a t a T h e o r y I I : C o n t e x t F r e e L a n g u a g e s : Top-Down
and Definitions, Parsing:
Contert-FreeLanguages,lntersection& complem.nt, Th.or.n]
Parsing,Backtracking, PushdownTransducers, Decidabitity'

UNIT_IV
e x a m p l e sP , ost Machines: Definition
T u r n i n g T h e o r y : T u r n i n g m a c h i n e : D e f i n i t i o n ,t h e o r e m&
: e f i n i t i o nt,h e o r e m& e x a m p l e s .
t h e o r e ma n de x a m p l e sM, i n s k y ' st h e o r e mD

Tert Book:

l. t o C o m p u t e trh e o r y J, o h nW i e l y '
l . A . C o h e n :l n t r o d u c t i o n
Languagesand computatlon'
2. HopcroflJ.E.and ullman J.D. : lntroductionto automatatheory
N a r o s ap u b l i s h i n gh o u s e ,N e w - D e l h i '

ReferenceBooks:
NelvYork, 1987,
1' D e r i c kW o o d : T h e o r yo f C o m p u t a t i o nH, a r p e r s& r o w p u b l i s h e r
C o m p u t a t i o nP' H l , l 9 8 l
2. L e w l s t l . R . & P a p a d i m i t r i oiu. H . : E l e m e n i so f t h et h e o r yo f
lM.L'Minisky:Computations,flniteinfinitemachines,PrenticeHall,l96T.

i n t h e o r d i n a n c e' w f i r e v e r n e c e s s a r y "
S u b j e c t o t h e a p p r o v a lo f h i g h e r b o d i e sa f t e r d u e a m e n d m e n t

t, toh
fK'K''* /tn;
4[^",,^tt'.fu;-
 ; a i l e ds y l l a b u sM . S c c s 2 0 0 8 - 0 9 b , a s e do n t h e d e c i s i o nt a k e n b 1 B o S , C o m p u t e rS c i e n c eA, P S U '
, v i e w o f t h e g u i d e l i n e si s s u e db y M . P . H i g h e r E d u c a t i o n C o m m i s s i o n '
0 l / 1 4 . 0 8 . 0 8l n

Departmentof ComPuterScience
A. P. S. University,Rerva(MP)

Syl l a b u sfo r M.S c.(C om puterScience)- Thir d Semester

(S e s sion
2009- 10)

Paper (MCS- 305(A))- e-Commerce

3 hours M a x . M a r k s: 7 0
M i n . M a r k s: 2 4

UNIT I

I n t r o d u c t i o nt o e - c o m m e r c e: A n o v e r v i e w ,T h e L a w s o f t h e e - C o m m e r c jeu n g l e , o p p o r - t u n i t i ei ns e -
(.omnterce.ArchitecturalFramework fbr ElectronicCommerce,World Wide Web (WWW) as the
Architecture,Technology behind the Web, Security and the Web. The anatomy of e-Comnterce
application (consumer applications, organisation applications). Interorganizationalcommerce and
ElectronicDataInterchange (EDI), EDI Applicationsin Business,EDI and e-Commerce.

UNIT II

T h e E l e c t r o n i cI n f r a s t r u c t u r ef o r e - C o m m e r c e : M a r k e tf o r c e si n f l u e n c i n gt h e I - W a y . C o m p o n e n tosf
l n c I - \ \ a r . N e n v o r kA c c e s sE q u i p m e n tC . I o b a l I n f o r m a t i o nD i s t r i b u t i o nN e t w o r k s ,p u b l i c p o l i c y i s s u e s
shapingthe I-Way, the Internet as a network in{iastructure. Intraorganizational electroniccommerce:
l t o r n r a t i osny s t e m sm
l r l i r . r n i ti n . a c r o f o r c easn d i n t e m a lc o m m e r c ew. o d < f l o wa u t o m a t i o na n d c o o r d i n a t i o n ,
,Lrsronrzario a n d i n t e r n acl o m m e r c eS, u p p l yC h a i nM a n a g e m e n( S t CM).

UNIT III

e - M a r k e t i n ga n d e - S t r a t e g i e s :A d v e r - t i s i nagn d m a r k e t i n go n t h e I n t e r n e t i, n t e r n e tm a r k e t i n gm o d e l s .
o f f l i n em a r k e t i n gf b r o n l i n eb u s i n e s sc,h a r t i n gt h e o n - l i n em a r k e t i n gp r o c e s sd, a t am i n i n g ,m a r k e tr e s e a r c h .
e-commerceresource planning, knowledge management.consumer search and resource discovery,
i n f b r m a t i o ns e a r c ha n d r e t r i e v a l .e l e c t r o n i ccommercecataloguesor directories,information filtering.
consumer-data interface.

UNIT IV

E l e c t r o n i cP a y m e n tS y s t e m sa n d N e t w o r k S e c u r i t y :
ElectronicPaymentSystems:Types of elecfronicpaymentsystem,digital token-based electronicpayment
systems.smartcardsand electronic payment systems, credit card-based electronic payment systems,risk
and electronic payment systems, designing electronic payment systems. Network Security and Firewalls:
c l i e n t - s e r v enr e t w o r k s e c u r i t y .F i r e w a l l sa n d n e t w o r k s e c u r i t y ,c h a l l e n g e - r e s p o nssyes t e m s e
. ncrypted
d o c u m e n tasn de l e c t r o n i m c a i l . U S g o v e m m e nrte g u l a t i o a n n de n c r y p t i o n

B o o k sR e c o m m e n d e d :

I. Commcrce.KalakotaWhinston.PearsonEducationAsia.
[]rontierso1'[,lectronic

B o o k s:
Reference

I the completeidiot's guide,Rob Smith,Mark Speakerand Mark Thompson,PHI

e-(lommerce.

S u b j e c rt o t h e a p p r o v a lo f h i g h e r b o d i e sa f t e r d u e a m e n d m e n ti n t h e o r d i n a n c e, w h e r e v e r n e c e s s a r y .

&w --/')
t4r,t"V'---
 !anErr u,r uvJ r!rLrr!!t nr rvt
uelalleo syllaous lvl.Jc LJ zuuo-u7t uasuu ull tllc utst lslull tvurrrPur!r

d t 0 l / 1 4 . 0 8 . 0 I8n, v i e w o f t h e g u i d e l i n e s i s s u e d bMl . P . H i g h e r E d u c a t i oC
nommission'

Departmeno t f C o m p u t e rS c i e n c e
A. P. S. University,Rewa (MP)

S yl l a b u sfo r M.S c.(ComputerScience)- Thir d Sem ester

(Session
2009-10)
Paper ( MCS -305(C)): Advanced Computer Architectur
?0
Max.Marks.
Time: 3 hours Min.Marks.24

UNIT - I
P a r a l l e lP r o c e s s i n g :
Reducedinstructionset computers - CISC characteristics, RISC characteristics,overlappingregister
r . r i n d o w sT. h e B e r k l e yR I S C I s y s t e m l n t r o d u c t i otno P a r a l l ePl r o c e s s i n g - :E v o l u t i o no f C o m p u t esr y s t e m ,
a
p a r a l l e l i s mi s U n i p r o c e s s osr y s t e m s .p a r a l l e lc o m p u t e rs t r u c t u r e , r c h i schemes.
t e c t u r acl l a s s i f i c a t i o n
p a r a l l epl r o c e s s i nAgp p l i c a t i o n( B u s i n e s &
s scientific).

UNIT _ II
P r i n c i p l e so f P i p e l i n i n ga n d V e c t o r P r o c e s s i n g :
Principalof lineir pipelining,classificationof pipelineprocessors, Generalpipelines& Reservation Tables.
lnterleavedmemory organization,lnstruction& Arithmetic pipelines; - Design of pipelined lnstruction
t1nits,ArithmeticpipelinesDesign Examples.Multifunctionand array pipelines,Principlesof designing
pipelinedprocessors, Vector processing- Vector Operations,Matrix Multiplication,Memory Interleaving,
S u n e rC o m D u t e r s .
UNIT - III
Array Processors:
Struciuresand Algorithms for aray processors(SIMD Array processor,Marking and Data Routing
mechanisms. Inter-PEcommunication)SIMD lnterconnection Networks(StaticVersusDynamic.Network,
Mesh-Connected Iliac network, cube inter connection network) parallelalgorithmsfor Anay processors
( S I M D m a t r i xM u l t i p l i c a t i o np, a r a l l e sl o r t i n go n A r r a y p r o c e s s o r s )

UNIT _ IV
a
M u l t i p r o c e s s oArr c h i t e c t u r e n d p r o g r a m m ing:
Functional S t r u c t u r e (
s L o o s e l y c o u p l e d M u l t i p r o c e s s o r sT,i g h t l y c o u p l e d M u l t i p r o c e s s o r sP, r o c e s s o r
characteristic for Multiprocessing), lnter connection, Networks Time shared common bus. Multiport
Memory,CrossbarSwitch,MultistageSwitchingNetwork,Hyper Cube System,Inter Processor Arbitration
(systembus, serial arbitrationprocedure,parallelarbitrationlogic, dynamic arbitrationalgorithms),Inter
pio..rro, communicationand synchronization. Cachecoherence,Conditionsfbr incoherencesolutionto
cache coherence problem, Parallel memory organizations(lnterleaved memory configurations).
Multiprocessor OperatingSystems(classihcation of Multiprocessor operatingsystems).

Text Books:
l. Kai Hwang& I.ayeA. Prigs: ComputersArchitectureand parallelprocessing,MGH
2. M. Morris Mano: ComputerSystemArchitecture,PHI

ReferenceBooks:
l. Andrew S. Tannenbaum:StructuredComputerOrganization, PHI
2. J o h nP . H a y e s :C o m p u t e rS y s t e mA r c h i t e c t u raen dO r g a n i z a t i o nM, C H

S u b j e c t o t h e a p p r o v a lo f h i g h e r b o d i e sa f t e r d u e a m e n d m e n ti n t h e o r d i n a n c e ,w h e r e v e r n e c e s s a r y '
.'(t:-----.
,1
^t -=-R*);"
A\ fi\fwP-'-
D e t a i l e ds y l l a b u sM . S c C S 2 0 0 8 - 0 9 b , a s e do n t h e d e c i s i o nt a k e n b y B O S ' C o m p u t e r S c i e n c eA, P S U ,
d t 0 l / l 4 . 0 8 . 0 8I,n v i e w o f t h e g u i d e l i n e si s s u e db y M . P . H i g h e r E d u c a t i o n C o m m i s s i o n .

Departmentof ComputerScience
A.P.S.University,Rewa(M.P.)
Syllabusfor M.Sc.(Computer - ThirdSemester
Science)
(Session2009'10)
Paper-(MCS- 306) : S/W LAB V - ProblemsBasedon M.Sc. IT-302

M a x . M a r k s .7 0
Time:3 hours M i n . M a r k s .3 5

Part-A

l. Write C programfor drarvingline using

a) DDA algorithm
b) Bresenheim's algorithm
:. a) Write a C programfor drawingcircleand ellipseusingMidpoint Algorithm
b) Usethe rnidpoinrmethodandsymmetryconsideration to plot the parabola.
Y-100-x"
O v e rt h e i n t e r v a-l1 0 < x 5 l 0
3. a) Writea programto fill an ellipsewith solidcolor.
b) Write a programto implementalgorithmfor flood fillof a shape.
4. a) Write a programto displaya tine graphfor any setof datapointsin any selectedarea
of screen.with the input dataset scaledto fit the selectedscreenarea. Data pointsareto
be displayedas asterisks joined with straight-linesegmentsand the x and y-axesareto be
labeledaccordingto inputspecification.
b) Write programto plot bar graphfor the abovedata.
c) Writea programto plot pie chartfor the abovedataset.
Implementan antialiasing procedureby extendingBresenheim's line algorithmto adjustperiod
in the vicinitvof line
intensities path.

necessary'
S u b j e c t o t h e a p p r o v a lo f h i g h e r b o d i e sa f t e r d u e a m e n d m e n ti n t h e o r d i n a n c e, w h e r e v e r

P, zLJLLt __-<*i-