Software Engineering

CS183

L T P 3 0 2

Credits 4

The software crisis, principles of software engineering, programming-in-the-small vs. programming-in-the-large, software lifecycle, the waterfall model, variations, and prototyping approaches, relationship to lifecycle, project planning, SRS( Software requirement specification). Design for reuse, design for change, design notations, design evaluation and validation, coding and testing, software maintenance and reliability.

Books and References 1. 2. Shari Lawrence Pfleeger, Software Engineering, Theory and Practice, Prentice-Hall 1998. Merlin Dorfman and Richard H. Thayer, Software Engineering, Edited , IEEE Computer Society Press, 1997. Pankaj Jalote, Introduction to Software Engineering, .

Advanced Computer Network CS184 L T P 3 Prerequisite: Computer Network IPv6, Next Generation IP protocol, Wireless Networks, GSM, CDMA, Mobility in networks, Mobile IP, Mobile TCP, TCP extensions for high speed network, IP multicasting, BSD Sockets, TCP/IP programming. Books and References: 0 2 Credits 4

1. C.E.Perkins, B.Woolf and S.R.Alpert, Mobile IP, Design Principles and Practices, 2. 3. 4.
Addision Wesley, 1997 Schiller, Mobile Communication, Tanenbaum, Computer Networks, Pearson Education Stevens, Network Programming, Advanced Computer Architecture

CS185

L T P 3 0 2

Credits 4

Prerequisite: Computer Organization, Computer Architecture. SIMD, MIMD models of parallel processing, classification of parallel computing structure, High performance memory system, pipelined computer systems, processor architecture for parallel processing, vector Processing, Risk processors, distributed memory/shared architecture. Books and References:

1. Kai Hwang, Advanced Computer Architecture, McGraw-Hill. 2. Hwang and Briggs, Computer Architecture and Parallel Processing, McGraw Hill.

Advance Software Engineering

CS186

L T P 3 0 2

Credits 4

Prerequisite: Software Engineering. Contents: Software project management, metric and management, software configuration management, software risk management, requirements engineering, software quality assurance, software reliability models, object oriented design, Jakson method for design, case tools and technology, clean room method for software development, real time software specification and design. Books and References:

1. Sommerville, Software Engg. Principles and Practices,

2. Pressman, Software Engg, . 3. Pankaj Jalote, Introduction to Software Engineering,

Multimedia Systems

CS189

L T P 3 0 2

Credits 4

Introduction to Multimedia, Multimedia Objects, Multimedia in business and work. Multimedia hardware, Memory & Storage devices, Communication devices, Multimedia software s, presentation tools, tools for object generations, video, sound, image capturing, authoring tools, card and page based authoring tools. Text, Sound MIDI, Digital environment Audio & Video Capture. Audio, audio file formats, MIDI under windows

Huffman Coding, Shannon Fano Algorithm, Huffman Algorithms, Adaptive Coding, Arithmetic Coding Higher Order Modeling. Finite Context Modeling, Dictionary based Compression, Sliding Window Compression, LZ77, LZW compression, Compression, Compression ratio loss less & lossy compression. Digital Audio concepts, Sampling Variables, Loss less compression of sound, loss compression & silence compression. Multiple monitors, bitmaps, Vector drawing, lossy graphic compression, image file formatic animations Images standards, JPEG Compression, Zig Zag Coding. Video representation, Colors, Video Compression, MPEG standards, MHEG Standard recent development in Multimedia. Books & References :

1. 2. 3. 4. 5. 6. 7. 8.

Tay Vaughan Multimedia, Making IT Work Osborne McGraw Hill. Buford Multimedia Systems Addison Wesley. Agrawal & Tiwari Multimedia Systems Excel. Mark Nelson Data Compression Book BPB. David Hillman Multimedia technology and Applications Galgotia Publications. Rosch Multimedia Bible Sams Publishing. Sleinreitz Multimedia System Addison Wesley. James E Skuman Multimedia in Action Vikas. Real Time System

CS190

L T P 4 0 0

Credits 4

