SCHEME OF INSTRUCTION

MCA (MASTER OF COMPUTER APPLICATIONS)

With effect from the Academic year 2016-2017

MCA II Year
SEMESTER – I

Scheme of Scheme of Examination

Instruction
Periods per week
S. Syllabus Subject
Duration Maximum Marks
No Ref. No. in
Hours
L/T D/P Univ. Sessionals
Exam
1. CS 701 Software Engineering 4 - 3 80 20
2. CS 702 Database Management Systems 4 - 3 80 20
3. CS 703 Design & Analysis of Algorithms 4 - 3 80 20
4. CS 704 Operating Systems 4 - 3 80 20
5. CS 705 Operations Research 4 - 3 80 20

PRACTICALS

6. CS 731 Programming Lab V - 3 3 50 25

(DBMS Lab)
7. CS 732 Programming Lab VI - 3 3 50 25
(OS Lab)
Total 20 6 - 500 150
 with effect from the academic year 2016-2017

CS 701

SOFTWARE ENGINEERING

Instruction 4 Periods per week

Duration of University Examination 3 Hours
University Examination 80 Marks
Sessional 20 Marks

UNIT-I

The software Problem- Cost, Schedule and Quality, Scale and change

Software Processes - Process and project, Component Software Processes, Software

Development Process Models, Project management Process.

UNIT-II

Software Requirements Analysis and Specification - Value of a good SRS, Requirements

Process', Requirements Specification, Functional Specification with Use Cases, Other
approaches for analysis.

Software Architecture - Role of Software Architecture Views, Component and connector view,
Architectural styles for C & C view, Documenting Architecture Design, evaluating
Architectures.

UNIT-III

Planning a Software Project - Effort Estimation, Project Schedule and staffing, Quality Planning,
Risk Management Planning, Project Monitoring Plan, Detailed Scheduling

Design - Design concepts, Function oriented Design, Object Oriented Design, Detailed Design,
Verification, Metrics

UNIT-IV

Coding and Unit Testing - Programming Principles and Guidelines, Incrementally developing
code, managing evolving code, unit testing, code inspection, Metrics

Testing - Testing Concepts, Testing Process, Black Box testing, White box testing, Metrics.
 with effect from the academic year 2016-2017

UNIT-V

Maintenance and Reengineering - Software Maintenance, supportability, Reengineering,

Business process Reengineering, Software reengineering, Reverse engineering; Restructuring,
Forward engineering, Economics of Reengineering.

Software Process Improvement - Introduction, SPI process, CMMI, PCMM, Other SPI
Frameworks, SPI return on investment, SPI Trends.

Suggested Reading :

1. Pankaj Jalote, "Software Engineering- A Precise. Approach", Wiley India, 2010.

2. Roger. S.Pressman , "Software Engineering - A Practitioner's Approach", Seventh Edition,

McGraw Hill Higher Education, 2010.

3. Deepak Jain, "Software Engineering", Oxford University Press, 2009.

4. Rajib Mall, "Fundamentals of Software Engineering", Third Edition, PHI, 2009.

5. Sommerville, "Software Engineering", Seventh Edition, Pearson Education, 2007.

 with effect from the academic year 2016-2017

CS 702

DATABASE MANAGEMENT SYSTEMS

Instruction 4 Periods per week

Duration of University Examination 3 Hours
University Examination 80 Marks
Sessional 20 Marks

UNIT-I

Introduction to DBMS and ER Model: File Systems versus DBMS, Advantages of a DBMS,
Database Design and E-R Diagrams, Entities, Attributes and Entity Sets, Relationships and
Relationship Sets, Additional Features of the ER Model, Conceptual Design with the ER Model.

The Relational Model: Introduction to Relational Model, Integrity Constraints over Relations,
Logical Database Design (ER to Relational), Introduction to Views, Destroying / Altering Tables
& Views.

Schema Refinement and Normal Forms: Schema Refinement, Functional Dependencies, Normal
Forms, Normalization, Schema Refinement in Database Design.

UNIT-II

Relational Algebra and Calculus: Preliminaries, Relational Algebra, Relational Calculus,

Expressive Power of Algebra and Calculus.

