Christ University Hosur Road, Bangalore- 29 Syllabus.pdf · MCS243A OOAD Using UML 04 100 03 MCS243B Network Security MCS251 Java Programming Lab 04 100 02 MCS252 RDBMS Project Lab

Christ University, Bangalore, India

Christ University

Hosur Road, Bangalore- 29

Postgraduate Department of Computer Science

Proposed Syllabus forM.Sc Computer Science

Syllabus 2011 M.Sc Computer Science


Credit System for M.Sc Computer Science

SubjectSemesters-No.of hours (credits) Hour

sCredit

sMarks

I II III IV

Theory Papers

24(18) 20(15) 24(18) 68 51 1700

Practical Papers

08(04) 12(06) 08(04) 28 14 700

Industry Project

30(06) 30 6 300

Seminar 2 2 - 50

Holistic Education

01(01) 01(01) 02 02

Total 33(23) 35(22) 32(22) 30(06) 130 73Marks 800 850 800 300 2750



Course Structure

I SEMESTER

PaperCode

PaperHours per

WeekMarks Credits

MCS131 Discrete mathematics 04 100 03

MCS132Advaced Database Management System

04 100 03

MCS133 Advanced Data Structures 04 100 03

MCS134Object Oriented Programming Using C++

04 100 03

MCS135Digital Logic and Assembly language programming

04 100 03

MCS136Data Communication & Networking

04 100 03

MCS151 Data Structures Lab using C 04 100 02MCS152 C++ Lab 04 100 02

Total 32 800 22

II SEMESTER

PaperCode

PaperHours per

WeekMarks Credits

MCS231 Computer Architecture 04 100 03MCS232 Java Programming 04 100 03

MCS241A.NET Technologies 04

100 03

MCS241B Web TechnologiesMCS242A Software Architecture

04 100 03MCS242B TCP/IPMCS243A OOAD Using UML

04 100 03MCS243B Network SecurityMCS251 Java Programming Lab 04 100 02MCS252 RDBMS Project Lab 04 100 02

MCS253Computer Architecture Project Lab

04 100 02

MCS271 Seminar 02 50 -Total 34 850 21



III SEMESTER

PaperCode

PaperHours per

WeekMarks Credits

MCS331 Unix Operating System 04 100 03MCS332 Compiler Design 04 100 03

MCS333Artificial Intelligence & Expert Systems

04 100 03

MCS334Data Warehousing and Data Mining

04 10003

MCS335 Computer Graphics 04 100 03MCS341A Multimedia & applications

04 100 03MCS341B Wireless and Mobile NetworksMCS351 Unix Lab 04 100 02MCS352 Specialization Project Lab 04 100 02

Total 32 800 22

IV SEMESTER

Paper Code

Paper Hours per Week

Marks Credits

MCS451 *Industry Project 30 300 6

* With CIA and ESE♦ Total Marks: 2750♦ Total Credits: 73



QUESTION PAPER PATTERN FOR ALL COMPUTER SCIENCE PAPERS

• Question paper has to be set for the total marks of 100• Examination duration is 3 hours• The syllabus is divided in to five major units.• From each major unit 2 full questions with internal choice (to select one)

has to be set.• Each full question carries 20 marks• Maximum of 3 sub divisions can be there in each full question



MCS131 Discrete Mathematics

Total teaching Hours/Semester: 60 No of Lecture Hours/Week: 04

Unit I. (8)LOGIC : Statements; Logical Connectives, Implications, Tautology and Contradiction; Equivalence Formulas; Predicates, Quantifiers, Negations.Mathematical Induction and related examples.

Unit II. (10)Definition and types of relations, Representing relations using matrices and digraphs, Equivalence relations, Partial Orderings, Hasse diagrams, Lattices as partially ordered sets, Basic properties of Lattices, Boolean Algebra – Definition and examples.

Unit III. (12)Introduction to Group Theory, Abelian Groups, Properties of Groups, Subgroups, Condition for a subset to be a subgroup, Order of an element, Cyclic Groups, Cosets and Lagrange’s Theorem and its applications

Unit IV. (18)Introduction to graph theory, types of graphs, Basic terminology, Subgraphs, Graph isomorphism, Connectedness in simple graphs, Paths and cycles in graphs and digraphs, Euler and Hamiltonian Paths, Necessary and sufficient conditions for Euler circuits and paths in simple, undirected graphs.Hamiltonicity: Ore’s Theorem (page 586), noting the complexity of hamiltonicity, Traveling Salesman’s Problem, Nearest neighbor method of finding the minimum weighted Hamiltonian cycle.

Unit V. (12)Distance in graphs : Finding Eccentricity, Radius, Diameter, Center, Periphery.Planarity in graphs, Euler’s Polyhedron formula, Kuratowski’s theorem (statement only)Weighted graphs, Dijkstra’s algorithm to find shortest distance path in a graphTrees, Rooted trees, Binary trees, Spanning trees, Minimum spanning trees, Kruskal’s and Prim’s Algorithm to find minimum spanning trees.

Text Books:1. I.N.Herstein, Topics in Algebra, John Wiley & Sons, Reprint, 2006.2. Rosen, Kenneth H, Discrete Mathematics and Its Applications, WCB/McGraw-

Hill, 5th Edition, 1999.3. C. L. Liu, Elements of Discrete Mathematics, Tata McGraw-Hill, 2nd edition,

2000.

Reference Books:1. J.P. Tremblay and R.P.Manohar, Discrete Mathematical Structures with

applications to Computer Science, McGraw-Hill, Reprint, 2006.2. D.B.West, Introduction to Graph Theory, Pearson Education Asia, 2nd edition,

2002

Syllabus 2011 M.Sc Computer Science 6


MCS132 Advanced Database Management System


Unit I. (13)Introduction Data Base system application, Purpose of DB systems-relational Databases-DB Design-object based and semi structured Databases-DB Architecture, Data Base Design and The E-R Data Model:Overview of the design process, ER Model, Constraints, ER Diagrams, ER Design Issues, Weak Entity Sets-Extended E-R Features.Relational Database Design :Features of Good Relational Designs. Atomic Domain and INF Form, Decomposition using functional dependencies-functional dependencies theory

Unit II. (11)SQLData definition, Basic structure of SQL queries, Set operations, Aggregate functions, Null values, Nested sub queries, Complex queries, Views, Modification of the database, Joined relationsAdvanced SQLIntegrity constraints, Authorization, Embedded SQL, Dynamic SQL, Functional and procedural constructs- Recursive Queries-Features.

Unit III. (12)Query ProcessingOverview, Measures of query cost, Select operation, Sorting, Join operation, Other operations, Evaluation of expressionQuery OptimizationOverview, Transformation of relational expressions, Estimating statistics of expression result, Choice of evaluation plans, Materialized views.TransactionsTransaction concept, Transaction state, Implementation of Atomicity and durability, Concurrent executions, Serializability, Recoverability.

Unit IV. (12)Developments in database technologyRecord-based DBMS, Data modeling, Advanced DBMS, Object-oriented DBMS. The ODMG data modeling. The context of the ODMG model, The built-in types, User-defined object types – modeling state, User-defined object types – modeling behavior, ODL reference



Unit V. (12)An object-oriented database system (O2)The history of O2 , The architecture of O2 , The O2 database engine, Data and application structure in O2 ,Components o the O2 system – DBA tools, Meta_ schema. The object query language OQL Principal features of OQL, Some examples of OQL queries, Queries in OQL, OQL inO2- Interactive use of OQL and Embedded use of OQL.

Text Book:1. Korth, Silberchatz, Sudarshan , Database System Concepts, McGraw-Hill, 5th edition,

20062. Cooper Richard, Object Databases An ODMG Approach, Thomson computer press,

Reprint, 2006.

Reference Book:1. O’neil patric, O’neil Elizabeth, Database priniciples, programming and

performance, Argan Kaufmann publishers, 2nd edition, 20022. Elamsri & Navatha, Fundamentals of Database systems, Addition- Welsley, 2nd

