0::;"- •••.

/iIII-r (., Regular M_Tech. in Computer Science & Engineering and lnformation-'

Technology First Semester Course

CS/IT 11 Foundations of Computer Sci erice. Section A: Discrete Mathematical StructUI:·es

1511[sAlgebraic Structures:Semigroups, Monoids, Groups, SubstTuctures and Morphisrns. Rings, Fields, Lattices,distributive, modular and complemented lattice, Boolean Algebras.

Forma I Logics:-Proposili(ma!:-10~ic Predicate logic; limitations of predicate <logic, universal andexistential quantification: modus ponens and .modustollens. Proof techniqyes: Notionsof implication. converse, inverse, contrupositivc.-ncgations and contradiction.

Introduction LoCCJ.unling:Hasic counting techniques, principles of inclusion .arid exclusion, permutations,combiuatiuns. summations, probability, Rec(lrrenC~ Relations. Generating Functions.

Introduction to Graph:Craphs and their basic properties, Eulerian and. Hamiltonian 'walk, graph culouring,planar graph, enumeration, vector graph.

Books and References:• Kenneth Rosen, Discrete Mathematics and its applications, TMH• C.L.Liu, Elements of Discrete mathematics, TMH• D.B.West, Introduction to Graph Theory, PHI• l.P.Trembley and KManohar, Discrete Mathematical Structures with

Applications to computer science, TMH

Section 13: Data Structures and Algorithms15lns

Ale,Oli:jp.Jl .uul Complexity, Notutions of complexity. SurLinlj and Divide lInd C()n'-ll!~'rStrategy: Merge-Sort, Quick Sorl with averae,e case analysis. Heaps and heap sort.Lower bound on comparison-based sorting.i·Advanced search Structures: Representation, Insertion and Deletion operations on I~('d-mack trees, 13-Trees, Hashing.

Dynamic programming, matrix multiplications, longest cornmon subsequence, Greedymethod, Knapsack Problem, B qllcen Problem. Backtrncking. branch and bou nd,Fibonacci Heap

Graph Algorithms:Grarh~i and their represenlations. I3FS, DFS, Minimum spLll1ninj; trees, ~;ll()rlcst pi1ths,l(ru"ka I and Pri m' s algori th ms. Connected cornpollcn ts

Bool:« and [~c!t'/,(~/lct's.:

COrCIIICI/, Lciscrsou and Riucsi, Algorifltllls, MIT Press.E. Hunnuitltz IIlId 5.5111I11i. Fiuukuucntals O{GJlllplltcr /\lsoritl11l1, Calxofitl

• OOl/tlld Knuth: Tlte Art a/ConTputer Progmlllllllfli; s: Vol. i alld.3, Pearson

~.

UPTU Regular M.Tech. ill Computer Science 8:. Engineering and Information.'Technology First Semester Course

• V.AIIO, J.E.HoperoJl and f.D.Ullmail Design and /lIInlysis oj Computer AIgoriUIIII,Addisiou WesleyK.Mcllwrn. Data Structures and Algorithms VallI, Springer Verlag•

Section C: Theory of Computation15 Ius

Regular languages:Alphabet., Languages and grammars. Regular grammars, regular expressions and finite: ...automata, deterministic and nondeterministic. Closure and decision properties of ;regular sets. Pumping lemma of regular set's. Minirnizafion of finite automata.

Context free Languages:Context free gramm(lrs and pushdown automata. Chomsky and Griebach norma) forms.Cook, younger and Kasami Algorithm, Ambiguity and properties of context freelanguages pumping lemma. Deterministic pushdown automata. Closure properties ofdeterministic context free languages.

Turing Machine:Turing machines and variation of Turing machine model, Halting problem, Universalturing machine, Type 0 Languages. Linear bounded automata and context sensitive,languages. Turing Computable functions, Church Turing hypothesis. Recursive andrecursively enumerable sets, Universal Turing machine and undecidable problems,Rice's theorems for RE sets, Undecidablity of Post correspondence problem. Valid andinvalid computations of Turing machines, undecidable properties of context freebllgll<1~e problems, Basics of Recursive function theory.

Books and References:• C.Papadimitrou and C.t..Lewis. Elements of Theory of Computation, PHI• j.E.Hopcroft and J.D.Ulltn<1n. Introduction to Automata Theory, Languages of

Computations, Addison-Wesley

' .

. "

",

~:

~':

==:/ -~

/~

, .' h .C~('<'r~~~-"-'~~'"". PTU Regular M.Tech. in Computer Science & Engineering and Information Tecl~hl(ogy~F;irst .

Semester Course .

CS/iT 12 Computer OrganiL'ltion &Architccturc

Computer OrganizationUnit:l 10 hrs

•

Basic Computer Orgnniration and design: Instruction set Principles: ClassifyingInstruction .Set Architectures, Memory Addressing, Type and size of operands,Operations in the instruction set; Instruction Codes, Computer Register, Register TransferLanguage, Time and Control, Instruction Cycle, Memory reference instructions, Input-Output and Interrupt. Design of Basic Computer and Arithmetic and Logic Unit.Micro programmed Control: Control Memory, Address Sequencing, Design of controlunit.Central Processing Unit: General Register Organization, Stack Organization, InstructionFormats, Data Transfer and Manipulations program control.

•

Ullit:2 8 hrs• Computer Arithmetic: Addition, Subtraction, Multiplication and Division algorithms .

.: '.Floating-point arithmetic operations, IEEE 754, Decimal arithmetic unit and DecimalArithmetic operations.

Unit:3 10 hrse Input- Output Organization: Peripheral Devices, Input-Output Interface, Asynchronous

data transfer, Modes & transfer," priority interrupt, Direct Memory ,Access,' 'I/OPerformance Measures, Benchmarks of Storage Performance and Availability. .

• Memory Organization: Memory Hierarchy, Main Memory, Auxiliary Memory,Associative Memory, Shared Cache Memory...··· . ~.

Cache Memory and its performance, Reducing Cache Miss Penalty, Reducing MissRate, Reducing Cache Miss Penalty or Miss Rate via Parallelism, Reducjrig Hit Time,Virtual Memory. ' . ,,'

Computer Architecture.Unit: 4 10 hrs

• Principles of Scalable Performance: Performance metric and .measures, speedupperformance laws, scalability· analysis and approaches. Parallel processing andapplication.

• Advanced Processor Technology: Design space' of processors,' Instruction set .architectures, CISC, RISe.

• Pipelining: Linear and nonlinear pipeline processors, Instruction pipeline design,arithmetic pipeline design, super scalar and super pipelinedesign, Superscalar and Vectorprocessors

UnitrS 7 'iirs• Multiprocessor System Interconnects, Cache coherence and synchronization mechanisms,

message passing mechanism.• System Interconnect architecture: Network property and routing, static connection

networks and dynamic connection networks

Refdrellces:j

,j

~'J,

Lj-i:~i 'Yo

, .

'.--~

,

'UPTU Regular M.Tech. in Computer Science & Engineering and Information TechnologytSemester Course ..

• Mano M : Computer System Architecture - 3rd Ed. (PHI) .• Hennessy J L, Patterson D A: Computer Architecture: A Quantitative Approach - 3

rdEd."

(Elsevier)• Kai Hwang: Advanced Computer Architecture (TMH)• Hamacher V C, et al : Computer Organization - 4th Ed.(McGraw-Hill)

; '-...i .

. /

UPTU Regular M.Tech. in Computer Science & Engineering and InformationTechnology First Semester Course

CS/lT 13 Opernting Systems and Database Management Systems10 hrs

Unit-lOperating System: Structure, Components and Services. Time Sharing and Real Time System,Process Management, Concurrency Critical Section, Semaphores, Inter Process Communication,Process scheduling producer/consumer and reader writer problem. Concept of Distributed andReal-Time operating systems.

8 hrsUnit-2.CPU Scheduling: Concept and scheduling algorithm, multiprocessor scheduling, deadlock:prevention, avoidance and detection, recovery from deadlock.

Memory Management: Multiprogramming with fixed partition, multiprogramming with variablepartition, segmentation, virtual memory and demand paging. Page Replacement Policies-Thrashing and pre-paging

10 hrsUnit-31/0 Management, File System: File organization and access mechanism, file sharing and filedirectories, Case Study of Linux Kernel: - File Management, Memory Management and ProcessManagement

10 hrsUnit-4Overview of Database Management System, Data Models: - Relational Algebra, RelationalCalculus- Tuple.Relation Calculus and Domain Relation Calculus, Normal Forms

SQL, DOL, DCL, DML, PLlSQL7 hrs

Unit-5Deadlock: - Prevention and avoidance, Transaction and Data Recovery Methods. Introduction ofObject Oriented DBMS, Object Relational DBMS, Distributed DBMS and Data Mining.&Warehousing.

Refercnces:A.S. Tanenbaum: Modern operatingsystems, Prentice Hall, 1993.William Stalling: "Operating System" Maxwell Me MellonJ. Peterson, A. Silbcrschatz, and P. Galvin: Operating System Concepts, Addison Wesley, JrdEdition, 1989. .Milenkovic: Operating System Concepts, TMHKorth and Silberschatz: Database System Concepts, Second Edition, Tata McGraw Hill, 1991.S. Ceri and G. Pelaggati: Distributed Databases Principles and Systems, McGraw Hill, 1985.R. Elmasri and S. Navathe: Benjamin Cummings, Fundamentals of Database Systems, SecondEdition, 19~4. .Boveti et al : Understanding the Linux KernelJ,d Edition, O'ReillyC. J. Date: Database Management Systems.

UPTU Regular M.Tech. in Computer Science & Engineering and Information. Technology First Semester Course

CS/IT 14 Data Networks

Unit I: Overview of Wired and Wireless Data Networks 8 hrs

Review of Layered Network Architecture, ISO-OSI and TCP / IP Network ModelDatagram Networks and Virtual Circuit Networks .Point to Point and Point to Multipoint NetworksLayer 2 SwitchesIEEE 802.3u (Fast Ethernet) and IEEE 802.3z (Gigabit Ethernet)Virtual LANWireless LAN: IEEE 802.11, BluetoothBroadband Wireless LAN: 802.16, WIMAX

Unit II: Interrietwork ing 10 hrs

Review of IP Addressing and RoutingInternet Architecture: Layer 3 Switch, Edge Router and Core RouterOverview of Control Plane, Data Plane, Management PlaneInternet Routing Protocols: OSPF, BGPBroadcast and Multicast Routing: Flooding, Reverse Path Forwarding, Pruning,Core based Trees, PIMMobilitu Issues and Mobile IPAd hoc Routing: Dynamic Source Routing, Destination Sequenced DistanceVector Routing, Ad hoc On-Demand Distance Vector Routing, Fisheye StateRouting, Hierarchical Routing.Signalling: Introduction, ICMP, LDP and MPLS Architecture

Unit III: Transport Layer Protocols / 7 hrs

Process to Process DeliveryReview of UDP, TCPSCTP Protocol: Services, Features, Packet Format, Association, Error ControlWireless TCP and RTP, RTCPReal Time Ap plica.tion: Voice and Video over IP

/

;,j.

UPTU Regular M.Tech. in Computer Science & Engineering and InformationTechnology First Semester Course

Unit IV: Traffic Control and Quality of Service 12 hrs

Flow Controli Flow Model, Open Loop: Rate Control, LBAP, Closed Loop:Window scheme, TCP and SCTP Flow Control

Congestion . Control: Congestion Control in packetECN and RED Algoritlun, TCP and SCTP Congestion Control

networks,

Qualittj of Service: IP Traffic Models, Classes, and Subclasses,Scheduling: CPS, WRR, DRR, WFQ, PCPS, VC Algorithm: Integrated ServicesArchitecture, Differentiated Services Architecture, RSVP and RSVP-TE

Traffic Management Framework: Scheduling, Renegotiation, Signaling,Admission Control, Capacity Planning

Overview of SNMP3, MIB2, RMON2, NMS Architectures

Unit V: Network Security 8 hrs

Security Issues,Symmetric Encryption: DES, TtipleDES, Modes, AESPublic Key Encryption: RS.A,Diffie Hellman, Elliptic CurveHashing: MD5, SHA-l, DSAProtocols: Kerberos, SSL/TLS, IPSec.

j 0 1- :2.1 ~ 11~ '2> 4,

References:

1. Srinivasan Keshav "An Engineering Approach To ComputerNetworking", Pearson

2. W Richard Stevens, "TCP lIP Illustrated" - Vol. 1 , Pearson3. D Bertsekas, R Gallager; "Data Networks", PHI4. W Stallings, "High Speed Networks and Internels", Pearson5. W Stallings, "Wireless Communication and Networks", Pearson6. \'\' Stallings, "Cryptography and Network Security", Pearson7. A Tanenbaum, "Computer Networks", Pl~I

i.: ;

,. • L

1'0 \'.~"~!/IrCI.l/>l<'... - s,,:;;",,-------._-------- -·-5" hjcct -1-'-'X-a)-~-'~-Co-rO-f-r-- ----1-' rC-'-'c-q--'-,i-s1-' (-e-- '-"

/ I' Elective Subject

/ JZf Iji~l,ib"i~,-;!-;:S~'I)}-st~e--I/-IS--(;::t---Jt)--t-;:-ifs~tr-:j~b-~I-tc~d:-C-=--o-Ill-1P-lu-t-jI-Ig__ 'O_h~"-s-~:....:~:....:;:....:~-C_(-11------------- --..... -

<, I-- r r: I Mobile Computing 12 -~-=---------.---.--.._ ..---. --.-:/- Analysis & Design of Real- ---\-3---t--·------------

• ----- -. ...-------- ~i!~~~.x,_s_t_en_l._.,s,._--- --:-.-:-__ -11- _1 ... t-_-'D_e_d:....:i:..:c..:.:a:.:.tc~d=__=S):'slCIl1bcsi.~. 1:--:4,--_+ . _

VLSI Design. 15-----.------------:I-:---:--,--..,.:...;:O::.~ ....::::.::::::..:~-'-----:--l---:...:.---+------,---------l1---_.2.' .-' . ..' , /. '.

....,....-h Software EI/~illeerillg;.,,:.t! 'f ,', Engineering and .---. --21 ' .--- ..-"-

f :~---.- -~~-- ··.·~~~~i~;f!.~~:~1~1!~:·~;~.~~~~:;::~~_.((/_2.~~ -----~~~_-~.~=~~:--- » --.- -_' ',,~ ~_ ~!l~'.Ccrlllg Object Oriented 1 23 001'

____.... .~'if .. Systcllls _ ~_ .__ .. ___ _ .. __.... _. Multimcdia ~~t.ell~_.-, __. ~ __ . .__ .... _.

I' Internet Programniiug and 25__ .__ Wcb Sen;ice E'igil.!.~.!'i!..l.g ._ __.. __

I~!;;f;;;;;;;;f;:;;;;.i);;:;;;;,;~_ ~~~1-1;;d0TI~ ""J-l-·-_-_~'~~~~~~~~~:~~-~--~-~~------f-I-----.----.. /' RcqUlrclllcllts Engl\lcei'lnlL_ 32 ----.L~E:·Tr~S\.SS·~(~cMM.., -~:,_~.__.f--~-.,-,- . __ ' . .>-. ') " Method Enginecring . -._·----=-J-3~~~~-t---T- I.

~~ P E" HT 14 \ ._I~]'SS_. ,/.__.._f- , -!.--.:::. ~ ro<;.css. ·lIglU~r).1h:, . ._.,.-_--'1 ~_ - -,y .-CSi~ltioll and Mo.dding:--- 35· .__.._.~------,

-'" . -;:::>----_._--_._---------------- ------~-----...:....----~------'-- --------1-----'---.--'----- -.-

Data ft11111flgemefl( D~tribtitc(.1 DBMS 41- --------f---------.---- -- ..----..-

~ <, /l)ata Warchousing' • 42---~. --·---------...L-ji------'=--------J---'-·-- ---·---1 --- .-.-------- ---

Multimedia Databases ,1]-------- ----. ---- ----'--------;------/---------t------- -. -------\ ..•.•...1:;"••..------ -- - -- - ~-7"/'-----~------i---.-.--- --.--- --

------!!LL--- 0: 51 -f- .__. . _____ " . . __ .~ Data Minil1~ I. . 52 _I':L.,._ .. u _

______ ... __ r':KIlOwle,dgc BasedSystelll7 S3 1\1 ._._ .. . ..lhtur~'..!.J~~~Jagc Proccssing_ .. ~~. __ . __ ._. ~ . _Iv·

~>c~i·~Algoritlllns . ~ ~. -~ . ~-=-~lIt~omized Algorithms 62----------------I-'---------.J-i..-----+-------f--·---,--- -----.-------

A nprox illlatiOI1 Algorithms 63

1

---. --- .. -- --'---I~ol\lplcxity Theory. ,/ 64 ---t--------.-.--COI~lItational Geolllctr):' 65\ _ --=--~-..-'----:-I--- . '---I------t~--. _-_-_-_-_-:_-_-_~-_-__-_-_-_--_-_--_-

~

-~~eC((ri'l-'----f----~!i'EtOg~~x..~---- 7_1_. ..... _... _.___ Network allll Systcm Securitl. 72 Cryptography.

. . Digital forcnsic 73 .. ~.I?!2.gr~I~ _______ L-~~_-Y-

NOTE: Till: students arc required to select courses from at least three streams.CS students have to select at least one course each from Theoretical ('S '11:1(/ Ir.nuDistributed Svstcms.IT sti.dcnts have to select at least OIlC course C:ICit rr(\l~l ~;,)lh\;\lJ i~IIj',illct:ril1g,

IIlf'ortlt,l(io!1 Systems ,;11<1 I)a!:! t\i<ll1;Jgelllcllt.I ------..---_.

-,

-~ f./~.

Appendix U: Streams and their COUI-SCS .

1. Distt'ibuted Stream

Distributed Computing

Basic Concepts . <::6\I~III'S

Charllctcrization, RCSOlU"C~haring, Internet Implementations, Name ~soilition, D~S . \-r~- ~~Computation: Full ASYI~chronislll and pull Syuchrouism, Computation on Anonymous Systems, Events, Orders, _ .

Global St<1tes,COlllplexlty' ~ _--, -..,. .:

I)is-Irihll led Syncliron iza lion. ,.J /tr 1111111'S

Processes and Threads, IEEE POSI X. Ic

G'Mutual Excl~lsion: CI<1ssifi~ation, Algorithms, 1\~11 Exclusion in S!wrc!l Mel.runy; CI<?ck Synchronization, NT!' (J' 7' ., Distributed 6eadlock: Detection ·Methoc;s, Prevention Methods, AvoidaJl(;c Methods ~\~

I1 usn Sockeb H Hours

~ TCP/II' Model, I3SD Sockets Overview, TCP(SOckcts'and Client/Server, UDP Sockets' and.Clicm/Scrvcr, o:";~~__-1llJ.lIndD~;, [~aw So~ets, PING & TRJ\CEIZOOT.E Programs,Rolitirlg;-Multicasting'using UDP Soc~ets·. ~

.__ .'_' -_. --J- . --

rDistl'ibll~Cd OS -rr~------ < to 1I01ll-s; ~ -~I '. \

! Communication between distributed objects, IU'C Model and Implementation Issues: Sun RI'C, Events and J! Notifica~iolls, Java RMI and its Applications 1· _'. .._i taRIJA Architecturc: In(r~,.ducti()n an(L~atiol~

!Distributed File System De:.ign and C~ Studies: NFS; Coda, Google FS '(

.' '-I:-- - 1

Dislrilmlcd D<1lalJascs : 8 Hours .~/- ~ '\: . \

Introduction, Structure, D.i1ta Mod~ls, Qu~,y I'~)ccssin~, Transactions, Nested Transactions, Atomic. CommitProtocols, 'jtansaction Recovery, 1ransacuons With replicated data, Concurrency Control Methods. Distributed

! Dcadloc~ • ~ ~

I \.../ \ . I

I /i References:

,#0I. Tanenbaum, "Distributed Systems", Pearson2 W Richard Stevens, "UNIX Network Prcgramming Vo'l 1 & 2", Pearson

A:"3illha, "Distributed Operating SystCIl1S", Prentice j lall of India/ IEEE Press~3aruosa, "Distributed Algorithms", MIT Press

5. Ccri, P<1lgalli,"/)istril'uted Databases", McGraw-Ll il l

- .:'

!I

/'

i -~ I

--.------7-...:...---~- ----

(f) .•.,

-Mohile Computing

. 8 Hours

Basic Concepts, Principles or Ccltular Couununication, Overview of IG, 2G, J.5G, 3G. and 4G techl\(1iogi~s, GSMand COMb- Archilecture, Mobility Management, Mobile Devices: PDA, Mobile OS: Palm OS, Mobile L~~Ylllbi<ln. "

Process Mignltion 8 HOllrs

Kernel Support for Migration: Mobility Enhancement ill modern UNIX Systems, Transparent Process MigrationDesign Alternatives, Removing Process Migration Bottlenecks, Task Migration Issues

User Space support for Migration: Chcckpointing, Process Migration

Illlullrs

Workload Balancing Strategies in migration, Process lifetime distributions for dynamic load balancing, DiscouncctcdOpel atit'l\s ill Coda File System, Weak Connectivity for Mobile File Access, Weakly Connected Replicated StorageSystem. .

Mobile Data NctworJdlll! 8 11011rs

\ .Mobile IPv4 and Mobile ll'vG, Mobile lnteructworking Architecture, Internet. Mobility Issues, Route Optimization.Performance of Wireless -ref>, GPRS Services, IP over CDl\I/\

Mobile Agents !! Hours.Basic. Concepts, os support [or Mobile Agents, Java Aglet :'\1'1, AnENT TC)" Network Aware Mobile Programs,Mobile Objects and Agents, OMG MASlr. Framework, Mobile Agent. security Issues -,

/{cfcrences: •

/. Richa!"'dWheeler, "Mobility: Processes, Computers and Agents" () QJ2. Charles Perkins et.al.,"MolJilc II': Design Principles and Practices", PearsonYToll!asz Imielinski, "Mobile Computing", Springer Verlag (9 -'

t. _:'1,1 •• . .

-.:"':": '.

6 Hours

Analysis and Design uf Real-Time. Systems

Basic Conccpts

IEEE Definition of Real-Time Systems, Characterization of Real-Time Systems, Process, IEEE POSIX.k Th.cads,Tasks and Priorities, Pre-emptive and Non-Preemptive Tasks, Soft and Hard Real-Time Syst-, -ns.Scheduling 10 HoJurs

Scheduling Paradigms: Priority Driven, Tillie Driven, and Share Driven

Priority Driven Scheduling of Periodic, Aperiodic and Sporadic tasks

Static Priority Scheduling: Ri.tc Monotonic Scheduling A lgoritlun ,(nd its exact an::\ysis nsiug Response Time Test

Dynamic Priority Scheduling: Analysis ofEDF and LLF Algorithms and their open i:;suL's

spccification and Vcrifie;ltioll i()lIo urx

Modsling Real-Time System, Rcquircn-ent Spcci fication, Assumptions, Design, Basic Duration Calculus,Specification of Scheduling Policies, Probabilist!c Duration Calculus, Applications of Duratir u Calculus

S flours

Introduction, Requirement of Real-Time Guarantees' in industrial applications, Soft anti Hard RTOS, Commcrr.ialRTOS Example-

IEEE POS!A.I b: Priority Schcdul ing, Real-Tunc Signals, Timers, IJ inury Semaphores, Counting Scmaphoi CS •

• I'vlUTEX operations and u:;age. Message I'a~;sing. Message Queues operations and usage, Shared Memory,Synchronous and Asynchronous I/O, Memory Locking

RTOS S.ervices, Case Studies or Real Time Capabilitics or Linux Kernel 2.6, R'TLinux and \x\\!()1 ks

A J1(llica (iolls (,II()II rs .

Real-Time Application Design, Real-Time /\ppliciltioll Interface (RTAI), Real-Time hV<I, Real-TimeConuuunications and Networking

References:

I. JW.S Liu, "Real-Time Systems", Pearson2. Mathai Joseph; "Real-Time Systems: Specification, Verification' and Synthesis", l'rcuticc-l lall3. Qing Li, "Real-Time Concepts lor Embedded Systems", eM!' Books.4. Krishna, Shin, "Real-Time Systems", TMt"15. Burns, Wcllings, "Real-Time Systems and Progranuuing Languages", Pcarsou

, .

(~IUf.

Dcdicated'Systam Dcsig n

8 Hours

. Algorithm and Algorithmic Notation, Timing, ·Synchronization_and Memory, Fixed and Floating point Arithmeticoperations, Arithmetic primitives, Sequential and Distributed Arithmetic,

Hardware Elements and Hardware Design using VHDL 8 Hours

Gates.Tilip-Flops, Registers, Synchronization Signals, Power Consumption and related design rules, Pulse generationand Interfacing, Chip Technology: Semiconductor Memories, -Proccssors and Configurablc Logic, Chip Level andBoard Level Design Considerations .

Hardware Design Languages, Simulation of Hardware Elements using VHDL, Timing Behavior and Simulation,Test Benches, Synthetic Aspects

SC~Jllcntial Control·Circuits and Processors 8 Hours

Mealy and Moore Automa~on, Designing the Control Automaton, Implementing Control flow and Synchronization

Designing for ALU efficiency, Memory Subsystems, Simple Programmable Processor Design, Interrupt Processingand Context Switching, Interfacing Techniques; Stun?ard Processor Architectures

. Systcm Level Design. 10 Hours

Aspects of System Design, Scalable System Architecture, Regular Processors, Network Architecture, IntegratedProcessor Networks, Static Application Mapping and Dynamic Resource Allocation, Resource Allocation onCrossbar Networks and FPOA' Chips; Cominunication Data and Control Information, rI(I'i)-ncts Language forHeterogeneous Programmable Systems

~" -,l Digit:! ISignal Processors 8 Hours

DSP Elements and Algorithms, Integrated DSP Chips, Floating Point Processors, DSl's 011 FI'GA, TypicalApplications

References:

I. Mayer, Lindenberg, "Dedicated Digital Processors", Wiley2. R Gupta, "Co-Synthesis of Hardware and Softwarefor Embedded Systems", Kluwcr3. "Digital SignalProcessing", IEEE Press

II

·,

VLS~ Design & Testing

M:lni(Jlllation of Boolean expressions 10 Hours

Two le~1 realizations with NAND or NOR gates, Standard fonn of Boolean functions, Minterrn & rnaxtermdesignation of functions, simplification of functions 011 Karnaugh Maps, Map minimization of product-of-sumsexpression, incompletely specified functions, logic Hazards, Elimination of Hazards.

Algorithms for optimization of combinational logic, impact of logic synthesis, cubical representation of Booleanfunctions, determination of prime implicants selection of optimum set-of prime implicates, multiple output circuit,programmedlogic array. minimization of multiple outputfunction, Tabular determination of prime irnplicats, fieldprogrammable logic arrays.

VLSI Realizations of Combinational Logic to HOIII'S

Introduction, pass transistor network realization, Steering of 0, I.X &. X to the output, tree networks, negative gatcrealization, logic design with CMOS standard cells, pre charged clocking or CMOS PLA.

Multilevel logic using complex (MSI) ports & cells:- The place for complex parts & cells, decoders, ROM as a logicelement, binary adder, design with multiplexers, more than two level realizations with basic primitives,combinational M'Sl parts & cells, multilevel logic manipulation & optimization.

Sequential circuits 8 Hours

Sequential activity, memory elements, general model for Sequential circuits, clock mode Sequential circuits.,Synthesis of clock mode Sequential circuits: Analysis of a sequential circuit, design procedure, synthesis of statediagrams, equivalent state & circuits, simplification by implication tables, state assignment & memory element input :, '

eqnations.' •

VLSI Realizatioll of Digital Systems 8 Hours

Alternati ve Structural descriptions, levels of descriptions, Standard cell CMOS layout & delay model, Timinganalysis &. simulation, Event driven gate level simulations, Switch level simulation, PLD & programmable gate<lrrays,

Tcst CCllcl'ariulI [01' VLSI 10 Hours

Fault detection & diagnosis, Stuck at fault model, test generation strategy, test generation by evaluation & .scarch,modeling CMOS, Stuck-open [;1I1\(S, fault simulation in sequential systems, boundary scan, built-in-self test. Fault i

Tolerant Design: Hardware redundancy, Information redundancy, time redundancy, software redundancy, system;level Fault Tolerance. Self-checking sequcntial circuit Design:. Faults in state machines, self checking state machincs 'dcslgnTcchniques.Bynthcsis of redundant fault-free state machines.

References:

I. Parag K. Lala , "Fault-Tolerant & Faull Testable Hardware" , D-S-l'ublicati~i1 IIydcrabad2. ParagK. Lala ,"Self checking & Fault-TolerantDigital Design", Morgan' Kaufman Publishers3. Frederick J. Hill and Gerald R. Peterson, "Computer Aided Logical Design \VitTi Emphasis 011 VLSI",

John Wiley &. SOilS Inc.,

. -1:::/~ , [0

jI

\.:. .,\-

.<:::.~!;r.".-;

2. Software Engineering Stream

Engincering and Testing Structured Systems

10 hours

Scope of Software Engineering, The Software Crisis, The functional approach. Structuring a problem. Notion ofanalysis. Design as synthesis.

TheYourdon method: need for Event Partitioning,.statement of purpose, Context Diagram, terminators, data stores,Event typology, converting from events to software system functions

14 hours

Data Flo.}vdiagrams, process, flow, data stores, Constraints across levels, Data Dictionary, Process specificationtechniques: structured English, constraint based, Data now design heuristics • .

Construction Design: Coupling and Cohesion. 7 Levels of cohesion, Afferent and Efferent modules, COliversion tomodular structure, Design Heuristics for Module Design .

12 Hours

Maturity levels of testing, Unit, Module, Sub-System and System Testing Intcraction., Top down and bottom uptesting, Constructing Stubs and Drivers. Notion of a test case; test design approach to software design

White box testing: Testing Hypotheses, Statement testing, branch testing, branch and statement testing, Path,predicate path, path interpretation, Cyclomatie complexity, condition testing, loop testing.

.5 Hours

Black box testing: Cause-effect technique, developing test cases from cause-effect graphsImplications of software systems on underlying IT infrastructure . .

(leferellces:

L Yourdon, "Modern Structured Analysis", l'carsou2. Belzer, "Software.Testing", Van Nostrand Reinhold CO.3. Prc1;sman, "Software engineering", McGraw-llill .4. Sommerville, "Software Engineering", Pearson

.~.

(.~:~.;~;.

Object -Oriented Prugr-amuring

10 11011 rs

The 00 manifesto for Programming Languages. Object as having space and behaviour, Object classes: definition,class as a factory, as a specification, constructor, destructor, coPY constructor and their defaults, public and privateprotection. ,-6). - ~?-

15 Hours, (0Complex Objects and complex classes, their constructors and destructors and policies [or these. Privacy for ~IexOt5jCttS:-·lnl1entari~ siinple, multiple, repeated. Resolving inheritance con fllcts. Ru·les [or constructors, destructors.Protection policies for Inheritance. ~ . 13 A-

10.\ lours.Notion of Late 13inding. Polymorphism universal and inheritance based, Abstract classes and their use, Meta-classesand templates.

@'(1) 5 Hours

<0Special language features like friend functions; type casting etc. Separation of spcc ificationObject-orientation for reuse and maintenance.

from implementation.

All the above to be introduced through C++., '.

>. References:

I. Bjarne Stroustrap, "The C++ Programming Language", Pearson2. Parirnala N. "Object orientation Through C"'''''', MacMif lam]~Lippll1iln, Lajoie, and Moo, "C'! -I- Primcr'', Addison Wesley4 ..Robert Laforc, "Object Orientation in C 1--1''', Galgotia

/

,. A L S.X o1f <dJ.{~.

~-~.•.

I;.

~,,,{-~ , .

,. J.,

q c- ~. '81~

:(2·• :; ••••-: ~ ~I.

4-

-

t. ,·:if ..}: •. t ..

/Enginecl"ing 00 Systems

.. 5 I-!OI rr:S

00 maniresto for 00 Analys is. Object (lloddillg uurl differcncc with data-or-ientcd, process-oriented and behaviourmodeling.

15 Ho urs

Object modeling: classes, complex object classes, illherit<lnce and overriding, Sub systems and systems in 00modeling. State of all object, State transition ui<lgr<lIl1S.

J 0 Hours

Dynamic Modeling: Modeling an event. Event typology, event <IS trigger, representing dynamics. Relationshi-p withstate transition diagrams. Relationship with object model.

10 Hours

Functional Modeling: Review of Structured techniques, oro and its notions

Using object oriented concepts in OOSE, OOA&O, OMT

cross model constraints and linkages. Conversion to 00 implementation, UML notation

References»

I. Rumbaugh et <1[,"Object Oriented Modeling and Design", Prentice Hall2. Odell and Martin, "Object Oriented Analysis and Design", Prentice Hall

..•

I

....:.~*"':" 1.7

;.

Multimedia Systems

IS Hours

Components of multimedia, multimedia and hypermedia, Multimedia authoring: metaphor, production, presentation,automatic authoring, VRML,

..•10 Hours

Graphics and Image data representation, Colour in IIllage and Video- colour science, colour models in image andvideo, Fundamentals of video: types of video signals, analog and digital video,

10 Hours

Basics of Digital Audio: digitization, quantization, MIDI, multimedia data compression: lossy compressions; Imagecompression standards, basic video compression techniques, MPEG videocoding, MPEG audio compression,

5 Hours

Multimedia communication: quality factors in multimedia transmission, multimedia over IP, video. delay in ATM,multimedia, across DSL •

References:

I. Ze-nian and Drew, "Fundamentals of Multimedia", Prentice Hall2. Rao, K.R. et at, "Multimedia Communication Systems. Techniques, Standards, and Networks", Pearsall3. Y. Ramcsh, "Multimedia Systems Concepts Standards and Practice, Kluwcr

..

..•

/1-

.~ .

.~

Multimedia Systems

15 Hours

Components of multimedia, multimedia and hypermedia, Multimedia authoring: metaphor, production, presentation,automatic authoring, VRML,

10 Hours

Graphics and Image data representation, Colour in Image and Video- ~olollr science, colour models in image andvideo, Fundamentals of video: types of video signals, analog and digital video,

10 Hours

Basics ofOigital Audio: digitization, quantization, MIDI, multimedia data compression: lossy compressions; Imagecompression standards, basic video compression techniques, MPEG videocoding, MPEG audio compression,

5 Hours

Multimedia communication: quality factors inmuitiruedia transmission, multimedia over IP, vidcodelay in ATM,multimedia, across DSL •

References:

I. Ze-nian and Drew, "Fundamentals of Multimedia", Prentice Hall2. Ra~, K.R. ct al., "Multimedia Conllnllnic.!<~tionSystems. Techniques, Standards, and Networks", Pearson3. Y. Ramesh, "Multimedia Systems Concepts Standards and Practice, Kluwer

..

I

/1- .=

-,d-N"

Intcrnct l'1"ogl"amming and Web Service Eugiucermg

10 HOIII·s

Notio~ of mark up. HTML and XHTML. Style sheets, Cascading style sheets. Javascript, Dynamic HTML.

15 Hours

SGML XML, OTO, XML schema. ASP.Net, I'erl/CGI and Python

\ 15 Hours

Notion ofa web service. Service Oriented Architecture, SOAP, UOOI, WSOL, WSQM. Issues in providing QoS_Elements of Service oriented soft ware cugincering,

..•

References:

I. Ocitel, Deitel and Goldberg, "Internet & WQrJd Wide Web How to Program", Pearson2. W3 SOAP Standard3. uoor Standard4. WSOL standard

" 3. {uro.'lllation Systcllls StI-Cjllll

Conceptual Modeling

12 Hours

Why conceptual modeling, ANSI/SPARe framework, 100 % principle, conceptualization principle, abstraction

12 Huur,

Data-oriented Models: class as an abstraction, ER: entity class, relationship class, weak and regular structures, binaryand n-ary relationships attributes, primary key, relationship cardinality; attribute functionality, Limitations,SlIM, SIIM+: hierarchical data abstraction, inheritance and aggregation, formal definitions; inheritance forms,

G Hours

Translation of data oriented conceptual model into relational schcmatartranslatiug entity class, relationship ~Iass,weak and regular classes, aggregate hierarchy, inherhance hierarchy.

10 Hours

Behaviour-oriented Models: Why these modclsv-Intcrprctations of an Event, event as state change, event operation,. "

entity cycles, handling time, pre and post conditions of an event, message, Remora model

Benefits of Conceptual Modeling

References:

l . Batini, Ccri, Navathc," Conceptual Database Design: An Entity-Relationship Approach", The Benjamin-Cunuuings Pub2" Loucopoulos and Zicari," Conceptual Modeling, Databases, and Case: An lntegrutcd View ofInformation Systems Development", John Wiley & Sons

lG

-- -----'--=-

..~~

,I

Rcqu ircmcuts Enginccring

10 Hours

Why requirements engineering? Difference between Conceptual Modeling and RE. Context Diagram and RE.Organizational versus Technical requirements

Preparing"] EEE SRS document

7 Hou rs

Stakeholders and their idcnti Iication. Types of stakeholders, Designing and conducting interviews, questionnaires,brainstorming sessions : .

7 HOIl rs

RE in functional systems: Types of goals, goal satisfaction and satisficing, Goal modeling and decomposition,AN D/OR goal structures, Goal opcrationalizing., the 1* model, limitat ions of goal based techniques.

7110UI':;

Sccll;rio modeling. Defining a scenario, types of scenarios, Scenario classificatiol; based on its properties. Writingscenarios ill natural language, scenarios versus use cases, Goal-scenario coupling. Handling RE problems likeconflicts

9 Hours

1\1: in decisional systems: Organizariou versus Technical decisional requirements, diffcr cnccbctween transactionaland decisd ional systems, the changed role of RE. Notions of goals, decisions, and information. Difference betweenthem, the GDI model, Informational scenarios, tlleir fo;·m and usage

References:

I. Hull, Jackson, and Dick, "Requirements Engineering", Springer2. Macaulay: Requirements Engineering, SpringerJ. Jackson M., "son ware requirements & specifications: a lexicon of practice, principles and prejudices",i\CM Press/ Addison- Wesley

r '7- :

Mcthod Engincering

7 Hours

Notion of a method. Metl~od models, meta-models, and generic models. CAME, CASE, IIIctLl CASE and thcirdifferences. Method as artefact, process model,

H Hours

Product oriented meta-models: The OPRR model, notion of object, property, relationship and role. the GOPRRmodel, Product-Process meta-models: The fragment model. lnstantiatiing meta-model to yield methods

8 Hours

lntcgrntcdrneta-modcls: The contextual approach.inotion of context, tight coupling, the decisional approach, methodblock, types of methods, MRL

(, Hours

.The generic method model: dependency and its four forms, dependency graph as a a method, instantiating meta-

"models, instantiating methods, Engineering methods for diverse d~mains

10 Hours

Situational method engineering. SOLC for method cngineering. lntcutioual approach to method engineering. Methodengineering processes. ·Open Issues . . .

References:

I. Brinkkernpcr ct al, "Method Engineering", Chapman and I Iall, 19962. lolita R.et LlI, "Method Engineering", Springer, 2007). Research papers dealing with the fragment, contextual and decisional meta models.1\. Research papers on the generic method model .

1&

. S'ijij

/i

Process Enginccring

10 Hours

SDLC in S~W and IS engineering, Relationship of SDLC to process models, Classical.precess models: Code and Fix,Waterfall, Prototype, Spiral, V, Fountain. Iterativeand Incremental process models. .

12 Hours

Process meta-models: Zhy meta-models, limitations of classical models, Activity based models, lllIS, Contextualmodel, and Map model, Tracing, Backtracking, Guidance: passive, active

10 HOIII'S

The personal process and team process, Maturity models: the five levels of CMM, metrics to be collected for upwardmovement in levels, Introduction to ITIL, Six Sigma, IS09000. Differences between these, classes of problemshandled by these.

8 Hours

Business process models, business objects, relationships,' role, co-ordination activity. Workflow models, Formulatingbusiness process models, building situation ('pecific'b~siness 'models: intentions, architecture, organization •

. \rJ

lkJerellces:

I. Pressman, "Software Engtricerlng", Mcgraw-Hill2. Sommerville, !'Soflware Engineering", PearsonJ ~I'fleegar, "Software Engineering Theory and Practice"; Pearson4. Original research papers on the mentioned models.

t,

) "

- \.

i;

»:I\,

\...e:

;,

(

> '.

'. ,: ,"\

11.i·

(

~ Simulation and Modeling

10 Hours

, l3asic Simulation Modeling: The ~ure of simulation system, lIlod~ and simulation, discrete-~t simulation,~ ~ulation of a single-server queuing, alternative approaches to modeling and coding simulatIOns, networtz':' simulation, ~Iel and distributed simulation, simulation across the internet and web based simulation, steps in a

sound simulation study, other types of simulation: continuous simulation, combined discrete-continuous simulation,Monte Carlo simu laliQ!!., advantages, disadvantageS'1Ijld pitfalls of simulation.-. ===

, ..1. 7 Hours

Modeling Complex Systems: Introduction, list prycessing if! simulation. approaches to stering lists in a computerlinked storage allocation

:../1

Simulation examples using any simulationIanguagc: Single-server Queuing 'simulation with time-shared computermodel.job-shop model, and event-list manipulation .

'j'1it.~

~ Discrete System Modeling: Classification of simulation models the simulation process, system investigation~ . validation and translation, simulation' 'of complex discrete-event systel!!s with application in industrial and service" organization tactical planning and management aspects, Random variable generation and analysis.

~);

t

7 Hours

Simulation Software: ~)ariSOn of simulation packages with programming Ianguagcs classification of simulation .. s()flwar~, general-purpose simulation packages,object-oricnted simulation jbuilding valid, credible and appropriatCl ~l detailed simul~on lllodels'lexperill1cnt~t1. design, sensitivity analysis ancr'optilllization simulation of manu acturmg .

:f . systems. .

, .

;::",:J:::r!1b.cdded System Modeling: Embedded systems and system level design, models of computation, specification:;;.;~ia·ng~agcs, hardware/software code design, system partitioning, application specific processors and memory, low

.1,,) .

nCpower design.:.•..,j':. ...a..:. .

. ···.:RealjTilllc system modeling, Fixed Priority scheduling, Dynamic Priority Schcduling ',-~~Data'ColllllllHlication Network modeling, 11' network intradornain (e.g. o"SPF, IUP) routing simulation.

'.. /{e[erc/lces: .'

-:."""

I. Law Kclton.t'Simulation Modcling and Analysis;', McGra\':-J lill2. Geoffrey Gordon.t'Systcm Simulation", 1'111

4. Data Managcmcnt Sh'c<lm

Distributed DBMS

6 Hours

Review or computer networks and centralized DBMS, Why distributed databases, basic principles or DDBMS,distribution, heterogeneity, autonomy,

(, Hou rs

ODn nrchitccture: client-server, peer-to-peer, federated, multidatabasc,

15 Hours

DDB design and implementation: fragmentation, replication and allocation tcchniques,. .. .

Distributed query processing and optimization,

Distributed transaction management, concurrency control and reliability, DDI3 intcroperability

References:

I. Ccri and Pclagatti, "Distributed Data Base Systems", Addison2. Ozsu,Valduriez, "Distributed Data Base Systems", Pearson

..

. " ,, .~,<. ('.. .:.

.")/c::

Data Warehousing

-----~. ~ , to _~ 'I \. ., 14 I lours

&t'heorganizational perspective, the technical perspcctivc, Dimensional Modeling: facts, dimensions, slowly andrapiCJlych,mgmg dllllenslOns, Data Warehouse operations with their formal dellllitions and applications)<=onvcrtingER to data cube -. . ... _. . ,

. .•. .., .

8 Hours

Aggregation, their need a Ill! uelinitions, historical information, Query facility, aLAI' functions and Tools, DataMining interfaces"

\ 1.---

Relational representation, !taLAI', Multidimcnsional representation, MOLAP, Advantages, disadvantages, tradcoffswith ROLAP, Meta-data and CWM, OW process and architecture: ETL process, tradcoffs between automated ETLand tailor made ETL ~ .

. \.~(b \ P~~h,

81[011 rx

10 II o III'S

SOLe- of a Warehouse project: business process driven, Information systems product driven and goal drivenapproaches. ~.- A-- ,_ .;

Design approaches: data driven design, user driven design. Information Package, Diagram driven dcs ign,. ~ .;

!!.:" _.. .": . . ~ .r:··:. P~)ysical design:-:!ustering; \i~itiolling etc. Tradc-offs in physical design.

~:f:>.. r;~ -..-._,.References: - >

.. j

-

[

~lIIaih' "Data Warehouse Fundamentals", Wiley<:';1:. \. ~lIlon, "Building the Data Warehouse", Wilcy\.,' ,. J, Kimball and Ross, "The Data Warehouse Toolkit" Wilcy::~, ·4. Murray, "Data Warehousing in the Real World", Wiley

S. 1t1lhorrC.:"M~stcring Data Warehouse Destl~iley

~0(5~D'

.~r~.sO'"<',\ . /~.- ~QJ--

pnni~·L~~.

";."

~.

I,"

",~;

"",

Multi-media Databases

8 Hours

Relational versus multimedia databases, Ilamlling object data, Multidimensional structures: insertion, deletion,search ill 2-d trees, point quadtrees, M'Xvquadlrccs, and It-trees

(, HOllrs

Image d.uubascs: Raw and compressed image.", Discrete Fourier transform and Discrete Cosine transform,segmentation, similarity based and spatial layout retrieval, image representation in relation~ and R-trees

4 !lours

.Documqnt databases: precision and recall, Latent semantic indexing, operating on TV trees, inverted indices andsequent ial files.

H l lnurs

Video databases: organization or video content, querying content of video libraries, video segmentation, videostandards

4 Hours

Audio databases: general model, metadata, signal based audio content, discrete transformations for audio COil tent,indexing techniques

(, Hours

Multimedia databases: Principle of Uniformity, media abstractions, query languages, indexing, queryrelaxation/expansion

4 Hours

• Physical storage and retrieval: retrieving form disk, CJ)-ROM,,"~'apes: recording and placement methods, retrievaltechniques.

Open issues: security, compression for special data bases c..g. in medicine., .

References:

I. Subralunaniam VS, "Principles of Multimedia SyStcms", Morgan Kaufman2. Apcrs et al, "Multimedia Databases in Perspective, Springer3. Dunckley, "Multimedia Databases: AnObject Relational Approach", Holborn

.,"

:.": ~.:~.:.,:".1_, :3 \ ..,

--.; ..,...... ~~.,-Y""~-----._-.•....• --

8 Hours

Knowledge: Introduction, definition and importance, knowledge base system, representation. of knowledge,organization of knowledge, knowledgemanipulatioll, knowledge acquisition, introduction to PROLOG.

I

8 Hours

Formalized symbolic Logics, Syntax and Semantics for rOPL, Inference rules, The resolution principle, 1\'0dcductive inference methods, Bayesian probabilistic informer, Dimpstcr-Shafcr thcery, Heuristic RcasoningMethods.

8 Hours

Search and Control strategies: introduction, conccjus, uniformed or blind search, informal search, searchi Ig au.r-or" ra Jhs Matching techniques, structures used in retrieval techniques, integrating knowledge in memory, III :i~-o allIzalion system.

8 Hours

Fuzzy Logic: Basic concepts, Fuzzy sets, Membership Function, Types 'of-membership Function, Basic operations '.II

Fuzzy sets, Intersection & Union-Complementary, Subset hood, Properties of Fuzzy sets.

8 Hours

Expert System architectures: Rule-Based system- architectures, Non production system architecture, dealing .withuncertainty, knowledge organization and validation.

!Ii.'

"

5. AI STREAM

Artificial Intelligence

..•

References:

I. Dan W Patterson, "Introduction to Artificial Intelligence and Expert System". 1'111_ 2. Peter Jackson, "Introduction to Expert System", Pearson .

\~ b- Gouzalbz and D.Dankel, "The Engineering Knowledge Base System", PI-ell

. Vstuart Russell and Peter nerving, "Artificial Intelligence: A Modern approach", 1'111l· 10lUl Yell &·Keza Langan , "Fuzzy: Intelligence, Control and Infonnation'", Pearson

..

.2..-1-

;Learning Systems

·8.Hours

Introduction: Definition, Human Drain, Model of Ncuran, Feed hack, Network Architectures, KnowledgeRepresentation, AI & Neural Hctworks.

Learning Processes: Introduction, Error-correction Memory-Based Learning, Hcbbian Learning, CompetitiveLearning, Boltzmann Lear.ning, Learning with a teacher, Learning without a teacher, Memory Adaptation.

8 Hours

Single Layer Pcrccptrons: Concepts, Adaptive Filtcriug, Unconstrained optimization, Steepest Descent Method,Newton's Method, Pcrccptron, PcrccptronConvcrgcnce Theorem.

Multilayer Pcrccptrons: Prelim inarics, Back-propagation algorithm, activation function, Rate of learning.

811oUl·s

Neurodynamics: Introduction Associative Memory, Linear Associater, Dynamical Systcrr s, Stability of EquilibriumStates, Attractros, Hopficd models, Drain-state-in-a-box model.

8 Hours

Genetic Algorithms: Basics of genetic aigorirhms, binary GA implementation, Real coded GA, Design issues. in GA,Choice of encoding, selection probability, mutation an~ cross over probabilrity, fitness evaluation function.

, ,

References:

i. ~ill1on Haykin.v'Ncural Networks", Pe~rson .2. Mohamad lLf lassoun, "Fundamentals of Artificial Neural Networks", PIlI3. James t\. Anderson, "An Introduction to Neural Networks", PHI4. Melanic Mitchall, "An Introduction to Genetic Algoritlllll", I'~I!

r ,,

,..';:'

=

Data Mining

Overview, types of mining, Mining operations, introduction of statistical Datil Mining, Heuristic Mining,Introductiun of mining in data warehousing, Siages of OM process. Decision-Tree based c\assi Iicrs: infomationgain, decision tree learning. .

7 Hours

Data Mining Techniques: Association- Rule mining methodes, supervised neural nctworx , pcrceptron. backpropagation, haycsian methods, cross-validntion, Tillie scqllcllce discovery.

7 Hours

Clustering: Similarity and distance measures, hierarchical algorithms, pnrtitional algorithms, clustering largedatabases, clustering with categorical attributes. K - means.

10 Hours

~, Introduction to information retrieval, Query optimization, Unstructured and semi-structured text, Text encoding,Tokcnizatiou, Steaming, Lemmatization, Index Compression, Lexicon-Compression, 'Gap encoding, gamma codes,Index constructions, Dynamic indexing, Positional indexes, n-gralll indexes, real-world issues, Vector-SpaceScoring, Nearest neighbor. techniques. '

10 Hours

Introduction to information retrieval, Inverted indi~es and Boolean queries, Query optimization, Unconstrained andsemi constrained text, Tcxt encoding; Tokcuizatiou, Stemming, Lcnunnrizat ion, Tolerant retrieval: Spelling

• correction and syuonyrucs, permuterm indices, a-gram indices, Edit distance, Index compression, Lexiconcompression, Gap encoding, Gamma codes, Web structure.the user, search engine, optirnization/spam.wcbcharacteristic, web size measurement, near duplicate detection, crawling and web indexes, link analysis.

References:

I. M.H. Dunham, "Data mining: Introductory and Advanced Topics", Pearson2. J. I Ian and M. Kamber, "Data Mining: Concept and Techniques", Morgan Kaufman3. Mallach, "Datil Warehousing System", McGraw-Hili '4. Rechard J. Reiger and michal W. Grcatz, "Data Mining: A Tutorial based primer", Pearson5. Tom Mitchell, "Machine Learning", McG!'aw-i'lill

.~.

14 . ..1,) •..(X .....•."

Natural Language Processing

10 Hours..Context Free grammars, Lexical analysis, Introduction to par~ing, Context Sel.lsitive grammars

10 1I01l1·S

Linguistics of English: Review of English Grammar, Morphology, syntax, semantics, structure of discourse. Wordsand thc lexicon: word classes. .

12 Hours

• Semantic Grammars, TN, ATN, Case grammars, Paninian Grammars, Parsers of NL statements, Determiners andquantifiers, Noun-noun modification, pronoun resolution, relative clauses

8I1oUI·s

Deep structure, shallow structure, Differences between English and Hindi Application(a) MT .(b) ASR(c) IR(d) Q & A

References: ~I.Manning,CO, Schutzc H, "Foundations of statistical natural language processing", MIT press2.Jurafsby D. Martin J.H, "Speech and Iauguage processing" , PHI3 .Allen , J:, "Natural language understanding.", Benjamin! Cummins'Publishing4. Wall L et W, "l'rogranuniug PERL", O.'ReiIlY .

10 H OIII'S

6. SECURITY STREAM

Cryptogra phy

NuinlJer: Theo.·y

Prime numbers, Euler's Toticnt function, Fermat's and Eulers Theorem, Primality Testing, Chinese RemainderTheorem. Discrete Logarithms, Group, Rings, Fields, Modular Aritlunctic, Euclidean Algoritlun, Finite Fields of t.ie

• form GF(p), Polynomial Arithmetic, Fields of the form OF(2"), Random Number Generation and Testing

PulJlic Key Encryption 10 1111\1 rs

RSA System, Implementing RSA, Attacks on RSA, Rabin Crypto System, Factoring algorithms. The (p-I) method,Dixon's algorithm and Quadratic sieveElliptic Curve Cryptography: Elliptic curves over GF(p), Elliptic curves over GF(2"'), Elliptic curve cryptography,factoring with ECC: Key Management and Diffie Hellman Key Exchange,

Symmetric Encr.yption S I lours

Block'Cipher and DES, The strength of DES, Differential and' Linear Cryptanalysis 01" DES, Advanced EncryptionStandard, Stream Ciphers and RC4,

Hash Functions 8 !lOll rs

Hash functions, Security of hash functions, MD5, Secure Hash Algorithm, Whirlpool, HMAC, CMAC, The birthdayattack problem.Digital Signatures, Requirement, Authentication protocols, Digital Signature Standard, ECDSA

Finite Automata and Ciphers 6 Hours

Fjnite Automata and Ciphers, Structure of Ciphers, Selection of the Ma, II and g functions, Cipher Design uSIngAutomata

References:

I. Douglas R Stinson, "Cryptography Theory and practice", CRC Press2. William Stalli rigs, "Cryptography and Network Security 4e", Pearson3. Simon J Sliepherd, "Cryptography: Diffusing the Confusion", Research pr css studies

.2, \). I.

Network and System Sccur ity

Nctworl{ Security

AH and ESP Protocols, Security associations, Key management, Web security Considerations, secure socket layerand Transport layer security.

PKllllf,·;aSlructure 8 Hour's

Concept of an infrastructure, application enables secure single sign-oil, comprehensive security, defining PKI, LDAPand X5'OO.

Core 1'[(1 Services: Authentication, Integrity and confidentiality, Mechanism required. to create PKI enabled servicesX-509 certificate. . ,

8 Hours

System Security: Intrusion Detection, Password Management, Base Rate Fallacy.Malicious Software: Virus and related threats, virus countermeasures, Distributed Denial uf Service attacks,Firewalls: Qesign principles, Trusted Systems common criterion for IT security evaluatior .

as and Database Security 10 Hours

Structure of au as· ilIld application, application ;1I\d as security, security III Unix and Linux PluggableAuthentication Modules, Access Control Lists,.SELinux ..

Database Security: Database Security Evolution, Role-based an object-oriented encapsulation procedural extension toSQL, Security through Restrictive Clauses. .

!I;.

Seclire AllplicaliollS 8 Hours

I'GP and SMIME, Kcrbcros version IV and V, Security in Cellular Communication System, Secure ElectronicTransaction,

References:

l. William Stalling, "Cryptography and Netwo\·k Security. 4e", PHI2. C Adams, Steve Lloyd, "Understanding PKI", Addison WesleyJ. Jay Ram Chandran, "Designing Security Architecture", Wiley Computer Publishing4. C Kaufman, Radia Perlman andMike, "Network Security 2e", Pearson .

. .:.

Oigital Forcns ic

Transform Methods: Fourier Transformation, Fast Fourier Transformation, Discrete Cosine Transformation, Mellin-Fourier ••Transformation, Wavelets, Split Images in Perceptual Bands, Applications. of Transformation inSteganography.

8 Hou.rs •

Biometrics: Overview of Biometrics, Biometric Idcntification, Biomctric Verification, Biomctric EnroII meut,Biometric System Security.

Authentication and Biometrics: Secure Authentication Protocols, Access Control Security Services, Authcnt icaticnMethods, Authentication Protocols, Matching Hiomctr ic Samples, Verification by hUI11Hns.

Common biometrics: Finger Print Recognition, Face Recognition, Speaker Recognition, Iris Rccognition, HandGeometry, Signature Verification, Positive and Negative of Biometrics.

Matching: Two kinds (If errors, Score distribution, Estimating Errors from Data, Error Rate of Match Enginc!,Dcfirtition of F A'Rand 'FRR

Ii lIolI rs

kuroduction to Iuformation Hiding: Technical Steganography, Linguistic Steganography, Copy Right Enforcement.Wisdom from Cryptography .

Principles «If Sicganography: Framework for Secret Conuuunication, Security of Steganc graph)' System, InfurmationHiding in Noisy Data, Adaptive versus non-Adaptive Algorithms, Active and Malicious Attackers, Informationhiding' in Written Text.

H 1I01l1'S '

Survey of Stcganographic Techniques: Substitution systems and I3it Plane Tools, Transform Domain Techniques: - 'Spread Spectrum and Information hiding, Statistical Steganography, Distortion Techniques, Cover GenerationTechniques.

Stcganalysis: Looking for Signatures: - Extracting hidden Information, Disabling Hidden Iuformation.

IUllours

Waterma r kiug and Copyright l'rotcction: Basic Watermarking, Watermarking Applications, Requirements andA lgoritlun ic Design Issues, Evaluation and Benchmarking of Watermarking system.

References:

I. Karzendbisscr, Pctitcolas, " Information Hiding Techniques for Stcganography ami Digital Watcrmar k ing",Ar tcch House.

2. Peter Wayncr, "Djsappcaring Cryptography: Information II id illg, Steganography and \\'.\1<':1111;11 king 7./<.;",E1',':"V icr

3. Bulk, Couue ll ct. a l., "Guide to l Iiornctrics". Sprillger "

I-,o

7. THEORETICAL CS STREAM

Parnllcl Algo.-ithms

8 Ho ur-,

Sequential model, need of alteJ;,native model , .parallcl computational Ill~dcls such as Pi0-M I LMC~ , I-Iype~beCube Connected Cycle. ButCd·ny , Perfect Shuffle Computers , Trce modcl I Pyramid model. hilly Connectedmodcl , PRAM-CREW, EREW models. simulation.ofone I~dc/ from anothcr one. -

''2 J II ( 8 Hours

l'crfonnancc Measures of Parallel Algorithrus , speed-up and efficiency of 1'1\ , Cost-optimalityj An exan~illustrate G,ost-optimal algorithms- such as sumniation , Mill/Maxonvarrous lIIodels. • -

~ J,-----I) Hours

Parallel Sorting Networks. Parallel Merging Algorithllls on CREWII~IU~V/MCCICREW IEKEW l~il~ear-<llTay

PHilllcl SortingNetworks (III

H Iiours

Parallel Searching Algorithm , Kth clement • Kth clement in X+Y on PRAM, Parallel Matrix Transportation andMultiplication Algorithm on PRAM MCC. Vector-Matrix Multiplication, Solution 01" Linear Equation, Rootfinding. .

,------_ ...

R i lours

Graph Algorithms - Connected Graphs i search and traversalCombinations I Derrangcmcnts.

Combinatorial .<\ lgortthms- Pcnnutat ion ,

References:

I. M.J. Quinn, "Designing Efficien! Algorithms for Parallcl Computer" by Mc Graw Hill. \2. S.G. Akl, "Design and Analysis of Parallel Algorithms"3. 8.G. Akl, "Parallel Sorting Algoritlll11L' by Academic Press~ .

•.

fl' ~.:.,. . ",

r

@ Randomized Algorithms

Introduction: Basic .Probability Theory, Probability Spaces; Bayes' Rule; Independence; Expectation;Common Distributions, Randomized Algorithm: General concepts and definitions, Quicksort ,Partitions, Probabilistic recurrences , Randomized Complexity Classes: UP, PP, BPI'

Game Theoretic Techniques and Lower Bounds: Game theory concepts; Applications to lower bounds, Examples:Sort ing and Gallic tree evaluation

!! I-lours

Moments and Deviations: Random s;]lIIpling/blicketing, Tail bounds: Markov and Chebyshcv inequalities. Highconfidence selection, Pairwise independence, Applications: The stable mnrr iagc problem

Tail Inequalities : Chernoff bounds; Appf ications: Network routing and gate-array wiring,7 \lUl1/-S

Markov Chains and Random Walks: A 2-~0-T Example, Markov Chains, Random Walks on Graphs, GraphConnectivity, Expanders , Probability Amplification by Random Walks on Expanders

Algebraic methods: fingerprinting and Frcivald's technique, Verifying polynomial jdcntitics, Randomized patternmatch il1g

Data Structures: Random trcaps; Skip lists

Randoiuizcd Graph Algorithm: Shortest paths; Minimum spanning tree

6 l lou rs

7 11011 rs

Parallel and Distributed Algorithms: The I'ItAM Model, Sorting on- a "iZArvf,' Maximal Independent St:I:;, PerfectMatchings,

Number Theory and Aigcbra: Elementary number theory, Quadratic residues, l'rimality testing, H.SA cryptosysrcm

Referellces:

",. R_ Motwani and P. Raghavan, "Ual1~ol1lized Algorithms", Cambridge Uuiversity Press

2_ Michacl Mitzcumachcr, Eli Upfal , "Probability and Computing", Caillbrid{',c University Press,

~.:

I