SQL: Queries, Constraints, Triggers: The Form of Basic SQL Query, Set Operators, Nested
Queries, Aggregate Operators, Null Values, Triggers and Active Databases, Designing Active
Databases, Accessing Databases from Applications using Embedded SQL, Cursors, Dynamic
SQL.

UNIT-III

Overview of Storage and Indexing: File Organizations and Indexing, Index Data Structures,
Comparison of File Organizations.

Tree-Structured Indexing: Indexed Sequential Access Method (ISAM), B+ Trees, Search, Insert
Delete, B+ Trees in Practice.

Hash-Based Indexing: Static Hashing, Extendible Hashing, Linear Hashing, Extendible versus
Linear Hashing.
 with effect from the academic year 2016-2017

UNIT-IV

Transaction Management : ACID Properties, Transactions and Schedules, Concurrent Executinn

of Transactions, Lock-Based Concurrency Control.

Concurrency Control: 2PL, Serializablity, and Recoverablity, Introduction to Lock Management,

Dealing with Deadlock, Specialized Locking Techniques, Concurrency Control without Locking.

UNIT-V

Crash Recovery: Introduction to ARIES, The Log, Other Recovery Related Structures, The
W AL, Checkpointing, Recovering from a System Crash, Media Recovery.

Security and Authorization: Introduction to Database Security, Access Control, Discretionary

Access Control, Mandatory Access Control, Additional Issues related to Security.

Suggested Reading:

1. Raghu Ramakrishnan, Johannes Gehrke, "Database Management Systems", Third Edition,

McGraw Hill, 2003.

2. Abraham Silberschatz, Henry F Korth, S Sudharshan, "Database System Concepts", Sixth

Edition, McGraw-Hill International Edition, 2011

3. Peter Rob, Carlos Coronel, "Database System Concepts", Cengage Learning, 2008.

4. Ramez Elmasri, Durvasul VLN Somayajulu, Shamkant B Navathe,. Shyam K Gupta,

"Fundamentals of Database-Systems", Fourth Edition, Pearson Education, 2006.
 with effect from the academic year 2016-2017

CS 703

DESIGN AND ANALYSIS OF ALGORITHMS

Instruction 4 Periods per week

Duration of University Examination 3 Hours
University Examination 80 Marks
Sessional 20 Marks

UNIT-I

Introduction to algorithms, Algorithm Specification. Performance Analysis. Randomized

Algorithms.

Elementary Data Structures: Stacks and Queues, Trees, Dictionaries, Priority Queues, Sets and
Disjoint Set Union, Graphs.

UNIT II

Divide and Conquer: Binary Search, Finding the Maximum and Minimum, Merge Sort; Quick
Sort, Selection, Strassen's Matrix Multiplication, Convex Hull.

The Greedy Method: Knapsack Problem, Tree Vertex Splitting, Job Sequencing with Deadlines,
Minimum-Cost Spanning Trees, Optimal Storage on Tapes, Optimal Merge Patterns, Single
Source Shortest Paths.

UNIT-III

Dynamic Programming: General Method, Multistage Graphs, All-Pairs Shortest Paths, Single-
Source Shortest Paths, Optimal Binary Search Trees, 0/1 Knapsack, Reliability Design, The
Traveling Salesperson Problem.

Basic Traversal and Search Techniques : Techniques for Binary Trees, Techniques for Graphs,
Connected Components and Spanning Trees, Biconnected Components and DFS.

UNIT IV

Back Tracking: General Method, 8-Queens Problem, Sum of Subsets, Graph Coloring,
Hamiltonian Cycles, Knapsack Problem.

Branch-Bound: The Method, 0/1 Knapsack Problem, Traveling Sales Person.

 with effect from the academic year 2016-2017

UNIT-V

NP-Hard and NP-Complete Problems: Basic Concepts, Cook's Theorem, NP-Hard. Graph
Problems, NP-Hard Scheduling Problems, NP-Hard Code Generation, Some Simplified NP-Hard
Problems.

Suggested Reading:

1. E Horowitz, S Sahni, S Rajasekaran, "Fundamentals of Computer Algorithms", Second

Edition, Universities Press, 2007.

2. R. Pannerselvam, "Design and Analysis of Algorithms", PHI, 2007.

3. Hari Mohan Pandey, "Design, Analysis and Algorithm", University Science Press, 2009.

4. Udit A arwal, "Algorithm Design & Analysis", Dhanpat Rai, 2008.