edition, 2004.3. MCFadden R.Fred, Hoffer A Jeffrey and Prescatt B Mary, Modern Database

management system, Addition-wesley, 5th edition, 1999.



MCS133 Advanced Data Structures


Unit I. (12)IntroductionAlgorithm, An abstract data type, Model for ADT, Algorithmic efficiency.Linked ListsLinked list algorithms- Processing a linked list, Linked list algorithms (Create, Traverse, Insert, Delete, Search, Destroy), Circularly Linked list, Doubly linked lists structures and it’s operations, Applications of linked lists.Stacks and QueuesStacks - Basic Stack Operations, Linked list implementation, Stack applications, Recursion- A Case Study, Queues - Queue operations, Types of Queues, Linked List implementation, Queue applications. Unit II. (13)TreesBasic tree concepts, Binary trees, Binary tree traversals, Expression trees, General trees- Changing general tree to binary tree, General tree insertion, Deletion ,Search trees, Binary search trees, Operations (Traversal and Search), AVL trees - AVL Balance factor, Balancing trees, AVL Insert, AVL node structure, AVL Delete algorithm.HeapsHeap Definition, structure, Basic heap algorithms – ReheapUp, ReheapDown, Heap Data structure, Heap algorithms – Build, Insert, Delete heap, Heap applications

Unit III. (12)Multiway TreesM -Way Search Trees, B-Trees - B-Tree Insertion, B-Tree Deletion, B-Tree Traversal - B-Tree Search, Simplified B-Trees - 2-3 Tree, 2-3-4 Tree, B-Tree Variations–B * Trees, B+ Trees, Lexical Search Tree - Tries, Tries structure , Tries search.

Unit IV. (10)GraphsTerminology, operations, Graph storage structures – Adjacency Matrix, Adjacency lists, Graph algorithms- Create graph, insert vertex, delete vertex, insert Arc, delete Arc, Retrieve vertex, First Arc, Depth first traversal and Breadth First Traversal, Networks- Minimum spanning tree, Shortest Path algorithm.

Unit V. (13)Advanced Sorting ConceptsGeneral sort concepts – Efficiency, Passes, Insertion sorts – Straight Insertion sort, Shell sort, Selection sorts – Straight selection sort, Heap sort, Exchange sorts – Bubble sort, Quick sort , External sorts – Merging ordered files, Merging unordered files.



Searching Linear list searches- Sequential search, Variations in sequential search, Binary search, Hashed list searches – Basic concepts, Hashing methods-Direct method, Subtraction method, Modulo-division method, digit extraction method, mid square method, folding method, Rotation method, pseudorandom method, Hashing algorithm, Collision resolution.

Text Books:1. Richard F. Gilberg, Behrouz A. Forouzan,"Data Structure . A Pseudocode

Approach with C ", Thomson Brooks/Cole Publications, 20042. Tanenbaum Andrew S, Y Langsam and M. J. Augenstein, "Data Structure using

C", Prentice- Hall, India, Reprint, 2007.

Reference Books:1. Robert Kruse, Tondo C L, Bruce Leung, “Data Structures & program Design In

C”, Pearson Education, 2nd Edition, 2004.2. U.A.Deshpande and O. G. Kakde , “Data Structures and Algorithms”, ISTE-

Learning Materials Centre, New Delhi, 2003



MCS134 Object Oriented Programming using C++


Unit I. (12)Introduction to Object-Oriented ProgrammingEvolution of programming methodologies, Procedural Approach Vs Object-Oriented Approach. Principles of OOP: Encapsulation and Abstraction, Message Passing, Inheritance – Reusability, Extensibility, Polymorphism – Overloading, Dynamic Binding.Comparison of C and C++Limitations of C, Introduction to C++, Structure of the C++ program, Added features of C++ over C – Storage Classes, Reference variables, Inline functions. Simple I/O using cin & cout, I/O formatting and I/O functions. Name spaces, and volatile functions.

Introduction to Objects and ClassesDefining the class, Defining Data members and member functions, Creating Objects of Class, Access Specifiers – private, public and protected. Scope Resolution Operator, Friend Functions and Friend Classes – Static Members. this pointer, returning values using this pointer,.Comparison of class with structure.

Unit II. (12)Constructors and DestructorsPurpose of Constructors and Destructors, Default Constructors, Constructors with and without parameters, Constructor Overloading, Copy Constructor. Invoking Constructors and Destructors. Pointers in C++Pointer declaration and Access, Pointer to void, pointer and arrays, Pointer to pointer, Pointer to functions, Call by pointer, Pointer arrays, Array of pointers to string, Pointer sort, Memory management – new and delete, Pointer to object – referencing members using pointers, Wild pointers.

Unit III. (11)PolymorphismOverloading Concepts Function Overloading: Functions with different sets of parameters, default and constant parameters. Operator Overloading: Defining Operator Function, Rules for overloading Operators. Overloading unary operators, overloading binary operators, Overloading Comma, [], (), ->, new, delete Operators. Type Conversions : Basic to Class, Class to Basic and one Class to another Class type. Advanced Type Casting.

Unit IV. (12)InheritanceBasic Concepts, Reusability & Extensibility, Defining derived classes, protected access specifier in Base class – public, private & protected inheritance – constructors and destructors in derived classes – Types of Inheritances, Virtual base class.



Virtual FunctionsNormal member functions accessed with pointers, virtual member function access, late binding, pure virtual function, abstract classes.

Unit V. (13)Console I/O operationsC++ streams and C++ stream classes – Predefined Objects, unformatted I/O operations, Formatted I/O operations - manipulators - User defined manipulators - Overloading << and >> Operators for Objects.Disk I/O OperationsStream Classes, classes for file stream operations, opening and closing a file, file nodes, writing an object to disk, reading an object from disk, binary versus character files, I/O with multiple objects, file pointer specifying the position, tellg() and seekg(), seekp() and tellp().TemplatesGeneric Functions- A generic swap function, Functions with more than one Generic Type, Overloading a Function Template. Generic Classes – A stack generic class, Class template with more than one Generic Type, typename and template keywords, Template Restrictions, The power of Templates.Exception HandlingFundamentals of Exception Handling, Catching Class Types, Using Multiple catch statements, Catching All Exception, Restricting Exception, throw statement, Setting the Terminate and Unexpected Handlers, Uncaught exception,Built-In Exceptions. Exception Vs Error Handling.

Text Books:1. Deitel & Deitel, “C++ How to program”, Pearson Education Asia, 5th Edition,

20052. Schildt Herbert, “The Complete Reference C++”, Tata McGraw Hill, 4th Edition,

2003

Reference Books:1. Lafore, Robert, “Object Oriented Programming in Turbo C++”, Galgotia

Publications Pvt. Ltd, Reprint, 2006.2. E Balagurusamy, “Object Oriented Programming with C++”, Tata McGraw Hill,

4th Edition, 20073. Gaddis Tony,” Starting Out with C++”, dreamtech Press, 3rd Edition, 2002.4. Sotter A Nicholas and Kleper J Scott, “Professional C++”, Wiley Publishing Inc,

2005.



MCS135 Digital Logic and Assembly Language Programming


Unit I. (12)Binary number system – 1's and 2's Compliment, The basic gates, Boolean algebra, NOR and NAND Gates, AND-OR-Invert Gates, Positive and negative logic.Boolean laws, sum of products, Karnaugh map, pairs-Quads-Octets, Karnaugh simplifications, Don't care conditions, Product of sums methods and simplification.Multiplexers, Demultiplexers, 1-of-16 Decoders, BCD-to-Seven-Segment Decoders, Encoders

Unit II. (12) RS Flip-Flops, Edge-Triggered RS, D, JK Flip-Flops, Flip-Flop Timing, JK Master-Slave Flip-Flops.Types of Registers, Serial in-Serial out, Serial in-Parallel out, Parallel in-Serial out, Parallel in-Parallel out, Ring counters.Asynchronous Counters, Synchronous Counters, Decade Counters.

