HAJEE KARUTHA ROWTHER HOWDIA COLLEGE – Autonomous

Uthamapalayam.
Choice Based Credit System
M.Sc.,CS & IT (Semester)
Course Scheme and Scheme of Examinations
(Effective for the Academic Year 2014 – 2017)

QUALIFICATION
Passed in any degree expected by the syndicate as equivalent with information Technology as one of
the subject in UG.
DURATION OF THE COURSE:
M.Sc., CS & IT – Two academic years (Four semesters)
OBJECTIVE OF THE COURSE
1. To enable the students to understand the knowledge of Information Technology.
2. To acquire skills in the field of application oriented and job oriented.
3. Study of skill based subject is to enrich the students to acquire additional knowledge.
4. Visit to various IT concerns (Industrial Visit) helps the students for projects and future
enhancement.
STRUCTURE OF QUESTION PAPERS
Internal - 25 marks
External - 75 marks
Total - 100 marks
Question Paper: Three parts (A, B and C)
Section A - Multiple Choice / True or False
Section B - Either A or B
Section C - 3 out of 5 questions
 M.Sc., Computer Science & Information Technology

(Effective from 2014 – 2017)

Int Ext Total

Semester Subject Code Title of the Paper Credits Hours
Marks Marks Marks
Core 14PCTC11 Mathematical Foundations 4 5 25 75 100
Digital Principles and
Core 14PCTC12 4 5 25 75 100
Computer Organization
Data Structure and
Core 14PCTC13 4 5 25 75 100
Algorithms
I
Programming in C & C++
Core 14PCTC14 4 5 25 75 100

Core 14PCTC1P Programming in C - Lab 5 5 40 60 100

Core 14PCTC1Q Visual Programming - Lab 5 5 40 60 100

TOTAL 26 30 180 420 600

Relational Database
Core 14PCTC21 4 5 25 75 100
Management Systems
Core 14PCTC22 Operating System 4 5 25 75 100
Computer Graphics and
Core 14PCTC23 4 5 25 75 100
Multimedia
Data mining and
Elective 14PCTE21
Warehousing
II
Elective 14PCTE22 Digital Image Processing 4 5 25 75 100

Elective 14PCTE23 Programming in Java

Core 14PCTC2P Java Programming Lab 5 5 40 60 100

Core 14PCTC2Q OS and Networks Lab 5 5 40 60 100

TOTAL 26 30 180 420 600

 Core 14PCTC31 Software Engineering 4 5 25 75 100
Data Communications and
Core 14PCTC32 4 5 40 60 100
Networks
Core 14PCTC3P Dot Net Programming Lab 5 5 40 60 100
Open Source Technology
Core 14PCTC3Q 5 5 25 75 100
using PHP Lab
Elective 14PCTE31 Cloud Computing
III
Elective 14PCTE32 Compiler Design
4 4 25 75 100

Artificial Intelligence and

Elective 14PCTE33
Expert Systems

NME 14PCTN31 The ABC’S of Computers 5 6 25 75 100

TOTAL 27 30 180 420 600

IV Core 14PCTC4P Project 11 40 60 100

TOTAL 90 580 1320 1900

Year : FIRST CORE PAPER - I Semester : I

Hours:5 14 PCT C11 MATHEMATICAL FOUNDATION Credits : 4

Unit – I
Logic : Proposition – logical operators – truth tables – Normal forms – Laws of logic – Proofs in
prepositional calculus (Theory of inference)
Unit – II
Group Theory : Basic concepts – Matrix representation of graphs – shortest path problem – directed
trees – binary trees.
Unit – III
Formal Languages: four class of grammars ( Phrase structure, context sensitive , context free, regular)
context free language – generation trees. Finite Automata: Representation of FA – Acceptability of a
string by NDFA. Equivalence of FA and NDFA – procedure for finding FA – NDFA.
Unit – IV
Algebraic Structures: Groups – Subgroups – Homomorphism – cosets – Lagrange’s theorem -
Normal subgroups – semi groups- monoids - Homomorphism of semi groups and monoids,-
subsemigroups and submonoids.
Unit – V
Lattices and Boolean algebra : Lattices – properties – new lattices – modular and distribution lattices.
Boolean algebra: Boolean polynomials – switching circuits.

Text Book:

1.DISCRETE MATHEMATICS – M.K.Venkatraman, N.Chandrasekaran , the National

Publishing Company.
.Chapters 9.1 – 9.56, 11.1 – 11.81, 12.1 – 12.20, 12.61, 7.1 – 7.39, 7.48 – 7.53, 10.1 – 10.42,
10.71.

Reference Books:
1.Discrete Mathematics, G.Shanker Rao, New age International, 2005.
2.Mathematical Foundation Of Computer Science, Y.N.Singh, New age international , 2007
 CORE PAPER - II Semester : I
Year : FIRST

DIGITAL PRINCIPLES AND COMPUTER Credits : 4

Hours:5 14PCTC12
ORGANIZATION

Unit – I
Digital Logic Circuits: Digital Computers – Logic gates – Boolean algebra – Map Simplification –
Combinational circuits – Flip Flops – Sequential circuits. Digital Components : Integrated Circuits –
Decoders – Multiplexers – registers – Shift registers – Binary Counters – Memory Unit. Data
Representation : Data types – Complements – Fixed point Representation – Floating point
Representation – Other binary codes – Error Detection codes.
Unit – II
Register Transfer and Micro operation: Register Transfer Language – Register Transfer – Bus and
Memory Transfers – Arithmetic Micro operations- Logic Micro Operations – Shift Micro operations
– Arithmetic Logic Shift unit. Basic Computer Organization and Design: Instruction codes –
Computer Registers – Computer Instructions – Instruction Cycle – Memory Reference Instructions-
IO and Interrupt – Complete computer Description – Design of Basic Computer – Design of
Accumulator Logic.
Unit – III
Programming the Basic Computer: Introduction – Machine Language – Assembly Language – The
Assembler – Program Loops – Programming Arithmetic and Logic operations – Subroutines. Micro
programmed Control : Control Memory – Address Sequencing – Micro program examples- Design of
Control unit. CPU: Introduction – General Register Organization – Stack Organization – Instruction
Formats – Address Modes- Data transfer and Manipulation – Program Control.
Unit - IV
Pipeline and Vector Processing : Parallel Processing – Pipelining – Arithmetic Pipeline – Instruction
Pipeline – RISC Pipeline. Computer Arithmetic: Introduction – Addition and Subtraction –
Multiplication Algorithms – Division Algorithm. Floating point Arithmetic operations – Decimal
Arithmetic unit – Decimal Arithmetic operations.
Unit - V
IO Organization: Peripheral Devices – I/O Interface- Asynchronous Data Transfer – Modes of
Transfer – DMA- I/O Processor – Serial Communication. Memory Organization: Memory Hierarchy-
Main Memory – Auxiliary Memory – Associative Memory – Cache Memory – Virtual Memory –
Memory management hardware.

