www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.

in

ACADEMIC REGULATIONS &

COURSE STRUCTURE

te s
For
d a
COMPUTER SCIENCE
U p
t y
(Applicable for batches admitted from 2016-2017)

i
e r s
n i v
U
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA
KAKINADA - 533 003, Andhra Pradesh, India

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

I Semester
S.No. SUBJECT L P C
1 ADVANCED DATA STRUCTURES 4 -- 3
2 FORMAL LANGUAGES AND AUTOMATA THEORY 4 -- 3
3 COMPUTER ORGANIZATION 4 -- 3
4 DATABASE INTERNALS 4 -- 3
5 ADVANCED OPERATING SYSTEM 4 -- 3
6 DATA WAREHOUSING AND DATAMINING 4 -- 3
7 CS LAB 1 -- 3 2
Total Credits 20

II Semester
S.No. SUBJECT L
te s P C
1
2
3
CYBER SECURITY
BIG DATA ANALYTICS
WEB TECHNOLOGIES
d a 4
4
4
--
--
--
3
3
3
4

5
ADVANCED UNIX PROGRAMMING
Elective – 1
1. SOFTWARE ENGINEERING
2. ARTIFICIAL INTELLIGENCE
U p 4

4
--

--
3

3
3. COMPILER DESIGN
4. MACHINE LEARNING

i t y
s
Elective - 2
1. OBJECT ORIENTED ANALYSIS AND DESIGN
6 2. PARELLEL ALGORITHMS
3. CLOUD COMPUTING

e r 4 -- 3

v
4. IMAGE PROCESSING
7 CS LAB 2

III Semester
n i Total Credits
-- 3 2
20

U
S. No.
1
2
3
Seminar – I
Project Work Part - I
Subject
Comprehensive Viva-Voce
L
--
--
--
P
--
--
--
Credits

2
2

16
Total Credits 20

IV Semester

S. No. Subject L P Credits

1 Seminar – II -- -- 2
2 Project Work Part - II -- -- 18
Total Credits 20

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

L P C

I Year – I SEMESTER 4 0 3

ADVANCED DATA STRUCTURES AND ALGORITHM ANAYLSIS

UNIT- I:
Introduction to Data Structures, Singly Linked Lists, Doubly Linked Lists, Circular Lists-Algorithms.
Stacks and Queues: Algorithm Implementation using Linked Lists.

UNIT-II:

te s
a
Searching-Linear and Binary Search Methods. Sorting-Bubble Sort, Selection Sort, Insertion Sort, Quick
Sort, Merge Sort. Trees- Binary trees, Properties, Representation and Traversals (DFT,BFT),Expression

d
Trees(Infix,prefix,postfix).Graphs-Basic Concepts , Storage Structures and Traversals.

UNIT- III:

U p
Dictionaries, ADT, The List ADT, Stack ADT, Queue ADT, Hash Table Representation, Hash
Functions, Collision Resolution-Separate Chaining, Open Addressing-Linear Probing, Double Hashing.

UNIT- IV:

i t y
s
Priority queues- Definition, ADT, Realising a Priority Queue Using Heaps, Definition, Insertion,

r
Deletion .Search Trees- Binary Search Trees, Definition, ADT, Implementation, Operations-Searching,
Insertion, Deletion.

e
UNIT –V:

n i v
Search Trees- AVL Trees, Definition, Height of AVL Tree, Operations, Insertion, Deletion and
Searching. Search Trees- Introduction to Red-Black and Splay Trees, B-Trees, Height of B-Tree,

U
Insertion, Deletion and Searching, Comparison of Search Trees.

TEXT BOOKS:
1. Data Structures: A Pseudocode Approach, 2/e, Richard F.Gilberg, Behrouz A. Forouzon,
Cengage.
2. Data Structures, Algorithms and Applications in java, 2/e, Sartaj Sahni, University Press.

REFERENCES BOOKS:
1. Data Structures and Algorithm Analysis, 2/e, Mark Allen Weiss, Pearson.
2. Data Structures and Algorithms, 3/e, Adam Drozdek, Cengage.
3. C and Data Structures: A Snap Shot Oriented Treatise Using Live Engineering Examples,
N.B.Venkateswarulu, E.V.Prasad, S Chand & Co, 2009.

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

L P C

I Year – I SEMESTER 4 0 3

FORMAL LANGUAGE AND AUTOMATA THEORY

UNIT – I: Finite Automata

Why Study Automata Theory? The Central Concepts of Automata Theory, Automation, Finite
Automation, Transition Systems, Acceptance of a String by a Finite Automation, DFA, Design of DFAs,
NFA, Design of NFA, Equivalence of DFA and NFA, Conversion of NFA into DFA, Finite Automata
with E-Transition, Minimization of Finite Automata, Mealy and Moore Machines, Applications and

s
Limitation of Finite Automata.

te
UNIT – II: Regular Expressions
Regular Expressions, Regular Sets, Identity Rules, Equivalence of two Regular Expressions,

d a
Manipulations of Regular Expressions, Finite Automata, and Regular Expressions, Inter Conversion,
Equivalence between Finite Automata and Regular Expressions, Pumping Lemma, Closers Properties,
Applications of Regular Expressions, Finite Automata and Regular Grammars, Regular Expressions and
Regular Grammars.

UNIT – III: Context Free Grammars

U p
Formal Languages, Grammars, Classification of Grammars, Chomsky Hierarchy Theorem, Context Free

y
Grammar, Leftmost and Rightmost Derivations, Parse Trees, Ambiguous Grammars, Simplification of

t
Context Free Grammars-Elimination of Useless Symbols, E-Productions and Unit Productions, Normal

i
Forms for Context Free Grammars-Chomsky Normal Form and Greibach Normal Form, Pumping

s
Lemma, Closure Properties, Applications of Context Free Grammars.

e r
v
UNIT – IV: Pushdown Automata

i
Pushdown Automata, Definition, Model, Graphical Notation, Instantaneous Description Language

n
Acceptance of pushdown Automata, Design of Pushdown Automata, Deterministic and Non –
Deterministic Pushdown Automata, Equivalence of Pushdown Automata and Context Free Grammars

U
Conversion, Two Stack Pushdown Automata, Application of Pushdown Automata.

UNIT – V: Turning Machine and Computability

