SUBJECT NO-CS60003, SUBJECT NAME- HIGH PERFORMANCE COMPUTER ARCHITECTURE LTP- 4-0-0,CRD- 4 SYLLABUS :Introduction: review of basic computer

architecture, quantitative techniques in computer design, measuring and reporting performance. CISC and RISC processors. Pipelining: Basic concepts, instruction and arithmetic pipeline, data ha ards, control ha ards, and structural ha ards, techniques for handling ha ards. !"ception handling. Pipeline optimi ation techniques. Compiler techniques for improving performance. #ierarchical memor$ technolog$: Inclusion, Coherence and localit$ properties% Cache memor$ organi ations, &echniques for reducing cache misses% 'irtual memor$ organi ation, mapping and management techniques, memor$ replacement policies. Instruction(level parallelism: basic concepts, techniques for increasing I)P, superscalar, super(pipelined and ')I* processor architectures. +rra$ and vector processors. ,ultiprocessor architecture: ta"onom$ of parallel architectures. Centrali ed shared(memor$ architecture: s$nchroni ation, memor$ consistenc$, interconnection networ-s. .istributed shared(memor$ architecture. Cluster computers. /on von /eumann architectures: data flow computers, reduction computer architectures, s$stolic architectures. References 0.1ohn ). #enness$ and .avid +. Patterson, Computer +rchitecture: + 2uantitative +pproach, ,organ 3aufmann. 4.1ohn Paul Shen and ,i--o #. )ipasti, ,odern Processor .esign: 5undamentals of Superscalar Processors, &ata ,c6raw(#ill. 7.,. 1. 5l$nn, Computer +rchitecture: Pipelined and Parallel Processor .esign, /arosa Publishing #ouse. 8.3ai #wang, +dvanced Computer +rchitecture: Parallelism, Scalabilit$, Programmabilit$, ,c6raw(#ill. SUBJECT NO-CS60064, SUBJECT NAME- COMPUTATIONAL GEOMETRY LTP- 3-0-0,CRD- 3 SYLLABUS :Introduction: historical perspective, geometric preliminaries. Conve" hulls algorithms in 4d and 7d, lower bounds. &riangulations: pol$gon triang(ulations, representations, point(set triangulations. 'oronoi diagrams: algorithms, closest pair problems. .ela$ne$ triangulations: algorithms 9divide(and(conquer, flip, incremental:, dualit$ of 'oronoi diagrams, properties 9min(ma" angle:. 6eometric searching: point(location, 4d linear programming with prune and search. 'isibilit$: algorithms for wea- and strong visibilit$, visibilit$ with reflections, art(galler$ problems. +rrangements of lines: 4d arrangements, one theorem, man$(faces comple"it$, algorithms. Sweep techniques: plane sweep for segment intersections, 5ortune s sweep for 'oronoi diagrams, topological sweep for line arrangements. Combinatorial geometr$: #am( sandwich cuts, #ell$ s theorems, -(sets. Rectilinear geometr$: intersection and union of rectangles, rectangle searching. Robust geometric computing. +pplications of computational geometr$. References 0.,ar- de Berg, ;tfried Schwar -opf, ,arc van 3reveld and ,ar- ;vermars, Computational 6eometr$: +lgorithms and +pplications, Springer. 4.5. P. Preparata and ,ichael I. Shamos, Computational 6eometr$: +n Introduction, Springer. 7.1oseph ; Rour-e, Computational 6eometr$ in C, Cambridge <niversit$ Press. 8.)ecture /otes b$ .avid ,ount.

SUBJECT NO-CS60078, SUBJECT NAME- COMPLEX NET OR! THEORY LTP- 3-0-0,CRD- 3 SYLLABUS :;b=ectives Stud$ of the models and behaviors of networ-ed s$stems. !mpirical studies of social, biological, technological and information networ-s. !"ploring the concepts of small world effect, degree distribution, clustering, networ- correlations, random graphs, models of networ- growth, and preferential attachment and d$namical processes ta-ing place on networ-s.Content&$pes of networ-: Social networ-s, Information networ-s, &echnological networ-s, Biological networ-s.Properties of networ-: Small world effect, transitivit$ and clustering, degree distribution, scale free networ-s, ma"imum degree% networ- resilience% mi"ing patterns% degree correlations% communit$ structures% networnavigation.Random 6raphs: Poisson random graphs, generali ed random graphs, the configuration model, power(law degree distribution, directed graph, bipartite graph, degree correlations.,odels of networ- growth: Prices model, Barabasi and +lberts model, other growth models, verte" cop$ing models.Processes ta-ing place on networ-s: Percolation theor$ and networ- resilience, !pidemiological processes.+pplications: Search on networ-s, e"haustive networ- search, guided networ- search, networ- navigation% networ- visuali ation. References 0.S. /. .orogovtsev and 1. 5. 5. ,endes, !volution of /etwor-s, ;"ford <niversit$ Press. 4./arsingh .eo, 6raph &heor$, Prentice #all of India. 7.Current )iterature. SUBJECT NO-CS60086, SUBJECT NAME- SELECT TOPICS IN ALGORITHMS LTP- 3-0-0,CRD- 3 SYLLABUS :&he ob=ective of this course is to familiari e students with some contemporar$ research in the area of algorithm design and anal$sis. &he treatment will be theoretical with emphasis on problem solving and will be primalit$ assignments based. ,odels of computation and efficienc$: Searching faster than ;9log n:, sorting faster than ;9n log n:. Randomi ed algorithms in graphs and geometr$: &he impact of using randomi ation for designing algorithms that are simpler and often more efficient than the deterministic counterparts for several fundamental problems li-e ,S&, mincuts, spanners, conve" hulls, triangulations, etc. &$picall$ anal$sis is often harder than design. +ppro"imation algorithms: + set of rapidl$ evolving techniques that lead to provable appro"imation guarantees for hard optimi ation problems within pol$nomial running times. <nli-e other communities dealing with the same problems the emphasis here is on provabilit$ of general instances and goes hand(in(hand with the >hardness of appro"imation> theor$. !ach of the topics on their own could be easil$ a full semester course, so depending on the class response, we ma$ pic- and choose from the above list of topics. SUBJECT NO-CS60088, SUBJECT NAME- FOUNDATIONS OF CRYPTOGRAPHY LTP- 3-"-0,CRD- 4 SYLLABUS :Introduction to Cr$ptograph$: Basics of S$mmetric 3e$ Cr$ptograph$, Basics of +ss$metric 3e$ Cr$ptograph$, #ardness of 5unctions /otions of Semantic Securit$ 9SS: and ,essage Indistinguishabilit$ 9,I:: Proof of !quivalence of SS and ,I, #ard Core Predicate, &rap(door permutation, 6oldwasser(,icali !ncr$ption 6oldreich()evin &heorem: Relation between #ardcore Predicates and &rap(door permutations 5ormal /otions of +ttac-s: +ttac-s under ,essage Indistinguishabilit$: Chosen Plainte"t +ttac-9I/.(CP+:, Chosen Cipherte"t +ttac-s 9I/.(CC+0 and I/.(CC+4:, +ttac-s under ,essage /on(malleabilit$: /,(CP+ and /,(CC+4, Inter(relations among the attac- model

Random ;racles: Provable Securit$ and as$mmetric cr$ptograph$, hash functions ;ne(wa$ functions: *ea- and Strong one wa$ functions Pseudo(random 6enerators 9PR6:: Blum( ,icali(?ao Construction, Construction of more powerful PR6, Relation between ;ne(wa$ functions and PR6, Pseudo(random 5unctions 9PR5: Building a Pseudorandom Permutation: &he )ub$ Rac-off Construction: 5ormal .efinition, +pplication of the )ub$ Rac-off Construction to the construction of Bloc- Ciphers, &he .!S in the light of )ub$ Rac-off Construction )eft or Right Securit$ 9);R: ,essage +uthentication Codes 9,+Cs:: 5ormal .efinition of *ea- and Strong ,+Cs, <sing a PR5 as a ,+C, 'ariable length ,+C Public 3e$ Signature Schemes: 5ormal .efinitions, Signing and 'erification, 5ormal Proofs of Securit$ of 5ull .omain #ashing +ssumptions for Public 3e$ Signature Schemes: ;ne wa$ functions Impl$ Secure ;ne(time Signatures Shamirs Secret Sharing Scheme 5ormall$ +nal$ ing Cr$ptographic Protocols @ero 3nowledge Proofs and Protocols References 0. #ans .elfs and #elmut 3nebl, Introduction to Cr$ptograph$: Principles and +pplications, Springer 'erlag. 4. *enbo ,ao, ,odern Cr$ptograph$, &heor$ and Practice, Pearson !ducation 9)ow Priced !dition: 7. Shaffi 6oldwasser and ,ihir Bellare, )ecture /otes on Cr$ptograph$, +vailable at http:AAciteseer".ist.psu.eduA. 8. ;ded 6oldreich, 5oundations of Cr$ptograph$, CRC Press 9)ow Priced !dition +vailable:, Part 0 and Part 4 SUBJECT NO-CS600#4, SUBJECT NAME- C$%&'()(*$+), N'%-./ T0.$/1 LTP- 3-0-0,CRD- 3 SYLLABUS :+lgorithms for integer arithmetic: .ivisibilit$, gcd, modular arithmetic, modular e"ponentiation, ,ontgomer$ arithmetic, congruence, Chinese remainder theorem, #ensel lifting, orders and primitive roots, quadratic residues, integer and modular square roots, prime number theorem, continued fractions and rational appro"imations. Representation of finite fields: Prime and e"tension fields, representation of e"tension fields, pol$nomial basis, primitive elements, normal basis, optimal normal basis, irreducible pol$nomials. +lgorithms for pol$nomials: Root(finding and factori ation, )enstra()enstra( )ovas algorithm, pol$nomials over finite fields. !lliptic curves: &he elliptic curve group, elliptic curves over finite fields, Schoof s point counting algorithm. Primalit$ testing algorithms: 5ermat test, ,iller(Rabin test, Solova$(Strassen test, +3S test. Integer factoring algorithms: &rial division, Pollard rho method, p(0 method, C5R+C method, quadratic sieve method, elliptic curve method. Computing discrete logarithms over finite fields: Bab$(step( giant( step method, Pollard rho method, Pohlig(#ellman method, inde" calculus methods, linear sieve method, Coppersmith s algorithm. +pplications: +lgebraic coding theor$, cr$ptograph$. References 0.'ictor Shoup, + Computational Introduction to /umber &heor$ and +lgebra, Cambridge <niversit$ Press. 4.,aurice ,ignotte, ,athematics for Computer +lgebra, Springer('erlag. 7.Ivan /iven, #erbert S. @uc-erman and #. ). ,ontgomer$, +n Introduction to the &heor$ of /umbers, 1ohn *ile$. 8.1oachim von ur 6athen and 1uergen 6erhard, ,odern Computer +lgebra, Cambridge <niversit$ Press. B.Rudolf )idl and #arald /iederreiter, Introduction to 5inite 5ields and their +pplications, Cambridge <niversit$ Press. C.+lfred 1. ,ene es, editor, +pplications of 5inite 5ields, 3luwer +cademic Publishers. D.1oseph #. Silverman and 1ohn &ate, Rational Points on !lliptic Curves, Springer International !dition. E... R. #an-erson, +. 1. ,ene es and S. +. 'anstone, 6uide to !lliptic Curve Cr$ptograph$, Springer('erlag. F.+. .as and C. !. 'eni ,adhavan, Public(-e$ Cr$ptograph$: &heor$ and practice, Pearson !ducation +sia. 0G.#enri Cohen, + Course in Computational +lgebraic /umber &heor$, Springer('erlag.

SUBJECT NO-CS60028, SUBJECT NAME- FAULT TOLERANT SYSTEMS LTP- 3-0-0,CRD- 3 SYLLABUS :5undamental concepts in the theor$ of reliable computer s$stems design. Introduction to redundanc$ theor$, limit theorems% decision theor$ in redundant s$stems. #ardware fault tolerance, redundanc$ techniques, detection of faults, replication and compression techniques, self(repairing techniques, concentrated and distributed voters, models of fault tolerant computing s$stems. Case studies. Software fault tolerance: fault tolerance versus fault intolerance, errors and their management strategies. Implementation techniques: software defense, protective redundanc$, architectural support. 5ault recover$ techniques. Coding theor$: application to fault tolerant s$stem design. 5ault( tolerance and reliabilit$ of multicomputer networ-s 9direct and indirect: including fault(tolerant routing and sparing techniques. ?ield and reliabilit$ enhancement techniques for ')SIA*SI arra$ processors. SUBJECT NO-CS60032, SUBJECT NAME- DATABASE ENGINEERING LTP- 3-0-0,CRD- 3 SYLLABUS :Relational Databases: Integrity Constraints revisited: Functional, Multi-valued and Join Dependency, Template Algebraic, Inclusion and enerali!ed Functional Dependency, C"ase Algorit"ms and #ynt"esis o$ Relational #c"emes% &uery 'rocessing and (ptimi!ation: )valuation o$ Relational (perations, Trans$ormation o$ Relational )*pressions, Inde*ing and &uery (ptimi!ation, +imitations o$ Relational Data Model, ,ull -alues and 'artial In$ormation% Deductive Databases: Datalog and Recursion, )valuation o$ Datalog program, Recursive .ueries /it" negation% (b0ected (riented and (b0ect Relationa Databases: Modeling Comple* Data #emantics, #peciali!ation, enerali!ation, Aggregation and Association, (b0ects, (b0ect Identity, ).uality and (b0ect Re$erence, Arc"itecture o$ (b0ect (riented and (b0ect Relational Databases% Case #tudies: emstone, (1, (b0ect #tore, #&+2, (racle **i, D31% 'arallel and Distributed Databases: Distributed Data #torage: Fragmentation and Replication, +ocation and Fragment Transparency, Distributed &uery 'rocessing and (ptimi!ation, Distributed Transaction Modeling and Concurrency Control, Distributed Deadloc4, Commit 'rotocols, Design o$ 'arallel Databases, 'arallel &uery )valuation% Advanced Transaction 'rocessing: ,ested and Multilevel Transactions, Compensating Transactions and #aga, +ong Duration Transactions, 5ea4 +evels o$ Consistency, Transaction 5or4 Flo/s, Transaction 'rocessing Monitors% Active Databases: Triggers in #&+, )vent Constraint and Action: )CA Rules, &uery 'rocessing and Concurrency Control, Compensation and Databases Recovery% Real Time Databases: Temporal Constraints: #o$t and 6ard Constraints, Transaction #c"eduling and Concurrency Control% Image and Multimedia Databases: Modeling and #torage o$ Image and Multimedia Data, Data #tructures R-tree, 4-d tree, &uadtrees, Content 3ased Retrieval: Color 6istograms, Te*tures etc, Image Features, #patial and Topological Relations"ips, Multimedia Data Formats, -ideo Data Model, Audio and 6and/ritten Data, eograp"ic In$ormation #ystems 7 I#8% 5)3 Databases: Accessing Databases t"roug" 5)3, 5)3 #ervers, 9M+ Databases, commercial #ystems: (racle **i, D31% Data Mining: :no/ledge Representation ;sing Rules, Association and Classi$ication Rules, #e.uential 'atterns, Algorit"ms $or Rule Accessing% Re$erences <%Abra"am #ilbersc"at!, 6enry :ort", and #% #udars"an, Database #ystem Concepts, Mc ra/-6ill%1%Rag"u Rama4ris"nan, Database Management #ystems, 5C3=Mc ra/-6ill% 2%3ipin Desai, An Introduction to Database #ystems, algotia% >%J% D% ;llman, 'rinciples o$ Database #ystems, algotia% ?%R% )lmasri and #% ,avat"e, Fundamentals o$ Database #ystems@, Addison-5esley% A%#erge Abiteboul, Ric"ard 6ull and -ictor -ianu, Foundations o$ Databases% Addison5esley%

SUBJECT NO-IT60"08, SUBJECT NAME: S$3( C$%&'(*+4 A&&,*5)(*$+6 SYLLABUS :0.Introduction to Soft Computing, Components of Soft Computing, Importance of Soft Computing 4.5u $ Set &heor$ ( .efinition, .ifferent t$pes of fu $ set ,embership 5unctions 7.5u $ Set theoretic operations, 5u $ Rules and 5u $ Reasoning, 5u $ Inference S$stems 8.6+, Simulated +nnealing, PS; B./eural /etwor-s( Supervised )earning, <nsupervised )earning C.#$brid S$stems ( /euro 5u $ ,odeling D.5u $ c(means, +pplications in Image Processing, /euro(fu $ control, .ata ,ining Re$erences: /euro 5u $ and Soft Computing ( 1ang, Sun and ,i utani +n Introduction to /eural /etwor-s ( #a$-in 5u $ Sets and 5u $ )ogic ( 3lir and ?uan 6enetic +lgorithms ( 6oldberg