Text Book:
Computer System Architecture – M.Morris Mano. Third edition, Prentice Hall of India New Delhi,
2008.

Reference Books:
Digital Principles and applications, Donald P Leach, Albert Paul Malvino, TMH, 2005
Computer Organization and Architecture, William Stallings,PHI, 2008.
Digital Logic and Computer Organization, V. Rajaraman, T. Radhakrishnan, PHI, 2006.
 CORE PAPER - III Semester : I
Year : FIRST

DATA STRUCTURES AND COMPUTER Credits : 4

Hours:5 14PCTC13
ALGORITHMS

UNIT I
Introduction: Overview – Definition – Concept of Data structure – overview – Implementation – Arrays –
Definition – One Dimensional Array – Multidimensional Array – pointer array – Linked List : Definition –
singly Linked list – Double Linked list – Circular Linked list – Circular Double Linked list – Application –
Memory Representation.

UNIT II
Stack : Definition – Representation – Operations – applications – Queues: Definition – Representation –
Various queue structures – Applications – Trees: Definition – Representation – Operations – Types.

UNIT III
Searching Techniques:Design of searching algorithms : Sequential search , Binary search ,Binary Tree search .
Hashing : Hash Functions , Open Hashing , Closed Hashing , Bucket Hashing , Collisions , Linear Probing .
Radix searching , Digital search trees , Radix search trees , Multi way radix searching .

UNIT IV
Algorithm techniques: Divide – and – conquer: - General method – binary search – merge sort – quick sort.The
Greedy method: General method – knapsack problem – minimum cost spanning tree – single source shortest
path.

UNIT V
Dynamic Programming : General Method – Multistage Graphs – All pair shortest path – optimal binary search
trees – 0/1 Knapsack – Reliability Design – Traveling sales person problem – Flow shop Scheduling.
Backtracking:- general method – 8-Queens problem – sum of subsets – graph coloring – Hamiltonian cycles –
knapsack problem

Text Book:

1. E.Horowitz, S. Sahni and Mehta, 1999, Fundamentals of Data Structures in C++,

 Galgotia, New Delhi

Reference Books

1. G. L. Heileman, 1996, Data Structures, Algorithms and Object Oriented Programming, Tata
McGraw-Hill, New Delhi.
2. A.V.Aho, J.D. Ullman, J.E. Hopcraft, 1983, Data Structures and Algorithms, Addison Wesley,
Boston.
3. S. Sahni , 2001, Data structures , Algorithms & Applications, Tata McGraw-Hill, New Delhi.
 CORE PAPER - IV Semester : I
Year : FIRST

Hours:5 14PCTC14 PROGRAMMING IN C & C++ Credits : 4

Unit – I
Introduction to c Programming: C Character set – Data Types – Constants – Variables and Arrays –
Declarations – Expressions – Statements – Symbolic Constants – Arithmetic Operators – Unary
Operators – Relational and Logical Operators – Assignment Operators – The Conditional Operator –
Library Functions – Single Character Input – Single Character Output – Entering Input Data –
Writing Output Data – The Gets and Puts Functions – Branching : the if else Statement – Looping :
the While Statement – More Looping: the Do – While Statement - For Statement- Nested Control
Structures – The Switch Statement – The Break Statement – the Continue Statement – the Comma
Operator – The Go to Statement.

Unit – II
Functions: Defining a Function – Accessing a Function – Function Prototypes – Passing Argument s
to a Function – Recursion. Program Structure: Storage Classes – Automatic Variables – External
Variables – Static Variables. Arrays: Defining an Array – Processing an Array – Passing Arrays to
Functions – Multidimensional Arrays. Strings: Defining a string – Null Character – Initialization of
Strings – Reading and Writing a String – Processing the Strings – Character Arithmetic – Searching
and Sorting of Strings.

Unit – III
Introduction to C++ - Input and output statements in C++ - Declarations -control Structures –
Functions in C++.

UNIT IV
Classes and Objects –Constructors and Destructors –operators overloading –Type Conversion-
Inheritance – Pointers and Arrays.
UNIT V
Memory Management Operators- Polymorphism – Virtual functions – Files – Exception Handling –
String Handling -Templates.

Text Book:

1. “Object Oriented Analysis and Design with Applications”, Grady Booch, Second Edition, Pearson
Education.

2. “Object -Oriented Programming with ANSI & Turbo C++”, Ashok N.Kamthane, First Indian Print
-2003, Pearson Education.

3. Balagurusamy “Object Oriented Programming with C++”, TMH, Second Edition, 2003.
 CORE PAPER - V Semester : I
Year : FIRST

Hours:5 14PCTC1P PROGRAMMING IN C - LAB Credits : 5

