8/13/2019 Scheme and Syllabi for Seventh Semester CSE
1/13
SCHEME AND SYLLABI FOR
SEVENTH SEMESTER
OF
BACHELOR OF
TECHNOLOGY IN
COMPUTER SCIENCE AND
ENGINEERING
FROM 2009 ADMISSION ONWARDS
CALICUT UNIVERSITY (P.O), THENHIPALAM
8/13/2019 Scheme and Syllabi for Seventh Semester CSE
2/13
Semese! /II Hours / Week Marks
Code SubjectL T D/P
Inte-
rnal
S
emes
ter-end
Semester-
endduration-
hours
Credits
CS!" '!# Wireless et3orks and Mobile
Communication S)stems
% # &! '! & &
CS!" '!% Desi$n and 7nal)sis o7l$orithms
( # &! '! & *
CS!" '!& Internet Technolo$) % # &! '! & &
CS!" '!( Cr)2to$ra2h) and et3orkSecurit)
& # &! '! & (
CS!" '!* Electi.e II & # &! '! & (
CS!" '!+ Electi.e III & # &! '! & (
C&09 '0'(P) Compiler Lab & *! *! & %
C&09 '0(P) Net,or" Programming Lab & *! *! & %
C&09 '09(P) Pro.ect # #
To$% )0 . 0 2,
To$% M$!-s
8/13/2019 Scheme and Syllabi for Seventh Semester CSE
3/13
8/13/2019 Scheme and Syllabi for Seventh Semester CSE
4/13
Ine!n$% Conin4o4s Assessmen %Maximum Marks&'()
+!I - Tests >minimum %?&!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/
literature sur.e)/ seminar/ term-2roject/ sot3are e@ercises/ etcE
#!I - :e$ularit) in the class
Uni2e!si: E6$min$ion ;$e!n
*A+T A, -hort answer questions %one.two sentences) / x 0 marks12( marks
7ll Buestions are com2ulsor)E There should be at least one
Buestion rom each module and not more than t3o Buestions
rom an) moduleE
*A+T 3, Analytical.*roblem solving questions 4 x / marks10( marks
Candidates ha.e to ans3er our Buestions out o si@E Thereshould be at least one Buestion rom each module and not morethan t3o Buestions rom an) moduleE
*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks
T3o Buestions rom each module 3ith choice to ans3er oneBuestionE
Maximum Total Marks, 6(
8/13/2019 Scheme and Syllabi for Seventh Semester CSE
5/13
CS!" '!%= Desi$n and 7nal)sis o 7l$orithms
Objectives
Toprovide a sound basis of algorithm design and analysis techniques. To introduce the various computing models and their capabilities with respect to computing.
Mod4%e I "). 'o4!s(7nal)sis= :7M Model - Cost estimation based on ke) o2erations - bi$ 5h - bi$ ome$a - little 5h - ome$aand theta notations - recurrence anal)sis - MasterFs Theorem - Solution to recurrence relations 3ith ullhistor) 2robabilistic anal)sis - linearit) o e@2ectations - Worst and 7.era$e case anal)sis o 8uick Sort-Mer$e Sort - Hea2 Sort - ,inar) Search - Hashin$ 7l$orithms - lo3er bound 2roos or the abo.e 2roblems
-amorti6ed anal)sis - a$$re$ate - accountin$ and 2otential methods - 7nal)sis o Gnuth - Morris-Prattal$orithm - 7mortised 3ei$ht balanced trees - :ed-,lack Trees
Mod4%e II "). 'o4!s(Desi$n= Di.ide and ConBuer - StrassenFs al$orithm/ o>n? median indin$ al$orithm - D)namic 2ro$rammin$- Matri@ Chain Multi2lication - 52timal 2ol)$on trian$ulation - 52timal ,inar) Search trees - 9lo)d-Warshall al$orithm - CG al$orithm - 1reed)-Human codin$ - Gna2sack/ GruskalFs and PrimFs al$orithmsor MST A backtrackin$ - branch and bound - tra.elin$ Salesman Problem - Matroids and theoreticaloundations o 1reed) al$orithms
Mod4%e III ")* 'o4!s(Com2le@it)= Com2le@it) classes - P/ P/ Co-P/ P Hard and P Com2lete 2roblems - CookFstheorem>Proo not e@2ected? - P- Com2leteness reductions or cliBue - 4erte@ Co.er - Subset Sum-Hamiltonian C)cle - TSP - inte$er 2ro$rammin$ - a22ro@imation al$orithms - 4erte@ Co.er - TSP-Set
co.erin$ and subset sum - ,in 2ackin$ - 1ra2h colorin$
Mod4%e I/ "), 'o4!s(Probabilistic al$orithms= Pseudo random number $eneration methods - Monte Carlo al$orithms -
Probablistic countin$ - 4eri)in$ matri@ multi2lication - Primalit) testin$ - Miller :abin Test - inte$er9acorisation - PollardFs rho heuristic - am2liication o stochastic ad.anta$e - a22lication to cr)2to$ra2h) -interacti.e 2roo s)stems - les .e$as al$orithms - :andomi6ed selection and sortin$ - :andomi6ed solutionor ei$ht Bueen 2roblem -;ni.ersal Hashin$ - Di@onFs inte$er actori6ation al$orithm
Te$&'in8 s&'eme C!edis5*( hours lecture and # hour tutorial 2er 3eek
Text Books
# Corman TH/ Lieserson CE < :i.est :L/"ntroduction to Algorithms/ Prentice Hall India/Modules I/ II and III
% Mot3ani : < :a$ha.an P/+andomiBed Algorithms/ Cambrid$e ;ni.ersit) Press/ Module I4
Re#e!en&e Boo-s
# ,asse S/ $omputer Algorithms, "ntroduction to 5esign And Analysis/ 7ddison Wesle)% Manber ;/"ntroduction to Algorithms, A $reative Approach/ 7ddison Wesle)
& 7ho 4/ Ho2crot E < ;llman D/ The 5esign And Analysis of $omputer Algorithms/7ddison Wesle)
( Genneth 7 ,erman/ erome L Paul/Fundamentals of sequential and parallel algorithms/ 4id)a4ikas Publications
8/13/2019 Scheme and Syllabi for Seventh Semester CSE
6/13
Ine!n$% Conin4o4s Assessmen %Maximum Marks&'()
+!I - Tests >minimum %?&!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/
literature sur.e)/ seminar/ term-2roject/ sot3are e@ercises/ etcE#!I - :e$ularit) in the class
Uni2e!si: E6$min$ion ;$e!n
*A+T A, -hort answer questions %one.two sentences) / x 0 marks12( marks
7ll Buestions are com2ulsor)E There should be at least oneBuestion rom each module and not more than t3o Buestions
rom an) moduleE
*A+T 3, Analytical.*roblem solving questions 4 x / marks10( marks
Candidates ha.e to ans3er our Buestions out o si@E Thereshould be at least one Buestion rom each module and not morethan t3o Buestions rom an) moduleE
*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks
T3o Buestions rom each module 3ith choice to ans3er oneBuestionE
Maximum Total Marks, 6(
8/13/2019 Scheme and Syllabi for Seventh Semester CSE
7/13
CS!" '!& = Internet Technolo$)
Objectives
To introduce the algorithms and protocols implemented to have human interaction with internetwith an emphasis on application layer and multimedia networking.
To introduces the techniques and methods of E&$ommerce. .
Mod4%e I ")0 'o4!s(Princi2les o 722lication La)er Protocols - The Web and HTTP/ 9ile Transer= 9TP/ Electronic Mail in theInternet/ DS-The InternetKs Director) Ser.ice - Socket Pro$rammin$ 3ith TCP/ Socket Pro$rammin$ 3ith;DP/ ,uildin$ a Sim2le Web Ser.er/ Content Distribution
Mod4%e II ")0 'o4!s(Multimedia net3orkin$- Multimedia et3orkin$ 722lications/ Streamin$ Stored 7udio and 4ideo - Makin$
the ,est o the ,est-Eort Ser.ice= 7n Internet Phone E@am2le - Protocols or :eal-Time Interacti.e
722lications - ,e)ond ,est-Eort - Schedulin$ and Policin$ Mechanisms - Inte$rated Ser.ices - :S4P -Dierentiated Ser.ices
Mod4%e III "9 'o4!s(et3ork Securit) - Princi2les o Cr)2to$ra2h)/ 7uthentication/ Inte$rit)/ Ge) Distribution and Certiication- 7ccess Control= 9ire3alls/ 7ttacks and Countermeasures - Securit) in Man) La)ers= Case Studies
Mod4%e I/ ")0 'o4!s(E-commerce- Modes o E-commerce/ Securit) needs in E-commerce en.ironment - E-commerce 2a)ments)stems/ credit cards/ E-commerce transactions/ di$ital 2a)ments in ,%C arena/ ,%, 2a)ment s)stems/ ,%,- E-commerce and Su22l) Chain Mana$ement/ E.olution/ Procurement 2rocess < Su22l) ChainMana$ement/ Trends in Su22l) Chain Mana$ement and collaborati.e commerce/ et Marketers -characteristics/ t)2es/ e-distributors/ e-2rocurement
Te$&'in8 s&'eme C!edis5&% hours lecture and # hour tutorial 2er 3eek
Text Books# Gurose 9 < :oss GW/ $omputer >etworking, A Top &5own Approach Featuring the
"nternet/ Pearson Education% Genneth C Laudon/ Carol 1uercio Tra.er/E&$ommerce&3usiness Technology -ociety/
Pearson Education
Re#e!en&e Boo-s
# alin G Sharda/Multimedia "nformation >etworking/ Prentice Hall o India% Dou$las E Comer/ $omputer >etworks and "nternets with "nternet Applications/ PearsonEducation
& Stallin$s/ $omputer >etworking with "nternet *rotocols/ Pearson Education 7sia( 1oncal.es M/Firewalls, A $omplete 8uide/ Tata Mc1ra3 Hill* Galakota : < Whinston 7,/Frontiers of Electronic $ommerce/ 7ddison Wesle)+ Schneider 1P < Perr) T/Electronic $ommerce $ourse Technology/ Mc1ra3 Hill/ e3
Delhi/ %!!&
8/13/2019 Scheme and Syllabi for Seventh Semester CSE
8/13
Ine!n$% Conin4o4s Assessmen %Maximum Marks&'()
+!I - Tests >minimum %?
&!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/literature sur.e)/ seminar/ term-2roject/ sot3are e@ercises/ etcE
#!I - :e$ularit) in the class
Uni2e!si: E6$min$ion ;$e!n
*A+T A, -hort answer questions %one.two sentences) / x 0 marks12( marks
7ll Buestions are com2ulsor)E There should be at least one
Buestion rom each module and not more than t3o Buestionsrom an) moduleE
*A+T 3, Analytical.*roblem solving questions 4 x / marks10( marks
Candidates ha.e to ans3er our Buestions out o si@E Thereshould be at least one Buestion rom each module and not morethan t3o Buestions rom an) moduleE
*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks
T3o Buestions rom each module 3ith choice to ans3er one
BuestionE
Maximum Total Marks, 6(
8/13/2019 Scheme and Syllabi for Seventh Semester CSE
9/13
CS!" '!( = Cr)2to$ra2h) and et3ork Securit)
Objectives
To introduce the principles and practices of cryptography and network security To discuss algorithms and schemes to handle the security issues
To introduce web security
Mod4%e I ")1 'o4!s(
Introduction: Security basics Aspects of network security Attacks Different types -
Security attacks -Securit) ser.ices and mechanisms Cr)2to$ra2h)= ,asic Encr)2tion < Decr)2tion AClassical techniBues - Trans2osition < substitution ci2hers ACaesar substitution A Pol)al2habetic
substitutions A S)mmetric ke) al$orithms A 9iestel et3orks A Conusion - Diusion - DES Algorithm
Strength of DES Comparison important features of modern symmetric key
algorithms
Mod4%e II ")+ 'o4!s(
!ublic key cryptosystems "he #SA Algorithm Diffice $ellman key e%change
comparison of #SA DES Elli2tic Cur.e Cr)2to$ra2h) A umber Theor) Conce2ts
Mod4%e III ")+ 'o4!s(
Hash 9unctions A Di$est 9unctions A Di$ital Si$natures A 7uthentication 2rotocols A &etwork
Application Security: 'erberos ()*+ Authentication ser,ice Electronic mail security
!retty ood pri,acy S./I/E secure Electronic "ransactions0
Mod4%e I/ ")2 'o4!s(IP securit) A architecture A eatures A Web securit) A Socket la)er and trans2ort la)er securit) A
Secure electronic transactions A1irewalls
Te$&'in8 s&'eme C!edis5(& hours lecture and # hour tutorial 2er 3eek
Text Books
# William Stallin$s/>etwork -ecurity Essentials Applications ; -tandards/ Pearson Education7sia
Re#e!en&e Boo-s# Schneier ,/Applied $ryptography, *rotocols Algorithms and -ource $ode in $/ ohn Wile)% Wenbo Mao /Modern cryptography & Theory and *ractice/ Pearson Education 7sia& i.en < uckerman HS/An "ntroduction to The Theory of >umbers/ ohn Wile)
( Plee$er CP/ Plee$er SL/ -ecurity in $omputing/ Pearson Education >Sin$a2ore? P.t Ltd* Michel E Whiteman/ Herbert Mattord/*rinciples of "nformation -ecurity/ Thomson/ 4ikas
8/13/2019 Scheme and Syllabi for Seventh Semester CSE
10/13
Ine!n$% Conin4o4s Assessmen %Maximum Marks&'()
+!I - Tests >minimum %?&!I - 7ssi$nments >minimum %? such as home 3ork/ 2roblem sol.in$/ $rou2 discussions/ Bui6/
literature sur.e)/ seminar/ term-2roject/ sot3are e@ercises/ etcE#!I - :e$ularit) in the class
Uni2e!si: E6$min$ion ;$e!n
*A+T A, -hort answer questions %one.two sentences) / x 0 marks12( marks
7ll Buestions are com2ulsor)E There should be at least oneBuestion rom each module and not more than t3o Buestions
rom an) moduleE
*A+T 3, Analytical.*roblem solving questions 4 x / marks10( marks
Candidates ha.e to ans3er our Buestions out o si@E Thereshould be at least one Buestion rom each module and not morethan t3o Buestions rom an) moduleE
*A+T $, 5escriptive.Analytical.*roblem solving questions 4 x 2( marks14( marks
T3o Buestions rom each module 3ith choice to ans3er oneBuestionE
Maximum Total Marks, 6(
8/13/2019 Scheme and Syllabi for Seventh Semester CSE
11/13
CS!" '!'>P? = Com2iler Lab
Objectives
To familiariBe the design of all phases of compilers up to a stage of intermediate code generation.
To enable the students to design and implement modern compilers for any environment.
Lab #% = 1eneration o le@ical anal)6er usin$ tools such as LEN
Lab &( = 1eneration o 2arser usin$ tools such as 7CC
Lab *+ = Creation o S)mbol tables
Lab '0 = Creation o t)2e checker
Lab "#! = 1eneration o intermediate code
Semese! End E6$min$ion %Maximum Marks&/()
'!I - Procedure conductin$ e@2eriment results tabulation and inerence
%!I - 4i.a .oce#!I - 9air record
Te$&'in8 s&'eme C!edis5%& hours 2ractical 2er 3eek
Re#e!en&e Boo-s
# Sethi :*rogramming #anguages, $oncepts and $onstructs 7ddison Wesle)
% 722leb) D < 4andeko22le *rogramming #anguages, *aradigm and *ractice TataMc1ra3 Hill
& Lu$er < StubbleieldArtificial "ntelligence 7ddison Wesle)( Samuel 7 :ebelsk Ex eriments in Hava Pearson Education
Ine!n$% Conin4o4s Assessmen %Maximum Marks&/()
+!I-Laborator) 2ractical and record&!I- Test/s#!I- :e$ularit) in the class
8/13/2019 Scheme and Syllabi for Seventh Semester CSE
12/13
CS!" '!0 >P? = et3ork Pro$rammin$ Lab
Objectives
To teach the working of various networking protocols
Lab # = Im2lementation o PC to PC ile transer usin$ serial 2ort and M5DEM
Lab %& = Sot3are Simulation o IEEE 0!%& 0!%( and 0!%* 2rotocols
Lab(* = Sot3are Simulation o Medium 7ccess Control 2rotocols A#? 1o,ack%? Selecti.e :e2eat and
&? Slidin$ Windo3
Lab + = Im2lementation o a subset o Sim2le Mail Transer Protocol usin$ ;DP
Lab '0 = Im2lementation o a subset o 9ile Transer Protocol usin$ TCP/IP
Lab " = Im2lementation o Qin$erQ utilit) usin$ :emote Procedure Call >:PC?
Lab#! = 1eneration and 2rocessin$ o HTML orms usin$ C1I
Te$&'in8 s&'eme C!edis5%& hours 2ractical 2er 3eek
Re#e!en&e Boo-s
# S :ichard SW @nix >etwork *rogramming Prentice Hall India% Comer DE"nternetworking with T$*."* 4ol #% < & Prentice Hall India
& Cam2ione et al M The Hava Tutorial $ontinued 7ddison Wesle)
Ine!n$% Conin4o4s Assessmen %Maximum Marks&/()
+!-Laborator) 2ractical and record&!- Test/s#!- :e$ularit) in the class
8/13/2019 Scheme and Syllabi for Seventh Semester CSE
13/13
CS!" '!" >P? = Project
Objectives
To :udge the capacity of the students in converting the theoretical knowledge into practical
systemsinvestigative analysis.
Project 3ork is or duration o t3o semesters and is e@2ected to be com2leted in the ei$hth semesterEach student $rou2 consistin$ o not more than i.e members is e@2ected to desi$n and de.elo2 a com2letes)stem or make an in.esti$ati.e anal)sis o a technical 2roblem in the rele.ant area The 2roject ma) beim2lemented usin$ sot3are hard3are or a combination o both The 2roject 3ork ma) be undertaken incom2uter science en$ineerin$ or allied areas like -
5S 2latorms= :ele.ant to the current state o the art 3ith su22ort or net3orked en.ironment distributed
com2utin$ and de.elo2ment o multi-2latorm a22lications Internet technolo$ies= 7rchitectural conce2tsNML Scri2tin$ lan$ua$es Middle3are >Com2onent? technolo$ies 9ront end / 1;I= Code de.elo2ment orde.elo2ment based on tools :D,MS/,ack End= :ele.ant to current state 3ith database connecti.it) todierent 2latorms Lan$ua$es= 8t 1lade or an) similar (1Ls Scri2tin$ lan$ua$es and C < C-Linu@ >under1; $cc? etc ;ni.ersal net3ork a22lications de.elo2ment 2latorms such as 747 5S internals= De.icedri.ers :PC Threads Socket 2ro$rammin$ etcet3orkin$= Mechanisms 2rotocols securit) etc
Embedded s)stems= :T5S Embedded hard3are 3ith sot3are or an a22licationCode o2timi6ationsecurit) etc
Project e.aluation committee consistin$ o the $uide and three/our acult) members s2ecialised in
biomedical/electronics/ com2uter science/instrumentation en$$ >Please 3rite areas o s2ecialisationsrele.ant to the concerned branch concerned? 3ill 2erorm the screenin$ and e.aluation o the 2rojects
Each 2roject $rou2 should submit 2roject s)no2sis 3ithin three 3eeks rom start o se.enthsemester Project e.aluation committee shall stud) the easibilit) o each 2roject 3ork beore $i.in$ consent
Literature sur.e) is to be com2leted in the se.enth semester
Students should e@ecute the 2roject 3ork usin$ the acilities o the institute Ho3e.er e@ternal2rojects can be taken u2 in re2uted industries i that 3ork sol.es a technical 2roblem o the e@ternal irmPrior sanction should be obtained rom the head o de2artment beore takin$ u2 e@ternal 2roject 3ork and
there must be an internal $uide or such 2rojects
Each student has to submit an interim re2ort o the 2roject at the end o the 'thsemester Members othe $rou2 3ill 2resent the 2roject details and 2ro$ress o the 2roject beore the committee at the end o the'thsemester
*! o the marks is to be a3arded b) the $uide and *! b) the e.aluation committee
Te$&'in8 s&'eme C!edis5%& hours 2ractical 2er 3eek
Ine!n$% Conin4o4s Assessmen%! - Technical rele.ance o the 2roject =(! - Literature sur.e) and data collection%! - Pro$ress o the 2roject and 2resentation =#! - :e2ort
#! - :e$ularit) in the class