Bachelor of Technology (Computer Engineering) Scheme of Courses/Examination(6 Semester)

yoinkscreechedInternet και Εφαρμογές Web

13 Νοε 2013 (πριν από 3 χρόνια και 9 μήνες)

84 εμφανίσεις

1
.

CSE
-
3
20

Di
g
ital Sig
n
al

Processing

2.

CSE
-
3
2
1

M
u
lt
i
m
edia

Techn
i
que

3.

CSE
-
3
2
2

Gr
ap
h

T
h
e
o
ry

&

C
o
m
b
i
n
ati
o
ns

4.

CSE
-
3
2
3

L
o
gical of
P
r
o
g
ra
m
m
ing

5.

CSE
-
3
2
4

A
d
v
a
nced Da
t
abases

S
y
stem

6
.

CSE
-
3
25

Parallel C
o
m
pu
ti
n
g




Bachelor

of

Techn
o
logy

(Computer

Engineering)
Scheme

of

Courses/Examination

(6
th

Seme
s
t
er)


Sr.

N
o
.

Course

Subject

Teaching

Sch
e
dule

Exa
m
ination Schedule

Duration

of Exam

(
H
r.)




L

T

P/D

Tot

Th

Sess

P/VV

Tot



*

De
p
a
rt
m
e
n
t
Electi
v
e I

3

2

-

5

1
00

5
0

-

1
50

3

1.

CSE
-
3
02

M
ob
il
e
C
o
m
p
uti
n
g

4

2

-

6

1
00

5
0

-

1
50

3

2.

CSE
-
3
04

C
o
m
pu
ter Har
d
ware

Tec
h
no
l
ogies

4

1

-

5

1
00

2
5

-

1
25

3

3.

CSE
-
3
0
6

Net
w
o
r
k

Ma
n
a
ge
m
ent

& Sec
u
rity

4

1

-

5

1
00

5
0

-

1
50

3

4.

CSE
-
3
08

S
o
f
t
ware

E
ng
i
n
eer
i
n
g

4

1

-

5

1
00

2
5

-

1
25

3

5.

CSE
-
3
12

C
o
m
pu
ter Har
d
ware

&

T
r
ou
b
lesho
o
tin
g
(
P
r)

-

-

3

3

1
00

5
0

5
0

1
00

3

6.

CSE
-
3
14

M
ob
il
e
C
o
m
p
uti
ng
(Pr)

-

-

3

3

1
00

5
0

5
0

1
00

3

7.

CSE
-
3
1
6

Sof
t
ware

E
n
gineer
i
n
g
(
Pr
)

-

-

3

3

1
00

5
0

5
0

1
00

3

T
O
TA
L 19

7

9 35

1000


*

Dep
a
rt
m
ent Electi
v
e:



CSE
-
3
02

Mobile

C
o
m
puting


L

T

P

T
h
e
o
r
y
:
-

1
0
0

4

2

-

Secti
on
al:
-

5
0

Unit

1.





I
n
tro
du
ctio
n
:
C
h
alle
ng
e
s in m
ob
ile c
o
m
pu
tin
g
,

co
p
ing
w
ith
un
certai
n
ties,

reso
u
rce

p
o
or
n
e
ss,

b
andwi
d
th,

etc.Cell
u
lar

arc
h
itecture, c
o
-
c
h
a
nn
el
i
n
terfere
n
ce,

freq
u
e
n
cy re
u
se, ca
p
acity i
n
crease

by t
h
e cell s
p
litti
ng
. E
vo
l
u
ti
o
n

o
f
m
ob
ile
syste
m
:

CDMA,

FD
M
A,

T
D
MA,

GSM.

M
ob
ility Ma
n
a
g
e
m
e
n
t: Cell
ul
ar
arc
h
itect
u
re, co
-
c
h
a
n
n
el i
n
te
rfere
n
ce, Mobili
t
y:
h
an
d
off,
t
y
p
es

o
f
h
a
n
doffs: l
o
cation
m
anage
m
ent,

HLR
-
VLR,

hi
e
rar
c
h
ical sch
em
e,

pr
e
d
icti
v
e

l
o
cation

m
ana
g
e
m
ent sche
m
e,

M
obile

IP,

C
e
ll
u
lar

I
P
.

Unit

-
2

Pu
b
lis
h
ing &

Accessing Da
t
a in Air: P
u
ll a
n
d p
u
sh
b
ased

data del
i
very

m
odels,

data

disse
m
ination by
b
ro
a
dcast,
b
r
o
a
dcast di
s
k
s
,

d
i
rectory

se
rv
ice

in

air,

en
er
gy e
f
ficient i
nd
exi
n
g

s
c
he
m
e for
p
u
s
h bas
e
d

data di
s
k
s.

File System

Support for Mobility: Dis
t
ributed

file sh
a
ring for
m
obility supp
o
rt,
C
ODA

&

oth
e
r s
t
or
a
g
e

m
anager for
m
ob
il
i
ty s
u
p
p
ort.

Uni
t
-
3
.

A
d
-
h
oc

ne
t
w
or
k r
o
uti
n
g p
r
ot
o
cols

:

A
d
-
h
oc
n
etw
o
rk
r
outi
n
g
p
ro
t
ocols,

d
e
sti
n
ation se
q
u
en
ced distance v
e
ctor
alg
o
rit
h
m
,

cluster

bas
e
d

gat
e
way swit
c
h

rou
ting,

gl
o
b
al st
a
te

r
o
uti
n
g,

fis
h
-
e
y
e state

r
out
i
n
g
,

d
y
na
m
ic

state

r
o
uti
n
g,

A
d
-
h
oc

o
n d
em
and r
o
uti
n
g,

l
o
cati
o
n aid
e
d
r
outi
n
g,

l
o
cati
o
n

aid
e
d
r
outi
ng
,

z
o
nal

r
o
uti
n
g alg
o
rit
h
m
.

Uni
t
-
4
.

M
ob
ile tra
n
sacti
o
n &
C
o
mmerce: Mo
d
els f
o
r
m
ob
ile tra
n
s
acti
on
. Ka
ng
a
r
o
o and J
o
ey tra
n
sactio
n
s, team

tra
n
sactio
n
,
rec
o
very
m
od
e
l f
o
r

m
obile tr
a
n
sacti
o
n.

Elec
t
r
o
nic

pa
y
m
ent

&

pr
oto
c
ols

fo
r

m
obile co
mm
erce


N
o
te
:
-

There

will be eight

que
s
tions in all.

Two

questions

will be set

from

each unit.

Stud
e
nts
a
re

required
t
o
att
e
m
p
t fi
v
e questi
on
s

selecti
n
g

at least

on
e

q
u
estion

for each
un
it.


B
o
o
k
s

1
.

M
ob
ility: Pr
o
c
esses, c
o
m
pu
ters a
n
d A
g
e
n
ts,

De
j
a
n

Milo
j
icic, Fre
d
erick D
o
u
g
lis, Ric
h
ard

W
h
eeler,
Ad
d
ison
-
W
e
sley Pr
o
fess
i
on
a
l
; Ist E
d
iti
o
n(A
p
ril

1
9
,

1
99
9
).

2
.

Iv
a
n St
o
j
m
enovic

(
E
dit
o
r),

H
an
db
o
o
k
o
f
W
i
reless net
w
o
rk
s &

M
obile
C
o
m
puting, Wile
y
,

IS
B
N:
0
-

4
71
-
41
9
0
2
-
8
,

Feb
r
u
a
ry
20
0
2

3
.

Yi
-
Bing L
i
n & I
m
rich Chla
m
t
ac,

W
i
rel
e
ss
a
n
d Mobile Ne
t
works architectures”

4
.

Raj

Pan
d
ya, “

M
ob
ile a
n
d Perso
n
al
C
o
m
m
u
n
icati
on
s

system

and service
s
”.

Prentice