Introduction: Concept of Real Time System, Issues in real time computing, Performance measures of Real Time System, Issues in Real Time Computing, Performance measures of Real time Systems, Real Time Application. Task Assignment and Scheduling: Different task model, Scheduling hierarchy, offline vs Online Scheduling, Clock Drives. Model of Real Time System: Processor, resources, temporal parameter, Periodic Task Model, Sporadic Task Model, Precedence Constraints and Data Dependencies, Scheduling hierarchy Scheduling of Periodic Task: Assumptions, fixed versus dynamic priority algorithms, schedulability test for fixed priority task with arbitrary deadlines. Scheduling of Aperiodic and Sporadic Tasks: Assumptions and approaches, deferrable, sporadic servers, slack stealing in deadline driven and fixed priority systems. Two level scheme for integrated scheduling, Scheduling for applications having flexible constrains. Resources and Resource Access Control: Assumptions on resources and their usage, resource contention, resource access control(Priority Ceiling Protocol, Priority Inheritance protocol, Slack Based Priority Ceiling Protocol, Peremption Ceiling Protocol). Multi Processor Scheduling: Model of multi processor and distributed systems, Scheduling algorithms for end to end periodic tasks in homogeneous/heterogeneous systems, Predictability and validation of dynamic multiprocessor system. Real time Communication: Model of real time Communication, Priority base service For switched network, Weighted Round Robin Service, Medium access Control Protocol, Real Time Protocol. Books and References:

1. Jane .W. S. Liu Real Time Systems Pearson Education. 2. Krishna .C.M Real Time Systems Mc-Graw Hill Publication.

VLSI Design CS193 L T P 4 0 0 Credits 4

This course presents techniques and practices used to design CMOS digital VLSI circuits. The course covers MOS transistor fundamentals, circuit fabrication, design rules, nMOS,

CMOS, switched logic, and precharge logic implementation. Both nMOS and CMOS technology will be covered. In addition, circuit characterization and testing will be presented along with a system level design example. Each student is expected to complete a design project.

Books and References:

1. Wayne Wolf, Modern VLSI Design: Systems on Silicon, 2/e, 1998, Prentice Hall,
ISBN 0-13-989690-2 Compiler Techniques CS194 L T P 3 0 2 Credits 4

Introduction: Definition , functions of Compiler in Linux / Unix / TC etc environments, other associated terms e.g. Text formatter, Text Editors, Phases and Passes, FSM & RE s and their application to Lexical Analysis, Implementation of Lexical Analyzers, Lexical- Analyzer Generator, Lex Compiler, Formal Grammar and their application to Syntax Analysis, BNF Notation, YACC. The Syntactic specification of Languages: CFG, Derivation and Parse Trees, Capabilities of CFG. Basic Parsing Techniques: Parsers, Shift Reduce Parsing, Operator precedence parsing, top down Parsing, Predictive Parsers.

Automatic Construction of efficient Parsers: LR Parsers, the canonical collection of LR(0) items, constructing SLR Parsing Tables, Constructing canonical LR Parsing tables and LALR parsing tables , An Automatic Parser Generator, Implementation of LR parsing Tables, Constructing LALR sets of items.

Syntax Directed Translation: Syntax directed Translation Schemes, Implementation of Syntax directed translators, Intermediate Code, Postfix notation, Parse Trees and Syntax Trees, Three address Code, Quadruple & Triples, Translation of Assignment Statements, Boolean expressions, Control Statements, Postfix Translation, Translation with a Top Down Parser, Array references in Arithmetic expressions , Procedure Calls, Declarations and Case statements Translations.

Symbol Tables: Data Structure for Symbol Tables, representing scope information. Run Time Administration: Implementation of simple Stack allocation scheme, storage allocation in block structured language. Error detection and Recovery: Lexical phase errors,syntax phase errors,semantic errors Code Optimization: Loop optimization, the DAG representation of basic blocks, value

numbers and Algebraic Laws, Global Data Flow Analysis. Books and References:

1. Aho,Ullman & Sethi, Compiler Design , Addison Wesley 2. D.M.Dhamdhere, Compiler Construction Principles & Practice ,
Macmillan India Ltd.