1) Standard Deviation
2) Prime Number
3) Adam Number
4) Armstrong Number
5) Perfect Number
6) Pascal’s Triangle
7) Multiplying two matrices & Transpose of the matrix
8) Linear search & Binary search
9) Sum of Digit
10) Reverse the Digit
11) Binary to Decimal, etc..,
12) Sin series, Cos series
13) Quadratic equation using Switch
14) Magic Square
15) Team wise player display – Structure & Files
16) Stack, Queue implementation
17) String manipulation using Pointer & Arrays
18) Library system using Data files, Structure
19) Inventory system using Data files, Structure
20) Banking system using Data files, Structure
21) Students marks processing, Structure
22) Employee Salary Bill processing, Structure
23) Analysis of No. of Words, Characters, Spaces, Lines, Alphabets … in Text file
24) Merging & Sorting
25) Compress and Decompress a Text file (byte size before & after Compression)
26) Linked List
 CORE PAPER - VI Semester : I
Year : FIRST

Hours:5 14PCTC1Q VISUAL PROGRAMMING - LAB Credits : 5

1. Develop a VB Project to Check User Name & Password Given by User.

2. Develop a VB Project to Add & Remove Items From List Box.
3. Develop a VB Project to Copy all Items in a List Box to Combo Box.
4. Develop a VB Project to Enter and Display Student Information.
5. Develop a VB Project to Scroll Text from Left to Right Using Timer.
6. Develop a VB Project to Mini Calculator Functions.
7. Develop a VB Project to Documents typing using MDI Form.
Use Employee Information For the Following Projects.
8. Develop a VB Project to Search a Record in the database using data control.
9. Develop a VB Project to Delete a Record from the database using data control.
10. Develop a VB Project to Perform following Operations in the database using DAO. A).
Move First Record. B).Move Next Record C).Move Previous Record. D).Move Last Record.
11. Develop a VB Project to Insert a Record in the database using ADO.
12. Develop a VB Project to Modify a record in the database using ADO.
YEAR: FIRST CORE PAPER – VII SEMESTER II

Hours: 5 14PCTC21 - RELATIONAL DATABASE MANAGEMENT SYSTEMS Credits: 4

UNIT –I

Introduction to Relational database: Database system application-purpose of database system-view of data –

database languages-Relational database-database design-data storage and query–transaction management-
database architecture-database users and administrators–Relational model: structure of relational database-
relational algebra – relational algebra operation-Null values –modification of database.

UNIT –II

Structured Query Language: data definition –structure of SQL queries – set operations- Aggregate functions –
Null values –Nested sub queries –complex queries-views-modification of database. Advanced SQL: Data types
and schema’s-integrity constraints –authorization –embedded SQL –Dynamic SQL.

UNIT –III

Database design: ER- model –Mapping constraints-ER- diagrams – design issues –weak entities –extended
ER-features. Relational Database design: features of good relational design –functional dependencies -
decomposition using functional dependencies-BCNF description algorithm-multi value dependency

UNIT –IV

Data Storage: storage and file structures-overview physical storage media –Magnetic disk –storage access- file
organization -Data dictionary storage. Indexing and Hashing: ordered indices-Multiple key access-static
hashing -dynamic hashing-comparison of ordered indexing and hashing.

UNIT –V

Transaction management: transaction concept and transaction state-recovery failure classification-storage

structure-recovery and atomicity. Log based recovery –recovery with concurrent transaction-advanced
recovery techniques-backup systems. Database System Architecture: Centralised and client server architecture
– server system architecture – distributed systems –Network Types.
Textbook:

1. Database system concepts –Abraham, Silberschatz, Henry.F.Korth and S.sudarshan. 5 th edition – TMH

UNIT –I chapter 1.1-1.12, 2.1-2.6 UNIT –II chapter 3.1-3.10, 4.1-4.5

UNIT –III chapter 6.1-6.7, 7.1-7.3, 7.5-7.6

UNIT –IV chapter 11.1,11.2,11.5-11.8,12.1,12.2,12.6-12.8

UNIT –V chapter 15.1,15.2,17.1-17.6,17.8,17.9,20.1,20.220.4,20.5

Reference :

1.Database management systems –Alexis Leon,Mathews Leon

2. RDBMS using Oracle –Nileshshah, PHI.

YEAR: FIRST CORE PAPER VIII SEMESTER II

Hours: 5 14PCTC22 - OPERATING SYSTEM Credits: 4

Unit I
Operating Systems overview: Objectives and Functions – the Evaluation of OS –major achievements.
Processes: what is process- process states – process description- process control – process and threads –
microkernel’s.

Unit II:

Concurrency: Principles of Concurrency Mutual exclusion – Hardware support, semaphores – message

passing – readers/writers problem. Deadlock – Deadlock prevention, deadlock detection, deadlock avoidance.

Unit III

Memory management – memory management requirements – Memory partitioning, paging - segmentation.

Virtual Memory – hardware and control structure s – OS Software – windows memory management.

Unit IV

Scheduling – Types of processor scheduling, scheduling algorithms, multiprocessor scheduling – real time
scheduling – windows scheduling .

Unit V

I/O and files : i/o devices - organization of the I/O Function- OS design issues- , I/O buffering Disk
scheduling.

File Management – overview – file organization and access - File directories – File sharing – record blocking
– secondary storage management.

Text Books:
1. Operating systems – Internals and design principles , William Stallings , PHI Fifth edition.

Unit I Chapters 2.1 – 2.3 , 3.1 – 3.4, 4.1, 4.3

Unit II Chapters 5.1 – 5.3 , 5.5 5.6, 6.1- 6.4

Unit III Chapters 7.1 – 7.4 ,8.1, 8.2, 8.5

 Unit IV Chapters 9.1, 9.2,10.1, 10.2, 10.5

Unit V Chapters 11.1 – 11.5 , 12.1 –12.6

Reference:

1. Operating systems – Concept based approach by D.M.Dhamdhere, TMH second edition.

YEAR: FIRST CORE PAPER IX SEMESTER II

Hours: 5 14PCTC23 - COMPUTER GRAPHICS AND MULTIMEDIA Credits: 4

UNIT I

Computer Graphic Applications: Introduction - Applications - Graphic Devices: Introduction - Display

Systems - Hardware Components - Graphical User Interface: Introduction - Types of GUI - Designing a GUI -
Principles for good GUI Design - User Interface Engineering - GUI Examples - Creating Graphical Interface -
Scan Conversion: Line Drawing Algorithms - DDA Algorithm- General Bresenham’s Algorithm -
Bresenham’s Circle Generation Algorithm - Polygon Filling

