Mtech Cs Syllabus

7/30/2019 Mtech Cs Syllabus

1/55

10

Scheme of studies

M.TechComputer Science & Engineering


2/55

11

M.Tech Degree ProgrammeComputer Science & EngineeringCurriculum & Scheme of Examinations

SCHEME

SEMESTER I

Code Name of the Subjects Credits Hrs/Week

Durationof Exam

Evaluation (Marks)

Internal External Total

RCC1001 MathematicalFoundations ofComputer Science 3 3 3 50 100 150

RCC1002 Computer Architecture 3 3 3 50 100 150

RCC1003 Software EngineeringPrinciples 3 3 3 50 100 150

RCC1004 Advanced OperatingSystems 3 3 3 50 100 150

RCC1005 Advanced Networks 3 3 3 50 100 150

RCC1006 Advanced CompilerDesign 3 3 3 50 100 150

RCC1101 Seminar 2 2 50 - 50

RCC1102 Laboratory 1 2 50 - 50

RCC1103 Project Part I 1 50 - 50

Total 22 450 600 1050


3/55

12

SEMESTERI I

Code Name of the Subjects Credits Hrs/

Week

Duration

of Exam

Evaluation(Marks)


RCC2001 Advanced Topics inAlgorithms 3 3 3 50 100 150

RCC2002 Advanced Data BaseManagement Systems 3 3 3 50 100 150

* Elective -1(StreamElective) 3 3 3 50 100 150

* Elective -I I(StreamElective) 3 3 3 50 100 150

* Elective -III(DepartmentElective) 3 3 3 50 100 150

** Elective -IV(InterDisciplinary Elective) 3 3 3 50 100 150

RCC2101 Seminar 2 2 - 50 - 50

RCC2102 Laboratory 1 2 - 50 - 50

RCC2103 Project Part II 2 - 100 - 100

Total 23 500 600 1100

* The students can select three electives (Elective I, II and III), from the list ofSTREAM / DEPARTMENT ELECTIVES for Semester II, for the current

semester as advised by the course coordinator.** The students can select one elective (Elective IV), from the list of INTER

DISCIPLINARY ELECTIVES as advised by the course-coordinator.


4/55

13

List of Stream / Department Electives-for Semester I I

1.RCE 2001 Parallel Algorithms2.RCE 2002 Security in Computing

3.RCE 2003 Cryptography4.RCE 2004 Parallel Computing5.RCE 2005 Computational Geometry6.RCE 2006 Advanced Computer Graphics7.RCE 2007 Soft Computing8.RCE 2008 Data Warehousing9.RCE 2009 Pattern recognition

List of Inter Disciplinary Electives

1. API 2001 Urban Environment Management2. API 2002 Energy Environment & Buildings

3. API 2003 Energy Efficiency and Micoclimate

4. API 2004 Rural Planning and Development

5. CSI 2001 Finite Element Analysis

6. CSI 2002 Theory of Plates and Shells

7. CSI 2003 Advanced Mechanics of Materials

8. CSI 2004 Mechanics of Composites

9. CSI 2005 Random Vibration

10. CEI 2001 Philosophy of Technology11. CEI 2002 Environmental Management

12. CEI 2003 Environment and Pollution

13. CGI 2001 Geotechnical Engineering for Infrastructure Projects

14. CHI 2001 Fuzzy Sets and Systems in Engineering

15. CTI 2001 Optimisation Techniques

16. CMI 2001 Personnel Management

17. EMI 2001 Biomedical Instrumentation

18. EGI 2001 Navigation, Guidance And Control

19. EPI 2001 Energy Conservation and Management20. ECI 2001 Engineering Optimization

21. MII 2001 Heuristics for Optimization

22. MII 2002 Financial Management

23. MII 2003 Organizational behavior

24. MII 2004 Operations Research


5/55

14

25. MII 2005 Management Information Systems

26. MDI 2001 Applied Finite Element Methods

27. MDI 2002 Acoustics and Noise Control for Engineers

28. MPI 2001 Computational Fluid Dynamics

29. MTI 2001 Numerical Methods

30. MRI 2001 Finite Element Methods

31. MRI 2002 Advanced Numerical Techniques for Engineers

32. MRI 2003 Total Quality Management

33. MRI 2004 Optimisation Techniques

34. TAI 2001 Mechatronics

35. TMI 2001 Fuzzy Systems & Applications

36. TSI 2001 Artificial Neural Networks

37. RCI 2001 Object Oriented Modeling and Designing

38. RCI 2002 Embedded & Real Time Systems

39. RCI 2003 Software Project Management

40. RCI 2004 .NET Programming

SEMESTER II I

Code Name of the Subjects Credits Hrs/Week

durationof Exam

Evaluation(Marks)


* Elective -V (StreamElective) 3 3 3 50 100 150

* Elective -VI (StreamElective) 3 3 3 50 100 150

RCC3101 Research Methodology 1 - - 50 - 50

RCC3102 Industrial

Training/Interaction 1 -

-

50

-

50

RCC3102 Thesis-Preliminary 4 14 - 200 - 200

Total 12 20 400 200 600


6/55

15

The students can select two electives (Elective V and VI), from the list ofSTREAM ELECTIVES for Semester III, for the current semester as advised bythe course coordinator.

List of Stream Electives-for Semester II I1. RCE 3001 Software Testing2. RCE 3002 Image Processing3. RCE 3003 Mobile Computing4. RCE 3004 Data Mining5. RCE 3005 Fault Tolerant Systems6.RCE 3006 Distributed Computing