Unit III. (12) Microprocessor architecture and its operations - Address Bus, Data Bus, Control Bus, Internal data operations and Registers, Memory, I/O DevicesThe 8085 MPU – Architecture, Communication and Bus Timings, Demultiplexing the Bus, Generating Control Signals.

Unit IV. (12) The 8085 programming model, Instruction classification, Instruction and Data Format,Data Transfer Operations, Arithmetic Operations, Logic Operations, Branch Operations, Writing ALP Programs.Looping, Counting, Indexing, Additional Data Transfer and 16-Bit Arithmetic Instructions, Arithmetic operations related to memory, Rotate and Compare of Logic operations.

Unit V. (12) Counters and Time Delays, Stack, Subroutines, Restart – Conditional Call- Return Instructions.The 8085 Interrupt – RST, SIM and RIM Instructions, Multiple Interrupts and Priorities, 8085 Vectored Interrupts – TRAP, RST 7.5, 6.5, 5.5.Assembly Language Programming – Addition of N Hexadecimal numbers, Subtraction of two 16 bit Hexadecimal numbers, Addition of two 32 bit numbers, Interchange N one byte numbers, Find the sum of first 10 terms of odd and even series, Simulate a decade counter to count up to 99.

Text Books:1. Leach P, Donald and Malvino, Albert Paul , “Digital Principles and Applications,”

Tata McGraw-Hill, 5th edition, 2005



2. Goankar S, Ramesh, “Microprocessor Architecture Programming, and Applications with the 8085”, Penram International, 5th edition, 2005

Reference Books:

1. Mano, Morris M and Kime, Charles R, “Logic and Computer Design Fundamentals”, Pearson Education, 2nd edition, 2002.

2. Tokheim, “Digital Electronics Principles and Applications”, Tata Mc Graw-Hill, 6th edition, 2004.

3. Hall D V, “Microprocessor and Digital System”, Tata Mc Graw-Hill, 2nd edition, 1990.

4. Charles M Gilmore, Pal, Ajit,” Microprocessor Principles and Applications”, Tata Mc Graw-Hill, 2nd edition, 1990.



MCS136 Data Communication & Networking


Unit I. (12)IntroductionNetworks, The Internet, Protocols and standards.Network Models. Layered tasks, The OSI Model, Layers in the OSI Model, TCP/IP Protocol suite, Addressing.

Unit II. (13)The Data Link Layer: Error Detection and Correction: Introduction, Block coding, Linear block codes, Cyclic codes, Checksum.Data Link Control: Framing, Flow and error control, Protocols, Noiseless Channels, Noisy Channels, HDLC, Point-to-point Protocol.Multiple Access: Random Access, Controlled Access, Channelization.

Unit III. (13)The Network LayerInternet Protocol: Internetworking, IPv4, IPv6, Transition from IPv4 to IPv6.Address Mapping, Error Reporting and Multicasting: Address Mapping, ICMP, IGMP.Delivery, Forwarding and Routing: Delivery, Forwarding, Unicast Routing Protocols, Multicast Routing Protocols.

Unit IV. (11)The Transport Layer UDP & TCP: Process-to-process delivery, User datagram Protocol (UDP), Transport Control Protocol (TCP).Congestion Control: Data Traffic, Congestion, Congestion Control, Two Examples, Quality of Service, Techniques to improve QoS, Integrated Services, Differentiated Services, QoS in Switched Networks.

Unit V. (11)The Application LayerDomain Name System: Name space, Domain name Space, Distribution of Name Space, DNS in the Internet, Resolution.Network Management: Network Management system, Simple network Management Protocol(SNMP).

Text Book:

1. Forouzan, Behrouz A., “Data Communications and Networking”, Tata McGraw-Hill publishing Company Limited, 4th Edition, 2006.



Reference Books:

1. Tanenbaum, Andrew S, “Computer Networks”, Pearson Education,4th Edition, 2003.

2. Stallings, William,”Data & Computer Communications”, Pearson Education Asia, 6th Edition, 2001.

3. Michael A. Gallo,”Computer Communications and Networking Technologies”, Thomson Brooks/Cole, 1st Edition, 2002.

4. William A. Shay,”Understanding Data Communication and Networks”, Vikas Publishing House, 2nd Edition, 2001.



MCS151 Data Structures Lab using C

Total Hours/Semester: 60No of Hours/Week: 04

1. Implement stacks.

2. Implement queues.

3. Implement sequential search and binary search techniques.

4. Implement linked lists and some operations on linked lists.

5. Implement doubly linked lists.

6. Implement Circular linked lists.

7. Implement Binary trees and perform the operations.

8. Implement AVL trees.

9. Implement Bubble sort.

10. Implement Selection sort.

11. Implement Shell sort.

12. Implement Heap sort.

13. Implement Quick sort.

14. Implement Insertion sort.

15. Implement Merge sort.

16. Implement Radix sort.

17. Write a program to convert an infix expression to the postfix form.

18. Write a program to evaluate a postfix expression.

19. Implement Depth First Search.

20. Implement Breadth First Search.

QUESTION PAPER PATTERN

Two questions will be selected by the examiners. Students have to write and execute both

the programs.



MCS152 C++ LabTotal Hours/Semester: 60 No of Hours/Week: 04

1. Write a Program to Implement Classes and Objects.

2. Write a Program to Implement Constructors and Destructors with array of Objects.

3. Write a Program to Implement Passing and returning parameters by reference.

4. Write a program to demonstrate Function Overloading.

5. Write a program to overload different operators – incr & decr operators with post & pre forms; new, delete, [], () and arithmetic operators.

6. Write a program to perform pointer sort operation.

7. Write a program to demonstrate friend functions and friend classes.

8. Write a program to implement different types of inheritances like Multiple, Multilevel and Hybrid.

9. Write a program to demonstrate the use of Virtual Functions.

10. Write a program to demonstrate the use of abstract classes.

11. Write a program to demonstrate I/O streams and functions.

12. Write a program to Overload << and >> operators as a member and as a non-member operator functions.

13. Write a program to create a file to store some records and search for a particular record and display it.

14. Write a program to demonstrate namespaces and Volatile member functions.

15. Write a program to perform all possible Type Conversions.

16. Write a program to create function Templates, and overload the function Templates.

17. Write a program to create a generic stack class and member functions to perform stack operations.

18. Write a program to implement Exception Handling with minimum 5 exception classes including two built-in exceptions.


Two questions will be selected by the examiners. Students have to write and execute both the programs.



MCS231 Computer ArchitectureTotal teaching Hours/Semester: 60 No of Lecture Hours/Week: 04

Unit I. (13)Introduction Basic Model of a Computer – Computer Components.Register transfer and Microoperations Register Transfer Language – Register Transfer – Bus and Memory Transfers – Arithmetic Microoperations – Logic Microoperations – Shift Microoperations – Arithmetic Logic and Shift Unit.Basic Computer Organization and Design Instruction Codes – Computer Registers – Computer Instructions – Timing and Control – Instruction Cycle – Memory – Reference Instructions – Input-Output and Interrupt.

Unit II. (12)Microprogrammed Control Control Memory – Address Sequencing – Microprogram Example – Design of Control Unit.Central Processing Unit Introduction – Stack Organization – Instruction Formats – Addressing modes – Data transfer and manipulation – Program Control.

Unit III. (12)Computer Arithmetic Introduction – Addition and Subtraction – Multiplication Algorithms – Division Algorithms – Floating-point Arithmetic operations – Decimal Arithmetic unit – Decimal Arithmetic Operations.

Unit IV. (12)Input-Output Organization Peripheral devices – Input-Output Interface - Asynchronous data transfer – Modes of transfer – Priority Interrupt – Direct Memory Access – Input-Output Processor – Serial Communication.

Unit V. (11)Memory Organization Memory hierarchy – Main memory – Auxiliary memory – Associative memory – Cache memory – Virtual memory – Memory management hardware.

Text Book:1. Mano M, Morris, “Computer System Architecture”, PHI, 3rd Edition, 2006

Reference Books:1. Stallings William, Computer Organization and Architecture, Prentice Hall, 4th

