Program : BE (EXTC)

Name of the course:

Year : 2015-16
Semester: VIII
Incharge Faculty: Prof.- Bhushan S. Devare
Prof.-Malay H.Kenia

Program Outcomes
Program outcomes are narrower statements that describe what students are expected to know and be
able to do by the time of graduation. These relate to the skills, knowledge, and behaviors.
Engineering programs must demonstrate that their students attain the following outcomes:
a)

A graduate will have in depth knowledge of mathematics such as Laplace

Transform, Fourier
Transform, and Stochastic Process etc and will be able
to apply them to analyze and design the Electronics and Telecommunication
circuits and system, also have the depth knowledge of basic science and
engineering.

b)

A graduate can use Electronics and Telecommunication related software tools

and equipment to analyze the problem formulate and interpret the data
relevant to the problem.

c)

An ability to design a system, component, or process to meet desired needs w

ithin realistic constraints such as economic, environmental, social,political, et
hical, health and safety, manufacturability, and sustainability,

d)

An ability to function on multidisciplinary teams,

e)

An ability to identify, formulate, and solve engineering problems,

f)
g)

A graduate will
have an understanding of professional and ethical responsibility,
An ability to communicate effectively,

h)

The broad education necessary to understand the impact of engineering s

olutions in a global, economic, environmental, and societal context,

i)

A recognition of the need for, and an ability to engage in life-long learning,

j)

A knowledge of contemporary issues, and have the budget management

k)

An ability to use the techniques, skills, and modern engineering tools necess
ary for engineering practice.

l)

A graduate will have an ability to innovate and produce projects by applying

the knowledge of various subjects and the techniques

COs and POs MAPPING (Theory - 100% )

Cour Course Outcomes

se
Code
ETE
CO1Demonstrate
broad
802 knowledge of fundamental
principles
and
technical
standards underlying
CO2Understandbasicof
telecommunication,networking
andinformationtechnologies.
CO3Architect and
implement networked
informative systems.
CO4Continuously improve
their technology knowledge
and communication skills.
CO5Anticipate the way
technological change and
emerging technologies
might alter the assumptions
underlying architectures
and systems.

P
O
a

P
O
b

P
O
c

P
O
d

P
P
P
O
O
Of
e
g

P
P
P P
P
O
O
%
Oi Oj
Ol
h
k

CUnderstandevaluationof
technologyandstandardization

COs and POs MAPPING(Practical -100% )

Cour
se
code
ETE
802

Course
Outco
mes
CO1

PO
1

PO
2

CO2.
CO3
CO4

1
0
1

1
0
1

PO
3

0
0
0

PO
4

PO
5

PO
6

PO
7

PO
8

0
0
0

1
2
0

0
0
0

0
0
0

0
0
0

PO
9

PO1
0

PO1
1

2
0
0
0

0
0
0

PO1
2

1
0
1
1

1
1
1

4
4
4

CO5
C

1
1

0
1

1
0

0
0

1
1

0
0

Syllabus

0
0

0
0

0
0

0
0

0
1

1
0

4
4

Recommended Books:

1. Mani Subramaniam, Network Management Principles and Practise, Addison Wisely,

New York, 2000.
2. Lakshmi G. Raman, Fundamental of Telecommunications Network Management
Eastern Economy Edition, IEEE Press New Delhi.
3. Salh Aiidarons, Thomas Plevoyak Telecommunications Network Technologies and
implementations Eastern Economy Edition, IEEE press New Delhi-1998.
Internal Assessment (IA):
Two tests must be conducted which should cover at least 80% of syllabus. The
average marks of both the test will be considered as final IA marks
End Semester Examination:
1. Question paper will comprise of 6 questions, each of 20 marks.
2. Total 4 questions need to be solved.
3. Question No.1 will be compulsory and based on entire syllabus wherein sub
questions of
to 5 marks will be asked.
4. Remaining questions will be selected from all the modules

Experiment List

LESSON PLAN

Module
1

Week
1

Date

Lecture

Topic covered

Course
Outcomes
CO1

L1

Need of data
compression,Lossy n
lossless compression
techs,measure of
performance,modeling &
coding , different types
of models, and coding
techniques

L2

Huffman coding &

minimum variance
coding & its example
H,L ,R ,advantages n
disadvantages

CO1

L3

Extended Huffman
coding & adaptive
Huffman coding

CO1

L4

adaptive Huffman
coding & decoding

CO1

L5

Arithmetic codingGeneration of tag n

deciphering the tag n
with its example

CO1

L6

Arithmetic coding with

scaling and its example

CO1

L7

Dictionary techniques
LZ77,LZ78 encoding n
decoding example

CO1

L8

LZW Encoding n
decoding,

CO1

L9

Digital Audio, Lossy

sound compression
Need of companding

CO2

CO2

L10

-law and A-law

companding DPCM and

ADPCM audio
compression

L11

Temporal n frequency
masking ,critical bands
n graph in details

CO2

L12

MPEG audio standard in

detail

CO2

L13

Loss less techniques of

image compression

CO3

L14

Predictive Techniques PCM

and DPCM

CO3

L15

Gray codes & different

types of image.

CO3

L16

JPEG

CO3

L17

JPEG 2000

CO3

L18

JPEG-LS

CO3

L19

Video compression
Concepts ,intra n infra
frame coding

CO3

L20

motion compensation n
motion estimation

CO2

L21

MPEG-2 industry standard

CO3

L22

MPEG-2 industry standard

CO3

L23

H-264 encoder and

decoder

CO3

L24

H-264 encoder and

decoder

CO3

L25

Introduction, Types of
attacks , Steganography

CO4

cryptography,

CO4

L26

L27

CO4

Integer arithmetic,
modular arithmetic
linear congruence

CO4

CO4

Substitution cipher,
transposition cipher
stream and block cipher

CO4

CO4

L32

arithmetic
modes for block ciphers

CO4

L33

Data encryption
standard n single round

CO4

Double DES,design of SBOX

Triple DES, attacks on

CO4

CO4

CO4

CO5

CO5

L28
8

L29
L30
L31

L34
L35

10

L36

DES
AES, key distribution
center.

L37

Primes, factorization

L38

11

12

cryptographic attacks,
Security goals, services
and mechanics.

Fermats little theorem

L39

Eulers theorem, and

extended Euclidean
algorithm

CO5

L40

RSA, attacks on RSA

CO5

L41

Diffie Hellman key

exchange algo.

CO5

L42

key management

CO5

L43

basics of elliptical curve

cryptography

CO5

L44
L45
L46
L47
L48

Message integrity
message authentication
MAC, hash function
H MAC
digital signature

CO5
CO5
CO5
CO5
CO5

2
2
2
1
1

algorithm

13

L49
L50
L51
L52

Malware, Intruders,
Intrusion detection
system
firewall design,
antivirus techniques

CO6

CO6

digital Immune systems

CO6
CO6

2
2

CO4

CO5

CO6

10
5

10
5

10
5

CO4

CO5

CO6

10

10

10

biometric
authentication,
and ethical

hacking.

Mapping with Assignment:

Assignment
1
2
3

CO1
10

CO2
10

CO3
10

CO1
10

CO2
10

CO3
10

Mapping with Test:

Test
1
2