Turing Machine, Definition, Model, Representation of Turing Machines-Instantaneous Descriptions,
Transition Tables and Transition Diagrams, Language of a Turing Machine, Design of Turing Machines,
Techniques for Turing Machine Construction, Types of Turing Machines, Church’s Thesis, Universal
Turing Machine, Restricted Turing Machine. Decidable and Un-decidable Problems, Halting Problem of
Turing Machines, Post’s Correspondence Problem, Modified Post’s Correspondence Problem, Classes
of P and NP, NP-Hard and NP-Complete Problems.

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

TEXT BOOKS:
1. Introduction to Automata Theory, Languages and Computation, J.E.Hopcroft, R.Motwani and
J.D.Ullman, 3rd Edition, Pearson, 2008.
2. Theory of Computer Science-Automata, Languages and Computation, K.L.P.Mishra and
N.Chandrasekharan, 3rd Edition, PHI, 2007.

REFERENCE BOOKS:
1. Formal Language and Automata Theory, K.V.N.Sunitha and N.Kalyani, Pearson, 2015.
2. Introduction to Automata Theory, Formal Languages and Computation, Shyamalendu Kandar,
Pearson, 2013.

s
3. Theory of Computation, V.Kulkarni, Oxford University Press, 2013.
4. Theory of Automata, Languages and Computation, Rajendra Kumar, McGraw Hill, 2014.

a te
p d
y U
s i t
e r
n i v
U

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

L P

I Year – I SEMESTER 4 0

COMPUTER ORGANIZATION

s
UNIT -I:

te
Basic Structure Of Computers: Functional unit, Basic Operational concepts, Bus structures, System
Software, Performance, The history of computer development.

UNIT -II:
Machine Instruction and Programs:

d a
p
Instruction and Instruction Sequencing: Register Transfer Notation, Assembly Language Notation, Basic
Instruction Types,

U
Addressing Modes, Basic Input/output Operations, The role of Stacks and Queues in computer
programming equation. Component of Instructions: Logic Instructions, shift and Rotate Instructions

UNIT -III:

i t y
Type of Instructions: Arithmetic and Logic Instructions, Branch Instructions, Addressing Modes,
Input/output Operations

UNIT -IV:

e r s
v
INPUT/OUTPUT ORGANIZATION: Accessing I/O Devices, Interrupts: Interrupt Hardware,

i
Enabling and Disabling Interrupts, Handling Multiple Devices, Direct Memory Access,

n
Buses: Synchronous Bus, Asynchronous Bus, Interface Circuits, Standard I/O Interface: Peripheral
Component Interconnect (PCI) Bus, Universal Serial Bus (USB)

U
UNIT -V:
The MEMORY SYSTEMS: Basic memory circuits, Memory System Consideration, Read-Only
Memory: ROM, PROM, EPROM, EEPROM, Flash Memory, Cache Memories: Mapping Functions,
INTERLEAVING Secondary Storage: Magnetic Hard Disks, Optical Disks, Processing Unit:
Fundamental Concepts: Register Transfers, Performing An Arithmetic Or Logic Operation, Fetching A
Word From Memory, Execution of Complete Instruction, Hardwired Control,
Micro programmed Control: Microinstructions, Micro program Sequencing, Wide Branch Addressing
Microinstructions with next –Address Field

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

TEXT BOOKS:
1. Computer Organization, Carl Hamacher, Zvonks Vranesic, Safea Zaky, 5th Edition,
McGraw Hill.
2. Computer Architecture and Organization, John P. Hayes, 3rd Edition, McGraw Hill.

REFERENCE BOOKS:
1. Computer Organization and Architecture – William Stallings Sixth Edition, Pearson/PHI
2. Structured Computer Organization – Andrew S. Tanenbaum, 4th Edition PHI/Pearson
3. Fundamentals or Computer Organization and Design, - Sivaraama Dandamudi Springer Int.
Edition.

te s
d a
U p
i t y
e r s
n i v
U

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

L P C

I Year – I SEMESTER 4 0 3

DATABASE INTERNALS

UNIT- I:
Database System Applications, Purpose of Database Systems, View of Data – Data Abstraction,
Instances and Schemas, Data Models – the ER Model, Relational Model, Other Models – Database
Languages – DDL, DML, Database Access from Applications Programs, Transaction Management,

s
Data Storage and Querying, Database Architecture, Database Users and Administrators, History of
Database Systems. Introduction to Database design, ER diagrams, Beyond ER Design, Entities,

te
Attributes and Entity sets, Relationships and Relationship sets, Additional features of ER Model,
Conceptual Design with the ER Model, Conceptual Design for Large enterprises. Relational Model:

d a
Introduction to the Relational Model – Integrity Constraints Over Relations, Enforcing Integrity
constraints, Querying relational data, Logical data base Design, Introduction to Views – Destroying
/altering Tables and Views.

UNIT- II:

U p
Relational Algebra and Calculus: Relational Algebra – Selection and Projection, Set operations,

i t y
Renaming, Joins, Division, Examples of Algebra Queries, Relational calculus – Tuple relational
Calculus – Domain relational calculus – Expressive Power of Algebra and calculus. Form of Basic SQL

s
Query – Examples of Basic SQL Queries, Introduction to Nested Queries, Correlated Nested Queries,

r
Set – Comparison Operators, Aggregate Operators, NULL values – Comparison using Null values –

e
Logical connectives – AND, OR and NOT – Impact on SQL Constructs, Outer Joins, Disallowing
NULL values, Complex Integrity Constraints in SQL Triggers and Active Data bases.

UNIT- III:

n i v
Introduction to Schema Refinement – Problems Caused by redundancy, Decompositions – Problem
related to decomposition, Functional

U
Dependencies - Reasoning about FDS, Normal Forms – FIRST, SECOND, THIRD Normal forms –
BCNF –Properties of Decompositions- Loss less- join Decomposition, Dependency preserving
Decomposition, Schema Refinement in Data base Design – Multi valued Dependencies – FOURTH
Normal Form, Join Dependencies, FIFTH Normal form, Inclusion Dependencies.

UNIT- IV:
Overview of Transaction Management: The ACID Properties, Transactions and Schedules, Concurrent
Execution of Transactions – Lock Based Concurrency Control, Deadlocks – Performance of Locking –
Transaction Support in SQL. Concurrency Control: Serializability, and recoverability – Introduction to
Lock Management – Lock Conversions, Dealing with Dead Locks, Specialized Locking Techniques –
Concurrency Control without Locking. Crash recovery: Introduction to Crash recovery, Introduction to
ARIES, the Log , Other Recovery related Structures, the Write-Ahead Log Protocol, Check pointing,
recovering from a System Crash, Media recovery

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