Edition, 20042. John P.Hayes, Computer Architecture & Organization, McGraw Hill

International Editions, 3rd Edition, 2003



MCS 232 Java Programming


Unit I. (12)Introduction to javaClass fundamentals, Declaring objects, Introducing methods, Constructors, Command line arguments, Inheritance, Using super keyword, Method overriding, Abstract classes, Final with inheritance, Interfaces implementation.Exception HandlingTry-catch-finally mechanism, Throw statement, Throws statementMultithreadingLife cycle of a thread, JAVA thread priorities, Runnable interface, Synchronization

Unit II. (12)Input/Output in javaI/O streams, Readers and Writers, Tokenizing inputAppletLifecycle of an Applet, Creation and execution of java appletsIntroducing AWTAWT components, Container classes, Layout managers, Menus and event handling

Unit III. (13)GUI components using SWINGSIntroduction to swing classes, Writing graphical user interface programs in java with SWINGSJDBC (Java Database Connectivity)Database tables and SQL queries, Connecting to a database, Retrieving information, Metadata and aggregate functions, Prepared statements and transactions, A GUI for database queries

Unit IV. (13)NetworkingNetworking basics, Java and the Net, Inet address, TCP/IP client sockets, URL connection, TCP/IP server sockets, Datagrams.RMI (Remote Method Invocation)Defining the remote interface,Implementing the remote interface, Define the client, Compile and execute the server and the client

Unit V. (10)ServletsThe life cycle of a servlet,A simple servlet, The servlet API, Servlet package, Reading servlet parameters, Servlet HTTP package, Handling HTTP requests and responses, Using cookies, Session tracking



Introduction to EJBArchitectural Overview: Enterprise Bean component, Classes and Interface, Deployment Descriptors and JAR Files, EJB Objects and EJB Home, Using Enterprise Beans, The Bean-Container Contract.

Text Books:1. Herbert Schildt, “JAVA The Complete Reference”, Tata McGraw Hill

publications, J2SE5 edition, 2005.2. Deitel & Deitel, “Java How to Program”, Pearson Education, 3rd edition, 2001.3. Art Gittleman, “Ultimate Java Programming”, dreamtech press, 1st edition, 2002.4. Monson-Haefel, “Enterprise Java Beans”, O’REILLY, 4th edition 2004 (Chapter

2)

Reference Books:1. Herbert Schildt, “JAVA2 Programmers Reference”, Tata McGraw Hill

publications, 2nd edition, 20002. Ken Arnold, “Java Programming Language”, 4th edition3. Holzner Steven, Java2 Black Book, dreamtech press, 1st Edition, 2002.4. Flanagan David, Java in a nutshell, O’REILLY, 4th Edition, 2002



MCS241A .NET Technologies


Unit I. (12)Introduction to .NET.NET Definition, Advantages of .NET, .NET Architecture – Common Language Runtime, MSIL, Support of different Languages, Language Interoperability, .NET Framework Classes, Advantages of Managed Code – Strong Data Type Check, Garbage Collection, Security, Performance Improvement.C# BasicsFeatures of C# – Data types, Flow Control – the Main method, Program Structure, Methods, Arrays, Namespaces.

Unit II. (11)Object Oriented C# Classes and Inheritance, Method Overloading, Method Overriding, Calling Base Versions of Methods, Abstract Classes and Methods, Sealed Classes and Methods. Access Modifiers, Properties – Read Only, Write Only Properties, Function – Parameter Passing Mechanisms, Interfaces, Dispose methods, Operator Overloading, Indexers.

Unit III. (11)Advanced C# TopicsErrors and Exception Handling, Exception Classes, User Defined Exceptions. The STD namespace objects, Array Lists, Collections, Dictionaries, Multi Threading – Synchronization, Delegates – Definition, Delegates in Inheritance, Event handler, Reflection

Unit IV. (13)Programming in the .NET EnvironmentIntroduction to Visual Studio .NET – ASP .NET. Difference between ASP and ASP.NET, Creating a Web application using ASP.NET. Components of an ASP.NET User Control, Custom Control, Deploying ASP .NET applications. Master Pages, Themes.AssembliesFeatures of Assemblies, Application Domains, Assembly Structure, Assembly manifests, Assemblies and Components.

Unit V. (13)Data AccessADO.NET overview, Various data access objects – Connection, Command and DataSet Objects, Binding data to ASP .NET server controls, Accessing data from a database using ADO.NET, Reading from and Writing to an XML document, Using XML DOM objects for data access from XML Documents, Binding data from an XML document to Web form controls, Converting data from Database to XML Data, Xml & Web Services



Text Books:1. Simon Robinson, Christian Nagel, Karli Watson, Jay Glynn, Morgan Skinner and

Bill Evjen, Professional C#, Wiley – dreamtech India Pvt. Ltd., 3rd Edition, 2004.2. Complete-reference-to-professional-soa-with-visual-studio-2005-dot-net-3-0

Reference Books:1. Kothari Nikhil and Datye Vandana, Developing ASP .NET Server Controls and

Components, Tata McGraw Hill, 2003.2. Esposito Dino, Applied XML Programming for Microsoft .NET, Tata McGraw

Hill, 2003.



MCS241B Web Technologies


Unit I. (12)HTML, CSS and Basics of XMLIntroduction to Hyper Text Markup Language Key components of HTML document, HTML elements, Headers, Linking, Images, Unordered Lists, Nested and ordered Lists, HTML Tables and Formatting, HTML Forms, Internal Linking, Creating and Using Image Maps, <meta> Tags, frameset Element, Nested framesets.Cascading Style Sheets (CSS) Introduction, Inline Styles, Creating Style Sheets with the style element, conflicting styles, linking external style sheets, positioning elements, backgrounds, element dimensions, text flow and the box model, user style sheets. Creating Markup with XML Introduction to XML Markup, Parsers and Well-formed XML documents, Parsing an XML document, Characters, Markup, CDATA sections, XML NamespacesCase Study: A Day Planner Application.

Unit II. (12)DTD Parsers, Well-formed and valid XML documents, Document Type Declaration, Element Type Declarations, Attribute Declarations, Attribute Types, Conditional Sections, Whitespace Characters.Case Study: Writing a DTD for the Day Planner Application.

Schemas Schema Vs. DTDs, Microsoft XML Schema: Describing Elements, Microsoft XML Schema: Describing Attributes, Microsoft XML Schema: Data Types, W3C XML Schema.Case Study: Writing a Microsoft XML Schema for the Day Planner Application.

Unit III. (12)JavaScript: Background, writing code, event handling, JavaScript with HTML, Practical examples.PHPCreating a simple PHP program. Accessing PHP and HTTP Data. Reading POST and GET variables. Form validation. User – defined function in PHP. Handling cookies and sessions.

Unit IV. (12)PHP and XML, PHP4 XML Functions, PHP5 XML Functions-SimpleXML and Changing values.Connecting to MySQL from PHP, PHP MySQL Connectivity, Creating Databases and Tables with PHPCase Study: Creating a User Registration Script and an Access Logger Script.



Unit V. (12)DOM DOM Implementations, DOM with JavaScript, Setup, DOM Components, Creating nodes, Traversing the DOM.Case Study1: Modifying the Day Planner Application to use the DOM.Case Study2: XmlMessenger Program.XML Processing and Implementations: Processing XML-XPath, XSLT. XML Implementations- XHTML, Webservices, XUL and WML

Text Book:1. Deitel, Deitel, Nieto, Lin and Sadhu, XML How to Program, Pearson Education

Asia, published by Addison Wesley Longman (Singapore) Pte Ltd., Indian Branch, Delhi, 2001.

2. Mercer W.Dave, Allan Kent, Steven D Nowichi, David Mercer, Dan Squier, Wankyer Choi Beginning PHP5 Wiley – Dreamtech India Pvt. Ltd., 2004 (For Unit 3 & 4)

3. Bryan Pfaffenberger, Steven M. Schafer, Chuck White and Bill Karow HTML, XHTML and CSS Bible –Wiley-Eastern Private Ltd., 3rd Edition, 2004 (Chapter 25 & 32)