Hall of India,

2
00
1
.























CSE
-
3
02



Co
m
puter

Hardware

Technologies


L

T

P

T
h
e
o
r
y
:
-

1
0
0

4

1

-

Secti
on
al:
-

2
5

Unit

1.





M
e
m
o
ry





M
e
m
o
r
y
,

m
e
m
o
ry
c
h
i
p
s

&

m
o
d
u
les,

m
e
m
o
r
y t
y
p
es,

a
dv
an
ce
m
e
m
o
ry te
ch
n
o
l
o
g
ies,

tr
ou
b
les
ho
o
ti
n
g
m
e
m
o
r
y
.

Power

Supply

Power

Sup
p
ly

fu
n
ction

a
n
d o
p
eratin
g
,

power s
u
p
p
ly q
u
ality a
n
d s
p
ecificati
on
,

p
o
wer

p
r
o
j
ecti
o
n a
n
d
b
ack
u
p
,

b
ackup
p
o
wer syste
m
;
UPS; trou
b
lesh
oo
ting p
o
wer s
u
p
p
ly.

U
n
it

2

Motherboard

PC

fa
m
ily

tree,

m
o
therboard

c
on
t
rollers

and syst
e
m

res
o
urces, inp
u
t
-
o
u
tputs ports, I
R
Q.

I/O bus

syste
m
: I
S
A, M
C
A,
EI
S
A,

VE
S
A

l
o
cal bu
s
,

PC
L
,

A
G
P,

PCLX;

on

bo
ar
d

I
/
O

d
e
vices,
R
OMB
I
OS,

ROM

P
OS
T, C
O
OS

setup.

U
n
it
-
3

Interfaces
an
d

I/O Ports



Floppy

disk in
t
erface, IDE
i
n
t
erface: A
T
A s
t
and
a
rds,
m
aster
-
sl
a
ve
c
o
nfiguration,

data tr
a
n
sf
e
r

m
ode; SCSI
interface;

SCSL bus st
an
dards; whi
c
h is

better SCSI

or I
D
E
; Serial port
s
,

parallel ports,

USB, V
i
d
e
o
a
d
a
p
ters,
tr
o
uble
s
h
o
oti
n
g vid
e
o

a
d
apt
e
rs.

Unit
-
4

Devices

and

Peripherals

Flo
p
py

disk
d
ri
v
e,

h
a
rd di
s
k
d
ri
v
e,

CD

R
OM

d
ri
v
e,

DV
D

R
OM
d
ri
v
e
,

rec
o
rd
a
b
le

dri
v
e
s,

ke
yb
o
a
r
d,

m
ice,

p
ri
n
te
r
s
and
m
onit
o
rs,

tr
ou
b
le
-
s
h
o
oti
n
g dr
i
v
es

a
n
d p
e
ri
p
h
ales.


N
o
te
:
-

There

will be eight

que
s
tions in all.

Two

questions

will be set

from

each unit.

Stud
e
nts
a
re

required
t
o
att
e
m
p
t fi
v
e
questi
on
s

selecti
n
g

at least

on
e

q
u
estion

for each
un
it.



B
o
o
k
s

1
.

Craig Za
c
k
e
r &
J
o
hn
R
o
urtrc: PC H
a
rdwr
a
e
-

T
h
e
C
o
m
p
l
e
te Refer
e
nce,

TM
H.

2
.

Mark

M
i
no
si:

T
h
e
C
o
m
p
lete PC U
p
gra
d
e & Mai
n
te
n
a
n
ce

G
u
i
d
e
4
/e, BPB

Pu
b
licati
o
n

3
.

S.
K
.C
h
au
han:

PC
U
p
g
r
a
d
e

&

M
ai
n
ten
a
nce

a
n
d t
r
o
u
bles
hoo
ting gu
i
de.









CSE
-
3
02

Network

Management

and

Security


L

T

P

T
h
e
o
r
y
:
-

1
0
0

4

1

-

Secti
on
al:
-

5
0

Unit

1.





Int
ro
ducti
o
n:

Need a
n
d

basic

g
o
als

fo
r

c
o
m
put
e
r,

se
cu
rit
y
,

sec
u
rity t
h
rea
t
s

etc.

Cr
y
p
t
o
g
r
aphic

b
u
il
d
i
n
g

blo
c
ks:

sy
m
m
etric

and as
ymm
etric key cr
y
p
t
o
gr
ap
h
y
,

cr
y
p
t
o
gr
a
phic

ha
s
h f
u
ncti
o
n
s
,

d
i
gital signa
t
u
re

sche
m
es

etc., with
repres
e
n
tative

application for

each.

Uni
t
-
2

Op
e
rating sys
t
e
m

security: low
-
l
e
vel protec
t
ion
m
echanisms, access

control:
m
odels for

access control,

so
m
e
confid
e
n
tiality,

integrity and hybrid
m
odels of access control su
c
h

as

Bell
-
La P
a
dula, Biba, Ch
i
n
ese

Wa
l
l etc.,

Discretionary

v/s
m
andatory

access c
ontrol.

Case Studies:
J
ava access

control

policy sp
e
cification,

S
EL
inux se
c
u
rity

m
odel and i
m
pl
e
m
entation. Program

flaws;

b
u
gs

w
h
ich h
a
ve

se
c
u
rity i
m
plications

s
u
c
h as

b
u
ff
e
r

ov
e
r
f
l
o
w,

race

c
on
d
ition

etc.

Uni
t
-
3

Me
d
icati
o
n

C
o
d
e: V
i
r
u
ses,

w
o
r
m
s, Tr
oj
an h
o
rses;

h
o
w t
h
ey a
n
d how

to defend

a
g
ai
n
st
t
h
e
m
.

Net
w
o
r
k

S
ec
ur
it
y
: Problem

in

net
wo
rk sec
ur
it
y
; Kind

of attacks,

P
K
L,

K
e
y exch
an
ge

p
ro
tocols,

exa
m
ple

p
ro
t
ocol
su
c
h

as

PGP,

Kerbero
s
, IPSEC/VPN, SSL, S/MIME etc.

Uni
t
-
4

Pr
o
t
o
c
o
l v
u
l
n
era
b
ilities: e
x
a
m
p
le
o
f

pr
o
t
o
c
o
l v
u
l
n
era
b
ilit
i
es

s
u
ch

as in TCP/IP,

d
e
n
ial

of ser
v
ice attacks, etc.

T
o
ols

f
o
r ne
t
w
o
r
k

se
cu
rity s
u
ch

as

fir
e
wall
a
n
d i
n
t
r
usi
o
n

d
e
tection

s
y
ste
m
s.


N
o
te
:
-

There

will be eight

que
s
tions in all.

Two

questions

will be set

from

each unit.

Stud
e
nts
a
re

required
t
o
att
e
m
p
t fi
v
e questi
on
s

selecti
n
g

at least

on
e

q
u
estion

for each
un
it.



B
o
o
k
s

1
.

Michael
E
Whitman &

Herbert

J. M
a
tt
o
r
d
,

P
ri
n
ciples of
I
n
fo
r
m
ation

Se
cu
rit
y
,

Vika
s
h P
ub
lishing

H
o
use

P
V
T.

L
TD
.
,

N
ew

De
l
h
i.

2
.

W
illiam

Stal
l
i
n
g


C
ry
p
tograp
h
y and Network

Security: Pearson Ed
u
cation.

3
.

Charles

P.

Pfl
e
eger” Sec
u
rity

in

C
o
m
pu
tin
g


Pre
n
tice Hall.

4
.

Jeff Cru
m
e ” Inside

Internet

Security” Add
i
son

Wesley.







CSE
-
3
0
8



Sof
t
ware

E
ng
i
neer
i
n
g



L

T

P


T
h
e
o
r
y
:

1
0
0

4

1

-


Sessi
o
n
al:

2
5

U
n
it
-
1
.