UNIT-V:
Overview of Storage and Indexing: Data on External Storage, File Organization and Indexing –
Clustered Indexes, Primary and Secondary Indexes, Index data Structures – Hash Based Indexing, Tree
based Indexing, Comparison of File Organizations. Storing data: Disks and Files: -The Memory
Hierarchy – Redundant Arrays of Independent Disks. Tree Structured Indexing: Intuitions for tree
Indexes, Indexed Sequential Access Methods (ISAM) B+ Trees: A Dynamic Index Structure, Search,
Insert, Delete. Hash Based Indexing: Static Hashing, Extendable hashing, Linear Hashing, Extendable
vs.Linear Hashing.

TEXT BOOKS:
1. Database Management Systems, Raghu Ramakrishna, Johannes Gehrke, TMH, 3rd
Edition,2003.
2. Database System Concepts, A.Silberschatz, H.F. Korth, S. Sudarshan, McGraw hill, VI
edition, 2006.
3. Fundamentals of Database Systems 5th edition. Ramez Elmasri, Shamkant

te s
B.Navathe, Pearson Education, 2008.

REFERENCE BOOKS:
d a
U p
1. Database Management System Oracle SQL and PL/SQL,P.K.Das Gupta, PHI.
2. Database System Concepts ,Peter Rob & Carlos Coronel, Cengage Learning,2008.
3. Database Systems, A Practical approach to Design Implementation and Management Fourth

y
edition, Thomas Connolly, Carolyn Begg, Pearson education.

s i t
e r
n i v
U

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

L P C

I Year – I SEMESTER 4 0 3

ADVANCED OPERATING SYSTEMS

UNIT - 1:
Architectures of Distributed Systems - System Architecture types - issues in distributed operating
systems - communication networks - communication primitives. Theoretical Foundations - inherent
limitations of a distributed system - lamp ports logical clocks - vector clocks - casual ordering of
messages - global state - cuts of a distributed computation - termination detection. Distributed Mutual
Exclusion - introduction - the classification of mutual exclusion and associated algorithms - a
comparative performance analysis.

UNIT - 2:

te s
Distributed Deadlock Detection -Introduction - deadlock handling strategies in distributed systems -

d a
issues in deadlock detection and resolution - control organizations for distributed deadlock detection -
centralized and distributed deadlock detection algorithms -hierarchical deadlock detection algorithms.
Agreement protocols - introduction-the system model, a classification of agreement problems, solutions

p
to the Byzantine agreement problem, applications of agreement algorithms. Distributed resource
management: introduction-architecture - mechanism for building distributed file systems - design issues
- log structured file systems.

U
UNIT - 3:

i t y
Distributed shared memory-Architecture- algorithms for implementing DSM - memory coherence and
protocols - design issues. Distributed Scheduling - introduction - issues in load distributing -

s
components of a load distributing algorithm - stability - load distributing algorithm - performance

r
comparison - selecting a suitable load sharing algorithm - requirements for load distributing -task

e
migration and associated issues. Failure Recovery and Fault tolerance: introduction- basic concepts -

v
classification of failures - backward and forward error recovery, backward error recovery- recovery in

i
concurrent systems - consistent set of check points - synchronous and asynchronous check pointing and
recovery - check pointing for distributed database systems- recovery in replicated distributed databases.

U
UNIT - 4: n
Protection and security -preliminaries, the access matrix model and its implementations.-safety in matrix
model- advanced models of protection. Data security - cryptography: Model of cryptography,
conventional cryptography- modern cryptography, private key cryptography, data encryption standard-
public key cryptography - multiple encryption - authentication in distributed systems.

UNIT - 5:
Multiprocessor operating systems - basic multiprocessor system architectures - inter connection
networks for multiprocessor systems - caching - hypercube architecture. Multiprocessor Operating
System - structures of multiprocessor operating system, operating system design issues- threads- process
synchronization and scheduling. Database Operating systems :Introduction- requirements of a database
operating system Concurrency control : theoretical aspects - introduction, database systems - a
concurrency control model of database systems- the problem of concurrency control - serializability
theory- distributed database systems, concurrency control algorithms - introduction, basic
synchronization primitives, lock based algorithms-timestamp based algorithms, optimistic algorithms -
concurrency control algorithms, data replication.

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

TEXT BOOKS:

1. Mukesh Singhal, Niranjan G.Shivaratri, "Advanced concepts in operating systems: Distributed,

Database and multiprocessor operating systems", TMH, 2001

REFERENCE Books:

1. Andrew S.Tanenbaum, "Modern operating system", PHI, 2003

2. Pradeep K.Sinha, "Distributed operating system-Concepts and design", PHI, 2003.
3. Andrew S.Tanenbaum, "Distributed operating system", Pearson education, 2003

te s
d a
U p
i t y
e r s
n i v
U

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

L P C

I Year – I SEMESTER 4 0 3

DATA WAREHOUSING AND DATA MINING

UNIT - 1: DATA WAREHOUSING

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.

s
UNIT - II: BUSINESS ANALYSIS

te
Reporting and Query tools and Applications – Tool Categories – The Need for Applications –
Cognos Impromptu – Online Analytical Processing (OLAP) – Need – Multidimensional Data Model –
OLAP Guidelines – Multidimensional versus Multirelational OLAP – Categories of Tools – OLAP
Tools and the Internet.

d a
p
UNIT - III: DATA MINING
Introduction – Data – Types of Data – Data Mining Functionalities – Interestingness of Patterns –

U
Classification of Data Mining Systems – Data Mining Task Primitives – Integration of a Data
Mining System with a Data Warehouse – Issues –Data Preprocessing.

t y
UNIT - IV: ASSOCIATION RULE MINING AND CLASSIFICATION

i
Mining Frequent Patterns, Associations and Correlations – Mining Methods – Mining various Kinds

s
of Association Rules – Correlation Analysis – Constraint Based Association Mining – Classification

r
and Prediction – Basic Concepts – Decision Tree Induction – Bayesian Classification–Rule Based

e
Classification – Classification by Back propagation – Support Vector Machines –

v
Associative Classification – Lazy Learners – Other Classification Methods – Prediction.

n i
UNIT - V: CLUSTERING AND TRENDS IN DATA MINING
Cluster Analysis – Types of Data – Categorization of Major Clustering Methods – K-means–
Partitioning Methods – Hierarchical Methods – Density-Based Methods –Grid Based Methods –

U
Model-Based Clustering Methods – Clustering High Dimensional Data – Constraint – Based Cluster
Analysis – Outlier Analysis – Data Mining Applications.