SEMESTER IVCode Name of the

SubjectsCredits Hrs/

WeekEvaluation(Marks)


Sessional Guide ThesisViva

VivaVoce

RCC4101 Thesis-Final 12 29 200 200 100 100 600

Total 12 29 200 200 100 100 600

Note: 6 to 10 hrs per week is allotted for department assistance


7/55

16

SYLLABUS

Computer Science & Engineering


8/55

17

SEMESTER I

2-1-0-3RCC1001. MATHEMATICAL FOUNDATIONS OF COMPUTERSCIENCE

Formal Logic: Statement, Symbolic Representation and Tautologies, Quantifiers,Predicator and validity, Normal form. Propositional Logic, Predicate Logic, LogicProgramming and Proof of correctness. Resolution and Unification

Proof, Relation and Analysis of Algorithm: Techniques for theorem proving:Direct Proof, Proof by Contra position, Proof by exhausting cases and proof bycontradiction, principle of mathematical induction, principle of complete

induction. Recursive definitions. Solution methods for linear, first-orderrecurrence relations with constant coefficients.

Sets and Combinations : Sets, Subsets, power sets, binary and unary operations ona set, set operations/set identities, fundamental counting principles, principle ofinclusion, exclusion and pigeonhole principle, permutation and combination,pascals triangles, binomial theorem, representation of discrete structures.

Relation/function and matrices: Relation, properties of binary relation, operationon binary rotation, closures, partial ordering, equivalence relation, Functionproperties of function, composition of function, inverse, binary and n-ary

operations, characteristics for Permutation function, composition of cycles,Boolean matrices, Boolean matrices multiplication.

Lattices & Boolean Algebra: Lattices: definition, sub lattices, direct product,homomorphism Boolean algebra: definition, properties, isomorphic structures (inparticular, structures with binary operations) sub algebra, direct product andhomo-morphism, Boolean function, Boolean expression, representation &minimization of Boolean function.

Graph Theory:Terminology, isomorphic graphs, Eulers formula (proof) fourcolor problem (without proof) and the chromatic number of a graph, five colortheorem. Trees terminology, directed graphs, Computer representation of graphs,Warshalls, algorithms, Decision Trees, Euler path & hamiltonian circuits,Shortest path & minimal spanning trees, Depth-first and breadth first search, treesassociated with DFS & BFS). Connected components, in order, preorder & postorder trees traversal algorithms.


9/55

18

Modeling arithmetic, computation and languages: definition of group, monoid &semi group, simple examples from arithmetic of numbers and matrices, modulararithmetic, transformation & formulation, strings, elementary group theorem-uniqueness of identity and inverses; definition of subgroup, definition and

examples of group isomorphism. Lagranges theorem and Cayleys theorem(without proof).

Definition of finite state machines, and Kleenes theorem, unreachable states,limitations of Finite state machines, definition of Turing machines and someexamples, Turing machines need for recognition and compute functions, Church-Turing thesis (overview), Definition of the set P and the set NP, Introduction toformal languages & grammars.

Text:

1. J.P. Tremblay & R. Manohar, Discrete Mathematical Structure withApplication to Computer Science, TMH, New Delhi (2000).2. Kolman, Busby & Ross Discrete Mathematical Structures, PHI.3. Iyengar, Chandrasekaran and Venkatesh, Discrete Mathematics, Vikas

Publication.4. Peter Linz, An Introduction to Formal Languages and Automata, Narosa

Publishing House.

Reference:

1. J. Truss, Discrete Mathematics, Addison Wesley.

2. C.L.Liu, Elements of Discrete Mathematics, McGraw Hill BookCompany.3. M.Lipson & Lipshutz, Discrete Mathematics, Schaums Outline series.4. J.E.Hopcroft & J.D.Ullman, Introduction to Automata Theory, Languages

and Computation, Addison Wesley.

Note : 20% choice may be given while setting the question paper


10/55

19

2-1-0-3

RCC1002. COMPUTER ARCHITECTURE

Parallel computer Model: State of computing, multiprocessor & multi-computermultivector & SIMD, VLSI Models. Instruction Level parallel Processing.

Pipe lined processors: Linear and Non-linear pipelines, carry-save adder pipesfor integer multiplication, 4 stage fixed point multiplication of 8 bit integer. Non-linear pipe theory, State transition diagram, Issue latencies for non-linear pipes,Use of delay to improve issue latencies.

Scalar and Super scalar processing data control and resource dependencies,register renaming, reservation stations, reorder buffers, Case studies-Power PC

620, CISC processors with RISC core-Pentium Pro, Branch Control.

Data Parallel Architecture: Introduction, Static and dynamic interconnectionnetworks, omega and baseline networks, SIMD systems, case study MPP andCMS, Vector Processing, Case study Cray family, Introduction to Systolicarchitecture , example matrix multiplication.

Multiprocessors and Multicomputers: cache coherence and Synchronizationmechanism. Three generation of multicomputers, Data Flow Architecture: DataFlow and Hybrid Architecture Data Flow Architecture. Case Study: VLIWArchitecture Super scalar and RISC processor, SPARC.

Text1. Dezso Sima, Terence Fountain, Peter Kacsuk, Advanced Computer

Architectures A design space approach, Pearson Education 1997.2. Kai Hwang, Advanced Computer Architecture Parallelism, Scalability,

Programmability, Tata Mc Graw Hill, 2003.

References1. Hennessy J. L., D. Patterson, Computer Architecture A quantitative