UNIT II

Window and Clipping: Window & Viewports - Window to Viewport Mapping - Clipping - Sutherland Cohen
Subdivision Line Clipping Algorithm - Midpoint Subdivision Algorithm. 2D Transformation: Introduction -
Representations of Points in Matrix form - Representation of 2D points in any Matrix form - Transformation of
points - Transformation - 2D Rotation - Reflection - Scaling - Shearing

UNIT III

3DTransformation : Introduction - Representation of points - Representation of 3D object in Matrix form - 3D

Translation - 3D Rotation - 3D Reflection - 3D Scaling - 3D Shearing .3D Perspective Geometry: 3D Viewing
- Introduction - Terms related to Projection - Orthographic Projection - Axonometric Projection - Oblique
projection. Hidden Surfaces: Hidden Surface and Lines - Back face Detection - Back face Removal - Z Buffer
Algorithm -A Buffer Algorithm.

UNIT I V

Multimedia: An Overview - Introduction - Presentation and Production - Characteristics of Multimedia

Presentation - Hardware and Software Requirements - Uses of Multimedia - Visual Display Systems:
Introduction - Cathode Ray Tube - Video Adapter Card - Video Adapter Cable - Liquid Crystal Display -
Plasma Display Panel. Text: Introduction - Types - Unicode Standard - Font - Insertion of text - Text
Compression - File formats. Image: Introduction Standards - Color Management Systems - File formats

UNIT V

Audio: Introduction - Nature - Fundamental Characteristics of sound - Elements of audio systems - MIDI -
Sound card - Audio File formats and CODECs. Video: Introduction Analog Video Camera - Transmission of
video signals - Video signal formats - Television broadcasting standards - Digital Video - Digital Video
Standards - Video File formats & CODECs. Compression: Introduction - CODEC -Types - Lossless
Compression Techniques - Lossy Compression Techniques - JPEG Image Coding Standard - MPEG Standards
Overview

Text Book

1. Computer Graphics , ISRD Group, Tata Mc Graw Hill, 2006

2. Principles of Multimedia, Ranjan Parekh, Tata Mc Graw Hill, 2006

Reference

1. Computer Graphics, Multimedia and Animation, Malay K.Pakhira, PHI, 2008

2. Computer Graphics, Donold Hearn, Pauline Basker, PHI, 2007

YEAR: FIRST ELECTIVE PAPER I SEMESTER II

Hours: 5 14PCTE21 - DATA MINING AND WAREHOUSING Credits: 4

UNIT - I
Data warehousing components-Introduction: Overall Architecture-Data warehouse database-
Sourcing, Acquisition, Cleanup and Transformation tools-Metadata. Access Tools: Accessing and
Visualizing Information: Tool Taxonomy-Query and Reporting tools-Applications-OLAP tools-Data
mining tools. Data Marts-Data Warehouse Administration and Management-Impact of the Web-
Approaches to using the Web.

UNIT-II
Data Mining- The Mining Analogy-Measuring Data Mining Effectiveness-
(Accuracy- Speed-Cost Embedding-Data Mining into a Business Process)-Data Mining
Methodology.

UNIT -III
Classical Techniques-Statistics, Neighbourhoods and Clustering. Next Generation Techniques- Trees,
Network rules-When to use Data Mining.

UNIT-IV
The Business Value - Customer Profitability, Customer Acquisition, Cross Selling, Customer
Retention-Customer Segmentation.

UNIT-V
Business Intelligence and Information Mining- Text Mining and Knowledge Management- Text
Mining Technologies- Text Mining Products-Conclusion.

TEXTBOOK
Alex Berson, Stephen Smith & Kurt Thearling, "Building Data Mining
Applications for CRM ",Tata McGraw Hill Edition, 2000.
YEAR: FIRST ELECTIVE PAPER I SEMESTER II

Hours: 5 14PCTE22 - DIGITAL IMAGE PROCESSING Credits: 4

UNIT I
Introduction: What is Digital image processing – the origin of DIP – Examples of fields that use DIP
– Fundamentals steps in DIP – Components of an image processing system. Digital Image
Fundamentals: Elements of Visual perception – Light and the electromagnetic spectrum – Image
sensing and acquisition – Image sampling and Quantization – Some Basic relationship between Pixels
– Linear & Nonlinear operations.

UNIT II
Image Enhancement in the spatial domain:- Background – some basic Gray level Transformations –
Histogram Processing – Enhancement using Arithmetic / Logic operations Basics of spatial filtering –
Smoothing spatial filters – Sharpening spatial filters – Combining spatial enhancement methods.

UNIT III
Image Restoration: A model of the Image Degradation / Restoration Process – Noise models –
Restoration is the process of noise only – Spatial Filtering – Periodic Noise reduction by frequency
domain filtering – Linear, Portion – Invariant Degradations – Estimating the degradation function –
Inverse filtering – Minimum mean square Error Filtering – Constrained least squares filtering –
Geometric mean filter – Geometric Transformations.

UNIT IV
Image Compression: Fundamentals – Image compression models – Elements of Information Theory –
Error Free compression – Lossy compression – Image compression standards.

UNIT V
Image Segmentation: Detection and Discontinuities – Edge Linking and Boundary deduction –
Threshold – Region-Based segmentation – Segmentation by Morphological watersheds – The use of
motion in segmentation.

REFERENCE BOOKS
1. Rafael C. Gonzalez, Richard E. Woods, “Digital Image Processing”, Second Edition, PHI/Pearson
Education.
2. B. Chanda, D. Dutta Majumder, “Digital Image Processing and Analysis”, PHI, 2003.
3. Nick Efford, “Digital Image Processing a practical introducing using Java”, Pearson
Education, 2004.
YEAR: FIRST ELECTIVE PAPER I SEMESTER II

Hours: 5 14PCTE23 - PROGRAMMING IN JAVA Credits: 4