TEXT BOOKS:
1. Alex Berson and Stephen J.Smith, “Data Warehousing, Data Mining and OLAP”, Tata
McGraw – Hill Edition, Thirteenth Reprint 2008.
2. Jiawei Han and Micheline Kamber, “Data Mining Concepts and Techniques”, Third
Edition, Elsevier, 2012.

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

REFERENCES:
1. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, “Introduction to Data Mining”, Person
Education, 2007.
2. K.P. Soman, Shyam Diwakar and V. Aja, “Insight into Data Mining Theory and Practice”,
Eastern Economy Edition, Prentice Hall of India, 2006.
3. G. K. Gupta, “Introduction to Data Mining with Case Studies”, Eastern Economy Edition,
Prentice Hall of India, 2006.
4. Daniel T.Larose, “Data Mining Methods and Models”, Wiley-Interscience, 2006.

te s
d a
U p
i t y
e r s
n i v
U

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

L P C

I Year – I SEMESTER 0 3 2

CSE LAB 1

DATA STRUCTURES PROGRAMS:

1. To implement Stacks& Queues using Arrays & Linked Lists
2. To implement Stack ADT, Queue ADT using arrays & Linked Lists

s
3. To implement Dequeue using Double Linked List & Arrays
4. To perform various Recursive & Non-recursive operations on Binary Search Tree

te
5. To implement BFS & DFS for a graph
6. To implement Merge & Heap sort of given elements
7. To perform various operations on AVL trees

d a
8. To implement Krushkal’s algorithm to generate a min-cost spanning tree

10. To implement functions of Dictionary using Hashing

OPERATING SYSTEM PROGRAMS:

U p
9. To implement Prim’s algorithm to generate min-cost spanning tree

i t y
1. Program to implement FCFS(First Come First Serve)scheduling Algorithms
2. Program to implement SJF(Shortest Job First)Scheduling Algorithm

s
3. Program to implement Priority Scheduling algorithm

r
4. Program to implement Round Robin Scheduling algorithm

e
5. Program to implement FIFO(First In First Out) Page Replacement Algorithm
6. Program to implement LRU(least Recently used)Page Replacement Algorithm

i v
7. Program to implement LFU(Least Frequently used)Page Replacement Algorithm
8. Write a program to implement how Disk Scheduling is done in operating system

n
9. Draw the appropriate C.P.U performance graphs for SJF Scheduling Algorithm

U
OPERATING SYSTEM PROGRAMS:
10. Program to implement FCFS(First Come First Serve)scheduling Algorithms
11. Program to implement SJF(Shortest Job First)Scheduling Algorithm
12. Program to implement Priority Scheduling algorithm
13. Program to implement Round Robin Scheduling algorithm
14. Program to implement FIFO(First In First Out) Page Replacement Algorithm
15. Program to implement LRU(least Recently used)Page Replacement Algorithm
16. Program to implement LFU(Least Frequently used)Page Replacement Algorithm
17. Write a program to implement how Disk Scheduling is done in operating system
18. Draw the appropriate C.P.U performance graphs for SJF Scheduling Algorithm

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

L P C

I Year – 2nd SEMESTER 4 0 3

CYBER SECURITY

UNIT - I:
Introduction:
Security Attacks (Interruption, Interception, Modification and Fabrication), Security Services
(Confidentiality, Authentication, Integrity, Non-repudiation, access Control and Availability)
and Mechanisms, A model for Internetwork security, Internet Standards and RFCs, Buffer
overflow & format string vulnerabilities, TCP session hijacking, ARP attacks, route table
modification, UDP hijacking, and man-in-the-middle attacks.

UNIT - II :
Conventional Encryption:

te
Conventional Encryption Principles, Conventional encryption algorithms, cipher block modes s of

Authentication, Secure Hash Functions and HMAC

d a
operation, location of encryption devices, key distribution Approaches of Message

UNIT - III:

U
Theorems, The Chinese Remainder theorem, Discrete logarithms p
Number Theory: Prime and Relatively Prime Numbers, Modular Arithmetic, Fermat’s and Euler’s

Public key: Public key cryptography principles, public key cryptography algorithms, digital

y
signatures, digital Certificates, Certificate Authority and key management Kerberos, X.509
Directory Authentication Service

UNIT - IV:

s i t
r
IP Security: IP Security Overview, IP Security Architecture, Authentication Header,
Encapsulating Security Payload, Combining Security Associations and Key Management

e
Transport Level Security: Web Security Requirements, Secure Socket Layer (SSL) and

v
Transport Layer Security (TLS), Secure Electronic Transaction (SET)

i
Email Privacy: Pretty Good Privacy (PGP) and S/MIME.

UNIT - V:
n
U
Intrusion Detection: Intruders, Intrusion Detection systems, Password Management.
Malicious Software: Viruses and related threats & Countermeasures.
Fire walls: Firewall Design principles, Trusted Systems.

TEXT BOOKS:
1. Network Security & Cryptography: Principles and Practices, William Stallings, PEA, Sixth
edition.
2. Hack Proofing your Network, Russell, Kaminsky, Forest Puppy, Wiley Dreamtech

REFERENCE BOOKS:
1. Network Security & Cryptography, Bernard Menezes, Cengage, 2010

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

L P C

I Year – 2nd SEMESTER 4 0 3

BIG DATA ANALYTICS

UNIT-I
Data structures in Java: Linked List, Stacks, Queues, Sets, Maps; Generics: Generic classes and Type
parameters, Implementing Generic Types, Generic Methods, Wrapper Classes, Concept of Serialization

UNIT-II

s
Working with Big Data: Google File System, Hadoop Distributed File System (HDFS) – Building
blocks of Hadoop (Namenode, Datanode, Secondary Namenode, Job Tracker, Task Tracker),

te
Introducing and Configuring Hadoop cluster (Local, Pseudo-distributed mode, Fully Distributed
mode), Configuring XML files.

UNIT-III

d a
Writing MapReduce Programs: A Weather Dataset, Understanding Hadoop API for MapReduce

Reducer code, Record Reader, Combiner, Partitioner

U p
Framework (Old and New), Basic programs of Hadoop MapReduce: Driver code, Mapper code,

y
UNIT-IV

t
Hadoop I/O: The Writable Interface, Writable Comparable and comparators, Writable Classes:

i
Writable wrappers for Java primitives, Text, Bytes Writable, Null Writable, Object Writable and

s
Generic Writable, Writable collections, Implementing a Custom Writable: Implementing a Raw

r
Comparator for speed, Custom comparators