References:1. Brain Benz with John R.Durant, XML 1.1 Programming Bible, Wiley-dreamtech

India Pvt Ltd, New Delhi,2003. 2. Art Gittleman , Internet Programming with JAVA 2 Platform, dreamtech, New

Delhi, 2003.



MCS242A Software Architecture


Unit I. (11)IntroductionArchitecture Business Cycle: Origin of an Architecture , Software Processes and Architectural Business Cycle. A good architecture, Software Architecture, What is & what it is not the software Architecture is, Other points of view, Architectural Pattern, Reference Models and Reference Architectures, The Importance of Software Architecture, Architectural structures & views.A Case study in utilizing Architectural Structures.

Unit II. (12)Creating An Architecture.Understanding the quality Attributes - Functionality and Architecture, Architecture and Quality Attributes, System Quality Attributes, Quality Attributes Scenarios in practice, Other System Quality Attributes, Business Qualities, Architecture Qualities.Achieving Qualities - Introducing Tactics - Availability, Modifiability, Performance, Security, Testability, Usability. Relationships of Tactics to Architectural Patterns, Architectural Patterns and Style.

Unit III. (11)Design and DocumentationDesigning the Architecture- Architecture in the life cycle, Designing the Architecture, Forming the Team Structure, Creating the Skeletal System.Documenting Software Architectures - Uses of Architectural Documentation, Views, Choosing the relevant views, Documenting a view, Documentation across views.

Unit IV. (13)Analyzing Architecture ATAM (Architecture Tradeoff Analysis Method) – A comprehensive method for architecture evaluation : Participants, outputs, phases of the ATAM,, The Nightingale system - A case study in applying the ATAM.CBAM (Cost Benefit Analysis Method) – A quantitative approach to architecture design decision making: Decision making context, basis for CBAM, Implementing CBAM, A Case Study – The NASA ECS project. The World Wide Web – A case study in interoperability : Relationship to the Architecture Business Cycle, Requirements & Quality, Architectural Solution, The evolution of web-based e-commerce architectures, Achieving quality goals, Architecture Business Cycle today.



Unit V. (13)Software Product Lines – Reusing Architectural Assets.Overview – Successful working, Scope, Architectures and Difficulties in software product lines.Celsuis Tech – A Case study in product Line development: Relationship to the Architecture Business Cycle, Requirements & Quality, Architectural Solution.Building systems from off-the-shelf components: Impact of components on Architecture, Architectural mismatch, Component-based design as search, ASEILM example.

Text Books:1. Len Bass, Paul Clements, Rick Kazman, Software Architecture In Practice,

Pearson Education Asia , 2nd Edition, 2003.

Reference Books:1. Jeff Garland,Richard Anthony, Large-Scale Software Architecture – A Practical

Guide Using UML, Wiley –dreamtech India Pvt.,Ltd.. 2. Pressman S Roger, Software Engineering, Mc Graw Hill International Editions,

4th edition, 19973. Sommerville, Ian, Software Engineering, Addison Wesley, 5th edition, 20004. Rumbaugh, James, Object Oriented Modeling and design, Pearson Education,

New Delhi, 2005



MCS242B TCP/IP


Unit I. (12)The OSI Model and TCP/IP Protocol SuiteProtocols and standards, The OSI Model, TCP/IP Protocol Suite, Addressing, TCP/IP Versions.Link LayerARP –Packet format, Encapsulation, Operation, ARP over ATM, Proxy ARP, ARP Package-Cache Table, Queues, I/O Module, Cache-Control module. RARP-Packet format, Encapsulation, RARP Server, Alternative solutions to RARP.

Unit II. (12)ICMP & IPICMP overview, Message Types, ICMP Message format. CIDR – Subnetting, VLSM, Supernetting. IP Routing Principles, Routing IP Datagrams, Dynamic Routing Protocols – RIP, OSPF, HELLO, BGP. PING program. Traceroute program.

Unit III. (14)UDP & TCPUDP-Process to Process Communication, User datagram, Checksum, Operation, Use of UDP, UDP Package, TCP-Services, Features, Segment, TCP connection, State Transition Diagram, Flow-Control-Nagel’s Algorithm, Clark’s Solution, Error-Control, Congestion Control, TCP Timers-RTT, Karn’s Algorithm, Options, TCP Package.

Unit IV. (12)UDP & TCP UtilitiesDNS – Basics, Resolution, Caching, DNS Message Format, Inverse mapping, Pointer Queries.TELNET – concept, NVT character set, Embedding, Options, Negotiation, controlling the server, Out-Of-Band Signaling, Escape Characters, Mode of Operation, User Interface, Security Issue. FTP – Connections, Communication, Command Processing, File Transfer, Anonymous FTP.TFTP – Messages, Connection, Data transfer, UDP ports, TFTP example, Security, Applications. SMTP – Architecture, User Agent, Message Transfer Agent, Message Access Agent: POP and IMAP, Web-based mail. SNMP – SMI, MIB, SNMP.

Unit V. (10)IP over ATM, Mobile IP and VOIPIP over ATM-ATM WANs-Layers, Carrying a datagram in cells, Routing the cells, ATMARP, Logical IP Subnet (LIS).VOIP – Session Initiation Protocol, H.323 architecture and protocols.Mobile IP – Addressing, Agents, Three Phases Inefficiency in mobile IP.



Text Book:1. Behrouz A. Forouzan, “TCP/IP Protocol Suite”, Tata Mc-Graw-Hill publications,

3rd Edition, 2006. Reference Books:

1. Comer E. Douglas, “Internetworking with TCP/IP Principles, Protocols and Architectures”, Volume 1, Pearson Education, 4th Edition, 2002.

2. Siyan S Karanjit and Parker Tim, “TCP/IP Unleashed”, Pearson Education Asia, 3rd Edition.



MCS243A OOAD Using UML


Unit I. (12)Complexity: The inherent complexity of software, The Structure of complex systems, Bringing order to chaos, On designing complex systems, Categories of analysis and design methods. The Object Model: The evolution of object model, Elements of object model, Applying the object model, Foundations of the object model.

Unit II. (13)Classes and Objects: The nature of an object, Relationship among objects, The nature of a class, Relationship among classes, The interplay of classes and objects, On building quality classes and objects, Invoking a method. Classification:The importance of proper classification, Identifying classes and objects, Key abstraction and mechanisms, A problem of classification.

Unit III. (12)Basic Behavioral Modeling: Interactions, Use Cases, Use Case Diagrams, Interaction Diagrams, and Activity Diagrams.

Unit IV. (12)Advanced Behavioral Modeling: Events and Signals, State Machines, Processes and Threads, Time and Space, State chart Diagrams.

Unit V. (11)Architectural Modeling: Components, Deployment, Collaborations, Pattern and Frameworks, Component Diagram, Deployment Diagrams, Systems and Models.

Text Book1. Grady Booch,” Object Oriented analysis and Design with Applications”, Pearson

Education, Ninth Indian Reprint 20072. Grady Booch, James Rumbaugh and Ivar Jacobson, “The Unified Modeling

Languages User Guide”, Addison Wesley Fourth Indian Reprint 2000.

Reference Books:1. Mike O’Docherty,”Object –Oriented Analysis and Design- Understanding system

development with UML2.0”, John Wiley and sons, 1st edition, 20052. James Rumbaugh, et al,” Object –Oriented Modeling and Design”, PHI,1998



MCS243B Network Security

Total Teaching Hours/Semester: 60 No of Lecture Hours/Week: 04

Unit I. (13)Introduction to the concepts of security, the need for security, security approaches, principles of security, types of attacks.Convention Encryption: Conventional Encryption Model , Steganography , Classical Encryption Techniques , Simplified DES , Block Cipher Principles , The Data Encryption Standard , The Strength of DES , Differential and Linear Cryptanalysis , Block Cipher Design Principles , Block Cipher Modes of operation , Conventional Encryption algorithms.