Sof
t
ware

a
n
d

s
o
f
t
ware

en
gin
e
eri
n
g
-

S
o
ftw
a
re ch
a
racteristics,
s
o
ftw
a
re
c
ri
s
is,

s
o
ftw
a
re

en
gine
e
ri
n
g par
a
dig
m
s.

Plann
i
ng a

s
o
f
t
ware

p
r
o
j
ect
-
s
of
t
ware

c
o
st e
s
t
i
m
a
tion,

p
ro
j
e
ct sch
e
duli
n
g,

per
so
n
al pl
a
nn
i
n
g
,

term

struc
t
ur
e
.
U
n
it

2
.

Sof
t
ware

c
on
fi
g
u
rati
o
n

m
anage
m
ent,

quali
t
y ass
ur
anc
e
,

p
r
oject
m
onit
o
ri
n
g
, risk
m
anage
m
ent.

Sof
t
ware

r
e
quire
m
ent analysis
-

Struc
t
ure

an
al
y
sis,

o
b
ject

o
riented anal
y
s
i
s a
n
d

data
m
o
d
eling,

s
o
ftw
a
re

r
e
quire
m
ent
s
p
ecificatio
n
,

vali
d
ati
on
.

U
n
it
-
3
.

Desi
g
n

an
d

i
m
ple
m
entation

o
f

s
o
ft
w
are


S
o
ftware

d
e
si
g
n

f
u
n
d
a
m
entals,

d
esign
m
ethodo
l
ogy

(st
r
uct
u
red des
i
gn a
n
d
o
b
ject

ori
e
nted des
i
g
n
), des
i
g
n verificati
o
n,

m
onit
o
ring a
n
d c
o
nt
r
o
l c
o
di
ng
.

S
o
f
t
ware Relia
b
ilities: Metric

and

s
p
ecificati
o
n,

fa
u
lt
a
vo
i
da
n
c
e
a
n
d
t
o
lera
n
ce
,
e
x
ce
p
t
aio
n
h
a
n
d
lin
g
,

d
efe
n
s
i
v
e
p
ro
g
ra
mm
ing.

U
n
it
-
4
.

Testing


Testi
n
g
fu
nda
m
entals,

w
h
ile
bo
x

a
n
d bla
c
k b
o
x
s
o
f
t
ware testi
n
g S
o
ftw
a
re Test
i
n
g Strate
g
ies:

U
n
it testin
g
,
i
n
te
g
ration

tes
t
i
ng
,

v
ali
d
at
i
o
n

testi
ng
,

system testi
ng
,

d
e
b
u
g
g
in
g
.

S
o
f
t
ware Mainte
n
a
n
ce



Ma
i
n
te
n
a
n
ce c
h
aracteristics,
m
a
in

te
n
a
b
ility,
m
a
in
te
n
a
n
ce tas
k
,

mai
n
te
n
a
n
ce s
i
d
e effect.
CASE

t
ool
s
.


Note:

-

There

will be

8

qu
e
stions in all. Two questions

will set from

each unit. Stud
e
n
ts are r
e
quir
e
d
t
o

a
t
t
e
m
p
t five
qu
e
stions

sele
c
ting at lea
s
t

one question from

each unit.


B
o
o
k
:

1
.

Press
m
an

S. R
og
e
r, S
o
ftware

En
g
i
n
eer
i
n
g, Tata McGraw
-
Hill.

2
.

Jal
o
te P
a
nk
a
j,

An
I
n
te
g
rated A
p
p
r
o
c
h

t
o

So
ftware

E
ng
i
ne
e
ri
n
g, Na
r
o
sa

P
u
b
.

H
o
use.

3
.

S
o
m
m
er
v
ille l
an
,

Software En
g
i
n
eerin
g
,

5
th

e
d
.
,
A
d
iso
n

W
esley
-
2
00
0
.

4
.

Fairley Ric
h
ar
d
,

Software,

S
o
f
t
ware

En
g
i
n
e
ering

Co
n
ce
p
ts, Tata McGraw
-
Hill.








CSE
-
3
12

C
o
m
pu
ter

H
a
r
d
w
a
re

& Trou
b
lesho
o
ti
n
g (
P
r.)

L

T

P

T
h
e
o
r
y
:

5
0

-


-


3


Sessi
o
n
al:

5
0

1
.

To

s
o
l
d
e
r

an
d de
-
s
old
e
r var
i
o
u
s

c
o
m
pon
e
nt
s
.

2
.

To

c
h
eck

a
n
d

meas
u
re

v
ar
i
o
u
s sup
p
ly v
o
ltage of

PC.

3
.

To

m
a
k
e c
o
m
p
arati
v
e stu
d
y

of

m
o
t
h
erb
o
ar
d
;

3
8
6,

4
8
6
,

PI,

PII, PIII.

4
.

To
o
b
se
r
v
e

an
d

s
t
udy

var
i
o
u
s

cables,

c
on
n
e
c
tion

a
n
d p
a
rts us
e
d

in co
m
pu
t
er

c
o
m
m
unication.

5
.

To s
t
udy

v
a
rious c
a
rds

use in

syst
e
m

viz. Di
s
p
lay cards,

LAN c
a
rd etc.

6
.

To

re
m
ove,

s
t
udy

and

r
e
place

floppy

disk dr
i
v
e.

7
.

To

re
m
ove, s
t
udy and

r
e
place

hard

disk.

8
.

To

re
m
ove, s
t
udy and

r
e
place

CD ROM

drive.

9
.

To

s
t
udy
m
onit
o
r
,

its cir
c
uitry a
n
d var
i
ous

pr
eset a
n
d

s
o
m
e

ele
m
entary fa
u
lt detection.

1
0
.

To

s
t
ud
y

pri
n
ter asse
m
b
ly a
n
d
el
e
m
e
n
tary

fa
u
lt
d
etection
o
f D
M
P and

laser

p
ri
n
ter.

1
1
.

To

o
b
se
r
v
e

va
r
ious

cables

an
d c
o
nnec
t
ors

us
ed

in ne
t
w
or
kin
g
.

1
2
.

To

s
t
udy

p
a
rts of ke
y
bo
a
rd a
n
d

m
ouse.

1
3
.

To a
s
se
m
b
le a PC.

1
4
.

Tr
ou
b
les
ho
o
ti
n
g

e
x
ercise related

to a
var
i
ous

co
m
pon
e
nts of co
m
puter

li
k
e

m
onit
o
r, dri
v
e
s
,

m
e
m
o
ry and
pr
i
n
ters etc.


B
o
o
k
s:

1
.

Mark

M
i
n
es
C
o
m
p
lete PC
u
p
g
ra
d
e

&
m
ai
nt
e
n
a
n
ce g
u
ide,

BPB Pu
b
licati
o
n.

2
.

Craig Za
c
k
e
r &
J
o
hn
R
o
uske, PC

Hardware: The
c
o
m
p
lete ref
e
r
e
nce,

TM
H.

3
.

Sc
o
tt M
u
eller,

U
p
g
r
a
d
i
n
g and Rep
o
rting

PCs, PHI,

19
9
9.



CSE
-
3
14



C
o
m
pu
ter

H
a
r
d
w
a
re

& Trou
b
lesho
o
ti
n
g (
P
r.)


L

T

P

T
h
e
o
r
y
:

5
0

-

-

3

Sessi
o
n
al:

5
0

1
.

Desi
g
n

a

p
ro
t
o
t
y
p
e

t
h
at i
m
ple
m
ents t
h
e

Ca
c
h
e

m
anage
m
ent f
o
r

a

m
obile
c
o
m
puting

en
vi
r
on
m
en
t
?

2
.

Design

a system: T
h
e c
h
allen
g
es

o
f
d
e
v
elo
p
i
n
g
h
i
g
h
p
e
rforma
n
ce,
h
i
g
h relia
b
ility