e
UNIT-V

i v
Pig: Hadoop Programming Made Easier

n
Admiring the Pig Architecture, Going with the Pig Latin Application Flow, Working through the ABCs
of Pig Latin, Evaluating Local and Distributed Modes of Running Pig Scripts, Checking out the Pig

U
Script Interfaces, Scripting with Pig Latin
Applying Structure to Hadoop Data with Hive:
Saying Hello to Hive, Seeing How the Hive is Put Together, Getting Started with Apache Hive,
Examining the Hive Clients, Working with Hive Data Types, Creating and Managing Databases and
Tables, Seeing How the Hive Data Manipulation Language Works, Querying and Analyzing Data

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

TEXT BOOKS:
1. Big Java 4th Edition, Cay Horstmann, Wiley John Wiley & Sons, INC
2. Hadoop: The Definitive Guide by Tom White, 3rd Edition, O’reilly
3. Hadoop in Action by Chuck Lam, MANNING Publ.
4. Hadoop for Dummies by Dirk deRoos, Paul C.Zikopoulos, Roman B.Melnyk,Bruce Brown,
Rafael Coss

REFERENCE BOOKS:
1. Hadoop in Practice by Alex Holmes, MANNING Publ.

s
2. Hadoop MapReduce Cookbook, Srinath Perera, Thilina Gunarathne

SOFTWARE LINKS:
1. Hadoop:http://hadoop.apache.org/
2. Hive: https://cwiki.apache.org/confluence/display/Hive/Home
a te
3. Piglatin: http://pig.apache.org/docs/r0.7.0/tutorial.html

p d
y U
s i t
e r
n i v
U

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

L P C

I Year – 2nd SEMESTER 4 0 3

WEB TECHNOLOGIES

UNIT-I:
Java script : The Basic of Java script: Objects, Primitives Operations and Expressions, Screen Output
and Keyboard Input, Control Statements, Object Creation and Modification, Arrays, Functions,
Constructors, Pattern Matching using Regular Expressions

s
UNIT-II:
XML: Document type Definition, XML schemas, Document object model, XSLT,

te
DOM and SAX Approaches,
AJAX A New Approach: Introduction to AJAX, Integrating PHP and AJAX.

UNIT-III:
PHP Programming: Introducing PHP: Creating PHP script, Running PHP script.

d a
p
Working with variables and constants: Using variables, Using constants, Data types, Operators.
Controlling program flow: Conditional statements, Control statements, Arrays, functions. Working
with forms and Databases such as MySQL.

U
UNIT-IV:

i t y
PERL: Introduction to PERL, Operators and if statements, Program design and control structures,

s
Arrays, Hashs and File handling, Regular expressions, Subroutines, Retrieving documents from the web

r
with Perl.

UNIT-V:

v e
RUBY: Introduction to Ruby, Variables, types, simple I/O, Control, Arrays, Hashes, Methods, Classes,

i
Iterators, Pattern Matching. Overview of Rails.

TEXT BOOKS:

U n
1. Programming the World Wide Web, Robet W Sebesta, 7ed, Pearson.
2. Web Technologies, Uttam K Roy, Oxford
3. The Web Warrior Guide to Web Programming, Bai, Ekedahl, Farrelll, Gosselin, Zak, Karparhi,
Maclntyre, Morrissey, Cengage

REFERENCE BOOKS:
1. Ruby on Rails Up and Running, Lightning fast Web development, Bruce Tate, Curt Hibbs,
Oreilly ( 2006)
2. Programming Perl, 4ed, Tom Christiansen, Jonathan Orwant, Oreilly (2012)
3. Web Technologies, HTML< JavaScript, PHP, Java, JSP, XML and AJAX, Black book, Dream
Tech.
4. An Introduction to Web Design, Programming, Paul S Wang, Sanda S Katila, Cengage Learning
5. http://www.upriss.org.uk/perl/PerlCourse.html

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

L P C

I Year – 2nd SEMESTER 4 0 3

ADVANCED UNIX PROGRAMMING

UNIT-I:
Introduction to unix-Brief History-What is Unix-Unix Components-Using Unix-Commands in Unix-
Some Basic Commands-Command Substitution-Giving Multiple Commands.

UNIT-II:

te s
The File system –The Basics of Files-What’s in a File-Directories and File Names-Permissions-I Nodes-
The Directory Hierarchy, File Attributes and Permissions-The File Command knowing the File Type-
The Chmod Command Changing File Permissions-The Chown Command Changing the Owner of a
File-The Chgrp Command Changing the Group of a File.

UNIT-III:

d a
p
Using the Shell-Command Line Structure-Met characters-Creating New Commands-Command
Arguments and Parameters-Program Output as Arguments-Shell Variables- -More on I/O Redirection-
Looping in Shell Programs.

U
y
UNIT-IV:

i t
Filters-The Grep Family-Other Filters-The Stream Editor Sed-The AWK Pattern Scanning and
processing Language-Good Files and Good Filters.

s
UNIT-V:

e r
Shell Programming-Shell Variables-The Export Command-The Profile File a Script Run During

v
Starting-The First Shell Script-The read Command-Positional parameters-The $? Variable knowing the

i
exit Status-More about the Set Command-The Exit Command-Branching Control Structures-Loop

n
Control Structures-The Continue and Break Statement-The Expr Command: Performing Integer
Arithmetic-Real Arithmetic in Shell Programs-The here Document(<<)-The Sleep Command-

U
Debugging Scripts-The Script Command-The Eval Command-The Exec Command. The Process-The
Meaning-Parent and Child Processes-Types of Processes-More about Foreground and Background
processes-Internal and External Commands-Process Creation-The Trap Command-The Stty Command-
The Kill Command-Job Control.

TEXT BOOKS:
1. The Unix programming Environment by Brain W. Kernighan & Rob Pike, Pearson.
2. Introduction to Unix Shell Programming by M.G.Venkateshmurthy, Pearson.

REFERENCE BOOKS:
1. Unix and shell programmingby B.M. Harwani, OXFORD university press.

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

L P C

I Year – 2nd 4 0 3
SEMESTER

SOFTWARE ENGINEERING
(Elective – 1)

UNIT-I:
Software and Software Engineering: The Nature of Software, The Unique Nature of Web Apps,
Software Engineering, Software Process, Software Engineering Practice, Software Myths.

te s
Process Models: A Generic Process Model, Process Assessment and Improvement, Prescriptive Process
Models, Specialized Process Models, The Unified Process, Personal and Team Process Models, Process
Terminology, Product and Process.