Approach, Morgan Kauffman (4/e), 20062. Michael J Flynn, Computer Architecture- Pipelined And Parallel Processor

Design, Narosa Publications, 2003.



11/55

20

2-1-0-3

RCC1003. SOFTWARE ENGINEERING PRINCIPLES

Introduction: Software Crisis, Software Processes & Characteristics, Softwarelife cycle models, Waterfall, Prototype, Evolutionary and Spiral Models,Overview of Quality Standards like ISO 9001, SEI CMM.

Software Requirements analysis & specifications: Requirement engineering,requirement elicitation techniques like FAST, QFD & Use case approach,requirements analysis using DFD, Data dictionaries & ER Diagrams,Requirements documentation, Nature of SRS, Characteristics & organization ofSRS.

Software Project Planning: Size Estimation like lines of Code & Function

Count, Cost Estimation Models, Static single & Multivariable Models,COCOMO, COCOMO-II, Putnam resource allocation model, Risk Management.

Software Design: Cohesion & Coupling, Classification of Cohesiveness &Coupling, Function Oriented Design, Object Oriented Design, User InterfaceDesign.

Software Metrics: Software measurements: What & Why, Token Count,Halstead Software Science Measures, Design Metrics, Data Structure Metrics,Information Flow Metrics.

Software Testing: Testing process, Design of test cases, functional testing:Boundary value analysis, Equivalence class testing, Decision table testing, Causeeffect graphing, Structural testing, Path Testing, Data flow and mutation testing,Unit Testing, Integration and System Testing, Debugging, Alpha & Beta Testing,Regression Testing, Testing Tools & Standards.

Software Reliability: Importance, Hardware Reliability & Software Reliability,Failure and Faults, Reliability Models, Basic Model, Logarithmic Poisson Model,Calender time Component.

Software Maintenance: Management of Maintenance, Maintenance Process,Maintenance Models, Reverse Engineering, Software Re-engineering,Configuration Management, Documentation.

Software Tools and Environment: Programming environments, Requirementsanalysis and design modeling tools, configuration management tools, Toolintegration mechanisms.


12/55

21

Text:

1. R. S. Pressman, Software Engineering A practitioners approach, 5

th

ed., McGraw Hill Int. Ed., 2001.2. K.K. Aggarwal & Yogesh Singh, Software Engineering, New Age

International, 2001.Reference:1. R. Fairley, Software Engineering Concepts, Tata McGraw Hill, 1997.2. P. Jalote, An Integrated approach to Software Engineering, Narosa,1991.3. Stephen R. Schach, Classical & Object Oriented Software Engineering,

IRWIN, 1996.4. James Peter, W Pedrycz, Software Engineering, John Wiley & Sons

5. Sommerville, Software Engineering , 6

th

ed. Pearson Education, 2002.



13/55

22

2-0-1-3

RCC1004. ADVANCED OPERATING SYSTEMS

Uniprocessing operating system: Review of Operating system concepts. ProcessConcept Threads process Scheduling process synchronization InterprocessCommunication - semaphores Messages Monitors critical Regions conditional critical regions dead Locks. Real and virtual Memory managementSchemes.

Multiprocessor Operating System: Multiprocessor UNIX design goals - Masterslave and multithreaded UNIX - Multicomputer UNIX extensions.

Distributed Operating System: Introduction - Design Issues. Communication indistributed systems Layered protocols ATM - client server model - remote

Procedure call Group communication.

Synchronization distributed systems: Clock Synchronization Mutual Exclusion Election algorithms Atomic transactions - Deadlocks in distributed systems.Processes and processors in distributed systems: Threads system models -Processor allocation - Scheduling in distributed Systems.

Distributed file system Design and implementation Trends in distributed filesystems. Case study AMOEBA, MACH, Recent trends and developments.

Text:

1. A.S.Tanenbaum, Modern Operating Systems, PHI Edition, 19922. A.S.Tanenbaum, Distributed Operating systems, PHI.3. M. Singhal and N.G.Sivarathri, Advanced Concepts in Operating

Systems, M.C.Grawhill Inc. 1994.References:

1. J.L.Peterson and A. Silberchatz, Operating System Concepts2. M.Maekawa, A.E.Oldehoeft And R.R. Oldehoeft, Operating systems.3. M.Milenkovic, Operating Systems : Concepts and Design , McGrawhill

Inc Newyork, 19924. K.Khawng, Advanced Computer Archiecture : Parallelism , Scalability,

Programmmability, M.C.Grawhill Inc, 19935. C.Crowley, Operating Systems A design Oriented Approach, Irwin

1997.Note : 20% choice may be given while setting the question paper


14/55

23

2-0-1-3RCC1005. ADVANCED NETWORK S

Introduction, Protocols and TCP/IP Suite- The need for a protocol architecture,the TCP/IP Protocol Architecture, The OSI Model, Inter networking. TCP and IP-Transmission Control Protocol (TCP), User Datagram Protocol, The InternetProtocol, IPv6.

High Speed Networks- Frame relay, Packet Switching Networks, Frame RelayNetworks, ATM Protocol Architecture, ATM Logical connections, ATM cells,Service categories, ATM Adaptation Layer, High Speed LANS- emergence,Ethernet, Fibre Channel, Wireless LANS.

Congestion and Traffic Management: Congestion control in Data Networks andInternets, Link Level Flow and Error Control, TCP Traffic Control, Traffic andCongestion Control in ATM Networks.

Addressing and Routing: Addressing Flat, Classless, Hierarchical, Multicast,Anycast Routing, Overview of existing routing, Interior and Exterior RoutingProtocols.