3. Holub, Compiler Design in C , PHI.

Unix Network Programming

CS196

L T P 2 0 4

Credits 4

Client/Server Model, Peer-to-Peer Model, overview of IPv4 and IPv6, TCP and UDP, Socket programming, Multiplexing I/O, Encapsulation, Unix Domain Protocols, Daemon Processes, super server, broadcasting and Multicasting, Threaded network programming, Raw Socket, HTTP Server Design. Books and References:

1. W. Richard Stevens, UNIX Network Programming," Volume 1, second edition,

Prentice Hall. ISBN #0-13-490012-X

2. Douglas Comer, Internetworking with TCP/IP, Volume I, II & III, Prentice Hall
Advanced Data Structure & File System

CS197

L T P

Credits

4 Prerequisite: Data Structures Contents:

Arrays, Linked Lists, Stack, Queue, Dqueue, Priority Queue, Tree, Binary Search Tree, Heap Tree, Threaded Tree, Fibonacci Tree, Tree Traversal, Binomial Tree, B, B+ Tree, AVL Tree, Graphs, Graph Traversal, Spanning Trees, Shortest Path, Hashing. Books and References:

1. 2. 3. 4.

Horowitz Sahani, Fundamentals of Data Structures, Galgotia Publication Cormen, Introduction to Algorithms, McGraw Hill Tanenbaum, Data Structures using C and C++, PHI Jean-Paul Tremblay, Sorenson, An Introduction to Data Structures with Applications, McGraw Hill Advanced Database Systems

CS198

L T P 4 0 0

Credits 4

object-relational databases, active databases, and distributed databases. Topics covered include object-relational type extension, active rules and their design, distributed database design, distributed query processing and optimization, distributed concurrency control, and multidatabases. An overview of other modern database technologies, such as parallel databases, multimedia databases, spatial and temporal databases, data warehousing and data mining, deductive databases, and uncertainty in databases, is also given. Books and references: 1. Carlo Zaniolo, et al., Advanced Database Systems, Morgan Kaufmann Publishers, Inc., 1997 2. M. T. Ozsu and P. Valduriez, Principles of Distributed Database Systems, 2nd Ed., Prentice Hall, Inc., 1999 3. M. Stonebraker, Object-Relational DBMSs, 2nd Ed., Morgan Karfmann Publishers, Inc., 1999

Genetic Algorithms and Neural Networks CS199 L T P 4 0 0 Credits 4

An Overview of Combinatorial Optimization. An Introduction to Genetic Algorithms, Theoretical Foundations of Genetic Algorithms, Genetic Algorithms in Engineering and Optimization, Genetic Algorithms in Natural Evolution, Simulated Annealing and Tabu Search, Artificial Neural Networks, Evolving Neural Networks Implementing Genetic Algorithms: GALib, Genetic Algorithm Optimization Toolbox (GAOT) under Matlab. Books and references:

1. Goldberg, Genetic Algorithms, Addison Wesley, 1989, ISBN 0-201-15767-5

2. Golden, Mathematical Methods for Neural Network Analysis and Design, MIT Press, 1996 Mitchell, An Introduction to Genetic Algorithms, MIT Press, 1998 (paper) Functional Programming

3.

CS282

L T P 3 0 2

Credits 4

Principles of functional programming: expressions, evaluations, functions, and types. Type definitions and built-in types: numbers, characters, strings and lists. Basic operations on lists, including map, fold and filter, together with their algebraic properties. Recursive definitions and structural induction. Simple program calculation. Infinite lists and their uses. Further data structures: binary trees, general trees. Use of trees for representing sets and symbolic data. Normal order reduction and lazy evaluation. Simple cost models for functional programs; time and space complexity. Books and References:

1.

Simon Thompson, Haskell: The Craft of Functional Programming, SECOND EDITION, Addison Wesley, 1999. ISBN: 0-201-34275-8. H. Conrad Cunningham. Notes on Functional Programming with Gofer. Technical Report UMCIS-1995-01. Mark P. Jones and John C. Peterson. Hugs 98, A Functional Programming System Based on Haskell 98, User Manual Manual.