UNIT-II:

d a
U p
Requirements Analysis And Specification: Requirements Gathering and Analysis, Software
Requirement Specification (SRS), Formal System Specification.
Software Design: Overview of the Design Process, How to Characterise of a Design?, Cohesion and
Coupling, Layered Arrangement of Modules, Approaches to Software Design

UNIT – III:

i t y
Function-Oriented Software Design: Overview of SA/SD Methodology, Structured Analysis,

view of Object Oriented design.

e r s
Developing the DFD Model of a System, Structured Design, Detailed Design, Design Review, over

v
User Interface Design: Characteristics of Good User Interface, Basic Concepts, Types of User

Methodology.

UNIT – IV:
n i
Interfaces, Fundamentals of Component-based GUI Development, A User Interface Design

U
Coding And Testing: Coding, Code Review, Software Documentation, Testing, Unit Testing, Black-
Box Testing, White-Box Testing, Debugging, Program Analysis Tool, Integration Testing, Testing
Object-Oriented Programs, System Testing, Some General Issues Associated with Testing

UNIT – V:
Software Reliability And Quality Management: Software Reliability, Statistical Testing, Software
Quality, Software Quality Management System, ISO 9000, SEI Capability Maturity Model.
Computer Aided Software Engineering: Case and its Scope, Case Environment, Case Support in
Software Life Cycle, Other Characteristics of Case Tools, Towards Second Generation CASE Tool,
Architecture of a Case Environment

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

TEXT BOOKS:
1. Software Engineering A practitioner’s Approach, Roger S. Pressman, Seventh Edition
McGrawHill International Edition.
2. Fundamentals of Software Engineering, Rajib Mall, Third Edition, PHI.
3. Software Engineering, Ian Sommerville, Ninth edition, Pearson education

REFERENCE BOOKS:
1. Software Engineering : A Primer, Waman S Jawadekar, Tata McGraw-Hill, 2008
2. Software Engineering, A Precise Approach, Pankaj Jalote, Wiley India,2010.
3. Software Engineering, Principles and Practices, Deepak Jain, Oxford University Press.

2006.

te s
4. Software Engineering1: Abstraction and modeling, Diner Bjorner, Springer International edition,

d a
U p
i t y
e r s
n i v
U

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

ARTIFICIAL INTELLIGENCE
(Elective – 1)

UNIT-I:
Introduction to artificial intelligence: Introduction ,history, intelligent systems, foundations of AI,
applications, tic-tac-tie game playing, development of ai languages, current trends in AI

UNIT-II:
Problem solving: state-space search and control strategies : Introduction, general problem solving,
characteristics of problem, exhaustive searches, heuristic search techniques, iterative-deepening a*,
constraint satisfaction

pruning, two-player perfect information games

UNIT-III:
te s
Problem reduction and game playing: Introduction, problem reduction, game playing, alpha-beta

d a
Logic concepts: Introduction, propositional calculus, proportional logic, natural deduction system,
axiomatic system, semantic tableau system in proportional logic, resolution refutation in proportional
logic, predicate logic

UNIT-IV:

U p
Knowledge representation: Introduction, approaches to knowledge representation, knowledge
representation using semantic network, extended semantic networks for KR, knowledge representation

i t y
using frames advanced knowledge representation techniques: Introduction, conceptual dependency
theory, script structure, cyc theory, case grammars, semantic web

UNIT-V:

r s
Expert system and applications: Introduction phases in building expert systems, expert system versus

e
traditional systems, rule-based expert systems blackboard systems truth maintenance systems,

v
application of expert systems, list of shells and tools

n i
U
TEXT BOOKS:
1. Artificial Intelligence- Saroj Kaushik, CENGAGE Learning,
2. Artificial intelligence, A modern Approach , 2nd ed, Stuart Russel, Peter Norvig, PEA
3. Artificial Intelligence- Rich, Kevin Knight, Shiv Shankar B Nair, 3rd ed, TMH
4. Introduction to Artificial Intelligence, Patterson, PHI

REFERNCE BOOKS:
1. Atificial intelligence, structures and Strategies for Complex problem solving, -George F Lugar,
5th ed, PEA
2. Introduction to Artificial Intelligence, Ertel, Wolf Gang, Springer
3. Artificial Intelligence, A new Synthesis, Nils J Nilsson, Elsevier

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

COMPILER DESIGN
(Elective – 1)

UNIT – I
Introduction Language Processing, Structure of a compiler the evaluation of Programming language,
The Science of building a Compiler application of Compiler Technology. Programming Language
Basics.
Lexical Analysis-: The role of lexical analysis buffing, specification of tokens. Recognitions of tokens
the lexical analyzer generator lexical

UNIT –II

te s
Syntax Analysis -: The Role of a parser, Context free Grammars Writing A grammar, top down passing
bottom up parsing Introduction to Lr Parser.

UNIT –III
d a
U p
More Powerful LR parser (LR1, LALR) Using Armigers Grammars Equal Recovery in Lr parser Syntax
Directed Transactions Definition, Evolution order of SDTS Application of SDTS. Syntax Directed
Translation Schemes.

UNIT – IV

i t y
r s
Intermediated Code: Generation Variants of Syntax trees 3 Address code, Types and Deceleration,
Translation of Expressions, Type Checking. Canted Flow Back patching?

e
v
UNIT – V

n i
Runtime Environments, Stack allocation of space, access to Non Local date on the stack Heap
Management code generation – Issues in design of code generation the target Language Address in the
target code Basic blocks and Flow graphs. A Simple Code generation.

U
TEXT BOOKS:

1. Compilers, Principles Techniques and Tools. Alfred V Aho, Monical S. Lam, Ravi Sethi Jeffery
D. Ullman,2nd edition,pearson,2007

2. Compiler Design K.Muneeswaran, OXFORD

3. Principles of compiler design, 2nd edition, Nandhini Prasad, Elsebier.

REFERENCE BOOKS:

1. Compiler Construction, Principles and practice, Kenneth C Louden, CENGAGE

2. Implementations of Compiler, A New approach to Compilers including the algebraic methods,

Yunlinsu, SPRINGER

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

MACHINE LEARNING
(Elective -1)

UNIT -I: The ingredients of machine learning, Tasks: the problems that can be solved with
machine learning, Models: the output of machine learning, Features, the workhorses of machine
learning. Binary classification and related tasks: Classification, Scoring and ranking, Class probability
estimation

UNIT- II: Beyond binary classification: Handling more than two classes, Regression, Unsupervised
and descriptive learning. Concept learning: The hypothesis space, Paths through the hypothesis space,