Quality of services in IP Networks: Integrated and Differentiated Services,Integrated Services Architecture (ISA), Queueing Discipline, Random EarlyDetection, Differentiated Services. Protocols for QoS Support, Resource

Reservation : RSVP, MultiProtocol label Switching, Real Time TransportProtocol(RTP).

Compression and Future Network Applications: Overview of Information Theory,Information and Entropy, Coding, Lossless Compression- RunTime encodingtechnique, Facsimile Compression, Arithmetic Coding, String matchingalgorithm, Lossy Compression: Discrete Cosine Transform, WaveletCompression, JPEG Image Compression, MPEG Video Compression.

Text :1. William Stallings, High Speed Networks and Internets Performance

and Quality of Service, Pearson India 20052. William Stallings, Data and Communication, Prentice Hall India 19973. A.S Tanenbaum, Computer Networks, Prentice Hall India 1997



15/55

24

2-0-1-3RCC1006. ADVANCED COMPILER DESIGN

Introduction to Advanced Topics Review of compiler phases, Informal Compiler

Algorithm Notation, Symbol Table Structure, Intermediate Representations, RunTime Issues, Support for Polymorphic and Symbolic Languages.

Analysis -Control Flow Analysis, Data Flow Analysis, Dependency analysis,Alias analysis

Optimization Introduction, Review of Early Optimizations, RedundancyElimination, Loop Optimizations, Procedure Optimization

Machine Dependent tasks- Register Allocation, Local and Global InstructionScheduling, Advanced Topics in Code Scheduling, Low Level Optimizations,

Introduction to inter-procedural analysis and scheduling.

Text1. Steven Muchnick, Advanced Compiler Design Implementation, Morgan

Kauffmann Publishers, 19972. Aho A. V, Sethi R. and Ullman J. D. Compilers: Principles, Techniques

and Tools, Addison Wesley, 1986

References

1. Appel A. W. Modern Compiler Implementation in C, CambridgeUniversity Press, 2000.



16/55

25

0-0-2-2

RCC1101. SEMINAR

The student has to present a seminar in in one of the current topics in the stream ofspecialization. The student will undertake a detailed study based on currentpublished papers, journals, books on chosen subject, present the seminar andsubmit seminar report at the end of the semester.

Marks :

Seminar report evaluation : 25Seminar presentation : 25


17/55

26

0-0-2-1

RCC1102. LABORATORY

Experiments are based on topics covered in Advanced Compiler Design andexercises to be done on

Construction of Control Flow Graph from intermediate codeElimination of unreachable codeLiveness analysisDead code eliminationConversion of intermediate code to Static Single Assignment formConstant propagation on SSA form


18/55


19/55

28

SEMESTER II

2-0-1-3RCC2001. ADVANCED TOPICS IN ALGORITHMS

Review of basic concepts: Worst-case and average case analysis; Big oh, smalloh, omega and theta notations, solving recurrence equations. Overview of basicdata structures, Advanced data structures, e.g., binomial queues, fibonacci heaps,the union find data structure. Amortization, Self-adjusting and persistent datastructures. Applications and analysis. Lower bounds in structured models ofcomputation.

Overview of basic design paradigms such as incremental approach; divide andconquer, greedy paradigm; dynamic programming backtracking; branch andbound; pruning; transformations; preprocessing and case studies illustrating each

design methodologies with complete analysis of algorithms. Basics of randomizedalgorithms, their practical significance.

Advanced graph algorithms, matching, Network flow algorithms, label setting andlabel correcting algorithms, maximum and minimum flow algorithms,applications to OR/optimization.

Stringology, Pattern matching, BM algorithms, KMP algorithms, GeometricAlgorithms- Plane sweep algorithm, convex hull algorithm, Triangulation.Computational number theory, GCD algorithm, Primality tests, quadratic residues,applications to cryptography.

Lower bound theory, Information theoretic bounds. Adversary arguments, NPcompleteness, Basic techniques for proving NP completeness case studies.Approximate algorithms, Scheduling problems, set cover problem, Bin packingproblem, polynomial time approximate schemes.

Text:1. T.H. Cormen, C.E. Leiserson and R.L.Rivest, Introduction to algorithms,

Prentice-hall of India Private Limited, New Delhi, 2004.2. Gilles Brassard and Paul Braatley, Fundamentals of algorithms,

Prentice-hall of India Private Limited, New Delhi, 1997.3. Alfred V. Aho, John E. Hopcroft, and J.D. Ullman. The Design and

Analysisof Computer Algorithms. Pearson India.


20/55

29

Reference

1. E. Horowitz, and S. Sahni, Fundamentals of Computer Algorithms,Computer Science Press, Galgotia Publications.



21/55

30

2-0-1-3

RCC2002. ADVANCED DATA BASE MANAGEMENT SYSTEMS

Introduction of DBMS: Types of DBMS and their advantages and disadvantagesIntroduction of RDBMS, Types of relational query language, Normalization,Relation and semantic data models, Data dependencies, Synthesis of data baseschemas, Query processing and Query optimization. Database protection inRDBMS Database Integrity, Active and Real Time Databases- Inferences controland Auditing

Distributed Databases: concepts, structure, trade-offs, Homogeneous,Heterogeneous, Federated and Multi database System. Distributed schema design,query processing and optimization. Methods of data distribution fragmentation,replication, design & advance concepts of DDBMS

