Embed Size (px)
Citation preview
CURRICULUM: ME – COMPUTER SCIENCE AND ENGINEERING
S.NO CODE COURSEHOURS/WEEK
CREDITSMAXIMUM MARKS
L T P CA FE TOTAL
SEMESTER - 1 THEORY
1 11PSM102Theoretical Foundations of Computer Science
3 1 0 4 20 80 100
2 11PCK101 Advanced Data Structures 3 0 0 3 20 80 100
3 11PCK102 Operating Systems 3 0 0 3 20 80 100
4 11PCK103 Advanced Computer Architecture 3 0 0 3 20 80 100
5 11PCK104 Computer Networks 3 0 0 3 20 80 100
6 11PCK105 Software Engineering 3 0 0 3 20 80 100
PRACTICAL
1 11PCK107 Data Structures Lab 0 0 3 2 20 80 100
2 11PCK108Operating Systems and Computer Networks Lab
0 0 3 2 20 80 100
TOTAL 19 1 6 24
S.NO CODE COURSEHOURS/WEEK
CREDITSMAXIMUM MARKS
L T P CA FE TOTAL
SEMESTER - 2 THEORY
1 11PCK201 Theory of Computation 3 1 0 4 20 80 100
2 11PCK202 Database Technology 3 0 0 3 20 80 100
3 11PCK203 Web Technology 3 0 0 3 20 80 100
4 11PCK204 Design And Analysis of Algorithms 3 0 0 3 20 80 100
5 Elective - I 3 0 0 3 20 80 100
6 Elective - II 3 0 0 3 20 80 100
PRACTICAL
1 11PCK205 Database Technology Lab 0 0 3 2 20 80 100
2 11PCK206 Web Technology Lab 0 0 3 2 20 80 100
TOTAL 18 1 6 23
S.NO CODE COURSE HOURS/WEEK CREDITS MAXIMUM MARKS
L T P CA FE TOTAL
SEMESTER - 3 THEORY
1 Elective - III 3 0 0 3 20 80 100
2 Elective - IV 3 0 0 3 20 80 100
3 Elective - V 3 0 0 3 20 80 100
PRACTICAL
1 11PCK301 Project Work Phase - I 0 0 12 6 20 80 100
2 Technical Seminar 0 0 2 1 100 - 100
TOTAL 9 0 14 16
S.NO CODE COURSEHOURS/WEEK
CREDITSMAXIMUM MARKS
L T P CA FE TOTAL
SEMESTER - 4 PROJECT WORK
1 11PCK401 Project Work Phase - II 0 0 24 12 20 80 100
TOTAL 0 0 24 12
Elective Subjects (II Semester) Elective Subjects (III Semester)
11PCE201 Visual Programming 11PDE301 Software Quality Assurance
11PDE201 Object Oriented System Design 11PCE301 Grid Computing
11PCE202 Mobile Computing 11PCE302 Data Mining and Warehousing
11PCE203 Artificial Intelligence 11PCE303 Wireless and Sensor Networks
11PDK202 Software Project Management 11PCE304 Multimedia Systems
11PCE204 High Speed Networks 11PDE303 Design Patterns
11PCE205 Information Security 11PCE305 Service Oriented Architecture
11PCE206 Natural Language Processing 11PDE304 Software Metrics
11PCE207 Software Agents 11PCE306 Component Based Technology
11PCE208 Distributed Computing 11PCE307 Unix Network Programming
11PCE209 Open Source Systems 11PCE308 Client Server Computing
11PCE210 Network Security 11PCE309 Research Methodologies
11PCE211 Real Time Systems 11PCE310 Semantic Web
11PCE212 Ad Hoc Networks
L – Lecture T – Tutorial P – Practical CA – Continuous Assessment FE- Final Exam
11PSM102 THEORETICAL FOUNDATIONS OF L T P C
COMPUTER SCIENCE 3 1 0 4
Course Objectives
To provide strong foundation to the students to expose various emerging new areas of applied
mathematics and appraise them with their relevance in Engineering and Technological field.
UNIT I – FUNDAMENTAL STRUCTURES 9
Relations – Representation of a relation – operations on relations – Equivalence relations – Partition
and Equivalence classes – Partial ordering –Functions– Representation of functions –Type of
functions – Composition of functions – Inverse functions – Permutation functions – Methods of
Proofs – Mathematical Induction.
UNIT II – LOGIC 9
Propositions – Logical connectives – Compound propositions – Conditional and biconditional – Truth
tables – Tautologies and contradictions – Contrapositive – Logical equivalences and implications –
Normal forms – Principal conjunctive and disjunctive normal forms – Rules of inference –Predicates
and Quantifiers –Logical equivalences and implications for quantified statements – Theory of
inference.
UNIT III – FORMAL LANGUAGES AND AUTOMATA 9
Introduction – Phrase structure grammar – Types of phrase structure grammar – Ambiguity –
Languages – Types of languages – Finite state machines – Deterministic and Non- deterministic finite
state machines – Language accepted by a finite automaton and non deterministic finite automaton –
Equivalence of FA and NFA – Procedure for finding an FA equivalent to NFA – Turing Machines.
UNIT IV – DISCRETE PROBABILITY 9
Finite probability – Conditional Probability – Baye’s theorem – Mathematical expectation –
Probability Distributions: Discrete Distributions – Binomial, Poisson, and Geometric – Continuous
Distributions: Uniform, Exponential, Weibull and Gamma distributions.
UNIT V – GRAPH THEORY 9
Basic Concepts – Some special simple graphs – Matrix representation of graphs – paths, cycles,
connectivity – Eulerian and Hamiltonian Graphs – Connectedness in Digraphs Trees – Spanning Trees
– Binary trees – Shortest path algorithms.
TOTAL HOURS: 45 + 15
TEXT BOOKS
1. Trembly J.P and Manohar R, “Discrete Mathematical Structures with applications to Computer
Science”, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 2003.
2. Kenneth H.Rosen, “Discrete Mathematics and its Applications”, Sixth Edition, Tata McGraw –
Hill Pub. Co. Ltd., New Delhi, 2006.
REFERENCE BOOKS
1. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete Mathematical
Structures”, Fourth Indian reprint, Pearson Education pvt Ltd., New Delhi, 2003.
2. Ralph. P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied
Introduction”, Fourth Edition, Pearson Education Asia, Delhi, 2002.
3. T.Veerarajan, “Discrete mathematics with Graph theory and Combinatorics”, Tata
McGraw – Hill Pub. Co. Ltd., New Delhi, 2008.
11PCK101 ADVANCED DATA STRUCTURESL T P C3 1 0 4
Course Objectives
To understand the various ADTs so as to use them in program design.
To design algorithms to various problems based on the design strategies.
To analyze algorithms to find out their time complexity.
UNIT – I ALGORITHM ANALYSIS 5
Mathematical Background, Model, Running Time calculations, General Rules.
UNIT – II DATA STRUCTURES 15
ADT, List ADT: linked list, doubly linked list, circular linked list; applications in polynomials. Stack
ADT: applications. Queue ADT: applications. Priority Queues.
UNIT – III TREES 14
Definitions. Implementation. Binary Trees and Traversals. Expression Trees. Threaded Binary Trees,
Binary Search Trees. AVL Trees. Splay Trees. B-Trees. Red-Black Trees.
UNIT – IV SORTING, SEARCHING AND HASHING 13
Bubble Sort. Insertion Sort. Merge Sort. Quick Sort. Heap Sort. Bucket Sort, External Sorting,
Concepts of searching - Sequential searching - Indexed sequential searching table – Hash Search Table
UNIT – V GRAPH ALGORITHMS 13
Definitions. Representation of Graphs. Topological Sort. Shortest-path algorithms. Network Flow
Problems. Minimum Spanning Tree. Graph Traversals - Applications of Depth-First Search.
NP-Complete Problems
TOTAL HOURS: 60
TEXT BOOKS
1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Pearson Education
Inc., Third Edition, 2006.
2. Alfred V. Aho, John E Hopcroft and Jeffrey D Ullman, “Data Structures and Algorithms”,
Pearson Education Inc., Low Price Edition, 2003.
REFERENCE BOOK
1. GAV Pai, “Data Structures and Algorithms”, Tata-McGraw Hill, 2008
11PCK102 OPERATING SYSTEMSL T P C3 0 0 3
Course Objectives
To become familiar with the fundamental concepts of operating systems;
To become competent in recognizing operating systems features and issues; and
To provide students with sufficient understanding of operating system design and how it
impacts application systems design and performance.
To learn the concepts of advanced operating system.
UNIT – I FUNDAMENTALS OF OS AND PROCESS MANAGEMENT 9
OS services and components - multitasking - multiprogramming- time sharing- buffering -spooling-.
Concept of Process and Threads -Process States -Process Scheduling – Operations on Processes -
Cooperating Processes- Inter process Communication- Multithreading-CPU Scheduling.
UNIT – II PROCESS SYNCHRONIZATION AND DEADLOCKS 9
Critical Section Problem-Semaphores-Classical Problems of Synchronization-Conditions for
Deadlock-Ostrich Algorithm-Deadlock detection and Recovery-Deadlock Avoidance-Deadlock
Prevention.
UNIT – III STORAGE MANAGEMENT 9
Swapping-Contiguous memory Allocation-Paging-Segmentation-Segmentation with paging-Demand
Paging-Page Replacement Algorithms-File Access Method-File System Implementation-Directory
Structure-Directory Implementation-Allocation Methods-Free Space Management.
UNIT- IV DISTRIBUTED OPERATING SYSTEM 9
Design issues in distributed operating system-Distributed file systems – Naming and Transparency-
Remote File Access-Stateful versus Stateless service – Distributed Coordination- Event
Ordering-Mutual Exclusion- Atomicity- Concurrency Control- Deadlock Handling-Election
Algorithms.
UNIT – V ADVANCED OPERATING SYSTEMS 9
Multimedia Operating Systems-Multimedia Process Scheduling-Multimedia File Systems-Disk
Scheduling for Multimedia-Overview of Real Time Operating Systems and Mobile Operating
Systems.
TOTAL HOURS : 45
TEXT BOOKS
1. Avi Silberschatz, P.B.Galvin, G.Gagne “Operating System Concepts” seventh edition,
John Wiley & Sons, 2007.
2. Pradeep K.Sinha, “Distributed Operating System: Concepts and Design”, IEEE computer
Society Press, PHI, 2004.
REFERENCE BOOK
1. Andrew S. Tanenbaum , “Modern Operating Systems”, PHI , 2nd Edition, 2001 .
11PCK103 ADVANCED COMPUTER ARCHITECTUREL T P C3 0 0 3
Course Objectives
To study the fundamentals of Computer Organization and architecture
To learn the working concepts of ALU and control unit
To know the basic idea of pipelining
To design a member based on the user needs.
To understand the parallel processing in a single and multiple processors
UNIT – I COMPUTER ORGANIZATION & ARCHITECTURE 9
Introduction-functional units - measuring and reporting performance- Quantitative principles of
computer design. Instruction set principles and examples- classifying instructions- types- Instruction
set Architectures - memory addressing-addressing modes
UNIT – II ALU & CONTROL UNIT 9
ALU design – Integer representations - Fixed point and floating point operations- Addition –
Subtraction- Multiplication-division- Multiple bus organization-Hardwired control – Micro
programmed control- examples – Degree of parallelism - Co-processors
UNIT – III PIPELINING & ILP 9
Basic concepts – structural hazards-Data hazards – Control hazards – Influence on instruction sets –
Data path and control considerations – Performance considerations – Exception handling-Super scalar
architecture. overcoming data hazards with dynamic scheduling –examples- reducing branch costs
with dynamic hardware prediction - taking advantages of ILP with multiple issues – limitations - Basic
compiler techniques for exposing ILP- static branch prediction- static multiple issues: VLIW approach
UNIT – IV MEMORY HIERARCHY DESIGN 9
Introduction- Basic concepts of Main memory – types –organization - Speed – Size and cost – Cache
memories – Improving cache performance – reducing cache miss penalty reducing miss rate –
reducing hit time-Virtual memory – Memory management requirements – Associative memories –
Secondary storage devices
UNIT – V INTRODUCTION TO PARALLEL PROCESSING 9
Flynn’s classification, SIMD and MIMD operations, Shared Memory vs. message passing
multiprocessors, Distributed shared memory, Hybrid multiprocessors synchronization- storage systems
– types of storage devices- buses- reliability-availability and dependability-RAID – errors and failures
in real systems
TOTAL HOURS: 45
TEXT BOOKS
1. John L. Hennessey and David A. Patterson,”Computer Architecture: A Quantitative
Approach”, Morgan Kaufmann, 2006.
2. Kai Hwang “Advanced Computer Architecture: Parallelism, Scalability, Programmability”
Tata McGraw Hill Edition, 2001.
REFERENCE BOOK
1. John P hayes ,” Computer Organization and architecture “, Pearson edition 2003
11PCK104 COMPUTER NETWORKSL T P C3 0 0 3
Course Objective
To study the basic concepts of communication networks, protocols and their performance.
UNIT – I INTRODUCTION 9
Introduction, Communication Systems, Signal and data, Transmission modes, Synchronous and
asynchronous transmission, Multiplexing, Modem. Networks Components and Categories, types of
Connections, Network Topologies, Reference model - Layering the communication process, The need
for layered solutions, Open Systems Interconnection (OSI) model, TCP/IP reference model.
UNIT- II DATA LINK LAYER 9
Design issues, framing, error detection and correction (Parity – LRC – CRC – Hamming code), flow
control ( Unrestricted simplex protocol,stop and wait, Sliding Window, go back-N ARQ – selective
repeat ARQ) , Data link layer in HDLC, Medium Access sub layer : MAC addresses ,ALOHA, slotted
ALOHA, Carrier sense multiple access, CSMA/CD, IEEE 802.X Standard Ethernet, wireless LANS.
Repeaters, Bridges, Router, Gateways, Switching Hubs, Virtual LANs
UNIT – III NETWORK LAYER 9
Switching techniques: Circuit Switching, Packet switching, Datagram, Virtual circuit and Permanent
Virtual Circuit, Message switching, Cell switching (ATM)
IPV4 datagram,IP addressing methods – Subnetting, ICMP,ARP, Routing Algorithms: Shortest path
Algorithm, Flooding, Flow based routing, Distance vector routing, Link state
routing,Hierarchicalrouting.
UNIT – IV TRANSPORT LAYER 9
Connectionless and connection oriented communication, Duties of transport layer, Multiplexing and
Demultiplexing, Sockets, UDP, TCP. Congestion Control Techniques: Leaky bucket algorithm, Token
bucket algorithm. Congestion prevention Policies: Traffic shaping, Choke packets, Load Shedding,
Jitter Control.
UNIT – V APPLICATION LAYER 9
Application Layer: DNS, SMTP, FTP, HTTP. Introduction to cellular, wireless and sensor networks
TOTAL HOURS: 45
TEXT BOOKS
1. Behrouz A. Forouzan, “Data Communications and Networks”, 4/E, Tata McGraw Hill
Publication, 2006.
2. William Stallings ,”Data & Computer Communications”, Sixth Edition, Pearson Education
Asia, 2002.
REFERENCE BOOKS
1. Andrew. S. Tanenbaum, “Computer Networks”, Forth edition, Pearson Education, 2002.
2. Larry L. Peterson and Bruce S. Davie ,” Computer Networks: A systems approach” , Third
Edition, Morgan Kaufmann Publishers, 2003.
3. web resources
11PCK105 SOFTWARE ENGINEERINGL T P C3 0 0 3
Course Objective
To have an understanding of System Engineering, Different life cycle models, Design Engineering,
Architectural and detailed design methods, Implementation and testing strategies , Verification
and validation techniques, Project planning and management & Use of CASE tools
UNIT – I SYSTEM ANALYSIS IN CHANGING WORLD 9
The Modern system analyst: The Analyst, Skills, Roles & Responsibilities.
Rapid application development: Development approaches, Techniques Packaged Software and
enterprise reusing planning: Packaged software, Enterprise Reusing planning, closer look at one ERP
package SAP R/3 Object Oriented analysis: OOA, Domain Analysis, Generic components of OOA
model, OOA Process, the Object relationship Model, Object behavior model. Unified Modeling
Language.
UNIT – II SYSTEM ENGINEERING 9
Computer based systems, system engineering hierarchy, Information engineering, Information
strategy planning, business area analysis, product engineering, modeling the system architecture,
system modeling and simulation, system specification. Computer Based System Engineering:
Emergent system properties, systems and their environment, system modeling, system engineering
process, system procurement.
UNIT – III MODERN DESIGN CONCEPT AND PRINCIPLES 9
Design Concepts and Principles: Fundamental issues in Software Design, Effective Modular Design,
cohesion and coupling. Architectural Design, Real-time Systems, User Interface Design, Component
Level Design, Modeling Language (UML)
UNIT – IV SOFTWARE MANAGEMENT 9
Verification and Validation, Software Testing, Critical Systems Validation, Managing People,
Software Cost Estimation, Quality Management, Process Improvement, Configuration Management
UNIT – V ADVANCED SOFTWARE ENGINEERING PROCESS 9
Software Maintenance, CASE Tools - Concepts, use and application, Clean room Software
Engineering, Component Based Software Engineering, Client/Server Software Engineering, Web
Engineering, Reengineering.
TOTAL HOURS: 45
TEXT BOOKS
1. Roger S. Pressman, “Software Engineering – A Practitioner’s Approach”, - 4th edition,
McGraw Hill Publications.
2. Ian Sommerville, “Software Engineering”, - 6th / 7th edition – Pearson Education Publications.
REFERENCE BOOKS
1. Shari Lawarence Pfleeger, “ Software Engineering Theory and Practices”, - 2nd Edition,
Prentice Hall.
2. John W. Satzinger, Robert B Jackson, Stephen D Burd, “ System Analysis and Design in
Changing World”, Thomson Course Technology.
3. Richard Murch, Tony Johnson, “ Intelligent Software agents”. Prentice Hall
11PCK107 DATA STRUCTURES LABL T P C0 0 3 2
Course Objective
To write C++ programs using linear and non – linear data structures
LIST OF EXPERIMENTS
1. Write a C++ program to implement stack operation
2. Write a C++ program to implement the applications of Stack ADT
3. Write a C++ program to implement queue operation
4. Write a C++ program to implement singly linked list
5. Write a C++ program for cursor implementation of Linked List
6. Write a C++ program to implement doubly linked list
7. Write a C++ program to implement binary search technique.
8. Write a C++ program to convert the tree to binary tree.
9. Write a C++ program to implement sorting techniques.
10. Write a C++ Program to implement Priority Queue
11. Implementation of any two of the following Search Structures
a. AVL Trees (Insertion, Deletion and Search)
b. Splay Trees (Insertion, Deletion and Search)
c. B-Trees (Insertion, Deletion and Search)
12. Write a C++ program to implement Shortest path Algorithms
13. Write a C++ program to find Min / Max Spanning Tree
14. Write a C++ program to implement searching techniques in graph
15. Write a C++ program to implement dynamic programming Technique
11PCK108 OPERATING SYSTEMS AND COMPUTER
NETWORKS LABL T P C0 0 3 2
Course Objectives
Understand and utilize basic shell commands.
Create and manipulate files and directories in the LINUX / UNIX environment
Grasp operating system design concepts and implementations of these concepts
LIST OF EXPERIMENTS
1. Programs using system calls, library function calls to display and write strings on standard output
device and files.
2. Programs using fork system calls.
3. Programs for error reporting using errno, perror( ) function.
4. Shell programming.
5. Programs to Simulate the following CPU scheduling algorithms
a) Round Robin b) SJF c) FCFS
7. Programs to simulate page replacement algorithms
a) FIFO b) LRU
8. Programs to simulate all file allocation strategies
a) Sequential b) Indexed c) Linked
9.(i) Simulate Paging Technique of memory management.
(ii) Programs to simulate Simulate all File Organization Techniques
a) Single level directory b) Two level c) Hierarchical d) DAG
10. Study of Open Source Operating Systems.
COMPUTER NETWORKS LAB
Course Objectives
To learn network modeling and simulation
To model and simulate IP routing, Network Addressing, TCP and UDP protocols
LIST OF EXPERIMENTS
1. Applications using TCP Sockets / UDP Sockets like
Echo client and echo server
File transfer
Remote command execution
SMTP
2. Some Network protocol simulation using NetSim, NS2, etc. for
Analysing number of transmitting nodes vs. collision count, mean delay for
Ethernet LAN .
Verification of stop-and-wait protocol.
Verification of Go-back-N protocol.
Verification of Selective repeat protocol.
Verification of distance vector routing algorithm.
11PCK201 THEORY OF COMPUTATIONL T P C3 1 0 4
Course Objectives
Be able to construct finite state automata and the equivalent regular expressions.
Be able to prove the equivalence of regular languages described by finite state machines and
regular expressions.
Be able to construct pushdown automata and the equivalent context free grammars.
Be able to prove the equivalence of context free languages described by pushdown automata
and context free grammars.
Be able to construct Turing machines
Be able to prove the equivalence of languages described by Turing machines
UNIT – I INTRODUCTION TO FINITE AUTOMATA 12
Alphabets - Strings and Languages; Automata and Grammars; Deterministic Finite Automata (DFA)-
Formal Definition - Language of DFA - Nondeterministic finite Automata (NFA) - NFA with epsilon
transition - Equivalence of NFA and DFA - Minimization of Finite Automata - Distinguishing one
string from other.
UNIT – II REGULAR EXPRESSION 12
Definition - Operators of regular expression and the precedence - Algebraic laws for Regular
expressions - Kleen’s Theorem - Regular expression to FA - DFA to Regular expression - Arden
Theorem - Pumping Lemma for regular Languages - Application of Pumping Lemma; Closure
properties of Regular Languages - Decision properties of Regular Languages - FA with output: Moore
and Mealy machine - Equivalence of Moore and Mealy Machine - Applications and Limitation of FA.
UNIT – III CONTEXT FREE GRAMMER AND CONTEXT FREE LANGUAGES 12
Definition – Examples - Derivation - Derivation trees - Ambiguity in Grammar - Inherent ambiguity -
Ambiguous to Unambiguous CFG - Useless symbols - Simplification of CFGs - Normal forms for
CFGs: CNF and GNF - Closure properties of CFLs - Decision Properties of CFLs: Emptiness,
Finiteness and Membership - Pumping lemma for CFLs.
UNIT – IV PUSH DOWN AUTOMATA & TURING MACHINES 12
Description and definition - Instantaneous Description - Language of PDA: Acceptance by Final state,
Acceptance by empty stack - Deterministic PDA - Equivalence of PDA and CFG: CFG to PDA and
PDA to CFG - Two stack PDA
Turing machines (TM): Basic model - definition and representation - Instantaneous Description -
Language acceptance by TM - Variants of Turing Machine - TM as Computer of Integer functions.
UNIT – V CHURCH TURING THESIS 12
Recursive and recursively enumerable languages - Halting problem- Introduction to Undecidability:
Undecidable problems about TMs - Post correspondence problem (PCP) - Modified PCP -
Reducibility: Undecidable problems from Language theory – A simple Undecidable problem –
Mapping Reducibility. Advanced topics in Computability Theory: The Recursion Theorem –
Decidability of logical theories – Turing Reducibility
TOTAL HOURS: 60
TEXT BOOKS
1. J.E.Hopcroft, R.Motwani and J.D Ullman, “Introduction to Automata Theory, Languages and
Computations”, Third Edition, Pearson Education, 2006.
2. Micheal Sipser, “Introduction of the Theory and Computation”, Second edition, Thomson
Brokecole, 2005.
REFERENCE BOOKS
1. K.L.P. Mishra and N.Chandrasekaran, “Theory of Computer Science: Automata, Languages
and Computation”, Third edition, PHI, 2008
2. Martin J. C., “Introduction to Languages and Theory of Computations”, TMH, 2003
11PCK202 DATABASE TECHNOLOGYL T P C3 0 0 3
Course Objectives
To understand database systems and data modeling techniques
To learn various data models, database languages
To be able to design a database system by understanding the concepts of functional
dependencies and normalization
To understand the physical database & DBMS implementation
To learn database recovery, security and authorization
UNIT – I INTRODUCTION TO DATABASE SYSTEMS AND RELATIONAL MODEL 9
File systems - Database systems - Database systems architecture - Database Languages - Data
Dictionary - Database Administration and control-Data models - Entity-Relationship model – entities,
entity types, various types of attributes, relationships, relationship types and extended E-R features,
ER diagram notation, examples.
Introduction to relational databases- Reduction of ER model to relational schema-Relational Algebra –
Relational calculus.
UNIT – II STRUCTURED QUERY LANGUAGE 9
Relational Model – The catalog- Types– Domains and key concept - Base tables - Views SQL
fundamentals -Integrity – Cursors-Triggers –Procedures and functions - Security – Missing
Information- Advanced SQL features –Embedded and Dynamic SQL-PL-SQL.
UNIT – III NORMALIZATION AND STORAGE STRUCTURES 9
Normalization and database design-Functional Dependencies – Non-loss Decomposition – Functional
Dependencies – First, Second, Third Normal Forms, Dependency Preservation – Boyce/Codd Normal
Form- Multi-valued Dependencies and Fourth Normal Form.
Overview of Physical Storage Media – Magnetic Disks – RAID – Tertiary storage – File Organization
– Organization of Records in Files - Indexing and Hashing –Ordered Indices – B+ tree Index Files – B
tree Index Files – Static Hashing – Dynamic Hashing .
UNIT – IV TRANSACTION MANAGEMENT AND QUERY PROCESSING 9
Transaction Management- Need for transactions, ACID Properties, States – Serializability and
schedules-Concurrency control and Recovery- Testing for serializability-Two-phase locking (2PL)
protocol, Conservative, strict and rigorous 2PL, 2PL with lock conversions, Timestamp-ordering based
protocol-Deadlock prevention, detection and recovery-Recovery concepts, Deferred and Immediate
update, Shadow paging.
Query processing - Catalog Information for Cost Estimation – Selection Operation – Sorting – Join
Operation – Database Tuning.
UNIT – V ADVANCED DATABASES 9
Introduction to Distributed Databases and Client/Server Databases- Centralized versus distributed
databases - Fragmentation - Distributed database architecture - Client / Server databases –Distributed
transactions - Locking and Commit protocols - Distributed concurrency Control – Security and
reliability - Parallel databases-Multimedia databases.
The World Wide Web - Object oriented database - Object Relational database - XML, XML/QL -
Data Analysis and OLAP - Data mining - Data warehousing.
TOTAL HOURS: 45
TEXT BOOKS
1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan- “Database System Concepts”, Sixth
Edition, McGraw-Hill, 2010.
2. Ramez Elmasri and Shamkant B. Navathe, “Fundamental Database Systems”, Fifth Edition,
Pearson Education, 2006.
REFERENCE BOOK
1. C.J.Date -“An Introduction to Database System”, Eight Editions, Pearson education, 2006.
11PCK203 WEB TECHNOLOGYL T P C3 0 0 3
Course objectives
To learn the basics of web such as HTML, DHTML and XML.
To understand the basic concepts of Servlets and its applications.
To develop simple applets that interacts in the web browser.
UNIT – I INTRODUCTION 9
Introduction – Network concepts – Web concepts – Internet addresses - Retrieving Data with URL –
HTML – DHTML: Cascading Style Sheets - Scripting Languages: Javascript
UNIT – II COMMON GATEWAY INTERFACE & XML 9
Common Gateway Interface: Programming CGI Scripts – HTML Forms – XML – DTD - Schema –
XSLT – XML Parser.
UNIT –III JAVA PROGRAMMING 9
Java fundamentals: Classes – Inheritance – Packages – Interfaces – Exceptions Handling – AWT.
UNIT – IV SERVER SIDE PROGRAMMING 9
Server side Programming – Active server pages – Java server pages – Java Servlets: Servlet container
– Exceptions – Sessions and Session Tracking – Using Servlet context – Dynamic Content Generation
– Servlet Chaining and Communications.
UNIT – V APPLICATIONS 9
Database connectivity – Simple applet application – Plug-ins – Firewalls – Cookies – Session
management.
TOTAL HOURS : 45
TEXT BOOKS
1. Deitel, Deitel and Neito, “INTERNET and WORLD WIDE WEB – How to program”, Pearson
education asia, 2002
2. D.Norton and H. Schildt, “Java 2: The complete Reference”, Fifth Edition, TMH.
REFERENCE BOOKS
1. Elliotte Rusty Herold , “Java Network Programming”, O’Reilly Publications, 3rd Edition, 2004.
2. Eric Ladd and Jim O’Donnell, et al, “USING HTML 4, XML, and JAVA1.2”, PHI
publications, 2003.
3. Jeffy Dwight, Michael Erwin and Robert Nikes “USING CGI”, PHI Publications, 1997
11UCK204 DESIGN AND ANALYSIS OF ALGORITHMSL T P C3 1 0 4
Course Objectives
To analyze algorithm performance using complexity measurement.
To master algorithms design techniques such as divide and conquer, greedy and dynamic
programming.
To apply above approaches to solve a variety of practical problems such as sorting and selection,
graph problems, and other optimization problems.
To understand the theory of NP-completeness.
To proof correctness of Algorithms
UNIT – I ALGORITHM ANALYSIS 12
Algorithm Analysis -Asymptotic Notations-Break even Point Calculation-Mathematical Analysis of
Non Recursive Algorithms-Compute Factorial-Matrix Multiplication. Mathematical Analysis of
Recursive Algorithms-Tower of Hanoi-Binary Number Calculation-Max and Min-Master Theorem-
Proof of correctness
UNIT – II BRUTE FORCE AND DIVIDE – CONQUER 12
Brute Force: General Method-Selection Sort- Sequential Search-Polynomial Equation Divide and
Conquer: General Method -Binary Search-Merge Sort- Closest-Pair and Convex-Hull Problems
UNIT – III GREEDY TECHNIQUE AND DYNAMIC PROGRAMMING 12
Greedy Technique: General Method- Activity Selection Problem-Knapsack Problem-Huffman tree
construction. Dynamic Programming: General Method-Optimal Binary Search Trees-Traveling
Salesperson Problem-Change Making problem
UNIT – IV BACK TRACKING AND BRANCH & BOUND 12
Backtracking: N Queens Algorithm-Knapsack Problem-Tournament Scheduling Problem
Branch and Bound: Knapsack Problem –FIFO Search – LC Search
UNIT – V NP COMPLETENESS AND APPROXIMATION ALGORITHM 12
P, NP, and NP-complete Problems-Subset Sum Problem - Approximation Algorithms: Planar Graph
Coloring- Bin Packing – Scheduling Independent Tasks
TOTAL HOURS: 60
TEXT BOOKS
1. Anany Levitin, “Introduction to Design and Analysis of Algorithms 2/e”, Pearson
Education, 2008.
2. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms/ C++,
Second Edition, Universities Press, 2007
REFERENCE BOOK
1. Thomas H.Cormen, Charles E.Leiserson, Ronald L.Rivest, Cliford Stein, “Introduction to
Algorithms”, Second Edition, Prentice Hall of India, 2007.
11PCK205 DATABASE TECHNOLOGY LABL T P C0 0 3 2
Course Objectives
To explore database programming using Structured Query Language (SQL)
To write PL / SQL queries to create and manipulate database
To understand the purpose of views and triggers
To implement the fundamentals of security and permissions in SQL server
To design ER Diagram
To design client / server applications
LIST OF EXPERIMENTS
1. Study of SQL commands
Data Definition, Table Creation, Constraints,
Insert, Select Commands, Update & Delete Commands.
Nested Queries & Join Queries
Views
2. High level programming language extensions
PL-SQL
Control structures
Procedures and Functions
Cursors and triggers
3. Implement the concept of Normalization
4. Embedded SQL
5. Database Design and implementation (Mini Project).
Implement the inventory control system with a reorder level
Develop a package for a bank to maintain its customer details
Develop a package for the payroll of a company
Implement Library Management System
11PCK206 WEB TECHNOLOGY LABL T P C0 0 3 2
Course Objectives
To implement the various web applications using HTML, DHTML, Java Script and PERL
script.
To implement Servlets using ASP and JSP.
To develop window applications and web applications using Java and applets.
LIST OF EXPERIMENTS
1. Develop web page using DHTML and cascading style sheet.
2. Develop web page using Java Script.
3. Develop an application using PERL script.
4. Develop a package using Java which implements multilevel inheritance.
5. Develop a Java application having an interface and exception handling mechanism.
6. Develop an applet application using the various AWT components.
7. Develop an application in java for getting time information from the server using TCP/UDP.
8. Develop an order processing system using JSP.
9. Develop student course management system using ASP.
10. Implement database connectivity in Java using JDBC.
11PCE201 VISUAL PROGRAMMINGL T P C3 0 0 3
Course Objectives
To introduce the concepts of windows programming
To introduce GUI programming using Microsoft Foundation Classes
To enable the students to develop programs and simple applications using Visual C++
UNIT I WINDOWS PROGRAMMING 9
Windows environment – a simple windows program – windows and messages – creating the window –
displaying the window – message loop – the window procedure – message processing – text output –
painting and repainting – introduction to GDI – device context – basic drawing – child window
controls
UNIT II VISUAL C++ PROGRAMMING – INTRODUCTION 9
Application Framework – MFC library – Visual C++ Components – Event Handling – Mapping
modes – colors – fonts – modal and modeless dialog – windows common controls – bitmaps
UNIT III THE DOCUMENT AND VIEW ARCHITECTURE 9
Menus – Keyboard accelerators – rich edit control – toolbars – status bars – reusable frame window
base class – separating document from its view – reading and writing SDI and MDI documents –
splitter window and multiple views – creating DLLs – dialog based applications
UNIT IV ACTIVEX AND OBJECT LINKING AND EMBEDDING (OLE) 9
ActiveX controls Vs. Ordinary Windows Controls – Installing ActiveX controls – Calendar Control –
ActiveX control container programming – create ActiveX control at runtime – Component Object
Model (COM) – containment and aggregation Vs. inheritance – OLE drag and drop – OLE embedded
component and containers – sample applications
UNIT V ADVANCED CONCEPTS 9
Database Management with Microsoft ODBC – Structured Query Language – MFC ODBC classes –
sample database applications – filter and sort strings – DAO concepts – displaying database records in
scrolling view – Threading – VC++ Networking issues – Winsock – WinInet – building a web client –
Internet Information Server – ISAPI server extension – chat application – playing and multimedia
(sound and video) files
TOTAL HOURS: 45
TEXT BOOKS
1. Charles Petzold, “Windows Programming”, Microsoft press, 1996 (Unit I – Chapter 1-9)
2. David J.Kruglinski, George Shepherd and Scot Wingo, “Programming Visual C++”, Microsoft
press, 1999 (Unit II – V)
REFERENCE BOOKS
1. Steve Holtzner, “Visual C++ 6 Programming”, Wiley Dreamtech India Pvt. Ltd., 2003.
11PDE201 OBJECT ORIENTED SYSTEM DESIGNL T P C3 0 0 3
Course Objectives
To understand the object oriented life cycle.
To know how to identify objects, relationships, services and attributes through UML.
To understand the use-case diagrams.
To know the Object Oriented Design process.
To know about software quality and usability.
UNIT I OBJECT ORIENTED DESIGN FUNDAMENTALS 9
The Object Model – Classes and Objects – Complexity – Classifications – Notation – Process –
Pragmatics – Object types – Object State – OOSD Life Cycle.
UNIT II OBJECT ORIENTED ANALYSIS 9
Overview of Object Analysis – Shaller /Mellor – Coad/Yourdon – Rumbaugh – Booch –Object
Analysis Classification – Noun Phrase approach – Common Class Patterns Approach – Use Case
Driven Approach – Classes – Responsibilities and Collaborators.
UNIT III OBJECT ORIENTED DESIGN METHODS 9
UML – Class Diagram – Use case Diagram – Dynamic Modeling – Extensibility –Comparison with
other Design Methods.
UNIT IV OBJECT ORIENTED DEVELOPMENT 9
OO Design Process and Axioms – Designing Classes – Access Layer – View Layer –Testing.
UNIT V CASE STUDIES IN OBJECT ORIENTED DEVELOPMENT 9
TOTAL HOURS: 45
TEXT BOOKS1. Ali Bahrami, “Object Oriented Systems Development”, McGraw Hill International Edition,2. 1999.
3. Craig Larman, “Applying UML and patterns”, Addison Wesley, 2000.
REFERENCE BOOKS1. Booch Grady, “Object Oriented Analysis and Design”, 5th Edition, Addisson Wesley, 1997.
2. Grady Booch, James Rumbaugh, Ivar Jacobson, “The Unified Modeling Language User
Guide”, Addison Wesley Longman, 1999.
3. Fowler, “Analysis Patterns”, Addison Wesley, 1996.
4. Shlaer S., Mellor S., “Object Lifecycles Modeling the World in States”, Prentice Hall, 1992.
11PCE202 MOBILE COMPUTINGL T P C3 0 0 3
Course Objectives
To learn the basics of Wireless voice and data communications technologies.
To build working knowledge on various telephone and satellite networks.
To study the working principles of wireless LAN and its standards.
To build knowledge on various Mobile Computing algorithms.
To build skills in working with Wireless application Protocols to develop mobile content
applications.
UNIT I WIRELESS COMMUNICATION FUNDAMENTALS 9Introduction – Wireless transmission – Frequencies for radio transmission – Signals – Antennas –
Signal Propagation – Multiplexing – Modulations – Spread spectrum – MAC – SDMA – FDMA–
TDMA – CDMA – Cellular Wireless Networks.
UNIT II TELECOMMUNICATION SYSTEMS 9
GSM – System Architecture – Protocols – Connection Establishment – Frequency Allocation –
Routing – Handover – Security – GPRS.
UNIT III WIRELESS NETWORKS 9
Wireless LAN – IEEE 802.11 Standards – Architecture – Services – HIPERLAN – Adhoc Network –
Blue Tooth.
UNIT IV NETWORK LAYER 9
Mobile IP – Dynamic Host Configuration Protocol – Routing – DSDV – DSR – AODV – ZRP –
ODMR.
UNIT V TRANSPORT AND APPLICATION LAYERS 9
TCP over Wireless Networks – Indirect TCP – Snooping TCP – Mobile TCP – Fast Retransmit /Fast
Recovery – Transmission/Timeout Freezing – Selective Retransmission – Transaction Oriented TCP –
WAP – WAP Architecture – WDP – WTLS – WTP – WSP – WML –WML Script– WAE – WTA.
TOTAL HOURS :45
TEXT BOOKS
1. Jochen Schiller, “Mobile Communications”, Second Edition, Pearson Education, 2003.
2. William Stallings, “Wireless Communications and Networks”, Pearson Education, 2002.
REFERENCE BOOKS
1. Kaveh Pahlavan, Prasanth Krishnamoorthy, “Principles of Wireless Networks”,
First Edition, Pearson Education, 2003.
2. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, “Principles of Mobile
Computing”, Springer, 2003.
3. C.K.Toh, “AdHoc Mobile Wireless Networks”, First Edition, Pearson Education, 2002.
11PCE203 ARTIFICIAL INTELLIGENCEL T P C3 0 0 3
Course Objectives
To provide a strong foundation of fundamental concepts in Artificial Intelligence
To provide a basic exposition to the goals and methods of Artificial Intelligence
To enable the student to apply these techniques in applications which involve perception,
reasoning and learning.
UNIT – I INTRODUCTION 9
Definition of AI-Foundations-History-Intelligent Agents-Perception and Language Processing-
Problem Solving-Searching-Heuristic Search-Game Playing.
UNIT – II LOGIC AND REASONING 9
Agents that reason logically-First order logic-Inference in first order logic-Logical reasoning
UNIT – III KNOWLEDGE REPRESENTATION 9
Semantic Nets and Description matching-Frames-Inheritance and common sense Rules-Rule
Chaining, Substrates and cognitive modeling.
UNIT – IV REASONING WITH INCOMPLETE & UNCERTAIN KNOWLEDGE 9
Uncertainty-Probabilistic Reasoning Systems-Making simple and complex decisions-Nonmonotonic
reasoning and Truth Maintenance.
UNIT – V PLANNING AND LEARNING 9
Planning-Representation for planning-Partial order planning-Conditional planning-Replanning agent-
Learning- Analysing differences-Explaining experience-Correcting mistakes-Recording cases-Version
space method- Identification trees-Neural nets and Genetic algorithms.
TOTAL HOURS: 45
TEXT BOOKS
1. Stewart Russel and Peter Norvig. " Artificial Intelligence-A Modern Approach ", Prentice Hall
International. 1995.
2. Patrick Henry Winston, " Artifical Intelligence ", Third Edition, ISE reprint,Addison Wesley,
1999.
REFERENCE BOOKS
1. Elain Rich and Kevin Knight, " Artificial Intelligence",Tata McGraw Hill, Second Edition,
1993.
2. Eugene Charniak and Drew Mc Dermott, Addison Wesley, "Introduction to Artificial
Intelligence ", ISE Reprint 1998.
3. Nils J.Nilsson, “ Artificial Intelligence - A New Synthesis ", Harcourt Asia PTE Ltd, Morgan
Kaufmann, 1988.
11PDK202 SOFTWARE PROJECT MANAGEMENTL T P C3 0 0 3
Course Objectives To introduce the students to the initiation, management, and tracking of software projects.
The course prepares students to the practical Software project management -course.
UNIT I INTRODUCTION TO SOFTWARE PROJECT MANAGEMENT 9
Project Definition – Contract Management – Activities Covered By Software Project Management –
Overview Of Project Planning – Stepwise Project Planning.
UNIT II PROJECT EVALUATION 9
Strategic Assessment – Technical Assessment – Cost Benefit Analysis –Cash Flow Forecasting – Cost
Benefit Evaluation Techniques – Risk Evaluation.
UNIT III ACTIVITY PLANNING 9
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 – Types Of Risk – Managing Risk – Hazard
Identification – Hazard Analysis – Risk Planning And Control.
UNIT IV MONITORING AND CONTROL 9
Creating Framework – Collecting The Data – Visualizing Progress – Cost Monitoring – Earned Value
– Priortizing Monitoring – Getting Project Back To Target – Change Control – Managing Contracts –
Introduction – Types Of Contract – Stages In Contract Placement – Typical Terms Of A Contract –
Contract Management – Acceptance.
UNIT V MANAGING PEOPLE AND ORGANIZING TEAMS 9
Introduction – Understanding Behavior – Organizational Behaviour: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.
TOTAL HOURS: 45 TEXT BOOKS
1. Bob Hughes, Mikecotterell, “Software Project Management”, Third Edition, Tata McGraw
Hill, 2004.
2. Ramesh, Gopalaswamy, "Managing Global Projects", Tata McGraw Hill, 2001.
REFERENCE BOOKS1. Royce, “Software Project Management”, Pearson Education, 1999.
2. Jalote, “Software Project Manangement in Practive”, Pearson Education, 2002.
11PCE204 HIGH SPEED NETWORKSL T P C3 0 0 3
Course Objectives
Students will get an introduction about ATM and Frame relay.
Students will be provided with an up-to-date survey of developments in High Speed Networks.
Enable the students to know techniques involved to support real-time traffic and congestion
control.
Students will be provided with different levels of quality of service (Q.S) to different
applications.
UNIT I HIGH SPEED NETWORKS 9
Frame Relay Networks – Asynchronous transfer mode – ATM Protocol Architecture, ATM logical
Connection, ATM Cell – ATM Service Categories – AAL.
High Speed LANs: Fast Ethernet, Gigabit Ethernet, Fiber Channel – Wireless LANs: applications,
requirements – Architecture of 802.11
UNIT II CONGESTION AND TRAFFIC MANAGEMENT 9
Queuing Analysis- Queuing Models – Single Server Queues – Effects of Congestion – Congestion
Control – Traffic Management – Congestion Control in Packet Switching Networks – Frame Relay
Congestion Control.
UNIT III TCP AND ATM CONGESTION CONTROL 9
TCP Flow control – TCP Congestion Control – Retransmission – Timer Management – Exponential
RTO backoff – KARN’s Algorithm – Window management – Performance of TCP over ATM. Traffic
and Congestion control in ATM – Requirements – Attributes – Traffic Management Frame work,
Traffic Control – ABR traffic Management – ABR rate control, RM cell formats, ABR Capacity
allocations – GFR traffic management.
UNIT IV INTEGRATED AND DIFFERENTIATED SERVICES 9
Integrated Services Architecture – Approach, Components, Services- Queuing Discipline, FQ, PS,
BRFQ, GPS, WFQ – Random Early Detection, Differentiated Services
UNIT V PROTOCOLS FOR QOS SUPPORT 9
RSVP – Goals & Characteristics, Data Flow, RSVP operations, Protocol Mechanisms – Multiprotocol
Label Switching – Operations, Label Stacking, Protocol details – RTP – Protocol Architecture, Data
Transfer Protocol, RTCP.
TOTAL HOURS : 45
TEXT BOOKS
1. William Stallings, “HIGH SPEED NETWORKS AND INTERNET”, Pearson Education,
Second Edition, 2002.
2. Warland & Pravin Varaiya, “HIGH PERFORMANCE COMMUNICATION NETWORKS”,
Jean Harcourt Asia Pvt. Ltd., II Edition, 2001.
REFERENCE BOOKS
1. Irvan Pepelnjk, Jim Guichard and Jeff Apcar, “MPLS and VPN architecture”, Cisco Press,
Volume 1 and 2, 2003
2. M.Steen Strub, Routing in Communication networks,Prentice Hall International New
York,1995
3. William Stallings,High speed Networks TCP/IP and ATM Design Principles,Prentice
Hall,New York,1998.
11PCE205 INFORMATION SECURITYL T P C3 0 0 3
Course Objectives
To understand the basics of Information Security
To know the legal, ethical and professional issues in Information Security
To know the aspects of risk management
To become aware of various standards in this area
To know the technological aspects of Information Security
UNIT –I SECURITY POLICIES 9
An Overview of Computer Security, Access Control Matrix, Policy-Security policies,
Confidentiality policies, Integrity policies and Hybrid policies.
UNIT- II KEY MANAGEMENT 9
Cryptography- Key management – Session and Interchange keys, Key exchange and generation,
Cryptographic Key Infrastructure, Storing and Revoking Keys, Digital Signatures, Cipher Techniques
UNIT -III INFORMATION SECURITY 9
Systems: Design Principles, Representing Identity, Access Control Mechanisms, Information Flow
and Confinement Problem.
UNIT- IV INTRUSION DETECTION 9
Malicious Logic, Vulnerability Analysis, Auditing and Intrusion Detection
UNIT -V LEVELS OF SECURITY 9
Network Security, System Security, User Security and Program Security
TOTAL HOURS: 45
TEXT BOOKS
1. Matt Bishop ,“Computer Security art and science ”, Second Edition, Pearson Education.2. Mark Merkow, James Breithaupt “ Information Security : Principles and Practices” First
Edition, Pearson Education.REFERENCE BOOKS
1. Whitman, “Principles of Information Security”, Second Edition, Pearson Education2. William Stallings, “Cryptography and Network Security: Principles and Practices”,Third
Edition, Pearson Education.3. “Security in Computing ”, Charles P.Pfleeger and Shari Lawrence Pfleeger, Third Edition.
11PCE206 NATURAL LANGUAGE PROCESSING L T P C
3 0 0 3
Course Objectives
To provide a general introduction including the use of state automata for language processing
To provide the fundamentals of syntax including a basic parse
To explain advanced feature like feature structures and realistic parsing methodologies
To explain basic concepts of remotes processing
To give details about a typical natural language processing applications
UNIT I INTRODUCTION 9
Introduction: Knowledge in speech and language processing – Ambiguity – Models and Algorithms –
Language, Thought and Understanding. Regular Expressions and automata: Regular expressions –
Finite-State automata. Morphology and Finite-State Transducers: Survey of English morphology –
Finite-State Morphological parsing – Combining FST lexicon and rules – Lexicon-Free FSTs: The
porter stammer – Human morphological processing
UNIT II SYNTAX 9
Word classes and part-of-speech tagging: English word classes – Tagsets for English – Part-of-speech
tagging – Rule-based part-of-speech tagging – Stochastic part-of-speech tagging – Transformation-
based tagging – Other issues. Context-Free Grammars for English: Constituency – Context-Free rules
and trees – Sentence-level constructions – The noun phrase – Coordination – Agreement – The verb
phase and sub categorization – Auxiliaries – Spoken language syntax – Grammars equivalence and
normal form – Finite-State and Context-Free grammars – Grammars and human processing. Parsing
with Context-Free Grammars: Parsing as search – A Basic Top-Down parser – Problems with the
basic Top-Down parser – The early algorithm – Finite-State parsing methods.
UNIT III ADVANCED FEATURES AND SYNTAX 9
Features and Unification: Feature structures – Unification of feature structures – Features structures in
the grammar – Implementing unification – Parsing with unification constraints – Types and
Inheritance. Lexicalized and Probabilistic Parsing: Probabilistic context-free grammar – problems with
PCFGs – Probabilistic lexicalized CFGs – Dependency Grammars – Human parsing.
UNIT IV SEMANTIC 9
Representing Meaning: Computational desiderata for representations – Meaning structure of language
– First order predicate calculus – Some linguistically relevant concepts – Related representational
approaches – Alternative approaches to meaning. Semantic Analysis: Syntax-Driven semantic analysis
– Attachments for a fragment of English – Integrating semantic analysis into the early parser – Idioms
and compositionality – Robust semantic analysis. Lexical semantics: relational among lexemes and
their senses – WordNet: A database of lexical relations – The Internal structure of words – Creativity
and the lexicon.
UNIT V APPLICATIONS 9
Word Sense Disambiguation and Information Retrieval: Selectional restriction-based disambiguation –
Robust word sense disambiguation – Information retrieval – other information retrieval tasks. Natural
Language Generation: Introduction to language generation – Architecture for generation – Surface
realization – Discourse planning – Other issues. Machine Translation: Language similarities and
differences – The transfer metaphor – The interlingua idea: Using meaning – Direct translation –
Using statistical techniques – Usability and system development.
TOTAL HOURS: 45
TEXT BOOKS
1. Daniel Jurafsky & James H.Martin, “ Speech and Language Processing”, Pearson Education
(Singapore) Pte. Ltd., 2002.
2. James Allen, “Natural Language Understanding”, Pearson Education, 2003.
REFERENCE BOOKS
1. Lucja M Iwanska, “Natural Language Processing And Knowledge Representation : Language
For Knowledge And Knowledge For Language”, University Press, 2008
2. Gerald Gazdar; Chris Mellish ,” Natural language processing in POP 11 : an introduction to
computational linguistics” Addision-Wesley 1990
11PCE207 SOFTWARE AGENTSL T P C3 0 0 3
Course Objectives
To have a basic understanding of software agents technology: agents, applications,
architectures, communications
To use Java and Java agent platforms to construct single agent and multi-agent systems
UNIT- I AGENTS – OVERVIEW 9
Agent Definition – Agent Programming Paradigms – Agent Vs Object – Aglet – Mobile Agents –
Agent Frameworks – Agent Reasoning.
UNIT- II JAVA AGENTS 9
Processes – Threads – Daemons – Components – Java Beans – ActiveX – Sockets –RPCs –
Distributed Computing – Aglets Programming – Jini Architecture – Actors and Agents – Typed and
proactive messages.
UNIT- III MULTIAGENT SYSTEMS 9
Interaction between agents – Reactive Agents – Cognitive Agents – Interaction protocols– Agent
coordination – Agent negotiation – Agent Cooperation – Agent Organization –Self-Interested agents
in Electronic Commerce Applications.
UNIT –IV INTELLIGENT SOFTWARE AGENTS 9
Interface Agents – Agent Communication Languages – Agent Knowledge Representation – Agent
Adaptability – Belief Desire Intension – Mobile Agent Applications.
UNIT -V AGENTS AND SECURITY 9
Agent Security Issues – Mobile Agents Security – Protecting Agents against Malicious Hosts –
Untrusted Agent – Black Box Security – Authentication for agents – Security issues for Aglets.
TOTAL HOURS:45
TEXT BOOKS
1. Bigus & Bigus, " Constructing Intelligent agents with Java ", Wiley, 1997.
2. Bradshaw, " Software Agents ", MIT Press, 2000.
REFERENCE BOOKS
1. Russel, Norvig, "Artificial Intelligence: A Modern Approach", Second Edition,
Pearson Education, 2003.
2. Richard Murch, Tony Johnson, "Intelligent Software Agents", Prentice Hall, 2000.
3. Gerhard Weiss, “Multi Agent Systems – A Modern Approach to Distributed
Artificial Intelligence”, MIT Press, 2000.
11PCE208 DISTRIBUTED COMPUTINGL T P C3 0 0 3
Course Objectives
To understand the genecise of grid computing
To knoew the application of grid computing
To understanding the technology and tool kits to facilitated the grid computing
UNIT-I THE HARDWARE INFRASTRUCTURE 9
Broad Band Transmission Facilities - Open Interconnection Standards - Local Area Networks - Wide
Area Networks - Network Management - Network Security - Cluster Computers.
UNIT-II SOFTWARE ARCHITECTURES 9
Client - Server Architectures - Challenges - Design Methodology - Intranets and Groupware -
Hardware and Software for Intranet - Groupware and Features - Network as a Computer - The Internet
- IP Addressing -Internet Security - Open Systems - Concepts and Reality.
UNIT-III OPERATING SYSTEM ISSUES 9
Distributed Operating Systems - Transparency - Inter-Process Communication - Client - Server Model
– Remote Procedure Call - Group Communications - Threads - System Models - Process
Synchronisation - Deadlocks -Solutions - Load Balancing - Distributed File Systems -Distributed
Shared Memory Systems - Micro-Kernels.
UNIT-IV FUNDAMENTAL DISTRIBUTED COMPUTING ASPECTS 9
Theoretical Foundations - Logical Clocks - Vector Clocks - Global State - Termination - Correctness –
Election Algorithms - Termination Detection - Fault Tolerance - Missing Token - Consensus
Algorithms - Byzantine -Consensus - Interactive Consistency.
UNIT-V MANAGING DISTRIBUTED DATA 9
Distributed Databases - Distribution Transparency - Distributed Database Design - Query Translation
– Query Optimisation - Concurrency Control - Object-Oriented Databases - Strategic Considerations -
Applications of Object-oriented Databases.
TOTAL HOURS:45
TEXT BOOKS
1. Sape Mullender, Distributed Systems, Addison-Wesley, 1993.
2. Albert Fleishman, Distributed Systems - Software Design & Implementation, Springer-Verlag,
1994.
REFERENCE BOOKS
1. Mukesh Singal and Shivaratu N.G., Advanced Concepts in Operating Systems, McGraw Hill,
Newyork, 1994.
2. George Coulouris and Jean Dollimore, Distributed Systems - Concepts and Design, Addison-
Wesley, 1988.
3. Gerard Tel, Introduction to Distributed Algorithms, Cambridge University Press, 1994.
11PCK209 OPEN SOURCE SYSTEMSL T P C3 0 0 3
Course Objectives
To gain in-depth knowledge of Linux operating system
To learn open source tools for working with web server and databases
To learn to use open source languages
To understand the use of open source tools in multimedia applications
UNIT – I INTRODUCTION 9
Introduction to Open source software – Need for Open Sources Software – Advantages of Open
Source Software– Application of Open Source Software- Linux: Introduction – General Overview –
Kernel Mode and user mode – Process– Advanced Concepts – Scheduling – Personalities – Cloning –
Signals –Development with various distributions of Linux-Working with shell.
UNIT – II WORKING WITH SERVER 9
Web Server: Apache Web server – Working with Web Server – Configuring and Using Apache-
Protect the computer with a firewall: PktFilter- Setting up a firewall - Using netfilter and ip tables-
Setting up email servers- Setting up file services- Setting up proxy services-using Squid.
UNIT – III WORKING WITH DATABASES 9
Working with open source Data bases: MySql, PostgreSQL, MaxDB and InterBase.
UNIT – IV LANGUAGES 9
PHP-Introduction- OOP-PHP Connectivity with open source Database-Create server side
programming application; Python-Introduction-Data Structure-OOP-Python Connectivity with open
source Database; Perl- Introduction- OOP-Perl Connectivity with open source Database-Create CGI
Scripts.
UNIT – V TOOLS 9
Record save/ audio/video from screen using: Cam Studio; Create schematic drawings using: XCircuit;
protect the computer against viruses using: ClamWin; Create/edit 3d graphics using: Nebula; Edit an
image using: GIMP; Download an entire website using: webfetch
TOTAL HOURS: 45
TEXT BOOKS
1. Remy Card, Eric Dumas and Frank Mevel, “The Linux Kernel Book”, Wiley Publications,
2003
2. Steve Suchring, “MySQL Bible”, John Wiley, 2002
REFERENCE BOOKS
1. Rasmus Lerdorf and Levin Tatroe, “Programming PHP”, O’Reilly, 2002
2. Wesley J. Chun, “Core Phython Programming”, Prentice Hall, 2001
3. Martin C. Brown, “Perl: The Complete Reference”, 2nd Edition, Tata McGraw-Hill Publishing
Company Limited, Indian Reprint 2009.
4. Steven Holzner, “PHP: The Complete Reference”, 2nd Edition, Tata McGraw-Hill Publishing
Company Limited, Indian Reprint 2009.
5. Vikram Vaswani, “MYSQL: The Complete Reference”, 2nd Edition, Tata McGraw- Hill Publishing Company Limited, Indian Reprint 2009.
ON-LINE MATERIAL
1. http://www.postgresql.org/
2. http://info.borland.com/devsupport/interbase/opensource/
3. http://www.sdn.sap.com/irj/sdn/maxdb
4. http://www.mysql.com/
5. http://www.clamwin.com/
6. http://opencircuitdesign.com/xcircuit/welcome.html
7. http://www.gimp.org/
8. http://tony.aiu.to/sa/webfetch/
11PDE301 SOFTWARE QUALITY ASSURANCEL T P C3 0 0 3
Course Objectives
To introduces concepts, metrics, and models in software quality assurance.
To cover components of software quality assurance systems
To introduce framework for software quality assurance
To know individual components in the framework such as planning, reviews, testing,
configuration management,
To discusses metrics, models and standards for software quality
UNIT I INTRODUCTION 9
Introduction to software quality - challenges – objectives – quality factors – components of SQA
– contract review – development and quality plans – SQA components in project life cycle – SQA
defect removal policies – Reviews
UNIT II SOFTWARE ASSESMENTS 9
Basics of software testing – test generation from requirements – finite state models – combinatorial
designs - test selection, minimization and prioritization for regression testing – test
adequacy, assessment and enhancement
UNIT III TESTING STRATEGIES 9
Testing strategies – white box and black box approach – integration testing – system and acceptance
testing – performance testing – regression testing - internationalization testing – adhoc testing –
website testing – usability testing – accessibility testing Test plan – management – execution and
reporting – software test automation – automated testing tools
UNIT IV SOFTWARE QUALITY MODEL 9
Hierarchical models of software quality – software quality metrics –function points -Software
product quality – software maintenance quality – effect of case tools – software quality infrastructure –
procedures – certifications – configuration management – documentation control.
UNIT V SOFTWARE SYSTEM STANDARDS 9
Project progress control – costs – quality management standards – project process standards –
management and its role in SQA – SQA unit
TOTAL HOURS: 45
TEXT BOOKS1. Daniel Galin, Software quality assurance – from theory to implementation , Pearson
education, 2009.
2. Aditya Mathur, Foundations of software testing, Pearson Education, 2008
REFERENCE BOOKS1. Srinivasan Desikan and Gopalaswamy Ramesh, Software testing – principles and practices ,
Pearson education, 2006
2. Ron Patton, Software testing , second edition, Pearson education, 2007
11PCE301 GRID COMPUTINGL T P C3 0 0 3
Course Objectives
To understand the genecise of grid computing
To knoew the application of grid computing
To understanding the technology and tool kits to facilitated the grid computing
UNIT I INTRODUCTION TO GRID COMPUTING 9
Introduction – The Grid – Past, Present and Future – Applications of grid computing
organizations and their roles.
UNIT II GRID COMPUTING ARCHITURE 9
Grid Computing anatomy – Next generation of Grid computing initiatives–Merging the Grid
services architecture with Web services architecture.
UNIT III GRID COMPUTING TECHNOLOGIES 9
OGSA – Sample use cases that drive the OGSA platform components – OGSI and WSRF–
OGSA Basic Services – Security standards for grid computing.
UNIT IV GRID COMPUTING TOOL KIT 9
Globus Toolkit –Versions – Architecture –GT Programming model –A sample grid service
implementation.
UNIT V HIGH LEVEL GRID SERVICES 9
High level grid services – OGSI .NET middleware Solution Mobile OGSI.NET for Grid computing on
Mobile devices.
TOTAL HOURS: 45
TEXT BOOKS
1. Joshy Joseph & Craig Fellenstein, “Grid Computing”, Pearson/PHI PTR-2003.
2. Fran Berman, Geoffrey Fox, Anthony J.G. Hey, “Grid Computing: Making the Global
Infrastructure a reality “, John Wiley and sons,2003.
REFERENCE BOOKS
1. Ahmar Abbas, “Grid Computing: A Practical Guide to Technology and Applications”,
Charles River media, 2003.
11PCE302 DATA MINING AND WAREHOUSINGL T P C3 0 0 3
Course Objectives
To understand database mining systems and data warehousing
To learn various data models, query tools
To understand various data mining techniques and objects
UNIT I DATA WAREHOUSING CONCEPTS 9
Data Warehousing and Business Analysis: - Data warehousing Components –Building a Data
warehouse – Mapping the Data Warehouse to a Multiprocessor Architecture – DBMS Schemas for
Decision Support – Data Extraction, Cleanup, and Transformation Tools –Metadata – reporting –
Query tools and Applications – Online Analytical Processing (OLAP) – OLAP and Multidimensional
Data Analysis.
UNIT II INTRODUCTION TO DATA MINING 9
Data Mining: - Data Mining Functionalities – Data Preprocessing – Data Cleaning – Data Integration
and Transformation – Data Reduction – Data Discretization and Concept Hierarchy Generation.
Association Rule Mining: - Efficient and Scalable Frequent Item set Mining Methods – Mining
Various Kinds of Association Rules – Association Mining to Correlation Analysis – Constraint- Based
Association Mining.
UNIT III CLASSIFICATION ALGORITHMS 9
Classification and Prediction: - Issues Regarding Classification and Prediction – Classification by
Decision Tree Introduction – Bayesian Classification – Rule Based Classification – Classification by
Back propagation – Support Vector Machines – Associative Classification – Lazy Learners – Other
Classification Methods – Prediction – Accuracy and Error Measures – Evaluating the Accuracy of a
Classifier or Predictor – Ensemble Methods – Model Section.
UNIT IV CLUSTERING TECHNIQUES 9
Cluster Analysis: - Types of Data in Cluster Analysis – A Categorization of Major Clustering Methods
– Partitioning Methods – Hierarchical methods – Density-Based Methods – Grid-Based Methods –
Model-Based Clustering Methods – Clustering High-Dimensional Data – Constraint- Based Cluster
Analysis – Outlier Analysis.
UNIT V CURRENT TRENDS 9
Mining Object, Spatial, Multimedia, Text and Web Data: Multidimensional Analysis and Descriptive
Mining of Complex Data Objects – Spatial Data Mining – Multimedia Data Mining – Text Mining –
Mining the World Wide Web.
TOTAL HOURS: 45
TEXT BOOKS1. Jiawei Han and Micheline Kamber “Data Mining Concepts and Techniques” Second Edition,
Elsevier, Reprinted 2008.
2. Alex Berson and Stephen J. Smith “Data Warehousing, Data Mining & OLAP”, Tata
McGraw – Hill Edition, Tenth Reprint 2007.
REFERENCE BOOKS1. K.P. Soman, Shyam Diwakar and V. Ajay “Insight into Data mining Theory and Practice”,
Easter Economy Edition, Prentice Hall of India, 2006.
2. G. K. Gupta “Introduction to Data Mining with Case Studies”, Easter Economy Edition,
Prentice Hall of India, 2006.
3. Pang-Ning Tan, Michael Steinbach and Vipin Kumar “Introduction to Data Mining”, Pearson
Education, 2007.
11PCE303 WIRELESS SENSOR NETWORKSL T P C3 0 0 3
Course Objectives
To learn the basics of sensor networks
To understand the wireless sensor networks Platforms and Standards.
To learn the establishment of wireless sensor networks
UNIT I INTRODUCTION 9
Over view of sensor networks- Constraints and challenges – Advantages of sensor networks-
Applications- Collaborative processing – Key definitions in sensor networks – Tracking scenario –
Problem formulation – Distributed representation and interference of states – Tracking multiple
objects – sensor models- Performance comparison and metrics.
UNIT II NETWORKING SENSORS 9
Key assumption - Medium access control – S-MAC protocol – IEEE 802.15.4 standard and
ZigBee - General Issues - Geographic, Energy – Aware Routing - Attribute based routing.
UNIT III INFRASTRUCTURE ESTABLISHMENT 9
Topology control – Clustering -Time Synchronization – Localization – Task driven sensing – Role of
sensor nodes – Information based tasking - Routing and aggregation.
UNIT IV SENSOR NETWORK DATABASE 9
Sensor Database Challenges – Querying the physical environment – Interfaces – In-network
aggregation – Data centric storage – Data indices and range queries – Distributed Hierarchical
aggregation – Temporal data.
UNIT V SENSOR NETWOR PLATFORMS AND TOOLS 9
Sensor Node Hardware – Sensor network programming challenges – Node level software
platforms – Operating system TinyOS – Node level simulators – State centric programming –
Applications and future directions.
TOTAL HOURS: 45
TEXT BOOKS1. Feng Zhao, Leonidas Guibas, “Wireless sensor networks an information processing approach”,
Mogan kanufmann publishers, 2004
2. Edgar Hcallaway,Jr “Wireless sensor networks:Architectures and protocols” Auerbach
Publications
REFERENCE BOOKS1. Robert Faludi ,”Building Wireless Sensor Networks”, O'Reilly Media
2. Waltenegus Dargie, Christian Poellabauer, “Fundamentals of Wireless Sensor Networks:
Theory and Practice”, Wiley | 2010
3. Anna Hac, "Wireless Sensor Network Designs," John Wiley & Sons, December 2003
11PCE304 MULTIMEDIA SYSTEMSL T P C3 0 0 3
Course Objectives
To understand the core multimedia technologies, underlying infrastructure, multimedia standards
To analyze the issues in effectively representing, processing, and retrieving multimedia data such
as sound, music, graphics, image and video.
UNIT I INTRODUCTION AND QOS 9
Introduction-QOS Requirements and Constraints-Concepts-Resources- Establishment Phase-Run-
Time Phase-Management Architectures.
UNIT II OPERATING SYSTEMS 9
Real-Time Processing-Scheduling-Interprocess Communication-Memory and Management-Server
Architecture-Disk Management.
UNIT III FILE SYSTEMS AND NETWORKS 9
Traditional and Multimedia File Systems-Caching Policy-Batching-Piggy backing-Ethernet-Gigabit
Ethernet-Token Ring-100VG Any LAN-Fiber Distributed Data Interface (FDDI)- ATM Networks-
MAN-WAN.
UNIT IV COMMUNICATION 9
Transport Subsystem-Protocol Support for QOS-Transport of Multimedia-Computer Supported
Cooperative Work-Architecture-Session Management-MBone Applications.
UNIT V SYNCHRONIZATION 9
Synchronization in Multimedia Systems-Presentation-Synchronization Types-Multimedia
Synchronization Methods-Case Studies-MHEG-MODE-ACME.
TOTAL HOURS: 45
TEXT BOOKS
1. Ralf Steinmetz and Klara Nahrstedt, “Multimedia Systems”, Springer, I Edition 2004.
2. Ralf Steinmetz and Klara Nahrstedt , Media Coding and Content Processing, Prentice hall,
2002.
REFERENCE BOOKS
1. Vaughan T, Multimedia, Tata McGraw Hill, 1999.
2. Mark J.B., Sandra K.M., Multimedia Applications Development using DVI
technology,McGraw Hill, 1992.
3. K. R. Rao, Zoran S. Bojkovic, Dragorad A. Milovacovic, D. A. Milovacovic ,
MultimediaCommunication Systems: Techniques, Standards, and Networks, Prentice Hall,
1stEdition, 2002
11PDE303 DESIGN PATTERNSL T P C3 0 0 3
Course Objectives To define design patterns.
To study the different types of design patterns.
To utilize patterns in programming projects.
To make code more readable to other programmers
UNIT I INTRODUCTION 9
History and Origin Of Patterns – Applying Design Patterns – Prototyping –Testing.
UNIT II DESIGN PATTERNS 9
Kinds of Pattern – Quality and Elements – Patterns and Rules – Creativity and Patterns– Creational
Patterns – Structural Patterns – Behavioral Patterns, Factory Patterns.
UNIT III FRAMEWORKS 9
State and Strategy of Patterns. Singleton, Composite, Functions and The Command Patterns, Adaptor,
Proxy Pattern, Decorator Pattern – PatternFrameworks and Algorithms.
UNIT IV CATALOGS 9
Pattern Catalogs and Writing Patterns, Patterns and Case Study.
UNIT V ADVANCED PATTERNS 9
Anti-Patterns - Case Studies In UML and CORBA, Pattern Community.
TOTAL HOURS: 45
TEXT BOOKS
1. Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides,“Design patterns: Elements of
Reusable object-oriented software”,Addison-Wesley, 1995.
2. James W- Cooper, Addison-Wesley,”Java Design Patterns – A Tutorial”, 2000.
REFERENCE BOOKS
1. Craig Larman,"Applying UML and Patterns: An Introduction to object-oriented Analysis and
Design and the unified process”, Second Edition, Prentice Hall,2001.
2. Thomas Mowbray and Raphel Malveaux, " CORBA and Design Patterns ", John Wiley, 1997.
3. William J Brown et al., "Anti-Patterns: Refactoring Software, Architectures and Projects in
Crisis", John Wiley, 1998.
11PCE305 SERVICE ORIENTED ARCHITECTUREL T P C3 0 0 3
Course Objectives
To learn about the emerging science and technology of Service Oriented Architecture.
Aspects of computer science, business and engineering will be explored
UNIT I INTRODUCTION 9
Roots of SOA – Characteristics of SOA - Comparing SOA to client-server and distributed internet
architectures – Anatomy of SOA- How components in an SOA interrelate -
Principles of service orientation
UNIT II WEB SERVICES AND SOA 9
Web services – Service descriptions – Messaging with SOAP –Message exchange Patterns –
coordination –Atomic Transactions – Business activities – Orchestration – Choreography - Service
layer abstraction – Application Service Layer – Business Service Layer – Orchestration Service Layer
UNIT III SERVICE ORIENTED ANALYSIS 9
Service oriented analysis – Business-centric SOA – Deriving business services- service modeling -
Service Oriented Design – WSDL basics – SOAP basics – SOA composition guidelines – Entity-
centric business service design – Application service design – Taskcentric business service design
UNIT IV INTRODUCTION TO SERVICE ORIENTED DESIGN 9
SOA platform basics – SOA support in J2EE – Java API for XML-based web services (JAX-WS) -
Java architecture for XML binding (JAXB) – Java API for XML Registries (JAXR) - Java API for
XML based RPC (JAX-RPC)- Web Services Interoperability Technologies (WSIT) - SOA support
in .NET – Common Language Runtime - ASP.NET web forms – ASP.NET web services – Web
Services Enhancements (WSE)
UNIT V SERVICE ORIENTED DESIGN 9
WS-BPEL basics – WS-Coordination overview - WS-Choreography, WS-Policy, WS Security
TOTAL HOURS: 45
TEXT BOOKS
1. Thomas Erl, “Service-Oriented Architecture: Concepts, Technology, and Design”, Pearson
Education, 2005.
2. Thomas Erl, “SOA Principles of Service Design “(The Prentice Hall Service-Oriented
Computing Series from Thomas Erl), 2005.
REFERENCE BOOKS
1. Newcomer, Lomow, “Understanding SOA with Web Services”, Pearson Education, 2005.
2. Sandeep Chatterjee, James Webber, “Developing Enterprise Web Services, An Architect’s
Guide”, Pearson Education, 2005.
3. Dan Woods and Thomas Mattern, “Enterprise SOA Designing IT for Business Innovation”
O’REILLY, First Edition, 2006
11PDE304 SOFTWARE METRICSL T P C3 0 0 3
Course Objectives
To identify internal and external customers who need software metrics information
To select software metrics based on goals
To design and tailor the selected metrics to match your information needs
To determine what data to collect and who should collect it
To minimize the impact of human factors on the selected metrics
To interpret and communicate metric results
UNIT I MEASUREMENTS THEORY 9
Fundamentals of measurement - Measurements in Software Engineering – Scope of Software metrics -
measurements theory - Goal based framework – Software Measurement validation.
UNIT II DATA COLLECTION AND ANALYSIS 9
Empirical investigation - Planning experiments - Software metrics data Collection - Analysis methods
– statistical methods.
UNIT III PRODUCTS METRICS 9
Measurement of internet product attributes - size and structure - External productattributes -
measurement of quality.
UNIT IV QUALITY METRICS 9
Software quality metrics - Product quality - Process quality - metrics for softwaremaintenance - Case
studies of Metrics program - Motorola - HP and IBM.
UNIT V MANAGEMENT METRICS 9
Quality management models - Rayleigh Model - Problem Tracking report (PTR)model - Reliability
growth model - model evaluation - Orthogonal classification.
TOTAL HOURS: 45
TEXT BOOKS
1. Norman E - Fentar and Share Lawrence Pflieger, "Software metrics", International
ThomsonComputer Press, 1997.
2. Stephen H.Kin, "Metric and models in software quality engineering ", Addison Wesley 1995.
REFERENCE BOOKS
1. William A. Florac and Areitor D. Carletow, " Measuring Software Process ", Addison -
Wesley, 1995.
2. Stephen H. Kan, “Metrics and Models in Software Quality Engineering”,, Addison-Wesley
Professional (2002).
3. John C. Munson, “Software Engineering Measurement”, Auerbach Publications, 2003
11PCE306 COMPONENT BASED TECHNOLOGYL T P C3 0 0 3
Course Objectives
To provide the idea of breaking large, complex software applications into a series of pre-built
and easily developed, understood and changeable software module,
To facilitate the students to develop reusable software components.
To get familiar with the major object models RMI, CORBA, DCOM and EJB.
UNIT I INTRODUCTION 9
Software Components – objects – fundamental properties of Component technology – modules–
interfaces – callbacks – directory services – component architecture – components and middleware.
UNIT II JAVA COMPONENT TECHNOLOGIES 9
Threads – Java Beans – Events and connections – properties – introspection – JAR files – reflection –
object serialization – Enterprise Java Beans – Distributed Object models – RMI and RMI-IIOP.
UNIT III CORBA TECHNOLOGIES 9
Java and CORBA – Interface Definition language – Object Request Broker – system object model –
portable object adapter – CORBA services – CORBA component model – containers –application
server – model driven architecture.
UNIT IV COM AND .NET TECHNOLOGIES 9
COM – Distributed COM – object reuse – interfaces and versioning – dispatch interfaces –connectable
objects – OLE containers and servers – Active X controls – .NET components -assemblies –
appdomains – contexts – reflection – remoting.
UNIT V COMPONENT FRAMEWORKS AND DEVELOPMENT 9
Connectors – contexts – EJB containers – CLR contexts and channels – Black Box component
framework – directory objects – cross-development environment – component-oriented programming
– Component design and implementation tools – testing tools - assembly tools.
TOTAL HOURS: 45
TEXT BOOKS
1. Clemens Szyperski, “Component Software: Beyond Object-Oriented Programming”, Pearson
Education publishers, 2003.
2. Ed Roman, “Enterprise Java Beans”, Third Edition , Wiley , 2004.
REFERENCE BOOKS
1. Andreas Vogel, Keith Duddy, “Java Programming with CORBA”, John Wiley & Sons 1998.
2. Corry, Mayfield, Cadman, “COM/DCOM Primer Plus”, 1st Edition, Tec media, 1999.
3. Mowbray, “Inside CORBA”, Pearson Education, 2003.
11PCE307 UNIX NETWORK PROGRAMMINGL T P C3 0 0 3
Course Objectives
To know of concepts related to networking in UNIX environment.
To understand the file architecture in UNIX environment
To understand the process concept in UNIX
UNIT I INTRODUCTION & FILE SYSTEM 9
Overview of UNIX OS - File I/O – File Descriptors – File sharing - Files and directories – File types -
File access permissions – File systems – Symbolic links - Standard I/O library – Streams and file
objects – Buffering - System data files and information - Password file – Group file – Login
accounting – system identification.
UNIT II PROCESSES 9
Environment of a UNIX process – Process termination – command line arguments - Process control –
Process identifiers - Process relationships terminal logins – Signals -threads.
UNIT III INTERPROCESS COMMUNICATION 9
Introduction - Message passing (SVR4)- pipes – FIFO – message queues - Synchronization (SVR4) –
Mutexes – condition variables – read – write locks – file locking – record locking – semaphores –
Shared memory(SVR4).
UNIT IV SOCKETS 9
Introduction – transport layer – socket introduction - TCP sockets – UDP sockets - raw sockets –
Socket options - I/O multiplexing - Name and address conversions.
UNIT V APPLICATIONS 9
Debugging techniques - TCP echo client server - UDP echo client server - Ping - Trace route - Client
server applications like file transfer and chat.
TOTAL HOURS: 45
TEXT BOOKS
1. W.Richard Stevens, Advanced programming in the UNIX environment, Addison Wesley,
1999.(Unit 1,2 & 3)
2. W. Stevens, Bill Fenner, Andrew Rudoff, "Unix Network Programming", Volume 1,The
Sockets Networking API,3rd Edition, Pearson education, Nov 2003.(unit 4 & 5)
REFERENCE BOOKS
1. Meeta Gandhi,Tilak Shetty and Rajiv Shah – The ‘C’ Odyssey Unix –The open Boundless C
1st Edition ,BPB Publications 1992.
11PCE308 CLIENT SERVER COMPUTINGL T P C3 0 0 3
Course Objectives
To provide a generalized definition of client-server computing, one not limited to simple
distributed database systems.
To learn the advantages of client-server systems over monolithic systems.
To provide definitions and explanations for a large number of technical terms and
acronyms related to client-server computing.
To apply the techniques and features of a client/server development language to construct
a moderately complex client/server application.
UNIT I CLIENT/SERVER COMPUTING 9
DBMS concept and architecture, Single system image, Client Server architecture, mainframe-centric
client server computing, downsizing and client server computing, preserving mainframe applications
investment through porting, client server development tools, advantages of client server computing.
UNIT II COMPONENTS OF CLIENT/SERVER APPLICATION 9
The client: services, request for services, RPC, windows services, fax, print services, remote boot
services, other remote services, Utility Services & Other Services, Dynamic Data Exchange (DDE),
Object Linking and Embedding (OLE), Common Object Request Broker Architecture (CORBA). The
server: Detailed server functionality, the network operating system, available platforms, the network
operating system, available platform, the server operating system.
UNIT III CLIENT/SERVER NETWORK 9
connectivity, communication interface technology, Interposes communication, wide area network
technologies, network topologies (Token Ring, Ethernet, FDDI, CDDI) network management, Client-
server system development: Software, Client–Server System Hardware: Network Acquisition, PC-
level processing unit, Macintosh, notebooks, pen, UNIX workstation, x-terminals, server hardware.
UNIT IV DATA STORAGE 9
magnetic disk, magnetic tape, CD-ROM, WORM, Optical disk, mirrored disk, fault tolerance, RAID,
RAID-Disk network interface cards.
Network protection devices, Power Protection Devices, UPS, Surge protectors.
Client Server Systems Development: Services and Support, system administration, Availability,
Reliability, Serviceability, Software Distribution, Performance, Network management, Help Disk,
Remote Systems Management Security, LAN and Network Management issues.
UNIT V CLIENT/SERVER SYSTEM DEVELOPMENT 9
Training, Training advantages of GUI Application, System Administrator training, Database
Administrator training, End-user training. The future of client server Computing Enabling
Technologies, The transformational system.
TOTAL HOURS: 45
TEXT BOOKS
1. Patrick Smith & Steave Guengerich, "Client / Server Computing", PHI
2. Dawna Travis Dewire, "Client/Server Computing", TMH
REFERENCE BOOKS
1. Majumdar & Bhattacharya, "Database management System", TMH
2. Korth, Silberchatz, Sudarshan, "Database Concepts", McGraw Hill
3. Elmasri, Navathe, S.B, "Fundamentals of Data Base System", Addison Wesley
11PCE309 RESEARCH METHODOLOGIESL T P C3 0 0 3
Course Objectives
At the end of this course, the students should be able to:
understand some basic concepts of research and its methodologies
identify appropriate research topics
select and define appropriate research problem and parameters
prepare a project proposal (to undertake a project)
organize and conduct research (advanced project) in a more appropriate manner
write a research report and thesis
write a research proposal (grants)
UNIT I INTRODUCTION AND DATA COLLECTION 9
Research methodology – definition, mathematical tools for analysis, Types of research, exploratory
research, conclusive research, modeling research, algorithmic research, Research process- steps. Data
collection methods- Primary data – observation method, personal interview, telephonic interview, mail
survey, questionnaire design. Secondary data- internal sources of data, external sources of data.
UNIT II SCALES AND PROBABILITY DISTRIBUTION 9
Scales – measurement, Types of scale – Thurstone’s Case V scale model, Osgood’s Semantic
Differential scale, Likert scale, Q- sort scale. Sampling methods- Probability sampling methods –
simple random sampling with replacement, simple random sampling without replacement, stratified
sampling, cluster sampling. Non-probability sampling method – convenience sampling, judgment
sampling, quota sampling.
UNIT III TEST OF HYPOTHESES 9
Hypotheses testing – Testing of hypotheses concerning means (one mean and difference between two
means -one tailed and two tailed tests), Concerning variance –
one tailed Chi-square test.
UNIT IV NONPARAMETRIC TESTS 9
Nonparametric tests- One sample tests – one sample sign test, Kolmogorov- Smirnov test, run test for
randomness, Two sample tests – Two sample sign test, Mann- Whitney U test, K-sample test –
Kruskal Wallis test (H-Test)
UNIT V ADVANCED MULTIVARIANT ANALYSIS 9
Introduction to Disciminant analysis, Factor analysis, cluster analysis, multidimensional scaling,
conjoint analysis. Report writing- Types of report, guidelines to review report, typing instructions, oral
presentation
TEXT BOOKS1. Kothari, C.R., Research Methodology –Methods and techniques, New Age Publications, New
Delhi, 2009.2. Panneerselvam, R., Research Methodology, Prentice-Hall of India, New Delhi, 2004
11PCE310 SEMANTIC WEBL T P C3 0 0 3
Course Objectives The course is designed to equip graduate level students with the latest developments in the
Semantic Web scenario.
Semantic Web is an exciting new development for the future of the WWW.
Semantic technologies represent a fascinating combination of web technology, database
technology, modeling, formal logic, and artificial intelligence.
Students will be introduced to many useful Semantic Web concepts and tools.
Finally, students will gain a broad understanding of the most challenging problems and what
progress has been made towards solving these problems.
UNIT I INTRODUCTION 9
History – Semantic Web Layers –Semantic Web technologies – Semantics in Semantic Web – XML:
Structuring – Namespaces – Addressing – Querying – Processing
UNIT II RDF 9
RDF and Semantic Web – Basic Ideas - RDF Specification – RDF Syntax: XML and Non- XML -
RDF elements – RDF relationship: Reification, Container, and collaboration – RDF Schema – Editing,
Parsing, and Browsing RDF/XML-RQL-RDQL
UNIT III ONTOLOGY 9
Why Ontology – Ontology movement – OWL – OWL Specification - OWL Elements – OWL
constructs: Simple and Complex – Ontology Engineering : Introduction – Constructing ontologies –
Reusing ontologies – On-To-Knowledge Semantic Web Architecture
UNIT IV LOGIC AND INFERENCE 9
Logic – Description Logics - Rules – Monotonic Rules: Syntax, Semantics and examples – Non-
Monotonic Rules – Motivation, Syntax, and Examples – Rule Markup in XML: Monotonic Rules, and
Non-Monotonic Rules
UNIT V APPLICATIONS OF SEMANTIC WEB TECHNOLOGIES 9
RDF Uses: Commercial and Non-Commercial use – Sample Ontology – e-Learning – Web Services –
Web mining – Horizontal information – Data Integration – Future of Semantic Web
TOTAL HOURS: 45
TEXT BOOKS1. Grigorous Antoniou and Van Hermelen - “A Semantic Web Primer”-The MIT
Press –2004
2. “Spinning the Semantic Web: Bringing the world wide web to its full potential”
– The MIT Press – 2004
REFERENCE BOOK1. Shelley Powers – “Practical RDF” – O’reilly publishers – First Indian Reprint :
2003