Unit II. (12)Public Key Encryption And Hash Functions: Public Key Cryptography , Principles of Public Key Cryptosystems , The RSA Algorithm , Key Management , Diffie Hellman Key Exchange, Elliptic Curve Cryptography Message Authentication and Hash Functions Authentication Requirements, Authentication Functions, Message Authentication Codes, Hash Functions, Security of Hash Functions.

Unit III. (12)Hash and Mac Algorithms: Introduction, Nifty things to do with a Hash, MD5 Message Digest Algorithm, Secure Hash Algorithm (SHA-I), RIPEMD, HMAC, CMAC, Digital Signatures, Authentication Protocols -Digital Signature Standard.

Unit IV. (11)Network Security Applications: Authentication Applications, Kerberos, X.509 authentication service, public key Infrastructure (PKI), Electronic Mail Security, Pretty Good Privacy, S/MIME, IP Security, IP Security Overview, IP Security Architecture, Authentication Header, Encapsulating payload, combining security association, Key Management, Web Security, Web Security Considerations, Secure Socket Layer & Transport Layer Security, Secure Electronic Transaction, Introduction to Wireless security.

Unit V. (12)Intruders, Viruses and Worms: Intruders, Intrusion detection, password management, Viruses and Related Threats, Distributed Denial of service attacks, Firewall Design Principles , Trusted Systems, Application layer firewalls, packet filtering firewalls, hybrid, virtual private network(VPN)

Text Books:1. William Stallings, “Cryptography and Network Security”, Fourth edition, Prentice

Hall, 2007. 2. Atul Kahate, “Cryptography and Network Security,” Tata McGraw-Hills, 2006.



References:1. Eric Maiwald, “Information Security Series”, “Fundamental of Network security”,

Dreamtech press, 2004.2. Charlie Kaufman, Radia Perlman, Mike Speciner, “Network Security: Private

communication in public world”, Prentice Hall, India, 2002.



MCS251 Java Programming Lab

No of Lab Hours/Week: 04

1. Demonstrate method overloading and constructor overloading

2. Demonstrate multilevel inheritance using this and super keyword

3. Demonstrate abstract class with array of objects

4. Demonstrate multiple inheritance with interface

5. Demonstrate try-catch-finally, throw and throws by extending exception

6. Demonstrate multithreading concepts

7. Demonstrate I/O streams in java

8. Demonstrate applet using graphics

9. Demonstrate GUI component with event handling (Using AWT)

10. Demonstrate GUI component with event handling (Using SWINGS)

11. Demonstrate layouts in java

12. Demonstrate a GUI for a domain using relevant database (Use JDBC)

13. Demonstrate client/server interaction with socket connection

14. Use RMI to allow clients to connect to a domain server to complete transaction

MCS 152: JAVA LAB


Two questions will be selected by the examiners. Students have to write and execute both the programs. It is evaluated for 100 marks with a break up of marks for writing, execution and viva. The duration of the examination is 3 hours.



MCS252 RDBMS Project Lab

Total Hours/Semester: 60 No of Hours/Week: 04

1. DBMS Lab includes an application project. The backend of the project may be

any one of the following:

• MS-SQL Server

• Oracle

• DB2

• MySql

2. User interface could be made with any one of the front end tools available.

3. Students should have in-depth knowledge of the front and backend tool, which

they are using.

4. Database tables are required to be normalized, at least to the second level.

5. There need to be independent forms for data entry operations.

6. All the forms in the project need to have similar look and feel in terms of

background/foreground color, arrangement of controls, spacing and sizing of the

controls, size of forms, etc.

7. There could be separate forms for searching purposes.

8. Master table data entry forms may include navigational buttons along with Add,

Save, Delete etc.

9. Reports should be generated dynamically.

Note: Project should be developed by following software engineering process



MCS253 Computer Architecture Project Lab


Students should be divided into batches, each batch containing not more than 3

students. It can be either hardware-software or simulation software related to CA

principles/algorithms. This lab is intended to practice the principles (theory) that they

have studied in Computer architecture. It is entertained to do a hardware related

project incorporating innovative/new ideas.

Some of the project titles:

Processor:

Design of Micro control unit

Design of LCM processor

Design of Arithmetic unit

Design of logic unit

Design of shift unit

Design of nano control unit

Design processor for Recursive functions

Design of Floating Point Operation processor

Design of disassembler (converting from object code to Assembly language code)

Memory:

Memory interleaving

Design of Associative cache

Design of Direct mapping

Design of Set Associative cache

Virtual memory

Look-aside cache

Look-through

Cache snooping

Bus arbitration:

Daisy chaining

Polling

Independent Request



DMA control

Pipeline:

Instruction pipeline

Arithmetic pipeline

Vector processing

Fault tolerance system



MCS271: Seminar

Students have to select a topic and prepare the synopsis and detailed report after review by the faculty guide. Student has to give one hour presentation to a panel of guides and students. Presentation is followed by question and answer session.



MCS331 Unix Operating System

Total Teaching Hours/Semester: 60 No of Lecture Hours/Week: 04

Unit I. (12)Introduction to Unix Unix operating system - History - System structure –Users Perspective- OS Services- UNIX Architecture- System Concepts. Buffer Cache- Heaters – Structure of the Buffer Pool- Scenarios-Reading and writing Disk Blocks.-Advantages and disadvantages of buffer cache..File Systems INODES - Structure of a regular file- Directories – Conversion of a path name to an INODE - Super Block- INODE assignment – Disk Blocks- System calls for the file system.

Unit II. (12)Unix shell environmentTypes of shells – Features of Bourne, C and Korn shells - Creating files and directories - Listing files and directories - Removing files and directories - File related commands - Disk related commands - File compression - I/O redirection and piping - Background processes – nohup command - killing a process - changing process priorities - Unix Communication - System Administration - Adding and removing users - Disk management.

Unit III. (12)Unix shell programming Shell variables - Shell Keywords - Positional parameters - Passing command line arguments - Arithmetic in shell scripts - Read and Echo - Control Structures - if-then-fi - if-then-else-fi - Nested if - Case control structure – Loops - while-until –for - break and continue - Shell meta characters - Exporting variables - Used defined Functions – Debugging Tools for Shell Scripts

Unit IV. Processes (12)Process States and Transitions – Layout of System Memory – Context of a Process – Manipulation of the process address space – Process Control – Creation – Signals – Awaiting process termination – -invoking other programs-user if of a process-changing the size of a process-The Shell – System Boot and Init Process – Process Scheduling and Time – System calls for time – Clock.

Unit V.Memory management (12)Swapping – Demand Paging, streams. I/O multiplexing. Driver Interfaces – Disk Drivers – Terminal Drivers - StreamsInterprocess Communication



Process Tracing – System V IPC – Network Communications –pipes-popen and pclose function s,FIFOs ,Message Queues semaphores, shared memory.

Text Books1. Bach M.J., “The Design of the Unix Operating System”, Prentice Hall India,

reprint 20032. Yashavant P Kanetkar, “Unix Shell Programming”, BPB Publications, New

Delhi, 2004

References1. Kernighan W Brian and Pike Rob, “The Unix Programming Environment”,

Prentice Hall India, 1st Edition, 19982. Stan-Kelly-Bootle, “Understanding Unix”, BPB Publications, New Delhi.3. Richard Stevens, “Advanced programming in the UNIX environment “, Addison

Wesley , edition (IPC- chap 14)



MCS332 Compiler Design

No of teaching hours: 60 No of hours per week : 04

Unit I. (12)Introduction to compiling Introduction to Compiler and Translators-Phases of compilation-One pass compiler, Lexical Analysis-Role of Lexical Analyzer, Input buffering ,Specification of tokens , Recognition of tokens, Regular Expressions,Finite Automata, Regular expression to NFA, Design of Lexical Analyzer-Ex of a language specifying lexical analyzers.

Unit II. (12)Syntax Analysis The role of a parser, Context free grammars, Writing a grammar, Top down parsing, Bottom up parsing, Operator precedence parsing- LR parsers, Using ambiguous, grammars. Example of parser generator.

