29I{. Tech. (COMPUTER SCTENCE & ENGINEERING)

JAWAIIARLALNEHRUTECHNoLOGICALUNIVERSITYM.'tbch (CSE)

HYDERABADII SEMESTER

DISTRIBUTED COMPUTING

UNIT IIntroduction.I.he

different forms of computing - Monolithic, Distributed, Parallel and gooryrative computing, the meaning of '

Distributed computing, Examplei of Distributed systems, the strenglhs and wiaknesses of Distributed computing,

operating system coricepts reievant to distributed computing, the architecture of distributed applications.

UNIT IIDistributed ComPuting Paradigmsparadigms for nistributed Rpplications - Message Passing Paradigm, The Client-Server Paradigm (Java Socket

" ApI), the peer-to-peer paiadigm, Message system (or IvIOM) Paradigm - the point-to-point message

rnodel and the publish/subscribe message model; RPC mortel, The Distributed Objects Paradigms - RMI,

oRB, the objeci space paradigm, The Mobile Agent Paradigm, the Network Services Paradigrn, The collaborative

application ( Groupware Paradigm) ,choosing a Paradigm for an application.

UNIT IIIDistributed Objects Paradigm (RMI)Message passing versusDistributed objects,AnArchetypal Distributed objggtfrchitecture, Distributed object

Systems,h,p6, RMI,The Java RMIArchitecture, Java RMIAPI, Asample RMIApplication, steps for building

*n Rtutt application, testing and debugging, comparison of Rl'4I and socketAPI

I)istributed Obiect Paradigm(CORBA)'l'he basic Architecture, The CORBA object interface, lnter-ORB protocols, object servers and object clients,

i:bng;;j.;;;;f";";";r, CORBA Naming Service and the Interoperable Naming Service, CORBA object

services, object Adapters, Java IDL, An example CORBA application'

UNIT IVl)istributed Document-based Syste'msWWW Lotus Notes, comparison of WWW and Lotus Notes, Distributed Coordination-based systems -Introduction to coordination models, TIB, JIM, comparison of TIB and JINI

Software Agents, Agent Technology, Mobile Agents.

I)istributed Muttimedia Systems - charactriristics of multimedia data, QOS of service management, Resource

Management, Stream AdaPtation'

..1

I.]NIT VGrid Computingl)efinition of gri$, grid types - computational grid, data grid, grid benefits and applications, drawbacks of grid

computing, grid iomponents, grid architecture and its relation to various Distributed Technologies-

Oluster Computingn.uof ief -"o*puiing overview, clustercomputing-Introduction, ClusterArchitecture, parallel programming models

and Paradigms, Applications of Clusters'

TEXT BOOKS:I . Distributed Computing, Principles andApplicqtions, M.L.Liu, Pearson Education'

2. Distributed Systems, i'rinciptes and Paradigms, A.S.Tan6nbaum and M.V.Steen , Pearson Education'

3. Clienyserve#rogrurn.ningwith Java and CORBA, second edition, R.Orfali & Dan Harkey, John Wiley

& sons.

30M. T€ch' (COMPUTER SCIENCE & ENGINEITRIN(;)

wph & C'Fellenstein' Pbarson education'Grid computing, JJoseph

't u'reltenslellr'r-trarD':-:]-1::;::^--^-

-,r,,^ori^.;il;ffi;ffi;bl;J;; -omputing' Rajkumal Buvva' Pearson education'4.5.

REFERENCE BOOKS: aa,.& cnnsl. ANetworkingapptu"h toGridComputing'D'Minoli'WileY&sons'

Z. Grid Computing: APractical Guideto'Techl*togy and Appliltions' A'Abbas' Firewall Media"

3. Java Netwottit"gttt"*ing, E'R'Harold' 2"d edition' O'Reilly' SPD' !

4. Distributed systems, conceps andDes-igr;,i" "oi,ion,

GCoulouris, J.Dollimore andrimKindbirg'Pearson

Education. r edition, Brose, Vogel, Duddy, Wiley Dreamtech.

5. Java Progiamming with COREA' 39 edition' brose' voget

31ilr. Tech. (COMPIIIER'SCIENCE & ENGINEERING)

JAWAHARLAL NETIRU TECIINOLOGICALM.Tech(CSE);:i'ijrri

. . :.,i ilISTRIB {J}ED'D'AfAB AS ES

UNIVERSITY IIYDERAI}AI)TI SEMESTEIT

II!!

UNIT t , r?a*r,.,(rprirmiire-rt Il lDistributedDatabases; I-evets Of Distribution

r.:c"turaoroistributed versrrs,Gentraiized'DirtabrisesjPrinciple!,91?fH:.1t?1lift-lti1fl""ill#'Y#i.l,ransparency,.Reference Architectrre far DistIftiulto *'f tTyped of'l)ata'Fragmentatibn' Integrity

C.onstiaints in Distributed Databases, Distributed Database Design

IJNIT II.l.ranslation of Global Queries to Ftagment Queries, Equivaltince'transforinations for Queries'Transforming

Grobar Queries i*" erig*"nt queriJs, Distri-buted Grouping and Aggregare Function rivaluation, Parametric

'Queries.Optimization'of Access Strategies, AFramework for Query Optimizatibn, Join Queiies' General Queries

'

I]NIT III.l.heManagernent of Distributedrransactions, AFrameworkforTransactiolr Management; supportingAtomiciiy

of Distributed'l ransactions, concurrency control forDistributed'fransactions,ArchitecturalAspects of Distributed

'l'ransactions

concunency Control, r*oundation of Distributed concurrencv c..Ttttl:-?-l:1t::::9 Deadlocks' concurrency

gonrrol baseo onrimestoJpel,opi*it,i" rta"inoos forDistiibiiied Ctrncurrency Control

IINIT IV :liability and concunency Control, I)etermining

Reliability, Basic Concepts' Nonblocking Commitrnent Protocols' Re

. cqnsistent,view,of tlip Network;.Deiection'and Resolution of Inconsistency, checkpoints and cold Rbstart'

il;ilil ;;;"* ;;;;;;;#, dlofManagennnr iri Diitributed Databases, Auihorization and Protection

I'JNIT v .verArchitectures, Cache Consistency, object Management, objectArchitectural rsstres' Alternative-clie"utT::*l*;::H:,:l

)bject euery processing,ldentifierManage-"nL Pnin

"rswiizling'ObjectMigration'Distributed ObjectStorage' (

Object euery processor Architectures, Qu"ry Procissing Issues, Query Execution"fransaction Management'

