SCHEME AND SYLLABI FOR SIXTH SEMESTER

OF

BACHELOR OF TECHNOLOGY IN

COMPUTER SCIENCE AND ENGINEERING

FROM 2009 ADMISSION ONWARDS

CALICUT UNIVERSITY (P.O), THENHIPALAM

Semes e! /I Code CS!" +!# CS!" +!% CS!" +!& CS!" +!( CS!" +!* CS!" +!+ C&09 -0'(P) C&09 -0((P)
Subject

Hours / Week
L T D/P

Marks

Internal &! &! &! &! &! &! *!

Embedded S)stems Com2iler Desi$n Com2uter et3orks Database Mana$ement S)stems Com2uter 1ra2hics Electi.e I &ystems Lab ini Pro.ect To $% To $% M$!-s

& ( & & % &

# # # # # # & & .

S emes terend '! '! '! '! '! '! *!

Semesterend durationhours & & & & & & &

Credits

),

( * ( ( & ( % % 2,

CS!" +!# = Embedded S)stems

Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To teach students about architecture hardware and software elements programming models and practices and tools for embedded system design and implementation. To focus on the hardware and real time operating systems used for the embedded systems design. P e' e(uisites: Knowledge of digital design, computer organization

Mod4%e I ")1 'o4!s( Embedded s)stems= 5.er.ie3/ Desi$n challen$es-52timisin$ desi$n metrics/ Common desi$n metricsProcessor technolo$)-1eneral 2ur2ose 2rocessors/ Sin$le 2ur2ose 2rocessors and 722lication s2eci-ic 2rocessorsE IC technolo$)= 9ull-custom/4LSI/ Semi-custom 7SIC/ Com2ilation/S)nthesis/ libraries/IP/ Test/4eri-ication/ Custom Sin$le-2ur2ose 2rocessors= Hard3are-Combinational Lo$ic/ Transistors and lo$ic $ates/ ,asic combinational and SeBuential lo$ic desi$n/ Custom sin$le 2ur2ose 2rocessor desi$n and o2timisationE 1eneral-2ur2ose 2rocessors= So-t3are= ,asic architecture/ Data2ath/ Control unit/ Memor)/ Instruction e@ecution/ Pi2elinin$/ Su2erscalar and 4LIW architectures/ Instruction set/ Pro$ram and data memor) s2ace/ :e$isters/ I/5/ Interru2ts/ 52eratin$ S)stems/ De.elo2ment en.ironment/ Desi$n -lo3 and tools/ Testin$ and debu$$in$E 722lication-s2eci-ic instruction-set 2rocessors/ Microcontrollers/ Di$ital si$nal 2rocessorsE Standard sin$le-2ur2ose 2rocessors= Peri2herals-some e@am2les such as Timers/ counters/ 7nalo$-di$ital con.erters/ etcE Mod4%e II ")1 'o4!s( Memor)= Write-abilit) and stora$e 2ermanenceE Common memor) t)2es/ Com2osin$ memories/ memor) hierarch) and cache - Cache ma22in$ techniBues= re2lacement/ 3rite techniBues/ Cache im2act on s)stem 2er-ormance/ 7d.anced :7M/ the basic D:7M/ t)2es o- D:7MS/ D:7M inte$ration 2roblem/ Memor) mana$ement unit >MM;? Inter-acin$= ,asic 2rotocol conce2ts/ Micro2rocessor inter-acin$= I/5 addressin$/ interru2ts/ DM7/ 7rbitration methods/ Multi-le.el bus architectures/ 7d.anced communication 2rinci2les/ Parallel/ Serial and Wireless communication/ Error detection and correction/ ,us standards and 2rotocolsE 7n e@am2le= Di$ital camera - ;serKs 2ers2ecti.e/ Desi$nerKs 2ers2ecti.e/ S2eci-ication/ In-ormal -unctional s2eci-ication/ on--unctional s2eci-ication/ E@ecutable s2eci-ication Desi$n/ Im2lementation alternati.es Mod4%e III ")+ 'o4!s( State machine and concurrent 2rocess models= Models .sE lan$ua$es/ te@t .sE $ra2hics/ 7 basic state machine model= -inite-state machines/ 9SM 3ith data2ath model 9SMD/ Hierarchical/Concurrent state machine model >HC9SM? and the State charts lan$ua$e/ Pro$ram-state machine model >PSM?/The role o- an a22ro2riate model and lan$ua$e Concurrent 2rocess model= Concurrent 2rocesses/ create/ terminate sus2end/ resume and join/ Inter2rocss Communication and s)nchroni6ation methods and their im2lementation Case studies = Windo3s CE/ 8 N Mod4%e I/ ")) 'o4!s( Desi$n technolo$)= 7utomation-The 2arallel e.olution o- com2ilation and s)nthesis/ S)nthesis le.els/ Lo$ic s)nthesis/ T3o-le.el and/ Multi-le.el lo$ic minimi6ation/ 9SM s)nthesis/ Technolo$) ma22in$/ Inte$ration lo$ic s)nthesis and 2h)sical desi$n/ :e$ister-trans-er s)nthesis/ ,eha.ioural s)nthesis/ S)stem s)nthesis and

hard3are/so-t3are codesi$n/ Intellectual 2ro2ert) cores/ 2ro.iders and usersE

e3 challen$es 2osed b) cores to 2rocessor

Text Books ). 9rank 4ahid and Ton) 1i.ar$is/ Embedded -ystem 5esign, A @nified <ardware.-oftware "ntroduction Wile)/ %!!%E Re#e!en&e Boo-s #E Hack 1anssle/ The Art of 5esigning Embedded -ystems %nd edE/ Else.ier/ %!!0E %E :aj Gamal/ Embedded systems & architecture programming and design/ Tata Mc1ra3 Hill/ %!!'E &E Ste.e Heath/ Embedded -ystems 5esign/ %nd edE/ Else.ier/ %!!+E (E Tamm) oer$aard/ Embedded -ystems Architecture, A $omprehensive 8uide for Engineers and *rogrammers Else.ier/ %!!0E *E 7E ESloss/ DE S)mes/ and CE Wri$ht/ A+M -ystem 5eveloper?s 8uide, 5esigning and DptimiBing -ystem -oftware/ Mor$an Gau-mann Publishers/Else.ier/ %!!0E In e!n$% Con in4o4s 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/ so-t3are 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) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than 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(