Unit III. (14)Syntax directed Translations Syntax directed definitions, -Construction of syntax trees-Bottom up evaluation of S attributed definitions, L attributed definitions-Top down translation, Bottom up evaluation of inherited attributes, Recursive evaluators.Type Systems Type checking – Specification of a simple type checker-Equivalence of type expressions, Type conversions-Overloading of functions and operators-Polymorphic functionsRun time environmentsSource language issues-Storage organization, Storage Allocation, Storage Allocation Strategies, Symbol tables -Dynamic storage allocation techniques.

Unit IV. (12)Intermediate code generation Intermediate Languages,-Declarations-Assignment statements-Boolean expression- Case statements-Back patching - Procedure Calls.Code optimization-Sources of optimization-Optimization of Basic blocks –Loops in flow graphs, Introduction to global, data flow analysis-Interactive solution of data flow equations-Code improving transformations-Dealing with aliases-Data flow analysis of structured flow graphs.

Unit V. (10)Code generation Issues in the design of code generator, The target machine, Runtime storage management, -Simple code generator Register allocation and assignment-DAG representation of basic blocks –Peep hole optimization-Generation of code from DAGs, Dynamic programming code generation algorithm.



Text Book:1. A.V.Aho and J.D. Ullman;“Compilers-Principles, Techniques and Tools”Addison

Wesley, 3rd Indian Reprint, 2006.

Reference Books:1. A. V. Aho and J.D. Ullman: “The Principles of Compiler Design”, Narosa

Publishing House, 19872. D.M. Dhamdhere: “Compiler Construction, Principles and Practice”, McMillan

India Ltd, 1983.



MCS333 Artificial Intelligence & Expert Systems


Unit I. (11)Intorduction What is AI? The Foundations of AI, What is an AI Technique?-Tic-Tac-Toe.Problems, Problem Spaces and SearchDefining the problem as a state space search, Production systems, Problem characteristics, production system characteristics, Issues in the design of search programs.

Unit II. (11)Heuristic Search TechniquesGenerate-and-test, Hill climbing, Simulated Annealing, Best-First search, A* algorithm, AO* algorithm, Constraint satisfaction, Means-Ends Analysis. Unit III. (13)First-Order LogicSyntax and Semantics, Extensions and Notational Variations, Using First-Order Logic, Representing Change in the world, Deducing hidden properties of the world.Interface in First-Order LogicInference rules involving Quantifiers, An Example proof, Generalized Modus Ponens, Forward and Backward Chaining, Completeness, Resolution, Completeness of Resolution.

Unit IV. (13)Slot-and-Filler StructuresSemantic Nets, Frames, Conceptual Dependency.Game PlayingOverview, The Minimax Search Procedure, Adding Alpha-Beta Cutoffs, Additional Refinements, Iterative Deepening. Unit V. (12)Natural Language ProcessingIntroduction, Syntactic processing, Semantic analysis. Expert Systems Representing and Using Domain Knowledge, Expert System Shells, Explanation, Knowledge Acquisition. Text Books :

1. Rich, Elaine and Knight, Kevin, Artificial Intelligence, Tata McGraw-Hill publications, 2nd Edition, 2006

2. Russell, Stuart and Norvig, Peter, Artificial Intelligence A Modern Approach, Pearson Education,



Reference Books:1. Eugene Charniak and Drew McDermott, Introduction to Artificial Intelligence,

Addison Wesley, Pearson Education, 20052. George F Luger, Artificial Intelligence Structures and Strategies for Complex

Problem Solving, Pearson Education Ltd., 2nd Edition, 2002.3. Dan W Patterson, Introduction to Artificial Intelligence and Expert Systems,

Prentice-Hall of India, 2001.



MCS334 Data Warehousing and Data Mining


Unit I (10 Hours)Introduction:What is data mining ? Relationship to machine learning. Summarization and Feature extraction. Bonferroni's principle. Applications and Examples.

Data Preprocessing:Why Preprocess the Data ? Data summarization. Data cleaning. Data integration, Data transformation. Data cube aggregation, Attribute Subset Selection, Dimensionality Reduction, Numerosity Reduction. Data Discretization, Concept Hierarchy Generation.

Unit II (14 Hours)Introduction to Information Retrieval: Inverted indices and boolean queries. Query optimization. The nature of unstructured and semi-structured text. The term vocabulary and postings lists. Text encoding: tokenization, stemming, lemmatization, stop words, phrases. Optimizing indices with skip lists. Proximity and phrase queries. Positional indices. Dictionaries and tolerant retrieval. Dictionary data structures. Wild-card queries, permuterm indices, n-gram indices. Spelling correction and synonyms: edit distance, soundex, language detection. Index construction. Postings size estimation, sort-based indexing, dynamic indexing, positional indexes, n-gram indexes, distributed indexing. Scoring, term weighting, and the vector space model. Parametric or fielded search. Document zones. The vector space retrieval model. tf.idf weighting. The cosine measure. Scoring documents.

Unit III (16 Hours)Map ReduceDistributed File Systems, Map and Reduce Tasks. Algorithms that use Map-Reduce: Matrix Vector Multiplication, Relational Algebra operations. Mining Frequent Patterns and Associations Near-Neighbor Search, Collaborative filtering, Shingling. Min-hashing and Localitysensitive Hashing. The Stream Data Model, Examples of stream sources and queries, Sampling Data in a Stream. Filtering Streams, Bloom Filters, Counting Distinct Elements in a Stream. Market-Basket model, Association rules. A-priori algorithm.

Unit IV (10 Hours)ClassificationIntroduction to text classification. Naive Bayes models. Spam filtering. K Nearest Neighbors, Decision boundaries, Vector space classification using centroids. Comparative results. Support vector machine classifiers. Kernel Function. Evaluation of classification. Micro- and macro-averaging. Learning rankings.Clustering:Introduction to the problem. Partitioning methods: k-means clustering; Hierarchical clustering. Latent semantic indexing (LSI). Applications to clustering and to information retrieval.



Unit V (10 Hours)Web MiningWhat makes the web different. Web search overview, web structure, the user, paid placement, search engine optimization/spam. Web size measurement. Crawling and web indexes. Near-duplicate detection. Link analysis. Web as a graph. PageRank. Machine Learning techniques for ranking.

Text Books:1. Jiawei Han and Micheline Kamber, Data Mining: Concepts and Techniques,

Morgan Kaufmann Publishers, San Francisco, USA, 2nd edition, 2006.2. Anand Rajaraman and Jeffrey D.Ullman: Mining of Massive Datasets (ebook)3. Chris Manning and Prabhakar Raghavan, Introduction to Information

Retrieval (ebook)

Reference Books:♦ Claudia Imhoff, Nicholas & et al, Mastering Data warehouse Design, J Wiley,

2003♦ Berson A & Smith S J, Data warehousing, Data Mining & OLAP, Mc Graw

Hall, 1997.♦ Margaret H. Dunham, Data mining-Introductory and Advanced topics Pearson

Education, 2003♦ Inmon W H, Building the Data Warehouse, John Wiley & Sons, 3rd edition,

2005



MCS335 Computer Graphics


Unit I. (12)Conceptual overview of computer graphics Algorithmic generation of basic Primitives (lines, circles, ellipses), two dimensional transformation concepts-Translation, rotation, scaling with matrix representation, homogeneous Co-ordinates, concept of window, window to view port transformation, Line Clipping algorithms-Cohen-Sutherland, Mid-point division and Liang-Barsky Algorithms, Polygon Clipping-Sutherland-Hodgeman Algorithm. Unit II.3D viewing and modeling (12)Viewing pipeline, viewing co-ordinates, View plane transformations, parallel projection, perspective projection, View volumes, Matrix representation for 3D transformations, Projection Transformation, View port transformation, Clipping planes.Unit III.Color and Lighting (12)Properties of light, achromatic light, chromatic colors, color models-YIQ, CMY, HSVLight sources, illumination models, ambient light, diffuse Reflection, specular reflection.Unit IV.Curves and Surfaces (12)Spline representations, interpolation and approximation splines, continuity conditions, Cubic spline interpolation, Bezier curves and surfaces, B-spline curves and surfaces, Beta splines,Rational Splines,Displaying Spline curves and surfaces,constructive solid geometric methods ,Octrees