Concurrency control and Database Recovery: Transaction Processing withdatabases, ACID in depth, The success of Transaction Processing based on thestrict application of the ACID requirement, Transaction and Serializability ofschedules. Lock based and Non locking protocols. Multi level concurrency controlschemas, Concurrency control in replicated distributed databases. Commitprotocols and database recovery

Introduction to object oriented databases, Deductive databases. Performanceevaluation of database systems. An overview of:- Data warehousing ConceptsArchitecture, Dataflows, Tools & Technologies, Data Mining & OLAP, Spatial &

Temporal databases, Multimedia databases. Mobile Databases.

Text:1. Elmasri, Navathe, Fundamentals of Database Systems, Pearson

Education.2. Henry F. Korth, A Silberschatz, Database Concepts, Tata Mc Graw Hill.3. Thomas Conolly, Carolyn Begg, Database Systems, Pearson Education.

Reference

1. Alexis Leon, Mathews Leon, Database Management Systems. Vikas,2002

2. C.J.Date , An Introduction to DBMS, Narosa Publishing House.



22/55

31

LIST OF DEPARTMENT ELECTIVESFOR SEMESTER II

3-0-0-3

RCE2001. PARALLEL ALGORITHMS

Parallel computer. Need of parallel computers, models of computation, Analyzingalgorithms, expressing algorithms. Broadcast, All sums and selection algorithmson SIMD. Searching a sorted sequence EREW, CREW SMSIMD algorithms.Searching a random sequence SMSIMD, tree and Mesh interconnection supercomputers.

Sorting Sorting on a linear array, sorting on a mesh, sorting on EREW SIMDcomputer, MIMD enumeration sort, MIMD quick sort, sorting on other networks.Matrix Transposition, Mesh transpose, shuffle transpose, EREW transpose.

Matrix operations matrix- by matrix multiplications, mesh multiplications, cubemultiplication, Matrix by vector multiplication. Linear array multiplication, treemultiplications. Solving numerical problems, solving systems of linear equations-SIMD algorithms and MIMD algorithms.

Numerical problems finding roots of nonlinear equations SIMD and MIMDalgorithms, solving partial differential equations, computing eigen values.

Graph theoretical problems solving graph theoretical problems, computingconnectivity matrix, finding connected components, all pairs shortest path,

traversing combinatorial spaces, sequential tree traversals, Minimal alpha- Betatree , MIMD Alpha-Beta algorithms, parallel cut-off storage requirements, recenttrends and developments.

Text:1. S.G.Akl, Design and Analysis of parallel algorithms, Prentice--Hall

International Editions (Prentice--Hall, Inc. 1989).

References:1. S.G.Akl, Parallel Sorting algorithm, Academic Press, 19852. M.J .Quin, Parallel computing theory and practice, McGraw-Hill, New

York, 1994.3. S. Lakshmivarahan and S.K.Dhall, Analysis and design of parallel

algorithms Arithmetic & Matrix problems, by McGraw-Hill, New York,1990


23/55

32

4. V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to ParallelComputing, San Francisco: Benjamin Cummings / Addison Wesley, 2002



24/55


25/55

34

2-0-1-3

RCE2003. CRYPTOGRAPHY

Preliminaries : Origins of Cryptography Issues in Cryptography codes andCiphers review of complexity results Preliminary ideas of factoring andprimality testing gcd and its complexity review of finite fields and cyclicgroups.

Symmetric Key Cryptosystems - Block ciphers : affine Ciphers, Substitutionciphers, Vigenere, Hill Cipher DES, Feistel Ciphers and the problem of breakingthem, Congruences, Complete residue systems-Modular Arithmetic The fieldZ/pZ Eulers Theorem and Fermats Little theorem Eulers function Chinese Remainder Theorem.

Stream Ciphers : Information Theoretic considerations Linear feedback shiftregisters and associated results - Geffe Geneartor one way functions andTrapdoor Diffe Hellman Key Exchange Bit commitment using symmetric key.

Public key Cryptosystems : Discrete Logarithm, hash functions, RSA and itscorrectness Modular Exponentiations Miller Rabin Selfridge Primalitytesting El Gammal Crypto systems Authentication Digital Signatures Merkle Hellman knapsack Public Key Cipher

Factoring and other Topics : Pollard heuristic Pollard - 1 Algorithm,

Continued Fraction factoring Algorithm. Quadratic Sieve algorithm, NumberField Sieve, Zero knowledge proof idea recent developments.

Text:

1. William Stallings, Cryptography and Network Security, PHI

Reference:

1. A.J .Menezes, P. Van Oorschot and S. Vanstone, Handbook of AppliedCryptography, CRC Press

2. Koblitz. N, Course on Number Theory and Cryptography, SpringerVerlag, 1986.



26/55

35

3-0-0-3

RCE2004. PARALLEL COMPUTING

Introduction : Paradigms of parallel computing: Synchronous vector/array,SIMD, Systolic; Asynchronous MIMD, reduction paradigm.Hardware taxonomy : Flynns classifications, Handlers classifications.Software taxonomy : Kings taxonomy, SPMD.

Abstract parallel computational models : Combinational circuits Sortingnetwork, PRAM models, Interconnection RAMs. Parallelism approaches dataparallelism, control parallelismPerformance Metrices: Laws governing performance measurements. Metrices-speedups, efficiency, utilization, communication overheads, single/multipleprogram performances, benchmarks.

Parallel Processors: Taxonomy and topology shared memory multiprocessors,distributed memory networks. Processor organization static and dynamic interconnections. Embeddings and simulations.

Parallel Programming: Shared memory programming, distributed memoryprogramming, object oriented programming, data parallel programming,functional and data flow programming.