a
n
d

h
i
g
h q
u
ality s
o
f
t
ware
s
y
stem

are

t
o
o

m
u
ch

f
o
r

a
d
-
h
oc

a
n
d i
n
f
o
r
m
al eng
i
neer
i
n
g techn
i
qu
e
s

t
h
at

m
ight h
a
ve w
o
rk
e
d

i
n

t
h
e

past

o
n
less
d
e
m
a
nd
ing

syste
m
. New tec
hn
i
qu
e
s for
m
a
n
a
g
i
n
g

t
h
ese growing

c
o
m
p
le
x
ities are re
qu
i
red to

m
eet
t
od
ay’s t
i
m
e
-
m
ar
k
et, prod
u
cti
v
ity a
n
d q
u
ality
d
e
m
a
nd
.

3
.

Peer
-
t
o
-
peer c
omm
unication

sy
ste
m
: As

co
m
put
e
r beco
m
e
m
o
re

pe
r
v
asi
v
e

a
n
d

ho
m
es

b
e
co
m
e better
c
o
n
n
ected, a new

g
e
n
e
ration
o
f ap
p
licati
o
n will
b
e

d
e
v
e
l
o
p
e
d o
v
er t
h
e inter
n
et.

In t
h
is

m
od
el,

Peer
-
to
-
p
eer
a
pp
lication
b
ec
o
m
e
v
ery attracti
n
g
b
eca
u
se
t
h
ey i
m
p
r
ov
e

scala
b
ility a
n
d

e
nh
a
n
ce

p
e
rf
o
r
ma
n
ce
b
y e
n
abli
n
g

direct
a
n
d real
-
ti
m
e c
o
m
m
unication a
m
ong
t
h
e

peer
s
.

We

need to propose

a dec
e
ntralized
m
anage
m
ent

s
y
stem

t
h
at

m
a
nag
e
s

t
h
e

Pee
r
-
to
-
peer

ap
plications

an
d

t
h
e

sy
stem

reso
u
rc
e
s

in

a
n

i
n
teg
r
ated

wa
y
;
m
onit
o
rs
t
h
e

b
e
h
a
vi
o
r of t
h
e

Pe
e
r
-
t
o
-
p
e
er

a
pplicati
o
n
s

t
r
an
s
p
ar
e
n
tly and obtains

ac
c
urate

re
s
o
urce

projection
s
,
m
anages

t
h
e

c
o
n
n
ecti
o
ns

be
t
ween t
h
e

pe
e
rs

a
n
d

distri
b
u
tes

t
h
e

o
b
jects

i
n res
po
n
se

t
o

t
h
e

us
e
r re
q
u
ests
a
n
d
c
h
an
g
ing pr
o
cessi
n
g and
n
etw
o
r
k
ing

co
nd
itio
n
s.

4
.

Write

p
r
o
g
ram t
h
at

i
m
p
l
e
m
en
t t
h
e

few s
o
rt
i
n
g alg
o
rit
h
m
s (B
u
b
b
le, select
i
o
n etc.)

n

d
ata. It sto
p
s t
h
e
op
e
rati
o
n wh
e
n

t
h
e

c
ou
n
ter
f
o
r s
o
rti
n
g

i
n
d
e
x

is at

1
0
0
,

1
00
0
,
1
0
00
0

a
n
d
s
o o
n
,

s
t
ores

t
h
e

c
o
ntents

of t
h
e
re
g
isters,

p
r
o
g
r
a
m

c
o
u
n
ter and
p
artially s
o
r
t
ed

list of

d
a
ta,

etc. It r
e
su
m
es the op
e
ration
a
fter

30 sec. from

t
h
e p
o
i
n
t

of t
h
e ter
m
i
n
ati
on
.

5
.

Write a

p
r
o
g
ram

t
h
e
i
m
p
l
e
m
en
t t
h
e

b
u
b
b
le s
o
rt

for

n
d
ata.

It st
op
s

t
h
e

o
p
erati
o
n w
h
en

t
h
e

c
o
u
n
ter f
o
r
s
o
r
tin
g

i
nd
e
x

i
s
a
t
10
0
.
1
00
0
.1
0
00
0

a
n
d
s
o
o
n
,
sto
r
e
s
t
h
e
c
o
nte
n
t
s
o
f

t
h
e r
egiste
r
s
,

p
r
o
g
ram
co
un
t
e
r

a
n
d
p
artially s
o
rted list
o
f
d
ata, etc. It

tr
a
n
s
fers

the code
a
n
d da
t
a across
t
h
e

network on
t
h
e

n
e
w

destination
a
n
d
res
u
m
es t
h
e

o
p
erati
o
n fr
o
m

t
h
e p
o
i
n
t

o
f termi
n
ati
o
n on

t
h
e

p
re
v
io
u
s

n
od
e
.

Fi
n
ally t
h
e res
u
lt fr
o
m

t
h
e last
n
o
d
e
i
n

t
h
e itinerary is send back

to t
h
e

pr
o
c
ess
-
i
n
itiati
n
g n
od
e
.

6
.

De
v
e
l
o
p a

p
r
o
t
o
c
o
l
t
h
at perfor
m
s
p
arallel co
m
pu
tati
o
n

of

t
h
e sa
m
e task

on
d
iff
e
r
e
n
t nodes. F
i
n
ally
p
r
ocess
initiator (
m
ast
e
r

node) rece
i
v
e
s the

result and co
m
putation time required to

co
m
p
lete the task

on
a
n

ea
c
h
n
o
de

an
d disp
l
a
y
s to

t
h
e

us
e
r.

C
o
m
p
are

t
h
e

c
o
m
puting
p
o
w
er of di
f
fer
e
n
t

n
o
de
s
.


B
o
o
k
:

1
.

M
ob
ility: Pr
o
c
esses,
C
o
m
pu
ter, and A
g
e
n
ts, De
j
an Mil
oj
i
c
i
c, Fre
d
erick D
o
u
g
lis, Ric
h
ard

W
h
eeler, Ad
d
i
s
o
n
-

Wesley Profe
s
sional;

1
st

e
d
.
(
A
p
ril
1
9
,1
9
9
9)

2
.

Iv
a
n St
o
j
m
enovic(
E
d
it
o
r
), H
a
n
db
o
o
k
o
f
W
i
r
eless

Net
wo
rk

and
Mo
bile C
o
m
puting
m
,

W
i
l
e
y
,

IS
B
N:
0
-
4
7
1
-

4
19
0
2
-
8
,

Febr
u
ary

2
0
02

3
.

C
o
re Java

V
o
l.

I &

I
I f
r
om

S
u
n

M
ic
r
o

S
y
st
e
m
.

4
.

H
u
ges,

J
a
va

N
etw
o
rk
i
ng ,

Hu
t P
u
b.

P
u
ne.

5
.

Ja
v
a

2
: T
h
e
C
o
m
p
l
e
te Reference
4
/e; Her
b
ert

Sc
h
il
d
t, TMH, Del
h
i.

6
.

Ja
v
a Bea
n
s

Pro
g
ram
m
i
n
g

from

t
h
e Grou
n
d

U
p
: J
o
seph O’Neil,
TMH,

Del
h
i.

7
.

Ja
v
a

Ser
v
lets: Ap
p
licati
o
n De
v
el
op
m
e
n
t; Karl M
o
ss, T
M
H, Del
h
i.










CSE
-
3
16



C
o
m
pu
ter

H
a
r
d
w
a
re

& Trou
b
lesho
o
ti
n
g (
P
r.)


L

T

P

T
h
e
o
r
y
:

5
0

-

-

3

Sessi
o
n
al:

5
0

1
.

(i)

I
m
pl
e
m
ent

Receipt A
c
knowledge
m
e
n
t and

updating

of Inv
e
ntory(
R
AUP)

a)

Fi
n
d
U
n
a
d
j
u
ste
d