Unit V. (12)Introduction to OpenGLWhat is OpenGL, Sample Code, OpenGL Command Syntax, OpenGL as a State Machine, OpenGL Rendering Pipeline.OpenGL Built-in FunctionsImplementation of Translation, Rotation, Scaling and Composite Transformation in OpenGL, Troubleshooting transformations in Open GL, Specifying color and Shading Model in OpenGL, Real World and Open GL lighting, Creating light sources in Open GL, Selecting a lighting model in Open GL, GL- Evaluators, one dimensional and two dimensional evaluator in OpenGL.

Text books:1. Donald Hearn, M. Pauline Baker,” Computer Graphics” .PHI, 2nd Edition, New

Delhi, Reprint as on 2006. 2. OpenGL Redbook Version, 1.1 (Online)



Reference Books:1. Foley, Vandam & Feiner, Hughes, “Computer Graphics Principles & Practice”,

2nd edition in C, Pearson Education (Singapore Pvt Ltd, Indian Branch, Delhi) 6 th

Indian Reprint 2001. 2. Richard S Wright, Jr. Michael Sweet,”Open GL Super Bible”, 2nd Edition 3. Woo, Mason and Neider, Jackie,” Open GL Programming guide ”4. Zhigang Xiang, Roy A Plastock, Adapted by: P S Avadhani, “Computer Graphics”,

Tata McGraw Hill, 2nd Edition, New Delhi, Special Indian Edition 2006.



MCS341A Multimedia and Applications


Unit I. (11)Uses of multimedia information:What is multimedia - emerging applications- challenges – multimedia appliances- Hybrid devices. Architectures and issues for distributed multimedia systems:Distributed multimedia systems – synchronization – orchestration and QOS Architecture – A frame work for multimedia systems.

Unit II. (12)Digital Audio Representation & Processing: Uses of Audio in computer Applications – Psychoacoustics – Digital Representations of Sound – Transmission of Digital sound – Digital Audio signal processing – Digital music making. Video Technology: Raster scanning principles – sensors for TV Cameras – Color fundamentals – Color video – Analog video Artifacts. Testing: Function testing – installation procedures – random testing – alpha listing – beta testing.

Unit III. (12)Digital video & Image Compression:Evaluating a compression system – Redundancy & Visibility – Video compression Techniques – Standardization of algorithms – DVI Technology. Time based Media Representation & Delivery: Models of time – Time & multimedia requirements.Video and Animation: Video Signal Representation – Computer Video Format – Television – Convention Systems- enhanced and high definition systems - Computer-based Animation

Unit IV. (12)Middleware System Services Architecture:Multimedia system services Architecture – classes & objects – media stream protocol – Example: Audio & Video capture with synchronized play. Multimedia Presentation & Authoring: Design paradigms & user interfaces – Example: interfaces. Distributed Multimedia Applications: CD ROM – Writable CD-Rom recording – WORM or Erasable drives – DAT tape – Removable cartridge systems.

Unit V. (13)Abstraction for Programming: Higher Programming Languages – Media as Types, Files, Processes. Object Oriented Approaches – Application-specific Metaphors as Classes – Application-generic



Metaphors as classes – Devices as Classes- Processing as Classes- Processing units , Media as classes- Communication-specific Metaphors as Classes.

Multimedia Applications: Introduction – Media Preparation- Media Composition- Text and Graphics Editors – Image Editors – Animation Editors – Sound Editors – Video Editors- Media integration – Media Communication – Media Consumption – Media Entertainment .

Text Books:1. John F Koegel Buford, “Multimedia Systems”, Pearson Education Asia, 2nd

Edition 2004 .2. Ralf Steinmetz Klara Nahrstedt ,”Multimedia: Computing, Communications &

Applications “ Pearson Education Asia ,2004.

Reference Book:

1. Mark J. Bunzel , Sandra K Morris , “Multimedia Applications Development Using Ind Video and DVI Technology”, Tata McGraw Hill



MCS341B Wireless & Mobile Networks


Unit I. (12)Wireless Telecommunications Systems and Networks: History and Evolution of Wireless Radio Systems, Development of Modern Telecommunications Infrastructure, Overview of Existing Network Infrastructure, Wireless Network Applications: Wireless MarketsEvolution and Deployment of Cellular Telephone Systems: Different Generations of Wireless Cellular Networks, 1G Cellular Systems, 2G Cellular Systems, 2.5G Cellular Systems, 3G Cellular Systems, 4G Cellular Systems and Beyond, Wireless Standards Organizations

Unit II. (12)Common Cellular System Components: Common Cellular Network Components, Hardware and Software Views of the Cellular Network, 3G Cellular System Components, Cellular Component Identification, Cell establishmentWireless Network Architecture and Operation: The Cellular Concept, Cell Fundamentals, Capacity Expansion Techniques, Mobility Management, Wireless Network Security

Unit III. (14)GSM and TDMA Technology: Introduction to GSM and TDMA, GSM Network and System Architecture, GSM Channel Concept, GSM Identities, GSM System Operations, GSM Infrastructure Communications

Unit IV. (12)CDMA Technology: Introduction to CDMA, CDMA Network and System Architecture, CDMA Channel Concept, CDMA System OperationsCDPD and Edge Data Networks: CDPD, GPRS, GPRS Networks, GPRS Network Details, GPRS Network Layout and Operation, GPRS Packet Data Transfer, GPRS Protocol Reference Model, GPRS Logical Channels, GPRS Physical Channels, GSM/GPRS/Edge Technology

Unit V. (10)Wireless LAN/Wireless PANs/IEEE 802.15x: Introduction to wireless LAN 802.11X technologies, Evolution of Wireless LAN, Introduction to IEEE 802.15x Technologies, Wireless PAN Applications and Architecture, Bluetooth, Introduction to Broadband wireless MAN,802.16 technologies

Text Book1. Mullett, ‘Wireless Telecommunications Systems and Networks’, Cengage

Learning, 2006 Edition



Reference Books1. Raj Kamal, ‘Mobile Computing’ Oxford Higher Education, 20072. Stallings William, “Wireless Communications and Networks”, Pearson Education

Asia, 20023. Rappaport Theodore S, “Wireless Communications: Principles and Practice”,

Pearson Education Asia, 2nd edition, 2002.4. Jochen Schiller, “Mobile Communications”, Pearson Education, 2nd edition, 2006



MCS351 UNIX Lab


Section – A (Shell Programming)

1. Write a script to find the number of days between two given dates using functions.

2. Write a script to find the number of unique words in a list of words stored in a file.

3. Write a script function that displays all shell default parameters.

4. Write a script to convert a binary number to its decimal equivalent.

5. Write a script to encode and decode a text file.

6. Write a script to compute the factorial value with and without using recursive functions.

7. Write a script to send a text file to group of users.

8. Write a script to check your home directory to display how many files, directories, and sub-directories are there and display it.

9. Write a Shell Script to prepare and display the Electricity bill with significant considerations.

10. Write a Shell Script to check whether the given number is odd or even and whether is +ve, -ve or zero.

Section – B (System Programming)

11. Demonstrate fork(), kill(), sleep() system calls

12. Demonstrate explicit locking and unlocking on a file using lockf()

13. Demonstrate process synchronization

14. Create a file and read, write operations using different child process

15. Demonstrate data sharing between process using Files

16. Implement sorting using pipes

17. Demonstrate FIFO’s

18. Implement Message Queues

19. Demonstrate Semaphores

20. Demonstrate Threads


Two questions will be selected by the examiners (one form section A and one from section B). Students have to write and execute both the programs.



MCS352: SPECIALIZATION PROJECT LAB

Project will be based on the specialization papers which students are opted for.



(a)

MCS451

FOURTH SEMESTER PROJECT

No of Hours/Week: 30

It is a full time project to be taken up either in the industry or in an R&D organisation.