CS!" +!%= Com2iler Desi$n

Te$&'in8 s&'eme ( hours lecture and # hour tutorial 2er 3eek C!edi s5 *

Objectives To introduce the various techniques involved in the translation of source programs into ob:ect programs by a compiler. To understand the inner working of a compiler using the various data structures used in the translation process.

Mod4%e I ")* 'o4!s( Introduction - anal)sis o- the source 2ro$ram - 2hases o- a com2iler - com2iler construction tools - le@ical anal)sis - role o- the le@ical anal)6er - s2eci-ication o- tokens - reco$nition o- tokens - le@ical anal)6er $eneratorsE Mod4%e II "). 'o4!s( S)nta@ anal)sis = role o- the 2arser - conte@t--ree $rammars - to2-do3n 2arsin$ -bottom-u2 2arsin$ o2erator 2recedence 2arsin$ - L: 2arsers >SL:/ canonical L:/ L7L:? - 2arser $eneratorsE Mod4%e III "). 'o4!s( S)nta@-directed translation - s)nta@-directed de-initions - S-attributed de-initions - L-attributed de-initions bottom-u2 and to2-do3n translation - t)2e checkin$ - t)2e s)stems - s2eci-ication o- a t)2e checker - runtime en.ironments - source lan$ua$e issues - stora$e or$ani6ation - stora$e allocation strate$ies - access to non-local names - 2arameter 2assin$ - s)mbol tablesE Mod4%e I/ "), 'o4!s( Intermediate code $eneration - intermediate lan$ua$es - declarations - assi$nment statements - ,oolean e@2ressions - 2rocedure calls - introduction to code o2timi6ation - sources o- o2timi6ation - introduction to data--lo3 anal)sis - introduction to code $eneration - issues in the desi$n o- a code $enerator - the tar$et machine - a sim2le code $enerator Text Books
#E 7ho 7E4E/ Sethi :E/ ;llman HEDE/ $ompilers, *rinciples Techniques and Tools/ 7ddison Wesle)E