5. TH Cornen , .CE Leiserson, RL Rivert, C Stein, "Introduction to Algorithms”, Third Edition,

PHI, 2010.

6. PH Dave, HB Dave, "Design and Analysis of Algorithms", Pearson Education, 2008.

 with effect from the academic year 2016-2017

CS 704

OPERATING SYSTEMS

Instruction 4 Periods per week

Duration of University Examination 3 Hours
University Examination 80 Marks
Sessional 20 Marks

UNIT-I

Introduction to operating systems: OS structure and strategies, Process concept, Interprocess

communication, Threads, Multithreaded Programming.

Process Scheduling: Scheduling Criteria, Scheduling Algorithms, Multi Processor scheduling,

Thread Scheduling.

UNIT-II

Memory Management, swapping, contiguous allocation, paging, Static and dynamic partition,
demand paging, page replacement Algorithms, thrashing, segmentation, segmentation with
Paging.

File System Interface: File Concept, Access Methods, Directory Structure, File System
Mounting, File Sharing, Protection.

File System Implementation: File-System Structure, File-System Implementation, Directory

Implementation, Allocation Methods, and Free ,Space management, Efficiency and Performance,
Recovery.

UNIT-III

Process synchronization: Critical Section problem, Semaphores, monitors.

Deadlocks: Necessary conditions, resource allocation graph, methods for handling deadlocks,
preventions, avoidance, detection and recovery. Protection Goal, domain of protection, access
matrix.

UNIT-IV

Device Management: Disk Structure, Disk Attachment, Disk Scheduling, Disk Management,
Swap Space Management, RAID structure, Stable. storage Implementation.

I/O System: I/O hardware, Application TO Interface, Kernel I/O Subsystem, Transforming; I/O
request to hardware. operation, STREAMS.
 with effect from the academic year 2016-2017

UNIT-V

Case Studies.

Linux System: Design Principles, Kernel Modules, Process Management, Scheduling Memory
Management, File Systems, Input and Output, Inter-Process Communication, Network Structure,
Security.

Windows XP : General Architecture. The NT Kernel, The NT Executive.

Suggested Reading:

1. Abraham Silberschatz, Peter B Galvin, Greg Gagne, "Operating System Concepts", Wiley
India, 2006.

2. Andres S Tanenbaum, "Modern Operating Systems", 3rd Edition, PHI, 2009.

3. Robert Love, "Linux Kernel Development", Pearson Education, 2004.

4. William Stallings, "Operating Systems", Sixth Edition, PHI, 2009.

 with effect from the academic year 2016-2017

CS 705

OPERATIONS RESEARCH

Instruction 4 Periods per week

Duration of University Examination 3 Hours
University Examination 80 Marks
Sessional 20 Marks

UNIT-I

Linear Programming: Introduction, Concept of Liner Programming Model, Development of LP

models, Graphical Method, Linear Programming Methods, Special cases of Linear
Programming, Duality, Sensitivity Analysis.

UNIT-II

Transportation Problem : Introduction, Mathematical Model for 'Transportation Problem, Types

of Transportation Problem, Methods to solve Transportation Problem, Transshipment Model.

UNIT-III.

Assignment Problem: Introduction, Zero-One Programming Model, Types of Assignment

Problem, Hungerian Method., Branch-and-Bound Technique for Assignment Problem.

Integer Programming: introduction, IntegerProgramming Formulations, The Cutting-Plane

Algorithm, Branch-and-Bound Technique, Zero-One Implicit Enumeration Algorithm.

UNIT-IV

Dynamic Programming: Introduction, Applications of Dynamic Programming, Solution of

Linear Programming Problem through Dynamic Programming.

UNIT-V

Game Theory: Introduction, Game with Pure Strategies, Game with Mixed Strategies,
Dominance Property, Graphical Method for 2 x n or m x 2 Games, Linear Programming
Approach for Game Theory.

Suggested Reading:
1. Pannarselvam, "Operations Research", Second Edition, PHI, 2006.

2. Prem Kumar Gupta, DS Hira, "Operations Research", S.Chand, 2010.

3. Rathindra P Sen, "Operations Research - Algorithm and Application", PHI, 2010.

4. JK Sharma, "Operations Research", Fourth Edition, MacMillan, 2009.

 with effect from the academic year 2016-2017