Scheduling and parallelization: Scheduling parallel programs. Loop scheduling.Parallelization of sequential programs. Parallel programming support

environments.

Text :

1. M.J . Quinn. Parallel Computing: Theory and Practice, Mc Graw Hill,New York, 1994.

2. T.G. Lewis and H. El.Rewini, Introduction to Parallel Computing,Prentice Hall, New Jersey, 1992.

3. T.G. Lewis. Parallel Programming : A Machine Independent Approach,IEEE Computer Society Press, Los Alamitos, 1994.



27/55


28/55

37

References :

1. J. Laszlo Michael, Computational Geometry and Computer Graphics inC++ , Prentice- Hall of India, 1999.



29/55


30/55


31/55


32/55

41

2-0-1-3RCE2008. DATA WAREHOUSING

Data Warehousing: Introduction to Data Warehousing: Evolution of Data

Warehousing, Data Warehousing concepts, Benefits of Data Warehousing,Comparison of OLTP and Data Warehousing, Problems of Data Warehousing.

Data Warehousing Architecture, Operational Data and Datastore, Load Manager,Warehouse Manager, Query Manager, Detailed Data, L ightly and Highlysummarised Data, Archive/Backup Data, Meta-Data, architecture model, 2-tier, 3-tier and 4-tier data warehouse, end user Access tools.

Data Warehousing Tools and Technology- Tools and Technologies: Extraction,cleaning and Transformation tools, Data Warehouse DBMS, Data WarehouseMeta-Data, Administration and management tools, operational vs. information

systems. OLAP & DSS support in data warehouse.

Distributed Data Warehouse- Types of Distributed Data Warehouses, Nature ofdevelopment Efforts, Distributed Data Warehouse Development, Building theWarehouse on multiple levels.

Types of Data Warehouses & Data Warehouse Design- Host based, single stage,LAN based, Multistage, stationary distributed & virtual data-warehouses. Datawarehousing Design: Designing Data warehouse Database, Database DesignMethodology for Data Warehouses, Data Warehousing design Using Oracle.

Overview of Data Mining and OLAP- Knowledge discovery : Knowledgediscovery through statistical techniques, Knowledge discovery through neuralnetworks, Fuzzy technology & genetic algorithms.

Text:

1. W.H.Inmon, Building the Data Warehouse, 3rdEdition, John Wiley &Sons.

2. W.H.Inmon, C.Kelly,Developing the Data Warehouse, John Wiley &Sons.

3. Thomas Connoly, Carolyn Begg-Database Systems-A practical approachto Design, Implementation and management 3rd Edition PearsonEducation

Reference:

1. W.H.Inmon, C.L.Gassey, Managing the Data Warehouse, John Wiley &Sons.


33/55


34/55


35/55


36/55


37/55

46

2. Mohammed Ali Mazidi; J anice Gillispie Mazidi The 8051Microcontroller and Embedded Systems; Pearson Education Asia 2002.

3. David E Simon, An Embedded software primer; Addison Wesley; 2000.4. Raymond J.A. Buhr; Donald L. Bailey; An Introduction To Real Time

Systems; Prentice Hall International; 1999.5. Rajkamal, Microcontrollers: Architecture, Programming, Interfacing andSystem Design, Pearson Education.



38/55

47

3-0-0-3

RCI2003. SOFTWARE PROJ ECT MANAGEMENT

Introduction to Software Project Management: Software development as a project;Stakeholders in software project; Software product, process, resources, quality,and cost; Objectives, issues, and problems relating to software projects.

Overview of Project Planning: Steps in project planning; Defining scope andobjectives; work breakdown structure; Time, cost, and resource estimation;Alternatives in planning

Project Evaluation: Strategic assessment; Technical assessment; Cost-benefitanalysis; Cash flow forecasting; Cost-benefit evaluation techniques; Break-evenanalysis; Risk evaluation

Selection of Appropriate Project Approach: Choosing development technologyand methodology; choice of process model; Rapid application development;Waterfall model; V-process model; Spiral model; Prototyping; Incrementaldelivery.

Software Effort Estimation Problem in software estimation; Effort estimationtechniques; Expert judgement; Estimation by analogy; Delphi technique;Algorithmic methods; Top-down and bottom-up estimation; Function pointanalysis; Object points; COCOMO model.

Activity Planning Network planning model; Activity-on-arrow network;Precedence network; Forward pass; Backward pass; Critical path; Slack and float.

Risk Analysis and Management Nature and categories of risk in softwaredevelopment; risk Identification; Risk assessment; Risk mitigation, monitoring,and management; Evaluating schedule risk using PERT.

Recourse Allocation Nature of project resources; Identifying resource requirementof activities; Allocating and scheduling resources; cost of resources; Standard,planned, and actual cost; Cost variance; time-cost trade-off.

Project Tracking and Control Measurement of physical and financial progress;Earned value analysis; Status reports; Milestone reports; Change control.

Contract Management Outsourcing of products and services; Types of contracts;Stages in contract placement; Terms of contract; Contract monitoring; Acceptancetesting


39/55


40/55

49

2-0-1-3RCI2004. .NET PROGRAMMING

.Net architecture, Namespheres, Assemblies, object oriented features, memory

management, interoperation with IOM, transaction in .NET, Structured exceptionhandling, code access security.

VB.NET

Similarities & differences with Visual Basic, windows focus, ADO.NET, workingwith databases, object oriented features.

ASP.NETSimilarities & difference with ASP, Architecture, web-form, development, XML,databases interface.