Unit I
Introduction to Java - Features of Java - Object Oriented Concepts - Lexical Issues - Data Types -
Variables - Arrays - Operators - Control Statements.
Unit II
Classes - Objects - Constructors - Overloading method - Access Control - Static and fixed methods -
Inner Classes - String Class - Inheritance - Overriding methods - Using super- Abstract class.
Unit III
Packages - Access Protection - Importing Packages - Interfaces - Exception Handling - Throw and
Throws - Thread - Synchronization - Messaging - Runnable Interface - Inter thread Communication -
Deadlock - Suspending, Resuming and stopping threads - Multithreading.
Unit IV
I/O Streams - File Streams - Applets - String Objects - String Buffer - Char Array - Java Utilities -
Code Documentation.
Unit V
Networks basics - Socket Programming - Proxy Servers - TCP/IP Sockets - Net Address - URL -
Datagrams - Working with windows using AWT Classes - AWT Controls - Layout Managers and
Menus.

TextBook
1. Cay S.Horstmann, Gary Cornell - Core Java 2 Volume I - Fundamentals,5th Edn. PHI,2000.
2. P. Naughton and H. Schildt - Java2 (The Complete Reference) - Third Edition,TMH 1999.
3. K. Arnold and J. Gosling - The Java Programming Language - Second Edition, Addison Wesley,
1996.
YEAR: FIRST CORE PAPER X SEMESTER II

Hours: 5 14PCTC2P - JAVA PROGRAMMING LAB Credits: 5

1. Arrays and Flow – Control statements.

2. Single Inheritance.
3. Multiple Inheritances.
4. Runtime Exception & I/O Exception.
5. Package Creation.
6. Multithreading.
7. File Creation.
8. GUI Components ( Label, Checkbox, Menus, Texts etc)
9. Event Handling (Focus events, Key events, Paint events, Text events, Mouse events,
Windows events etc.)
10. Animation and Images.
11. Designing web pages using static HTML.
12. Designing web pages using JAVA Applet.
13. Designing web pages with CGI programming (Java script, Perl, VB script)
14. Implementing a simple HTML browser using Java.
15. Designing web page that access a database via JDBC.

Reference:

1. Java 2: The Complete Reference, Fifth Edition by Herbert Schildt (Author)

2. Core JAVA 2 – Volume I and II –by Cay S. Horstmanin and Gary Cornell , Sun micro systems Press.
 YEAR: FIRST CORE PAPER XI SEMESTER II

Hours: 5 14PCTC2Q - OS AND NETWORK LAB Credits: 5

1. write a shell script to count number of user’s login and print first login user
2. write a shell script to get your name and greet you depending on time
3. write a shell script to get three argument from the command line operation 1, operation 2 and the
operator and perform arithmetic operations
4. write a shell script to check the attributes of a file
5. write a shell script to all files whose size is greater than specific size
6. write a shell script that searches for a particular pattern in files and display the name of such files
7. Create a database file and find answer for various queries.
8. write a shell script that display the calendar for present month, current working directory, the files
with the extension as .sh
9. Write a shell script that checks if the content of two files is same. If so, delete the second file
10. write a shell script that counts the number of blank lines in a file, count how many lines have a
text ‘new’
11. write a shell script that copies files in a directory and its subdirectory to another directory
12. write a shell script that changes the text color
13. Design TCP Client and Server application to transfer file.
14. Design TCP iterative Client and Server application to reverse the given input sentence
15. Design UDP Client and Server application to reverse the given input sentence.
16. Design UDP Client Server to transfer a file.
17. Design a RPC application to add and subtract a given pair of integers.
18. Write a program using I/O system calls of Unix
19. Write a c program to simulate Unix commands like ls,grep
20. Given a list of processes, their CPU burst times and arrival times, display/print the ghatt chat for
FCFS and SJF.
21. Given a list of processes, their CPU burst times and arrival times, display/print the ghatt chat for
Priority and Round Robin techniques
22. Implement some memory management schemes
YEAR: SECOND CORE PAPER XII SEMESTER III

Hours: 5 14PCTC31 - SOFTWARE ENGINEERING Credits: 4

Unit I

The evolving Role of Software- software – The changing Nature of Software Legacy Software
– Software Myths .Prescriptive Models – The water fall Model – Incremental process Models
Evolutionary process Models

Unit II

Software Engineering Practice – Communication Practices – Planning Practices- Modeling

Practises – Construction Practice.A Bridge to design and Construction - Requirements Engineering
Tasks – Eliciting Requirements – Developing Use – Cases – Building the Analysis Model .
Requirements Analysis – Analysis Modeling approaches – Data Modeling Concepts – Object
Oriented Analysis – Scenario – Based Modeling – Flow Oriented Modeling – Class Based Modelling
– Creating a behavioural Model.

Unit III

Design within the context of Software Engineering – Design process and Design Quality –
Design concepts – The Design Models – Pattern Based Software Design. Software Architecture –
Data Design – Architectural Styles and Patterns – Architectural Design – Assessing Alternative
Architectural Design- Mapping Data Flow into a Software Architecture.What is a Component –
Designing class based Components- Conducting Component-Level Design – Object Constraint
Language – Designing Conventional Components. The Golden Rules – User Interface Analysis and
Design – Interfaces Anlaysis Interface Design steps – Design Evaluation.

Unit IV

A Strategic approach to software Testing – Strategic Issues – Test Strategies conventional

software – Test Strategies for Object Oriented software – Validation Testing – System Testing – The
Art of Debugging. Software Testing Fundamentals – Black- Box and White Box Testing - Basis path
Testing- Control Structure Testing- Black – Box Testing- Object Oriented Testing Methods – Testing
Methods applicable at the Class Level Interclass test case Design – Testing for specialized
Environments, Architectures and Applications – Testing pattern.

Unit V

Software Quality – A Framework for Product Metrics- Metrics for the analysis model-
Metrics for the design Model- Metrics for source code – Metrics for testing- Metrics for Maintenance.