2.

3.

Web Technology

CS283

L T P 3 0 2

Credits 4

This is an introductory course into the key technology utilized on the World Wide Web. It introduces the learner to HTML & Web Page design, programming in JavaScript, client vs. server side computing, VBScript/ASP, Perl, multimedia web pages, and web servers. Books And References: 1. by Harvey M. Deitel, Paul J. Deitel and T. R. Nieto, Internet & World Wide Web How to Program, 2nd edition, Prentice Hall, ISBN #: 0130308978 Patrick Carey, Creating Web Pages with HTML, 3rd Edition, ISBN #: 0619101148

2.

Distributed Systems

CS284

L T P 3 0 2

Credits 4

Prerequisite: Networking, Operating Systems. Contents: Distributed System Concepts, Communication, Distributed Models, Invocation Semantics, Remote Procedure Calls, Naming, File System, Security, Concurrency control and recovery, local area network, distributed languages and communication primitives, case studies of distributed systems. Books and References:

1. G. Couloris, Distributed System, Concept & Design, Addision Wesley 1994. 2. Tanenbaum, Distributed Systems, PHI 3. P. K. Sinha, Distributed Operating Systems, PHI.

Introduction to Geographic Information Systems (GIS)

CS285

L T P 4 0 0

Credits 4

Introduction of a GIS: The Success with which a GIS can be used, Geographic Data, GIS vs. CAD vs. DBMS vs. computer mapping, Land Information Systems, Why use a GIS? Who uses a GIS? Applications of GIS Remote Sensing: History of Remote Sensing, Remote Sensing Resolutions, Remote Sensing Sensors, Steps Used to Analyse Remotely Sensed Data, Applications of Remote Sensing to GIS Data Input and Output: Data Entered into a GIS, Methods of Data Input, GIS Output. Data Quality: components of Data quality, Sources of Error Data Management: approaches to database management, Classic data models Analysis of Spatial Data: Cartographic Modeling, Divisions of GIS Functions, Maintenance and Analysis of Spatial Data, Maintenance and Analysis of NonSpatial Data, Integrated Analysis of Spatial and Attribute Data, Output Formatting, Phases in GIS Implementation. Electronic Commerce CS286 L T P 3 0 2 Credits 4

The growth of the Internet continues to have a tremendous influence on business. Companies and organizations of all types and sizes are rethinking their strategies and how they run their operations. This new course in the Temple E-Marketing program challenges students to explore the realities and implications of e-commerce from a marketer's perspective. Business-to-consumer (B2C) and business-to-business (B2B) e-commerce markets are examined. The course introduces students to a wide range of electronic commerce issues for marketers, as a foundation for continual learning in the dynamic ecommerce environment. Books and References:

1. Ward Hanson, Principles of Internet Marketing, SouthWestern Publishing, 2000 2. Philip Evans and Thomas Wurster, Blown to Bits: How the New Economics of
Information Transforms Strategy, Harvard Business School Press, 2000. 3. Stephen Bradley and Richard Nolan, Sense and Respond: Capturing Value in the Network Era, Harvard Business School Press, 1998.

4. 5.

Christina Haylock and Len Muscarella, Net Success, Adams Media, 1999 Carl Shapiro and Hal Varian, Information Rules: A Strategic Guide to the Network Economy, Harvard Business School Press, 1999 Mobile Computing

CS287

L T P 4 0 0

Credits 4

Issues in Mobile Computing, Overview of wireless Telephony, IEEE 802.11 & Blue Tooth, Wireless Multiple access protocols, channel Allocation in cellular systems. Data Management Issues, data replication for mobile computers, adaptive Clustering for Mobile Wireless networks. Distributed location Management, pointer forwarding strategies, Energy Efficient Indexing on air, Energy Indexing for wireless broadcast data, Mobile IP, TCP Over wireless. Mobile Agents Computing, Security and fault tolerance, transaction processing in Mobile computing environment. Ad hoc network, Routing Protocol, Global State Routing (GSR), Dynamic State Routing (DSR), Fisheye State Routing (FSR), Ad hoc On-Demand Distance Vector (AODV), Destination Sequenced Distance Vector Routing (DSDV). Data Ware Housing and Mining