Fu
n
c
ti
on
al

p
o
i
n
ts(UFP)

b
)

Calculate FPC

by Mark

II M
e
thod

(ii) To

est
i
mate effort and sc
h
e
d
u
le

Calculate

t
h
e

c
o
m
p
ressi
o
n

fa
c
tor

an
d

t
h
e

m
a
n
po
wer bas
e
d

on g
i
ven i
n
f
orm
ation

o
f

s
o
f
t
war
e
.

2
.

S
u
ggest

an acti
o
n pl
a
n f
o
r

t
h
e

foll
o
wi
n
g risks

wit
h
out
c
o
m
p
r
o
m
ising

t
h
e

p
r
oject,

pr
ocess

or
p
r
od
u
ct
para
m
eters

a)

Lan
gu
a
g
e s
k
ills i
n
a
d
eq
u
ate in two
p
e
o
p
le in a term

o
f

f
i
v
e.

b
)

Specially o
r
d
er
ed

ha
rd
ware

an
d

s
o
f
t
ware

li
k
e
ly to

be

deli
v
er
ed

t
h
ree

m
ont
h
s later.

c)

Custo
m
er and
t
h
e
e
n
d user

not conv
i
nced to

t
h
e new tec
h
no
l
ogy i
m
ple
m
entation

as

a

c
o
r
r
e
ct
choice.

d
)

Sof
t
ware

r
e
quired interface

with oth
e
r te
c
h
nolog
i
es

on wh
i
ch the

project
t
e
a
m

has

no experi
e
n
ce.

3
.

I
m
p
l
e
m
e
n
ta
t
i
o
n

a testing

s
t
rate
g
y f
o
r t
h
e

f
o
ll
o
w
i
n
g software
d
e
v
elo
p
m
e
n
t cases:

a)

R
u
le
b
ased
d
e
t
er
m
i
n
is
t
ic cl
o
sed

lar
g
e

b
u
t s
im
p
le
p
ayr
o
ll syst
e
m

f
o
r a co
m
p
a
n
y.

b
)

Deve
l
op
m
ent
o
f

a

c
u
sto
m
er

r
e
lation

m
anag
em
ent s
y
stem

f
o
r

a

retail distri
b
u
ti
o
n cha
i
n.

T
h
e

retail
o
r
g
a
nization

is

n
o
t
s
u
re

ab
out

t
h
e

s
co
p
e

a
n
d

t
h
e

fail
u
re

featur
e
.

c)

M
od
ification

t
o

e
x
iti
n
g or
d
e
r

p
r
o
cess
i
n
g syst
e
m

f
o
r a
m
u
lti
-

l
o
cati
o
n
m
u
lt
i
-

p
r
o
d
u
ct c
o
m
p
a
n
y.

4
.

B
u
ild

a

w
o
rk breakd
o
wn

s
t
ru
c
ture

f
o
r

t
h
e

f
o
l
l
ow
i
n
g

a)

Deli
v
ery

o
f t
h
e software,
i
n
itiati
o
n

to
d
e
v
e
l
o
p
m
e
n
t c
ov
e
ring

lifecycle.
b
)

Deve
l
op
m
ent
o
f p
r
oto
c
ol.

c)

Deve
l
op
m
ent
o
f

a

p
r
ocess

f
o
r

a

f
uncti
o
n.

5
.

In a ho
s
pital
m
anage
m
ent s
y
stem

devel
o
p

t
h
e

f
o
llow
i
ng di
ag
ram

for

a

W
a
rd se
r
v
ices

m
anage
m
ent
s
y
ste
m
(S
M
W).

a)

W
or
k

F
l
o
w
.

b
)

System

Flow.
c)

D
F
D.

Deve
l
o
p
o
n

e
f
f
ecti
v
e

m
odular des
i
gn
o
f

S
M
W

usi
n
g

t
h
ese

dia
g
ra
m
s.

6
.

Dr
a
w

t
h
ree l
e
vel DFD’s

for CLPS.
M
o
dul
a
rize the CLPS

a
n
d the

struc
t
ure them

top
-
down as

functional
m
odel.

7
.

Conduct a task analysis

f
o
r the f
o
ll
o
w
i
n
g
u
s
ers:

a)

O
f
ficer

at

railway tic
k
et reser
v
ation window
b
)

Officer at
i
n
surance claim

settl
e
m
ent desk

c)

Clerk at call c
e
nter, an
s
w
e
ring

qu
i
res

of cus
t
o
m
er

w
h
o

h
av
e
p
u
r
c
has
e
d

c
a
rs

fo
rm

t
h
e

c
o
m
p
an
y
.

8
.

Based

on t
h
e

b
u
siness

m
odel

of D
F
D

d
e
vel
o
p

a

m
o
d
u
lar

s
t
r
u
ct
u
re

fo
r

a

bu
si
n
ess

s
y
stem

m
odel.

Dr
a
w

a
co
m
p
lete syst
e
m

flowchart.


B
o
o
k
s


a.

W.S

Ja
w
ad
e
k
a
r,

So
ftw
a
re

En
gine
e
ri
n
g

P
ri
n
c
ipal a
n
d A
pp
r
o
ches,

T
MH
,
20
0
4
b
.

Press
m
an

S.
R
o
ger,

S
o
f
t
ware

E
n
g
i
n
eer
i
n
g, Tata McGraw
-
Hill

c.

Jal
o
te P
a
nk
a
j,

An
I
n
te
g
rated A
p
p
r
o
c
h

t
o

So
ftware

E
ng
i
ne
e
ri
n
g, Na
r
o
sa

P
u
b
.

H
o
use.
d
.

S
o
m
m
er
v
ille l
an
,

Software En
g
i
n
eerin
g
,

5
th

e
d
.
,
A
d
iso
n

W
esley
-
2
00
0
.

e.

Fairley Ric
h
ar
d
,

Software,

S
o
f
t
ware

En
g
i
n
e
ering

Co
n
ce
p
ts, Tata McGraw
-
Hill.




CSE
-
320

Di
g
ital Sig
n
al

Processing

(De
p
art
m
e
n
tal Electi
v
e I)

L

T

P

T
h
e
o
r
y
:

5
0

-


-


3

Sessi
o
n
al:

5
0

Unit

1.
Int
r
odu
c
tion

Signal,

s
y
stem

and si
g
n
al

p
r
o
c
essin
g
,

classif
i
cation

of si
g
n
a
ls,

c
o
nc
e
p
t
o
f
f
re
q
u
e
ncy in

co
nti
n
uo
u
s

ti
m
e

and
d
iscrete.

Ti
m
e

si
gn
als. A
n
alog

to
d
i
g
ital and
d
i
g
ital to a
n
a
l
o
g con
v
ers
i
o
n
,

Discrete ti
m
e
s
i
gn
als,
d
iscrete t
i
m
e

syst
e
m
,

LTI

s
y
st
e
m
s,

diff
e
r
e
n
ce

e
q
uati
o
ns,

a
n
d i
m
ple
m
ent
a
tion of dis
c
rete t
i
m
e s
y
ste
m
.

Unit

2

Z
-
transform

and
I
ts

Application
s
.

Z
-
tr
a
n
s
f
or
m
,

p
r
o
p
erties of Z
-
t
ran
sf
or
m
,

inv
e
rsi
o
n of Z
-
tr
an
sf
o
r
m
,

applications

o
f

Z
-
tr
a
n
s
f
o
r
m
.

Discrete

F
o
urier
Transfor
m
(D
F
T),

properties

of D
F
T,

L
i
near filtering
m
ethods

based on
t
h
e

DF
T
,

fr
e
qu
e
ncy analysis

of signals
usi
n
g

t
h
e

DFT.

Unit

3

Fa
s
t

F
o
urier

Transform

a
n
d Its

Applications

FFT a
l
g
o
rit
h
ms(Ra
d
i
x 2

FFT) alg
o
rit
h
m
,