Re#e!en&e Boo-s #E 7ho 7E 4E/ ;llman HEDE *rinciples of $ompiler 5esign/ arosa %E Muchnick SESE/ Advanced $ompiler 5esign "mplementation/ Harcourt 7sia >Mor$an Gau-man? &E Holub 7EIE/ $ompiler 5esign in $/ Prentice Hall India (E 722el 7EWE/ Modern $ompiler "mplementation in $/ Cambrid$e ;ni.ersit) Press *E Genneth C Lauden/ $ompiler $onstruction & *rinciples and practice/ Thomson ,rooks/Cole 4ikas Publishin$ HouseE +E Dick 1rune/ Henri E ,al/ Ceriel HEH Hacobs/ Goen 1 Lan$endoen/ Modern $ompiler design/ DreamtechE 'E GEDECoo2er and Linda Torc6on/ Engineering a $ompiler/ Mor$an Gau-mann/Else.ier/ %!!0

In e!n$% Con in4o4s 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/ so-t3are 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) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than 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(

CS!" +!&= Com2uter et3orks

Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives

To teach the mode of operation of different types of computer networks that are used to

interconnect a distributed community of computers and various interfacing standards and protocols.
Mod4%e I ")+ 'o4!s( Local 7rea et3orks= Ethernet/ Token :in$ Media 7ccess Control/ Token :in$ Maintenance/ 9DDI/ :esilient Packet :in$/ Wireless= ,luetooth/ Wi-9i/ WiM7N/ Cell Phone Technolo$iesE Circuit s3itchin$/ Messa$e s3itchin$/ Packet S3itchin$ - Data$rams/ 4irtual circuit/ source routin$/ Cell S3itchin$ - Cells/ Se$mentation and :eassembl)/ 4irtual Paths/ 7TM desi$n $oals/ Ph)sical La)ers -or 7TME Mod4%e II ")+ 'o4!s( Internet3orkin$ - et3orkin$ de.ices - ,rid$es/ :outers/ 1ate3a)s/ :outin$- et3ork as a $ra2h/ distance .ector >:IP?/ link state >5SP9?/ Metrics/ :outin$ -or mobile hosts/ 1lobal Internet - Subnettin$/ CID:/ ,1P/ :outin$ areasE Mod4%e III ")+ 'o4!s( Internet3orkin$ - IP.( and IP.+/ Multicast addresses/ Multicast routin$/ D4M:P/ PIM/ MSDP/ Multi2rotocol label s3itchin$- Destination based -or3ardin$/ E@2licit routin$/ .irtual 2ri.ate net3orks and tunnelsE Mod4%e I/ ")+ 'o4!s( End-to-End Protocols= Trans2ort la)er A duties/ Sim2le Demulti2le@er >;DP?/ :eliable b)te Stream >TCP?E end-to-end issues - se$ment -ormat/ connection establishment and termination/ Tri$$erin$ transmission/ 7da2ti.e retransmission/ record boundariesE TCP e@tensions/ 7lternati.e desi$n choicesE :emote Procedure Call 9undamentals/ :PC Im2lementation/ ;22er 5SI la)ers - session la)er/ 2resentation la)er/ a22lication la)erE

Text Books
#E LE Peterson < ,ruce SE Da.ie/ $omputer >etworks& A systems approach/ (/e Mor$an Gau-mann

2ublishers an im2rint o- Else.ier Re#e!en&e Boo-s #E ,ehrou6 9orou6an/ "ntroduction to data communication and networking/ Tata Mc1ra3- Hill Publishin$ Com2an) LtdE %E Halsall 9E/ Data Communication/ $omputer >etworks and Dpen -ystems/ 7ddison Wesle)E &E Gesha. S/ An Engineering Approach to $omputer >etworking/ 7WLE (E 7ndre3 SE Tanenbaum/ $omputer >etworks/ PHIE *E Leon-1arcia 7E < Widjaja IE/ $ommunication >etworks/ Tata Mc1ra3 HillE

In e!n$% Con in4o4s 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/ so-t3are 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) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than 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(

CS!" +!(= Database Mana$ement S)stems

Te$&'in8 s&'eme & hours lecture and # hour tutorial 2er 3eek C!edi s5 (

Objectives To introduce the basic concepts of data bases connected with software engineering techniques and background information useful for the management of data bases. The syllabus includes the file organiBation database design and transaction processing techniques.

Mod4%e I ")1 'o4!s( Introduction= characteristics o- database a22roach - ad.anta$es o- usin$ D,MS - database conce2t and architecture - data models - schemes - instances - data inde2endence - database lan$ua$es and inter-aces database modelin$ usin$ entit)-relationshi2 >E:? - entit) sets attributes and ke)s - relationshi2s - t)2e role and structural constraints - 3eak entit) t)2es - enhanced entit)-relationshi2 >EE:? and object modelin$ - sub classes - su2er classes and inheritance - s2eciali6ation and $enerali6ation - modelin$ o- union t)2esE Mod4%e II ")2 'o4!s( 9ile or$ani6ation and stora$e= secondar) stora$e de.ices - :7ID technolo$) - o2erations in -iles - hea2 -iles and sorted -iles - hashin$ techniBues - t)2es o- sin$le le.el ordered inde@/ multi-le.el inde@es - ,-trees and ,D trees - inde@es on multi2le ke)s - other t)2es o- inde@esE Mod4%e III ")+ 'o4!s( Database desi$n= -unctional de2endencies - normal -orms - $eneral de-inition o- second and third normal -orms - ,o)ce-Codd normal -orm - multi .alued de2endencies and -ourth normal -orm - join de2endencies and -i-th normal -orm - inclusion de2endencies - 2ractical database desi$n tunin$ - database desi$n 2rocess relational model conce2ts - relational al$ebra o2erations - Bueries in S8L A insert/ delete and u2date statements in S8L .ie3s in S8LE Mod4%e I/ ")+ 'o4!s( Transaction 2rocessin$ = desirable 2ro2erties o- transactions/ schedules and reco.erabilit) - seriali6abilit) oschedules - concurrenc) control - lockin$ techniBues - time stam2 orderin$ multi .ersion concurrenc) control - $ranularit) o- data items - database reco.er) techniBues based on de-erred u2 data and immediate u2datin$ - shado3 2a$es - 7:IES reco.er) al$orithm - database securit) and authori6ation - securit) issue access control based on $rantin$/re.okin$ o- 2ri.ile$es introduction to statistical database securit)E

#E Elmasri <

Text Books a.athe/ Fundamentals of 5atabase -ystems/ Pearson Education/ -ourth editionE

Re#e!en&e Boo-s #E :amakrishnan :E < 1ehrke HE/ 5atabase Management -ystems/ Mc1ra3 Hill %E 5Kneil PE < 5Kneil EE/ 5atabase *rinciples *rogramming and *erformance/ Harcourt 7sia/ Mor$an Gau-man &E Silberschat6 7E/ Gorth HE9E/ < Sudarshan SE/ 5atabase -ystem $oncepts/ Tata Mc1ra3 Hill (E ;llman HEDE/ *rinciples of 5atabase -ystems/ 1al$otia Publications *E Date CEHE/ An "ntroduction to 5atabase -ystems/ 7ddison Wesle)

In e!n$% Con in4o4s 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/ so-t3are 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) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than 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(

CS!" +!*= Com2uter 1ra2hics

Te$&'in8 s&'eme % hours lecture and # hour tutorial 2er 3eek C!edi s5 &

Objectives To teach the fundamentals of computer graphics including algorithms for drawing 05 and '5 primitives ob:ect transformations and the like.

Mod4%e I ")0 'o4!s( Introduction - Dis2la) de.ices - :andom-scan and raster scan monitors - Color C:T - Plasma 2anel dis2la)s - LCD Panels - Plotters - 9ilm :ecorders - 1ra2hics Workstations - Dis2la) 2rocessors - 1ra2hics so-t3are In2ut/5ut2ut De.ices - Touch Panels - Li$ht Pens - 1ra2hics Tablets - %D Dra3in$ 1eometr) - Mathematics -or Com2uter 1ra2hics - 7 ,rie- Conce2t o- Tri$onometr) - Polar Coordinates - Parametric 9unctions 4ectors - Scalar Product - Cross Product - Matrices - Scalar Multi2lication - Matri@ 7ddition and Multi2lication - Matri@ In.erse - %D Trans-ormation - ;se o- Homo$eneous Coordinate S)stems/ Translation/ Scalin$/ :otation/ Mirror :e-lection/ :otation about an arbitrar) 2oint - Coomin$ and Pannin$ :ubber ,and Methods - Dra$$in$ - Parametric :e2resentation o- a Line Se$ment Mod4%e II ", 'o4!s( 1ra2hic 52erations - Windo32ort and .ie32ort - Elimination o- totall) .isible and totall) in.isible lines 3ith res2ect to a rectan$ular 3indo3 usin$ line and 2oint codes - E@2licit line cli22in$ al$orithm Sutherland Cohen 7l$orithm - Mid-2oint subdi.ision al$orithm - 9illin$ - Stack based and Bueue based seed -ill al$orithms - Scan line seed -ill al$orithm - 1eneration o- ,ar Charts - Pie Charts - Character 1eneration Mod4%e III "9 'o4!s( Conics and Cur.es - ,resenhamKs Circle Dra3in$ 7l$orithm A Elli2se dra3in$ al$orithm - 1eneration oElli2ses throu$h trans-ormation on circles - Cur.e Dra3in$ - Parametric :e2resentation - Cubic Cur.es Dra3in$ Cubic ,e6ier and ,-S2line Cur.es - ,eta s2lines - :ational s2lines Mod4%e I/ ")2 'o4!s( &D 1ra2hics - Trans-ormations - :i$ht handed coordinate s)stem - trans-ormation matrices -or translation Scalin$ and :otation around a@es - 2arallel 2rojection - Multi.ie3s - -ront/ to2 and side .ie3s - 5bliBue .ie3 - Projection on @) 2lane 3ith :a)s alon$ a $i.en direction - Pers2ecti.e 2rojection - Trans-ormation matri@ to )ield one .anishin$ 2oint - Pers2ecti.e .ie3 3ith .ie32oint l)in$ on 6-a@is - e--ect o- Translatin$ the object - Com2utin$ the .anishin$ 2oint - umerical E@am2les - Hidden sur-ace remo.al - ,ack 9ace remo.al - De2th ,u--er Method

Text Books
#E Hearn DE/ ,aker PEM/ $omputer 8raphics/ Prentice Hall IndiaE

Re#e!en&e Boo-s #E e3mann W < S2roull :E9E/ *rinciples of "nteractive $omputer 8raphics/ Mc1ra3-Hill %E :o$ers DE9E/ *rocedural Elements for $omputer 8raphics/ Mc1ra3-Hill &E 9ole) HE DE/ 4an Dam 7E/ 9einer SE GE/ < Hu$hes HE 9E/ $omputer 8raphics *rinciples and *ractice/ Second Edition/ 7ddison Wesle)E

In e!n$% Con in4o4s 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/ so-t3are 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) 7ll Buestions are com2ulsor)E There should be at least one Buestion -rom each module and not more than t3o Buestions -rom an) moduleE / x 0 marks12( marks

*A+T 3,

Analytical.*roblem solving questions 4 x / marks10( marks Candidates ha.e to ans3er -our Buestions out o- si@E There should be at least one Buestion -rom each module and not more than 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(

CS!" +!'>P? = S)stems Lab

Te$&'in8 s&'eme & hours 2ractical 2er 3eek C!edi s5 %

Objectives To make the learners understand the operating system structures and the implementation aspects of various D- functions and schedulers. To teach data base technology and familiariBe them with issues related to data base design through hands on practice.

O3e!$ in8 s:s ems #E Im2lementation o- dinin$ 2hiloso2hers 2roblem b) multi2ro$rammin$ usin$ threads/ sema2hores and shared memor) %E Im2lementation o- ls/dir command o- ;ni@/Dos to dis2la) contents o- a $i.en -lo22) diskE &E Pro$ram to $enerate disk usa$e status re2ort -or a $i.en ;ni@/Dos -ormatted -lo22) disk $i.in$ details like -ree s2ace a.ailabilit) etcE (E Im2lementation o- bankerKs al$orithm *E Inter-2rocess communication usin$ mailbo@es and 2i2es +E Pro$ram to -ind the least common ancestor o- t3o $i.en nodes in a binar) tree >Concurrent Pro$rammin$? 'E Pro$ram -or the readers and 3riters 2roblem >Concurrent Pro$rammin$? D$ $b$se m$n$8emen s:s ems #E Con.ersion o- a $i.en relational scheme to & 9 and ,C 9 %E Im2lementation o- , tree and ,D tree &E Im2lementation o- a database stored in an :D,MS accessible throu$h a 3eb bro3serE (E Pro$ram to con.ert S8L subset into relational al$ebra >tools like P7CC ma) be usedE? *E Im2lementation o- o2timistic concurrenc) control al$orithm

Re#e!en&e Boo-s #E utt 1EHE/ Dperating -ystems & A Modern *erspective/ 7ddison Wesle) %E ,ach MEHE/ The 5esign of the @nix Dperating -ystem/ Prentice Hall India &E Elmasri/ a.athe/ Fundamentals of 5atabase -ystems/ 7ddison Wesle) (E :amakrishnan :E/ 1ehrke HE/ 5atabase Management -ystems/ Mc1ra3 Hill

In e!n$% Con in4o4s Assessmen %Maximum Marks&/() +!I-Laborator) 2ractical and record &!I- Test/s #!I- :e$ularit) in the class Semes e! End E6$min$ ion %Maximum Marks&/() '!I - Procedure/ conductin$ e@2eriment/ results/ tabulation/ and in-erence %!I - 4i.a .oce

#!I - 9air record

CS!" +!0>P? = Mini Project

Te$&'in8 s&'eme & hours 2ractical 2er 3eek C!edi s5 %

Objectives

To estimate the ability of the student in transforming the theoretical knowledge studied so far into a working model of a computer . information system.
For enabling the students to gain experience in organisation and implementation of a small pro:ect and thus acquire the necessary confidence to carry out main pro:ect in the final year.

In this 2ractical course/ each $rou2 consistin$ o- three/-our members is e@2ected to desi$n and de.elo2 a moderatel) com2le@ com2uter / in-ormation s)stem 3ith 2ractical a22licationsM this should be a 3orkin$ modelE The basic conce2ts o- 2roduct desi$n ma) be taken into consideration 3hile desi$nin$ the 2rojectE 7 committee consistin$ o- minimum three -acult) members s2ecialised in com2uter science and en$ineerin$ 3ill 2er-orm assessment o- the mini 2rojectE Students ha.e to submit a re2ort on the mini 2roject and demonstrate the mini 2roject be-ore the e.aluation committeeE The di.ision o- the total marks is into t3o namel)/ +!I o- the total marks to be a3arded b) the $uide / Co-ordinator and the remainin$ (!I b) the e.aluation committeeE

In e!n$% Con in4o4s Assessmen %/( marks)

(!I - Desi$n and de.elo2ment &!I - 9inal result and Demonstration %!I - :e2ort #!I - :e$ularit) in the class

Semes e! End E6$min$ ion %Maximum Marks&/() %!I *!I %!I #!I Demonstration o- mini 2roject Practical test connected 3ith mini 2roject 4i.a .oce 9air record