CS 731

PROGRAMMING LAB – V

(DBMS Programming Lab)

Instruction 3 Periods per week

Duration of University Examination 3 Hours
University Examination 50 Marks
Sessional 25 Marks

I. SQLIPL- SQL :

1. Creation of database (exercising the commands for creation)

2. Simple to complex condition query creation using SQL plus

3. Demonstration of blocks, cursors & database triggers.

II. Forms / Reports :

4. Creation offorms for the case study assigned.

5. Creation of Reports based on different queries.

6. Crating password and security features for applications.

7. Usage of file locking and table locking facilities in applications.

8. Creation of Small full fledged database application spreading over to 3 sessions.

Note :

(i) Use Case Studies as Library Information Studies, Pay roll System, Bank Information
System, Reservation System, Inventory System, etc.

(ii) The creation of Sample database, for the purpose of the experiments is expected to
pre-decided by the instructor based on the case study assigned to the students.

(iii) Preferable Oracle DBMS package should be used to carry the Lab experiments.
 with effect from the academic year 2016-2017

CS 732

PROGRAMMING LAB – VI

(OPERATING SYSTEMS LAB)

Instruction 3 Periods per week

Duration of University Examination 3 Hours
University Examination 50 Marks
Sessional 25 Marks

1. Printing file flags for specified descriptor.

2. Print type of file for each command line arguments.

3. Recursively descends a director hierarchy counting file types.

4. Program using process related system calls.

5. Programs to create threads.

6. Program using Signals.

7. Echo Server-using pipes.

8. Echo Server-using messages.

9. Producer& Consumer Problem using Semaphores and Shared Memory.

10. Producer & Consumer Problem using message passing.

11. Readers and Writers Problem using message passing.

12. Dining Philosopher's problem using semaphores.

13. Program using File Locking.

14. Understanding and submitting and assignment on RC scripts.

15. Programs using linux shell script (Note 2 shell programs covering the salient features of
Shell).
 SCHEME OF INSTRUCTION
MCA (MASTER OF COMPUTER APPLICATIONS)
With effect from the Academic year 2016-2017

MCA II Year
SEMESTER – II

Scheme of Scheme of Examination

Instruction
Periods per week
S. Syllabus Subject
Duration Maximum Marks
No Ref. No. in
Hours
L/T D/P Univ. Sessiona
Exam ls
1. CS 751 Data Warehousing and 4 - 3 80 20
Data Mining
2. CS 752 Computer Networks 4 - 3 80 20
3. CS 753 Unix Programming 4 - 3 80 20
4. CS 754 Web Programming 4 - 3 80 20
5.
Elective – I (Any One)

CS 755 Computational Intelligence 4 - 3 80 20

CS 756 Distributed Systems 4 - 3 80 20
CS 757 Information Retrieval Systems 4 - 3 80 20

PRACTICALS

6. CS 781 Programming Lab – VII - 3 3 50 25

(Unix & Network Prog. Lab)
7. CS 782 Programming Lab – VIII - 3 3 50 25
(Web Prog. & Data Mining Lab)
Total 20 6 - 500 150
 with effect from the academic year 2016-2017

CS 751

DATA WAREHOUSING AND DATA MINING

Instruction 4 Periods per week

Duration of University Examination 3 Hours
University Examination 80 Marks
Sessional 20 Marks
UNIT – I

Introduction: Motivation, Data Warehousing and Data Mining, Data Models, Data Warehousing
and OLAP: User's perspective, Data Mining: User's perspective, Related Disciplines, other
Issues, Future Trends

Frequent pattern Matching: Introduction, Problem Definition, Mining association rules,

Applications, Variations, Interestingness, FIM algorithms, Current status, Optimal FIM
algorithms, Incremental mining, Conciseness of results, Sequential rules.

UNIT-II

Classification: Introduction, Problem definition, Applications, Evaluation of clusters, Other

issues; Classification techniques, Optimal Classification algorithms, Regression.

Clustering: Introduction, Problem definition, Applications, Measurement of similarity,

evaluation, classification of clustering algorithms, partitioning methods, Hierarchical Methods,
Density Based Methods, Grid Based methods, Outlier detection

UNIT-III

Applications of Data Mining, Issues and Challenges, Current Trends.