im
p
le
m
e
n
tati
o
n of Dis
t
rete ti
m
e Syst
e
m
, struc
t
ure

of
F
IR sys
t
e
m
,
Direct
from
structure, cas
c
ade

form

structur
e
,

p
a
rallel for
m
,

st
r
u
ct
u
re
f
o
r
II
R
syst
e
m
,

cascade,

direct

form

and

parallel
f
rom

struc
t
ure.

Unit

4

Desi
g
n

of

Di
g
i
t
a
l Filter

Design

of IIR filters, Bilinear

tra
n
s
for
m
ation

and i
m
pulse invari
a
n
ce
m
ethod, Mat
c
hed Z
t
ran
sf
or
m
ation design

o
f FIR

filter

with

d
i
ffere
n
t
m
et
h
o
d
s.



Note:

-

There

will be

8

qu
e
stions in all. Two
questions

will set from

each unit. Stud
e
n
ts are r
e
quir
e
d
t
o

a
t
t
e
m
p
t
five

questions

selecting at le
a
st one

question from

each uni
t
.


B
o
o
k
:

1
.

Jo
h
n G
.
P
r
o
a
kis

a
n
d Di
m
itris G.

Ma
no
l
a
k
is,

Di
g
ital Sig
n
al

Processin
g
, PHI

2
.

O
p
p
e
nheim

&

Sch
a
ff
e
r, Digi
t
al Signal

P
r
oc
e
ssin
g
,

P
HI

3
.

Ra
b
i
n
er &

G
o
l
d
,

Di
g
ital Signal Pr
o
cessing

a
pp
licatio
n
.

4
.

S.K.Mitra,

Digital Si
gn
al Processi
n
g
,TMH.

5
.

S.Sali
v
ay
h
a
n
,

A

Valla
v
ra
j
, C. G
n
a
n
apriya, Di
g
ital Si
gn
al

Pr
o
cessin
g
,TMH.






CSE
-
320

Di
g
ital Sig
n
al

Processing

(De
p
art
m
e
n
tal Electi
v
e I)

L

T

P

T
h
e
o
r
y
:

5
0

-


-


3

Sessi
o
n
al:

5
0

Unit

1.

B
a
sic of

Mult
i
media Technology

C
o
m
puters,

comm
unication

a
n
d ent
e
rtain
m
ent,

m
u
lt
i
m
edia
-

a
n

i
n
t
ro
duct
i
on;

fra
m
ew
o
rk
f
o
r

m
u
lt
i
m
edia

s
y
ste
m
;

m
u
lti
m
edia devices,
C
D Audio,
C
D

ROM,

CD
-
1; r
e
pr
e
sentation d
e
vices

and the

us
e
r

in
t
erface;
m
u
ltimedia
re
p
res
e
n
tation

and au
t
h
o
ri
n
g;

p
r
of
e
ssi
o
n
al d
e
vel
o
p
m
ent too
l
s; L
A
Ns

an
d

m
u
lt
i
m
edia,

i
n
te
r
n
et,

W
W
W

a
n
d
m
u
l
t
i
m
ed
i
a; dis
t
r
i
bu
tio
n

ne
tw
o
r
k
-

A
TM a
n
d

A
D
SL;
m
u
lt
i
med
i
a

se
r
v
e
rs

an
d

da
t
a b
a
ses;
v
ec
t
or

gr
ap
h
i
cs;
3
D
gr
ap
hics

pr
o
gr
a
m
s; ani
m
ation

technics;
s
h
ad
ing;
a
n
ti aliasin
g
,

m
o
r
p
hi
n
g
,

vid
e
o on de
m
and

Unit

-
2

Image

Comp
r
ession

And Standards

Ma
k
ing

still ima
g
es, e
d
iti
n
g a
n
d
ca
p
t
u
r
i
n
g ima
g
es, sca
nn
i
ng

i
m
a
g
es, c
o
m
pu
ter c
o
lo
u
r

m
od
els, c
o
l
o
r
p
a
l
ettes,
v
ector
d
rawing, 3 D draw
i
n
g a
n
d r
e
n
d
erin
g
,

JPEG
-

ob
jectives and
a
rchite
c
tures, JP
EG
-

DCT en
c
od
i
ng
a
n
d

qu
a
n
tizati
o
n, JPEG

statistical

co
d
ing,

JP
E
G pr
e
d
icti
v
e

l
o
ssless

c
o
di
n
g
,

J
P
EG

pe
rf
o
r
m
ance,

o
v
e
rvi
e
w
o
f other
i
m
age file format as GIF,
TI
FF, BMP,

ONG etc.

Uni
t
-
3

Aud
i
o

And

V
i
deo

Di
g
ital re
p
rese
n
tati
o
n of s
o
un
d
, ti
m
e
do
m
ain

sa
m
p
led

repre
s
entati
o
n
,

m
ethod
o
f

e
n
c
od
i
ng t
h
e

a
n
al
o
g

s
i
g
n
als,
su
b
-
ba
n
d

co
di
n
g
, F
o
uri
e
r

m
eth
o
d
,

tr
a
n
s
m
ission
o
f
digital s
o
u
n
d,

d
i
gital a
u
dio si
g
n
al
p
ro
c
essin
g
,

ster
eop
h
o
n
ic

and
q
u
a
d
r
ap
h
o
n
ic
pr
ocessi
n
g editing,

sa
m
p
led

s
o
un
d
,

M
P
E
G

a
ud
i
o

c
o
m
p
ression a
n
d

de
c
o
m
p
ressi
o
n
,

b
r
ief
su
r
v
ey

of spe
e
ch

rec
og
n
ition

and g
e
n
e
rati
o
n
,

a
u
dio s
y
n
t
he
s
is,

m
u
sical i
n
stru
m
ent digital

i
n
terfac
e
(
MI
D
I
),

digital v
i
deo
a
n
d i
m
age

co
m
p
ress
i
o
n
,

MPE
G,

m
o
tion

vid
e
o

c
o
m
p
ressi
o
n stand
a
r
d
,
DV
I

t
ech
n
o
l
o
g
y
,

ti
m
e
-

based

m
edia

re
p
res
en
tation

a
n
d

del
i
very

Unit



4

Virtu
a
l

Re
a
lity

Ap
p
licati
o
n of

m
ul
t
i
m
e
d
ia, i
n
telli
g
e
n
t
m
u
lt
i
me
d
ia syste
m
,
d
es
k
top
v
irt
u
al

reality( VR),

VR

o
p
erating

sys
t
e
m
,
virtual
en
viron
m
ent displays

and ori
e
ntation track
i
n
g,

visu
a
lly coupl
e
d

sy
s
tem

require
m
e
nts,
i
n
telligent

VR

sof
t
ware

syste
m
s.

A
p
plicati
o
n
o
f env
i
r
o
n
m
ent of v
a
ri
o
u
s

fields

viz.

e
n
tertain
m
ent,

m
anufac
t
u
ri
n
g,

b
u
sines
s
,

educati
o
n

etc.


Note:

-

There

will be

8

qu
e
stions in all. Two questions

will set from

each unit. Stud
e
n
ts are r
e
quir
e
d
t
o

a
t
t
e
m
p
t
five

questions

selecting at le
a
st one

question from

each uni
t
.


B
o
o
k
:

1
.

Vill
a
m
il & M
o
li
n
a
m
u
lt
i
me
di
a: an

i
n
t
rod
u
cti
o
n, PHI

2
.

Loz
a
n
o
,

M
u
lt
i
m
edia: so
un
d

a
n
d v
i
deo
P
HI

3
.

Vill
a
m
il & M
o
li
n
a
m
u
lt
i
me
di
a: Pr
o
d
u
ctio
n
,

p
lan
n
ing

a
n
d deli
v
ery PHI

4
.

Si
n
clair,
M
u
ltime
d
ia
o
n t
h
e PC, BPB