s
Beyond conjunctive concepts

te
UNIT- III: Tree models: Decision trees, Ranking and probability estimation trees, Tree learning as
variance reduction. Rule models: Learning ordered rule lists, Learning unordered rule sets, Descriptive
rule learning, First-order rule learning

d a
UNIT -IV: Linear models: The least-squares method, The perceptron: a heuristic learning algorithm

p
for linear classifiers, Support vector machines, obtaining probabilities from linear classifiers, Going
beyond linearity with kernel methods. Distance Based Models: Introduction, Neighbors and exemplars,

U
Nearest Neighbors classification, Distance Based Clustering, Hierarchical Clustering.

i y
UNIT- V: Probabilistic models: The normal distribution and its geometric interpretations,

t
Probabilistic models for categorical data, Discriminative learning by optimising conditional likelihood
Probabilistic models with hidden variables. Features: Kinds of feature, Feature transformations, Feature

e r s
construction and selection. Model ensembles: Bagging and random forests, Boosting

TEXT BOOKS:

n i v
1. Machine Learning: The art and science of algorithms that make sense of data, Peter Flach,

U
Cambridge.
2. Machine Learning, Tom M. Mitchell, MGH.

REFERENCE BOOKS:
1. Understanding Machine Learning: From Theory to Algorithms, Shai Shalev-Shwartz, Shai Ben-
David, Cambridge.
2. Machine Learning in Action, Peter Harington, 2012, Cengage.

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

L P C

I Year – 2nd SEMESTER 4 0 3

OBJECT ORIENTED ANALYSIS & DESIGN USING UML

(Elective – 2)

UNIT-I:
Introduction: The Structure of Complex systems, The Inherent Complexity of Software, Attributes of
Complex System, Organized and Disorganized Complexity, Bringing Order to Chaos, Designing
Complex Systems, Evolution of Object Model, Foundation of Object Model, Elements of Object Model,
Applying the Object Model.

UNIT-II:

te s
Classes and Objects: Nature of object, Relationships among objects, Nature of a Class, Relationship
among Classes, Interplay of Classes and Objects, Identifying Classes and Objects, Importance of Proper

a
Classification, Identifying Classes and Objects, Key abstractions and Mechanisms.

UNIT-III:

p d
Introduction to UML: Why we model, Conceptual model of UML, Architecture, Classes,
Relationships, Common Mechanisms, Class diagrams, Object diagrams.

UNIT-IV:

y U
Diagrams.

s i t
Basic Behavioral Modeling: Interactions, Interaction diagrams, Use cases, Use case Diagrams, Activity

UNIT-V:

e r
Advanced Behavioral Modeling: Events and signals, state machines, processes and Threads, time and

i v
space, state chart diagrams. Architectural Modeling: Component, Deployment, Component diagrams
and Deployment diagrams.

n
U
TEXT BOOKS:

1. “Object- Oriented Analysis And Design with Applications”, Grady BOOCH, Robert
A. Maksimchuk, Michael W. ENGLE, Bobbi J. Young, Jim Conallen, Kellia
Houston, 3rd edition, 2013, PEARSON.
2. “The Unified Modeling Language User Guide”, Grady Booch, James Rumbaugh, Ivar Jacobson, 12th
Impression, 2012, PEARSON.

REFERENCE BOOKS:

1. “Object-oriented analysis and design using UML”, Mahesh P. Matha, PHI

2. “Head first object-oriented analysis and design”, Brett D. McLaughlin, Gary

Pollice, Dave West, O‟Reilly

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

PARALLEL ALGORITHMS
(Elective -2)

UNIT-1: Introduction:
Computational demand in various application areas, advent of parallel processing, terminology-
pipelining, Data parallelism and control parallelism-Amdahl’s law.

UNIT- II: Scheduling:

Organizational features of Processor Arrays, Multi processors and multi-computers. Mapping
and scheduling aspects of algorithms. Mapping into meshes and hyper cubes-Load balancing-
List scheduling algorithm Coffman-graham scheduling algorithm for parallel processors.

UNIT -III: Algorithms:

Elementary Parallel algorithms on SIMD and MIMD machines, Analysis of these
algorithms. Matrix Multiplication algorithms on SIMD and MIMD models. Fast Fourier

te s
a
Transform algorithms. Implementation on Hyper cube architectures. Solving linear file -
system of equations, parallelizing aspects of sequential methods back substitution and Tri
diagonal.

UNIT- IV: Sorting:

p d
U
Parallel sorting methods, Odd-even transposition Sorting on processor arrays, Biotonic
,merge sort on shuffle - exchange ID , Array processor,2D-Mesh processor and Hypercube

y
Processor Array. Parallel Quick-sort on Multi processors. Hyper Quick sort on hypercube

Algorithms for dictionary operations.

s i t
multi computers. Parallel search operations. Ellis algorithm and Manber and ladder’s

UNIT- V: Searching

e r
Parallel algorithms for Graph searching, All Pairs shortest paths and inimum cost spanning
tree. Parallelization aspects of combinatorial search algorithms with Focus on Branch and

i v
Bound Methods and Alpha-beta Search methods.

n
U
TEXT BOOKS:
1. Parallel computing t h e o r y and practice, Michel J.Quinn
2. Programming Parallel Algorithms, Guy E. Blelloch, Communications of the ACM

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

CLOUD COMPUTING
(Elective – 2)
UNIT I:
Introduction: Network centric computing, Network centric content, peer-to –peer systems, cloud
computing delivery models and services, Ethical issues, Vulnerabilities, Major challenges for cloud
computing
Parallel and Distributed Systems: introduction, architecture, distributed systems, communication
protocols, logical clocks, message delivery rules, concurrency, model concurrency with Petri Nets.

UNIT II:
Cloud Infrastructure: At Amazon, The Google Perspective, Microsoft Windows Azure, Open Source
Software Platforms, Cloud storage diversity, Inter cloud, energy use and ecological impact,
responsibility sharing, user experience, Software licensing

te s
Cloud Computing : Applications and Paradigms: Challenges for cloud, existing cloud applications and
new opportunities, architectural styles, workflows, The Zookeeper, The Map Reduce Program model,
HPC on cloud, biological research

UNIT III:

d a
Cloud Resource virtualization: Virtualization, layering and virtualization, virtual machine monitors,
virtual machines, virtualization- full and para, performance and security isolation, hardware support for
virtualization, Case Study: Xen, vBlades