CS288

L T P 4 0 0

Credits 4

Foundation: Introduction to DATA Warehousing. Client/Server Computing model & Data Warehousing. Parallel processors & Cluster Systems. Distributed DBMS implementations. Client/Server RDBMS Solutions. Data Warehousing: Data Warehousing Components. Building a Data Warehouse. Mapping the Data Warehousing to a Multiprocessor Architecture. DBMS Schemas for Decision Support. Data Extraction, cleanup & Transformation Tools. Metadata. Business Analysis: Reporting & Query Tools & Applications. On line Analytical Processing (OLAP). Patterns & Models. Statistics. Artificial Intelligence.

Data Mining: Introduction to Data Mining. Decision Trees. Neural Networks. Nearest Neighbor & Clustering. Genetic Algorithms. Rule Induction. Selecting & Using the Right Technique. Data visualization & Overall Perspective. Data Visualization. Putting it All Together. Appendices: A : Data Visualization. B : Big Data-Better Returns : Leveraging Your Hidden Data Assets to Improve ROI. C : Dr. E.F. Codd s 12 Guidelines for OLAP. D : Mistakes for Data warehousing Managers to Avoid. Books and References :

1. Berson, Data Warehousing, Data Mining & OLAP . 2. Mallach, Data Warehousing System , (McGraw Hill).
Distributed Operating Systems

CS289

L T P 4 0 0

Credits 4

Monolithic kernel, layered systems, virtual machines. Process based models and client server model. The micro-kernel based client-server approach. Interprocess communication and Remote Procedure Call. Tasks and Threads. Examples from LINUX, Solaris 2 and Windows NT. Resource allocation, failure-recovery and deadlock in distributed systems. Requirements for protection and security in distributed systems. Issues in the design of distributed file systems: naming, transparency, update semantics and fault resilience. Use of the Virtual File System layer. Examples of distributed systems including Sun NFS, and the Coda files system. Design of the server file system. Example systems: NTFS, Unix ext2 and ext3. The Common Object Request Broker Architecture and Microsoft DCOM models and software and their relationship to Operating Systems.

Books and References:

1.

Tanenbaum, A. S. and Van Steen, M. Distributed Systems Principles and Paradigms, (ISBN 0-13-088893-1), Prentice Hall 2002. Bacon, J., Concurrent Systems, 2nd Edition, (ISBN 0-201-177-676), Addison Wesley 1998. Silberschatz, A., Galvin, P. and Gagne, G., Applied Operating Systems Concepts, 1st Edition, (ISBN 0-471-36508-4), Wiley 2000..

2.

3.

4.

Coulouris, G. et al, Distributed Systems: Concepts and Design, 3rd Edition, (ISBN 0-201-61918-0), Addison Wesley 2001.

Parallel Computing

CS290

L T P 4 0 0

Credits 4