5
.

Tay V
a
u
g
h
a
n,
m
u
lti
m
edia:

maki
n
g

it
wo
rk
s
,

T
M
H






CSE
-
3
2
0

Gr
ap
h

t
h
e
o
ry
a
n
d
c
o
m
b
i
n
ato
r
ics

(De
p
art
m
e
n
tal Electi
v
e I)

L

T

P

T
h
e
o
r
y
:

1
0
0

3

2

-


Sessi
o
n
al:

5
0

Unit

1.

I
n
tro
du
ction

Basic

conc
e
p
t
s
,

s
ub
g
r
ap
h
s,

v
e
rtex,

d
e
gre
e
s,

wal
k
s
,

p
at
h
s, circ
u
its, cycles,

trees, s
p
in
n
ing
trees, c
u
t
vertices

a
n
d
cu
t edg
e
s,

co
nne
c
ti
v
it
y
,

Euler

t
o
urs

a
n
d Ha
m
iltoni
a
n

c
y
cles,
m
atching pe
r
f
e
ct

m
atching,
c
o
n
n
ecti
v
ity and

se
p
ara
b
ility,
n
etw
o
r
k flo
w
s, I
-
is
o
m
o
rp
h
ism and
2
-

is
o
m
o
r
ph
ism

U
n
it

2

Adv
a
nced

Fea
t
ures

Vert
e
x

c
o
l
o
r
i
n
g
,

ch
ro
m
atic pol
y
no
m
ial,

ed
g
e col
o
ri
n
g
,

pl
a
n
ar a
n
d
n
o
n
-

planar
g
ra
p
h
s
,

E
u
ler

s

fo
r
m
ula
Kwiat
ko
w
s
k
i’s

t
h
e
o
re
m
s,

test f
o
r plan
a
rit
y
,

d
irected gr
ap
hs, t
o
u
rna
m
ents,

n
et
w
o
rk
s
,

m
ax

f
low,
m
in

cut
t
h
e
o
re
m
s,

gr
ap
hs

en
u
m
erations,

P
o
l
y
a’s

co
u
n
ting

t
h
eo
rem

U
n
it

3

Graph

alg
o
rith
m
s

C
o
m
puter

r
e
p
r
esentati
o
n
o
f
g
ra
p
hs,

s
ho
rtest

path

a
l
g
o
rit
h
m
s,

m
ini
m
a
l sp
a
nn
i
ng tree,

f
u
n
d
a
m
ental circuit,

dep
t
h
first search,

p
la
n
arity testi
n
g,

d
irected circ
u
its, i
s
o
m
o
r
phis
m
,

a
n
d p
e
r
f
or
m
ance of
g
ra
p
h

t
h
eoretic al
go
rit
h
m
s
U
n
it

4

C
o
m
b
i
n
at
o
r
ics

Basic

co
m
b
i
n
ation

nu
m
bers,

r
ecu
r
rence

rela
t
ion
s
,

gen
e
rati
n
g

f
u
ncti
o
ns,

m
u
lt
i
m
onial,

c
ou
n
ti
n
g
p
ri
n
c
i
pals,
Pol
y
a’s

t
h
e
o
r
e
m
,

i
n
clusion

an
d

e
x
clus
i
o
n
p
ri
n
ciple,

bl
o
ck
d
esign a
n
d

e
r
r
o
r c
o
rrecti
n
g

cod
es,

H
ada
m
ard
matrices, fi
n
ite
g
e
o
m
etry.



Note:

-

There

will be

8

qu
e
stions in all.

Two questions

will set from

each unit. Stud
e
n
ts are r
e
quir
e
d
t
o

a
t
t
e
m
p
t
five

questions

selecting at le
a
st one

question from

each uni
t
.


B
o
o
k
:

1
.

Deo N:

G
r
a
p
h

the
o
ry a
n
d applicati
on
s, Pre
n
tice Hall

2
.

D.B

West: I
n
tr
o
d
u
ction
o
f gra
p
h t
h
e
o
ry: Pre
n
tice Hall

3
.

S.A. Cho
u
d
u
m
: A F
i
rst course in Graph

T
h
e
o
ry, MacMill
a
n [I
nd
ia]

4
.

V.

Krish
n
a
m
u
rt
h
y:C
o
m
b
i
n
at
o
rics

T
h
eory a
n
d ap
p
licati
o
n, Affilited

East

a
n
d

W
e
st

5
.

Alan T
u
c
k
er:

Ap
p
lied

C
o
m
b
i
n
at
o
ries,

W
il
l
ey.



CSE
-
3
2
3

L
o
gical &

Pro
g
ra
m
m
ing

(De
p
art
m
e
n
tal Electi
v
e I)

L

T

P

T
h
e
o
r
y
:

1
0
0

3

2

-


Sessi
o
n
al:

5
0

Unit

1.
Fun
d
ame
n
tals

Prop
o
siti
o
ns,
t
a
u
t
o
lo
g
ies, prece
d
e
n
ce r
u
le,

syst
e
m

d
ef
i
n
itio
n
,

reas
on
i
n
g usi
n
g Tra
n
sformati
on
,

For
m
al
s
y
st
e
m
,

A
x
i
o
m
s, I
n
terfere
n
ce r
u
les,

Pre
d
icates,, Q
u
a
n
tificati
on
,

Free and
b
ou
n
d Ide
n
tifiers, Data

v
al
u
es & T
y
p
e
s,
Ge
n
e
rators, Sema
n
tic
d
efi
n
iti
on
s

of

fu
n
ctions,

Ge
n
e
rator in
du
ctio
n
,

d
e
fi
n
e
d
n
ess co
nd
itio
n
.

U
n
it

2

Se
m
a
n
tics

Pr
e
d
icate Tr
an
sfor
m
ations, Various
c
o
m
m
a
n
d, alter
n
ati
v
e
a
n
d
I
n
teracti
v
e

c
o
mm
ands, Procedure call,
T
h
e
se
m
antic characterization

of
p
r
o
g
ra
m
m
ing

lan
g
u
a
ge,

t
wo
T
h
e
o
re
m
s,

Des
i
gn
o
f p
ro
p
erly

ter
m
i
n
ating

co
nst
r
ucts,

E
u
cli
d
’s

Alg
o
rit
h
m
s, I
n
terr
u
p
ts, s
p
i
n

l
o
c
k
.

U
n
it

3

C
o
m
m
un
icati
n
g

Seq
u
e
n
tial Pr
o
cess

(CSP)

Parallel c
o
mma
n
d
s,
C
o ro
u
tines, S
u
br
ou
ti
n
es and
d
ata

re
p
r
ese
n
tati
o
n,
m
o
nit
o
r a
n
d sc
h
e
duli
ng
,

I
n
te
g
er
se
m
aphore,

D
i
ni
n
g

P
h
il
o
so
p
h
ers p
ro
b
le
m
.




Note:

-

There

will be

8

qu
e
stions in all. Two questions

will set from

each
unit. Stud
e
n
ts are r
e
quir
e
d
t
o

a
t
t
e
m
p
t
five

questions

selecting at le
a
st one

question from

each uni
t
.



B
o
o
k
s:

1
.

Dav
i
d

Gries,

T
h
e

Sci
e
nce

of

Pr
og
ra
mm
ing,

Na
r
o
sa

P
u
blis
h
ing

H
ou
s
e.

2
.

E.W.Dij
k
stra,

A

Disci
p
li
n
e

of Pro
g
rammi
n
g

PHI.

3
.

Ho
a
re
an
d
J
o
nes, Essays
i
n

C
o
m
puter Sci
e
nce, TMH




CSE
-
3
2
3

A
d
v
a
nce

Database

S
y
stem

(De
p
art
m
e
n
tal Electi
v
e I)

L

T

P

T
h
e
o
r
y
:

1
0
0

3

2

-