Attributes of Web-based Systems and Applications – WebApp Engineering Layer - The Web
Engineering Process – Web Engineering Best Practices. Formulating Web-based Systems- Planning
for Web Engineering Projects- Web Engineering Team – Project Management Issues for Web
Engineering – Metrics for Web Engineering and WebApp- “Worst Practices” for WebApp Projects.

Text Book:

Software Engineering, A Practitioners Approach: Roger S Pressman – Tata MCGraw Hill

200 , VI Edition.

Unit – I Chapter – 1 1.1-1.5 , Chapter – 3 3.1,3.2, 3.3, 3.4(upto 3.4.4)

Unit – II Chapter – 5 5.1 – 5.5 , Chapter – 7 7.1 – 7.3,Chapter – 8 8.1 -8.7

Unit - III Chapter – 9 9.1 – 9.4 , Chapter – 10 10.1 – 10.4 , 10.6

Unit – IV Chapter – 13 13.3 – 13.6 , Chapter – 14 14.1 – 14.7

Unit – V Chapter – 15 15.1-15.4, Chapter – 16 16.1 – 16.3

Reference Books:

1. Software Engineering Concepts – Richard Fairley – TMH 30th reprint 2008

2. Object Oriented Software Engineering, Leth Bridge, Timochy, and TMH 2004.
YEAR: SECOND CORE PAPER XIII SEMESTER III

Hours: 5 14PCTC32 - DATA COMMUNICATIONS AND NETWORKS Credits: 4

Unit I

Introduction: A Brief History – Applications – Computer Networks – Categories of Networks –

Standard and Standards Organization – Network Architecture – Open systems and OSI Model –
TCP/IP Architecture.

Communication Media and Data Transmission: Fourier Analysis – Analog and Digital Data
Transmission – Modulation and Demodulation – Transmission Media – Wireless Communications -
Data Transmission Basics – Transmission Mode – Interfacing – Multiplexing

Data Link Control and Protocol Concepts: Flow Control – Error Control – Asynchronous
Protocols – Synchronous Protocol-High-level Data Link Control (HDLC)

Unit II

Local Area Networks: Types of Networks and Topology – LAN Transmission Equipment – LAN
Installation and performance – Ethernet: IEEE Standard 802.3 – Token Bus: IEEE 802.4 – Token
Ring: IEEE Standard 802.5 – Fibre Distributed Data Interface (FDDI) – Distributed Queue Dual Bus
(DQDB): IEEE Standard 802.6 – LAN Operating Systems and Protocols – Ethernet Technologies

Wide Area Networks: WAN Transmission Methods – WAN Carrier Types – WAN Transmission
Equipments – WAN Design and Multicast Consideration – WAN Protocols.

Unit III

Integrated Services and Routing Protocols: Integrating Services – ISDN Topology – ISDN
Topology – ISDN Protocols - Broadband ISDN – Asynchronous Transfer Mode (ATM) – Principal
Characteristics of ATM – Frame Relay – Comparison of ISDN, ATM and Frame Relay

Wireless LAN:WLAN Applications – Wireless LAN Requirements – Planning for Wireless LANs –
Wireless LAN Architecture – IEEE 802.11 Protocol Layer – IEEE 802.11 Physical Layer –
Designing the Wireless LAN Layout – WAP Services.
Unit IV

Internetworking: Principles of Internetworking – Routing Principles – Internetwork Protocols (IP) –

Shortcomings of IPv4 – IP Next Generation

TCP Reliable Transport Service: Transport Protocols – The Service TCP Provides to
Applications – End-to-End Service and Datagram – Transmission Control Protocol – User Datagram
Protocol

Unit V

Network Applications: Client-Server Model – Domain Name System (DNS) – Telnet – File
Transfer and Remote File access – Electronic Mail – World Wide Web (WWW)

Network Management: Goal of Network Management – Network Management Standards –

Network Management Model – infrastructure for Network Management – Simple Network
Management Protocol(SNMP).

Text Book:

1. Data Communications and Computer Networks – Third Edition, Brijendra Singh, PHI,
2011

Unit I – Chapter 1.1 – 1.8, 2.5

Unit II – Chapter 6, 7

Unit III – Chapter 8.1 – 8.7, 9.2 – 9.9

Unit IV – Chapter 10, 11

Unit V – Chapter 12, 13

Reference:

1. Data Communications and Networking – Behrouzan A.Forouzan, TMH, 2005.

2. Data Communications and Computer Networks – Prakash C.Gupta, PHI, 2005

3. Data and Computer Communications – William Stallings, PHI, 2007

YEAR: SECOND CORE PAPER XIV SEMESTER III

Hours: 5 14PCTC3P - DOT NET PROGRAMMING LAB Credits: 5

HTML

1. To Write a Time Table Program by using Html Tags.

2. To Create a E-Mail Registration Form by using Html Tags.

VB DOT NET

3. To Write a Constructor & Destructor Program by using Console Application in

Vb.net.

4. To Write a Inheritance Program by using Console Application in Vb.net.

5. To Create a Procedure by using Windows Application in Vb.net.

6. To Create a Validation Form by using Windows Application in Vb.net

7. To Write a String Handling Program in Vb.net

8. To Create a Structure by using Console Application in Vb.net.

ASP DOT NET

9. To Write a Validation Control Program by using Asp.net.

10. To Create a Calendar Control by using Asp.net

11. To Create a Adrotator Control by using Asp.net.

12. To Create Web Service by using Asp.net.

13. To Create a Database Connectivity by using Asp.net.

C# DOT NET

14. To write a Program to Print Fibonacci Numbers below 100 in C#.net

15. To Write a Program to Reverse a String in C#.net

16. To Write a Program to find a LCM of 2 Numbers in C#.net

17. To Write a Program that implements Bubble Sort in C#.net.

YEAR: SECOND CORE PAPER XV SEMESTER III

Hours: 5 14PCTC3Q- OPEN SOURCE TECHNOLOGY USING PHP LAB Credits: 5

1. Write a program to containing colours and colour codes generated by mixing PHP with
HTML.

2. Building the program to convert rupees to dollar’s value converter using PHP.