.[.ransactionManagementinobjectnnuss'riansactionsasobjects

Database Inregration, scherne.l'ranslation; ccheme'Integqation, Query Processing Query Processing Layers in

Disrribured MuttiDgMssr,Qubry,opti'rhization'IssuesTiiinsaction vtonog"tnelt J'rlnsaction and computation

Model, Multidathbase cotrcurrerity conirorr,'MultidatabaseRecovery object orieritation and Interoperability'

object ManagementArchitecture coRBAand Database interoperabiiity, Distributed component object Model'

(:olwolE and Database Interoperabil ity, PUSH-Based I'echnologies

i : : I "'r''i;-ti:'11t't'';-':i'i

).'

'l'rlxr BooKs:'l. Distributed Databases Principles & Systems, Stefano Ceri, Giuseppe Pelagatti,TMl-l'

2. principles or nitiiuuted Daiabase Systems, M. Tlner ozsu, Patrick Valduriez, Pearson Education' 2nd

Blition.

UNIT I

design, Amdahl's law.

size of operands, operations in the instruction set.

UNIT II

branch penalties.

1

.32 M. Tech. (CONIPUTER SCII,NCI: & IiNGIN};ERIN(;)

JAWAIIAIU,AI, NEHRU TECIINOLOGICAL UNIVERSITY IIYDERABADM.Tech (CSE) II SEMESTER

ADVANCBD COMPUTER ARCHITECTURE

Fundamentals of Computer design, Changing faces of computing and task of computer designer,.Technologytrends, Cost price and their trends, measuring and reporting performance, quantiulive principles of computer

Instruction set principles and examples- Introduction, classifyin-e instruction set- memory addressing- type and

Pipelines : Introduction ,basic RISC instruction set ,simple implenrentation of RISC instruction set, Classic fivestage pipe line forRISC processor, Basic performance issues in pipelining, Pipeline hazards, Reducing pipeline

Memory hierarchy dcsign : lntroduction, rcview of AIIC of cache, Cache performance , Reducing cachemiss penalty, Virtual rnemory.

UNIT IIIInstruction lcvel parallclism the hardware approach - Instruction-level paralletism, Dynamic scheduting,Dynamic scheduling using'lbmasulo's approach, Branch prediction, high performance instruction delivery-hardware based speculation.

ILP software approach- Basic compiler level techniques, static branch predection,.Vltw approach, ExploitingILP, Paralleilsm at compile time, Cross cutting issues -Hardware verses Software.

UNIT IVMulti Processors and Thread level Parallelism- Introduction, Charctersitics of application domain, Systematic

'shared mcmory architecture, Distributed shared - memory architecture, Synchronization.

UNIT VInter connection and networks - Introduction, Interconnection network media, Practical issues ipinterconnecting networks, Examples of interconnection, Cluster, Designing of clusters.FSIntel Architccture: intel IA- 64 ILP in ernbedded and mobile markets Fallacies and pit falls

Text Books:I . John I-. Ilennessy, David A. Patterson, Computer Architecture: A Quantitative Approach, 3rd Edition, An

Imprint of Elsevier.

Refcrence Books :

I . John P Shen and Miikko H. Lipasti, Modem Processor Design : Fundamentals of Super ScalarProcessors2. ComputerArchitecture ai.rd Parallel Processing, Kai Hwang, Faye A.Brigs., MC Graw Hilt.,3. Advanced Computer Architecture - A Design Space Approach, Dezso Sima, I'erence iiountain, Peter

Kacsuk. f;earson ed.

f,{. Tcch. (CON{PLITER SCIIIJNC-E & ENGINTiERIN(;) 33

, . ,i: i J,iI.WAIIAIILAI. NIlllRU I'IICIINO!,OGICAL IJNMiRSI'I'Y ttyDERAllAl)tvt.Tec[,1csfr,1, . .,.i, ' Ir SEMESI'nR

- : ' ' '-- tr--:- r -'-t -'-,it-,' i'i:':l

: , : AD\ANCEI) COMPUT'IIR NIIIIWORKS

UNIT I RcviewComputcr Networks and the Internet: What is the Internet,'fhe Nctwork edge, 'I'he Netrvork core, Access

Nerworks and Physical media, ISl,s and Intemet llackbones, Delay and l-oss in Packet-switched Networks,.

Itistory of Computer Networking and the lntemetFogndation of Networking Protocols: 5-layer'fCP/ll'Model, 7-Layer OSI Model, Internet Protocols and

Addressing, Iiqual-Siz.cd Packets Model: Al'M -Networking Devices: Multiplexers, Modems and lnternet Access l)evices, Switching and llouting Devices,

Router Structure.

UNIT II'the Link Layer and Local Arca Netrvorks: I-ink Layer: Introduction and Serviccs, Ilrror-Detection and

lirror-Corection techniques, Multiple Accesi Protocols, Link Laycr Addressing. lithernet, [nterconnections:

I Iubs and Switcbes, PPP: Thc Point-to-Point Protocol,I.ink Virtualizationllouting and Intcrnctworking: Network-l,ayer Iloutin-e, Least-Cost-Path algorithms, Non-Least-(lost-Path

algorithms, lntradomain Routing Prottrcols, Interdomain Routing Ptotocols. Congcsti<ln Control at Network layer

UNIT IIIl,ogical Addressing: IPv4 Addresses, IPv6 Atldressc.s - lnternet ltrotocol: Intcrnetworking, lPv4, IPv6,'l\ansition from IPv4 to IPv6 -- Multicasting'fechniques and Protocols: Ilasic Definitions and lbchniques,

lntradomain Multicast Protocols, Interdomain Multicast Protocols, Node-I-evel Multicast algorithrns -'fransportand End-to-End Protocols: 'l'ransport Layer,'Ii'ansmission Control Protoqttl ( I'CPi. [Jser Datagram Protocol(l.iDP), Mobile'lransport Protocols. 'fCP (,.ongcstitn Control - Applicutiort La-ver: Principlcs of Nctrvork

Applications,'l'hb Wsb and IfI'fP, l:ilc'l'ransl'er: lrl'P, lilectronic Mail in tltc lntcrnct. I)omain Name System

(l)NS). P2I, File Sharing, Socket.Programrning with'l'CP and Lil)l1 lluilding a Sirnplc rfrtb Server

I.JNIT IVWireless Netrvorks and lVlobile IP: ln{tastructure of Wireless Networks. Wircless I.AN'l'eclrnolbgies,IEEEtt02.l I Wreless Standard, Cellular:Networks, Mobile IP. Wirclcss Mesh Networks (WMNs) - Optical Nctrvorksand WDM Systems: Overview of Optical Networks,13asic OpticalNetworking l)qvices,l.argc-Scalc Optical

Switches. Optical Routers. Wavelength A.llocation in Networks. (lase Study: An All-Optical Switch.,..:

TJNTT VVPNs,lirnneling and Ovcrlay Nctworks: Virtual Privatc Networks (Vl'Ns). lvlultiprcltocol l.abel Switching(MPI-S), Overlay Networks - VoIP and Multimedia Netrvorking: Overvierv of IP'lclephony, VolP SignalingProrocols, Real-'Iime Media 'I'ransport. Protocols, Distributcd lr{ultirnedia Netrvorking, Stream Control'l'ransmission Protocol - Mobile A-IIoc Netrvorks: Overview ol Wireless Ad-lloc Networks, Routing in Ad-Iloc Ngtworks, Routing Protocols lbr Ad-ltoc Networks -.\Yircless Scrsor Netrvorks: Sensor Netrvorks

and Protocol Structurcs, Conrmunicirtion linergy Model, Clustering Protocols, l{outing I'rotocols

'l'[]XT BO0KS:I . Computer Netrvorking: A'lbf-Dou'n Approach l:eaturing the [ntcrnct , .larncs Il Kuro:-<', Kcillr tVllo.rs,

'l'hird lidition, Pcarson llducation. 2007(-'omputer and Communication Networks. Nulct Pcarsort 2041

34 'M'Tech' (cOMPUTER sCIENCE & ENGINEER'-"1I

illmni:i*f nf#$#f t'ilr*ffi$ffi :::il:lPress)

'..: f

j';

t

M. Tech. (COMPUTER SCIENCE & ENGINEERING)

E,CIINOLOGICALUNIVERSITYHYDERABAD. .IAWAHARLAL NEHRU TECHNOLUUIUAT- II SEMESTER

M.Tech (CSE)

wEB SEBVICESELECTIVE III

UNIT I - n-.^r...:^; ^r,ricrri e distributed computingEvolution ahd Emergence of Web Services'Evolution of distributed computing' Cor

technorogie, .- ,iri"r,t7re*"r-coRgA, leva nwri, tuti"ro soriocotvt, Mon7i, cha'enges in Distributed

computing, rou orrzdtrrixr"u- i" distributed computing, "rn"rg"rr""

of web Services and service oriented

Architecture (SOA)-

lJ*ll*." to web services - The definition of web services, basic_ operational model of web services'

toors and technorogiJs "i"uii"g *"u u"rni*"r, u"n"no and challenges of using web services - web Services

Architecture - web services Architecture and its characteristics, corl building biocks of web services' stand'ards

andtechnologiesavailableforimplementingwebser-vl:e-s'webservicescommunication'basicstepsoflr"pf"*""ti*"*"U r"rui."t, developing web servicese*abled applications

UNIT III - --^r:-- eAAnmcorefrrndamentals of soAp-soApMessage Structurq sog encoding, soAP messageexchange models'

SOAP communication and messaging, SO-Ap ioutity - Developing Web S"ryt::t^:ting SOAP - Building

SOApWeb S"*i""., O"u"ioping SOAP Web Servicei *sing Java' limitations of SOAP'

UNIT IVDescribing web services _ wsDL _ wsDL in the world of web s.ervic1,]3! services rife cycle, anaromy

of wsDLdefinitiondocunpnr,wsDlbili;r,*fDJ-Too.rs,limitations ofwsDl-DiscoveringwebServices

* Service discovery role of service discovery in a soA, service discovery mechanisms' UDDI - IrDDI Registries'

uses of uDDI Registry, prograqlming with UDDI, UDDI data structures' suppoT for categorization in UDDI

Regisrries,Fubrirhi;;i!,j:p;tlilhi"g,nformationto arrDDIRegistry, searching information ina IJDDIRegistry'

deleting information in a UDDIRegistry limitations of UDDI'

i^illilrvicei Intcroperability - Means of ensirring Inreroperabirilvaoy.elview. of .NEt andJ2EE' web

. services security - Jirrg- security frame work, XML.n"ryition, XML digital signature, XKMS structure'

guidelines for signifrg XML documents'

TEXT BOOKS:l.DevelopingJavawebServices,R.Nagappan,R'skoczylas'R'P'sriganesh'wileylndia'rp-20o8'2. Developing;iil;t" y+l"rni""r, 5. Cnott"tlt", J' Webber' Pearson Education' 2008'

3'XMLIWebServices,andtheDataRevolulion,F.P.Coyle,PearsonEducation.

REFERENCE BOOKS:l. ' 'Building web Services with Java,2nd Edition, s. G$ry and others' Pearson Edn'' 2008'

2.JavaWebServices,D.A.Chappell&T.Jewell,o,Reilly,SPD.3. McGovern, et al., ..Java web services Architecture", Mlrgan Kaufmann Publishers'2O05'

4. J2EE Web Slrvices, Richard Monson-Ilaefel, Peaxon Education

5. Web Services, G. Alonso, F Casati and others' Springer' 2005'

35

36 M. Tech. (COMPUTER SCIIiNCE & ENGINLERING)

JAWAHARLAL NEIIRU TECIINOLOGICAL UNIVERSITY TIYDERABAD

M.'[cch (CSE) II SEMESTER

INFORMATION hETRIEVAL SYSTEMSELECTIVE III

UNIT IIntroduction: Definition, Objectives, Functional Overview, Relationship to DBMS, Digital libraries and [)ata

Warehouses,Information Retrieval System Capabilities - Search, Browse, Miscelladeou"

UNIT IICataloging and Indexing: Objectives, Indexing Process, Automatic Indexing, Informatiop'Extraction, Data

Structures: Introduction, StemmingAlgorithms,Inverted file structures, N-gram data structure, PAl'data stnrcturc,

Signature file structure, Hypertext data structure - Automatic Indexing: Classes of automatic indexing, Statistical

indexing, Natural language, Concept indexing, Hypertext linkages

UNIT IIIDocument and Term Clustering: lntroduction, Thesaurus generation, Item clustering, Hierarchy of clusters

- User Search Techniques: Search staternents and binding, Similarity measures and ranking, Relevance

feedback, Selective dissemination of information search, Weighted searches of Boolean systems, Searching the

Intemet and hypertext - Information Visualization: Introduction, Cognition and perception, Information

visualization technologies

UNIT IVText Search Algorithms: Introduction, Software text search algorithms, Hardware text search systems.

Information System Evaluation: Introduction, Measures used in system evaluation, It{easurement example -TREC results.

UNIT VMultimedia Information Retrieval - Models and Languages - Data Modeling, Query Languages, Indexing

and Searching - Libraries and Bibliographical Systems - Online IR Systems, OPACs, Digital Libraries.

TEXT BOOKS:l. Information Storage and Retrieval Systems: Theory and Implementation By Kowalski, Gerald, Mark f'

MayburyKluwerAcademicPress, 2000.

2. Modern Information Retrival By Ricardo Baeza-Yates, Pearson Education, 2007.

3. Information Retrieval: Algorithms and Heuristics By David A Grossman and Ophir Frieder, 2d Edition,

Springer Intemational Edition, 2004.

REFERENCE BOOKS :

L Information Retrieval Data Structures andAlgorithms By William B Frakes, Ricardo Baeza-Yates, Pearson

Education,l992.2. Information Storage & Retieval By Robert Korfhage - John rffiley & Sons.

3. Introduction to Information Retrieval By Chiistopher D. Manning and Prabhakar Raghavan, Cambridge

University Press, 2008.

38

JAWAIIARLALM.Tech (CSE)

M. Tech' (COMPIIIER SCIENQ'E & ENGINITERING)

NEIIRU TECHNOLOGICAL UNIVERSITY HYDERABAD. II SEMFSTER

NETWORKS AND MOBILE COMPUTINGELECTIVE - IV

WIRELESS

UNITI:INTRODUCTIONToMOBILEANDWIRELESSLANDSCAPEDefinition of Mobile and wireless, components of wireless Environment' challenges

Overview of Wireles; Networks' Categories of Wireless Networks '' ' I

wireless LAN , tnrru ,"0 v, ,"oio ,*nr*ission, Infrasrructure unJeo+,* Network, IEEE 802' I I ' HIPERLAN'

BluetoothGLOBAL SYSTEM FOR MOBILE-COMMUNICATIONS(GSM)

GSM Architecture, GsM Entities, cau nouing in GSM, PLMN l*rft""r' GSM Addresses?nd{dentifiers'

Network Aspects in GSM, GSM Frequency Aliocation, Authentication and security

UNIT II: uorirlE NBiwonK LAYER :rrisementanddiscovery

Mobile IP (Goals, assumptions, entities and terminology, IP packet delivery, agent adve

regisrrarion, tunneling and encapsufu*"n,^opii*i*tt3{i Ory1*i" ftott Connluration Protocol (DHCP)' Mobile

Ad-hoc networks : Routing, destination Sffu"n"" Oitiance Vector' Dynamic Source Routing'

rvrogiJr rRANsPoni laynn . i :,- mm E^.Traditional'fCP, Indirect TCP' Snooping TCP' Mobile TCP' Fast retransmit/fast recovery' Transmission /time-

oui ir""ring, Selective retransmission' Transaction oriented TCP'

UNIT III: BROADCAST SYSTEI\'IS . , --^:-^.rr..,+i-azrianlrienroverview, cyclical repetition of data, Digitar aucrio broadcasting: Multimedia object transfer protocol' Digital

videobroadcasting: DVB databroaacasti'ng,DvB forhigh*peei internetaccess, convergence of broadcasting

and mobile communications'

UNIT IY : PROTOCOLS AND TOOLS:

wireress Apprication protocol-wAp. qntro{;r'lon, prorocor ar{tecture, and trearment of protocols of all layers)'

Bluetooth (User scenarios, physical layer, MAC layer' networkgg'security' ttqTT*"ment) and Tzl\lE '

wIRELEsS LANGUACb iNO CbNTNNT - CgFWNAfIbN TBCTTNOLOGIIqS

Wireless Content Types, Markup Lunguages. IIDML' wML, HTML, cHTML, XI{[ML' VoiceXML.

ct} :rtent_ GenerationTechnologies: cGI withperl, Javasenrets, Java serverpages,Active serverPages'XML

wrth XSL Stylesheets, Xfnfl-pi"ument' XSL Stylesheet

UNIT V: MOBILE AND WIRELESS SECURITY

creating a Securb Environment" securiry T#;, ;ffiy Technorogies, orher security Measures, wAP security'

irun iri"nt SecuritY

TEXT BOOKS:l. Jochen schiller, "Mobile communications", PearsonEducation' second Edition' 2008'

2. MartynMali"f., JftAolife andqrelessDesignEssentials"'Wiley' 2008'

3. Asoke f fufu[i"i"' ul, "MobileComputing"'TataMcGraw Hill' 2@8'

REFERBNCE BOOKS:l. Mobile Comp",i.Sn'i Kamal'Oxford University Press'

-,, D^-^^- a^^nart rir2. william Stallings, " wireless communications & Networks"' Person' second Edition' 2007'

3.FrankAdelsteinetal,..FundamentalsofMobileandPervasiveComputing''''fM}I,2005.4 . J im Geier, "Wireless Networks first-stef

" Pearson' 2005 '

5.SumitKaseraetal,..2.5GMobileNetworks:GPRSandEDGE,''TMH,2008.6. Matthew s-auri-ilioz' l I Wireless Networks"' O'Reilly' Second Edition' 2006' 'i . Ivan Stojmenovic , "Handbook of *ireless Networks anJMoUile Computing"' Wiley' 2W7:

a

t

i\1. Tech. (COMPUTER SCIENCE & ENGINEERJNG)'

"i'JAWAHARLAL:NE*IRU TECIINOLOGICAL UNIVERSITY HYDERABAD

M.Tech (CSE) II SEMESTER

rf. ,i-'. ;SEMANTIC WEB AND SOCIAL NETWORKS

"1i; r,-){i.,.i,i i i:,'ffifrCICIV,E-III :

' ,:':. j..:'-l::.;i.-.i '.;j'. il:f! , ; ' ' ," . ",Unit -I: Web Intelligence ' -r :".l:hirildng And.Intelligentlileb Applications,{he-InformationAge,The'World Wide Web, Limitations of Todays

.

Web,The Next GenerationWeb, Machine Intelligence,Artifical Intelligence,Ontology,Inference engines,software

AgentS,BernerS.IJewww,SemanticRoad'Map,I.ogicontlitisemantic'Web., , t-:

Unit -II: Knowledge Repr.esentation for the Semantic Web ' : , : ;

Ontologies and theirrole inthe semantic web,OntologiesLanguages fortheSemanticWeb-ResourgeDescriptionl;ramewbrk@DF) / RDF Schema, Ontology Web I-anguage(OWL),UML,)C{IrffL Schema.

.r:.. !. ;

: :iLl hit;Hl: Ontb logy EngineeiingOntologyEngineering,ConstructingOntology,OntologyDevelopmbntTools,OlitologyMethodspntotogySharingand $elglnqrlltolgeV Li.brlies 4trd Ontglpgy lv{apping,I.ogic,Rule and Inference Engines.

.tJnit-IV: Semantic Web Applications, Services and TechnologySemantic Web applications and services, Semantic Search,e-learning,semantic Bioinformatics;I(nowledge Base

.XMlBased,WebServieesrcreatiogan OWL-S Ontology forWeb Services,Semantic SearchTechnotogy,WebSearclr,."{gents and Semantic Methods,

(Jnit-V:.Social Network Analysis and semantic web'| . .. ': I i l

What is social Networks analysis,developnrgnt of the social networks analysis, Electronic Sources for NetworkAnalysis - Electronic DiScussion networks, Blogs and Online Communities,Web Based Networks.BuildingSemantic WebApplicaiions with social network featu[es.

,I'EXT BOOKS:I . Thinking on the Web - Berners lre,Godel and Turing,Wiley interscience,20o8.2. Social Neworks and the Semantic Web ,PeterMika,Springer,2007.

LEFERENCE"BOOKS;, .

l. Semantic Web,Technologies ,Trends and Research in Ontology Based Systems, J.Davies, R.Studer,P.Warren, lotrti Witey & Sons.

2. Semantic Web and Semantic Web Services -Liyang Lu Chapman and HaIUCRC Publishers,(Taylor &Francis Group) '

.1. Information.sharing on the semantic Web - Heiner Stuckenschmidt; Frank Van Harmelen, Springe.rPublications '

-1. Programming the SemanticWeb,T.Segaran,C Evans,J Taylor,O'Reilly,SPD.

37

l,

'il i1ia ;

,rlil

i"1r, i

lii, r

\:i

t,iir' I

;t,i i,,':,:.

ii riil'j' ,i

rii i

r|i1i, l.

38 M' Tech' (COMPLJTER SCTENCE & ENGINITERING)

J AWAIIARLAL NETIRU TECHNOLOGICAL UNIVERSITY HYDERABAD

M.Tech (cSE) t II SEMESTER

WIRELESS NETWORKS AND MOBILE COMPUTINGELECTIVE - IV

I'JNITI:INTRODUCTIONToMOBILEANDWIRELPSSLANDSCAPEDefinitionofMobileandWireless,ComponentsofWirelessEnvironment,Challengesou".ui"*ofWirelessNetworks,CategoriesofWirelessNetworks,,.lwireress LAN : Inrra red vs radio transmission, Infrastructure and Ad-hoc Network, IEEE 802' I I ' HIPERLAN'

BluetoothCiosal SySTEM FOR MOBILE COMMUNICATIONS(GSM)

GsM Architecture, GsM Entities, ca[ Routing in GSM, PLMN Interfaces, GSM Addresses'-and{dentifiers,

Network Aspects in GSM, GsMFrequencyAllocation,Authentication and security.

NETWORK LAYERUNIT rr: MOBILE NETw{)l:.'::l,o:*i-^raorr rpnrnlre, tisementanddiscovery,Mobile Ip (Goals, assumpions, entities and terminoloqv,_IP nac\et delivery, agent adver

registration, tunneling oni "n"oprulation, -optimizationJj,

Oynamic l{ost Configuration Protocol (DHCP)' Mobile

Ad-hoc networks : Routing, destination sequence Distance vector' Dynamic source Routing'

MOBTLT TRANSPORT LAYERltaditional TCR Indirect TCP, Snooping TCP, Mobile TCP, Fast retransmit/fast re'overy', Transmission /time-

out freezing, Selective retransmission, Transaction orientedTCP'

UNIT III: BROADCAST SYSTENTS

Overvieq Cyclical repetition of data, Digitat audio broadcasting: Multimedia objecttransfer protocol'.Digital

video broadcasting: ovg oatu uroadcasting, DVB for high-speeJ int"*.t u"cess, convergence of broadcasting

and mobile communications'

UNIT IV : PROTOCOLS AND TOOIS:wirelessApplication protocol-wAp. Gntroouction, protocol architecture, and treatment of protocols of all layers)'

Blueroorh (User scenarios, physical layeg MAC h'yer' networking, securig link Tfl*em"nt) and J2ME'

WTRBLESS.LANGUACb ANo CONTENT - CnNsnAIION TECHNOLOGIES

Wireless ContentTypes, Markup Languages: IIDML, ryIut, HTML, cHTML, xI{rML' VoiceXML.

c,.l:rtent- Generation Technologies: cGI with Perl, Java sen'lets, Java Server Pages' Active server Pages' XML

w rttr XSL Stylesheets, XML Document, XSL Stylesheet

UNIT V: MOBILB AND WIRELESS SECURITY

creating a Securb Environment, security Threats, security Technorogies, other security Measures' wAP security,

il}"ffffi* .r!^-^', D-oecanErrrrnarinn (ecnnrtFrlition.2008.l. JochenSchiller, "Mobilecommunications",PearsonEducation, secondEdition' I

2. MartynMallicK "Mobile andwirelessDesignEssentials",wiley' 2008'

3. Asoke KTalukder,et al, "Mobile computing",Tata McGraw Hill' 2008'

REFERBNCE BOOKS:L Mobile Computing,naj Kamal,Oxford University Press'

^ - -- r r:r2. william stallingsj. wireless communications & Networks", Person, second Edition, 2007'

3. FrankAdelstein et al, "Fundamentals of Mobile and Pervasive computing""fMFl' 2005'

4. Jim Geier, "Wireless Networks first-step"tsearson' 2005'

5. sumit Kasera et al, ..2.5G Mobile Networks: GPRS and EDGE ,' TMH, 2008'

6. Matthew S.Gast, *802.11 wireless Networks", o'Reilly, Second Edition' 2006' '' .

7 . Ivan Stojmenovic , "Ifandbook of wireless Networks and Mobile computing"' wiley' 2007'

iili :i

I\{. Tech. (COMPUTER SCIENCE & ENGINEERING)

JAWAIIARLALNEHRUTECHNOLOGICALUNIVBRSITYHYDERABADII SEMESTERM.Tech (CSE)

INFORMATION'SECURITYI ELECTIVE-IV '

UNIT I r ^ ---^-r!^- rt^,tifi^'ii^. qnd Fatrric:Security Goars, security Attacks ontemrption, Interception, Modification and Fabrication), security services

(confidenriality, Autieriti*,ion, Integrity,Nonrrepuaiaiion, u:""r. conool andAvailability) and Mechanisms' A

model for Internetw;;;"ttty' ntJrnet Standaids and RFCs

UNIT IIConventional Encryption Principles & Algorithms(DES, AES, RC4), Block Cipher Modes of operation' I.-ocation

i,llil?$:ffiJ;fiff"J,i.:$[::ili,* key cryptography argorithms(RsA, RABIN, ELGAMAL, Difne-

I'Iellrnan, bCCj, KeY Distribution

xil:Jj[", of Message Authentication, secure }Iash Funcrions(srlA-512, WHIRLPOoL) and HMAC

Digital signatures: comparison, pro""r,--N'"0 for'Keys' sign'ng ttt" Dtgest' Seryices' Attacks on Digital'

;i;;;";;' reru"tot' i'509 Directory Authentication Sbrvice

UNIT IVil''t S""u.ity' Pretty Good Privacy (PGP) a1O !nn$^ntinnil security: Pretty Good rnvacy \t"t',o'i:,-L-ii."i^.**"* ritypayload,combiningtp Security Overvie% n, S."*ity erJt itecture, Auttpntication 1leader' Encapsulating Secul

39

#tly.illt':r',H;:i f1#:3*T;f,lr* (ssl) andrransport r-aver Securitv (rls), secure Erectronic

'fransaction (SET)

|j$]jn""prs of SNMp, sNMpvr community facirity and SNMpv3,Intruders, viruses and relared rhreats'

ffi :$:::'ffii1ffi r"r, r*st"d ir*"*' rntrusion Detection svsrems

'I'EXT BOOKS : L-.rr':r:^n er6*;nac T

.l.Netwo4securityEssentials(ApplicationsandStandards)byWilliam.statlingsPearsonEducation,2003"2. Crypto,lraphy';'N;;tk S""*itv by Behrouz A' Forouzan' TMH 2007"

REFERENCE BOOKS :

i." -r"i";rn"rion s""urity by Mark Stamp' Wley - India' 2006'

2.. Information Syrt"'sSe"urity'Godbole'Wrley StudentEdition'

3. cryptography and Nerwork si*ri.d;twiiri". ir"llings, Fourth Edition,Pearson Education 2007'

1. punOamentals of Computer Security ' Springer'

I. itH:ffi;;il;fiil ";oi;i" "JrJ'r'i"*'*oFry BragsJv'ark Tg*:ly:). l\etrvurl\ revqr rlJ ' r Iv ev"rr'

ussett a G.T.Gangemi;;. ;ilil"; Secuiitv Basics bv Rick Lehtinen' Deborah R SPD O'REILLY

2006.

il;;- Cryptography by Wenbo Mao' Pearson Education 2007'

Principles of tnformation Security, Whitrnan' Thomson'

4A lI. l'cclr. ((-'Oi\ll't il'ER SCtl:N(lU & IiNGINF:!:RIN(;)

.l ATVAI{AIII,,\ t. N }I IR U'l' EC tlNOLOGlC,lL LiNt\/IiRSITY IIYDIiITABAI)

M.Tech(CSE)IISIII\{ESTERS'IORAGE AREA NEI'WORKS

EI,ECTIVE,TV

Unit I: Introduction to Storagc'l'echnclogy

Review data creation and th.-Jamount of Oata being created and understand thc value of data to a business'

challen$es in tlaia srorage and data mana-Qiemcnt, SJlutions available tor data stora,qe, core clements of a data

center infrastructur", ,ui" of each elc'menr in supporting business activities

Unit II: Storage Systcms Architecture t'^ . .-Hardware and softrvare compopents of thc host environnrcnt, Key protocols and,concepts used by cach

component ,physical and logical components of a conncctivity environment.Mirjor physical components ol'a

disk drive and their function, logical constructs of a physical disk, accr:ss characteristics' and performance

Implications, concept of RAID and its componenrs , Different RAID levels and their suitability for different

application environments: RAID 0. RAID l, RAID 3. RAID 4. RAID 5, RAID 0+l' RAID l+0' RAID 6'

Compare and contrast integraterl an<J nrodular storage systems ,lligh-level architecture and working of an

intelligent storage system

Unit tII: Ihtrodtrction to Networkcd Storage

Evolution of nerworked storage. Architecture, components, and topologies ol'l:C-SAN' NAS, and IP-SAN "

Benefits of the different networked storage options, undcrstancl the nee<J for long-term archiving solutions and

describe how CAS fulfills the need , understand the appropriatcness of the diffcrent networked storage options

for different application environments

Unit IV: Infbrmation Availability & Monitoring & Managing I)atacenter

List reasons for plalned/unplanned outages and ihc impact of downtime, lmpact of downtime' Differentiate

between business continuity (llC) an<t disaster recovery (DIt) ,l{fo and RPO, Identify single points of failure

in u ,io.ng" infrastructu*. oni list solutions to mit igate these failures , Architecture of backup/recovery and the

different backup/recovery topologies , replication technologies and their role in ensuring infonnation availability

and business continuity, nemlt" repiication technologies and their role in providing disaster recovery and business

continuity caPabi I ities

Identify key areas to m0nitor in a data center, Industry standards fol data center monitoring and managenrent,

Key metrics to monitor for different components in a storage infrastructure, Key management tasks in il data

center

Unit V: Securing Storage and Storage Vinualization

Information security. C'ritical security attributes for inlbrmation systems, Storage security domains, I-ist and

analyzes thc common threats in each d<lmain, Virtualization technologies, block-levet and file-level virtualization

technologies and PtocessesCasc StudiesThe technologies ctescribed in the course are reinforcetJ with IIMC examples o{'actual solutions'

Realistic case stuclies enable the participant to design the most appropriate solution fsr given sets of criteria'

TEXT BOOKS :

l. EMC Corporation, informati.n Storage and Manageme nt, Wiley.

z. Robert Spalding. "storage Nctrvorks: 'l'he Oompletc Ref'erence",'[ata McGraw Ilill ' osborne, 2003'

3. Marc lrarley, "Building Storege Nctworks",'l'ata McGlarv l-Iill ,Osborne. 2001.

4. Mceta Gupra' Storage Area Netrvork l;undamentals' Pearson lidtrr;atiott I'imitcd' 2002' '' '

,'i '

I

lt:

i\1. Tcch. (coMpuTER SCII'NC.E & ENGTNEERING) 4t

JAWAI.IARLAL NEIIRUM.l'ech (CSE)

TECHNOLOGICAL UNIVERSITY TIYDI'RAIIAI)

u DATABASES

I SEMBSTER

AND COMPILER LAB

DATABASESobjective: This lab enables the students to practice the concepts leamt in the subject DBMS by developing adatabase for an example company named "Roadway Travels" whose description is as lbllows.'fhe student iscxpected to practice the designing, developing and querying a database irt'ihe conr'ext of example databaic"Roadway travel". Students are cxpected to use ,.Mysql"

daiabase.

lloadway Travcls"Roadway Tbavels" is in business since 1997 with several buses eonnecting different places in India. Its main

:::il;J,t;#rize its operations in the ronowing areas: , r . ,.) Reservations,' 'l'icketing

? Cancellations

Reservations:Reservations are directly handled by booking office. Reservations can be made 60 days in advance in

either cash or credit. In case rhe ticket is not available, a wait listed ticket is issued to the customer..I'his ticketis confirmed against the canceilation.

Cancellation and Modifications:Cancellations are also directly handed at the booking office. Cancellqtion charges will bc chargcd.wait listed tickets that do not get confirmed are fulty reyunaed e- -'

l\'cekl: E-R Model .

'Analyze the problem carefullyand'do*. up with the entities in it. Identify what data has to bc persisted in thcdatabase.'Ihis contains the entities, attributes etc.

lfntifl the primary keys for alt the entities. Identify the other keys like candidate keys, partial keys, if any.lixample: Entities:I. BUS2 f ickpt t3. PassengdrI'RIMARY KEY ATTRIBUTF*:

I . 'ficker ID ('ticker Entiry)2. Pas.sport lD (passenger Entity)

Apart from the above mentioned entities you can identify more. The above mentioned are few.

Week2: Concept design with E-R Modell{elate the entities appropriately. Apply cardinalities for each relationship. Identify strong entities and weakt'ntities(ifany)- Indicatethetypeof16lationships(total/partigl).lrytoincorporategeneralization,aggrcgation,specialization etc wherevcr rcquired.

42

Example: E-r diagram for bus

M. Tcch. (COS{IIUTER SCIENCIi & EN(JtNHtiRlN(;r

Week3: Relational Model i-Represent all the entities (Strong' weak) in tabular fashion.Represent relationships in a tabular fashion..l.hercare different ways of representing relationships as tables based on the cardinality. Represent attributes ascolumns in tables or as tables based on the requirement. Different types of attributes (Composite, Multivalued.and Derived) have different way of representation. :

Example: The passenger tables look as below. This is an example. you can add more attributes based on yourE-R model.

Passenger

Name Age Sex Address Passport ID

lVeek4: NormalizationDatabase normalization is a technique for designing relational database tabtes to minimize dup!ication of infor-mation and, in so doing, to safeguard the database against certain types of logical or structural problenis, namelydata anomalies. For example, when muttiple instances of a given piece of information occur in a tablc, thcpossibility exists that these instances will not be kept consisteniwhen the data within the table is update<I, leadingto a loss of data integrity. A table that is sufficiently normalized is less vulnerable to problems of this kind.because its structure reflects the basic assumptions for when multiple instances of the same iirformation shoullbe represented by a single instance only.

weekS: Installation of Mysqr and practicing DDL commandsInstallation of MySql. In this week you will learn creating databases,I{ow to create tables, altering thedatabase, dropping tables and databases If not required. You will also try truncate, rename commands etc.

Example for creation of a table.CREAI'E IABLE Passenger (

Passport id INII:GER PRIMARY KEYName CIIAR (50) NUII,Age Integer,Sex Char

I

);

I

M. Tech. (COMPUTER scIENcE & ENGINEERTNG)

. Note: Detailed creation of tables is given at the.end.Week6: Practicing DML commandsI)ML commands are u.r"d ,: for managing.data within sche;na objects. some exampres:? SELECI'- rerrieve dara from ttre a lati'base? INSERT - insert data into a table

J LTPDAIE - updates existtrg data within a table

? DELETE - deretes arr records from a tabre, the space for the records remain

lnserting vGh,+s into Bus table:Insert into Bus values (ll34,,hyderabad,, .tirupathi,);lnsert into B us va I ues (23 4 5,, hy derabd,,, Bangl ore, ) ;

tnserting values into Bus table:Insert into Passenger values ( l, 45,'ramesh,, 45,,M,, ,abcl23,);fnser{ into Passenger values (2, Zg,'geetha,, rc,;p1,, o}yji1.[l)l'

Fcw more Examplm of DML commands:

:S:l::l:jrom Bus; (setects ail rhe attriUuies and disptay)UPDATII BUS SL-I Bus No = I WHERE BUS NO=2;

43

Week7: Qucrying

l;.'$;J',T|ISi:f;tffiil3;ti:ffi;ffi:1"t:'"ng with sub queries) usingANy ArL, rN, Exists, No.r.

Practice the following eueries:! Display uniqucpNR_no of allpassengers.

?. Display all the names of male purr"ng".r.3' Dispray the ticket numbers oni nur", of at the passengers.4' Dispray the'source and destination having journey time more than r0 hours.5' Find the ticket numbers o{ the passengers whose name start with .A, and ends with .II,.6' Find the names of passenge., *hor" age is between 30 and 45.

7 Display all the pur*"ng"rr names beginning with .A ' <'ru +J.

I Display the somed list of passengers names9' Dispray the Bus numbersihat rra'vet on sunday and wednesdayto :;t*

the details of passengers who u." ouu"rinf ;il". inAC or NON-AC(using onty IN opera_lVcekS and weetg: euerying (continued...)

;i.tffi f,1:il1, ffi H', H:fi:n;f fffi; :;':,'ff$::' (couNr', s rr M, AVG and MAx and MrN),

ilH8[ t$:iil::?tisplav the Information present in the passenger and canceilation tabres. ninh use

? write a Query to display different travelling options available in British Airways.I Display rhe number of days in a week on which the 9w0r bus is avairabre.

;,ilIrl:tber of tickets booked ro,

"uor, pNR-no using cRoup By CLAUSE. Hint: use GRoup By on

? Find the distinct pNR numbers tha[ are present. ?

:,{;1lrji:;.'#il;i1"ff111i,",$3 :;1.*r::$ where rhe'number orsears is srearer than r Hint: use

44 M. Tech. (COMPUTER SCIENCE & ENGINEERING)

? Iiind thc total number of cancelled seats.

? Write a Query to count the number of tickets for the buses, which travelled after the date'l4l3l20fr9'.Ilint: Use IIAVING CLAUS$.

Weekl0: TriggersIn this week you are going to{vork on ltiggers. Creation of insert trigger, delete trigger, update trigger. P-ractice

triggers using the above database.

Eg: CREATE TRIGGER updcheck BEFORE UPDATE ON passenger tFOR EACII ROWBEGINIF NEW.TickentNO > 60 TIIEN

SET New.Tickent no = Ticket no;ELSE

SET New.Ticketno = 0;IF;

Weekll: ProceduresIn this session you are going to learn Creation of stored procedure, Execution of procedure and modification ofprocedure. Practice procedures using the above database.

Eg:CREATE PROCEDURE myProcoBEGINSELBCT COUNT(Tickets) FROM Ticket WHERE age>=40;

End;

Weekl2: CursorsIn this week you need to do the following: Declare a cursor that defines a result set.

Open the cursorto establish the result set. Fetch the data into local variables as needed from the cursor, one row

at a time. Close the cursor when done

CREATE PROCEDURE myProc(in-customer*id INT)BEGINDECLARE v-id INT;DECLARE Y-name VARCHAR(30);DECLARE cl CURSOR FOR SELECT stdld,stdFirstname FROM students WHERE

std ld=i n_custome r-id IOPEN cl;FETCH cl into v id, v-namelClose cl;END; /

'Tables

BUSBus No: Varchar: PkSource : VarcharDestination: Varchar

ENDEND;

M, Tech. (COMPUTaR scIENcE & ENGINEERING)

PassengerPNR_No:Numeric(9):pK'Iicket*No: Numeric (9)Name: Varchar(15)Age : int (4)Sex:Char(I0) : Mate / Female ,,PPNO: Varchar(15)

ReservationPNR_No: Numeric(9): FKJourney_date : datetime(g)No_of_seats : int (g)

. Address : Varchar (50)contact-No: Numeric (9) -> should not be less than 9 and Should not accept any other character other thanIntegerStatus: Char (2) : yes / No

Cancellationl'NR_No: Numeric(9) : FKJourney_date : datetime(g)No_of_seats : int (g)Address : Varehar (50)contact-No: Numeric (9)

-> shoulci not be less than 9 and shoutd not accept any other character other thanIntegerStatus: Char (2) : yes / No

TicketIicket_No: Numeric (9): pKJourney_date : datetime(g)Age : int (4)Sex:Char( I0) : Male / F.emaleSource : VarcharDestination: VarcharI)ep_time : Varchar

ii)COMPILER.consider the following mini Language, a simpl6. procedural high-level llngyage, only operating on integerilfi#i,i,ifJffiiffiT;-#:Hfljf a simpri c crossed *iir, po,"ur. in"-,yn,u* oi,r," ron'guag" is-

<prograrn> ::=<block><blocb ::= { <variabledefinition> <slisD }[{ <stis> }<variabledefinition> ::= int <vardeflisD ;<vardeflisD ::= <vardec> | <vardec> , <vardeflist><vardec> ::= <identifie> lcidentifieD [ <constanD

J<slis> ::= <statemen> l<statemen> : islis><statemenb ::= <assignmenb

| <ifstatement> | <whilestatement>

lcblocb f cprintstatement 1..*ptyJ -

?<assignmenD ::= <identifieD = 4s;pression>f <identifie> [ <expressionr ] =."*p."..ion, I t

45

46 M. Tcrch. (COI\|P{.ITER SCIENCIi' & ENGINEERING)

<ifstatemen> ::! if <bexpression> then <slis> else <slis> endif

Iif <bexpression> then <slis> endif

<whilestatenrcnt> ::= while <bexpression> do <slis> enddo

<printstatemenp ;;= print ( <expression> ) , ,

<Lxpression> ::= <exPression> <addingop> <term> lcerm> lcaddingop> <term>

<beipression> ::= <expression> <relop> <expression>

<relop> t,=. l.= l== l>= I t I t= j

<addingop> ::= + l-.t"r*i,,=.term> <muttop> <factor> | <facto><multoP>::= * l/<factop::=<constant> lcidentifieD l<identifieo [ <expression>] {| ( <expressioo )<constanD ;;= <digiD lcdigi> <constant>

<identifiep ::= <identifier> detterordigi> | <letter>

<letterordigi> ::= <letter> | <digi><letter> ::= albbldlelfleltrlitilklllmlnlolplqlrfslt[ulvlwlxlv[z '<digi> : := ol t l2Fl4l51617l8le<empty> has the obvious meaning

Comments (zero or more characiers enclosed between the standard C/Java-style comment brackets /*...*/) can be inserted. The language has rudimentary support for l-dimensional arrays. The declaration

int a[3] declares an array of ttriee eternents, referenced as a[OJ, allJ and a[2J' Note also that you should

worry about the scoPing of names'

A simple program written in this language is:

{ int a[3],tl,t2;tl=2;a[0]=1 ; a[ I ]=2; a[tll=];P=-(a[2]+tl *6/(a[2]-t I ) ;

if t2>5 thenprint(t2);else {ir' :i;

:...r:.));

t2=-25:print(+l+t2*t3); lx this is acommenton 2lines */

) endif Ii. nesign a lrxical analyzer for the above language. The lexical analyzer should ignore redundant spaces, tabs

and newlines. It should also ignore comments. Although the syntax specification states that identifiers can be

arbitrarily long, you may restrict thelength to some reasonable value.

2.Implement the lixical analyzer using JI-ex, flex or lex or other lexical analyzer generating tools'

3. Design Predictive parser for the given language

4. Desiln LALR botiom up parser for the a\ove language'

5. Convert the BNF rules into Yacc form and write code to generate abstract syntax tree'f,. \-ullvglL tllg lrl\L'lulsJ lrllv l4w tvr'r'

6. Write program to generate machine code from the abstract syntax tree generated by the parser. The followinS j

instruction set may be considered as target cdde.

1i:i:li;Tfi;iTffi':Hffi::#:fffi*H supporting a rorat or 17 instructions. It has three distincti) --^^1^.^-^..^^J L,, rk^ i-,ti.,irhral incfnrntions ns de.taile-rl helow thei

" "-Q --

internal storage areas. The first is the set of 8 registers, used by the individual instructions as detaileg betow:::l:

.#il';;T;;;; r*;;;;;;;;;tdl"' uno ,t'" *riro is an area used for the storase of prbgram' 'rhei!rSeCOnd iS an afea USed fOf the Stgfage OI Vaflables an(l tne lnlrq l$ all alca u]cu rur u_rv Drvto6v vr vrv6rs'r' r "vi

instructions can be preceded by a tabel.'this consists of an integer in the range I to 9999 and the label is followedli

!

:

:

!\.t.'ftch. (COMPUIER SCIIINCTi & ENGTNEERING)

by a colon to separate it from the rest of the instruction. The numerical label can be used as the argument to ajump instruction, as detailed below. ln the description of the individual instructions below, instruction argumenttypes are specified as follows :

lfoin., a register in the form R0, Rl, R2, R3, R4, R5, R6 or R7 (or rO, rl, etc.).Lspecifies a numerical label (in the range I to 9999).vspecifies a "variable location" (a variable number, or a variable location pointed to by a register - see below).Aspecifies a constant value, a variable location, a register or a variable location pointed to by a register (an indirectaddress). Constant valui:s are specified as an integer value, optionally preceded by a minus sign, preceded by a# symbol: An indirect address is specified by an @ followed by a register.So, for example, an A.type argument could have the form 4 (variable number 4), #4 (the constant value 4), 14(register 4)or @r4 (the contents of register 4 identifies the variable location to be accessed).'l'he instruction set is defined as follows:LOAD A,Rloads the integer value specified by A into register R.sroRE R,vstores the value in register R to variable V.OUT Routputs the value in register R.NEG Rncgates the value in register R.ADD A,Radds the value specified by A to register R, leaving the result in register R.sult A,Rsubtracts the value specified by A from register R, leaving the result in register R.MUL A,Rmultiplies the value specified byA by register R, leaving the result in register R.DIV A,Rdivides register R by the value specified by A, leaving the result in register R.JMP Lcauses an unconditionaljump to the instruction with the labelL.JEQ R,L

J7

jumps to the instruction with the label L if the value in register R is zerb.JNE R,Ljumps to the instruction with the label L if the value in register R is not zero.JGE R,L

rjumps to the instruction with the label I- if the value in register R is greater than or equal to zero..lGT R,Ljumps to the instruction with the label L if the value in register R is grearer than zero.JI,E R,Ljumps to the instruction with the label L if the value in register R is less than or equal to zero..ILT R,Ljumps to the instruction with the label I. if the value in register R is less than zero.NOPis an instruction with no effect. It can be tagged by a label. ?

STOPstops execution of the machine. All programs should terminate by exqcutinga STOp instruction.