C++.NETSimilarities & differences with C/C++, Creating components, window four,menus, validation, database interface.

.NETSecurity framework, .NET performance counters, Managed / Unmanaged code,.NET configuration files.

Text1. A. Chakraborti et. al., Microsoft .NET framework, PHI, 2002

2.

M. Reynolds et. al., .NET Enterprise, Wrox/SPD, 20023. J. P. Hamilton, Object Oriented Programming with VB .NET, Oreilly,2002



41/55


42/55


43/55

52

0-0-0-2RCC2103. PROJ ECT - Part II

The student has to undertake an individual project work, submit a project report,

which will be evaluated by the Evaluation Committee.

Marks :

Project work & report evaluation : 50Presentation & Viva Voce : 50


44/55

53

SEMESTER II I

LIST OF DEPARTMENT ELECTIVES FOR SEMESTER III 3-0-0-3RCE3001. SOFTWARE TESTING

Introduction: What is software testing and why it is so hard?, Error, Fault, Failure,Incident, Test Cases, Testing Process, Limitations of Testing, No absolute proofof correctness, Overview of Graph Theory.

Functional Testing: Boundary Value Analysis, Equivalence Class Testing,Decision Table Based Testing, Cause Effect Graphing Technique.Structural Testing: Path testing, DD-Paths, Cyclomatic Complexity, Graph

Metrics, Data Flow Testing, Mutation testing.

Reducing the number of test cases: Prioritization guidelines, Priority category,Scheme, Risk Analysis, Regression Testing, Slice based testingTesting Activities: Unit Testing, Levels of Testing, Integration Testing, SystemTesting, Debugging, Domain Testing.

Object Oriented Testing: Issues in Object Oriented Testing, Class Testing, GUITesting, Object Oriented Integration and System Testing.

Testing web applications, testing mobile applications

Testing Tools: Static Testing Tools, Dynamic Testing Tools, Characteristics ofModern Tools.

Text:1. William Perry, Effective Methods for Software Testing, John Wiley &

Sons, New York, 1995.2. Cem Kaner, Jack Falk, Nguyen Quoc, Testing Computer Software,

Second Edition, Van Nostrand Reinhold, New York, 1993.3. Boris Beizer, Software Testing Techniques, Second Volume, Second

Edition, Van Nostrand Reinhold, New York, 1990.4. Louise Tamres, Software Testing, Pearson Education Asia, 2002Reference:1. Roger S. Pressman, Software Engineering A Practitioners Approach,

Fifth Edition, McGraw-Hill International Edition, New Delhi, 2001.2. Boris Beizer, Black-Box Testing Techniques for Functional Testing of

Software and Systems, John Wiley & Sons Inc., New York, 1995.


45/55


46/55

55

2-0-1-3

RCE3002. IMAGE PROCESSING

Introduction - digital image representation - fundamental steps in imageprocessing - elements of digital image processing systems - digital imagefundamentals - elements of visual perception - a simple image model - samplingand quantization - basic relationship between pixels image geometry - imagetransforms - introduction to Fourier transform discrete Fourier transform - someproperties of 2d-fourier transform (DFT)- other separable image transforms -hotelling transform

Image enhancement - point processing - spatial filtering - frequency domain -image restoration - degradation model - diagonalization of circulant and blockcirculant matrices - inverse filtering - least mean square filter

Image compression - image compression models - elements of information theory- error-free compression - lossy compression - image compression standards

Image reconstruction from projections - basics of projection - parallel beam andfan beam projection - method of generating projections - Fourier slice theorem -filtered back projection algorithms - testing back projection algorithms

Text:1. Rafael C., Gonzalez & Woods R.E., Digital Image Processing, Pearson

Education.

Reference:1. Rosenfeld A. & Kak A.C., Digital Picture Processing, Academic Press2. Jain A.K, Fundamentals of Digital Image Processing, Prentice Hall,

Eaglewood Cliffs, NJ3. Schalkoff R. J., Digital Image Processing and Computer Vision, John

Wiley4. Pratt W.K., Digital Image Processing, John Wiley



47/55

56

2-0-1-3RCE3003. MOBILE COMPUTING

Introduction to wireless, mobile and cellular mobile systems : Wireless

transmissions, signal propagation, multiplexing, modulation, spread spectrum,cellular mobile telephone systems, basic cellular system, analog and digitalcellular systems - Elements of cellular radio system design frequency reuse, cochannel interference, cell splitting.

Medium access control : Motivation specialized MAC, SDMA, FDMA, TDMA,CDMA, Frequency management and channel assignment fixed, non-fixedchannel assignment algorithms, Hand off and dropped calls-initiation of handoff,delaying, forced handoff, queuing handoff, power difference, mobile assisted cell-site and inter system handoff.

Mobile telecommunication standards, satellite and broadcast systems: GSM,DECT, TETRA, UMTS and IMT 2000, CTEO, LEO and MEO, Digital audio andvideo broadcasting, Wireless LANs IEEE 802.11, HIPERLAN, Bluetooth

Network support for mobile systems : Cellular analog, cellular digital switchingequipment, MTSO interconnection, mobile network layer-IP packet delivery,advertisement and discovery, registration, tunneling and encapsulation, reversetunneling, IPV6, DHCP, adhoc networks, Wireless ATM-WATM services,reference model, functions, radio access layer, handover, location management,addressing, mobile QoS, access point control protocol.

Mobile Transport and application layer protocol. Review of traditional TCP,Indirect TCP, Snooping TCP, mobile TCP, fast retransmit/fast recover,transmission/timeout freezing, selective retransmission, transaction oriented TCP,file systems, WWW, WAP

