Upload
vudien
View
238
Download
2
Embed Size (px)
Citation preview
Basaveshwar Engineering College(Autonomous), Bagalkot Department of Computer Applications (MCA)
Scheme and Syllabus for IV Semester MCA Sl. No.
Subject code SubjectNo. of hours per week
Lecture Tutorial Practical Total credits1 PCA431C Software Engineering 4 0 0 4
2 PCA432C Advanced Java 4 0 0 4
3 PCA433C Web Technologies 4 0 0 4
4 Elective – 2 4 0 0 4
5 Elective – 3 4 0 0 4
6 PCA434L Advanced Java Laboratory 0 0 2 1
7 PCA435L Web Design Laboratory 0 0 2 1
8 PCA436S Seminar –I 0 2 0 1
9 PCA437P Mini Project-I 0 1 3 2
Total 20 3 7 25
Basaveshwar Engineering College(Autonomous), Bagalkot Department of Computer Applications (MCA)
Scheme and Syllabus for III Semester MCA Sl. No.
Subject code SubjectNo. of hours per week
Lecture Tutorial Practical Total credits1 PCA331C Computer Networks 4 0 0 4
2 PCA332C Introduction to Java 4 0 0 4
3 PCA333C System Software 4 0 0 4
4 PCA334C Database Concepts and Applications 4 0 0 4
5 Elective – 1 4 0 0 4
6 PCA335L Computer Networks Laboratory 0 0 3 1.5
7 PCA336L Java Laboratory 0 0 3 1.5
8 PCA337L Database Laboratory 0 1 3 2
Total 20 1 9 25
Basaveshwar Engineering College(Autonomous), Bagalkot Department of Computer Applications (MCA)
Scheme and Syllabus for V Semester MCA Sl. No.
Subject code SubjectNo. of hours per week
Lecture Tutorial Practical Total credits1 PCA531C Object Oriented Analysis and Design 4 0 0 4
2 PCA532C .Net Technologies 4 0 0 4
3 PCA533C Mobile Computing and Applications 4 0 0 4
4 Elective – 4 4 0 0 4
5 Elective – 5 4 0 0 4
6 PCA534LObject oriented analysis and design laboratory
0 0 2 1
7 PCA535L .Net Laboratory 0 0 2 1
8 PCA536S Seminar – II 0 2 0 1
9 PCA537P Mini Project – II 0 1 3 2
Total 20 3 7 25
PCA331C: Computer Networks
4 credits (4-0-0)
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13Hours
Introduction: A Communication Model; Data Communications; Data Communication
Networking: Wide Area Networks, Local Area Networks; Protocols and Protocol
Architecture: A Three-Layer Model. Protocols and Architecture: Protocols:
Characteristics, Functions; OSI: The model, Standardization within the OSI Framework,
Service Primitives and Parameters, The OSI Layers; TCP/IP Protocol Suite: The TCP/IP
Approach. TCP/IP, Protocol Architecture, Operation of TCP and IP, Protocol Interfaces,
The Applications. Digital Data Digital Signals: Non-return to zero (NRZ), Multilevel
Binary, Bi-phase, Modulation Rate, Scrambling Techniques; Data Link Control: Flow
Control: Stop and Wait & Sliding Window Flow Controls; Error Detection: Parity Check,
CRC; Error Control: Stop and Wait ARQ, GO-Back-N ARQ, Selective-Reject ARQ;
UNIT II 13Hours
Circuit and Packet Switching: Switching Networks, Circuit Switching Networks,
Circuit Switching Concepts: Space Division and Time Division Switching; Packet
Switching Principles: Switching Techniques, Packet Size, Comparison of Circuit
Switching and Packet Switching, X.25. ATM and Frame Relay: Protocol Architecture;
ATM Logical Connections; ATM Cells; Transmission of ATM Cells; ATM Service
Categories; ATM Adaptation Layer; Frame Relay. Network layer and Routing
Algorithms: Routing algorithms: The Optimality Principal, Shortest Path Routing,
Flooding, Distance Vector Routing, Link state Routing, Hierarchical Routing, Broadcast
Routing, Multicast Routing, Routing for Mobile Hosts; Congestion Control Algorithms:
General Principles of Congestion Control, Congestion Prevention Policies, Congestion
Control in Virtual-Circuit Subnets, Congestion Control in Datagram Subnets, Load
Shedding, Jitter Control; Quality Of Service: Requirements, Techniques for Achieving
Good Quality of Service, Integrated Services, Differentiated Services; Internetworking:
How networks differ, How Networks Can Be Connected, Concatenated Virtual Circuits,
Connectionless Internetworking; Tunneling; Internetwork Routing; Fragmentation
UNIT III 13 Hours
The Network Layer in the Internet: The IP Protocol, IP Addresses, Internet Control
Protocols, The Interior Gateway Routing Protocol : OSPF, The Exterior Gateway
Routing Protocol: BGP The Transport Layer: The Transport Service: Services Provided
to the Upper Layers, Transport Service Primitives, Berkley Sockets; Elements of
Transport Protocols: Addressing, Connection Establishment, Connection Release, Flow
Control and Buffering, Multiplexing, Crash Recovery; The Internet Transport Protocols
- UDP: Introduction to UDP, Remote Procedure Call, The Real-Time Transport Protocol;
The Internet Transport Protocols - TCP: Introduction to TCP, The TCP Service Model,
The TCP Protocol, The TCP Segment Header, TCP Connection Establishment, TCP
Connection Release, Modeling TCP Connection Management, TCP Transmission Policy,
TCP Congestion Control, TCP Timer Management.
UNIT IV 13 Hours
The Application Layer and Network Security: DNS- The Domain Name System: The
DNS Name Space, Resource Records, Name Servers; Electronic Mail: Architecture and
Services, The User Agent, Message Formats, Message Transfer, Final Delivery; The
World Wide Web: Architectural Overview, Static Web Documents, Dynamic Web
Documents, HTTP, Performance Enhancements, The Wireless Web. Cryptography:
Introduction to Cryptography, Substitution Ciphers, Transposition Ciphers, Two
Fundamental Cryptographic Principles; Symmetric key Algorithms: DES-The Data
Encryption Standard, AES - The Advanced Encryption Standard; Public key algorithms:
RSA, Digital Signatures, Symmetric-Key Signature, Public key Signature, Message
Digests.
Text Books:
1. William Stallings, Data and Computer Communication, Seventh Edition, Pearson
Education, 2001.
2. Andrew S. Tanenbaum, Computer Networks, Fourth edition, PHI Publication, 2002.
Reference books:
1. Behrouz A. Forouzan, Data Communications and Networking, Second edition
Tata McGraw-Hill,2001.
2. Alberto Leon - Garcia and Indra Widjaja , Communication Networks -Fundamental
Concepts and Key architectures, Tata McGraw-Hili, 2000.
3. Achyut S Godbole , Data Communications and Networks, Tata McGraw-Hili, 2002.
PCA332C: Introduction to Java
4 credits (4-0-0)
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction: The Java Language, The Key Attributes of Object-Oriented Programming,
The Java Development Kit, A First Simple Program, The Java Class Libraries. Java’s
Primitive Types, Literals, A Closer Look at Variables, The Scope and Lifetime of
Variables, operators, Shorthand Assignments, Type conversion in Assignments, Using
Cast, Operator Precedence, Expressions, Input characters from the Keyword.
Introducing Classes, Objects and Methods Class Fundamentals: How Objects are
Created, Reference Variables and Assignment, Boxing and Unboxing. Methods and
Method Types: Returning from a Method, Returning Value, Using Parameters,
Constructors, Parameterized Constructors, The this Keyword. Method Overloading,
Overloading Constructors, Recursion, Understanding Static.
UNIT II 13 Hours
Program Control Statements: The if statement, Nested ifs, if-else-if Ladder, The
Switch Statement, for Loop, Enhanced for Loop, While Loop, The do while Loop, Use
break, Use continue, Nested Loops. More Data Types: Arrays, Multidimensional
Arrays, Alternative Array Declaration Syntax, Assigning Array References, Using the
Length Member, The For-Each Style for Loop. String and String handling functions.
UNIT III 13 Hours
Inheritance : Inheritance Basics, Member Access and Inheritance, Constructors and
Inheritance, Using super to Call Superclass constructors, Using super to Access
Superclass Members, Method Overriding, Overridden Methods support polymorphism,
Why Overridden Methods, Using Abstract Classes, Using final. Interface Fundamentals,
Creating an Interface, Implementing an Interface, Using Interface References,
Implementing Multiple Interfaces Packages : Package Fundamentals, Packages and
Member Access, Importing Packages Exception Handling : The Exception Hierarchy,
Exception Handling Fundamentals, using Multiple catch clauses, User defined exception:
Throwing an Exception, A Closer look at Throwable, using finally, System defined
Exception using throws
UNIT IV 13 Hours
Multithreaded Programming: Multithreading fundamentals, The Thread Class and
Runnable Interface, Creating Thread, Thread Priorities, Synchronization, using
Synchronization Methods, The Synchronized Statement, Thread Communication using
notify(), wait() and notify All(), suspending, Resuming and stopping Threads.
Applets:Applet basics, A complete Applet Skeleton, Applet Initialization and
Termination, A key Aspect of an Applet Architecture, Requesting Repainting, using the
status window, Passing parameters to Applets. Exploring Collection Framework:
Collections Overview, The Collection Interfaces, The collection Classes. The Arrays
Class.
Text book
1. Herbert Schildt, Dale Skrien, Java Fundamentals-A comprehensive Introduction,
Tata McGraw Hill Edition 2013.
Reference books
1.T V Suresh Kumar, B Eshwara Reddy and P Raghavan, Programming with Java,
Sanguine Technical Publishers, 2011.
2. Hari Mohan Pandey, Java Programming, Pearson Education, 2012.
3. KoGenT , Java 6 Programming, Black Book, dreamtech Press, 2012.
4. Y.Daniel Liang, Introduction to Java Programming, Pearson Education, Comprehensive Edition ,2011.
PCA333C: System Software
4 credits (4-0-0)
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Machine Architecture: Introduction, System Software and Machine Architecture,
Simplified Instructional Computer (SIC) - SIC Machine Architecture, SIC/XE Machine
Architecture, SIC Programming Examples, Traditional (CISC) Machines - VAX
Architecture, RISC Machines - Ultra SPARC Architecture, Assemblers: Basic
Assembler Function - A Simple SIC Assembler, Assembler Algorithm and Data
Structures, Machine Dependent Assembler Features - Instruction Formats & Addressing
Modes, Program Relocation, Machine Independent Assembler Features - Literals,
Symbol-Definition Statements, Expression, Program Blocks, Control Sections and
Programming Linking
UNIT II 13 Hours Assembler Design Options - One-Pass Assembler, Multi-Pass Assembler.
Loaders and Linkers: Basic Loader Functions - Design of an Absolute Loader, A
Simple Bootstrap Loader, Machine-Dependent Loader Features - Relocation, Program
Linking, Algorithm and Data Structures for a Linking Loader, Machine-Independent
Loader Features - Automatic Library Search, Loader Options, Loader Design Options -
Linkage Editor, Dynamic Linkage, Bootstrap Loaders
UNIT III 13 Hours
Macro Processor: Basic Macro Processor Functions - Macro Definitions and Expansion,
Macro Processor Algorithm and Data Structures, Machine-Independent Macro Processor
Features - Concatenation of Macro Parameters, Generation of Unique Labels, Conditional
Macro Expansion, Keyword Macro Parameters, Macro Processor Design Options -
Recursive Macro Expansion, General-Purpose Macro Processors, Macro Processing
Within Language Translators, Lex and Yacc: Lex and Yacc - The Simplest Lex
Program, Recognizing Words With LEX, Symbol Tables, Grammars, Parser-Lexer
Communication, The Parts of Speech Lexer, A YACC Parser, The Rules Section,
Running LEX and YACC, LEX and Hand- Written Lexers, Using LEX - Regular
Expression, Examples of Regular Expressions, A Word Counting Program, Parsing a
Command Line, Using YACC - Grammars, Recursive Rules, Shift/Reduce Parsing, What
YACC Cannot Parse, A YACC Parser - The Definition Section, The Rules Section,
Symbol Values and Actions, The LEXER, Compiling and Running a Simple Parser,
Arithmetic Expressions and Ambiguity, Variables and Typed Tokens.
UNIT IV 13 Hours
Compilers: Basic Compiler Functions - Grammars, Lexical Analysis, Syntactic Analysis,
Code Generation, Machine Dependent Compiler Features - Intermediate Form Of The
Program, Machine-Dependent Code Optimization, Machine Independent Compiler
Features - Structured Variables, Machine Independent Code Optimization, Storage
Allocation, Block Structured Languages, Compiler Design Options - Division Into
Passes, Interpreters, P-Code Compilers, Compiler-Compilers.
Text Book
1. Leland.L.Beck, System Software, 3rd Edition, Addison-Wesley, 1997.
2. John.R.Levine, Tony Mason and Doug Brown, Lex and Yacc, O'Reilly, SPD, 1999
Reference Book
1. D.M.Dhamdhere, System Programming and Operating Systems, 2nd Edition, TMH,
1999.
PCA334C: Database Concepts and Applications
4 credits (4-0-0)
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Databases and Database Users: Introduction, An Example, Characteristics of the
Database Approach, Actors on the scene, Workers behind the scene, Advantages of using
the DBMS approach, A brief history of database applications, When not to use a DBMS,
Database System Concepts and Architecture: Data models, schemas and instances,
Three-schema architecture and data independence, Database language and interfaces, The
database system environment. Data Modeling Using the Entity-Relationship(ER)
Model: Using High-Level Conceptual Data Models for Database Design; An Example
Database Application; Entity Types, Entity Sets, Attributes and Keys; Relationships,
Relationship Types, Roles and Structural Constraints; Weak Entity Types; Refining the
ER Design for the COMPANY Database; ER Diagrams, Naming Conventions and
Design Issues.
UNIT II 13 Hours
The Relational Data Model and Relational Database Constraint: Relational Model
Concepts, Relational Constraints and Relational Database Schemas, Update Operations,
Transactions, and Dealing with Constraint Violations. Relational Algebra and Relational
Calculus: Unary Relational Operations, Relational Algebra Operations from Set Theory,
Binary Relational Operations, Additional Relational Operations; Examples of Queries in
Relational Algebra. Relational Database Design Using ER and EER to-Relational
Mapping: Relational Database Design Using ER to Relational Mapping. SQL-99:
Schema Definition, Constraints, Queries and Views: SQL Data Definition and Data
types, Specifying Constraints in SQL, Schema Change statement in SQL, Basic Queries
in SQL, More Complex SQL Queries, Insert, Delete and Update Statements in SQL,
Specifying Constraints as Assertion and Triggers, Views (Virtual Tables) in SQL,
Additional Features of SQL.
UNIT III 13 Hours
Functional Dependencies and Normalization for Relational Database: Informal
Design Guidelines for Relation Schemas, Functional Dependencies, Normal Forms Based
on Primary Keys, General Definitions of Second and Third Normal Forms, Boyce-Codd
Normal Form. Relational Database Design Algorithms and Further Dependencies:
Properties of Relational Decompositions, Algorithms for Relational Database Schema
Design; Multi-valued Dependencies and fourth normal form, Join Dependencies and fifth
normal form, Inclusion Dependencies; Other Dependencies and Normal Forms.
Overview of Query Evaluation The System Catalog: Information in the Catalog;
Introduction to Operator Evaluation: Three Common Techniques, Access Paths;
Algorithms for Relational Operations: Selection, Projection, Join, Other Operations;
Introduction to Query Optimization: Query Evaluation Plans, Multi-operator Queries,
Pipelined Evaluation, The Iterator Interface; Alternative Plans: A Motivating Example:
Pushing Selections, Using Indexes; What a Typical Optimizer Does: Alternative Plans
Considered, Estimating the Cost of a Plan.
UNIT IV 13 Hours
Overview of Transaction Management: The ACID Properties: Consistency and
Isolation, Atomicity and Durability; Transactions and Schedules; Concurrent Execution
of Transactions: Motivation for Concurrent Execution, Serializability, Anomalies due to
Interleaved Execution, Schedules Involving Aborted Transactions; Lock- Based
Concurrency Control: Strict Two-Phase Locking, Deadlocks; Performance of Locking;
Transaction Support in SQL: Creating and Terminating Transactions, What Should We
Lock? Transaction Characteristics in SQL: Introduction to Crash Recovery: Stealing
Frames and Forcing Pages, Recovery - Related Steps during Normal Execution,
Overview of ARIES recovery algorithm, Atomicity: Implementing Rollback. Database
Security, Introduction to Database Security; Access Control; Discretionary Access
Control: Grant and Revoke on Views and Integrity Constraints; Mandatory Access
Control: Multilevel Relations and Polyinstantiation, Covert Channels, DoD Security
Levels.
Text books
1. R. Elmasri and S. Navathe, Fundamentals of Database Systems, Fifht Edition,
Pearson Education 2011.
2. Raghu Ramakrishnan and Johannes Gehrke, Database Management Systems,Third
Edition, McGraw-Hill 2003.
Reference books
1. Silberschatz,Korth and Sudarshan, Database System Concepts, Fourth Edition,
McGraw-Hill.
2. Alexis Leon, Mathews Leon, Vikas,Database Management Systems, Publishing
House.
3.Database Systems: A practical approach to design implementation and management -
Connolly. Third Edition, Pearson Education.
PCA335L: Computer Networks Laboratory
1.5 Credits (0- 0-3)
CIE Marks: 50 SEE Marks:50
Total Hours: 42 SEE Hours: 03
1. Simulate a three nodes point - to - point network with a duplex link between them. Set
the queue size and vary the bandwidth and find the number of packets dropped.
2. Simulate a four node point - to - point network, and connect the links as follows:
n0 - n2, n1 - n2 and n2 - n3. Apply TCP agent between n0 - n3 and UDP n1 - n3.
Demonstrate relevant applications over TCP and UDP agents, changing the parameters
and determine the number of packets sent by TCP/UDP.
3. Simulate the different types of Internet traffic such as FTP, TELNET over a network
and analyze the throughput.
4. Simulate the transmission of ping messages over a network topology consisting of 6
nodes and find the number of packets dropped due to congestion.
5. Simulate an Ethernet LAN using N nodes (6 - 10), change error rate and data rate and
compare throughput.
6. Simulate an Ethernet LAN using n nodes and set multiple traffic nodes and determine
collisions across different nodes.
7. Write a C program for shortest path routing algorithm.
8. Write a C program for distance vector routing algorithm to find suitable path for
transmission.
9. Write a C program to convert plain text to cipher text, using Caesar cipher.
10. Write a C program to perform character stuffing and destuffing on a given set
of data.
11. Write a C program to find a minimum spanning tree of a given subnet.
12. Write a C program for frame sorting technique used in the buffer.
PCA336L: Java Laboratory
1.5 Credits (0- 0-3)
CIE Marks: 50 SEE Marks: 50 Total Hours: 42 SEE Hours: 03
1. Write a simple java program to read a input from keyboard and implement the following:
a) Boxing and UnBoxing.
b) Calculate employee salary.
2) Write a JAVA program:
a) Use scanner class to calculate gross pay, based on number of hours employee
worked and hourly pay rate by considering following constraints:
1. If hours less than 40 hours then no salary calculation.
2. If hours more than 40 hours then 33% as extra.
3. If hours are more than 60 hours then no salary calculation.
b) Write a JAVA program check number is palindrome or not.
3) Write a JAVA program to demonstrate the following:
a) Using the constructor create class called account (initial balance as the parameter
and initial balance should not be less than 500) and demonstrate the debit and
credit operations.
b) Write a JAVA program to add sum of digits of a given number.
4) a) Write a JAVA program for String handling which performs the following:
1. Checks the capacity of StringBuffer objects.
2. Reverse the content of a String
3. Read second String from the console and append it to reversed
String.
b) Write a JAVA program to number is prime or not.
5) a) Write a JAVA program to demonstrate the queue operations.
b) Write a JAVA program to calculate even sum and odd sum from given array of
integers.
6) a) Write a JAVA code to create thread by extending the thread class.
b) Write a JAVA code to add two matrixes.
7) a) Write a JAVA program to implement stack operations using exception handling
mechanism.
b) Write a java code for String sorting using for-each.
8) a) Write a JAVA code to demonstrate the parameter passing to the applet.
b) Write a JAVA program to read a file convert the characters to uppercase without
using built in functions and write the result to second file.
9) a) Write a JAVA program to implement the binary search.
b) Write a JAVA program to demonstrate the use of packages. Create a package
called student which includes student class to read student details such as usn,
name, semester and address. Create another package called CIE which includes
class called CIE to read three subjects CIE details and check eligibility for SEE.
10) Write a JAVA program to implement Linked List using java.util package.
PCA337L: Database Laboratory
2 Credits (0- 1- 3)
CIE Marks: 50 SEE Marks:50 Total Hours: 56 SEE Hours: 03
1. Consider the following relations of medical consultation centre:
FACULTY (F_id, F-name, F-designation).
PATIENT (P_id, P_name, p_address, date_of_ registration).
CONSULTATION DATE (C_date, F_id, P_id).
Create tables for above relations considering suitable data types and constraints. Insert 5 appropriate tuples in the tables.
Write the SQL statements for the following queries.
1. Generate list of patients and their consultation detail.2. Find patients consulted by specific faculty.3. Find the details of the entire faculty whose designation is a senior doctor and have
consultation date next month.4. Find the patient whose consultation date is today along with the concerned faculty
detail.2. Consider the following relations of the manufacturing unit.
EMPLOYEE (Essn, Ename, Dept_No, Salary, date_of_join)
DEPENDENT (Essn, Depend_Name, Relation, Dob)
DEPARTMENT (Dept_No, Dept_Name, Manager)
Create tables for above relations considering suitable data types and constraints. Insert 5 appropriate tuples in the tables.
Write the SQL statements for the following queries.
1. Find details of dependents for employee with a given name.2. Find the name of the manager of the department in which employee with a given
ESSN Code works.3. Find the name of all employees whose age is less than 35 years.4. Find the DOB of a son/daughter of an employee with a given employee code.
3. Consider the Insurance database given below. The primary keys are underlined and the datatypes are specified.
PERSON (driver-id#: string, name: string, address: string)
CAR (regno: string, model: String, year: int)
ACCIDENT (report-number: int, adate: date, location: string)
OWNS (driver-id#: string, regno: string)
PARTICIPATED (driver-id: string, regno: string, report-number: int, damageamount: int)
Create tables for above relations considering constraints. Insert five appropriate tuples in the tables.
Write the SQL statements for the following queries.
1. Demonstrate how youa. Update the damage amount for the car with a specific regno in
the accident with a given report number to a specified amount.b. Add a new accident to the database.
2. Find the owner of car that is involved in the accident of specific date.3. Find the total damage amount out of accidents between given dates.4. Find the car that is frequently meeting an accident.5. Find person and his accident details
4. Consider the following relations for an order processing database application in a
company.
CUSTOMER (cust#: int, cname: string, city: string)
CUST-ORDER (corder#: int, odate: date, cust#: int, ord-amt: int)
ORDER-ITEM (corder#: int, item#: int, qty: int)
ITEM (item#: int, unit-price: int)
SHIPMENT (corder#: int, warehouse#: int, ship-date: date)
WAREHOUSE (warehouse#: int, city: string)
Create tables for above relations defining appropriate constraints. Insert five appropriate tuples in the tables.
Write the SQL statements for the following queries.
1. Display detail of orders of specific customer.2. Display detail of orders of the items in a proper order. 3. Produce a listing: CustName, Orders, Avg_Order_Amt, where the middle column
is the total number of orders by the customer and the last column is the average order amount for that customer
4. List the orders that were shipped from all the warehouses that the company has in a specific city.
5. Referring problem definition of question 1, write the SQL statements for the
following queries.
1. List the details of all patients who have got consultation dates fixed between said dates.
2. Find the first patient registered in the center along with consultation details.
3. Generate up-todate list of faculty-wise the number of consultations.4. Generate the list of faculty-wise consultation per month for the specific year.
6. Referring problem definition of question 2, write the SQL statements for the
following queries.
1. Display the list of employees who joined in the specific year.2. Find the details of the departments in which the employee having experience of at
least ten years.3. Find number of employees in each department.4. Fine the employee whose salary is greater than the salary of a manager.
7. Referring problem definition of question 1, write the SQL statements for the
following queries.
1. Generate list of patients who visited the center for consultation at least three times.
2. Find the patient frequently visiting the center.3. Find the faculties who have maximum consultations.4. Find the patient who is consulted by all faculties.
8. Referring problem definition of question 3, write the SQL statements for the
following queries.
1. Find the total number of people who owned cars that were involved in accident in 2002.
2. Find the number of accidents in which cars belonging to a specific model were involved.
3. Find the model highly involved in the accidents.4. Generate the list of yearwise damage amount.
9. Referring problem definition of question 3, write the SQL statements for the
following queries.
1. Generate the list of most sensitive accident location and the number of accidents occurred there.
2. Find the vehicle that is involved in the accident at sensitive location.3. Count number of accidents happening each year.4. Find first two highest damage amounts.
10. Referring problem definition of question 4, write the SQL statements for the
following queries.
1. Demonstrate how you delete an Item with a given number from ITEM table and make that field null in the ORDER-ITEM table.
2. Generate the list of orders to be shipped next month.
3. Display the list of orders whose customer exists in the same city that of the warehouse.
4. To display which item is highly demanded by the customers.11. Consider a “Library Management System” which keeps the following tables:
BOOK (isbn-no, book-title, author, publisher, edition, year-of-copyright)
BOOKACCESSION (accession-no, isbn-no, date-of-purchase)
MEMBERS (m-id, m-name, m-address, m-phone).
ISSUE-RETURN (accession-no, m-id, expected-date-of-return, actual-date-of-
return)
Create tables for above relations defining appropriate data type and constraints. Insert five appropriate tuples in the tables. Please note that a member can be issued a book for a period of 15 days. The actual-date-of-return is kept blank for the books that have not been returned.
Write the SQL statements for the following queries.
1. Find the m-id and m-name of the members who have maximum number of un-returned books.
2. List the book details along with the number of copies for that book in the library (issued and not-issued both)
3. Find the names of all those students who have got all the books issued to him of the given author.
4. Find the books expected to be returned in this week.5. Find those members who have not got any book issued to him/her during last six
months.12. The following tables are maintained by a book dealer.
AUTHOR (author-id: int, name: string, city: string, country: string)
PUBLISHER (publisher-id: int, name: string, city: string, country: string)
CATALOG (book-id: int, title: string, author-id: int, publisher-id: int, category-
id: int, year: int, price: real)
CATEGORY (category-id: int, description: string)
ORDER-DETAILS (order-no: int, book-id: int, quantity: int)
Create tables for above relations defining appropriate data type and constraints. Insert five appropriate tuples in the tables.
Write the SQL statements for the following queries.
1. Give the details of the authors who have 2 or more books in the catalog and the price of the books is grater than the average price of the books in the catalog and the year of publication is after 2000.
2. Find the author of the book, which has maximum sales.3. Demonstrate how you increase the price of books published by a specific
publisher by 10%.
PCA431C: Software Engineering
4 credits (4-0-0)
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Overview: Introduction: FAQ's about software engineering, Professional and ethical
responsibility. Software Processes: Software Process Models, Process iteration,
Software specification, Software design and implementation, Software validation,
Software evolution, Automated Process support. Requirements Engineering: Software
Requirements: Functional and Non-functional requirements, User requirements, System
requirements. The software requirements document.
UNIT II 13 Hours
Requirements engineering processes- Feasibility studies,Requirements elicitation and
analysis, Requirements validation, Requirements management. System models: Context
models, Behavioral models, Data models, Object models, CASE workbenches. Software
prototyping: Prototyping in software process. Rapid prototyping techniques, User
interface prototyping.
UNIT III 13 Hours
Software Design: Architectural- design-System structuring, Control models, Modular
decomposition, Domain specific architectures. Verification and Validation: Verification
and validation planning, Software inspections, Automated static analysis, Clean room
software development. Software Testing: Defect testing, Integration testing, Object
oriented testing, Testing Workbenches.
UNIT IV 13 Hours
Software Management: Project management-Management activities, Project planning,
Project Scheduling, Risk management. Managing people: Limits to thinking, Group
working, Choosing and keeping people, The people capability maturity model. Quality
Management: Quality assurance and standards, Quality Planning, Quality Control,
Software measurements and metrics.
Text book
1. Ian Sommerville, Software Engineering, 6th Edition, Person Education Ltd., 2001.
Reference books
1.Roger.S.Pressman,Software Engineering-A Practitioners approach, Tata-McGraw Hill,
4th Edition.
2.Pankaj Jalote, An Integrated Approach to Software Engineering , Narosa Publications.
3.Stephen R.Schach, Object Oriented & Classical Software Engineering, Tata McGraw
Hill, 2002.
PCA432C: Advanced Java
4 credits (4-0-0)
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Servlets: Servlet Structure, Servlet packaging, HTMLbuilding utilities, Lifecycle, Single
Thread model interface, Handling Client Request: Form Data, Handling Client Request:
HTTP Request Headers. Generating server Response: HTTP Status codes, Generating
server Response: HTTP Response Headers, Handling Cookies, Session Tracking.
JSP: Overview of JSP Technology, Need of JSP, Benefits of Jsp, Advantages of JSP,
Basic sysntax, Invoking java code with JSP scripting elements, creating Template Text,
Invoking java code from JSP, Limiting java code in jsp, using jsp expressions, comparing
servlets and jsp, writing scriptlets, scriplet example Using Scriptlets to make parts of jsp
conditional, using declarations, declaration example.
UNIT II 13 Hours
Controlling the Structure of generated servlets: the JSP page directive, import
attribute, session attribute,isElignore attribute, buffer and auto flush attributes, info
attribute ,errorPage and is errorPage attributes, is Thread safe Attribute, extends attribute,
language attribute, Including files and applets in jsp Pages, using java beans components
in JSP documents. Java Beans & Annotations: Understanding the benefits of beans,
creating beans, installing bean classes on your server, Accessing bean properties,
explicitly setting bean properties, automatically setting bean properties from request
parameters, sharing beans among multiple servlets and jsp pages.
UNIT III 13 Hours
JDBC: Talking to Database, Types of JDBC, Essential JDBC program, using prepared
Statement JDBC in Action Result sets, Batch updates, Mapping, Basic JDBC data types,
Advanced JDBC data types, immediate solutions. Integrating Servlets and JSP:
The Model View Controller (MVC) Architecture:Understanding the benefits of MVC,
Using RequestDispatcher to implement the MVC, Forwarding request to jsp pages,
handling relative urls, choosing among different display options, forwarding requests
from jsp pages, including pages instead of forwarding to them.
UNIT IV 1 3 Hours
Exploring the struts architecture: Introducing application frameworks, MVC, and
Model2, understanding how struts works, using struts control flow, exploring the
strengths and weakness of struts.
Text books
1. Marty Hall, Larry Brown. Core Servlets and Java Server Pages. Volume 1: Core
Technologies. Second Edition.
2. Herbert Schildt, Java The Complete Reference, Eight Edition. Comprehensive
coverage of the Java Language. Tata McGraw-Hill Edition – 2011.
3. Java 6 Programming Black Book, Dreamtech Press. 2012
Reference book
1. Michael Sikora, EJB 3 Developer Guide, A practical guide for developers and
architects to the Enterprise Java Beans Standard, Shroff Publishers & Distributors PVT
LTD. July 2008.
PCA433C: Web Technologies
4 credits (4-0-0)
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Fundamentals of Web, XHTML - 1 : Internet, WWW, Web Browsers, and Web Servers;
URLs; MIME; HTTP; Security; The Web Programmers Toolbox. XHTML: Origins and
evolution of HTML and XHTML; Basic syntax; Standard XHTML document structure;
Basic text markup; Images; Hypertext Links; Lists; Tables; Forms; Frames; Syntactic
differences between HTML and XHTML.
UNIT II 13 Hours
CSS Introduction; Levels of style sheets; Style specification formats; Selector forms;
Property value forms; Font properties; List properties; Color; Alignment of text; The Box
model; Background images; The <span> and <div> tags; Conflict resolution. Javascript :
Overview of Javascript; Object orientation and Javascript; General syntactic
characteristics; Primitives, operations, and expressions; Screen output and keyboard
input; Control statements; Object creation and modification; Arrays; Functions;
Constructor; Pattern matching using regular expressions; Errors in scripts; Examples.
UNIT III 13 Hours
Javascript and HTML Documents, Dynamic Documents with Javascript : The Javascript
execution environment; The Document Object Model; Element access in Javascript;
Events and event handling; Handling events from the Body elements, Button elements,
Text box and Password elements; The DOM 2 event model; The navigator object; DOM
tree traversal and modification. Introduction to dynamic documents; Positioning
elements; Moving elements; Element visibility; Changing colors and fonts; Dynamic
content; Stacking elements; Locating the mouse cursor; Reacting to a mouse click; Slow
movement of elements; Dragging and dropping elements. XML : Introduction; Syntax;
Document structure; Document Type definitions; Namespaces; XML schemas;
Displaying raw XML documents; Displaying XML documents with CSS; XSLT style
sheets; XML processors; Web services.
UNIT IV 13 Hours
Introduction to PHP: Origins and uses of PHP, Overview of PHP, General syntactic
characteristics, Primitives, operations and expressions, Output, Control statements,
Arrays, Functions, Pattern matching, Form handling, Files. Building Web applications
with PHP: Tracking users, cookies, sessions, Using Databases, Handling XML.
Introduction to Ruby: Origins and uses of Ruby, Scalar types and their operations,
Simple input and output, Control statements, Arrays, Hashes, Methods, Classes, Code
blocks and iterators, Pattern matching. Introduction to Rails: Overview of Rails,
Document requests, Processing forms, Rails applications with Databases, Layouts.
Text book
1. Robert W. Sebesta, Programming the World Wide Web, 4th Edition, Pearson
Education, 2008.
2. Chris Bates, Web Programming Building Internet Applications, 3rd Edn, Wiley India,
2006.
Reference book
1. Eric Ladd, Jim O’ Donnel, Using HTML 4, XML and Java, Prentice Hall of India –
QUE, 1999.
PCA434L: Advanced Java Laboratory
1 Credit (0- 0- 2)
CIE Marks: 50 SEE Marks: 50 Total Hours: 28 SEE Hours: 03
1. Write a Servlet Program to implement a dynamic HTML using Servlet (user
name and Password should be accepted using HTML and displayed using a Servlet).
2. Write a Servlet Program to Auto Web Page Refresh (Consider a webpage which
is displaying Date and time For all such type of pages, you would need to refresh
your web page regularly; Java Servlet makes this job easy by providing refresh
automatically after a given interval).
3. Write a Servlet Program to implement and demonstrate get() and Post methods(Using
HTTP Servlet Class).
4. Write a Servlet Program using cookies to remember user preferences.(user
name,password) at client machine
5. a. Write a JSP Program to implement verification of a particular user login and
display a Welcome page.
b. Write a JSP program to demonstrate the import attribute.
6. a. Write a JSP Program which uses jsp: include action to display aWebpage.
b. Write a JSP Program which uses <jsp:plugin> tag to run a applet.
7. Write a JSP Program to get student information through a HTML and create a
JAVA Bean.
8. Write a JAVA Program to insert data into Student DATA BASE and retrieve info
based on particular queries using any popular database(For example update, delete,
search etc…).
9. Write a struts application to demonstrate the user login process.
10. Write a struts application to demonstrate validation using validate.xml
PCA435L: Web Design Laboratory
1 Credit (0- 0- 2)
CIE Marks: 50 SEE Marks: 50 Total Hours: 28 SEE Hours: 03
1. Develop and demonstrate an XHTML document that illustrates the use of external
style sheet, ordered list, table, borders, padding, color and the <span> tag.
2. Develop and demonstrate an XHTML file that includes JavaScript script for the
following problems:
a) Input: A number n obtained using input box
Output: The first n Fibonacci numbers
b) Input: A number n obtained using input box
Output: A table of numbers from 1 to n and their squares using alert
3. Develop and demonstrate an XHTML file that includes JavaScript Script that uses
functions for the following problems:
a) Parameter: A string
Output: The position of the left-most vowel in the string
b) Parameter: A number
Output: The number with its digits in the reverse order
4. a) Develop and demonstrate, using JavaScript script, an XHTML document that
collects the USN of the student. Event handler must be included for the form
element that collects this information to validate the input. Messages in the alert
windows must be produced when errors are detected.
b) Modify the above program to get the current year of registration.
5. a) Develop and demonstrate, using JavaScript script, an XHTML document that
contains three short paragraphs of text, stacked on top of each other, with only enough of
each showing so that the mouse cursor can be placed over some part of them. When the
cursor is placed over the exposed part of any paragraph, it should rise to the top to
become completely visible.
b) Modify the above document so that when a paragraph is moved from the top stacking
position, it returns to its original position rather than to the bottom.
6. a) Design an XML document to store information about a student in an engineering
college. The information must include USN, Name, Name of the College, Branch, Year
of joining, and e-mail id. Create sample data for 3 students. Create a CSS style sheet and
use it to display the document.
b) Create an XSLT style sheet for one student element of the above document and use it
to create a display of that element.
7. a) Write a PHP program to store current date-time in a COOKIE and display the ‘Last
visited on’ date-time on the web page upon reopening of the same page.
b) Write a PHP program to store page views count in SESSION, to increment the count
on each refresh, and to show the count on web page.
8. Create an XHTML form with Student Name, USN, YOJ, Branch, Sem, Address and
E-mail text fields. On submitting, store the values in MySQL table. Retrieve and display
the data based on USN using PHP.
9. Write a Ruby program which demonstrates the usage of regular expressions.
10. Using Rails and MySQL, develop a program to accept book Information viz.
Accession number, title, authors, edition and Publisher from a web page and store the
information in a database And to search for a book with the title specified by the user and
to Display the search results with proper headings.
PCA436S: Seminar-I
1 Credit (0-2-0)
CIE Marks: 50 SEE Marks: 50 Total Hours: 28 SEE Hours: 03
Each student has to submit the synopsis of the seminar topic and should get approval
from the departmental head. The department will allot the guide for the student. Students
are required to present seminar on said topic with proper consultation with the guide.
PCA437P: Mini Project-I
2 Credit (0- 1- 3)
CIE Marks: 50 SEE Marks: 50 Total Hours: 56 SEE Hours: 03
Each team of 3 students has to submit the synopsis of the mini project based on database
area and should get approval from the departmental head. The department will allot the
guide for the team. Teams are required to present demonstration on said project with
proper consultation with the guide.
Mini Project Assessment
1. Mini project is evaluated for 100 marks(50 CIE and 50 SEE)
2. Allocation of 50 marks for CIE: 3 seminars and related reports write-up: 10+20+20
marks.
3. Allocation of 50 marks for SEE: 25% write-up, 50% Demonstration, and 25% Viva-
voce.
PCA531C: Object Oriented Analysis and Design
4 Credits (4- 0- 0)
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction: An overview of object oriented systems development. Why an object
orientation? Overview of the united approach. Object basics: Introduction, A_ object-
oriented philosophy. Objects. Classes. Attributes: Object behavior and methods.
Encapsulation and Information hiding, Class hierarchy, Polymorphism, Object
relationships and associations. Aggregations and object containment, Case study: Payroll
program, Advanced topics. Object-oriented systems development life cycle: Introduction.
The software development process, Building high quality software, Object oriented
systems development: A use-case driven approach. Reusability.
UNIT II 13 Hours
Methodology, Modeling And UML: Object oriented methodologies, Introduction
Survey of some of the object oriented methodologies, Rumbaugh's Object modeling
technique, The Booch methodology. The Jacobson Methodologies, Patterns,
Frameworks. The unified approach. Unified modeling language: Introduction. Static and
Dynamic models, Why modeling, Introduction to the unified modeling language. UML
diagrams. UML class diagram, Use-case diagram. UML dynamic modeling, Model
management: Packages and model organizations, UML extensibility, UML meta-model.
UNIT III 13 Hours
Object Oriented Analysis :Object oriented analysis, Process-identifying use cases
Introduction, Business object analysis: Understanding the business layer, Use-case driven
object-oriented analysis: The unified approach, Business process modeling. Use-case
model. Development effective documentation. Case study: ViaNet bank ATM. Object
analysis-classification: Introduction. Classifications theory, Approaches for identifying
classes. Noun phrase approach, Common class patterns approach. Use-case driven
approach identifying classes and their behaviors through Sequence/collaboration
modeling, Classes, Responsibilities and collaborators, Naming classes. Identifying object
relationships, Attributes and methods: Introduction, Associations, Super-sub class
relationships, A-part-of relationships-aggregation, Case study. Class responsibility:
Identifying attributes and methods, Class responsibility: Defining attributes by analyzing
use cases and other UML diagrams, Defining attributes for ViaNet bank objects. Object
responsibility: Methods and messages, Defining methods for ViaNet bank objects.
UNIT IV 13 Hours
Object-Oriented Design :The object-oriented design process and design axioms:
Introduction. The object-oriented design process, Object oriented design axioms.
Corollaries. Design patterns. Designing classes: Introduction. The Object-oriented design
philosophy, UML object constraint language. Designing classes: The process. Class
visibility: Designing well-defined public. Private and protected protocols. Designing
classes: Refining attributes. Refining. attributes for the ViaNet bank projects. Designing
methods and protocols. Designing methods for the ViaNet bank objects, Packages and
managing classes.
Text book
1. Ali Bahrami, Object oriented systems development, McGrawHill, 1999.
Reference books
1. Rebecca Wirfs, Designing Object-oriented software. Prentice-Hall India, 1990.
2. Grady Booch, Unified Modeling Language User guide, Addison-Wesley, 1999.
3. Gamma. E, Design patterns: Elements of reusable Object oriented software.
Addison-Wesley, 1995.
4. Martin. J and Odell J, Object-oriented methods: A foundation, Prentice Hall, 1995
PCA532C: .Net Technologies
4 Credits (4- 0- 0)
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Getting started with .NET Framework 4.0 Benefits of .NET Framework, Architecture
of .NET Framework 4.0, Components of .NET Framework 4.0: CLR, CTS, Metadata and
Assemblies, .NET Framework Class Library, Windows Forms, ASP .NET and ASP .NET
AJAX, ADO .NET, Windows workflow Foundation, Windows Presentation Foundation,
Windows Communication Foundation , Widows CardSpace and LINQ. Introducing C#:
Need of C#, C# Pre-processor Directives, Creating a Simple C# Console Application,
Identifiers and Keywords. Data Types, Variables and Constants: Value Types, Reference
Types, Type Conversions, Boxing and Unboxing, Variables and Constants. Expression
and Operators: Operator Precedence, Using the ?? (Null Coalescing) Operator, Using
the :: (Scope Resolution) Operator and Using the is and as Operators. Control Flow
statements: Selection Statements, Iteration Statements and Jump Statements.
UNIT II 13 Hours
Namespaces, Classes, Objects and Structures Namespaces, The System namespace,
Classes and Objects: Creating a Class, Creating an Object, Using this Keyword, Creating
an Array of Objects, Using the Nested Classes, Defining Partial Classes and Method,
Returning a Value from a Method and Describing Access Modifiers. Static Classes and
Static Class Members. Properties: Read-only Property, Static Property, Accessibility of
accessors and Anonymous types. Indexers, Structs: Syntax of a struct and Access
Modifiers for structs.
UNIT III 13 Hours
Object- Oriented Programming: Encapsulation: Encapsulation using accessors and
mutators, Encapsulation using Properties. Inheritance: Inheritance and Constructors,
Sealed Classes and Sealed Methods, Extension methods. Polymorphism: Compile time
Polymorphism/ Overloading, Runtime Polymorphism/Overriding. Abstraction: Abstract
classes, Abstract methods. Interfaces: Syntax of Interfaces, Implementation of Interfaces,
Interaces and Inheritance.
Exception Handling: Exception Handling: The try/catch/finally statement, Checked and
Unchecked Statements
UNIT IV 13 Hours
Data Access with ADO.NET: Understaing ADO.NET: Describing the Architecture of
ADO.NET, ADO.NET Entity Framework. Creating Connection Strings: Syntax for
Connection Strings. Creating a Connection to a Database: SQL Server Database, OLEDB
Database, ODBC Data Source. Creating a Command Object. Working with
DataAdapters: Creating DataSet from DataAdapter, Paging with DatyaAdapters,
Updating with DataAdapters, Adding Mutiple Tables to a DataSet, Creating Data View.
Using DataReader to Work with Databases. Web App. Development with ASP.NET:
Introduction, Web Basics, Multitier Application Architecture, Your First Web
Application: Building WebTme Application, Examining WebTme.aspx’s Code-Behind
File, Standard Web Controls: Designing a Form, Validation Controls, Session Tracking:
Cookies, Session Tracking with http SessionState.ASP.NET AJAX: Traditional Web
Applications, Ajax Web Applications, Testing an ASP.NET Ajax application, the
ASP.NET Ajax Control Toolkit. Case study: Password-Protected Books Database
Application
Text books
1. .NET 4.0 Programming (6-in-1), Black Book, Kogent Learning Solutions Inc., Wiely-
Dream Tech Press.
2. Paul Deitel and Harvey Deitel: C# 2010 for Programmers, 4th Edition, Pearson Education.
References books
1. Andrew Trolsen: Pro C# 5.0 and the .NET 4.5 Framework, 6th Edition, Wiely-Appress.
2. Bart De Smet: C# 4.0 Unleashed, Pearson Education- SAMS Series.
3. Hebert Shildt: Programming in C# 4.0, Tata McGraw Hill.
PCA533C: Mobile Computing and Applications
4 Credits (4- 0- 0)
CIE Marks: 50 SEE Marks: 100
Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Mobile Computing Architecture: Types of Networks, Architecture for Mobile
Computing, 3-tier Architecture, Design Considerations for Mobile Computing, Wireless
Networks – 1: GSM and SMS Global Systems for Mobile Communication ( GSM and
Short Service Messages ( SMS): GSM Architecture, Entities, Call routing in GSM,
PLMN Interface, GSM Addresses and Identities, Network Aspects in GSM, Mobility
Management, GSM Frequency allocation. Introduction to SMS, SMS Architecture, SM
MT, SM MO, SMS as Information bearer, applications.
UNIT II 13 Hours
Wireless Networks – 2: GPRS GPRS and Packet Data Network, GPRS Network
Architecture, GPRS Network Operations, Data Services in GPRS, Applications for
GPRS, Billing and Charging in GPRS Wireless Networks – 3: CDMA, 3G and
WiMAX Spread Spectrum technology, IS-95, CDMA versus GSM, Wireless Data, Third
Generation Networks, Applications on 3G, Introduction to WiMAX.
Mobile Client: Moving beyond desktop, Mobile handset overview, Mobile phones and
their features, PDA, Design Constraints in applications for handheld devices.Mobile IP:
Introduction, discovery, Registration, Tunneling, Cellular IP, Mobile IP with IPv6
UNIT III 13 Hours
Mobile OS and Computing Environment: Smart Client Architecture, The Client: User
Interface, Data Storage, Performance, Data Synchronization, Messaging. The Server:
Data Synchronization, Enterprise Data Source, Messaging. Mobile Operating Systems:
WinCE, Palm OS, Symbian OS, Linux, Proprietary OS Client Development: The
development process, Need analysis phase, Design phase, Implementation and Testing
phase, Deployment phase, Development Tools, Device Emulators.
UNIT IV 13 Hours
Building, Mobile Internet Applications: Thin client: Architecture, the client,
Middleware, messaging Servers, Processing a Wireless request, Wireless Applications
Protocol (WAP) Overview, Wireless Languages: Markup Languages, HDML, WML,
HTML, cHTML, XHTML, VoiceXML. J2ME Introduction, CDC, CLDC, MIDP;
Programming for CLDC, MIDlet model, Provisioning, MIDlet life-cycle, Creating new
application, MIDlet event handling, GUI in MIDP, Low level GUI Components,
Multimedia APIs; Communication in MIDP, Security Considerations in MIDP.
Text Books
1. Dr. Ashok Talukder, Ms Roopa Yavagal, Mr. Hasan Ahmed: Mobile Computing, Technology, Applications and Service Creation, 2d Edition, Tata McGraw Hill, 2010.
2. Martyn Mallik: Mobile and Wireless Design Essentials, Wiley, 2003.
Reference Books
1. Raj kamal: Mobile Computing, Oxford University Press, 2007.
2. Iti Saha Misra: Wireless Communications and Networks, 3G and Beyond, Tata McGrawHill, 2009.
PCA534L: Object Oriented Analysis and Design Laboratory
1 Credit (0- 0- 2)
CIE Marks: 50 SEE Marks: 50 Total Hours: 28 SEE Hours: 03
1. Design the Library system: Identify the use cases of the system.
( Suggestive use cases : borrow book, return books, read newspapers,
reference, digital library). Develop the use case diagram, Packages and
documentation for the same. Preferable use of uses & Extends
relationships expected.
2. Design the Examination system: Identify the use cases. (Suggestive use
cases:– Form filling, Get Hall Ticket, Write exam, get result ,Verify Hall
Ticket) Develop the use case diagram, Packages and documentation for
the same. Preferable use of uses & Extends relationships expected.
3. Analyze and design the system for ATM Transaction: Identify the use
cases. (Suggestive use cases : Transaction, Approval process, Invalid PIN,
Deposit Amount, Deposit savings, Deposit checking, withdraw Amount,
withdraw checking, saving, withdraw saving denied, checking Transaction
History, saving Transaction History). Develop the use case diagram,
Packages and documentation for the same. Draw the essential class
diagrams.
4. Analyze and design the system for voting system (The actors are presiding
officer, 1st polling officer, 2nd polling officer,Election officer, voter,
candidate; Processes : Voting, counting, and announcement of results).
Develop the use case diagram, Packages and documentation for the same.
Draw the essential sequence diagrams and state chart diagrams.
5. Analyze and design the system for Results section of autonomy, mainly
responsible for CGPA, SGPA Calculation, Grade card generation.
Develop the class diagrams and packages.
6. Analyze and design the system for Employee reference. (The Process HR
Manager contacts Employees of his company and HR manager of other
company to publicise about the vacancy. The person who has referred the
right candidate, will be given bonus. Interview, Short listing, selection list
announcement, Bonus for referred employees are all parts of the process.).
Develop the use case diagram , sequence diagrams and state chart
diagrams.
7. Analyze and design the system for Vehicle Purchase, registration and
licensing Systems. Develop the use case diagram , sequence diagrams,
activity diagrams and packages.
8. Develop State transition diagrams for
a. telephone line (Refer page no. 104, Blaha and Rumbaugh)
b. Nested State diagram for vehicle transmission states.
9. Analyze and design the system for autonomous education system.
(Classes: students Teacher, courses, subjects, core, Electives, Labs).
Develop the class diagrams, sequence diagrams and packages.
10. Analyze and design the system for Railway reservation, which includes
the details of Boarding station, classes of reservation, fare, Time table,
concessions, No. of Seats, Seat No, State of reservation ( confirmed,
waiting, RAC). Develop the class diagrams, packages, component
diagrams and deployment diagrams.
11. Analyze and design the system for Income Tax assessment. Develop the
class diagrams, collaboration diagrams, state chart diagrams.
12. Analyze and design the system for Online shopping system. Develop the
class diagrams, collaboration diagrams, state chart diagrams and packages.
a.Check for the product.
b.Place order.
c.Track the order.
d.Cancel the order.
e.Feedback.
PCA535L: .Net Laboratory
1 Credit (0- 0- 2)
CIE Marks: 50 SEE Marks: 50 Total Hours: 28 SEE Hours: 03
1. Write a program in C# to implement sorting of integer elements taken as command line
arguments.
2. Write a program in C# to check whether a number is Palindrome or not.
3. Write a Program in C# to demonstrate boxing and unboxing
4. Write a Program in C# to implement Stack operations
5. Write a Program in C# to find the second largest element in a single dimensional array.
6. Write a Program in C# to multiply two matrices using Rectangular arrays.
7. Write a program to reverse a given string and check whether string is palindrome or
not.
8. Using Try, catch and finally blocks write a program in c# to demonstrate error
handling.
9. Desing a simple calculator using Switch Statement in C#
10. Demonstrate use of interface with a C# program.
11. Using C# connects to any popular database and verify user login.
12. Using C# connects to any popular database and demonstrate insert, update and select
queries.
13. Write a program to illustrate the use of different variable (set, get) properties in C#.
14. Write a program to demonstrate abstract class and abstract methods in C#.
15. Write a ASP.Net page to read student information such as Name,USN,sum and validate the fields.
PCA536S: Seminar-II
1 Credit (0- 2- 0)
CIE Marks: 50 SEE Marks: 50 Total Hours: 28 SEE Hours: 03
Each student has to submit the synopsis of the seminar topic and should get approval from the departmental head. The department will allot the guide for the student. Students are required to present seminar on said topic with proper consultation with the guide.
PCA537L: Mini Project-II
2 Credits (0- 1- 3)
CIE Marks: 50 SEE Marks: 50 Total Hours: 56 SEE Hours: 03
Each team of 2 students has to submit the synopsis of the mini project based on networks technology and should get approval from the departmental head. The department will allot the guide for the team. Teams are required to present demonstration on said project with proper consultation with the guide.
Mini Project Assessment
1. Miniproject is evaluated for 100 marks (50 CIE and 50 SEE)
2. Allocation of 50 marks for CIE: 3 seminars and related reports write-up: 10+20+20
marks.
3. Allocation of 50 marks for SEE: 25% write-up, 50% Demonstration, and 25% Viva-
voce.
MCA VI Semester
MCA631P – Project Work (25 Credits)
Individual project:. Includes the following components:
1. Problem definition phase (Industrial Internship) of 1 month duration.2. Analysis, Design, Implementation seminars and their respective reports.3. Pre-final demonstration and viva-voce .
Evaluation procedure:
CIE - 50 marks (Evaluated based on the seminars and reports submitted during various phases of software development. Typical split up:
Industrial internship and problem definition (Presentation and report) – 15 marks
Midterm seminar, report and demonstration – 20 marks
Pre-final seminar, report and demonstration – 15 marks
SEE – 200 marks (evaluated jointly by an internal and external examiner). Later scaled down to 50.
70 marks: Awarded by Internal Examiner for Dissertation report evaluation
70 marks: Awarded by External Examiner for Dissertation report evaluation
60 marks: Awarded jointly by the Internal and External examiners for Viva-voce
Scheme and Syllabus of MCA Electives for III,IV and V semester
Sl. No. Subject code Subject Prerequisites Subject code
1 PCA301E Management Information Systems POM PCA235C2 PCA302E Computer Graphics DS PCA231C3 PCA303E Microprocessors COA PCA133C4 PCA304E Advanced Operating Systems OS PCA233C5 PCA305E Embedded Systems COA PCA133C6 PCA306E Linux Administration UNIX PCA131C7 PCA307E Distributed Database Systems DBCA PCA334C8 PCA308E User Interface Design SE PCA431C9 PCA309E System Simulation and Modeling AM PCA232C10 PCA310E Multimedia Systems CN PCA331C11 PCA311E Compiler Design SP PCA333C12 PCA312E Information Retrieval and Search engines WT,AM PCA433C,
PCA232C13 PCA313E Storage Area Networks CN PCA331C14 PCA314E Unix Systems Programming UNIX PCA131C15 PCA315E Analysis and Design of Algorithms DS PCA231C16 PCA316E Client Server Computing CN PCA331C17 PCA317E Artificial Intelligence DMS,COA PCA132C,
PCA133C18 PCA318E Cryptography and Network Security CN PCA331C19 PCA319E Software Project Management SE PCA431C20 PCA320E Data mining DBCA,AM PCA334C,
PCA232C21 PCA321E Software Testing and Analysis SE PCA431C22 PCA322E Digital Image Processing CG PCA302E23 PCA323E Web 2.0 and Rich Internet Applications WT PCA433C24 PCA324E Network Management CN, Java PCA331C,
PCA332C25 PCA325E NOSQL DBCA PCA334C26 PCA326E Software Architecture SE PCA431C27 PCA327E Enterprise Resource Planning CN, WT PCA331C,
PCA433C28 PCA328E Pattern Recognition DIP29 PCA329E Service Oriented Architecture Java, OOPS PCA332C,
PCA234C30 PCA330E Cloud Computing CN,WT PCA331C,
PCA433C
PCA301E: Management Information Systems
4 Credits (4- 0- 0)
Prerequisite: Principles of Management
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction to Management Information Systems ,Management Information System:
Concept and Definition , Role of Management Information System, Impact of
Management Information System, Management Information System , User , Role and
Importance of Management, Introduction to Management Approaches to Management,
Functions of the Manager, Managers and the Environment , Management as a Control
System , Management by Exception, MIS: A support to the Management, Process of
Management , Management Effectiveness, Planning, Organizing, Staffing, Coordinating
and Directing, Controlling , MIS: A Tool for Management Process, Organization
Structure and Theory ,Basic Model of Organization Structure , Modifications to the Basic
Model of Organization Structure , Organizational behavior Organization as a system ,
MIS: Organization , Strategic Management of Business: The Concept of Corporate
Planning, Essentiality of Strategic Planning Development of the Business Strategies,
Types of Strategies, Short-range Planning Tools of Planning, MIS: Business Planning,
Decision Making , Decision Making Concepts, Decision Methods. Tools and
Procedures , Behavioral Concepts in Decision Making), Organizational Decision Making,
MIS and Decision Making Concepts
UNIT II 13 Hours
Information :Information Concepts , Information: A Quality Product ,Classification of
the Information, Methods of Data and Information Collection, Value of the Information,
General Model of a Human as an Information Processor Summary of Information
Concepts and their Implications , Organization and Information , MIS and the
Information Concepts Systems ,System Concepts , Systems Control, Types of System ,
Handling System Complexity , Post Implementation Problems in a System ,MIS and
System Concepts, Development of MIS Development of Long Range Plans of the
MIS ,Ascertaining the Class of Information Determining the Information Requirement,
Development and Implementation of the MIS ,Management of Quality in the MIS
,Organization for Development of the MIS , MIS: The Factors of Success and Failure
Choice of Information Technology’s, Nature of IT Decision, Strategic Decision,
Configuration Design, Evaluation, Information Technology Implementation Plan, Choice
of the 'Information Technology' and the 'MIS'
UNIT III 13 Hours
Decision Support System: Decision Support System: Concept and Philosophy), DSS:
Deterministic Systems, Artificial Intelligence System, Knowledge Based Expert System
(Excluding, Semantic networks. Frames. Rules & Inference Mechanism) MIS and the
Role of DSS, Enterprise Management Systems , Enterprise resource planning,
Technology of Information Systems , Introduction, Data Processing, Transaction
Processing, Application Processing, Information System Processing , TQM of
Information Systems, Human Factors and User Interface, Database management Systems,
Database Concepts, RDBMS (Excluding Rules to determine how RDBMS product is?)
MIS and RDBMS
UNIT IV 13 Hours
Client - Server Architecture: Introduction, Client- Server Architecture, MIS & Client-
Server Architecture Business Process Re-engineering: Introduction, Business Process,
Process Model of the Organization, Value Stream Model of the Organization, MIS and
BPR, Data Warehouse: Architecture to implementation, Introduction, Data in Data
Warehouse (Excluding metadata) , MIS and Data Warehouse .Electronic Business
Technology: Introduction to E - Business , Models of E-Business, MIS and E-Business
Text books
1. W.S. Jawadekar, Management Information Systems, 2nd Edition Tata McGraw HilI
2. Gordon B. Davis & Margrethe H. Olson, Management Information Systems, 2nd
Edition Tata McGraw Hill
Reference book
1. Sadagopan ,Management Information systems,, PHI-2002.
PCA302E: Computer Graphics
4 Credits (4- 0- 0)
Prerequisite: Data Structures
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Overview of Graphics Systems: Video Display devices, Raster-scan Systems, Random
- Scan Systems, Graphics Monitors and Workstations, Input Devices, Hard-Copy
Devices, Graphics Software. output primitives :Points and Lines, Line-Drawing
Algorithms, Loading the Frame Buffer, Line Function, Circle-Generating Algorithms.
Attributes of output primitives: Line Attributes, Color and Grayscale levels, Area-Fill
Attributes, Character Attributes, Antialiasing
UNIT II 13 Hours
Two-dimensional geometric transformations: Basic Transformations, Matrix
Representations and Homogeneous coordinates, Composite Transformations, Other
Transformations, Transformations Between Coordinate Systems, Affine Transformations,
Transformation Functions, Raster Methods for Transformations. Two dimensional
viewing: The Viewing Pipeline, Viewing Coordinate Reference Frame, Window-to-
Viewport Coordinate Transformation, Two-Dimensional Viewing Functions, Clipping
Operations, Point Clipping, Line Clipping, Polygon Clipping, Text Clipping, Exterior
Clipping.
UNIT III 13 Hours
Graphical user interfaces and interactive input methods: The User Dialogue, Input of
Graphical Data, Input Functions, Initial Values for Input-Device Parameters, Interactive
Picture Construction Techniques, Virtual- Reality Environments. Three - dimensional
concepts and object representations: Three Dimensional Display Methods, Polygon
Surfaces, Curved Lines and Surfaces, Quadric Surfaces, Busier Curves and Surfaces, B-
Spline Curves and Surfaces, Octrees.
UNIT IV 13 Hours
Three-dimensional geometric and modeling transformation: Translation, Rotation,
Scaling, Other Transformations, Composite Transformations, Three-Dimensional
Transformation Functions, Modeling and Coordinate Transformations. Three-
dimensional viewing:Viewing Pipeline, Viewing Coordinates, Projections, View
Volumes, Clipping. Visible - surface detection methods: Classification of Visible
-Surface Detection Algorithms, Back-Face Detection, Depth-Buffer Method, Scan-line
method, Area- Subdivision Method, Curved Surfaces, Wire frame Methods.
Text book
1. Donald Hearn and M.Pauline Baker,Computer Graphics: C version, Second Edition -
Pearson Education – 2003,
Reference books
1. Steven Harrington, Computer Graphics - A Programming, Tata McGraw
Hill- Second Edition.
2. Foley, VanDam, Feiner & Hughes,Computer Graphics - Principles and
Practice, Second Edition,Pearson Education .
3. Willam Neuman and Robert. L. Sproull, Principles of Computer Interactive Computer
Graphics.
PCA303E: Microprocessor
4 Credits (4- 0- 0)
Prerequisite: Computer Organization and Architecture
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Evolution of microprocessors: Register structure, ALU, Bus, Organization, Timing and
Control. Introduction to 8-bit microprocessors. Architecture of 8085 Addressing modes
and instructions, Simple Programming and Interfacing.
UNIT II 13 Hours
The Processors 8086 Register Organization, Architecture, Signal description, Physical
Memory Organization, General Bus Operation, I/O addressing, Special Processor
activities, Minimum mode, Maximum Mode.
UNIT III 13 Hours
Instruction Set and Assembler directives, Addressing modes, Instruction set, Assembler
directives, Assembly Language Programming, Programming with an assembler, example
programs, Special Architectural features – Stack, Interrupt and Macros.
UNIT IV 13 Hours
Basic Peripherals and interfacing-Memory interfacing I/O ports, 8255, Special purpose
programmable, peripheral devices-8253, 8259A, 8279, 8251 and 8257.
Text book
1.K. Ray & K. M. Bhurchandi, Advanced Microprocessors & Peripherals, TMH 3rd
Edition, 2013
Reference books
1. Douglas V. Hall, Microprocessors and Interfacing, McGraw Hill, Revised 2nd
Edition, 2006.
2. A. P. Mathur, Introduction to Microprocessors, 3rd Edition, TMH, 1995
3. B. Ram, Microprocessors and Applications
4. Leu and Gibson, Microcomputers 8086/8088 Family, 1984
5. B. B. Brey, The Intel Microprocessors 8086 /8088 /80186 /80286 /80386/ Pentium
processors, 8th Edition, 2008
PCA304E: Advanced Operating Systems
4 Credits (4- 0- 0)
Prerequisite: Operating Systems
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction, Review Operating Systems Strategies: User’ perspectives, technologies and
examples of Batch Systems, Timesharing Systems, Personal computer systems,
Embedded systems, and small communicating computers; The genesis of modern
operating systems. Using the Operating Systems The programmer’s abstract machine;
Resources; Processes and threads.
UNIT II 13 Hours
Writing concurrent programs Operating Systems Organization Contemporary OS kernels.
Basic functions; General implementation considerations.
UNIT III 13 Hours
Design Strategies Design considerations; Monolithic kernels; Modular organization;
Microkernel; Layered organizations; Operating Systems for distributed system. Real
World Examples Linux, Windows NT/2000/XP. Process descriptors, Thread descriptors,
Thread scheduling. Linux, Windows NT/2000/XP: Kernel
UNIT IV 13 Hours
Distributed Systems: Networking; The Need for a Protocol Architecture; The TCP/IP
Sockets; Linux Networking; Client/Server Computing; Distributed Message Passing;
Remote Procedure Calls; Clusters;Windows Vista Cluster Server; Linux Clusters;
Distributed Process Management; Process Migration; Distributed Global States;
Distributed Mutual Exclusion; Distributed Deadlock.
Text books
1. Gary Nutt: Operating Systems, 3rd Edition, Pearson, 2004.
2. William Stallings: Operating Systems: Internals and Design Principles, 6th Edition,
Prentice Hall, 2008.
Reference books
1. Silberschatz, Galvin, Gagne: Operating System Concepts, 8th Edition, Wiley, 2008
2. Andrew S. Tanenbaum, Albert S. Woodhull: Operating Systems, Design and
Implementation, 3rd Edition, Prentice Hall, 2006.
3. Pradeep K Sinha: Distribute Operating Systems, Concept and Design, PHI, 2007.
PCA305E: Embedded Systems
4 Credits (4- 0- 0)
Prerequisite: Computer Organization and Architecture
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction to Embedded Systems: An embedded system; Processor in the system;
Embedded hardware units and devices in a system; Embedded software in a system;
Examples of embedded systems; Embedded system-on-Chip (SoC) and use of VLSI
circuit design technology; Complex systems design and processors; Design process in
embedded system. Formalization of system design; Design process and design
examples; Classification of embedded systems; Skills required for an embedded system
designer. I/O types and examples; Serial communication devices; Parallel device ports;
Sophisticated interfacing features in device ports.
UNIT II 13 Hours
Communication Buses for Device Networks: Wireless devices; Timer and counting
devices; Watchdog timer; Real time clock; Networked embedded systems; Serial bus
communication protocols; Parallel bus device protocols; Internet enabled systems;
Wireless and mobile system protocols. Device Drivers and Interrupts Service
Mechanism Device access without interrupts; ISR concept; Interrupt sources; Interrupt
servicing Mechanism; Multiple interrupts; Context switching and the periods for context-
switching; Classification of interrupt service mechanisms; Direct memory access; Device
drivers programming.
UNIT III 13 Hours
Program Modeling Concepts Program models; DFG models; State machine
programming models for event controlled program flow; Modeling of multiprocessor
systems. Inter-Process Communication, Synchronization Multiple processes in an
application; Multiple threads in an application; Tasks and task states; Task and data;
Distinctions between functions, ISRs and tasks; Concept of semaphores; Shared data;
Inter Process Communication; Signal function; Semaphore functions; Message queue
functions; Mailbox functions; Pipe functions; Socket functions; RPC functions.
UNIT IV 13 Hours
Real-time Operating systems: Operating System services; Process management; Timer
functions; Event functions; Memory management; Device, file and I/O sub-systems
management; Interrupt routines in RTOS environment; Real-Time Operating Systems;
Basic design using an RTOS; RTOS task scheduling models, interrupt latency and
response times of the tasks as performance metrics; OS security issues. Embedded
Software Development Introduction; Host and target machines; Linking and locating
software; Getting embedded software in to the target system; Issues in hardware-software
design and co-design; Testing on host machine; Simulators; Laboratory tools.
Text book
1.Rajkamal, Embedded Systems Architecture, Programming and Design, 2nd Edition,
Tata McGraw Hill, 2008.
Reference books
1. Wayne Wolf, Computers as Components Principles of Embedded Computer System
Design, Elsevier, 2005.
2. Tammy Noergaard, Embedded Systems Architecture, Elsevier, 2005.
3. Steve Heath, Embedded Systems Design, 2nd Edition, Elsevier, 2003.
4. Dr. K.V.K.K. Prasad, Embedded/Real-Time Systems: Concepts, Design and
Programming – The Ultimate Reference, Dreamtech. Press, 2004.
5. Michael J.Point, Embedded C, Pearson Education, 2002.
PCA306E: Linux Administration
4 Credits (4- 0- 0)
Prerequisite: UNIX
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Basics of Free/Open source software, Basics of GNU/Linux. Essential tasks of system
administrator, Booting and shutting down: Bootstrapping, Boot loaders:LILO and GRUB,
Booting single user mode, Startup scripts, rebooting and shutting down. Rootly powers:
Ownership of files and processes, The superuser, Choosing a root password, Becoming
root, Other pseudo-users, Controling processes: Components of a process, The life cycle
of a process, Signals, kill and killall:send signals, Process states, nice and renice:
influence scheduling priority, ps: monitor processes, top: monitor processes even better,
Runaway processes.
UNIT II 13 Hours
The filesystem: Pathnames, Mounting and unmounting filesystems, The organization of
the file tree, File types, File attributes, Adding new users: The /etc/passwd file, the
/etc/shadow file, the /etc/group file, adding users, removing users, disabling logins,
account management utilities, Serial devices: Serial device files, setserial:tel the driver
about serial port parameters, software configuration for serial devices, Configuration of
hardwired terminals, special characters and the terminal driver, stty:set terminal options,
tset:set options automatically, Modems, Other common I/O ports. Adding a disk:Disk
interfaces, Disk geometry, An overview of disk installation procedure, The ext2 and ext3
file systems, fsck:check and repair filesystems, Adding a disk to Linux: a step-by-step
guide, Periodic processes: cron:schedule commands, The format of crontsb files, Crontab
management, Some common uses for cron.
UNIT III 13 Hours
Networking: TCP/IP Networking, TCP/IP and the internet, Packets and encapsulation, IP
addresses: the glory details, Routing, ARP: The address resolution protocol, Adding a
machine to a network, Distribution specific network configuration, DHCP:the Dynamic
Host Configuration Protocol, Security issues, IP forwarding, ICMP redirects, Source
routing, Routing: Routing daemons and routing protocols, Protocols on parade, routed:
RIP yourself a new hole, gated: a better routing daemon, Routing strategy selection
criteria.
UNIT IV 13 Hours
Programming in Perl 5.0: The basic Perl program, scalars, arrays, hashes, control
structures, processing text, regular expressions, using files, subroutines, CGI scripting:
What is CGI?, developing CGI applications, processing CGI, returning a basic HTML
page, introduction to CGI.pm, CGI.pm methods,creating HTML pages dynamically,
using CGI.pm- an example, adding robustness.
Text Books:
1.Evi Nemeth, Garth Snyder, Trent R.Hein ,Linux administration handbook.
2.Chris Bates, Web Programming Building Internet Applications, 3rd Edn, Wiley
India,2006.
PCA307E: Distributed Database Systems
4 Credits (4- 0- 0)
Prerequisite: Database Concepts and Applications
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Overview: features of distributed v/s centralized system. Why distributed databases, DDBMS, levels of distribution transparency, Levels of distribution transparency: Reference architecture for distributed databases, types of data fragmentation, distribution transparency for read only applications, distribution transparency for update applications , distributed database access primitives, integrity constraints in distributed databases .
UNIT II 13 Hours
Distributed database design: A framework for distributed database design, the design of database fragmentation, the allocation of fragments.
Translation of global query to fragment queries: Equivalence transformation for queries, converting a global query into fragment query, distributed grouping and aggregate functions, parametric queries
UNIT III 13 Hours
Optimization of Access strategies: A framework for query optimization: join queries, general queries. The management of distributed transactions: A framework for transaction management, supporting atomicity of distributed transactions, concurrency control for distributed transactions , architecture aspects of distributed transactions.
UNIT IV 13 Hours
Concurrency control: Foundations of distributed concurrency control , distributed deadlocks , concurrency control based on timestamps, optimistic methods for distributed concurrency control.
Reliability: Basic concepts, Non-blocking commitment protocols
Distributed database administration: Catalogue management in distributed databases, authorization and protection. Heterogeneous distributed database systems.
Text books
1. Stefano Ceri and Guiseppe Pelagatti, Distributed Databases Principles and Systems,
McGraw-Hill International, 1984
2. M. Tamer Özsu, Patrick Valduriez, Principles of Distributed Database Systems, 2nd
Edition, Prentice Hall, 1999
PCA308E: User Interface Design
4 Credits (4- 0- 0)
Prerequisite: Software Engineering
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Human Factors of Interactive Software, Theories, Principles and Guidelines Introduction,
Goals of Systems Engineering, Goals of Interface Design, Motivation for Human Factors
in Design, Accommodation of Human Diversity, Goals for the Profession, High Level
Theories, Object-Action Interface Model, Principle 1: Recognize the Diversity, Principle
2: Use the Eight Golden Rules of Interface Design, Principle 3: Prevent Errors,
Guidelines for Date Display, Guidelines for Data Entry, Balance of Automation and
Human Control. Management Issue: Introduction, Organizational Design to Support
Usability, The Three Pillars of Design, Development Methodologies, Ethnographic
Observation, Participatory Design, Scenario Development, Social Impact Statement for
Early Design Review, Legal Issues. Expert Reviews, Usability Testing and Laboratories,
Surveys, Acceptance Tests, Evaluation During Active Use, Controlled Psychologically
Oriented Experiments.
UNIT II 13 Hours
Tools and Environments: Introduction, Specification Methods, Interface-Building
Tools, Evaluation and Critiquing Tools. Introduction , Examples of Direct-Manipulation
Systems, Explanations of Direct Manipulation, Visual Thinking and Icons, Direct
Manipulation Programming, Home Automation, Remote Direct Manipulation Virtual
Environments. Menus, Forms, Dialog Boxes and Commands: Related Organization,
Item Presentation Sequence, Response Time and Display Rate, Fast Movement through
Menus, Menu Layout, Form Fillin, Dialog Boxes. Functionality to support Users Tasks,
Command-Organization Strategies, The Benefits of Structure, Naming and
Abbreviations, Command Menus, Natural Language in Computing.
UNIT III 13 Hours
Interaction Devices and Response Time Interaction Devices, Introduction, Keyboards
and Function Keys, Pointing Devices, Speech Recognition, Digitization, and Generation,
Image and Vide Displays, Printers. Theoretical Foundations,Expectations and
Attitudes.Presentation Styles, Manuals, Help, and Tutorials - 1 Error Messages, Non-
anthropomorphic Design, Display Design, Color. Reading from Paper Versus from
Displays.
UNIT IV 13 Hours
Presentation Styles, Manuals, Help, and Tutorials – 2 Multiple-Window Strategies,
Hypermedia and the World Wide Web-1 Preparation of Printed Manuals, Preparation of
Online Facilities. Multiple-Window Strategies: Introduction, Individual-Window Design,
Multiple- window Design, Co-ordination by Tightly Coupled Windows, Image Browsing and
Tightly Coupled Windows, Personal Role Management an Elastic Windows. Multiple-
Window Strategies, Hypermedia and the World Wide Web-2 Genres and Goals and
Designers, Users and Their Tasks, Object-Action Interface Model for Web Site Design.
Text book
1. Ben Shneiderman,‘Designing the User Interface, 3rd Edition, Addison- Wesley,
1998.
Reference books
1. Alan J Dix et. al., Human-Computer Interaction, II Edition, Prentice- Hall,
India,1998
2. Eberts, User Interface Design, Prentice-Hall, 1994.
3. Wilber O Galitz, The Essential Guide to User Interface Design – An Introduction to
GUI Design, Principles and Techniques, Wiley- Dreamtech India Pvt. Ltd, 1998.
PCA309E: System Simulation and Modeling
4 Credits (4- 0- 0)
Prerequisite: Applied Mathematics
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction: When simulation is the appropriate tool and when it is not appropriate;
Advantages and disadvantages of Simulation; Areas of application; Systems and system
environment; Components of a system; Discrete and continuous systems; Model of a
system; Types of Models; Discrete-Event System Simulation; Steps in a Simulation
Study. Simulation examples: Simulation of queuing systems; Simulation of inventory
systems; Other examples of simulation. General Principles, Simulation Software
Concepts in Discrete-Event Simulation: The Event-Scheduling / Time-Advance
Algorithm.
UNIT II 13 Hours
Statistical Models in Simulation: Review of terminology and concepts; Useful
statistical models; Discrete distributions; Continuous distributions; Poisson process;
Empirical distributions. Queuing Models: Characteristics of queuing systems; Queuing
notation; Long-run measures of performance of queuing systems; Steady-state behavior
of M/G/1 queue; Networks of queues.
UNIT III 13 Hours
Random-Number Generation, Random-Variant Generation: Properties of random
numbers; Generation of pseudo-random numbers; Techniques for generating random
numbers; Tests for Random Numbers. Random-Variant Generation: Inverse transform
technique; Acceptance-Rejection technique; Special properties. Input Modeling: Data
Collection; Identifying the distribution with data; Parameter and their estimation;
UNIT IV 13 Hours
Input Modeling: Goodness of Fit Tests; Fitting a non-stationary Poisson process;
Selecting input models without data; Multivariate and Time-Series input models. Output
Analysis for a Single Model: Types of simulations with respect to output analysis;
Stochastic nature of output data; Measures of performance and their estimation; Output
analysis for terminating simulations; Output analysis for steady-state simulations.
Text book
1. Jerry Banks, John S. Carson II, Barry L. Nelson, David M. Nicol: Discrete-Event
System Simulation, 4th Edition, Pearson Education / PHI, 2007.
Reference books
1. Lawrence M. Leemis, Stephen K. Park: Discrete – Event Simulation: A First Course,
Pearson / Prentice-Hall, 2006.
2. Averill M. Law: Simulation Modeling and Analysis,4th Edition, Tata McGraw-Hill,
2007.
PCA310E: Multimedia Systems
4 Credits (4- 0- 0)
Prerequisite: Compute Networks
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction, Media and Data Streams, Audio Technology: Multimedia Elements;
Multimedia Applications; Multimedia Systems Architecture; Evolving Technologies for
Multimedia Systems; Defining Objects for Multimedia Systems; Multimedia Data
Interface Standards; The need for Data Compression; Multimedia Databases. Media:
Perception Media, Representation Media, Presentation Media, Storage Media,
Transmission Media, Information Exchange Media, Presentation Spaces & Values, and
Presentation Dimensions; Key Properties of a Multimedia System: Discrete &
Continuous Media, Independence Media, Computer Controlled Systems, Integration;
Characterizing Data Streams: Asynchronous Transmission Mode, Synchronous
Transmission Mode, Isochronous Transmission Mode; Characterizing Continuous Media
Data Streams. Sound: Frequency, Amplitude, Sound Perception and Psychoacoustics;
Audio Representation on Computers; Three Dimensional Sound Projection; Music and
MIDI Standards; Speech Signals; Speech Output; Speech Input; Speech Transmission.
Graphics and Images, Video Technology, Computer-Based Animation: Capturing
Graphics and Images Computer Assisted Graphics and Image Processing; Reconstructing
Images; Graphics and Image Output Options. Basics; Television Systems; Digitalization
of Video Signals; Digital Television; Basic Concepts; Specification of Animations;
Methods of Controlling Animation; Display of Animation; Transmission of Animation;
Virtual Reality Modeling Language.
UNIT II 13 Hours
Data Compression : Storage Space; Coding Requirements; Source, Entropy, and
Hybrid Coding; Basic Compression Techniques; JPEG: Image Preparation, Lossy
Sequential DCT-based Mode, Expanded Lossy DCT-based Mode, Lossless Mode,
Hierarchical Mode.H.261 (Px64) and H.263: Image Preparation, Coding Algorithms,
Data Stream, H.263+ and H.263L; MPEG: Video Encoding, Audio Coding, Data
Stream, MPEG-2, MPEG-4, MPEG-7; Fractal Compression.
UNIT III 13 Hours
Optical Storage Media :History of Optical Storage; Basic Technology; Video Discs and
Other WORMs; Compact Disc Digital Audio; Compact Disc Read Only Memory; CD-
ROM Extended Architecture; Further CD-ROM-Based Developments; Compact Disc
Recordable; Compact Disc Magneto-Optical; Compact Disc Read/Write; Digital
Versatile Disc. Content Analysis: Simple Vs. Complex Features; Analysis of Individual
Images; Analysis of Image Sequences; Audio Analysis; Applications.
UNIT IV 13 Hours
Data and File Format Standards: Rich-Text Format; TIFF File Format; Resource
Interchange File Format (RIFF); MIDI File Format; JPEG DIB File Format for Still and
Motion Images; AVI Indeo File Format; MPEG Standards; TWAIN Multimedia
Application Design: Multimedia Application Classes; Types of Multimedia Systems;
Virtual Reality Design; Components of Multimedia Systems; Organizing Multimedia
Databases; Application Workflow Design Issues; Distributed Application Design Issues.
Text books
1. Ralf Steinmetz, Klara Narstedt: Multimedia Fundamentals: Vol 1-Media Coding and
Content Processing, 2nd Edition, Pearson Education, 2003.
2. Prabhat K. Andleigh, Kiran Thakrar: Multimedia Systems Design, PHI, 2003.
Reference books
1. K.R Rao, Zoran S. Bojkovic and Dragorad A. Milovanovic: Multimedia
Communication Systems: Techniques, Standards, and Networks, Pearson Education,
2002.
2. Nalin K Sharad: Multimedia information Networking, PHI, 2002.
PCA311E: Compiler Design
4 Credits (4- 0- 0)
Prerequisite: System Software
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction, Lexical analysis Language processors; The structure of a Compilers; The
evolution of programming languages; The science of building a compiler; Applications of
Compiler technology; Programming language basics; Lexical analysis: The Role of
Lexical Analyzer; Input Buffering; Specifications of Tokens; Recognition of Tokens.
UNIT II 13 Hours
Syntax Analysis Part 1:Introduction; Context-free Grammars; Writing a Grammar; Top-down Parsing.
Syntax Analysis Part 2: Bottom-up Parsing; Introduction to LR Parsing: Simple LR. More powerful LR parsers; Using ambiguous grammars; Parser Generators.
UNIT III 13 Hours
Syntax-Directed Translation Syntax-Directed definitions; Evaluation order for SDDs;
Applications of Syntaxdirected translation; Syntax-directed translation schemes
Intermediate Code Generation Variants of syntax trees; Three-address code; Types
and declarations; Translation of expressions; Type checking; Control flow; Back
patching; Switch statements; Intermediate code for procedures.
UNIT IV 13 Hours
Code Generation Issues in the design of Code Generator; The Target language;
Addresses in the target code; Basic blocks and Flow graphs; Optimization of basic
blocks; A Simple Code Generator.
Run-Time Environments Storage Organization; Stack allocation of space; Access to
non-local data on the stack; Heap management; Introduction to garbage collection.
Text book
1. Alfred V Aho, Monica S. Lam, Ravi Sethi, Jeffrey D Ullman: Compilers-Principles,
Techniques and Tools, 2nd Edition, Addison-Wesley, 2nd Edition, 2006
Reference books
1. Charles N. Fischer, Richard J. leBlanc, Jr.: Crafting a Compiler with C, Pearson
Education, 1991.
2. Andrew W Apple: Modern Compiler Implementation in C, Cambridge Univ. Press,
1997.
3. Kenneth C Louden: Compiler Construction Principles & Practice, Thomson Education,
1997.
PCA312E: Information retrieval and search engines
4 Credits (4- 0- 0)
Prerequisite: Web Technologies, Applied Mathematics
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction: Information Retrieval, Search Engines, Search Engineers. Architecture of
a Search Engine: Architecture, Basic Building Blocks, Text Acquisition, Text
Transformation, Index Creation, User Interaction, Ranking and Evaluation.
UNIT II 13 Hours
Crawls And Feeds: Deciding what to search, Crawling the Web, Directory Crawling,
Conversion Problem, Storing the Documents, Detecting Duplicates. Processing Text:
Text Statistics, Document Parsing, Document Structure and Markup, Information
Extraction, Internationalization.
UNIT III 13 Hours
Ranking with Indexes: Abstract Model of Ranking, Inverted indexes, Compression,
Entropy and Ambiguity, Delta Encoding, Bit-aligned codes, Query Processing. Queries
and Interfaces: Information Needs and Queries, Query Transformation and Refinement,
Showing the Results Cross-Language Search.
UNIT IV 13 Hours
Retrieval Models: Overview of Retrieval Models , Boolean Retrieval , The Vector Space
Model, ProbabilisticModels, Information Retrieval as Classification, BM25 Ranking
Algorithm, Complex Queries and Combining Evidence, Web Search. Evaluating Search
Engines: The Evaluation Corpus , Logging , Effectiveness Metrics, Recall and Precision
Averaging and Interpolation, Efficiency Metrics, Training, Testing, and Statistics
Text book
1. Trevor Strohman, Bruce Croft Donald Metzler ,Search Engines: Information Retrieval in Practice, Kindle Edition
PCA313E: Storage Area Network
4 Credits (4- 0- 0)
Prerequisite: Computer Networks
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 HoursIntroduction to Information Storage and Management, Storage System
Environment: Information Storage, Evolution of Storage Technology and Architecture,
Data Center Infrastructure, Key Challenges in Managing Information, Information
Lifecycle Components of Storage System Environment, Disk Drive Components, Disk
Drive Performance, Fundamental Laws Governing Disk Performance, Logical
Components of the Host, Application Requirements and Disk Performance.
Data Protection, Intelligent Storage system: Implementation of RAID, RAID Array
Components, RAID Levels, RAID Comparison, RAID Impact on Disk Performance, Hot
Spares Components of an Intelligent Storage System, Intelligent Storage Array.
UNIT II 13 Hours Direct-Attached Storage, SCSI, and Storage Area Networks: Types of DAS, DAS
Benefits and Limitations, Disk Drive Interfaces, Introduction to Parallel SCSI, Overview
of Fibre Channel, The SAN and Its Evolution, Components of SAN, FC Connectivity,
Fibre Channel Ports, Fibre Channel Architecture, Zoning, Fibre Channel Login Types,
FC Topologies. NAS, IP SAN: General – Purpose Service vs. NAS Devices, Benefits of
NAS, NAS File I / O, Components of NAS, NAS Implementations, NAS File-Sharing
Protocols, NAS I/O Operations, Factors Affecting NAS Performance and Availability.
iSCSI, FCIP.
UNIT III 13 HoursContent-Addressed Storage, Storage Virtualization: Fixed Content and Archives,
Types of Archive, Features and Benefits of CAS, CAS Architecture, Object Storage and
Retrieval in CAS, CAS Examples. Forms of Virtualization, SNIA Storage Virtualization
Taxonomy, Storage Virtualizations Configurations, Storage Virtualization Challenges,
Types of Storage Virtualization, Business Continuity, Backup and Recovery:
Information Availability, BC Terminology, BC Planning Lifecycle, Failure Analysis,
Business Impact Analysis, BC Technology Solutions. Backup Purpose, Backup
Considerations, Backup Granularity, Recovery Considerations, Backup Methods, Backup
Process, Backup and restore Operations, Backup Topologies, Backup in NAS
Environments, Backup Technologies.
UNIT IV 13 Hours
Local Replication, Remote Replication: Source and Target, Uses of Local Replicas,
Data Consistency, Local Replication Technologies, Restore and Restart Considerations,
Creating Multiple Replicas, Management Interface, Modes of Remote Replication,
Remote Replication Technologies, Network Infrastructure. Securing the Storage
Infrastructure, Managing the Storage Infrastructure 120 Storage Security
Framework, Risk Triad, Storage Security Domains, Security Implementations in Storage
Networking Monitoring the Storage Infrastructure, Storage Management Activities,
Storage Infrastructure Management Challenges, Developing an Ideal Solution.
Text Book
1. G. Somasundaram, Alok Shrivastava (Editors): Information Storage and Management:
Storing, Managing & Protecting Digital Information in Classic, Visualized and Cloud
Environments, 2nd edition, EMC Education Services, Wiley- India, 2009. ISBN 978-
1-1180-9483-9
Reference Books
1. Ulf Troppens, Rainer Erkens and Wolfgang Muller: Storage Networks Explained,
Wiley India, 2003.
2. Rebert Spalding: Storage Networks, The Complete Reference, Tata McGraw Hill,
2003.
3. Richard Barker and Paul Massiglia: Storage Area Networks Essentials A Complete
Guide to Understanding and Implementing SANs, Wiley India, 2002.
PCA314E: UNIX System Programming
4 Credits (4- 0- 0)
Prerequisite: Introduction to UNIX
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction: UNIX and ANSI Standards: The ANSI C Standards, the ANSI/ISO C++
Standards, Difference between ANSI C and C++, the POSIX Standards, The POSIX.1
FIPS Standard, The X/Open Standards. UNIX and POSIX APIs: The POSIX APIs, The
UNIX and POSIX Development Environment, API Common Characteristics.
UNIX Files: File Types, The UNIX and POSIX File System, The UNIX and POSIX File
Attributes, Inodes in UNIX System V, Application Program Interface to Files, UNIX
Kernel Support for Files, Relationship of C Stream Pointers and File Descriptors,
Directory Files, Hard and Symbolic Links.
UNIT II 13 Hours
UNIX File APIs:General File APIs, File and Record Locking, Directory File APIs,
Device File APIs, FIFO File APIs, Symbolic Link File APIs, General File Class, regfile
Class for Regular Files, dirfile Class for Directory Files, FIFO File Class, Device File
Class, Symbolic Link File Class, File Listing Program. UNIX Processes: The
Environment of a UNIX Process: Introduction, main function, Process Termination,
Command-Line Arguments, Environment List, Memory Layout of a C Program, Shared
Libraries, Memory Allocation, Environment Variables, setjmp and longjmp Functions,
getrlimit, setrlimit Functions, UNIX Kernel Support for Processes.
UNIT III 13 Hours
Process Control: Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid,
waited, wait3, wait4 Functions, Race Conditions, exec Functions, Changing User IDs and
Group IDs, Interpreter Files, system Function, Process Accounting, User Identification,
Process Times. Process Relationships: Introduction, Terminal Logins, Network Logins,
Process Groups, Sessions, Controlling Terminal, tcgetpgrp, tcsetpgrp, and tcgetsid
Functions, Job Control, Shell Execution of Programs, Orphaned Process Groups. Signals
and Daemon Processes Signals: The UNIX Kernel Support for Signals, signal, Signal
Mask, sigaction, The SIGCHLD Signal and the waitpid Function, The sigsetjmp and
siglongjmp Functions, Kill, Alarm, Interval Timers, POSIX.lb Timers. Daemon
Processes: Introduction, Daemon Characteristics, Coding Rules, Error Logging, Single-
instance daemons; Daemon conventions; Client-Server Model.
UNIT IV 13 Hours
Interprocess Communication: Introduction; Pipes, popen, pclose Functions; oprocesses;
FIFOs; XSI IPC; Message Queues; Semaphores, Network IPC: Sockets:Introduction;
Socket Descriptors; Addressing; Connection establishment; Data transfer; Socket options;
Out-of-band data; Nonblocking and asynchronous I/O.
Text Books
1. Terrence Chan: Unix System Programming Using C++, Prentice-Hall of India /
Pearson Education, 1999.
2.W.Richard Stevens, Stephen A. Rago: Advanced Programming in the UNIX
Environment, 2nd Edition, Pearson Education / Prentice-Hall of India, 2005.
PCA315E: Analysis and Design of Algorithms
4 Credits (4- 0- 0)
Prerequisite: Data Structures
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction: Notion of Algorithm, Fundamentals of Algorithmic Problem Solving,
Important Problem Types, Fundamental Data Structures. Fundamentals Of The
Analysis Of Algorithm Efficiency: Analysis Framework, Asymptotic Notations and
Basic efficiency classes, Mathematical analysis of Recursive and Non-Recursive
algorithms, Examples. Brute Force: Selection Sort and Bubble Sort, Sequential Search
and String Matching, Exhaustive Search.
UNIT II 13 Hours
Divide-And Conquer: Merge sort, Quick sort, Binary Search, Binary Tree Traversals
and related properties, Multiplication of large integers, Strassen’s Matrix, Multiplication.
Decrease-And-Conquer: Insertion Sort, Depth First and Breadth First Search,
Topological Sorting, Algorithms for Generating Combinatorial Objects.
UNIT III 13 Hours
Transform And Conquer:Presorting, Balanced Search Trees, Heaps and Heap sort,
Problem Reduction. Dynamic Programming: Computing a binomial coefficient,
Warshall’s and Floyd’s Algorithms, The Knapsack Problem and Memory Functions.
UNIT IV 13 Hours
Greedy Technique: Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm,
Huffman Trees. Backtracking: n-Queen’s Problem – Hamiltonian Circuit problem –
Subset-Sum problem – Branch and bound – Assignment problem – Knapsack problem –
Traveling salesman problem.
Text books
1. Anany Levitin, Introduction to The Design and Analysis of Algorithms, Pearson
Education, 2003.
2. A.V.Aho, J.E. Hopcroft and J.D.Ullman, The Design and Analysis of Computer
Algorithms, Pearson Education Asia, 2003.
Reference books
1. Coremen, T.H., Leiserson C.E., and Rivest R.L. ,Introduction to Algorithms , PHI,
1998.
2. Horowitz E., Sahani S., Rajashekaran S ,Computer Algorithms , Galgotia
Publications, 2001.
PCA316E: Client Server Computing
4 Credits (4- 0- 0)
Prerequisite: Computer Networks
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction to client/Server computing, advantages of client/Server computing.
Architecture - Data access architecture, Execution architectureVertical slice-two-tiered
client/server, stored procedure, Three tiered architecture.
UNIT II 13 Hours
Role of the client, client services, Remote procedure call, print services, Remote services,
Utility services, Message services, Network services, Application services, Database
services, Dynamic Data Exchange (DDE), Object linking and embedding, Common
object request broker architecture, client tools - Non GUI, GUI, Object oriented user
interface clients (OOUI). Server functionality, Request processing, File services,
Database services, Communication services, Security services, Network operating
system, platforms, Server operating system.
UNIT III 13 Hours
Connectivity - Open systems interconnect, communications interface technology,
interprocess communication, wide area network technologies, Network Management.
Application development management issues- platform and productivity, environment
definition, productivity measures, performance, support, organization and management,
task allocation server and client side.
UNIT IV 13 Hours
Distributed objects and components - CORBA, compound documents, Opendoc
component model, OLE/DCOM.
Text books
1. Patrick Smith and Steve Guengerich, Client/Server computing, , II Edition, Prentice
Hall.
2. 'Robert Orfali, Dan Harkey, Jeri Edwards , The Essential client/server survival
Guide, II edition, Galgotia Publications.
Reference Books
1. Larry T Vaughn , Client/Server System Design and implementation., McGraw-Hili
international Edition.
2. Alan Pope ,The CORBA Reference Guide, Addison Wesley.
PCA317E: Artificial Intelligence
4 Credits (4- 0- 0)
Prerequisite: Discrete Mathematics, Computer Organization and Architecture
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Overview of Artificial Intelligence: Definition & Importance of AI General Concepts
of Knowledge: Introduction, Definition and Importance of Knowledge, Knowledge-
Based Systems, Representation of Knowledge, Knowledge Organization, Knowledge
Manipulation, Acquisition of Knowledge.
UNIT II 13 Hours
Knowledge Representation : Introduction, Syntax and Semantics for Propositional
logic, Syntax and Semantics for FOPL, Properties of WFFs, Conversion to Clausal Form,
Inference Rules, The Resolution Principle, No deductive Inference Methods,
Representations Using Rules. Dealing With Inconsistencies and Uncertainties :
Introduction, Truth Maintenance Systems, Default Reasoning and the Closed World
Assumption, Predicate Completion and Circumscription, Modal and Temporal Logics.
UNIT III 13 Hours
Structured Knowledge : Graphs, Frames and Related Structures : Introduction,
Associative Networks, Frame Structures, Conceptual Dependencies and Scripts. Object-
Oriented Representations : Introduction, Overview of Objects, Classes, Messages and
Methods, Simulation Example using an OOS Program. Search and Control Strategies :
Introduction, Preliminary Concepts, Examples of Search Problems, Uninformed or Blind
Search, Informed Search, Searching And-Or Graphs.
UNIT IV 13 Hours
Knowledge Organization and Management : Introduction, Indexing and Retrieval
Techniques, Integrating Knowledge in Memory, Memory Organization Systems.
Expert Systems Architectures: Introduction, Rule Based System Architecture, Non-
Production System Architecture, Dealing with uncertainty, Knowledge Acquisition and
Validation, Knowledge System Building Tools.
Text Book
1. Dan W. Patterson , Introduction to Artificial Intelligence and Expert Systems, PHI,
New Delhi, 2006.
Reference Books
1. E. Rich & K. Knight, Artificial Intelligence, 2/e, TMH, New Delhi, 2005.
2. P.H. Winston, Artificial Intelligence, 3/e, Pearson Edition, New Delhi, 2006.
3. D.W. Rolston, Principles of AI & Expert System Development, TMH, New Delhi.
PCA318E: Cryptography and Network Security
4 Credits (4- 0- 0)
Prerequisite: Computer Networks
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction: Overview: Services, Mechanisms and Attacks, The OSI Security
Architecture, A Model of Network Security. Classical Encryption Techniques:
Symmetric Cipher Model, Substitution Techniques, Transposition Techniques, Rotor
Machines, Steganography. Block Cipher and the Data Encryption Standard: Simplified
DES, Block Cipher Principles, The Data Encryption Standard, The Strength of DES,
Differential and Linear Cryptanalysis.
UNIT II 13 Hours
Symmetric Ciphers: Symmetric Ciphers: Triple DES, Blowfish. Confidentiality Using
Conventional Encryption: Placement of Encryption Function, Traffic Confidentiality,
Key Distribution, Random Number Generation. Public-Key Encryption: Number
Theory: Prime Numbers, Format's and Euler's Theorems, Testing for Primality. Public-
Key Cryptography and RSA: Principles of Public-Key Cryptosystems, The RSA
Algorithm, Key Management, Diffie Hellman Key Exchange. Message Authentication:
Authentication Requirements, Authentication Functions, Message Authentication Codes,
MD5 Message Digest Algorithm.
UNIT III 15 Hours
Digital Signatures and Authentication Protocols: Digital Signatures and
Authentication Protocols: Digital Signatures, Authentication Protocols, Digital Signature
Standard. Network Security Authentication Applications: Kerberos, X.509 Directory
Authentication Service. Electronic Mail Security: Pretty Good Privacy. IP Security:
Overview, IP Security Architecture, Authentication Header, Encapsulation Security
Payload.
UNIT IV 11 Hours
Web Security: Web Security Requirements, Secure Sockets Layer and Transport Layer
Security, Secure Electronic Transaction. System Security Intruders: Intruders.
Malicious Software: Viruses and Related Threats, Countermeasures. Firewalls: Firewall
Design Principles.
Text book
1. William Stallings, Cryptography and Network Security, Third Edition, Pearson
Education, 2003 .
Reference books
1. Charlie Kaufman, Radia Perlman, Mike Speciner, Network Security:Private
communication in a Public World, Second Edition, Pearson Education Asia, 2002.
2. Atul Kahate, Cryptography and Network Security, Tata McGrawHill , 2003.
PCA319E: Software Project Management
4 Credits (4- 0- 0)
Prerequisite: Software Engineering
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction to Software Project Management: Project Definition: Contract
Management: Activities Covered By Software Project Management: Overview of Project
Planning – Stepwise Project Planning. Project Evaluation: Strategic Assessment:
Technical Assessment, Cost Benefit Analysis
UNIT II 13 Hours
Cash Flow Forecasting : Cost Benefit Evaluation Techniques: Risk Evaluation. Activity
Planning: Objectives, Project Schedule, Sequencing and Scheduling Activities, Network
Planning Models, Forward Pass, Backward Pass, Activity Float, Shortening Project
Duration : Activity on Arrow Networks, Risk Management, Nature Of Risk
UNIT III 13 Hours
Types of Risk: Managing Risk, Hazard Identification, Hazard Analysis, Risk Planning
And Control. Monitoring and Control: Creating Framework, Collecting The Data
,Visualizing Progress, Cost Monitoring, Earned Value, Prioritizing Monitoring, Getting
Project Back To Target, Change Control, Managing Contracts.
UNIT IV 13 Hours
Introduction : Types of Contract , Stages In Contract Placement , Typical Terms of A
Contract , Contract Management , Acceptance. Managing People and Organizing
Teams : Introduction, Understanding Behavior, Organizational Behavior: A Background,
Selecting The Right Person For The Job, Instruction In The Best Methods, Motivation ,
The Oldman, Hackman Job Characteristics Model ,Working In Groups, Becoming A
Team, Decision Making, Leadership, organizational Structures, Stress, Health And Safety
,Case Studies.
Text Book
1. Bob Hughes, Mikecotterell, Software Project Management, Third Edition, Tata
McGraw Hill, 2004.
Reference Books
1. Richard H Thayer Foreword by Edward Yourdon,software Engineering Project management, Wiley Edition Second Edition
2. Jack T. Marchewka, Information Technology Project Management, 3rd edition,
Wiley India, 2009.
3. Ramesh, Gopalaswamy, Managing Global Projects, Tata McGraw Hill, 2001.
4. Royce, Software Project Management, Pearson Education, 1999.
5. Jalote, Software Project Management in Practice, Pearson Education, 2002.
PCA320E: Data mining
4 Credits (4- 0- 0)
Prerequisite: Database Concepts and Applications, Applied Mathematics
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction to data mining: Definition of Data Mining, Motivating Challenges of
DM, Data Mining Tasks. Data: Data Attributes, Types of Data, Quality of Data and
Data Preprocessing, Measures of Similarity and Dissimilarity.
UNIT II 13 Hours
Association Analysis: Definition of Association Analysis, Frequent Item
Set Generation, Rule Generation, Compact Representation of Frequent Item Sets.
Alternate Method of Generating Item Sets, FP Growth Algorithms, Evaluation
of Association Patterns
UNIT III 13 Hours
Classification: Preliminaries, General Approach To Solving Classification Problem,
Decision Tree Based Classifier, Rule Based Classifier, Nearest Neighbor
Classifier. Cluster Analysis: Overview, Kmeans, DBSCAN
UNIT IV 13 Hours
Applications: Data Mining Applications, Web Mining- Introduction,webterminology
characteristics, Locality and Hierarchy in the web, web content mining, web usage
mining web structure mining, web mining software. Search Engines-Introduction,
characteristics of search engines, search engine functionality, search engine architecture,
ranking of web pages, search engine industry, enterprise search engine software.
Text Books:
1. PangNing Tan, Michael Steinbach, Vipin Kumar, “Introduction to Data Mining”,
Pearson Education.
2.G K Gupta, “Introduction to Data Mining with Case studies”, PHI.
PCA321E: Software Testing and Analysis
4 Credits (4- 0- 0)
Prerequisite: Software Engineering
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Basics of Software Testing: Humans, Errors and Testing, Software Quality;
equirements, Behavior and Correctness, Correctness Vs Reliability; Testing and
Debugging; Test Metrics; Software and Hardware Testing; Testing and Verification;
Defect Management; Execution History; Test Generation Strategies; Static Testing; Test
Generation from Predicates. Basic Principles: Sensitivity, Redundancy, Restriction,
Partition, Visibility and Feedback. Test Analysis Activities within a Software Process:
The Quality Process, Planning and Monitoring Quality goals, Dependability Properties
UNIT II 13 Hours
Analysis; Testing Improving the Process, Organizational Factors. Finite Models,
Dependence and Dataflow Models: Overview, Finite abstraction of Behavior; Control
Flow Graphs; Finite State Machines, Definition-Use Pairs; Data Flow Analysis; Cluster
Analysis; Live and Avail; From Execution to Conservative Flow Analysis; Data flow
analysis with Arrays and Pointers; Inter-Procedural Analysis. Functional Testing:
Overview, Random versus Partition Testing Strategies, A Systematic Approach,
Choosing a Suitable Approach
UNIT III 13 Hours
Planning and Monitoring the Process, Documenting Analysis and Test :Quality and
Process, Test and Analysis strategies and plans, Risk Planning, Monitoring the Process,
Improving the process, The quality team, Organizing documents, Test strategy document,
Analysis and test plan, Test design specifications documents, Test and analysis reports.
Integration and Component-based Software Testing: Overview, Integration Testing
Strategies, Testing Components and Assemblies. System, Acceptance, and Regression
Testing: Overview, System Testing, Acceptance Testing, Usability, Regression Testing,
Regression Test Selection Techniques.
UNIT IV 13 Hours
Test Case Prioritization and Selective Execution. Automating Analysis and Test:
Overview, Automation and Planning, Process Management, Static Metrics, Test Case
Generation and Execution, Static Analysis and Proof, Cognitive Aids, Version Control,
Debugging, Choosing and Integrating Tools. Documenting Analysis and Test:
Overview, Organizing Documents, Test Strategy Document, Analysis and Test Plan, Test
Design Specification Documents, Test and Analysis Reports.
Text Books
1. Adithya P.Mathur “Foundations of Software Testing – Fundamental Algorithms and
Techniques”, Pearson Education India, 2011.
2. MauroPezze, Michael Young, Software testing and Analysis- Process, Principles and
Techniques, Wiley India, 2012.
Reference Books
1. Kshirasagara Naik, Priyadarshi Tripathy: Software Testing and Quality Assurance,
Wiley India 2012
2. M.G.Limaye: Software Testing-Principels, Techniques and Tools – McGrawHill, 2009
3. Brain Marick: The Craft of Software Testing, Pearson Education India, 2008
4. Ron Patton: Software Testing, 2nd Edition, Pearson Education, India, 2013
PCA322E: Digital Image Processing4 Credits (4- 0- 0)
Prerequisite: Computer Graphics
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13Hours
Fundamentals of Image Processing : Image Acquisition, Image Model, Sampling,
Quantization, Relationship between pixels and distance measurement, connectivity,
Image Geometry, Photographic film. Histogram : Definition, Decision of Contrast basing
on histogram, Operations basing on histograms like image stretching , image sliding,
Image classification. Definition and Algorithm of Histogram equalization
UNIT II 13 Hours
Image Enhancement ( by Spatial Domain Methods ): Arithmetic and Logical
operations, pixel or point operations, size operations, Smoothing filters – Mean, Median ,
Mode filters – Comparative study, Edge enhancement filters – Directorial filters, Sobel,
Laplacian, Robert, Low pass filters, high pass filters, sharpening filters – Comparative
study, Comparative study of all filters .Image Enhancement : ( by Frequency Domain
Method ) : Design of Low Pass, High Pass, Edge enhancement, Sharpening filters in
frequency domain. Homomorphic filters in frequency domain and spatial domain.
UNIT III 13 Hours
Color Image processing: Introduction, color model and transformation. Image
Compression : Definition, A brief discussion on – Run length encoding, contour coding,
Huffman code, compression due to change in domain, compression due to quantization,
compression at the time of image transmission, compression at the time of image
transmission, brief discussion on Image Compression standards
UNIT IV 13 Hours
Image segmentation : Definition, Characteristics of segmentation, Detection of
Discontinuities, Threasolding, Pixel based segmentation method, Region based
segmentation methods – segmentation by pixel aggregation, segmentation by sub region
aggregation, histogram based segmentation, split and merge technique. Use of motion in
segmentation (spatial domain technique only).
Morphology : Dilation, Erosion, Opening, Closing, Hit-and-Mass Transform, Boundary
extraction, Region filling, connected components, thinning, Thickening, skeletons,
Pruning Extensions to Gray – Scale Images. Application of Morphology in IP.
Text Book
1. Rafael C Gonzalez, Richard E Woods ,Digital Image Processing ,Addision Wesley
Reference Books
1.Anil K Jain, Fundamentals of Digital Image Processing, PHI
2. B Chanda & D Dutta Majumder ,Digital Image Processing and Analysis PHI
3. Dwayne Phillips ,Image Processing in C , BPB.
PCA323E: Web 2.0 and Rich Internet Applications
4 Credits (4- 0- 0)
Prerequisite: Web Technologies
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 HoursIntroduction to Ajax: Web 2.0 and Rich Internet Applications, Overview of Ajax,
Examples of usage of Ajax: Updating web page text, Chatting in real time, Dragging and
dropping, Downloading images. Creating Ajax Applications: An example, Analysis of
example ajax.html, Creating the JavaScript, Creating and opening the XMLHttpRequest
object, Data download, Displaying the fetched data, Connecting to the server, Adding
Server-side programming, Sending data to the server using GET and POST, Using Ajax
together with XML. Handling multiple XMLHttpRequest objects in the same page, Using
two XMLHttpRequest objects, Using an array of XMLHttpRequest objects, Using inner
functions, Downloading JavaScript, connecting to Google Suggest, Creating google.php,
Downloading from other domains with Ajax, HTML header request and Ajax, Defeating
caching, Examples.Building XML and working with XML in JavaScript, Getting the
document element, Accessing any XML element, Handling whitespace in Firefox,
Handling cross-browser whitespace, Accessing XML data directly, Validating XML,
Further examples of Rich Internet Applications with Ajax.
UNIT II 13 Hours
Drawing user’s attention to downloaded text, Styling text, colors and background using
CSS, Setting element location in the web pages, Setting the stacking order of web page
elements, Further examples of using Ajax. Displaying all the data in an HTML form,
Working with PHP server variables, Getting the data in to array format, Wrapping
applications in to a single PHP page, Validating input from the user, Validating integers
and text, DOM, Appending new elements to a web page using the DOM and Ajax,
Replacing elements using the DOM, Handling timeouts in Ajax, Downloading images
with Ajax, Example programs.Introduction: Understanding Flex Application
Technologies, Using Flex Elements, Working with Data Services (Loading Data at
Runtime), The Differences between Traditional and Flex Web Applications,
Understanding How Flex Applications Work, Understanding Flex and Flash Authoring.
Building Applications with the Flex Framework: Using Flex Tool Sets, Creating Projects,
Building Applications, Deploying Applications Framework Fundamentals: Understanding
How Flex Applications Are Structured, Loading and Initializing Flex Applications,
Understanding the Component Life Cycles, Loading One Flex Application into Another
Flex Application, Differentiating Between Flash Player and the Flex Framework, Caching
the Framework, Understanding Application Domains, Localization, Managing Layout:
Flex Layout Overview, Making Fluid Interfaces, Putting it all together.
UNIT III 13 HoursMXML: Understanding MXML Syntax and Structure, Making MXML Interactive
Working with UI Components: Understanding UI Components, Buttons, Value Selectors,
Text Components, List-Based Controls, Pop-Up Controls, Navigators, Control Bars
Customizing Application Appearance: Using Styles, Skinning components, Customizing
the preloader, Themes, Runtime CSS, ActionScript: Using ActionScript, MXML and
ActionScript Correlations, Understanding ActionScript Syntax, Variables and Properties,
Inheritance, Interfaces, Handling Events, Error Handling, Using XML.
UNIT IV 13 HoursManaging State: Creating States, Applying States, Defining States, Adding and
Removing Components, Setting Properties, Setting Styles, Setting Event Handlers, Using
Action Scripts to Define States, Managing Object Creation Policies, Handling State
Events, Understanding State Life Cycles, When To Use States.Using Effects and
Transitions: Using Effects, Creating Custom Effects, Using Transitions, Creating Custom
Transitions. Working with Data: Using Data Models, Data Binding, Enabling Data
Binding for Custom Classes, Data Binding Examples, Building data binding
proxies.Validating and Formatting Data: Validating user input, Formatting Data.
Text Books
1. Nicholas C Zakas et al ,Professional AJAX , Wrox publications, 2006.2. Chafic Kazoun, Programming Flex 2,O’Reilly publications, 2007.3. Francis Shanahan, Mashups, Wrox, 2007.
Reference Books1. Thomas A. Powel ,Ajax: The Complete Reference, , McGraw Hill, 2008.
2. Gottfried Vossen, Stephan Hagemann, Unleashing Web 2.0: From Concepts
to Creativity, Elsevier, 2007.
3. Colin Moock ,Essential Actionscript 3.0–, O’Reilly Publications, 2007.
4. Steven Holzner ,Ajax Bible, Wiley India, 2007.
5. Justin Gehtland et al, A Web 2.0 Primer Pragmatic Ajax, SPD Publications,
2006.
6. Eric Van derVlist et al, Professional Web 2.0 Programming, Wiley India,
2007
PCA324E: Network Management
4 Credits (4- 0- 0)
Prerequisite: Computer Networks, Introduction to Java
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Requirements for the Management of Networked Systems :Management Scenarios,
Management functions, Organizational aspects of Management, Time aspects of
anagement. IP Network Management :Choosing to manage the network, Choosing a
configuration method, Management information Base, Simple Network Management
Protocol, Extensible markup Language, Common Object Request Broker Architecture.
UNIT II 13 Hours
IP-Based Service Implementation and Network Management: Simple Network
Management Protocol, Ip- Based Service Implementation-OSS, Provisioning Issues, Network
Management Issues, OSS Architecture.Network Management Architecture :Background,
Defining Network Management, Network Management Mechanisms, Architectural
Considerations.
UNIT III 13 Hours
SLA and Network Monitoring:Passive and Active Network Monitoring, Passive
Network Monitoring, Active Network Monitoring.MPLS Network Management: AN
Introduction :A brief Introduction to MPLS, MPLS Applications, Key Aspects of MPLS
Network Management, Management Information Base Modules for MPLS.MPLS
Management Interfaces The basics of Management Interfaces, Command line interface,
CORBA, XML, Bulk File Transfer, Simple Network Management Protocol
UNIT IV 13 Hours
Optical Networks: Control and Management: Network Management functions,
Optical Layer Services and Interfacing, Layers with in the Optical Layer, Multivendor
Interoperability, Performance and Fault Management, Configuration.Web-Based
Management :NMS with Web Interface and Web- Based Management Web Interface to
SNMP Management, Embedded Web- Based Management, Desktop management
interface, Web-Based Enterprise Management, WBEM: Windows Management
Instrumentation, Java management Extensions, Management of a Storage Area Network:
Future Directions.
Text books
1. Network Management- Know it all by Adrian Farrel, Elsevier publications.
2. Network Management- Principles and Practice, Mani Subramaniam, Pearson
Education.
Reference books
1. Network Management, Morris, Pearson Education.
2. Practical Guide to SNMPv3 and Network Management, David Zeltserman, PHI.
PCA325E: NOSQL
4 Credits (4- 0- 0)
Prerequisite: Database Concepts and Applications
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Definition of NoSQL, History of NoSQL and Different NoSQL products, Exploring
MondoDB Java/Ruby/Python, Interfacing and Interacting with NoSQL NoSQL Storage
Architecture, CRUD operations with MongoDB.
UNIT II 13 Hours
Querying, Modifying and Managing NoSQL Datastores, Indexing and ordering datasets
(MongoDB/CouchDB/Cassandra), NoSQL in CLOUD, Parallel Processing with
MapReduce, BigData with Hive.
UNIT III 13 Hours
Surveying Database Internals, Migrating from RDBMS to NoSQL, WebFrameworks and
NoSQL, using MySQL as a NoSQL, Php and MongoDB, Python and MongoDB.
UNIT IV 13 Hours
Creating Blog Application with PHP, NoSQL Database Administration.
Text books
1. Shashank Tiwari ,Professional NoSQL , WROX Press,2011.
2. The Definitive guide to MongoDB, The NoSQL Database for Cloud and Desktop
Computing, Apress 2010.
PCA326E: Software Architectures
4 Credits (4- 0- 0)
Prerequisite: Software Engineering
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 HoursIntroduction: What software architecture is and what it is not; Architectural Structures
and views; Architectural patterns; What makes a “good” architecture? Why is software
important? Context of Software Architecture: Technical Context; Project life-cycle
context; Business context; Professional context; Stake holders; How is Architecture
influenced? What Do Architecture influence?
UNIT II 13 HoursUnderstanding Quality Attributes: Architecture & Requirements; Functionality;
quality attribute considerations; Specifying and achieving Quality attribute requirements;
Guiding quality design decisions; Availability; Interoperability; Modifiability;
Performance; Security; Testability; Usability
UNIT III 13 HoursQuality Attribute modeling and Analysis: Modeling Architecture to enable quality
attribute analysis; Quality attribute check lists; Through experiments and Back-of-the
envelope analysis; Experiments; Simulations and prototypes; Analysis at different stages
of the life cycle Architecture and requirements: Gathering ASRs from requirements
documents; ASRs by interviewing stake holders; ASRs by understanding the business;
capturing ASRs in a utility tree; Typing the methods together
UNIT IV 13 HoursDocumenting Software Architecture: Uses and Audiences for architecture
documentation; Notations, View and Behavior; Documentation and quality attributes
Architecture, Implementation & Testing: Architecture and implementation;
Architecture and testing Architectural Patterns: Introduction to patterns; From Mud to
structure; Layers; Pipes and filters; Blackboard; Distributed systems; Broker; Interactive
systems; Model-view-control; Presentation abstraction-control; Adaptable systems;
Microkernel.
Text books
1. Len Bass, Paul Clements, Rick Kazman: Software Architecture in Practice, 3d
Edition, Pearson Education, 2013 .
2. Frank Buschmann, Regine Meunier, Hans Rohnert, Peter Sommerlad, Michael Stal:
Pattern- Oriented Software Architecture, A System of Patterns, Volume 1, John
Wiley and Sons, 2012.
Reference books
1. Richard N. Taylor, Nenad Medvidovic and Eric M. Dashofy, Software
Architecture: Foundations, Theory, and Practice, Wiley- India 2012.
2. Mary Shaw a n d Da v i d Ga r l a n , Software Ar c h i t e c t u r e -Perspectives o n a n
Eme r g i n gDiscipline, Prentice Hall of India, 2007.
PCA327E: Enterprise Resource Planning
4 Credits (4- 0- 0)
Prerequisite: Computer Networks, Web Technologies
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction To ERP : Overview, Benefits of ERP, ERP and Related Technologies,
Business Process Re-engineering, Data Warehousing, Data Mining, On–line Analytical
Processing, Supply Chain Management, Implementation Life Cycle, Implementation
Methodology, Hidden Costs.
UNIT II 13 Hours
Organizing, Implementation ,Vendors,Consultants and Users ,Contracts , Project
Management and Monitoring, Business Modules : Business Modules in an ERP
Package, Finance, Manufacturing, Human Resource.
UNIT III 13 Hours
Plant Maintenance, Materials Management, Quality Management, Sales and Distribution.
ERP Market : ERP Market Place, SAP AG, PeopleSoft ,Baan Company , JD Edwards
World.
UNIT IV 13 Hours
Solutions Company , Oracle Corporation ,QAD , System Software Associates. ERP –
Present and Future : Turbo Charge the ERP System , EIA, ERP and E–Commerce ,
ERP and Internet, Future Directions in ERP.
Text books
1.Alexis Leon, ERP Demystified, Tata McGraw Hill, 1999.
2.Joseph A. Brady, Ellen F. Monk, Bret J. Wangner, Concepts in Enterprise Resource
Planning, Thomson Learning, 2001.
Reference books
1.Vinod Kumar Garg and N.K .Venkata Krishnan, Enterprise Resource Planning -
concepts and Planning, Prentice Hall, 1998.
2. Jose Antonio Fernandz, The SAP R /3 Hand book, Tata McGraw Hill.
PCA328E: Pattern Recognition
4 Credits (4- 0- 0)
Prerequisite: Digital Image Processing
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction: Applications of pattern recognition, statistical decision theory, image
processing and analysis. Probability: Introduction, probability of events, random variables,
Joint distributions and densities, moments of random variables, estimation of parameters
from samples, minimum risk estimators.
UNIT II 13 Hours
Statistical Decision Making: Introduction, Baye’s Theorem, multiple features,
conditionally independent features, decision boundaries, unequal costs of error, estimation of
error rates, the leavingone- out technique. Characteristic curves, estimating the composition
of populations. Nonparametric Decision Making: Introduction, histograms, Kernel and
window estimators, nearest neighbor classification techniques, adaptive decision boundaries,
adaptive discriminate Functions.
UNIT III 13 Hours
Minimum squared error discriminate functions, choosing a decisionmaking technique.
Clustering: Introduction, hierarchical clustering, partitional clustering. Artificial Neural
Networks: Introduction, nets without hidden layers. nets with hidden layers, the back
Propagation algorithms, Hopfield nets, an application Rocessing Of Waveforms And
Images: Introduction, gray level sealing transformation, equalization, geometric image and
interpolation.
UNIT IV 13 Hours
Smoothing, transformations, edge detection, Laplacian and sharpening operators, line
detection and template matching. Image Analysis: Introduction, Scene segmentation and
labeling, counting objects, perimeter measurement, Hough Transformation, orphological
Operations, texture, Fourier transforms, The classification of White Blood Cells
Text Book
1. Eart Gose, Richard Johnsonburg and Steve Joust, Pattern Recognition and Image
Analysis, Prentice-Hall of India-2003.
Reference books
1. Duda and Hart ,Pattern recognition (Pattern recognition a scene analysis).
2. Robert J Schalkoff,John Wiley,Pattern recognition: Statistical, Structural and neural
approaches.
PCA329E: Service Oriented Architecture
4 Credits (4- 0- 0)
Prerequisite: Introduction to JAVA, Object Oriented Programming with C++
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Introduction to SOA, Evolution of SOA: Fundamentals of SOA, Common
characteristics of contemporary SOA, Common tangible benefits of SOA, A SOA
timeline (from XML to Web Services to SOA), The continuing evolution of SOA
(standards organizations and Contributing vendors), The roots of SOA (comparing SOA
to Past Architectures) Web Services and Primitives of SOA: The Web Services
framework, Services (as Web Services), Service Description (with WSDL), Messaging
(with SOAP).
UNIT II 13 Hours
Web Services and Contemporary SOA: Message Exchange patterns, Service Activity;
Coordination, Atomic Transactions, Business Activities, Orchestration, Choreography,
Addressing, Reliable Messaging, Correlation, Policies, Meta data Exchange, Security,
Notification and eventing.
UNIT III 13 Hours
Principles of Service – Orientation: Services- Orientation and the enterprise, Anatomy
of service-oriented Architecture, Common Principles of Service Orientation; How
Service Orientation principles inter relate, Service Orientation and object orientation,
Native Web Service support for service orientation principles. Service Layers : Service
Orientation and contemporary SOA, Service Layer Abstraction, Application service
layer, Business Service Layer, Orchestration Service Layer, Agnostic Services, Service
Layer Configuration. scenarios.
UNIT IV 13 Hours
Business Process Design: WS-BPEL Language basics, WS-Coordination overview,
Service oriented business process redesign, WS-Addressing language basics, Ws-Reliable
messaging language basics. Enterprise Applications: Learning Objectives, Architectural
Considerations, Solution Architecture for Enterprise Applications, Solution Architecture
for Enterprise Applications based on SOA, Software Platforms for Enterprise
Applications.
Text books
1. Thomas Erl: Service Oriented Architecture- Concepts, Technology and Design,
Pearson Education, 2013.
2. Shankar Khambhapaty, Service Oriented Architecture for Enterprise and
Cloud Applications, 2nd Edition, Wiley-India, 2012.
Reference books
1. Frank cohen, FastSOA, Elsevier, 2010.
2. Eric Newcomer, Greg Lomow, Understanding SOA with Web Services,
Pearson Education, 2009.
PCA330E: Cloud Computing
4 Credits (4- 0- 0)
Prerequisite: Computer Networks, Web Technologies
CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03
UNIT I 13 Hours
Distributed System Models and Enabling Technologies: Clusters of Cooperative
Computers, Grid Computing Infrastructures, Peer-to-Peer Network Families, Cloud
Computing over the Internet. Software Environments for Distributed Systems and
Clouds: Service-Oriented Architecture (SOA), Trends towards Distributed Operating
Systems, Parallel and Distributed Programming Models.Performance, Security, and
Energy-Efficiency: Performance Metrics and Scalability Analysis, Fault-Tolerance and
System Availability, Network Threats and Data Integrity, Energy-Efficiency in
Distributed Computing.
UNIT II 13 Hours
Computer Clusters for scalable parallel computing
Clustering for massive parallelism: Cluster Development Trends, Design Objective of
Computer Clusters, Fundamental Cluster Design issues. Virtual machines and
Virtualization of clusters and Data centers, levels of virtualization Implementation, VMM
Design requirements and providers.Cloud computing and Service Models: Public,
Private, and Hybrid Clouds, Cloud Ecosystem and Enabling Technologies, Infrastructure
as a Service (IaaS), Platform and Software-as-a-Service (Paas, SaaS).Architectural
Design of Compute and Storage Clouds: A Generic Cloud architecture Design, Layered
Cloud Architectural development.
UNIT III 13 Hours
Public Cloud Platforms: GAE, AWS, and Azure: Smart Cloud, Public Clouds and
Service Offerings, Google App Engine (GAE), Amazon Web Service (AWS), Microsoft
Windows Azure. Cloud Security and Trust management: Cloud Security Defense
Strategies, Distributed Intrusion/Anomaly Detection, Data and Software Protection
Techniques.Features of Cloud and Grid Platforms: Cloud Capabilities and Platform
Features, Traditional Features Common to Grids and Clouds.
UNIT IV 13 Hours
Programming Support of App-Engine Programming the Google App Engine, Google
File System (GFS), Bigtable, Google’s NOSQL system, Chubby, Google’s Distributed
Lock service. Ubiquitous Clouds and the Internet of Things:Performance of
Distributed Systems and the Cloud Data-intensive Scalable Computing (DISC), Quality
of Service in Cloud computing. Online social and Professional Networking: Online
Social Network Characteristics, Graph-Theoretic Analysis of Social networks,
Communities and Applications of Social Networks.
Text book
1. Kai Hwang, Jack Dungaree, and Geoffrey Fox: Distributed and Cloud Computing,
From Parallel Processing to the Internet of Things, MK Publishers, 2012.
Reference books
1. Michael Miller, Cloud Computing: Web-Based Applications that change the Way you
work and collaborate Online, Pearson Publication, 2012.
2. Anthony T. Volte, Toby J. Volte, Robert Elsenpeter: Cloud Computing, A Practical
Approach, McGraw Fill, 2010.
3. Cloud Computing for Dummies: J. Hurwitz, ISBN 978-0-470-484-8
4. Dr. Kumar Sourabh, Cloud Computing, 2nd Edition, Wiley India.