Introduction to Data Warehousing: History, Demand for strategic information, Data warehouse
Definition, Users, Benefits and Concerns.

Data Warehousing: Defining Features: Introduction, Features, Granularity, Information flow

mechanism, Metadata, Classes of data, Lifecycle of a data, Data flow from warehouse to
operational systems.

UNIT-IV

Architecture of a data warehouse: Introduction, Characteristics, Goals, Architecture, Data

warehouse and data mart, Issues, Building data marts

Data Warehouse Schema: Introduction, Dimension Modeling, Star Schema, Snowflake schema,
Aggregate tables, Fact Constellation, Strengths of DM, Data Warehouse and Data model.
 with effect from the academic year 2016-2017

Dimensional Modelling: Characteristics of dimension table, Fact table, Factless fact table,
Updates, cyclicity of data.

UNIT-V

Dimensional Modeling: Other types of dimension tables, Keys to DW Schema, Enhancing

performance, Technology requirements.

The ETL Process, Introduction, Data Extraction, Transformation, Loading, Quality.

OLAP in the Datawarehouse: OLAP, Multidimensional analysis, Functions, Applications,

Models, Design, Tools and Products, Data Design, Administration and performance, OLAP
platforms.

Suggested Reading:

1. Vikram Pudi P. Radha Krishna, “Data Mining”, Oxford University Press, 1st edition 2009.

2. Reema Theraja. “Data Warehousing”. Oxford University Press, 2009.

3. Jiawei Han, Micheline Kamber. “Data Mining - Concepts and Techniques”, Morgan
Kayufman,2006.

4. Arun K Pujari, “Data Mining Techniques”, University Press, 2nd Edn, 2009.

5. Pang-Ning Tan, Michael Steinbach, Vipin Kumar, “Introduction to Data Mining”, Pearson
Education, 2008.

6. MH Dunham, "Data Mining", Pearson Education, 2009.

7. S Anabory, D Murray, "Data Warehousing in the real world", Pearson Education, 2009.
 with effect from the academic year 2016-2017

CS 752

COMPUTER NETWORKS

Instruction 4 Periods per week

Duration of University Examination 3 Hours
University Examination 80 Marks
Sessional 20 Marks

UNIT-I

Data Communications : Components - Direction of Data flow - networks -Components and

Categories - types of Connections - Topologies -Protocols and Standards - ISO/OSI model,
TCP/IP.

Transmission Media - Coaxial Cable - Fiber Optics - Line Coding - Modems - RS232
Interfacing.

UNIT II

Datalink Layer : Error detection and correction, CRC, Hamming code, Flow Control and Error
control - stop and wait - go back-N ARQ - selective repeat ARQ-sliding window - HDLC.

Mac Layer : LAN - Pure and Slotted ALOHA, Ethernet IEEE 802.3 -IEEE 802.4 -IEEE 802.5,
Bridges.

UNIT-III

Network Layer : Internetworks - virtual circuit and Datagram approach, Routers IP addressing,
Subnetting, CIDR.

Routing - Distance Vector Routing, Link State Routing, OSPF and BGP.

UNIT-IV

Transport Layer : Services of transport layer, Multiplexing.

Transmission Control Protocol (TCP) - Congestion Control, tinier management, Quality of

services (QOS) and User Datagram Protocol (UDP)

UNIT-V

Application Layer : Domain Nanie Space (DNS) - SMTP - FTP - HTTP - WWW.
 with effect from the academic year 2016-2017

Suggested Reading:

1. Andrew S. Tanenbaum, "Computer Networks", Pearson Education; Fourth Edition, 2008.

2. Behrouz A. Forouzan, "Data communication and Networking", Tata McGraw-Hill, 2009.

3. James F. Kurose and Keith W. Ross, "Computer Networking: A Top-Down Approach

Featuring the Internet", Pearson Education, 2006.
 with effect from the academic year 2016-2017

CS 753

UNIX PROCRAMMING

Instruction 4 Periods per week

Duration of University Examination 3 Hours
University Examination 80 Marks
Sessional 20 Marks

UNIT-I

Unix: Introduction, commands, file system, security and file permission, regular expression and
grep, shell programming, awk
[chapter 1,3,4,5,9,10,12 and 14 of text book 1]