Text

1. JOCHEN SCHILLER, Mobile communication, Pearson Education AsiaPublications , 2000.

2. WILLIAM C.Y .Lee , Mobile Cellular Telecommunication, McGrawHill International Editions, 1995.



48/55

57

2-0-1-3

RCE3004. DATA MINING

Introduction, Data warehousing Multidimensional datamodel, OLAP operation,Warehouse schema Data Wareshousing architecture, warehouse server, Metadata,OLAP engine, Datawarehouse Backend Process. Data Mining Data MiningTasks Knowledge Discovery DataBase Vs Data mining, Datamining Issues,DBMS Vs Data mining. Data mining techniques, Other mining problems, Issuesand challenges in datamining, datamining application areas, Dataminingapplications.

Classification statistical based algorithm, Distance based algorithm, DecisionTree Based AlgorithmAssociation Rules Introduction, Methods to discover association rules, A Priori

algorithm, Partition algorithm, Pincer search algorithm, Dynamic Itemsetcounting algorithm, FP-tree growth algorithm, Discussion on different algorithms,Incremental algorithm, Boder algorithm, Generalized association rule. Clusteringtechniques- Hierarchical algorithm, Partitioning algorithm, Clustering largedatabases, Comparison of different clustering algorithms

Decision trees Introduction, Tree construction Principle, Best split, splittingIndices, Splitting criteria, Decision tree constructive algorithms, CART, ID3, C4.5Rainforest, Approximate methods, CLOUDS, BOAT, Pruning techniques,Integrating of pruning and construction.Neural network, Learning in neural network, unsupervised learning, Data mining

using Neural Networks, Genetic algorithm, Rough sets, support vector machines.Web Mining. Web content mining- web structure mining, web usage mining

Temporal and Spatial Data Mining Introduction, What is Temporal Datamining? Various Temporal association rules, sequence mining, The GSPalgorithm, SPADE, SPIRIT, WUM, Episode discovery, Event Prediction problem,Time-series analysis, spatial association rules, spatial classifications, spatialmining, spatial Mining tasks, spatial clustering algorithms, spatial trends.

Books :1. Margaret H Dunham, Data Mining Introductory and Advanced Topics,

Pearson India, 2005.2. Arun K. Pujari, Data Mining Techniques, Universities Press 2001.3. Alex Berson, Stephen smith & Kurt Thearling, Building Data Mining

Applications for CRM, Tata Mcgraw Hill.


49/55

58

References:1. Richard J Roiger, Michael W Geatz, Data Mining A Tutorial Based

Primer, Pearson India 2005



50/55


51/55

60

2-0-1-3

RCE3006. DISTRIBUTED COMPUTING

Distributed Systems: Characterization of Distributed Systems, System Models-architectural and fundamental models, Networking and Inter networking, InterProcess communication.

Distributed Objects and Remote Invocation, RPC, Processes and threads,Security, Digital Signatures, Cryptography pragmatics, Distributed File systems.

Name Services and Domain Name System, Directory and Discovery Services,Synchronizing physical clocks, logical time and logical clocks, Distributed MutualExclusion, Elections.

Transactions and Concurrency Control, Distributed Transactions, DistributedDeadlocks, Transaction Recovery, Fault-tolerant Services, Distributed SharedMemory, CORBA Case Study.

Text1. Coulouris G., Dollimore J. & Kindberg T., "Distributed Systems Concepts

And Design", Pearson Education2. Tanenbaum A.S, Maarten V.S., Distributed Systems Principles and

Paradigms, PHI

References1. Chow R. & Johnson T., "Distributed Operating Systems and Algorithms",Addison Wesley

2. Tanenbaum A. S., "Distributed Operating Systems", PHI



52/55


53/55


54/55

63

0-0-14-4RCC3103. THESIS PREL IMENARY

The main objective of the Thesis is to provide an opportunity to each student

to do an independent study and research on the area of specialization. The studentis required to explore in depth and develop a topic of his/her own choice, whichadds significantly to the body of knowledge existing in the relevant field. Thestudent has to undertake and complete preliminary work on the stream ofspecialization during the semester. The fourth semester Thesis shall be anextension of this work in the same area. The student has to present Seminars andsubmit an interim Thesis Report. The Seminar and Report shall be evaluated bythe Evaluation Committee. The first Seminar would highlight the topic,objectives, methodology and expected results. The first Seminar shall beconducted in the first half of this semester. The second Seminar is presentation ofthe interim Thesis Report of the work they have completed and scope of work

which is to be accomplished in the fourth semester.

Marks :

Evaluation of the Thesis -preliminary work by the guide : 100Evaluation of the Thesis -preliminary work by theEvaluation Committee : 100


55/55

SEMESTER IV0-0-29-12

RCC4101. THESIS

The student has to continue the Thesis work identified In the Third semester .There shall be two seminars (Mid term evaluation on the progress of the workand the Pre-submission seminar to assess the quality and quantum of the work).At least one technical paper is to prepared for possible publication in Journals /Conferences. The final evaluation of the Thesis shall be an External Evaluation.The marks for the Thesis may be proportionately distributed between External andInternal evaluation as follows.

Marks :

Internal Evaluation of the Thesis work by the Guide : 200

Internal Evaluation of the Thesis work by theEvaluation Committee : 200Final Evaluation of the Thesis work by theInternal & External Examiners (Evaluation ofThesis : 100 +Viva Voce : 100) : 200

Documents

Mtech Cs Syllabus