Sessi
o
n
al:


5
0

Unit

1.

Parallel &

Distrib
u
ted Data

bases

Arc
h
itect
u
re for

p
arallel
d
atabase,

p
arallel query ev
o
l
u
tio
n
,

p
arallelizi
n
g

i
n
d
i
v
id
u
al

o
p
era
t
i
on
s
,

p
arallel
qu
e
ry

opti
m
ization

i
n
t
r
od
u
cti
o
n to distri
b
u
t
e
d database
s
,

distribut
e
d DB
M
S

ar
c
h
itecture
s
,

s
o
rti
n
g data
i
n

a
distri
b
u
ted da
t
abase DB
M
S,

Distri
b
u
ted

c
atalog

m
anage
m
ent, Distri
b
u
t
e
d qu
e
ry

p
r
oce
s
sin
g
, u
p
dati
n
g
distri
b
u
ted da
t
a,

i
n
t
ro
ducti
o
n to

distr
i
but
e
d

t
ransacti
o
n
s
, Distribut
e
d

c
o
n
c
u
rr
e
ncy c
o
nt
r
o
l,

rec
o
ver
y
.

U
n
it

2

Data Mi
n
ing

Int
ro
ducti
o
n,

c
o
u
n
ti
n
g

c
o
-
o
c
c
u
r
renc
e
s,
m
ining
f
o
r
r
u
les,

t
r
ee

struc
t
ur
e
d
r
u
les,

c
l
usteri
ng
,

si
m
i
larity search
ov
e
r

s
e
quenc
e
s

U
n
it

3

Object

databa
s
e syst
e
m
s

User d
e
fin
e
d

A
DT,

st
r
u
ctur
e
d t
y
pes,

o
b
jects

a
n
d r
e
fer
e
nce

t
y
pes,

i
n
heritan
c
e,

d
e
si
g
n

fo
r

a
n ORDB
M
S,
c
h
alle
n
g
es in i
m
p
l
e
m
e
n
ti
n
g

an ORDBMS,

OODBMS, co
m
p
aris
o
n
o
f RDBMS

with OODBMS and
ORDB
M
S

U
n
it

4

A
d
v
a
nced t
o
pics

Adv
a
nced tr
an
sactions

processing, int
e
grat
e
d

access to
m
u
ltiply data source,
m
obile data

bases
m
ain
m
e
m
o
ry
d
atabases,
m
u
lti

m
ed
ia
d
ata

b
ases,

GIS, Te
m
p
oral and

seq
u
e
n
ced
d
ata
b
a
ses.



Note:

-

There

will be

8

qu
e
stions in all. Two questions

will set from

each unit. Stud
e
n
ts are r
e
quir
e
d
t
o

a
t
t
e
m
p
t
five

questions

selecting at le
a
st one

question from

each uni
t
.



B
o
o
k
s

1
.

R.

Ra
m
akrish
n
an

a
n
d J.

G
e
h
r
ks dat
a
base

m
anage
m
ent s
y
ste
m
;
M
GH, Int
e
rnati
o
nal
e
d
ition,
2
0
0
0

2
.

K
o
rth, Sil
b
ersc
h
atz, Su
d
ar
s
h
a
n
:
d
ata
b
ase co
n
ce
p
ts, MGH,

2
001

3
.

C. I. Date, data

base

syste
m
s
:
7
th

e
d
itio
n
,

Ad
d
ison Wesley,

Pears
o
n E
du
cati
on
,

2
0
00



CSE
-
3
25

Parallel C
o
m
pu
ti
n
g

(De
p
art
m
e
n
tal
Electi
v
e I)

L

T

P

T
h
e
o
r
y
:

1
0
0

3

2

-


Sessi
o
n
al:

5
0

Unit

1.

Int
ro
ducti
o
n:
P
arad
i
g
m
s

of p
a
rallel co
m
puting: S
y
n
ch
r
on
o
u
s


Vec
t
or/

A
rr
a
y
,

SI
M
D,

s
y
s
t
olic;

As
y
n
c
h
ro
n
o
u
s
-

M
I
M
D,

r
ed
uc
ti
o
n
p
a
rad
i
g
m
.

Har
d
ware

Tax
o
n
o
m
y
: Fly
nn

s classification, h
a
ndler’s
cla
s
sification. S
o
f
t
ware

tax
o
n
o
m
y
: K
u
n
g
’s
t
a
x
on
o
m
y
, SPMD.

U
n
it

2

A
b
s
t
ract
p
a
rallel c
o
m
pu
tati
o
nal

m
od
els: c
o
m
b
i
n
a
tio
n
al circ
u
its, s
o
rting
n
e
twork, P
R
AM

m
od
els, I
n
terco
nn
ect
i
o
n
s
R
AMs.

Paralleli
s
m

a
pp
r
o
ac
h
es
-

d
ata

p
a
ralleli
s
m
,

c
on
tr
o
l

p
arallelis
m
.

Per
fo
r
m
ance

m
atrices: Laws

g
ov
er
n
i
n
g

pe
r
f
o
r
m
a
n
ce

m
easur
e
m
ents. Matrices
-

s
p
e
e
dups,
e
fficiency,
u
tilizati
on
,

comm
un
i
cati
o
n
o
v
er
h
e
a
d
s
,

sin
g
le
/

m
u
lti
p
le
p
r
o
g
ram

p
erfor
m
an
ces,
b
e
n
c
h

m
a
r
k
s.

U
n
it

3

Parallel
p
r
o
cess
o
rs: tax
o
n
o
m
y

and

top
o
lo
g
y
: s
h
ared

m
e
m
o
ry

m
u
lti
p
r
o
cess
o
r,

d
istrib
u
ted m
e
m
o
ry
net
w
o
r
ks,

pr
o
c
essor
or
ganiza
t
ion,

static a
n
d

d
y
n
a
m
ic

i
n
terco
n
necti
o
ns.

E
m
beddin
g
s

a
n
d
si
m
u
lations. Parallel p
ro
g
r
amm
ing: shar
e
d
m
e
m
o
ry pr
o
g
r
a
mm
ing, distr
i
but
e
d

m
e
m
o
ry
p
ro
g
ra
mm
ing, o
b
ject

ori
e
nted p
ro
g
ra
mm
ing, data p
a
rallel
pr
o
g
ra
mm
ing, f
u
nctional

a
n
d d
a
ta fl
o
w
p
r
o
g
r
amm
ing.

U
n
it

4

Sch
e
duli
n
g

an
d parallization:

Sch
ed
u
li
n
g p
a
rallel p
r
o
g
r
a
m
s, lo
o
p sc
h
ed
u
li
n
g. Paralleliza
t
i
o
n of
se
qu
e
n
tial
p
r
o
g
ra
m
s. Par
a
llel
p
ro
g
ram
m
in
g sup
p
ort

p
r
o
g
ra
m
s




Note:

-

There

will be

8

qu
e
stions in all. Two questions

will set from

each unit. Stud
e
n
ts are r
e
quir
e
d
t
o

a
t
t
e
m
p
t five

questions

selecting at le
a
st one

question from

each uni
t
.


B
o
o
k
s

1
.

M.J.

Q
u
i
n
n. Parallel C
o
m
pu
ti
ng
:

T
h
e
o
ry

and Practice,
McGraw Hill,

New

Y
o
rk,

1
994

2
.

T.G.Lewis and H, EI
-
Rew
i
n
i,

I
n
tro
du
ction

t
o Parallel c
o
m
pu
ti
n
g, Pre
n
tice Hall, New

Jersey, 1
9
92

3
.

T.G.Lewis, Parallel Pro
g
ra
m
m
i
ng
: A
m
ac
h
i
n
e

In
d
e
p
e
nd
e
n
t approa
c
h
,

IE
E
E Co
m
puter

Society
Pres
s
, L
o
s

Ala
m
i
t
o
s,

!994