3. To testing the Odd and Even numbers using PHP.

4. Write the program in PHP to processing a member registration form.

5. Write a PHP script to find the value in an array. a. Removing duplicate b. Randomizing
reversing arrays c. Searching arrays d. Sorting arrays e. Merging arrays f. comparing arrays

6. Create a web form for the user to enter his or her date of birth to find the age.

7. Write a PHP script to perform the calculator functions using user defined functions and form
inputs

8. Write a program to encrypt the plain text using PHP.

9. Construct the web form to configure reading and writing files using PHP.

10. To create the photo gallery in PHP.

11. Adding a employees to a database and display employee list using PHP and MySQL.

12. To create personal to do list using PHP.

13. Build a login form in PHP using MySQL.

14. Reading and writing XML configuration files in PHP.

15. Write a program to tracking previous visit to a page.

16. Design a web form for place on order validating input using PHP
YEAR: SECOND ELECTIVE PAPER II SEMESTER III

Hours:4 14PCTE31 - CLOUD COMPUTING Credits: 4

UNIT – I

Cloud Computing Overview – What Is Cloud Computing? – Cloud Components - Applications –

Storage-Database Services-Intranets And The Cloud-Components-Hypervisor Applications-First
Movers In The Cloud. When You Can Use Cloud Computing - Scenarios – Benefits: Scalability ,
Simplicity , Knowledgeable Vendors – More Internal Resources ,Security, Limitations – Sensitive
Information - Application Development – Security Concerns - Privacy Concern With A Third Party -
Security Level Of Third Party - Security Benefits , Regularity Issues

UNIT - II

Cloud Computing With The Titans – Google-EMC-Netapp-Microsoft-Amazon-Salesforce-IBM-

Partnerships. Cloud Computing Service- Infrastructure As A Service - Platform As A Service-
Software As A Service- Software Plus Services-How Those Applications Help – Operational
Benefits, Economic Benefits – Tips For Evaluating Saas- Staffing Benefits-Deleting Data Center-
Thomson Reuters – Their Cloud Use-Using The Cloud-Cloud Computing And Web 2.0 –
Applications And The Cloud.

UNIT - III

Cloud Computing Technology - Hardware And Infrastructure – Clients, Security , Network, Services.
Accessing The Cloud – Platforms- Web Applications – Web Apis – Web Browsers- Cloud Storage –
Overview-Cloud Storage Providers.

UNIT – IV

Standards – Application, Client, Infrastructure, Service. Software As A Service – Overview- Driving

Forces-Company Offerings-Industries. Software Plus Services – Overview-Mobile Device
Integration-Providers-Microsoft Online.
UNIT -V

Local Clouds And Thin Clients - Virtualization – Server Solutions- Thin Clients- Migrating To The
Cloud-Cloud Services For Individuals-Cloud Services Aimed At The Mid-Market-Enterprise Class
Cloud Offerings – Migration.

Text Book:

1. Cloud computing a practical approach - Anthony T.Velte , Toby J. Velte Robert Elsenpeter
TATA McGraw- Hill , New Delhi – 2010
Chapters
1. Unit I : Chapters 1,2
2. Unit II : Chapters 3,4
3. Unit III : Chapters 5,6,7
4. Unit IV : Chapters 8, 9, 10
5. Unit V : Chapters 12,13

Reference
1. Cloud Computing: Web-Based Applications That Change the Way You Work and Collaborate
Online - Michael Miller – 2008,Pearson.
2. Cloud Computing, John W. Ritting House and James F Ramsome, CRC Press, 2012.
YEAR: SECOND ELECTIVE PAPER II SEMESTER III

Hours: 4 14PCTE32 - COMPILER DESIGN Credits: 4

Unit I

Introduction to Compilers: Compilers and Translators – Lexical analysis – Syntax analysis –

Intermediate code generation – Optimization – code generation – Bookkeeping – Error handling –
compiler writing tools.

Finite Automata and Lexical Analysis: The role of the lexical analyzer – the design of the lexical

Analyzers – Regular expressions – Finite automata – From regular expressions to finite automata –
Minimizing the number of states of a DFA – A language for specifying lexical analyzers –
Implementation of a lexical analyzer.

Unit II

The syntactic specification of Programming Languages: Context – free grammars – Derivations and
parse trees – Capabilities of context – free grammars.

Basic Parsing Techniques: Parses – Shift – reduce parsing – Operator – precedence parsing – Top-
down parsing – Predictive parsers.

Automatic construction of efficient parsers: LR parsers – The canonical collection of LR (0) items -
Constructing SLR parsing tables – Constructing LALR parsing tables.

Unit III

Syntax – Directed translation: Syntax Directed translation schemes – Implementation of syntax –

directed translators – Intermediate code – Postfix notation – Parse trees and syntax trees – Three –
address code, quadruples, and triples – Translation of assignment statements – Boolean expressions –
Statements that alter the flow of control – Postfix translations – Translation with a top-down parser.

Unit IV

Symbol Tables: The contents of a symbol table – Data structures for symbol tables – Representing
scope information.
Run time storage administration: Implementation of a simple stack allocation scheme –
Implementation of block – structured languages – Storage allocation of FORTAN - Storage allocation
in block – structured languages.

Error Detection and Recovery: Errors – lexical – phase errors – Syntactic phase errors – Semantic
errors.

Unit V

Introduction to code optimization:- The principal sources of optimization – loop optimization– The
DAG Representation of basic blocks.

Code generation: object programs – Problems in code generation – A machine model – A simple
code generator – Register allocation and assignment – Code generation from DAG’s –Peephole
optimization.

Text book

1. “Principles of Compiler Design” by Alfred V. Aho Jeffrey D. Ullman, Narosa Publishing

House, 1989.
Unit I : 1.1 to 1.11, 3.1 to 3.8

Unit II : 4.1 to 4.3, 5.1 to 5.5, 6.1 to 6.4

Unit III : 7.1 to 7.11

Unit IV : 9.1 to 9.3, 10.1 to 10.4, 11.1 to 11.4