UNIT-II

The Unix Model, signal, process control, daemon process.

Interprocess Communication: Introduction, file and record locking, other unix locking
techniques, pipes, FIFOs, streams and messages, namespaccs, message queues, semaphores and
shared memory.
[chapter 2 and 3 text book 2]

UNIT-III

Socket programming, Socket address, elementary socket system calls, advanced socket system
calls, reserved ports, socked options, asynchronous I/O, Input/ Output Multiplexing, out-off band
data, sockets and signals, Internet super server.
[chapter 6 of text book 2]

UNIT-IV

The Basics of Perl: Origin and uses of Perl, Strings and escape characters, Scalar variables,
Control Statements., Fundamentals of arrays, Hashes, functions, Regular expressions and Pattern
matching, File input and output.

Introduction to PHP: Overview, syntactic characteristics, primitives, operations and expressions,

output, control statements, arrays, functions. pattern matching, form handling files, cookies and
session tracking.
[chapte• 8 and 1 11 of text book 3]
 with effect from the academic year 2016-2017

UNIT-V

Python Basics, Python Objects, Numbers, Seque.nces: Strings, Lists, and Tuples, Mapping and
Set Types, Conditionals and Loops, Files and Input/Output, Errors and Exceptions, Functions
and Functional Programming, Modules, Object oriented programming.
[Part one of text book 4]

Suggested Reading :

1. Behrouz A. Forouzan and Richard F. Gilberg, "Unix and Shell Programming: a Text hook"
Cengage learning, 2008.

2. W. Richard Stevens, "Unix Network Programming", Pearson Education, 2009.

3. Robert W. Sebesta, "Programming the World Wide Web", Pearson Education, 2008.

4. Wesley J. Chun, "Core Python Programming", Prentice Hall.

5. Sumitabha Das, "Unix concepts & Applications", Fourth Edition, Tata McGraw hill, 2006.
 with effect from the academic year 2016-2017

CS 754

WEB PROGRAMMING

Instruction 4 Periods per week

Duration of University Examination 3 Hours
University Examination 80 Marks
Sessional 20 Marks

UNIT-I

HTML:. Markup languages, common tags, header, test styling, linking images Formatting text,
Unordered lists, nested and ordered list, Tabs-and formatting, Basic forms; Complex fprms
linking, Meta Tags.

Dynamic HTML: Cascading style sheets in line styles, style element External Style sheet, text
flow and Box model, user style sheets.

UNIT-II

Object model and collections: Object referencing, collections all, children frames, navigator
object.

Event model: ONCLICK, ONLOAD, Error Handling, ON ERRORS ONMUOUSEMOVE,

ONMUSEOVER, ONMOUSEOUT, ONFOCUS, ONBLUR, ONSUBMIT.

Dynamic HTML: Filters and transitions, Data binding with Tabular data control binding to IMO,
TABLE, Structured graphics, Active controls.

UNIT-III

Introduction to scripting, Java Script, Data 'types, Arithmetic's Equality relational, assignment
increment, decrement operators, Java Script Control Structures- if, if-else, while.

Java Script Control Structures: For, Switch, Do/while, break.

Programming modules, recursion, recursion vs iteration global functions arrays,. using arrays,
Reference and reference parameters, passing arrays to functions, multiplesubscripted arrays,
objects-math, string. Boolean and number.
 with effect from the academic year 2016-2017

UNIT-IV

Client side scripting with VB Script, operations, Data types and control structures, Functions,
Arrays, String manipulations, classes and objects.

Web Servers : Personal Web server, Internet information server, Apache Web Server,
Installation of a Web Server.

UNIT-V

Active Sever Pages, Client side Scripting vs Server side Scripting, Server side Active X
Component, ADO, file system objects, Session tracking, CGI and PERL5, String.

Processing and Regular Expressions, Server side includes, Cookies and PERL XML Document
Type Definition, XML Parsers, Using XML with HTML.

Suggested Reading:

1. Deiterl, Deitel & NIETO, "Internet & World Wide Web - How to Program", Pearson
Education, Third Edition, 2004.

2. Steven Holzner, "HTML Black Book - Comprehensive Problem Server", Dream Tech Press,
2000.

3. B Sosinsky, V Hilley, "Programming the Web - An Introduction", MGH, 2004.

 with effect from the academic year 2016-2017