U p
Cloud Resource Management and Scheduling: Policies and Mechanisms, Applications of control
theory to task scheduling, Stability of a two-level resource allocation architecture, feed back control
based on dynamic thresholds, coordination, resource bundling, scheduling algorithms, fair queuing, start

management and dynamic application scaling

i t y
time fair queuing, cloud scheduling subject to deadlines, Scheduling Map Reduce applications, Resource

UNIT IV:

r s
Storage Systems: Evolution of storage technology, storage models, file systems and database,

e
distributed file systems, general parallel file systems. Google file system., Apache Hadoop, Big Table,
Megastore ( text book 1), Amazon Simple Storage Service(S3) (Text book 2)

v
Cloud Security: Cloud security risks, security – atop concern for cloud users, privacy and privacy

i
impact assessment, trust, OS security, Virtual machine security, Security risks

UNIT V:
n
U
Cloud Application Development: Amazon Web Services : EC2 – instances, connecting clients,
security rules, launching, usage of S3 in Java, Installing Simple Notification Service on Ubuntu 10.04,
Installing Hadoop on Eclipse, Cloud based simulation of a Distributed trust algorithm, Cloud service for
adaptive data streaming ( Text Book 1)
Google: Google App Engine, Google Web Toolkit (Text Book 2)
Microsoft: Azure Services Platform, Windows live, Exchange Online, Share Point Services, Microsoft
Dynamics CRM (Text Book 2)

TEXT BOOKS:
1. Cloud Computing, Theory and Practice, Dan C Marinescu,MK Elsevier
2. Cloud Computing, A Practical Approach, Anthony T Velte, Toby J Velte, Robert Elsenpeter,
TMH

REFERNCE BOOK:
2. Mastering Cloud Computing, Foundations and Application Programming, Raj Kumar Buyya,
Christen vecctiola, S Tammarai selvi, TMH

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

DIGITAL IMAGE PROCESSING

(Elective -2)

UNIT- I:
Introduction: Applications of Computer Graphics and Image Processing, Fundamentals on Pixel
concepts, effect of Aliasing and Jaggles, Advantages of high resolution systems
DDA line algorithms: Bresenhams line and circle derivations and algorithms

UNIT- II:
2-D Transformations: Translations, Scaling, rotation, reflection and shear transformations,
Homogeneous coordinates, Composite Transformations- Reflection about an arbitrary line;
Windowing and clipping, viewing transformations, Cohen- Sutherland clipping algorithm

UNIT- III:

te s
Digital Image Properties: Metric and topological properties of Digital Images, Histogram, entropy,
Visual Perception, Image Quality, Color perceived by humans, Color Spaces, Palette Images, color
Constancy

a
Color Images: Pixel brightness transformations, Local Preprocessing, image smoothing, Edge detectors,
Robert Operators, Laplace, Prewitt, Sobel, Fri-chen, Canny Edge detection

d
UNIT- IV:

U p
Mathematical Morphology: Basic Mathematical Concepts, Binary dilation and Erosion, Opening and
closing, Gray Scale dilation and erosion, Skeleton, Thinning , Thickening Ultimate erosion, Geodesic

y
transformations, Morphology and reconstruction, Morphological Segmentation

UNIT- V:

s i t
SEGMENTATION: Threshold detection methods, Optimal Thres holding, Edge based Segmentation-

r
Edge image thresholding, Edge relaxation, Border tracing, Hough Transforms, Region based
segmentation: Region Mergingm Region Splitting, Splitting and Merging, Watershed Segmentation.

e
Image Data Compression: Image data Properties, Discrete Image Transformations in data

v
compression, Discrete Cosine and Wavelet Transforms, Types of DWT and merits; Predicative

i
Compression methods, Hierarchical and Progressive Compression methods, Comparison of

n
Compression methods, JPEG- MPEG Image Compression methods.

U
TEXT BOOKS:
1. Computer Graphics C Version, Donald Hearn, M Paulli Baker , Pearson ( Uniit I and Unit II)
2. Image Processing, Analysis and Machine Vision, Millan Sonka, Vaclov Halvoc, Roger Boyle,
Cengage Learning, 3ed, ( Unit III, Unit IV, Unit V and Unit VI)

REFERENCES BOOKS:
1. Computer & Machine Vision, Theory , Algorithms , Practicles, E R Davies, Elsevier, 4ed
2. Digital Image Processing with MATLAB and LABVIEW, Vipul Singh, Elsevier

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

I Year – 2nd SEMESTER L P C

CSE LAB-2
0 3 2

1. a) Study of Unix/Linux general purpose utility command list

man,who,cat, cd, cp, ps, ls, mv, rm, mkdir, rmdir, echo, more, date, time, kill, history,
chmod, chown, finger, pwd, cal, logout, shutdown.
b) Study of vi editor.
c) Study of Bash shell, Bourne shell and C shell in Unix/Linux operating system.
te s
d) Study of Unix/Linux file system (tree structure).

d a
p
e) Study of .bashrc, /etc/bashrc and Environment variables.
2. Write a C program that makes a copy of a file using standard I/O, and system calls

3. Write a C program to emulate the UNIX ls –l command.

y U
i t
4. Write a C program that illustrates how to execute two commands concurrently

with a command pipe.

s
Ex: - ls –l | sort

e r
i v
5. Write a C program that illustrates two processes communicating using shared memory

n
6. Write a C program to simulate producer and consumer problem usingsemaphores

U
7. Write C program to create a thread using pthreads library and let it run its function.
8. Write a C program to illustrate concurrent execution of threads using pthreads library.

9. Write a Ruby program which counts number of lines in a text files using its regular
Expressions facility.

10. Write a Ruby program that uses iterator to find out the length of a string.

11. Write simple Ruby programs that uses arrays in Ruby.

12. Write programs which uses associative arrays concept of Ruby.

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

 www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in

13. User Authentication:

Assume four users user1, user2, user3 and user4 having the passwords pwd1, pwd2, pwd3 and pwd4
respectively. Write a PHP for doing the following.
1. Create a Cookie and add these four user id’s and passwords to this Cookie.
2. Read the user id and passwords entered in the Login form (week1) and authenticate with the values
(user id and passwords) available in the cookies.
If he is a valid user (i.e., user-name and password match) you should welcome him by name (user-name)
else you should display “You are not an authenticated user ’’.
Use init-parameters to do this.

14. Example PHP program for registering users of a website and login.

te s
d a
U p
i t y
e r s
n i v
U

www.universityupdates.in || www.android.universityupdates.in || www.ios.universityupdates.in