Unit V : 12.1 to 12.3, 15.1to 15.7

Reference Books

1. “Compiler Construction Principles and Practice”, by Dhamdhere D. M, 1981, Macmillan

India.
2. “Compiler Design”, by Reinhard Wilhelm, Director Mauser, 1995, Addison Wesley.
YEAR: SECOND ELECTIVE PAPER II SEMESTER III

Hours:4 14PCTE33 - ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS Credits: 4

UNIT I
The AI problems – AI techniques – Problems, problems space & search – Defining the
problem as a state Search – Production systems – Problem characteristics – Heuristic search
techniques – Generate & test – Hill climbing – Best first search. Problem reduction – Constraint
satisfaction – Means ends analysis.

UNIT II

Knowledge representation issues – Representations and mappings – Approaches to knowledge

representation – Issues in knowledge representation – Frame problem - Using Predicate Logic –
Representing simple facts & logic – Representing instance & IS a Relationships – Computable
functions & Predicates – Use of the predicate calculus in AI – Resolution – Natural deduction.

UNIT III
Representing knowledge using Rules – Procedural verses declarative knowledge - logic
programming – forward versus backward reasoning – matching – control knowledge -Symbolic
Reasoning under uncertainty – nonmonotonic reasoning – Logic for Nonmonotonic reasoning –
Implementation Issues – Augmenting a problem solver - Implementation of depth first & breadth
first search.

UNIT IV
Statistical reasoning – Bayes’ theorem – Certainty factors & Rule based Systems – Bayesian
Networks – Dempster Shafer theory – Fuzzy logic. Game playing : Mini – max procedure – Adding
Alpha – Beta cutoffs – Additional refinements – Iterative deepening.
UNIT V
Expert Systems: Introduction – Advantages – General concepts – Characteristics – The
development of expert system technology – Application and domain – Languages, Shell and Tools –
Elements of expert system – Production system – Procedural and nonprocedural paradigms –
Artificial neural system.

Test Books

1. Elaine Rich & Kevin Knight, Artificial Intelligence,Tata McGraw Hill – 2nd Edition, 1991.

Unit 1 Chapters: 1.1 & 1.3, 2.1 to 2.3, 3.1 to 3.6.

Unit 2 Chapters: 4.1 to 4.4, 5.1 to 5.5.

Unit 3 Chapters: 6.1 to 6.5, 7.1 to 7.6.

Unit 4 Chapters: 8.1 to 8.5, 12.1 to 12.5.

2. Giarratano & Riley, Expert Systems Principles & Programming, Thomson Books & Vikas

Publishing House.

Unit 5 Chapters: 1.1 to 1.10.

Reference Book

1. David W. Rolston, Principles of Artificial Intelligence & Expert Systems Development,

McGraw Hill.
YEAR: SECOND NON MAJOR ELECTIVE SEMESTER III

Hours:6 14PCTN31 - THE ABC’S OF COMPUTERS Credits: 5

Unit I
Computer basics: Algorithms – simple model of computer – characteristics – problem
solving using computers. Data Representation: Representation of characters in computers – integers
– fractions – Hexadecimal representation of numbers – decimal to binary conversion – error detecting
codes. Input and Output units: Description of computer input units – other input methods – output
units. Computer Memory: Memory cell – memory organization – ROM – serial access memory –
physical devices used to construct memories – magnetic hard disk – FDD – CD-ROM – magnetic
tape drive. Processor: Structure – of instructions – description of a processor – machine language
program – algorithm to simulate – hypothetical computer.
Unit II
Binary Arithmetic Binary addition and subtraction – signed numbers – two’s complement –
2’s complement addition and subtraction – Binary multiplication and division – floating point
representation – arithmetic operations with normalized floating point numbers. Logic Circuits:
Introduction – switching circuits – basic gates – Boolean function – postulates – duality principles –
theorems – precedence of operators- venn diagram – truth tables – canonical forms of for Boolean
function – logic circuits – parallel and serial adders – physical devices – transistors – IC. Computer
Architecture: Introduction – processor and memory communication – I/O to processor
communication – Interrupt structures – bus architecture of personal computer – multiprogramming –
processor features – RISC – virtual memory.
Unit III
Programming Languages: Assembly language – high level programming languages –
compiling high level language program – conclusions. Operating systems: Need – batch,
multiprogramming, time sharing operating systems – facilities of operating systems – personal
computer OS – Unix – micro kernel – On-line and real time systems. Micro computers: Ideal and
actual micro computer – memory system – configuration – evolution – purpose – special purpose of
micro computer software – applications – smart cards and RFID .
Unit IV
Computer generation and classification: Generations – morre’s law – classification of
computers – distributed computer system – parallel computers. Voice and Data Communications:
types of communications with analog computers – characteristics of communication channels –
allocation – communication media – telephone networks – wireless communications – cellular
communication systems- establishing paths – ATM networks. Computer Networks: Need – internet
and WWW – communication protocols – LAN – token ring – interconnecting networks – the frame
of internet technology.
Unit V
Computer Graphics: Applications – display devices-overview of display method-Raster scan
display processing unit-input devices for interactive graphics-programmers models of interactive
graphics systems-image acquisition and storage-storage formats for pictures-image acquisition with a
digital camera. Multimedia Data Acquisition and Processing: Capturing a moving image with a
video camera-Compression of video data-MPEG compression standard-Acquiring and storing audio
signals-Compression of audio signals-audio signal processing-speech processing. Emerging
Computing environments: current computing scenario-peer to peer-grid computing-cloud
computing-utility computing.

Textbook:

1. V. Rajaraman “Fundamentals of Computers”, Prentice Hall of India, 2011.

Unit I Chapters 1 to 5 Unit II Chapters 6, 7, 8
Unit III Chapters 9, 10, 11 Unit IV Chapters 12, 13, 14
Unit V Chapters 15, 16, 17

Reference:

1. “Introduction to Computers” by Peter Norton , TMH sixth edition

2. Research and Development Wing, ITL Education, “IT Tools and Applications”, Macmillan
India Ltd., 2004.