CS 755

COMPUTATIONAL INTELLIGENCE
(Elective-I)
Instruction 4 Periods per week
Duration of University Examination 3 Hours
University Examination 80 Marks
Sessional 20 Marks

UNIT-I

What is Artificial Intelligence: The Al Problems, The 'Underlying Assumption, What is an AI

Technique, The Level of the model, Criteria for Success.

Problems, Problem Spaces, and Search: Defining the Problem as a State Space Search,
Production Systems, Problem Characteristics, Production System Characteristics.

UNIT-II

Heuristic Search Techniques: Generate-and- Test, Hill Climbing, Best-first Search, Problem
Reduction, Constraint Satisfaction.

KR using Predicate Logic: Representing Simple Facts in Logic, Representing Instance and ISA
Relationships, Computable Functions and Predicates, Resolution, Natural Deduction.

UNIT-III

Representing Knowledge Using Rules: Procedural versus Declarative Knowledge, Logic

Programming, Forward versus Backward Reasoning, Matching, Control Knowledge.

Symbolic Reasoning Under Uncertainty: Introduction to Nonmonotonic Reasoning, Logics for

Nonmonotonic Reasoning, Implementation Issues, Augmenting a Problem-Server,
Implementation: Depth-First Search, Implementation: Breadth-First Search.

UNIT-IV

Statistical Reasoning: Probability and Bayes Theorem, Certainty Factors and Rule-based
Systems, Bayesian Networks, Dempster-Shafer Theory, Fuzzy Logic.

Weak Slot-and-Filler Structures: Semantic Nets, Frames.

Strong Slot-and-Filler Structures: Conceptual Dependency, Scripts, CYC.

 with effect from the academic year 2016-2017

UNIT-V

Game Playing: The Minimax Search Procedure, Adding Alpha-beta Cutoffs, Additional
Refinements, Iterative Deepening.

Planning: The Blocks World, Components of a Planning System, Goal Stack Planning,
Nonlinear Planning Using Constraint Posting, Hierarchical Planning, Reactive Systems.

Suggested Reading:

1. Elaine Rich, Kevin Knight, Shivashankar B Nair "Artificial Intelligence", Third Edition,
TMH, 2009.

2. NP Padhy, "Artificial Intelligence and Intelligent Systems"- Oxford, 2009.

3. S Russell, P Norvig, "Artificial Intelligence", Second Edition, Pearson Education, 2009.

4. Ela Kumar, "Artificial Intelligence", IK International, 2008.

 with effect from the academic year 2016-2017

CS 756

DISTRIBUTED SYSTEMS
(Elective - I)

Instruction 4 Periods per week

Duration of University Examination 3 Hours
University Examination 80 Marks
Sessional 20 Marks

UNIT-I

Introduction to Distributed Systems: Definition, Goals, Hardware and software concepts and
client/server model.

Processes: Threads, Clients, Servers, Code Migration, Software agents.

UNIT-II

Naming: Entities: DNS, X.500, Locating Mobile entities, removing unreferenced entities.

Synchronization: clock, logical clock, Global state, election algorithms, Mutual exclusion,
distributed Transaction.

UNIT-III

Consistency and Replication: Data-Centric, Client-Centric Consistency Models, Distribution and

Consistency protocols.

Fault Tolerance: Introduction, Process resilience, Reliable client-server and Group

communication, Distributed Commit and Recovery.

UNIT-IV

Distributed Object based Systems: CORBA, D-COM & GLOBE. Distributed File System, Case
studies: SUN NFS, CODA.

UNIT-V

Distributed shared memory: Implementation algorithms, memory coherence, and Design issues.

Distributed Scheduling: Issues in Load Distributing, Components of Load Distributing

Algorithms, Load Distributing Algorithms.
 with effect from the academic year 2016-2017

Suggested Reading:

1. Singhal M.Shivaratri N.G: “Advanced concepts in operating systems”, McGraw Hill,

Intl., 1994.
 with effect from the academic year 2016-2017

CS 757

INFORMATION RETRIEVAL SYSTEMS

(Elective-I)

Instruction 4 Periods per week

Duration of University Examination 3 Hours
University Examination 80 Marks
Sessional 20 Marks

UNIT-I

Introduction