Computational demands, advantages of parallel systems. Flynn s classification, controlled parallelism and scalability. Topologies: Mesh, binary tree, Hyper tree, Cube Connected cycles, shuffle-Connected Exchange; Uniform Memory Access (UMA & Non uniform Memory Access (NUMA) Multi processor System. PARAM Model of Parallel Computation, PARAM Algorithms; Parallel Reductions, Prefix sum, List Ranking, Merging of Two Sorted List. Mapping and Scheduling; mapping of Data from Topology to other (Ring to 2-D Mesh, Binomial trees to 2-D mesh, Rings & mesh into 2-D Mesh, Ring & Mesh into Hypercubes), Load balancing, Static scheduling on UMA multi processor systems. Applications of parallel computing: Matrix Multiplication, Sorting (bitonic Merge sort, parallel quick sort, hyper quick sort), Searching a Graph (P-depth search, Breadth-Depth Search, Breath first search) , parallel Brach and bound algorithms Books and References:

1. Michel J. Quinn, Parallel Computing: Theory and Practice, McGraw-Hill 2. Kai Hwang, Advanced Computer Architecture, McGraw-Hill.
Fault Tolerant Computing

CS293

L T P 4 0 0

Credits 4

Definitions of fault tolerance, fault classification, fault tolerant attributes and system structure. Information redundancy, hardware redundancy, and time redundancy. Reliability and availability models: (Combinatorial techniques, Fault-Tree models, Markov models), Performability Models. Case studies for fault-tolerant systems. Software

fault-tolerant models. Fault tolerant networks for Shared bus and Shared memory Architecture. Security, fault tolerance in wireless/mobile networks and Internet Books and References :

1. D.K. Pradhan, Fault-Tolerant Computer System Design, 2003 2. B.W.Johnson, Design and Analysis of Fault-Tolerant Digital Systems, AddisonWesley, 1989

3. D.K. Pradhan, Fault-Tolerant Computing, Theory and Techniques, Volumes I and II

Prentice Hall, 1986

4. D.P.Siewiorek and R.S.Swartz, Reliable Computer Systems: Design and Evaluation,

Digital Press, 1992

5. K.S.Trivedi, Probability and Statistics with Reliability, Queueing and Computer

Science Application, Prentice Hall, 1982. Distributed Database Systems CS295 L T P 4 0 0 Credits 4

Distributed and parallel databases concepts autonomy, distribution, and heterogeneity. Client/server, parallel and distributed architectures. Design strategies. Horizontal, vertical and hybrid fragmentation. Resource allocation. Transaction model, serialization and recovery. Concurrency control, Deadlock management and Distributed deadlock, reliability and availability, load balancing, Schema translation & Integration, multi databases and multi-dimensional indices. Books and References : 1. Silberschatz, Abraham, Henry F. Korth, and S. Sudarshan. Database Systems Concepts, 4/e., McGraw-Hill Publishers. Copyright 2001. ISBN 0-07-228363-7. 2. Ozsu, M. Tamer and Patrick Valduriez Principles of Distributed Database Systems, 2/e, Prentice Hall Publishers. Copyright 1999. ISBN 0-13-659707-6.

Java Based Distributed Object Systems CS296 L T P 3 0 2 Credits 4

Characterization of Distributed Systems, System Models (Architectural and Fundamental Models), Distributed Objects and Remote Invocation (Remote Procedure Calling, Events & Notifications, Java RMI Case Study). Java Beans (Session Beans and Entity Beans). Transaction processing, Model Driven Architecture and its application to EJB applications Books and References:

1.George Coulouris, Jean Dollimore, Tim Kindberg, Distributed Systems: Concepts and Design, Addison Wesley Longman, ISBN: 0-201-61918-0, 2001, 3rd edition. 2.Douglas Schmidt, Michael Stal, Hans Rohnert, Frank Buschmann, PatternOriented Software Architecture, Volume 2: Patterns for Concurrent and Networked Objects, John Wiley & Sons, 2nd edition Vol 2 (September 25, 2000), ISBN 0471606952. 3.Herbert Schildt, Java 2: The Complete Reference, McGraw Hill Osborne, 5th Edition. ISBN: 0072224207 4.Vlada Matena, Beth Stearns, Enterprise JavaBeans[tm] Technology - Applying Enteprise JavaBeans: Component-Based Development For The J2EE[tm] Platform.

Parallel Algorithms CS297 L T P 4 0 0 Credits 4

Introduction to parallel and distributed computing, models of parallel computers, parallel programming models. Design methodology for parallel algorithms Performance metrics, execution time, speedup, efficiency, cost, and scalability, efficiency and cost effectiveness. Sorting on parallel computers, sorting networks, bubble sort, quick sort and other sorting algorithms, Graph algorithms, minimum cost spanning tree, single source shortest paths, all pairs shortest paths, and algorithms for sparse graphs. Mapping matrices on processors, matrix transposition, matrix vector multiplication, and matrix multiplication, solving systems of linear equations.

Books and References:

1. Vipin Kumar, Ananth Grama, Anshul Gupta, George Karypis, Introduction to Parallel 2.
Computing, Design and Analysis of Algorithms, The Benjamin/Cummings Publishing Co., Inc. 1994 Michael queen, Parallel Computing, McGraw-Hill