Retrieval. Strategies: Vector Space model, Probabilistic Retrieval.

Strategies Language Models: Simple Term Weights, Non Binary Independence Model.

UNIT-II

Retrieval Utilities: Relevance Feedback, Clustering, N-grams, Regression Analysis, Thesauri.

UNIT-III

Retrieval Utilities: Semantic Networks, Parsing

Cross-Language Information Retrieval: Introduction, Crossing the Language Barrier.

UNIT-IV

Efficiency: Inverted Index, Query Processing, Signature Files, Duplicate Document Detection.

UNIT - V

Integrating Structured Data and Text: A Historical Progression, Information Retrieval as a

Relational Application, Semi-Structured Search using a Relational Schema.

Distributed Information Retrieval: A Theoretical Model of Distributed Retrieval, Web Search.

 with effect from the academic year 2016-2017

Suggested Reading:

1. David A. Grossman, Ophir Frieder. “Information Retrieval - Algorithms and Heuristics”,

Springer, 2nd Edition (Distributed by Universities Press), 2004.

2. Gerald J Kowalski, Mark T Maybury. “Information Storage and Retrieval Systems”, Springer,
2000

3. Soumen Chakrabarti, “Mining the Web: Discovering Knowledge. from Hypertext Data",
Morgan-Kaufmann Publishers, 2002.

4. Christopher D. Manning, Prabhakar Raghavan, Hinrich SchGtze, “An Introduction to

Information Retrieval”, Cambridge University Press, Cambridge, England,-2009.
 with effect from the academic year 2016-2017

CS 781

PROGRAMMING LAB – VII

(Unix Programming Lab)

Instruction 3 Periods per week

Duration of University Examination 3 Hours
University Examination 50 Marks
Sessional 25 Marks

1. Examples using Shell scripts.

2. Programming using IPC.

3. Socket programs.

4. Perl Programs using regular expressions and pattern matching.

5. PHP Programs using form handling using cookies.

6. Python programs based on object oriented design.

(Network Programming Lab)

1. Examples using IPC

2. Echo Server using TCP(Concurrent or Iterative) and UDP
3. Time of the day server
4. Talker and Listener
5. Ping routine
6. Trace route
7. Mini DNS

Note: The above experiments [2-7] have to be carried out using socket programming
interface. Multi- threading has to be employed wherever it is required.
 with effect from the academic year 2016-2017

CS 782

PROGRAMMING LAB – VIII

(Web Programming Lab)

Instruction 3 Periods per week

Duration of University Examination 3 Hours
University Examination 50 Marks
Sessional 25 Marks

1. Creating HTML pages to test different Tags.

a) Headers
b) Linking Images.
c) Images as anchor.
d) Text Formatting.

2. a) HTML Table Formatting.

b) Ordered and Unordered lists.

3. Creating Frames.

4. Examination result in Java Script.

5. Creation of Quiz program.

6. Usage Data and the methods of Date and Time objects.

7. Floating alerts, aligning text and setting box dimension using CSS.

8. Demonstrating object hierarchy using collection children.

9. 'Using HTML Events.

10. Using Transition & Filters like Flip filter, Chroma filter, Shadow filter etc.,

11. VB script classes and regular expression.

12. Installing Web Server (PWS or IIS).

13. Guest book Active Server pages.

14. Creation of Small full fledged database application using ADO spreading over to 3 sessions.
 with effect from the academic year 2016-2017

(Data Mining Lab)

COURSE OBJECTIVES:
 To Conceptualize Data Mining & the need for preprocessing
 To learn the algorithms used for various types of data mining problems.

COURSE OUTCOMES:
 Will be able to implement algorithms to solve data mining problem using weka tool

1. Perform data preprocessing using WEKA

2. Obtain The Decision Tree For Different Data Sets Using WEKA
3. Implement The Classification Algorithms Using WEKA
4. Obtain the Association Rules for given dataset & Identify which association rules are strong rules & weak
rules
5. Perform Data Transformations Using ETL Tool.
6. Write A Program To Implement star schema
7. Write A Program To Implement K-Means Algorithm
8. Case study on KDD process.

Suggested Reading
i) Data Mining – Concepts and Techniques Jiawei Han & Micheline Kamber Harcourt India.
ii) http://www.cs.waikato.ac.nz/ml/weka/