1.3.2 - NPR COLLEGE Of ENGINEERING AND

As per DVV clarifications the proof document for experiential learning are attached.

The following are the syllabus copy as per anna university curriculum and relevant experiential learning document

1.3.2 COURSES THAT I N C L U D E

EXPERIENTIAL LEARNING

THROUGH PROJECT WORK

/ FIELD WORK /INTERNSHIP DURING

2015-2016

1.3.2 AVERAGE PERCENTAGE OF COURSES THAT INCLUDE EXPERIENTIAL LEARNING THROUGH PROJECT WORK/FIELD WORK/INTERNSHIP DURING

2015-2016

S.No Programme

offering

Name of the course

Course

code

Project / field work /internship

Page No

1 B.E-Computer Science

Engineering Digital Principles and System Design CS6201 Field work 4


Engineering Programming and Data Structures I CS6201 Internship 6


Engineering Programming and Data Structure II CS6301 Internship 8


Engineering Database Management Systems CS6302 Field work 10


Engineering Computer Architecture CS6303 Project 13


Engineering Analog and Digital Communication CS6304 Field work 17


Engineering Computer Networks CS6551 Project 20


Engineering Operating Systems CS6401 Project 24


Engineering Design and Analysis of Algorithms CS6402 Field work 29


Engineering Software Engineering CS6403 Field work 31


Engineering Internet Programming CS6501 Internship 38


Engineering Object Oriented Analysis and Design CS6502 Field work 40


Engineering Theory of Computation CS6503 Field work 42


Engineering Computer Graphics CS6504 Field work 44


Engineering Distributed Systems CS6601 Internship 52


Engineering Mobile Computing IT6601 Field work 54


Engineering Compiler Design CS6660 Field work 56


Engineering Digital signal Processing IT6502 Internship 58


Engineering Artificial Intelligence CS6659 Project 60

cS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN LTPC 3003

OBJECTIVES: The student should be made to: Lean the various number systems. Leam Boolean Algebra

Understand the various logic gates. Be familiar with various combinational circuits. Be familiar with designing synchronous and asynchronous sequential circuits.

Be exposed to designing using PLD UNITI BOOLEAN ALGEBRA AND LOGIC GATES 9 Review of Number Systems -Arithmetic Operations- Binary Codes - Boolean Algebra and Theorems Boolean Functions Simplification of Boolean Functions using Karnaugh Map and Tabulation Methods - Logic Gates - NAND and NOR Implementations.

UNIT I COMBINATIONAL LOGIC 9 Combinational Circuits Analysis and Design Procedures - Circuits for Arithmetic Operations, Code Conversion Decoders and Encoders - Multiplexers and Demultiplexers

- Introduction to HDL - HDL Models of Combinational circuits. UNIT II SYNCHRONOUS SEQUENTIAL LOGIC 9 Sequential Circuits - Latches and Flip Flops - Analysis and Design Procedures State

Reduction and State Assignment Shift Registe Circuits. UNIT IV ASYNCHRONOUS SEQUENTIAL LOGIC 9

- Counters - HDL for Sequential Logic

Analysis and Design of Asynchronous Sequential Circuits Reduction of State and Flow Tables-Race-free State Assignment- Hazards. UNIT V MEMORY AND PROGRAMMABLE LOGIC9 RAM and ROM- Memory Decoding - Error Detection and Correction - Programmable Logic Array-Programmable Array Logic - Sequential Programmable Devices - Application

Specific Integrated Circuits. TOTAL: 45 PERIODS

OUTCOMES At the end of this course, the student will be able to: Perform arithmetic operations in any number system.

Simplify the Boolean expression using K-Map and Tabulation techniques. Use boolean simplification techniques to design a combinational hardware circuit. Design and Analysis of a given digital circuit - combinational and sequential.

Design using PLD. TEXT BOOK: 1. Morris Mano M. and Michael D. Cileti, "Digital Design", IV Edition, Pearson Education, 2008. REFERENCES: 1. John F. Wakerly, "Digital Design Principles and Practices", Fourth Edition, Pearson Education, 2007. 2. Charles H. Roth Jr, "Fundamentals of Logic Design", Fifth Edition - Jaico Pubishing

House, Mumbai, 2003. 3. Donald D. Givone, "Digital Principles and Design", Tata Mcgraw Hill, 2003. 4. Kharate G. K., "Digital Electronics", Oxford University Press, 2010.

Dr. JSUNDARARAJAN, B.E., M.Tech., Ph.D.,

Principal N.PR.ColilegeotEngineering & Technoioyy

Natham, Dndigut (Dt)- 624 401.

OENG

NATHAM

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

CR C3 TECHNOLOGIES TRAINING | PROJECTS | PLACEMENTS An ISO 29990:2010 Certified Institution

UKAC

52/33, T.Nagar 3 Cross, Ramanathapuram. Coimbatore -641 045.

Ph: 72000 55778 / 98435 55778. E-mail: [email protected]

Date: 22.12.2015

CERTIFICATE OF IN-PLANT TRAINING This is to certify that Mr. Afzalahamed.A, B.E-CSE, IV year, student of NPR college of

Engineering &Technology, Natham, Dindigul, had undergone inplant training in our company.

He had visited our company from 15.12.2015 to 19.12.2015 and completed the training

satisfactorily.

We wish him good luck.

For C3 TECHNOLOGIES

Managing Director Dr. J.SUNDARARAJAN,

B.E., .Tech., Ph.D. Principal N.PR. College of Engineering &Technology Nathamy, Dindigul (Dt) 624 401.

NATHAM

CS6202 PROGRAMMING AND DATA STRUCTURESI LTPC 3003

OBJECTIVES: The student should be made to:

Be familiar with the basics of C programming language. Be exposed to the concepts of ADTs Leam linear data structures list, stack, and queue. Be exposed to sorting, searching, hashing algorithms UNIT IC PROGRAMMING FUNDAMENTALS- A REVIEW Conditional statements Control statements - Functions - Arrays - Preprocessor - Pointers- Variation in pointer declarations Function Pointers Function with Variable number of arguments UNIT I1 C PROGRAMMING ADVANCED FEATURES 9 Structures and Unions - File handling concepts - File read - write - binary and Stdio File

Manipulations UNIT II LINEAR DATA STRUCTURES LIST Abstract Data Types (ADTs) - List ADT

implementationsingly linked lists- circularly linked lists- doubly-linked lists - applications of lists-Polynomial Manipulation -All operation (Insertion, Deletion, Merge, Traversal) UNIT V LINEAR DATA STRUCTURES-STACKs, QUEUES Stack ADT- Evaluating arithmetic expressions- other applications-Queue ADT- circular queue implementation - Double ended Queues- applications of queuees

UNIT V SORTING, SEARCHING AND HASH TECHNIQUES

Sorting algorithms: Insertion sort Selection sort- Shell sort Bubble sort Quick sort Merge sort -Radix sort Searching: Linear search -Binary Search Hashing: Hash Functions Separate Chaining-Open Addressing- Rehashing- Extendible Hashing.

9

array-based implementation linked list

TOTAL: 45 PERIODS OUTCOMES: At the end of the course, the student should be able to: Use the control structures of C appropriately for problems. Implement abstract data types for linear data structures Apply the different linear data structures to problem solutions. Critically analyse the various algorithms. TEXT BOOKS: 1. Brian W. Kemighan and Dennis M. Ritchie, "The C Programming Language", 2nd Edition, Pearson Education, 1988. 2. Mark Allen Weiss, "Data Structures and Algorithm Analysis in C" 2nd Edition, Pearson Education, 1997. REFERENCES: 1. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, iIntroduction to Algorithms", Second Edition, Mcgraw Hill, 2002. 2. Reema Thareja, "Data Structures Using C", Oxford University Press, 2011 3. Aho, Hopcroft and Ullman, "Data Structures and Algorithms", Pearson Educa�ion,1983. 4. Stephen G. Kochan, "Programming in C", 3rd edition, Pearson Ed.,

Dr. J.SUNDARARAJAN,

8.E, M.Tech., Ph.D.

ENG

NATHAM

Principal NPR.Colege otEngineering& Technouy

Notham, Dindigul (Dt)- 624 401.

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

TM

CMS IT TRAINING INGTITUTE

Expect The World From Us A Diviston of CMS IT Scrvtces Pvt. Lid

25, June' 2016

To Whom So Ever It May Concern

This is to certify that Mr. Surendar.M, studying B.E (CsE) student of NPR College of Engineering&

Technology, Natham, Dindigul has successfully completed Internship Training from 07.06.2016 to

25.06.2016 in our organization.

Yours Sincerely,

For CMS IT Services Pvt Ltd.,

Dr. J.SUNDARARAJAN,

B.E.,I.Tech., Ph.D. Principal

N.PR.College of Engineering&Technology Natham, Dindigul (Dt)- 624 401.

AuthorizbighaBr 620001

NATHAM

Licensee: Entrust Technoservices Pvt. Ltd

CMS 3rd floor, TABS Complex, Opp. American Hospital, 41, Bharatidasan Salal, Cantonment, Trichy-620 001

Phone: 0431- 4250437, Email [email protected] in Website: www cmsinstitute co.in

CS6301 PROGRAMMING AND DATA STRUCTURES I LTPC 3003

OBJECTIVES: The student should be made to0:

Be familiar with the C++ concepts of abstraction, encapsulation, constructor, polymorphism, overloading and Inheritance. Leam advanced nonlineardata structures. Be exposed to graph algorithms Leam to apply Tree and Graph structures UNIT I OBJECT ORIENTED PROGRAMMING FUNDAMENTALS C++Programming features Data Abstraction Encapsulation class object-constructors static members constant members - member functions pointers references- Role of this

pointer-Storage classes function as arguments. UNIT II OBJE�T ORIENTED PROGRAMMING CONCEPTS String Handling Copy Constructor- Polymorphism - compile time and run time polymorphisms function overloading operators overloading - dynamic memory allocation - Nested classes -

Inheritance - virtual functions.

UNIT II C++ PROGRAMMING ADVANCED FEATURES Abstract class - Exception handling Standard libraries Generic Programming templates class

9

9

9

template function template STL - containers iterators function adaptors allocators -Parameterizing the class - File handling concepts.

UNIT IV ADVANCED NON-LINEAR DATA STRUCTURES AVL trees B-Trees Red-Black trees Splay trees - Binomial Heaps Fibonacci Heaps- Disjoint Sets Amortized Analysis - accounting method potential method - aggregate

analysis. UNIT V GRAPHS Representation of Graphs - Breadth-first search Depth-first search Topological sort Minimum Spanning Trees Kruskal and Prim algorithm

algorithm-Bellman-Ford algorithm-Floyd-Warshall algorithm.

9

Shortest path algorithm - Dijkstra"'s

TOTAL: 45 PERIODS

OUTCOMES: At the end of the course, the student should be able to:

Design problem solutions using Object Oriented Techniques. Apply the concepts of data abstraction, encapsulation and inheritance for problem solutions. Use the control structures of Ct+ appropriately. Critically analyse the various algorithms. Apply the different data structures to problem solutions. TEXT BOOKS: 1. Bjarne Stroustrup, "The C++ Programming Language", 3rd Edition, Pearson Education, 2007.

2. Mark Allen Weiss, "Data Structures and Algorithm Analysis in C+t", 2nd Edition, Pearson

Education, 2005 REFERENCES: 1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein. Introduction to Algorithms", Second Edition, Mc Graw Hill, 2002. 2. Michael T Goodrich, Roberto Tamassia, David Mount, "Data Structures and Algothms in

C++",7 Edition, Wiley Publishers, 2004.

Dr. J.SUNDARARAJAN, B.E., M.Tech., Ph.D.

Principal N.PR.College ot Engineering&Technoiug

Natham, Diadigul (Dt)- 624 401.

(HNATHAM

GE OF

O10

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

cR C3 TECHNOLOGIES TRAINING I PROJECTS | PLACEMENTS An ISO 29990:2010 Certified Institution

UKAC

52/33, T.Nagar 3" Cross, Ramanathapuram, Coimbatore -641 045.

Ph: 72000 55778/98435 55778. E-mail: [email protected]

Date: 05.06.2016

To whomsoever it may concernn

This is to certify that Ms.Ananthalakshmi.B student of BE-CSE final year, NPR college of

Engineering &Technology, Natham, Dindigul, has done internship training in our organization from 09.05.2016 to 31.05.2016.

During the period of service, she was found to be good.

We wish her all the success in future career.

ENG

Foa TECHNCLOGIES NATHAM

TSaging dIrector Dr. J.SUNDARARAJAN,

B.E M.Tech., Ph.D.,

Principal N.P.R.College of Engineering & Techne y

Natham, Dindigu! (Dt). 624 401.

LTPC 3003

CS6302 DATABASE MANAGEMENT SYSTEMS

OBJECTIVES: To expose the students to the fundamentals of Database Management Systems. To make the students understand the relational model. To familiarize the students with ER diagrams To expose the students to SQL To make the students to understand the fundamentals of Transaction Processing and

Query Processing. To familiarize the students with the different types of databases.

To make the students understand the Security Issues in Databases. UNIT I INTRODUCTION TO DBMS File Systems Organization Sequential, Pointer, Indexed, Direct Purpose of Database System- Database System Terminologies-Database characteristics- Data models Types of data models Components of DBMS- Relational Algebra. LOGICAL DATABASE DESIGN: Relational DBMS Codd's Rule Entity-Relationship model - Extended ER Normalization

Functional Dependencies, Anomaly- 1NF to 5NF- Domain Key Normal Form Denormalization UNIT II SQL & QUERY OPTIMIZATION sQL Standards Data types - Database Objects- DDL-DML-DCL-TCL-Embedded SQ

Static Vs Dynamic SQL QUERY OPTIMIZATION: Query Processing and Optimization -

Heuristics and Cost Estimates in Query Optimization. UNIT II TRANSACTION PROCESSING AND CONCURRENCY CONTROL Introduction-Properties of Transaction- Serializability- Concurrency Control Locking Mechanisms-Two Phase Commit Protocol-Dead lock. UNIT IV TRENDS IN DATABASE TECHNOLOGY

10

8

8

0 Overview of Physical Storage Media - Magnetic Disks RAID - Tertiary storage- FileOrganization - Organization of Records in Files - Indexing and Hashing -Ordered Indioes B+tree Index Files-B tree Index Files - Static Hashing - Dynamic Hashing - Introduction to

Distributed Databases- Client server technology- Multidimensional and Parallel databases Spatial and multimedia databases-N Mobile and web databases- Data Warehouse-Mining-Data marts. UNIT V DVANCED TOPICS 9 DATABASE SECURITY: Data Classification-Threats and risks - Database access Control- Types of Privileges -Cryptography- Statistical Databases Distributed Databases Architecture-Transaction Association rules-Clustering-Information Retrieval- Relevance ranking-Crawling and

Indexing the Web- Object Oriented Databases-XML Databases.

Processing-Data Warehousing and Mining-Classification

TOTAL: 45 PERIODS

oUTCOMES: At the end of the course, the student should be able to:

Design Databases for applications. Use the Relational model, ER diagrams. Apply concurrency control and recovery mechanisms for practical problems.

Design the Query Processor and Transaction Processor.

Apply security concepts to databases.

TEXT BOOK: 1. Ramez Elmasri and Shamkant B. Navathe, "Fundamentals of Database Systems", Fifth Edition, Pearson Education, 2008.

REFERENCES: 1. Abraham Silberschatz, Henry F. Korth and S. Sudharshan, "Database SystemConcepts, Sixth Edition, Tata Mc Graw Hill, 2011. 2. C.J.Date, A.Kannan and S.Swamynathan, "An Introduction to Database Systens,Eighth Edition, Pearson Education, 2006.

V.


Principal N.PR.CollegeotEngineering& Technology

Natham, Dtndigo{D1)-624 401 AT THAM A901

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

3. Atul Kahate, "Introduction to Database Management Systems", Pearson Education, New Delhi, 2006. 4. Alexis Leon and Mathews Leon, 'Database Management Systems", Vikas Publishing House Private Limited, New Delhi, 2003.

S Raghu Ramakrishnan, "Database Management Systems', Fourth Edition, Tata Mc Graw Hill, 2010. 6. G.K.Gupta, "Database Management Systems", Tata Mc Graw Hil, 2011. 7. Rob Comell, "Database Systems Design and Implementation", Cengage Leaming, 2011.

Dr. J.SUNDAR B.E., M.Tech., Ph.D.,

Princioal Principal N:PR.CollegeotEngineering& Technoiuyy

Netham, Dindigul (Dt) 624 401.

NATHAM

M

CMS IT 1RAINING INSTITuTE

Expect The World From Us A Division of CMS 1T Services Pvt. Lld.

25th, Dec 2015


This is to certify that Ms. Deebika. M, Department of Computer Science & Engineering, NPR College

of Engineering& Technology, Natham, Dindigul, has undergone inplant training from 18.12.2015 to


During the period of training she had shown keen interest towards learning.

She demonstrated good design skills with self-motivated attitude to learn new things.

We wish her future endeavor.

Yours Sincerely,


2 Trichy Authorized Sigtor

NG NATHAM

Dr. J.SUNDARARAJAN,

B.E., M.Tech., Ph.D. Principal N.PR.College of Engineering& Technology Natham, Dindigul (Dt)- 624 401. Licensee:: Entrust Technoservices Pvt. Ltd.

3rd Floor, TABS Complex, Opp. American Hospital, 41, Bharathidasan Salai, Cantonment, Trichy-620 001

CMS Phone: 0431- 4250437, Email [email protected] Website: www.cmsinstitute.co.in

CS6303 cOMPUTER ARCHITECTURE LTPC 3003

OBJECTIVES: To make students understand the basic structure and operation of digital computer. .To understand the hardware-software interface. To familiarize the students with arithmetic and logic unit and implementation of fixed point and floating-point arithmetic operations. To expose the students to the concept of pipelining. To familiarize the students with hierarchical memory system including cache memories and virtual memory.To expose the students with different ways of communicating with VO devices and standard \VO interfaces. UNIT 1 OVERVIEW&INSTRUCTIONS Eight ideas - Components of a computer system Technology Performance - Power wall

- Uniprocessors to mutiprocessors; Instructions operations and operands representing instructions-Logical operations control operations -Addressing and addressing modes.

9

UNIT I ARITHMETIC OPERATIONS ALU Addition and subtraction Multiplication Division Floating Point operations Subword parallelism. UNIT II PROCESSOR AND CONTROL UNIT Basic MIPS implementation Building datapath Control Implementation scheme -

Pipelining-Pipelined datapath and control Handling Data hazards & Control hazards Exceptions. UNIT IV PARALLELISM

11

Instruction-level-parallelism Parallel processing challenges Flynn's classification Hardware multithreading - Multicore processors

UNIT V MEMORY AND VO SYSTEMS Memory hierarchy Memory technologies - Cache basics- Measuring and improving cache

performance Virtual memory, TLBs - Inputoutput system, programmed i/0, DMA and

interrupts, lVO processors. TOTAL: 45 PERIODS

OUTCOMES: At the end of the course, the student should be able to: Design arithmetic and logic unit. Design and anlayse pipelined control units Evaluate performance of memory systems. Understand parallel processing architectures. TEXT BOOK: 1. David A. Patterson and John L. Hennessey, "Computer organization and design", Morgan Kauffman /Elsevier, Fifth edition, 2014 REFERENCES: 1. V.Carl Hamacher, Zvonko G. Varanesic and Safat G. Zaky, "Computer Organisation", VInedition, Mc Graw-Hill Inc, 2012. 2. William Staillings Computer Organization and Architecture", Seventh Edition, Pearson Education, 2006. 3. Vincent P. Heuring, Harry F. Jordan, "Computer System Architecture", Second Edition, Pearson Education, 2005. 4. Govindarajalu, "Computer Architecture and Organization, Design Principles and Applications", first edition, Tata McGraw Hil, New Delhi, 2005. 5. John P. Hayes, Computer Archite cture and Organization', Third Edition, Tata Me Graw Hill, 1998. 6. http://nptel.ac.in/.

Dr. J.SUNDARÀRAJAN,

B.E., M.Tech., Pn.D.,

Principal N.PR. Collegeot Engineering& Technowy

Natham, Dindigut(Dt)- 624 401. NATHAM

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

THE NEW MPCHANISM OF

AUTHORIZATION POR SHARED NPR DATA IN OSNS

A PROIKKT REPORT

Suhmited hy

N.BHARATH 920812104015)

E.GAJAPATHI (920812104021)

A.MUTHUPANDI (920812104049)

in partial fulfillment for the awurd of the degree

of

BACHELOR OF ENGINEERING

in

cOMPUTER SCIENCE AND ENGINEERING

NPR COLLEGE OF ENGINEERING AND TECHNOLOGY

NATHAM

ANNA UNIVERSITY:: CHENNAI 600 025

APRIL 2016

Dr. J.SUNDARARAJAN

B.E., M.Tech., Ph.., PrincipalN.PR.Colege of Engineering& Technoiogy Natham, Dindigul {Dt)- 24 4u1.

(NATHAM

ABSTRACT

On today's date 4 out of 5 people use the social networking sites for their

social relationship buildings and be connected with their loved ones and friend

circle. While building their social contact and relationships they shares lot more

data and contents with each other. the social networking sites like Face Book,

Google+ Twitter may provide the user's own space to share the contents like

images, comments, other sharing contents and along with that the privacy

policies also. But still there is a problem of privacy and security of data and

content when the multiple users belong to the same content or data in any

social networking sites. The proposed new system or an approach which

protects the shared data in multiple user environments. Here to formulate the

model for access control to overcome the problem of multiuser environment.

And also to providing the policy specification and enforcement mechanism.

And also to formulate the mechanism of authorization for shared data in OSNs.

Here to focus on the fake identity in social networks and to resolve that

problem also. The scope of this proposed system is there where the privacy and

protection of the shared data is important in multiuser environment like OSNs.

The objective is to decrease the privacy issues in mutiparty access control and

to improve the protection and security of the shared data in OSNs when there

are multiple parties to control.

Dr. J.SUNDARARAJAN,

B.E, 4.Tech., Ph.D., Principat N.PR.College of Engineering&Technoiogy

Nacthans Dindigu! (Dt)- 624 4U1.

MATH NATHAM

32

CHAPTER8

CONCLUSION AND FUTURE ENHANCEMENT

8.1CONCLUSION

In this project, the system has presented a social compute cloud

where the provisioning of cloud infrastructure occurs through "friend"

relationships. The system has revisited the allocation model and mo

away from a purely economic exchange to a model that emphasizes user

choice. Social computing is an area of computer science that is concerned

with the intersection of social behavior and computational systems. It is

based on creating or recreating social conventions and social contexts

through the use of software and technology. Thus, blogs, email, instant

messaging, social network services, wikis, social bookmarking and other

instances of what is often called social software illustrate ideas from social

computing, but also other kinds of software applications where people

interact socially. Specifically, due to the social network basis of a social

cloud, users will have explicit preferences with whom their resources are

allocated to, and from whom they consume resources. To support user

preferences, the system implement several algorithms for bidirectional

preference-based resource allocation.

Dr. J.SUNDARARAJAN

.M.Tach., Pn.0, Princigal

N.PR Cologe of Ergsneet &Techr g Nathai, Dindigu: t i4 iu1

NATHA

CS$304 ANALOG AND DIGITAL cOMMUNICATION LTPC 3003 OBJECTIVES:

The student should be made to Understand analog and digital communication techniques Leam data and pulse communicaton techniques Be familiarzed with source and Eror control coding Gain knowiedge on mulb-user radio communication. UNIT I ANALOG COMMUNICATION Noise: Source of Noise Extemal Noise Intemal Noise Noise Calculation Introduction to Communication Systems: Modulation Types - Need for Modulation Theory of Amplitude Modulation Evolution and Description of SSB Techniques Theory of Frequency and Phase Modulaton Comparison of various Anaiog Communicabion System (AM - FM- PM UNIT I DIGITAL COMMUNICATION Amplitude Shift Keyng (ASK) - Frequency Shit Keying (FSK) Minimum Shift Keying (MSK) Phase Shift Keying PSK) - BPSK QPSK 8 PSK - 16 PSK - Quadrature Amplitude Modulation (QAM) - 8 QAM 16 QAM Bandwidth Eficiency- Comparison of various Digital Communication System (ASK - FSK- PSK QAM UNIT I DATA AND PULSE COMMUNICATION 9 Data Communication: History af Data Communication - Standards Organizations for Data Communicaton- Data Communication Circuits - Data Communication Codes Eror Detecton and Correcton Techniques Data communication Hardware serial and parallel interfaces Pulse Communication: Puise Ampitude Modulation (PAM)- Pulse Time Modulation (PTM) - Pulse code Moduiation (PCM) Comparison of various Pulse

Communicaton System PAM-PTM-PCM UNIT V SOURCE AND ERROR CONTROL CODING Entropy. Source encoding heorem Shannon fano coding. Huffman coding, mutual infomaton.channel capacity. channel coding theorem, Emor Control Coding. linear block codes. cycic codes.covolution codes, verti decoding algorithm UNIT V MULTHUSER RADIO COMMUNICATION

9

9 Advanced Mobie Phone System (AMPS) - Global System for Mobile Communications (GSM) Code division multiple access (CDMA) - Celluar Concept and Frequency Reuse- Channel Assignment and Hand Overview of Multiple Access Schemes Satellite Communicaton-Buetooth

TOTAL: 45 PERIODS OUTCOMES: At the end of the course, the student should be able to:

Appiy anralog and digital communication techniques. Use data and puise communication techniques. Analyze Source and Eror control coding. Utlize mulii-user radio communication TEXT BOOK:

1 Wayme Tomasi. Advanced Electronic Communication Systems'. 6n Edition, Pearson Educaton, 2009. REFERENCES: 1.Simon Hayin. "Communicaton Systems', 4n Edition, John Wiliey& Sons. 2004 2. Rappaport T.S, Wireless Communications: Principles and Practice", 2n Ediion, Pearson Education, 2007 3. H.Taub. DL Schiling and G Saha. Principes of Communicaton", 3-Edition, Pearson Education, 2007.

4.B.PLathi. Modem Anakog and Digital Communication Systerms3-Edion. Oxford University Press, 2007. 5. Blake, Electronic Communication Systems', Thomson Demar Pudications. 2002

Pr. J.SUNDARARAJAN,

B.E MTech, Ph.D.

Principal

NPR ColegeotEngineering & Technowugy

han, Dindigut(Dt)- 624 401.

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

6. Martin S.Roden, "Analog and Digital Communication System", 3-Edition, Prentice Hall of

India, 20002.

7. B.Sklar, "Digital Communication Fundamentals and Applications" 2nd Edition Pearson

Education 2007

Dr. J.SUNDARARAJAN,

B.E., M.fech., Ph.D. Principal

N:PR College otEngineering&Technology

Noshan Omdigut{Dt)-684 401.

NATHAM

DCMS LN IT TRAINNG INSTITuTE

Expect The World From Us A Diviston af CMS IT Services Pvi Lld.

25t, Dec' 2015


This Is to certify that Ms. Hema Latha. L, Department of Computer Science & Engineering, NPR

College of Engineering & Technology, Natham, Dindigul, has undergone inplant training from

18.12.2015 to 25.12.2015in our organization.




Yours Sincerely,


(Trichy 620001 Authorlzed Signaa

NATHAM

a Dr. J.SUNDARARAJAN,

B .Tecth., Ph.D. Principal

N.PR. College of Engineering & Technoiogy Natham, Didigul (Dt) 624 401 LIcensee: Entrust Technoservlces Pvt. Ltd.

3rd Floor, TABS Complex, Opp. Amerlcan Hospital, 41, Bharathidasan Salal, Cantonment, Trichy 620 001

CMS Phone: 0431-4250437, Emal [email protected] Webste: www.cmsinstitute.co.in

cS6561 COMPUTER NETWORKs LTPC

3003 OBJECTIVES: The student should be made to Understand the division of network functionalities into layers. Be familiar with the components required to build different types of networks Be exposed to the required functionality at each layer Learn the flow control and congestion control algorithms UNIT I FUNDAMENTALS & LINK LAYER Building a network Requirements - Layering and protocols Internet Architecture

Network software Performance Link layer Services Framing Error Detection Flow control UNIT I MEDIA ACCESS & INTERNETWORKING

Media access control Ethernet (802.3) -Wireless LANs - 802.11-Bluetooth Switching and bridging- Basic Internetworking (IP, CIDR, ARP, DHCP,ICMP) UNIT III ROUTING

9

Routing (RIP, oSPF, metrics)- Switch basics Global lnternet (Areas, BGP, IPV6), Multicast-addresses- multicast routing (DVMRP, PIM) UNIT IV TRANSPORT LAYER 9 Overview of Transport layer UDP Reliable byte stream (TCP) - Connection management

-Flow control- Retransmission TCP Congestion control- Congestion avoidance (DECbit, RED)-QoS- Application requirements UNIT V APPLICATION LAYER 9 Traditional applications -Electronic Mail (SMTP, POP3, IMAP, MIME) - HTTP - Web

Services- DNS SNMP TOTAL: 45 PERIODS

OUTCOMES: At the end of the course, the student should be able to: Identify the components required to build different types of networks Choose the required functionality at each layer for given application ldentify solution for each functionality at each layer .Trace the flow of information from one node to another node in the network TEXT BOOK: 1. Lary L. Peterson, Bruce S. Davie, "Computer Networks: A Systems Approach", Fifth Edition, Morgan Kaufmann Publishers, 2011. REFERENCES: 1. James F. Kurose, Keith W. Ross, "Computer Networking - A Top-Down Approach

Featuring the Internet", Fifth Edition, Pearson Education, 2009. 2. Nader. F. Mir, "C omputer and Communication Networks", Pearson Prentice Hall Publishers, 2010. 3. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, "Computer Networks: An Open Source Approach", Mc Graw Hill Publisher, 2011. 4. Behrouz A. Forouzan, "Data communication and Networking", Fourth Editioh, Tata McGraw Hill, 2011.

ENG

(

Dr. JSUÑDARÄRAJAN,

B.E., M.Tech., Ph.D. Principal

PRCollege-otEngineering & Technology

Natham, Dindigut (Dt)-624 401. NATHAM

N

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

MINING TIME VARYING DATA BASED ON

K-MEANS AND POSSIBILITICS FUZZY NPR RiANh hr War

C-MEANS ALGORITHM

A PROJECT REPORT

Submittedby

S.AARTHY (920812104001)

M.BARKAVI (920812104014)

S.ELAKIYA (920812104020)

U.M.KARTHIGAA (920812104037)

in partial fiulfillment for the award of the degree

of


in

COMPUTER SCIENCE AND ENGINEERING


DINDIGUL

ANNA UNIVERSITY: CHENNAI 600 025

Dr. J.SUNDHRARAJAN, ENGG APRIL 2016 B.E .Tech., Ph.D.

Pritcipa! N.PR. Cotege of Enginering& Technoiog Nathana Dindigui (Dt).624 401.

NATHAM

ABSTRACT

The aim of co-clustering is identifying the block structures of the data

matrices by clustering the rows and columns simultaneously into co-

clusters. Many approaches are simple to learn from these time evolving data

matrices and analyze them separately but they neglect the time-dependent

nature of those data. In this paper, we learn the time varying data by

proposing the two formulations such as evolutionary co-clustering and

feature selection process which is based on the fused Lasso regularization.

The evolutionary co-clustering formulation is done by one based on sparse

SVD and spectral co-clustering method which is able to identify smoothly

varying hidden block structures embedded into the matrices along the

temporal dimension. Then the feature selection process is used for

uncovering the shared features from the clustering such as K-means

clustering and Possibilistic Fuzzy C-means clustering from the time

evolving data matrices. The optimization process involved here are non-

convex, non-smooth, non-separable. For the efficient computation problem,

we develop a two step procedure for the iterative objective function process.

Our evaluation process is done using the Allen Developing Mouse Brain

Atlas data which shows the consistent formulation.

Dr. JSUNDARARAJAN,

A B.E., M.Tech., Ph.u, PrincipalN.PR. Colege af Eineering &Techiuv

NATHAM

Nahan, Dindigu! {0t} .24 4i1. D0 1

26

CHAPTER 9

CONCLUSION AND FUTURE WORK

9.1 CONCLUSION

This system proposes an evolutionary co-clustering formulation for

identifying the co-clusters from the time variant data. This formulation

employs the sparsity-inducing regularization for identifying the block

structures from the time variant data matrices. This process applies the

fused lasso regularization encourage the temporal smoothness over the

block structures identified from the contiguous time points. This

formulation is very flexible and can be applied to encourage temporal

smoothness over either one or both dimensions of the data matrices. It also

uses an iterative two-step procedure to compute the solution of the general

optimization problem. The experimental result shows the formulation is best

compared with the existing system

GG Dr. J.SUNDARARAJAN, NATHAM

B.E., M.Tech., Ph.D., Principal N.PR. College of Engineering & Technoiogy Nathan, Dindigui (Dt) 24 401.

LTPC CS6401 OPERATING SYSTEMS

3003

OBJECTIVES: The student should be made to: Study the basic concepts and functions of operating systems. Understand the structure and functions of OS. Leam about Processes, Threads and Scheduling Understand the principles of concurency and Deadlocks.

Leam various memory management schemes. Study VO management and File systems. Leam the basics of Linux system and perform administrative tasks on Linux Servers

UNIT I OPERATING SYSTEMS OVERVIEW

Computer System Overview-Basic Elements, Instruction Execution, Intemupts, Memory

Hierarchy,Cache Memory Organization. Operating system overview-objectives and functions, Evolution of Operating System.- Computer System Organization-Operating System Structure and Operations

System Calls, System Programs, OS Generation and System Boot.

UNIT II PROCESS MANAGEMENT

algorithms.

9

Direct Memory Access, Multiprocessor and Multicore

9

Processes-Process Concept, Process Scheduling, Operations on Processes, Interprocess Communication; Threads- Overview, Multicore Programming, Multithreading Models Windows 7 Thread and SMP Management. Process Synchronization Critical Section

Problem, Mutex Locks, Semophores, Monitors; CPU Scheduling and Deadlocks.

UNIT II STORAGE MANAGEMENT 9 Main Memory-Contiguous Memory Allocation, Segmentation, Paging. 32 and 64 bit architecture Examples; Virtual Memory- Demand Paging. Page Replacement, Allocation,

Thrashing: Allocating Kemel Memory, OS Examples. UNIT IV VO SYSTEMS 9 Mass Storage Structure-Overview, Disk Scheduling and Management File System Storage- File Concepts, Directory and Disk Structure, Sharing and Protection; File System Implementation- File System Structure, Directory Structure, Allocation Methods, Free Space

Management, /O Systems. UNIT V CASE STUDY Linux System- Basic Concepts;System Administration-Requirements for Linux System Administrator, Setting up a LINUX Multifunction Server, Domain Name System, Setting Up Local Network Services; Virtualization- Basic Concepts, Setting Up Xen,VMware on Linux

Host and Adding Guest OS.

9

TOTAL: 45 PERIODS

oUTCOMES: At the end of the course, the student should be able to:

Design various Scheduling algorithms. Apply the principles of concurrency. Design deadlock, prevention and avoidance algorithms. Compare and contrast various memory management schemes Design and Implement a prototype frile systems. Perform administrative tasks on Linux Servers. TEXT BOOK: 1. Abraham Silberschatz, Peter Baer Gavin and Greg Gagne. "Operating System Concepts", 9 Edition, John Wiley and Sons Inc., 2012.

REFERENCES: 1. William Stallings. Operating Systems- Intemals and Design Principles'. 7aEdition, Prentice Hall, 2011. 2. AndrewS. Tanenbaum, "Moderm Operating Systems", Second Edition, Addisbn Wesley. 2001. 3. Charles Crowley, "Operating Systems: A Design-Oriented Approach", Tata McGraw Hill

Dr. J.SUNDARARAJAN,

B.EM.Tech, Ph.D PrincipalNATHAM

N:PRColegeot Engineering& Technon Natham, Dindigut (Dt)-624 401.

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

Education", 1996. 4. DM Dhamdhere. Operating Systems: A Concept-Based Approach", Second Edition, Tata McGraw-Hill Education, 2007. 5. http://mptel.ac.in/.

Dr. J.SUNDARARAJAN,

B.E., M.Tech., Ph.D.

Principal N:PR Collegeot Engineering&Technowyy

NMatham, Dindigul (Dt) 624 401.

ENG

NATHAM

TRAFFIC SURVEILLANCE USING

BACKGROUND SUBTRACTION NPR

Oroup of lnstitutions

ALGORITHM Reach.the Star ROONEW OUONHDKOWLEDOE

A PROJECT REPORRT

Submitted by

A.NAVEEN (920812205022)

C.SENTHIL (920812205032)

A.SUNDAR@KARTHIK (920812205034)

In partial fulfillment for the award of the degree

of BACHELOR OF TECHNOLOGY

in

INFORMATION TECHNOLOGY

NPR COLLEGE OF ENGINEERING AND TECHNOLOGY,

NATHAM, DINDIGUL

ANNA UNIVERSITY::CHENNAI 600 025

APRIL 20116

ENGG Dr. J.SUNDAR�EAJAN,

.E. ,Tecit, Pi.id, NATHAM Principat N.PR. College of Engineorii;& Technoiugy Natnan, Dindigui (Dt) b24 4u1.

ABSTRACT

Intelligent video surveillance systems deal with the real-time

monitoring of persistent and transient objects within a specific environment.

This can be applied not only to various security systems, but also to

environmental surveillance. Firstly, the basic principle of moving object

detecting is given by the Background Subtraction algorithm. Then, a self

adaptive background model that can update automatically and timely to

adapt to the slow and slight changes of natural environment is detailed. The

proposed algorithm can be implemented in an embedded system with little

memory consumption and storage space, so it's feasible for mobile phones

and other embedded platforms, and the proposed solution can be used in

constructing mobile security monitoring system with low-cost hardware and

equipments. This trained SVM is the core of a human detection algorithm

which searches optical flow images for human-like motion patterns. A SVM

builds a set of hyper planes in a high or multi-dimensional space can be

used for regression and classification.

Dr. J.SUNDARARAJAN,

B., M.Tech., Ph.0, NATHAM Principa N.P.R. Coege of Engineesi&TecthnO Nathai, Dindigu. i, uds 401.

CHAPTER8

CONCLUSION

We propose a novel framework named DEcOLOR to segment moving

objects from image sequences. It avoids complicated motion computation by

formulating the problem as outlier detection and makes use of the low-Tank

modelling to deal with complex background. We established the link between

DECOLOR and PCP. Compared with PCP, DECOLOR uses the non-convex

penalty and MRFs for outlier detection, which is more greedy to detect outlier

regions that are relatively dense and contiguous. Despite its satisfactory

performance in our experiments, DECOLOR also has some disadvantages.

Since DECOLOR minimizes a non-convex energy via alternating optimization,

it converges to a local optimum with results depending on initialization of^ S,

while PCP always minimizes its energy globally. In all our experiments, we

simply start from ^ S 4 0. Also, we have tested other random initialization of

S and it generally converges to a satisfactory result. This is because the SOFT

IMPUTE step will output similar results for each randomly generated S as long

as S is not too dense.

FUTURE WORK

Currently, DECOLOR works in a batch mode. Thus, it is not suitable for

real-time object detection. In the future, we plan to develop the online version of

DECOLOR thatcan work incrementally, eg, the low-rank model extracted

from beginning frames may be updated online when new frames amive.

DECOLOR may misclassify unmoved objects or large texture less regions as

background since they are prone to entering the low-rank model. To address

these problems, incorporating additional models such as objoct appearance or

shape prior to improve the power of DECOLOR can be further explored in

future. Dr. J.SUNDARARAJAN,

E .Tech., Ph.o., Principz N.PR.Colege of Enear,&schnsiogy

Nahan, Didg. jij C24 401. ATHAM 30

LTPC 3003 cs6402 DESIGN AND ANALYSsIs OF ALGORITHMS

OBJECTIVES:

The student should be made to:

Leam the algorithm analysis techniques. Become familiar with the different algorithm design techniques.

Understand the limitations of Algorithm power. UNIT IINTRODUCTION Notion of an Algorithm Fundamentals of Algorithmic Problem Solving Important Problem

Types-Fundamentals of the Analysis of Algorithm Efficiency Analysis Framework

Asymptotic Notations and its properties - Mathematical analysis for Recursive and Non-

recursive algorithms. UNIT I BRUTE FORCE AND DIVIDE-AND-cONQUER

9

9

3rute Force -Closest-Pair and Convex-Hull Problems-Exhaustive Search Traveling Salesman Problem - Knapsack Problem - Assignment problem. Divide and conquer

methodology Merge sort- Quick sort- Binary search Multiplication of Large

Integers-Strassen"s Matrix Multiplication-Closest-Pair and Convex-Hull Problems.

UNIT II DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE Computing a Binomial Coefficient Warshall's and Floyd" algorithm - Optimal Binary

Search Trees Knapsack Problem and Memory functions. Greedy Technique- Prim'ss

algorithm- Kruskal's Algorithm-Dijkstra's Algorithm-Huffman Trees.

UNIT IV TERATIVE IMPROVEMENT 9

The Simplex Method-The Maximum-Flow Problem Maximm Matching in Bipartite Graphs

The Stable marriage Problem. UNIT V COPING WITH THE LIMITATIONS OF ALGORITHM POWER Limitations of Algorithm Power-Lower-Bound Arguments-Decision Trees-P, NP and NP

Complete Problems-Coping with the Limita Hamiltonian Circuit Problem - Subset Sum Problem-Branch and Bound Assignment problem- Knapsack Problem - Traveling Salesman Problem- Approximation Algorithms for

NP-Hard Problems- TravelingSalesman problem- Knapsack problem.

9

ions Backtracking- n-Queens problem -

TOTAL: 45 PERIODS

OUTCOMES: At the end of the course, the student should be able to Design algorithms for various computing problems. Analyze the time and space complexity of algorithms. Critically analyze the different algorithm design techniques for a given problem. Modify existing algorithms to improve efficiency. TEXT BOOK: 1. Anany Levitin, "Introduction to the Design and Analysis of Algorithms", Third Edition, Pearson Education, 2012. REFERENCES: 1. Thomas H.Cormen, Charles E. Leiserson, Ronad L. Rivest and Clifford Stein, "Introduction to Algorithms", Third Edition, PHI Learning Private Limited, 2012. 2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, "Data Structures ànd Algorithms", Pearson Education, Reprint 2006. 3. Donakd E. Knuth, "The Art of Computer Programming", Volumes 18 3 Pearspn Education, 2009. Steven S. Skiena, "The Algorithm Design Manuai", Second Edition, Sainger, 2008 4. http://nptel.ac.in/

Dr. J.SUNDARARAJAN,

8.E., M.Tech., Ph.D.

Principal

N:PR College otEngineering&

Techno10yy

Natham, Dimdigul (Dt)-624

401.

HATHAM

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

C3 TECHNOLOGIES TRAINING | PROJECTS | PLACEMENTS An ISO 29990:2010 Certified Institution

UKAC

52/33, T.Nagar 3 Cross, Ramanathapuram, Coimbatore -641 045.

Ph: 72000 55778 / 98435 55778. E-mail: [email protected]

Date: 22.12.2015

CERTIFICATE OF IN-PLANT TRAINING This is to certify that Mr. Guru.G.R, B.E-CSE, IV year, student of NPR college of

Engineering &Technology, Natham, Dindigul, had undergone inplant training in our company.


satisfactorily. We wish him good luck.

For C3 TECHNOLOGIES

Dr. J.SUNDARARAJAN, BE, M.Tech., Ph.D.

Princdpal N.PR.College of Engindering& Technology Natham, Dindigul {Dt)- 624 401.

Managlng Director

NATHAM

LTPC 3003

cS6403 sOFTWARE ENGINEERING

OBJECTIVES: The student should be made to: Understand the phases in a software project Understand fundamental concepts of requirements engineering and Analysis Modelling. Understand the major considerations for enterprise integration and deployment.

Learn various testing and maintenance measures

UNITI SOFTWARE PROCESS AND PROJECT MANAGEMENT Introduction to Software Engineering, Software Process, Perspective and Specialized Process Models Software Project Management: Estimation LOC and FP Based Estimation, COCOMO Model Project Scheduling Scheduling, Earned Value Analysis Risk Management. UNIT II REQUIREMENTS ANALYSIS AND SPECIFICATION Software Requirements: Functional and Non-Functional, User requirements, System requirements, Software Requirements Document- Requirement Engineering Process: Feasibility Studies, Requirements elicitation and analysis, requirements validation, requirements management-Classical analysis: Structured system Analysis, Petri Nets- Data Dictionary. UNIT II SOFTWARE DESIGN Design process Design Concepts-Design Model- Design Heuristic Architectural Design -Architectural styles, Architectural Design, Architectural Mapping using Data Flow- User Interface Design: Interface analysis, Interface Design -Component level Design: Designing Class based components, traditional Components. UNIT IV TESTING AND IMPLEMENTATION

9

9 Software testing fundamentals-Internal and external views of Testing-white box testing- basis path testing-control structure testing-black box testing- Regression Testing Unit

Testing Integration Testing Validation Testing System Testing And Debugging Software Implementation Techniques: Coding practices-Refactoring. UNIT V PROJECT MANAGEMENT 9 Estimation- FP Based, LOC Based, Make/Buy Decision, cOcOMO II- Planning- Project Plan,Planning Process, RFP Risk Management ldentification, Projection, RMMM Scheduling and Tracking -Relationship between people and effort, Task Set & Network, Scheduling, EVA- Process and Project Metrics

TOTAL: 45 PERIODS OUTCOMES: At the end of the course, the student should be able to Identify the key activities in managing a software project. Compare different process models. Concepts of requirements engineering and Analysis Modeling. Apply systematic procedure for software design and deployment.

Compare and contrast the various testing and maintenance. TEXT BOOK: 1. Roger S. Pressman, "Software Engineering -A Practitioner's Approach", Seventh Edition, Mc Graw-Hill International Edition, 2010. REFERENCES: 1. lan Sommerville, "Software Engineering", 9h Edition, Pearson Education Asia, 2011. 2. Rajib Mal, "Fundamentals of Software Engineering", Third Edition, PHI Learning Private Limited ,2009. 3. Pankaj Jalote, "Software Engineering, A Precise Approach", Wiley India, 2010. 4. Kelkar SA., "Software Engineering", Prentice Hall of India Pvt Ltd, 2007. 5. Stephen R.Schach, "Software Engineering", Tata McGraw-Hill Publishing CompanyLimited,2007. Dr. J.SUNDARARAJAN,

B.E., M.Tec., Ph.D. Principal

N.PR.College of Engineering& TechnoiugyNatham, Dindigut (Dt) - 624 401.

NATHAM

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

NPRCollege of Engineering& Technology NPR Nagar, Natham, Dindigul - 624401. Tamil Nadu, India

Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai Phone No: 04544- 246 S00, 246501, 246502.

Websire: wwwaprcolleges org www.nprcetorg, Email nprcerprincpal@uprcolleges org

NPR Rrach the Star

Date: 06.02.2016 Ref: NPRCET/OFF/CSE/AV/2015-16

To

The Managing Director. C3 Technologies, Coimbatore. Tamilnadu-641023.

Dear Sir.

Sub: Seeking permission for Industrial Visit to our CSE students - reg.

Ref: MoU dated on 09/12/2015

Hereby I am looking permission for our final year CSE 47 students along with 3 faculties to visit your esteemed company on 25.02.2016 (Thursday). As per the stipulations of Anna University. our students are expected to make

industrial visits to appreciate the practices made in industry. In this regard I

request you to permit our students to visit your company. We look forward to

receive your favorable response.

Thanking you

PRINCIPAL

Prticipal PR. College of Engineering& Technology

Natham, Dindigul (Dt) -624 401 .

Dr. J.SUNDARARAJAN,

B.EMTech, Ph.D., Principal N.PR.College of Engineering& Technology Natham, Dindigul (Dt) 624 401.

c C3 TECHNOLOGIES TRAINING | PROJECTS | PLACEMENTS An ISO 29990:2010 Certified Institution UKAC



Date: 16.02.2016

To

The Principal,

NPR College of Engineering & Technology,

Natham,

Dindigul-624 401.

Sir,

Sub: Industrial Visit-Reg

With reference to your letter dated on 06.02.2016, we wish to inform you that we

permit 47 students belongs to, final year computer science and engineering, along with 3

faculties to visit our company on 25.02.2016 (Thursday).

EATHAM

For C3 TECHNOLOGIES

Managlng Dlrector

Princlpal NPR.Collsge of Engineering&Technol- Natharn, Dindigul (Dt)- 624 401

Dr. J.SUNDARARAJAN,

B. M.Tech., Ph.D. Principal N.PR.Colege of Engineering& Technology Natham, Dindigul (Dt).624 401.

NPRcollege of Engineering & Technolog NPR Nagar, Natham, Dindigul 624401, Tamil Nadu, India

Approved by AICTE, New Delhi & Afiliated to Anna University, Chennai Phone No: 04544- 246 S00, 246501, 246502.

Website www.nprcolleges o1g, www.nprcet org, [email protected]

NPR

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Industrial Visit to C3 technologies on 25.02.2016

STUDENTS NAMELIST

REGISTER STUDENT S.NO STUDENT NAME NUMBER ATTENDANCE 20812104001 AARTHY.S

920812104002 ABIRAMI.J

920812104003 ABISHEKA.R.S 920812104004 AFZALAHAMED.A

920812104005 ANANTHALAKSHMI.B

O 920812104006 ANITHA.R

920812104007 ANUSHA.R 8. 920812104009 ANUSUYADEVI.T

9 920812104010 AROCKIAMARYLIFNA.S

10 TI.

920812104011 ARUN.R 9208 12104012 BALAVIGNESH.M

920812104013 BAMAJ 13. 920812104014 BARKAVI.M

14. 920812104015 BHARATH.N

15. 920812104016 BHUVANESHWARI.M

6. 920812104017 CLINGTON XAVIER.S AB 17. 920812104018 DHARANI.K

18. 920812104019 DIVYA.B

9. 920812104020 ELAKIYA.S

20. 920812104021 GAJAPATHI.E

920812104022 GANESH.V

2. 920812104023 GEETHA.S 23. 920812104024 GURU.G.R

24. 920812104025 HEMA.R

25 920812104026 HEMA.R 26. 920812104028 HEMAVATHY.E

920812104029 920812104030 92081210403|

27. INDRA.M 28. INDRAJITHSUNDAR.V

29. JANANI.S

30. 920812104032 JEYALAKSHMI.M

31. 9208 12104033 JEYAPRATHA.E 32. 920812104034 JONES KASHMIR RAJ.G

33. 920812104035 JOTHIMANI.R 34. 920812104036 KALAIYARASIA

35. 920812104037 KARTHIGAA.U.M

36. 920812104039 KEERTHANA.R

AB 37. 920812104040 KEERTHIKA.R

NPR College of Enginering & Techmology NPR Nagar, Natham, Dindigul 624401, Tamil Nadu, India.

Approved by AICTE. New Delhi& Affliated to Anna Unirersity. Chenn Phone No. 01544- 246 S00, 246501, 246502

Website www.nprcolleges.org. www.nprcet org, Email nprcetprmcpal @nprcolleges.org

NPR

38. 920812104041 KIRUTHIGA. U.J

39 920812104042 MADHUBALA.M 40. 920812104043 MALLIKA.R

41. 920812104044 MARGRATEMARY.S 42. 920812104045 MARIAPREETHIF

MITHUNMUTHUPRAKASH.MK 43 920812104046 44. 920812104047 MOHAMED ISMAIL.H 45. 920812104048 MOHANARANGAM.K 46. 920812104049 MUTHUPANDI.A 47. 920812104050 NAGARAJ.R

Faculty Co-ordinatorS r R.Hariharan. A P/CSE K. H

2. Mrs.A.Akilarani. AP/CSEK T

3. Ms.P.Durgadevi.AP/CSsE t

HoD/CSE PRINCIPAL

Principal N.PR.College of Engineering &Technology Netam, Dindigul (D:)- 624 411

NATHAM

Dr. J.SUNDARARAJAN, B.E M.Tech., Ph.D.,

Principal N.PR.College of Engineering& Technology

Natham, Dindigul (Dt).624 401.

NPRCollege of Engineering & 1leehnology NPR Nagar, Nathan, Dindigul - 624401, Tarnil Nadu, ndia

Approved by AICTE, New Delhi & Affiliated to Ana University, Chennai

An ISO 9001:2015 Certikied Iustitution Phone No: (04544- 246 S00, 246501, 246502.

Website: www.uproll-ges.org, www.uprctong, [email protected]

NPR Reveh t?ze S7ar

PHOTO GALLERY

Final year CSE students Industrial Visit to C3 Technologies on 25.02.2016

NG NATHAM

Dr. J.SUNDARARAJAN, B.EM.Tech, Ph.D.

Princip N.PR.College of Engineering & Technology

Natham, Dindigu! (Dt)- 624 401

0019 OL

Cs6601 INTERNET PROGRAMMING LTPC 3 104

OBJECTIVES: Tho studont should bo mado to: Loan Java Programming. Understand different Internet Technologies. Be exposed to java specific web services architecture. UNIT 1 JAVA PROGRAMMING An overview of Java - Data Types- Variables and Arrays - Operators Control Statements - Classos- Objects - Mothods-Inheritance Packages - Abstract classes - Interfaces and

Innerclasses Exception handling Introduction to Threads Multithreading String9 handling-Streams and l/O -Applets. UNIT II WEBSITES BASICS, HTML 6, CSS 3, WEB 2.0 Wob 2.0: Basics-RIA Rich Internet Applications Collaborations tools websltos and wob sorvers: Understanding Internet Difference between websites and web server- Internet technologies Overvlew -Understanding the difference between internet and Intranet; HTML and CSS: HTML 5.0, XHTML, SS 3. UNIT II I CLIENT SIDE AND SERVER SIDE PROGRAMMING Java Scrlipt: An introduction to JavaScript-JavaScript DOM Model-Date and Objects Regular Expressions- Exception Handling-Validation-Built-in objects-Event Handling- DHTML with JavaScript. Servlets: Java Servlet Architecture- Servlet Life Cycle- Form GET and POST actions- Session Handling- Understanding Cookies- Installing and Configuring Apache Tomcat Web Server- DATABASE CONNECTIVITY: JOBC perspectives, JOBC program example JSP: Understanding Java Server Pages-JSP Standard Tag

Library(JSTL)-Creating HTML forms by embedding JSP code. UNIT IV PHP and XML

Understanding

11

8 An Introduction to PHP: PHP Using PHP- Variables- Program control- Built-in functions- Connecting to Database Document Type Definition- XML Schema DOM and Presenting XML, XML Parsers and

Validation, XSL and XSLT Transformation, News Feed (RSS and ATOM). UNIT V INTRODUCTION TO AJAX and WEB SERVICES

Using Cookies-Regular Expressions; XML: Basic XML-

9 AJAX: Ajax Client Server Architecture-XML Http Request Object-Call Back Methods; Web Services: Introduction- Java web services Basics Creating, Publishing Testing and Describing a Web services (WSDL)-Consuming a web service, Database Driven web service from an application SOAP.

TOTAL (L:46+T:15): 60 PERIODS OUTCOMES: At the end of the course, the student should be able to:

Implement Java programs. Create a basic website using HTML and Cascading Style Sheets. Design and implement dynamic web page with validation using JavaScript objects and by applying different event handling mechanisms. Design rich client presentation using AJAX. Design and implement simple web page in PHP, and to present data in XML format.Design and implement server side programs using Servlets and JSP TEXT BOOKS: 1. Deitel and Deitel and Nieto, "Internet and World Wide Web - How to Program", Prentice

Hall5m Edition, 2011. 2. Herbert Schildt, "Java-The Complete Reference", Eighth Edition, Mc Graw Hill Professional, 2011. REFERENCES: 1. Stephen Wynkoop and John Burke "Running a Perfect Website". QUE, 2nd Edition, 199 2. Chris Bates, Web Programming- Building Intranet Applications, 3rd Edition, Wiley Publications,2009.

Dr. JSUNDARARAJAN,

8.E, M.Tech., Ph.D.

Principal NATHAM

N:PR.College of Engineering& Technuivyy

Natham, Dindigut (Dt)-624 401

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

CMS IT TRAINING INSTITUTE

Expect The World From Us A Diviston of CMS IT Services Put. Lid.

25t", June' 2016


This is to certify that Mr. Thamson Antony.A, studying B.E (cSE) student of NPR College of

Engineering & Technology, Natham, Dindigul has successfully completed Internship Training from

07.06.2016 to 25.06.2016 in our organization.

Yours Sincerely,


R Dr. J.SUNDARARAJAN,

B.EM.Tech., Ph.D. Principal

N.PR.College of Enginering& Technoioy Natham, Dindigul (Dt)-624 401.

AuthorizbcS EHATHAM

Licensee: Entrust Technoservices Pvt. Ltd.

3rd Floor, TABS Complex, Opp. American Hospital, 41, Bharathidasan Salai, Cantonment, Trichy -620 001

CMS Phone 0431- 4250437, Email [email protected] Website: www cmsinstitute.co.in

CS6502 OBJECT ORIENTED ANALYSIS AND DESIGN LTPC 3 003

OBJECTIVES: The student should be made to Learn the basics of 00 analysis and design skills. Learn the UML design diagrams. Lean to map design to code. Be exposed to the various testing techniques. UNIT I UML DIAGRAMS

Introduction to OOAD Unified Process - UML diagrams Use Case Class Diagrams- Interaction Diagrams State Diagrams - Activity Diagrams- Package, component and Deployment Diagrams. UNIT II DESIGN PATTERNS 9 GRASP: Designing objects with responsibilities Creator Information expert - Low Coupling- High Cohesion Controller- Design Pattems creational -factory method -structural- Bridge -Adapter behavioral -Strategy- observer. UNIT I1 CASE STUDY Case study the Next Gen POS system, Inception -Use case Modeling

9

Relating Use cases include, extend and generalization Elaboration Domain Models Finding conceptual classes and description classes Associations Attributes Domain refinement- Finding conceptual class Hierarchies- Aggregation and Composition. UNIT IV APPLYING DESIGN PATTERNS

System sequence diagrams Logical architecture and UML package diagram - Logical architecture refinement class diagrams- UML interaction diagrams - Applying GoF design pattems. UNIT V CODING AND TESTING

odel

Relationship between sequence diagrams and use cases UML

9 Mapping design to code- Testing: Issues in 0O Testing- Class Testing -00 Integration Testing GUI Testing-00 System Testing.

TOTAL: 45 PERIODS oUTCOMES: At the end of the course, the student should be able to: Design and implement projects using O0 concepts. Use the UML analysis and design diagrams. Apply appropriate design patterns. Create code from design. Compare and contrast various testing techniques. TEXT BOK:

1. Craig Larman, "Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and Iterative Development', Third Edition, Pearson Education, 2005. REFERENCES: 1. Simon Bennett, Steve Mc Robb and Ray Farmer, "Object Oriented Systems Analysis and Design Using UML", Fourth Edition, Mc-Graw Hill Education, 2010.

2. Erich Gamma, and Richard Helm, Ralph Johnson, John VIlissides, "Design pattems:

Elements of Reusable Object-Oriented Software", Addison-Wesley, 1995. 3. Martin Fowler, "UML Third edition, AddisonWesley, 2003. 4. Paul C. Jorgensen, "Software Testing:- A Craftsman's Approach", Third Etition, Auerbach Publications, Taylor and Francis Group, 2008.

tilled: A Brief Guide to the Standard Object Mod�ling Language"

Dr. J.SUNDARARAJAN, B.E, M.Tech., Ph.D.

Principal N.PR. College ot Engineering & Technology

Natham, Dindigul (Dt).624 401. NATHAM

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

C3 TECHNOLOGIES TRAINING I PROJECTS | PLACEMENTS An ISO 29990:2010 Certified institution

UKAC

52/33, T.Nagar 3d Cross, Ramanathapuram, Coimbatore -641 045. Ph:72000 55778/98435 55778. E-mail: [email protected]

Date: 22.12.2015

CERTIFICATE OF IN-PLANT TRAINING This is to certify that Mr. Arun.R, B.E-CSE, IV year, student of NPR college of Engineering

&Technology, Natham, Dindigul, had undergone inplant training in cur company.


satisfactorily.


For C3 TECHNOLOGIES

Dr. J.SUNDARARAJAN,

B.E M.Tech., Ph.D. Principa N.PR.College of Engineening&Technclogy

Natham, Dindigul (Dt) -624 401.

Managina Director

ATHAM

LTPC CS6503 THEORY OF COMPUTATION

3003

OBJECTIVES: The student should be made to: Understand various Computing models like Finite State Machine, Pushdown Automata,

and Turing Machine. Be aware of Decidability and Un-decidability of various problems. Leam types of grammars. UNITI FINITE AUTOMATA Introduction- Basic Mathematical Notation and techniques- Finite State systems - Basic

Definitions - Finite Automaton - DFA & NDFA Finite Automaton with ¬- moves - Regular

Languages- Regular Expression Equivalence of NFA and DFA Equivalence of NDFA"s

with and without E-moves - Equivalence of finite Automaton and regular expressions Minimization of DFA- - Pumping Lemma for Regular sets - Problems based on Pumping

Lemma. UNIT I GRAMMARS Grammar Introduction- Types of Grammar Context Free Grammars and Languages Derivations and Languages - Ambiguity- Relationship between derivation and derivation

trees Simplification of CFG Elimination of Useless symbols Unit productions Null productions-Greiback Nomal form- Chomsky normal form- Problems related to CNF and

GNF. 9 UNIT II PUSHDOWN AUTOMATA

Pushdown Automata- Definitions Moves Instantaneous desciptions Deterministic pushdown automata Equivalence of Pushdown automata and CFL pumping lemma for CFL-problems based on pumping Lemma. UNIT IV TURING MACHINES 9

Models Computable languages and functions Definitions of Turing machines Techniques for Turing machine construction Multi head and Multi tape Turing Machines The Halting problem Partial Solvability Problems about Turing machine- Chomskian hierarchy of languages. UNIT V ÚNSoLVABLE PROBLEMS AND COMPUTABLE FUNCTIONS Unsolvable Problems and Computable Functions- Primitive recursive functions-Recursive and recursively enumerable languages Universal CLASSIFYING COMPLEXITY: Tractable and Intractable problems- Tractable and possibly intractable problems - P and NP completeness- Polynomial time reductions

9

Turing machine. MEASURING AND

TOTAL: 45 PERIODS OUTCOMES: At the end of the course, the student should be able to:

Design Finite State Machine, Pushdown Automata, and Turing Machine. Explain the Decidability or Undecidability of various problems TEXT BOOKS: 1. Hopcroft J.E., Motwani R. and Ullman J.D, "Introduction to Automata Theory. Languages and Computations", Second Edition, Pearson Education, 2008. (UNIT 1,2.3) 2. John C Martin, "Introduction to Languages and the Theory of Computation", Third Edition,

Tata McGraw Hill Publishing Company, New Delhi, 2007. (UNIT 4,5)

REFERENCES 1. Mishra K LP and Chandrasekaran N, Theory of Computer Science Automata, Languages and Computation", Third Edition, Prentice Hall of India, 2004. 2. Harry R Lewis and Christos H Papadimitriou, "Elements of the Theory of Computation" Second Edition, Prentice Hall of India, Pearson Education, New Delhi, 200.

3. Peter Linz, "An Introduction to Formal Language and Automata", Third Edition, Narosa

Publishers, New Delhi, 2002. 4. Kamala Krithivasan and Rama. R, "Introduction to Formal Languages, Atomata Theory and Computation", Pearson Education 2009

Dr. J.SUNDAR�RAJAN,

8.E., M.Tech., Ph.D.

Principal

N.PRCollege ot Engineering& TechnoiogY Natham, Dindigut (Dt) 624 401, NATHAM

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

TM


Expect The World From Us A Diviston of CMS IT Services Pvt. Lid

25th, Dec 2015

To Whom So Ever It May Concern This is to certify that Ms. Jentfa. V, Department of Computer Science & Engineering, NPR College of

Engineering& Technology, Natham, Dindigul, has undergone inplant training from 18.12.2015 to





Yours Sincerely,


Authorized Signa9

Dr. J.SUNDARARAJAN, B.EM.Teck., Ph.D.,

Principi N.PR. Colege of Enginering & Technology


NATHAM



CMS Phone:0431-4250437, Email: [email protected] Website: www.cmsinstitute.co.in

SEO

LTPC 3003

CS6504 COMPUTER GRAPHIcS

OBJECTIVES: The student should be made to: Gain knowledge about graphics hardware devices and software used. Understand the two dimensional graphics and their transfomations Understand the three dimensional graphics and their transfomations. Appreciate illumination and color models. Be familiar with understand clipping techniques UNITI INTRODUCTION Survey of computer graphics, Overview of graphics systems- Video display devices. Raster scan systems, Random scan systems, Graphics monitors and Workstations, Input devices Hard copy Devices, Graphics Software: Output primitives points and lines, line drawing algornithms, loading the frame buffer, line function; circle and ellipse generating algorithms; Pixel addressing and object geometry, filled area primitives. UNIT II TwO DIMENSIONAL GRAPHICS 9

Two dimensional geometric transfomations- Matrix representations and homogeneous coordinates,composite transformations; Two dimensional viewing - viewing pipeline, viewing

coordinate reference frame; widow-to-viewport coordinate transfommation, Two dimensional viewing functions; clipping operations point, line, and polygon clipping algonithms.UNIT III THREE DIMENSIONAL GRAPHICS 10

Three dimensional concepts; Three dimensional object representations-Polygon surfaces Polygon tables- Plane equations Polygon meshes; Curved Lines and surfaces, Quadratic surfaces; Blobby objects; Spline representations Bezier curves and surfaces -B-Spline curves and surfaces. TRANSFORMATION AND VIEWING: Three dimensional geometric and modeling transformations -Translation, Rotation, Scaling, composite transformations; Three dimensional viewing viewing pipeline, viewing coordinates, Projections, Clipping: Visible surface detection methods. UNIT IV ILLUMINATION AND cOLOUR MODELS Light sources - basic illumination models - halftone pattems and dithering techniques;

Properties of light- Standard primaries and chromaticity diagram; Intuitive colour concepts RGB colour model - YIQ colour model CMY colour model - HSV colour model - HLS colour

model; Colour selection. UNIT V ANIMATIONs & REALISM

ANIMATION GRAPHICS: Design of Animation sequences - animation function raster animationkey frame systems - motion specification -morphing weening. COMPUTER

GRAPHICS REALISM: Tiling the plane - Recursively defined curves- Koch curves- C

curves - Dragons space fling curves fractals Grammar based models - fractals

turtle graphics- ray tracing.

10

TOTAL: 45 PERIODS OUTCOMES: At the end of the course, the student should be able to: Design two dimensional graphics.

Apply two dimensional transfomations. Design three dimensional graphics. Apply three dimensional transfomations. Apply Ilumination and color models. Apply clipping techniques to graphics.

Design animation sequences. TEXT B0OKS: 1. John F. Hughes, Andries Van Dam, Morgan Mc Guire David F. Sklar, James D. Foley. Steven K. Feiner and Kurt Akeley. Computer Graphics: Principles and Practbe.3 Edition, Addison- Wesley Professional,2013. (UNIT I, I, I, M. 2. Donald Heam and Pauline Baker M, "Computer Graphics", Prentice Hall. yew Pelhi, 2007

Dr. JSUNDARARAJAN,

B.E M.Tech., Ph.D

Principal NHPR ColegeotEngineening& Technoivgy

Nathem Dindigut (Dt)- 624 401.

NATHAM

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

(UNIT V). REFERENCES:

Donald Hean and M. Pauline Baker, Warren Carithers,"Computer Graphics With Open GL', 4t Edition, Pearson Education, 2010. 2 Jeffrey McConnell "Computer Graphics: Theory into Practice", Jones and Bartett Publishers,2006. 3. Hill F S Jr., "Computer Graphics", Maxwell Macmllan", 1990. 4. Peter Shirley, Michael Ashikhmin, Michael Gleicher, Stephen R Marschner, Erik Reinhard, Kelvin Sung, and AK Peters, Fundamental of Computer Graphics, CRC Press, 2010.

5. William M. Newman and Robert F.Sproull, "Principles of Interactive Computer Graphics Mc Graw Hill 1978. 6. http://nptel.ac.in/

Dr. JSUNDARARAJAN, B.E., MTech., Ph.D.,

Principal N.PR.College ot Engineering& Technoiugy

Natham, Dindigui (Dt)- 624 401.

NATHAM

C

NP R College of Engineering & Technology ;'lil'R Nagai , N~tham, D10d1gul - 624-101. Tamil Nadu, lnd1~

App10, td bv AI CTT N t"-· Ddl,i f.· Aflib,! t cl to Anm Um, ·m ilv. Chm rm Phone No 04 54-1 246 500. 246501. 2•16502

We!> 1f'r "......,,. nprto!l~f~ Of~~ itprc~Clf~. Emlll nprt~ m~rp.il ~ 1m:1>Ut~t1 er~

Rd: NPRCET/OFF/C'Sf:/IV/20I5- 16

The Center Head . CMS IT SerYices Pri,atc Limited . Tri chY. Ta rnilnadu - 620 001 .

Respected Sir.

0:ite: 2R.0l.20I6

Sub : Pcm, ission for Industrial Visit to our CSE students - Reg.

Ref: J\1 oU dated on 15/12/20 15

\\"ith the reference to the above. our third year CSE 55 students and J facu lties ,,·ould like to visi t your esteemed company on 18.02.20 16 (Thursday ). This , isit \\i ll be , ·ery useful for our students to know the industrial expectations & experience . In this regard I request you to permit our students to \·isit :,:our company. 'J..ie look forward your kind repl y.

Thanking you

,m~~~~'\-- -PRINC IPAL

Prn1;:1i:.al .~. P.R. Coll:-·J2 c-f E:igim'ering & fo:hnc1,.:

Nalh.Y.i\ Dificigt,:1 (Dt) -624 401

~r . ~ AJAN , M.Toch , Ph.O,

Prlncl p I N.P.R. Cotiege o# Engineering & Technology

N1thllfl\ Oindigul (Ot) · 624 40 I.

C

0

NP R College of Engineering & Technology NPR Nagar. Nalham, Dmd,gul - 624-101 , Tamil Nadu, India

Appro,·ed by A1CTE. Ne"· Dellu & Afllliated to Anna Uruvm1ty, Cherum Phone No 0-1544- 246 500, 246501 , 246502 Wclmte ""'°"·.nprcolleges otg.. """""·.npmt.otg. Em.ul:nprcetprincrpal ~nprco\legei 01g

Acceptance mail from CMS IT SERVIC ES Pvt Lid for Jnduslrial Visit

M Gmail CSE HoD NPRCET <[email protected]>

Request for Industrial visit regarding from NPR College of Engineering and Technology 2 messages

NPR CET <[email protected]> To: [email protected]

Greetings Ill Dear Sir,

Sat, Jan 30, 2016 at 10 12 AM

With the references of the permission letter from our principal, we request you to allow our Ill CSE 55 Students and 3 faculties on 18.02.2016 for Industrial Visits in your company. Kindly consider this request and reply your conformation by today ASAP for further formalities to be made in our institution.

Thank you. With regards, V.DEVI , ME, HOD-CSE NPR College of Engineering and Technology, Natham.

ramalingam <[email protected]> To NPR CET <[email protected]> Cc [email protected], [email protected]

Dear Sir,

Greetings from CMS ! ! !

Sat, Jan 30, 2016 at 10:43 AM

We are pleased to confirm accepting your students for the Industrial Visit to our office :

18.02 .2016 - 55 Students

We request your students to pay Rs.200/- per student for Food & beverages.

With best regard s,

VN Ramalingam

Center Head,

I>r. B.E., Tacli., Ph.D.,

Principal N.P.R eotlege ~ Engineering & T ochno1ogy

Natham, Dtndlgul (Ot) • 624 401 .

J ,r~;:,.h ~~ -

I::, - ' I \I i ·. ,_ , , , l .

NPt< Cviiege of Enginceri:1g & Tc-d i.:.:.:L,:'y Natham, Oindigul (Dt) -624 401 ~

0

C

NP R College of Engineering & Technology Apprcl\·ed by AICTE, N,w Ddhi & Affih~t ed to Ann~ Ul'U'-w;ity . Cberuu1

Phone No: 04 5-H- 2-1 6 500, 246501 , 246502 Weos~ : = .nprcoll~es .Of!, .........-.nprc~org. Em.Jil:nprmprm~Ji~prcolle~ei 0tE

NPR Nagar , Natham, Dindigul - 624401 , Tam il Nadu., India_ j l....--'------ -

S.NO 1. 2. 3. 4. 5. 6.

7. 8. 9 . 10.

11. 12 . 13 .

14.

15 . 16. 17.

18. 19 . 20. 21. 22 .

23. 24 . 25 .

26.

27 . 28 .

29. 30.

31. 32 . 33 . 34. 35. 36.

37 . 38. 39. 40.


INDUSTRIAL VISIT TO CMS IT SERVICES Pvt Ltd on 18.02.2016

STUDENTS NAMELIST

REGISTER NUMBER STUDENT NAME SIGNATURE 920813104001 Aanand.S t(_ ) - <?_

920813104003 Aishwarya.B ' i( . ~ l ~ l L'~L

920813104004 Aishwarya.R ~.»-q_ u 920813104005 Aminathu l Raheela.B ~~ 920813104006 Ami rtha Priya. L.M.S -4 { v-- q '-920813104007 Aru nkuma r.P fr . u' 920813104008 Ba hirathi .R r, ~ I

( p- ,\-

920813104009 Chandra. R f'J .. ,.d -- ~ -Mu 920813104010 Cha ndra Lekha.R

920813104011 Deebika.M i..l' -f.2..--920813104013 Dh ivyaa .P 'I)'k., r\ --.V-. ... i=

-920813104014 Hema Latha .L ~ 920813104016 : Jenifa .V ~-\--920813104017 lt<avya.D ~ -- ~ 920813104018 Mani. D

~~ • - -a-c ~ "'- ii;,,,,_ .J:i:, 920813 104019 Man ikandan .B L __ - fee:= -\)--920813104020

1 Manivannan .D ___ \

920813104021 Manoj Bala .V -- v- --

~~, ~~-,· -920813104022 Mukesh Kumar .R -~q_ L L \_

-92081310402 3 Nasreen Banu.S

- -- ,_ -920813104024 Natchiappan .M 4., c..._ . f-.C1._ -- -9..~,-g

, 920813104025 Pandipriyan .R.B -- -920813104026 Pavi thra .A ~ '

920813104027 Pradheeba .G Yv--,d LLt___ 920813 104028 Prasan na .l (P_ ?___.,._ 920813104029 Praveena .M 11.)9.. tr A A .-. '-- I 920813104030 Praveen Kumar.C _r . cB_r-~ ,,~·-920813104031 Priyan ka.MR

" A (\./ \,_f.._ 920813104032 Priyanka.P <\) _,__,I_ ..... - '7

920813104033 Priya Shree .R ~ ~ p C,. 920813104034 Rajalakshmi.G .Y ~ • 1 .~

920813104036 Ramar.P ~ ---·Z 920813104037 Ramesh Babu.P -=.. ~~ .... --=s, ~,_. <::._ \a._..,_~

920813104038 Ram ita.J .,_p. ""'~~ 920813104040 Santhosh Kumar.S 5,..._r-....~!lo\ "', \.,,L U ,~ · ~

920813104041 Sara nya.J _s.,,, '-U._t"-... )-A

920813104042 Siddharth.K.P s;J-rM.. .J?: /c. \r, 920813104043 Sivashankari .D ~ '(A' t\ .l ,. 920813104044 Stal in.M.K ~ ) ~ ,( 1/ t, 920813104045 Subina Mary.A ;:; l\1)--

c__.., I

NPR College of En&ineerlng & Technology NPR Napr, Nadwn, Dindigul - 624401, Tamil Nadu, India.

Approved by AICTE. New Delhi & Affl&ated to Anna Univenity, Chemw.

Phone No: 04544- 2'16 SOO, 246501; 246502. Websile : www~e1.org, .-.-w.llplCtlorg. F.mabptcetpcilcipal~11.cq

-41. 920813104046 Sudharsan.S ~ :: IJ

42. 920813104047 Sujanandinl.J - ,i r. t...-i 43. 920813104048 Sumaiyabanu.M.A L_ I ' _JC>

C

44. 920813104049 Sureshkannan.M ~Al'-' ~ 45. 920813104050 Swetha.S -_a.,-1b. 46. 920813104051 Tamil selvl.G - ' V ,<._ 'I

47. 920813104052 Vaisnavl.S ½ > ... -~ ... • 48. 920813104053 Veena.T CJ-,

49. 920813104054 Veera Mani.V v~ so. 920813104055 Vignesh.G Ci~ .. .!. 51. 920813104056 Vignesh.R ~ u· 1

52. 920813104057 Vijay.N \1 ~~ 53. 920813104058 Vijaya Lakshmi.M vftnura [/\kd--rt1i

54. 920813104059 Yohithapandi.M \ ;-- ,J .. ~ ■ •

55. 920813104301 Vijaya Kumar.G t , '>' ~ ~ '-._)

FACULTY IN-CHARGES

1. Mr.J.VISWANATH, AP/CS~ •

2. Mrs.R.VIDHYA, AP/CSE. .-F -3. Ms.R.DIVYA, AP/CS~

HoD/CSE

Dr. FJ. :., fl.II.Tech., Ph.D.,

Prine! al N.P.R. College of Engineerinn 81 Technology

Natharn., Dindigu! (Ot/ -624 40 1.

~ -~r PRINCIPAL

~Principal N.P.A College of Engineering-& Technology

. ''Nathatn, Oindigul (Dt) • 624 401

•

NPR College,ofEngineennc.&TedmoloU NPR Nagar, Nalham, mll.d.im.l · 624401, Tamil Nadu, India

.Approved by AlCTE, New .Delhi & Affili:ited to Amu Univenity, Ch=i An ISO 9001: 2015 Certified. In:.1itu.tion.

U,--«1(-ll tl10.• S t m · :Phone No: ()4544• 246 500J 246501, 246502. '1.'clnic! : www. :n.-oll~•~ .Q •, n'<l'<l' .ll :n:a •, Ew:iil:n . riuc· al

PHOTO GALLERY

e

Third Year CSE Students Industrial Visit to CMS IT SERVICES Pvt Ltd on 18.02.2016

Dr. .RAJAN, B.E. M.Tech., Ph.D.,

Princ ip I N.P.R. College of Engineering & Technology

Nath all'.., Dindigul (Dt) • 624 401 .

LTPC 3003

Cs6601 DISTRIBUTED SYSTEMs

OBJECTIVES: The student should be made to: Understand foundations of Distributed Systems. Introduce the idea of peer to peer services and file system. Understand in detail the system level and support required for distributed system. Understand the issues involved in studying process and resource management UNIT I INTRODUCTION 7 Examples of Distributed Systems-Trends in Distributed Systems - Focus on resource

sharing Challenges. Case study: World Wide Web.

UNIT I COMMUNICATION IN D*STRIBUTED SYSTEM System Model - Inter process Communication the API for internet protocols - External data

representation and Multicast communication. Network virtualization: Overlay networks Case study: MPI Remote Method Invocation And Objects: Remote InvocationIntroduction-Request-reply protocols Remote procedure call - Remote method invocation. Case study: Java RMI -Group communication Publish-subscribe systems Message ueues Shared memory approaches Distributed objects Case study: Enterprise Java Beans-from objects to components. UNIT II PEER TO PEER SERVICES AND FILE SYSTEM Peer-to-peer Systems Introduction Napster and its legacy Peer-to-peer Middleware Routing overlays. Overlay case studies: Pastry, Tapestry- Distributed File Systemns Introduction File service architecture -Andrew File system. File System: Features-File model -File accessing models - File sharing semantics Naming: Identifiers, Addresses, Name Resolution Name Space Implementation - Name Caches - LDAP. UNIT IV SYNCHRONIZATION AND REPLICATIONN Introduction Clocks, events and process states Synchronizing physical clocks- Logical time and logical clocks Global states Coordination and Agreement- Introduction Distributed mutual exclusion - Elections Transactions and Concurrency Contro Transactions -Nested transactions Locks - Optimistic concurrency control - Timestamp ordering- Atomic Commit protocols -Distributed deadlocks Replication Case study -Coda. UNIT V PROCESS & RESOURCE MANAGEMENT Process Management: Process Migration: Features, Mec Issues, Implementation. Resource Management: Introduction- Features of Scheduling Algorithms -Task Assignment Approach - Load Balancing Approach - Load Sharing Approach.

10

10

9

nism - Threads: Models,

TOTAL: 45 PERIODS OUTCOMES: At the end of the course, the student should be able to: Discuss trends in Distributed Systems. Apply network virtualization. Apply remote method invocation and objects. Design process and resource management systems. TEXT BOOK: 1. George Coulouris, Jean Dollimore and Tim Kindberg. "Distributed Systems Concepts and Design", Fifth Edition, Pearson Education, 2012. REFERENCES: 1. Pradeep K Sinha, "Distributed Operating Systems: Concepts and Design".Prentice Hall of India, 2007. 2. Tanenbaum A.S., Van Steen M., "Distributed Systems: Principles and Par�digms" Pearson Education, 2007. 3. Liu M.L.. "Distributed Computing, Principles and Applications", Pearson Educatión, 2004. 4. Nancy A Lynch, "Distributed Algorithms", Morgan KautmantuogdNDARARAJAN,

8.E. N.Tech., Ph.D. Principal N.PR. College of Engineering& Technoloyy

Natham, Dindigul (Dt)-624 401.

MATHA

19

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

TM

CMS IT 1PAINING INSTITUTE

Expect The World From Us A Diviston of CM5 IT Serviccs Pvt. Lid.

25", June' 2016


This is to certify that Mr. Thariq Arsath.S, studying B.E (CSE) student of NPR College of Engineering &

Technology, Natham, Dindigul has successfully completed Internship Training from 07.06.2016 to


Yours Sincerely,


R SP Authorized atoryK Dr. J.SUNDARARAJAN,

f_Trichy

620001 De B.EM.Tech., Ph.D., NATHAM Principal N.P.R.College of Engineering& Technoioy

Natham, Dindigul (Dt)- 624 401.

Licensee :: Entrust Technoservices Pvt. Ltd.

3rd Floor, TABS Complex, Opp. American Hospital, 41, Bharathidasan Salai, Cantonment, Trichy 620 001

CMS Phone:0431-4250437, Email [email protected] Website: www.cmsinstitute.co.in

209

T6601 C LTP 3003

MOBILE COMPUTING

oBJECTIVES The student should be made to: Understand the basic concepts of mobie computing Be familiar with the network protocol stack Leam the basics of mobile telecommunication system Be exposed to Ad-Hoc networks Gain knowledge about díferent mobile platfoms and application development UNITI INTRODUCTION 9 Mobile Computing Mobile Computing Vs wireless Networking- Mobile Computing Applications -Characteristics of Mobile computing Structure of Mobile Computing Application. MAC Protocols - Wireless MAC Isues - Fixed Assignment Schemes Random Assignment Schemes - Reservation Based Schemes. UNIT I MOBILE INTERNET PROTOCOL AND TRANSPORT LAYER Overview of Mobile IP - Features of Mobile IP - Key Mechanism in Mobile IP - route

Optimization.Overview of TCPAP - Architecure of TCPIP- Adaptation of TCP Window Improvement in TCP Performance. UNIT HI MOBILE TELECOMMUNICATION SYSTEM Global System for Mobile Communication (GSM)- General Packet Radio Service (GPRS) Universal Mobile Telecommunication System (UMTS) UNIT V MOBILE AD-HOC NETwORKS

9

9

9 Ad-Hoc Basic Concepts Characteristics -Applications Design Issues - Routing Essential of Traditional Routing Protocols Popular Routing Protocols - Vehicular Ad Hoc networks (VANET) - MANET Vs VANET -Security. UNIT V MOBILE PLATFORMS AND APPLICATIONS 9 Mobile Device Operating Systems - Special Constrains & Requirements - Commercial Mobile Operating Systems - Software Development Kit ioS, Android, BlackBery, Windows Phone MCommerce - Structure - Pros & Cons Mobile Payment System - Security ssues.

TOTAL: 45 PERIODS OUTCOMES: At the end of the course, the student should be able to: Explain the basics of mobile telecommunication system Choose the required functionality at each layer for given application ldentify solution for each functionality at each layer Use simulator tools and design Ad hoc networks Developa mobile application. TEXT BOOK: 1. Prasant Kumar Pattnaik, Rajib Mall, Fundamentals of Mobile Computing", PHI Leaming Pvt Ltd, New Delhi -2012

Dr. JSUNDÁRARAJAN,

B.E. M.Tech, Ph.D Prineipal

NPRColege erEngineertng & Techhonoyy Natham, Dindigu! (Dt)-624 401. ATHAM

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

TM


Expect The World From Us A Diviston of CMS IT Services Pvt. Lid

25th, Dec 2015

To Whom So Ever It May Concern This is to certify that Ms. Jentfa. V, Department of Computer Science & Engineering, NPR College of

Engineering& Technology, Natham, Dindigul, has undergone inplant training from 18.12.2015 to





Yours Sincerely,


Authorized Signa9

Dr. J.SUNDARARAJAN, B.EM.Teck., Ph.D.,

Principi N.PR. Colege of Enginering & Technology


NATHAM



CMS Phone:0431-4250437, Email: [email protected] Website: www.cmsinstitute.co.in

SEO

LTPC 3003

CS6660 cOMPILER DESIGN

OBJECTIVES: The student should be made to: Leam the design principles of a Compiler. Leam the various parsing techniques and different levels of translation Leam how to optimize and effectively generate machine codes UNIT I INTRODUCTION TO COMPILERS 5 Translators-Compilation and Interpretation-Language processors -The Phases of Compiler Erors Encountered in Different Phases-The Grouping of Phases-Compiler Construction Tools-Programming Language basics. UNIT II LEXICAL ANALYSIS 9 Need and Role of Lexical Analyzer-Lexical Errors-Expressing Tokens by Regular Expressions-Converting Regular Expression to DFA- Minimization of DFA-Language for Specifying Lexical Analyzers-LEX-Design of Lexical Analyzer for a sample Language.

10 UNIT III SYNTAX ANALYSIS

Need and Role of the Parser-Context Free Grammars Top Down Parsing -General Strategies-Recursive Descent Parser Predictive Parser-LL(1) Parser-Shíft Reduce Parser- LR Parser-R (0)Item-Construction of SLR Parsing Table -introduction to LALR Parser -

Error Handling and Recovery in Syntax Analyzer-YACc-Design ofa syntax Analyzer for a Sample Language. UNIT V SYNTAX DIRECTED TRANSLATION & RUN TIME ENVIRONMENT

Syntax directed Definitions-Construction of Syntax Tree-Bottom-up Evaluation of S-AttributeDefinitions- Design of predictive translator Type Systems-Specification of a simple type checker Equivalence of Type Expressions-Type Conversions.RUN-TIME ENVIROCMENT: Source Language Issues-Storage Organization-Storage Allocation-Parameter Passing-

Symbol Tables-Dynamic Storage Allocation-Storage Allocation in FORTAN.

12

UNIT V CODE OPTIMIZATION AND CODE GENERATION

Principal Sources of Optimization-DAG. Optimization of Basic Blocks-Global Data Flow Analysis-Efficient Data Flow Algorithms-lssues in Design of a Code Generator A Simple Code Generator Algorithm.

TOTAL: 45 PERIODS OUTCOMES: At the end of the course, the student should be able to: Design and implement a prototype compiler. Apply the various optimization techniques. Use the different compiler construction tools. TEXTBOOK: 1. Alfred V Aho, Monica S. Lam, Ravi Sethi and Jeffrey D Ullman, "Compilers - Principles, Techniques and Tools", 2nd Edition, Pearson Education, 2007. REFERENCES: 1. Randy Allen, Ken Kennedy, "Optimizing Compilers for Moden Architectures: A

Dependence-based Approach", Morgan Kaufmann Publishers, 2002. 2. Steven S. Muchnick, "Advanced Compiler Design and Implementation, "Morgan Kaufmann Publishers - Elsevier Science, India, Indian Reprint 2003.

3. Keith D Cooper and Linda Torczon, "Engineering a Compiler, Morgan Kaufmann Publishers Elsevier Science, 2004. 4Charles N. Fischer, Richard. J. LeBlanc, 'Crafting a Compiler with C". Pearsen Education. 2008.

Dr. JSUNDARARAJAN,

B.E, M.Tech., Ph.D.

N:PR.College ot Engineering&Techno1oyy

Natham, Dindigut (Dt)- 624 401.

Principal NATHAM

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

C3 TECHNOLOGIES TRAINING I PROJECTS | PLACEMENTS An 1SO 29990:2010 Certified Institutlion

UKAC

52/33, T.Nagar 3 Cros, Ramanathapuram, Coimbatore-641 045. Ph: 72000 55778 / 98435 55778. E-mail: [email protected]

Date: 22.12.2015

CERTIFICATE OF IN-PLANT TRAINING This is to certify that Mr. Gajapathi.E, B.E-CSE, IV year, student of NPR college of

Engine ring Technology, Natham, Dindigul, had undergone inplant training in our company.

He had visited our company from 15.12.2015 to 19.12.2015 and completed the training satisfactorily.


For C3 TECHNOLOGIES

O Managing DIrector

Dr. J.SUNDARARAJAN, B.EM.Tech., Ph.D.,

Princip N.PR.College of Engineerlng&Technology

Nathain, Dindigul {Dt)- 624 401. G.

NATHAM

IT6502 DIGITAL sIGNAL PROCESSING3 LTPC 3104 OBJECTIVES: .To introduce discrete Fourier transform and its applications. To teach the design of infinite and finite impulse response filters for filtering undesired signals. To introduce signal processing concepts in systems having more than one sampling frequency. UNIT I SIGNALS AND SYSTEMS

9 Basic elements of DSP concepts of frequency in Analog and Digital Signals - sampling theorem-Discrete - time signals, systems - Analysis of discrete time LTI systems Z transform-Convolution - Correlation. UNIT II FREQUENCY TRANSFORMATIONS 9 Introduction to DFT- Properties of DFT- Circular Convolution Filtering methods based on DFT FFT Algorithms Decimation - in - time Algorithms, Decimation in - frequency Algorithms - Use of FFT in Linear Filtering DCT- Use and Application of DCT. UNIT II IIR FILTER DESIGN

9 Structures of lIR Analog filter design - Discrete time lIR filter from analog filter- IR filter design by Impulse Invariance, Bilinear transformation, Approximation of derivatives (LPF, HPF, BPF, BRF) filter design using frequency translation. UNIT IV FIR FILTER DESIGN

9 Structures of FIR - Linear phase FIR filter Fourier Series - Filter design using windowing techniques (Rectangular Window, Hamming Window, Hanning Window), Frequency sampling techniques UNIT V FINITE WORD LENGTH EFFECTS IN DIGITAL FILTERS Binary fixed point and floating point number representations Comparison - Quantization noise -truncation and rounding quantization noise power- input quantization error coefficient quantization error limit cycle oscillations-dead band- Overflow error-signal scaling.

9

TOTAL (L:45+T:15): 60 PERIODS OUTCOMES: Upon completion of the course, students will be able to: Perfom frequency transforms for the signals. Design IR and FIR filters. Finite word length effects in digital filters TEXT BoOK: 1. John G. Proakis and Dimitris G.Manolakis, "Digital Signal Processing-Principles, Algorithms & Applications", Fourth Edition, Pearson Education, Prentice Hall, 2007. REFERENCES: 1. Emmanuel C.lfeachor, and Barrie.W.Jervis, "Digital Signal Processing", Second Edition, Pearson Education, Prentice Hall, 2002. 2. Sanjit K. Mitra, "Digital Signal Processing-A Computer Based Approach", Third Edition, Tata Mc Graw Hill, 2007. 3. A.V.Oppenheim, R.W. Schafer and J.R. Buck, Discrete-Time Signal Processing, 8n Indian Reprint, Pearson, 2004. 4. Andreas Antoniou, "Digital Signal Processing", Tata McGraw Hill, 2006.

Dr. J.SUNDARARAJAN, B.E.. MTech., Ph.D.

IEC N.PR.

College ot Engineering&

Technoiwgy

Natham,

Dindigul

(Dt)- 624 401

Principal

ENG NATHAM

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

C3 TECHNOLOGIES TRAINING I PROJECTS | PLACEMENTS An ISO 29990:2010 Certified Institution

UKAC 52/33, T.Nagar 3 Cross, Ramanathapuram, Coimbatore -641 045.

Ph: 72000 55778 /98435 5778. E-mail: [email protected]

Date: 05.06.2016

To whomsoever it may concern

This is to certify that Ms.Kiruthiga.U.J student of BE-CSE final year, NPR college of Engineering &Technology, Natham, Dindigul, has done internship training in our organization from 09.05.2016 to 31.05.2016

During the period of service, she was found to be good. We wish her all the success in future career.

NATHAM Dr. J.SUNDARARAJAN,

B.M.Tech., Ph.D., Principal

N.PR.College of Engineering & Technology Natham, Dindigul (Dt)- 624 401.

For C3 TEÇHNOLOGIES

Managlng Director

CS6659 ARTIFICIAL INTELLIGENCE LTPC 3003 OBJECTIVES:

The student should be made to: Study the concepts of Artificial Intelligence. Leam the methods of solving problems using Artificial Inteligence. Introduce the concepts of Expert Systems and machine leaming. UNIT I INTRODUCTION TO AI AND PRODUCTION SYSTEMS Introduction to A-Problem fomulation, Problem Definiton -Production systems, Control strategies,Search strategies. Problem characteristics. Production system characteristics Specialized production system- Problem solving methods Problem graphs, Matching. Indexing and Heuristic functions -Hill Climbing-Depth first and Breath first, Constraints satisfaction Related algorithms, Measure of perfommance and analysis of search algorithmsS. UNIT II REPRESENTATION OF KNOWLEDGSE

9

9 Game playing - Knowedge representation, Knowledge representation using Predicate logic, Introduction to predicate calculus, Resolution, Use of predicate calculus, Knowledge representation using other logic-Strucured representation of knowledge. UNIT II KNOWLEDGE INFERENCE

Knowledge representation Production based system, Frame based system. Inference Backward chaining, Forward chaining, Rule value approach, Fuzzy reasoning Certainty factors, Bayesian Theory-Bayesian Network-Dempster - Shafer theory. UNIT V PLANNING AND MACHINE LEARNING Basic plan generation systems - Strips-Advanced plan generation systems - K strips- Strategic explanations -Why, Why not and how explanations. Leaming- Machine leaming adaptive Leaming. UNIT V EXPERT SYSTEMS

9

9

9 Expert systems - Architecture of expert systems, Roles of expert systems Acquisition Meta knowledge, Heuristics. Typical expert systems MYCIN, DART, XOON, Expert systems shells.

Knowiedge

TOTAL: 45 PERIODS OUTCOMES: At the end of the course, the student should be able to: Identify problems that are amenable to soludon by Al methods. Identify appropriate Al methods to solve a given problem. Formalise a given problem in the languageframework of diífferent Al methods. Implement basic Al algorithms. Design and cary out an empirical evaluation of diferent algorithms on a problem formalisation, and state the conclusions that the evaluation supports. TEXT BOOKS: 1. Kevin Night and Elaine Rich, Nair B., "Artificial Intelligence (SIE)", Mc Graw Hil-2008.

(Units-I,|1,VI& V) 2. Dan W. Patterson, "Introduction to Al and ES", Pearson Education, 2007. (Unit-ll). REFERENCES: 1. Peter Jackson, "Introduction to Expert Systems', 3- Edition, Pearson Education, 2007 2. Stuart Russel and Peter Norvig "Al - A Modem Approach", 2n Edition, Pearson Education

2007 3. Deepak Khemani "Artficial Intelligence, Tata Mc Graw Hl Education 2013 4. http://nptel.ac.in

Dr. JSUNDARARAJAN, S.E MTech. Ph.D.

N.PRColege ot

Engineering &

Technon

Natham,

Dindigul (Dt)

624 401.

Principak

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

PR LESA NOVEL APPROACH FOR DATA HIDING Raneh tha av

IN IMAGE USING RESERVING SPACE

BEFORE ENCRYPTION

A PROJECT REPORT

Submitted by

R.ANUSHA (920812104007)

S.AROCKIA MARY LIFNA (920812104010)

E.JEYA PRATHA (920812104033)

R.KEERTHANA (920812104039)

In partial fulfillment for the award ofthe degree

Of


In



NATHAM

DINDIGUL 624001

ANNA UNIVERSITY: CHENNAI 600 025

APRIL 2016 Dr. JSUNDARARAJAN,

B.E, M.Tech., Ph.D. Principal HATHA

N.PRCoe ge of Ennincari,a&Technoiog» Natha, Din 24u1.

ABSTRACT

All previous methods embed data by reversibly empty out space

from the encrypted images, which may be subject to some errors on data

extraction and/or image restoration .We proposed a novel method by

reserving space before encryption with a traditional RDH algorithm, and

thus it is easy for the data hider to reversibly embed data in the encrypted

image. The proposed method can achieve real reversibility, that is data

extraction and image recovery are free of any error. Specific locations are

assigned to each element of data to be encrypted by means of LSB

algorithm. The XOR ciphering technique is also include in the encryption.

The results in shown in MATLAB.

Dr.J.SUNDARARAJAN

BE, M.7ech., Ph.D, Princpa

N.PR.Colege of ngincerng & Technoiogy

Nathan, Dindigul (Dt)-624 4U1.

NATHAM

CHAPTER 8

CONCLUSION

Reversible data hiding in encrypted images is a new topic a* lata attention because of the privacy-preserving requirements from ciou

management. Previous methods implement RDH in encrypted images by

vacating space after encryption, as opposed to which we proposed by reserving

space before encryption. Thus the data hider can benefit from the extra space

emptied out in previous stage to make data hiding process effortless. 1he

proposed method can take advantage of all traditional RDH techniques for plain

images and achieve excellent performance without loss of perfect secrecy.

Furthermore, this proposed method can achieve real reversibility, separate data

extraction and greatly improvement on the quality of marked decrypted images.

In this paper, a novel scheme for separable reversible data hiding in

data encrypted image is proposed, which consists of image encryption,

embedding and data- extraction/image recovery phases. In the first phase,

the content owner encrypts the original uncompressed image using an

encryption key.

Although a data-hider does not know the original content, he can

compress the least significant bits of the encrypted image using a data-hiding

key to create a sparse space to accommodate the additional data. With an

encrypted image containing additional data, the receiver may extract the

additional data using only the data hiding key, or obtain an image similar to the

original one using only the encryption key.

NATHAM

Dr. J.SNDARAAJAN,BE, M.Tech., Ph.D.,

Pricipei N.PR. College of Enginoering & Technc

Naihan, Dindigut {Dt)- 624 401. 46

MG2452 ENGINEERING ECONOMICS AND FINANCIAL ACCOUNTING 3003

UNIT I INTRODUCTION 5 Managerial Economics - Relationship with other disciplines Firms: Types,

objectives and goals - Managerial decisions Decision analysis.

UNIT II DEMAND & SUPPLY ANALYSIS Demand Types of demand Determinants of demand - Demand function Demand elasticity- Demand forecasting - Supply Determinants of supply -Supply function -

Supply elasticity. UNIT II PRODUCTION AND COST ANALYSIS

10

10 Production function -Returns to scale - Production optimization - Least cost input lsoquants - Managerial uses of production function. Cost Concepts Cost function -

Determinants of cost Short run and Long run cost curves - Cost Output Decision Estimation of Cost UNIT IV PRICING

Determinants of Price Pricing under different objectives and different market structures -Price discrimination Pricing methods in practice. UNIT V FINANCIAL ACCOUNTING (ELEMENTARY TREATMENT) Balance sheet and related concepts - Profit & Loss Statement and related concepts -

-Financial Ratio Analysis - Cash flow analysis - Funds flow analysis - Compara financial statements - Analysis & Interpretation of financial statements. UNIT VI CAPITAL BUDGETING. (ELEMENTARY TREATMENT) Investments - Risks and return evaluation of investment decision - Average rate of

return Payback Period Net Present Value - Internal rate of return. SUGGESTED BOOKS:

5

10

e

5

1. Samuelson. Paul A and Nordhaus W.D., 'Economics', Tata Mcgraw Hill Publishing Company Limited, New Delhi, 2004 2. McGuigan, Moyer and Harris, 'Managerial Economics; Applications, Strategy and

Tactics', Thomson South Western, 10th Edition, 2005. 3. Paresh Shah, 'Basic Financial Accounting for Management', Oxford University Press, New Delhi, 2007. 4. Salvatore Dominick, 'Managerial Economics in a global economy'. Thomson South

Western, 4th Edition, 2001 5. Prasanna Chandra. 'Fundamentals of Financial Management, Tata Mograw Hill

Publishing Ltd., 4th edition, 2005.

fE

Br. J.SUNDARARAJAN, B:E., M.Tech., Ph.P

Principal N.PR. Cole�e ot Engineeririg& Technology

Natham, Dindigut (Dt)- 624 491

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight


UKAC


Date: 22.12.2015





For C3 TECHNOLOGIES

O Managing DIrector




NATHAM

Cs2401 cOMPUTER GRAPHICS LTPC 3003

9 UNIT I 2D PRIMITIVES output primitives-Line, Circle and Ellipse drawing algorithms -Attributes of output primitives - Two dimensional Geometric transformation Two dimensional viewing -Line, Polygon, Curve and Text clipping algorithms UNIT II 3D CONCEPTS 9

Parallel and Perspective projections Three dimensional object representation-Polygons, Curved lines, Splines, Quadric Surfaces,- Visualization of data sets 3D transformationsS Viewing-Visible surface identification. UNIT II GRAPHICS PROGRAMMING Color Models RGB, YIQ, CMY, HSV -Animations General Computer Animation, Raster, Keyframe Graphics programming using OPENGL - Basic graphics primitives

Drawing three dimensional objects Drawing three dimensional scenes

9

UNIT IV RENDERING Introduction to Shading models - Flat and Smooth shading Adding texture to faces

Adding shadows of objects Building a camera in a program Creating shaded objects - Rendering texture - Drawing Shadows.

UNIT V FRACTALS Fractals and Self similarity Peano curves - Creating image by iterated functions Mandelbrot sets Julia Sets Random Fractals Overview of Ray Tracing Intersecting rays with other primitives - Adding Surface texture Reflections and Transparency

Boolean operations on Objects

9

TOTAL = 45

TEXT BOOKS: 1. Donald Hearn, Pauline Baker, Computer Graphics C Version, second edition, Pearson Education,2004. 2. F.S. Hill, Computer Graphics using OPENGL, Second edition, Pearson Education, 2003. REFERENCES: 1. James D. Foley, Andries Van Dam, Steven K. Feiner, John F. Hughes, Computer Graphics- Principles and practice, Second Edition in C, Pearson Education, 2007.

Dr. JSUNDARARAJAN, B.E., M.Tech., Ph.D.

Principal N.PR.College ot Engineering& Technology

Natham, Dindigu! (Dt)-624 401.

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

NPRCollege of Engineering& Technology NPR Nagar, Natham, Dindigul - 624401. Tamil Nadu, India

Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai Phone No: 04544- 246 S00, 246501, 246502.

Websire: wwwaprcolleges org www.nprcetorg, Email nprcerprincpal@uprcolleges org

NPR Rrach the Star

Date: 06.02.2016 Ref: NPRCET/OFF/CSE/AV/2015-16

To

The Managing Director. C3 Technologies, Coimbatore. Tamilnadu-641023.

Dear Sir.

Sub: Seeking permission for Industrial Visit to our CSE students - reg.

Ref: MoU dated on 09/12/2015

Hereby I am looking permission for our final year CSE 47 students along with 3 faculties to visit your esteemed company on 25.02.2016 (Thursday). As per the stipulations of Anna University. our students are expected to make

industrial visits to appreciate the practices made in industry. In this regard I

request you to permit our students to visit your company. We look forward to

receive your favorable response.

Thanking you

PRINCIPAL

Prticipal PR. College of Engineering& Technology

Natham, Dindigul (Dt) -624 401 .

Dr. J.SUNDARARAJAN,

B.EMTech, Ph.D., Principal N.PR.College of Engineering& Technology Natham, Dindigul (Dt) 624 401.

c C3 TECHNOLOGIES TRAINING | PROJECTS | PLACEMENTS An ISO 29990:2010 Certified Institution UKAC



Date: 16.02.2016

To

The Principal,

NPR College of Engineering & Technology,

Natham,

Dindigul-624 401.

Sir,

Sub: Industrial Visit-Reg

With reference to your letter dated on 06.02.2016, we wish to inform you that we

permit 47 students belongs to, final year computer science and engineering, along with 3

faculties to visit our company on 25.02.2016 (Thursday).

EATHAM

For C3 TECHNOLOGIES

Managlng Dlrector

Princlpal NPR.Collsge of Engineering&Technol- Natharn, Dindigul (Dt)- 624 401

Dr. J.SUNDARARAJAN,

B. M.Tech., Ph.D. Principal N.PR.Colege of Engineering& Technology Natham, Dindigul (Dt).624 401.

NPRcollege of Engineering & Technolog NPR Nagar, Natham, Dindigul 624401, Tamil Nadu, India

Approved by AICTE, New Delhi & Afiliated to Anna University, Chennai Phone No: 04544- 246 S00, 246501, 246502.

Website www.nprcolleges o1g, www.nprcet org, [email protected]

NPR


Industrial Visit to C3 technologies on 25.02.2016

STUDENTS NAMELIST

REGISTER STUDENT S.NO STUDENT NAME NUMBER ATTENDANCE 20812104001 AARTHY.S

920812104002 ABIRAMI.J

920812104003 ABISHEKA.R.S 920812104004 AFZALAHAMED.A

920812104005 ANANTHALAKSHMI.B

O 920812104006 ANITHA.R

920812104007 ANUSHA.R 8. 920812104009 ANUSUYADEVI.T

9 920812104010 AROCKIAMARYLIFNA.S

10 TI.

920812104011 ARUN.R 9208 12104012 BALAVIGNESH.M

920812104013 BAMAJ 13. 920812104014 BARKAVI.M

14. 920812104015 BHARATH.N

15. 920812104016 BHUVANESHWARI.M

6. 920812104017 CLINGTON XAVIER.S AB 17. 920812104018 DHARANI.K

18. 920812104019 DIVYA.B

9. 920812104020 ELAKIYA.S

20. 920812104021 GAJAPATHI.E

920812104022 GANESH.V

2. 920812104023 GEETHA.S 23. 920812104024 GURU.G.R

24. 920812104025 HEMA.R

25 920812104026 HEMA.R 26. 920812104028 HEMAVATHY.E

920812104029 920812104030 92081210403|

27. INDRA.M 28. INDRAJITHSUNDAR.V

29. JANANI.S

30. 920812104032 JEYALAKSHMI.M

31. 9208 12104033 JEYAPRATHA.E 32. 920812104034 JONES KASHMIR RAJ.G

33. 920812104035 JOTHIMANI.R 34. 920812104036 KALAIYARASIA

35. 920812104037 KARTHIGAA.U.M

36. 920812104039 KEERTHANA.R

AB 37. 920812104040 KEERTHIKA.R

NPR College of Enginering & Techmology NPR Nagar, Natham, Dindigul 624401, Tamil Nadu, India.

Approved by AICTE. New Delhi& Affliated to Anna Unirersity. Chenn Phone No. 01544- 246 S00, 246501, 246502

Website www.nprcolleges.org. www.nprcet org, Email nprcetprmcpal @nprcolleges.org

NPR

38. 920812104041 KIRUTHIGA. U.J

39 920812104042 MADHUBALA.M 40. 920812104043 MALLIKA.R

41. 920812104044 MARGRATEMARY.S 42. 920812104045 MARIAPREETHIF

MITHUNMUTHUPRAKASH.MK 43 920812104046 44. 920812104047 MOHAMED ISMAIL.H 45. 920812104048 MOHANARANGAM.K 46. 920812104049 MUTHUPANDI.A 47. 920812104050 NAGARAJ.R

Faculty Co-ordinatorS r R.Hariharan. A P/CSE K. H

2. Mrs.A.Akilarani. AP/CSEK T

3. Ms.P.Durgadevi.AP/CSsE t

HoD/CSE PRINCIPAL

Principal N.PR.College of Engineering &Technology Netam, Dindigul (D:)- 624 411

NATHAM

Dr. J.SUNDARARAJAN, B.E M.Tech., Ph.D.,

Principal N.PR.College of Engineering& Technology

Natham, Dindigul (Dt).624 401.

NPRCollege of Engineering & 1leehnology NPR Nagar, Nathan, Dindigul - 624401, Tarnil Nadu, ndia

Approved by AICTE, New Delhi & Affiliated to Ana University, Chennai

An ISO 9001:2015 Certikied Iustitution Phone No: (04544- 246 S00, 246501, 246502.

Website: www.uproll-ges.org, www.uprctong, [email protected]

NPR Reveh t?ze S7ar

PHOTO GALLERY

Final year CSE students Industrial Visit to C3 Technologies on 25.02.2016

NG NATHAM

Dr. J.SUNDARARAJAN, B.EM.Tech, Ph.D.

Princip N.PR.College of Engineering & Technology

Natham, Dindigu! (Dt)- 624 401

0019 OL

CS2402 MOBILE AND PERVASIVE COMPUTING LTPC 3 003

9 UNIT I MOBILE NETwORKS Cellular Wireless Networks GSM - Architecture - Protocols Connection Establishment

Frequency Allocation Routing Mobility Management- Security -GPRS UNIT II WIRELESS NETWORKS 9

Wireless LANs and PANs - JEEE 802.11 Standard -Architecture Services -Network- HiperLAN- Blue Tooth- Wi-Fi - WiMAX UNIT III ROUTING 9 Mobile IP- DHCP AdHoc- Proactive and Reactive Routing Protocols - Multicast Routing.

UNIT IV TRANSPORT AND APPLICATION LAYERS 9 Mobile TCP-WAP Architecture - wW Programming Model-WDP - WTLS - WTP.

WSP- WAE - WTA Architecture - WML - WMLScripts

UNIT V PERVASIVE cOMPUTING 9

Pervasive computing infrastructure-applications- Device Technology Hardware, Human- machine Interfaces, Biometrics, and Operating systems- Device Connectivity -Protocols, Security, and Device Management- Pervasive Web Application architecture-Access from PCs and PDAs Access via WAP

TOTAL = 45

TEXT BOOKS: 1. Jochen Schiller, "Mobile Communications", PHI, Second Edition, 2003. 2. Jochen Burkhardt, Pervasive Computing: Technology and Architecture of Mobile

Internet Applications, Addison-Wesley Professional; 3rd edition, 2007 REFERENCES: 1. Frank Adelstein, Sandeep KS Gupta, Golden Richard, Fundamentals of Mobile and Pervasive Computing, McGraw-Hill 2005 2. Debashis Saha, Networking Infrastructure for Pervasive Computing: Enabling

Technologies, Kluwer Academic Publisher, Springer, First edition, 2002 3. Introduction to Wireless and .Mobile Systems by Agrawal and Zeng, Brooks/ Cole

(Thomson Learning), First edition, 2002 4. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, Principles of Mobile Computing, Springer, New York, 2003.

Dr. J.SUNDARARAJAN,

B.E., M.Tech., Ph.D.,

Principal

N.P.R.College of Engineering& Technology

Natham, Dindigut (Dt)- 624 401,

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

C3 TECHNOLOGIES TRAINING | PROJECTS | PLACEMENTS

An ISO 29990:2010 Certified Institution UKAC



Date:05.06.2016


This is to certify that Ms.Abisheka.R.S student of BE-CSE final year, NPR college of

Engineering &Technology, Natham, Dindigul, has done internship training in our organization

from 09.05.2016 to 31.05.2016.

During the period of service, he was found to be good.

We wish him all the success in future career.

For C3TECHNOLOGIES

kte Maraging Director

Dr. J.SUNDARARAJAN, B.E,Tech., Ph.D.,

Principal N.PR.College of Engineering&Technology

Natham, Dindigul (Dt)-624 401. NATHAM

Cs2403 DIGITAL SIGNAL PROCESSING LTPC 3003

9 UNIT I SIGNALS AND SYSTEMS

Basic elements of DSP -concepts of frequency in Analog and Digital Signais - sampling theorem Discrete tinme signals. systems Analysis of discrete time LTI systems - Z

transform- Convolution (linear and circular) - Correlation.

UNIT II FREQUENCY TRANSFORMATIONS Introduction to DFT Properties of DFT Filtering methods based on DFT- FFT Algorithms Decimation in time Algorithms, Decimation in frequency Algorithms -Use of FFT in Linear Filtering - DCT

UNIT III IR FILTER DESIGN

9

9 Structures of lIR - Analog filter design - Discrete time lIR filter from analog filter lIR

filter design by Impulse Invariance, Bilinear transformation, Approximation of derivatives - (HPF, BPF, BRF) filter design using frequency translation

UNIT IV FIR FILTER DESIGN 9

Structures of FIR Linear phase FIR filter Filter design using windowing techniques. Frequency sampling techniques- Finite word length effects in digital Filters

UNIT V APPLICATIONS 9

Multirate signal processing-Speech compression- Adaptive fiter Musical sound processing - Image enhancement.

TEXT BOOKS: 1. John G. Proakis & Dimitris G.Manolakis. "Digital Signal Processing- PrinciplesAlgorithms & Applications", Fourth edition, Pearson education/ Prentice Hall.2007 2. Emmanuel C.lfeachor, & Barrie.W.Jervis. "Digital Signal Processing". Second edition, Pearson Education / Prentice Hall. 2002. REFERENCES: 1. Alan V.Oppenheim, Ronald W. Schafer & Hohn. R.Back, "Discrete Time Signal Processing", Pearson Education, 2nd edition, 2005. 2. Andreas Antoniou, "Digital Signal Processing'. Tata McGraw Hill, 2001

NAThAN

Dr. J.SUNDARARAJAN,

BE.M.Tech, Ph.D.

Principal

N.PR.Colege ot Engineening& Technology

Natham, Dindigul (Dt)- 624 401.

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

CMS T TRAMCG S TITUTE

Expect The World From Us A Division of CMS IT Servtces Put Lud

25, June' 2016


This is to certify that Mr. Meenakshi Sundaram.5, studying B.E (cSE) student of NPR College of

Engineering & Technology. Natham, Dindigul has successfully completed Internship Training from


Yours Sincerely,


Dr. J.SUNDE RARAJAN,

aM.Tech., Ph.D. Princdpal

N.PR.College of Engineering& Technoiogy Natham, Dindigul (Dt)-624 401.

NATHAM Authorized Si

ucensee Entrust Technoser vices Pvt Ltd

3rd Floor, TABS Complex, Opp American Hospital, 41, Bharathidasan Salai, Cantonment, Trichy-620 001 TCMS. Phone 0431 4250437, Email [email protected] Website www.cmsinst1tute co.in

USER INTERFACE DESIGN LTPC

3 003 IT2024

8 UNIT IINTRODUCTION Human-Computer Interface Characteristics Of Graphics Interface -Direct Manipulation Graphical System -Web User Interface -Popularity -Characteristic& Principles UNIT II HUMAN COMPUTER INTERACTION 10

User Interface Design Process Obstacles -Usability -Human Characteristics In Design-Human Interaction Speed -Business Functions -Requirement Analysis - Direct

-Indirect Methods Basic Business Functions Design Standards System Timings Human Consideration In Screen Design Structures Of Menus Functions Of Menus- Contents Of Menu- Formatting- Phrasing The Menu- Selecting Menu Choice- Navigating Menus-Graphical Menus. UNIT III WINDOWS 9

Characteristics Organizations- Operations- Web Systems- Device- Based Controls Characteristics Screen Based Controls Operate Control Text Boxes- Selection Control Combination Control-Custom Control- Presentation Control. UNIT IV MULTIMEDIA

Components- Presentation Styles Types Managements-

9 Text For Web Pages - Effective Feedback- Guidance &Assistance-Internationalization-Accesssibility- lcons- Image- Multimedia - Coloring.

UNIT V WINDOWS LAYOUT- TEST Prototypes- Kinds Of Tests Retest - Information Search Visualization-Hypermedia

- www-Software Tools.

9

TOTAL= 45

TEXT BOOKs: 1. Wilbent. O. Galitz."The Essential Guide To User Interface Design', John Wiley& Sons, 2001. 2. Ben Sheiderman, "Design The User Interface", Pearson Education, 1998. REFERENCES: 1. Alan Cooper, "The Essential Of User Interface Design", Wiley -Dream Tech Ltd. 2002.

Dr. JSUNDARARAJAN,

B.E., M.Tech., Ph.D NATHAM

Principal N.P.R.College of Engineering& Technowy Natham Dindigul (Dt)- 624 401 OLOOP

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

NEARNESS RESPONSIVE CONCERN

S CLUSTERED P2P FILE SHARING USING NPR

CYCLOID ROUTING ALGORITHM Reaek tho Star

A PROJECT REPORT

Submitted by

GURU. G. R (920812104024)

INDRAJITH SUNDAR. V (920812104030)

MEENAKSHI SUNDARAM. S (920812104302)

in partial fulfillment for the award of the degree

of


in



NATHAM

ANNA UNIVERSITY : CHENNAI 600025

APRIL 2016

Dr. J.SUNDARARAJAN, NATHAM

B.E, M.Tech., Pir.D. Princlpal N.PR. College of Engineering& Technt-

ON

Natham, Dindigul (Di) -624 401.

iii

ABSTRACT

The popularity of peer-to-peer multimedia file sharing applications

such as Gnutella and Napster has created a flurry of recent research activity

into peer-to-peer architectures. Peer-to-peer file sharing is the distribution

and sharing of digital media using peer-to-peer (P2P) networking

technology. P2P file sharing allows users to access media files such as

books, music, movies, and games using a P2P software program that

searches for other connected computers on a P2P network to locate the

desired content. The nodes (peers) of such networks are end-user computers

and distribution servers. Peer-to-peer file sharing is the distribution and

sharing of digital data using peer-to-peer (P2P) networking technology.

P2P file sharing allows users to access files such as books, music, movies,

and games using a P2P software program that searches for other connected

computers on a P2P network to locate the desired content. Efficient file

query is important to the overall performance of Peer-to-Peer (P2P) file

sharing systems. Clustering peers by their common interests can

significantly enhance the efficiency of file query. On the other hand,

clustering peers by their physical proximity can also improve file query

performance. Dr. J.SUNDARARAJAN,

B. M.Tech., Ph.D., Principal

N.PR.Coflege of Engineering& Techroiugy Nathain, Dindigu {Dt) - vz4 1.

OF E

NATHAM

33

CHAPTER 7

CONCLUSION

During recent years, peer-to-peer (P2P) File-sharing systems have evolved in many ways to accommodate growing numbers of

participating peers. In particular, new features have changed the properties of the unstructured overlay topology formed by these peers. Despite their importance, little is known about the characteristics of these topologies and

their dynamics in modern file-sharing applications. Based on a structured

P2P. PAIS is developed based on Cycloid structured P2Pnetwork.In order to

evaluate a proposed peer-to-peer system, the characteristics of the peers that

choose to participate in the system must be understood and taken into

account. To build each peer's routing table in the Cycloid, uses proximity

neighbor selection method. The cost of file searching is directly related to

message size and physical distance of the message travelled. It reduces the

lookup path length of Cycloid. Cycloid neglects proximity, file query

messages travel long physical distances. In contrast, proactively considers

proximity in P2P construction for file query, such that the messages only

uavel between physically close nodes. The proposed system is very etticient

and cost effective

Dr. J.SUNDARARAJAN, B.E., M.Tech, Ph.D.,

Principal N.PR.College ot Engineering& Technoi0yy

Nathan, Dindigul {Dt E24 401.

NATHAM

LTPC 3003

GE2022 TOTAL QUALITY MANAGEMENT

UNIT I INTRODUCTIOON 9

Introduction Need for quality Evolution of quality Definition of quality Dimensionsof manufacturing and service quality Basic concepts of TQM Definition of TQM TQM Framework Contributions of Deming. Juran and Crosby Barriers to TQM. UNIT I TQM PRINCIPLES 9 Leadership - Strategic quality planning, Quality statements - Customer focus -Customer

orientation. Customer satisfaction, Customer complaints, Customer retention -Employee involvement- Motivation, Empowerment, Team and Teamwork, Recognitionand Reward.

Performance appraisal Continuous process improvement- PDSA cycle,5s, Kaizen -

Supplier partnership- Partnering. Supplier selection, Supplier Rating. UNIT II TQM TOOLS & TECHNIQUESI The seven traditional tools of quality - New management tools - Six-sigma Concepts.methodology, applications to manufacturing, service sector including IT - Bench

marking- Reason to bench mark, Bench marking process-FMEA -Stages, Types. UNIT IV TQM TOOLS & TECHNIQUES II

9

9 Quality circles Quality Function Deployment (QFD) - Taguchi quality loss function TPM

Concepts. improvement needs - Cost of Quality - Performance measures

UNIT V QUALITY SYSTEMS Need for ISO 9000- ISO 9000-2000 Quality System - Elements. Documentation, Quality

auditing- QS 9000- ISO 14000 Concepts, Requirements and Benefits - Case studies

of TQM implementation in manufacturing and service sectors including IT.

9

TOTAL: 45 PERIODS

TEXT BOOK: 1. Dale H.Besterfiled, et at.. Total Quality Management', Pearson Education Asia, 3rd Edition. Indian Reprint (2006). REFERENCES: 1. James R. Evans and William M. Lindsay, "The Management and Control of Quality" 6th Edition. South-Western (Thomson Learning). 2005. 2. Oakland, J.S.. TQM-Text with Cases". Butterworth Heinemann Ltd., Oxford, 3rdEdition, 2003. 3. Suganthi.L and Anand Samuel, "Total Quality Management', Prentice Hall (India) Pvt. Ltd.2006. 4. Janakiraman. B and Gopal, R.K, "Total QualityManagement- Text and Cases' Prentice Hall (India) Pvt. Ltd., 2006

NAT HAN

Dr. J.SUNDARARAJAN,

B.E., M.Tech., Ph.D Principal

N.P.R.College of Engineering& Technology

Natham, Dindigu! (Dt) 694 401

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

C3 TECHNOLOGIES TRAINING | PROJECTS | PLACEMENTS

An ISO 29990:2010 Certified Institution UKAC



Date:05.06.2016


This is to certify that Ms.Abisheka.R.S student of BE-CSE final year, NPR college of

Engineering &Technology, Natham, Dindigul, has done internship training in our organization

from 09.05.2016 to 31.05.2016.

During the period of service, he was found to be good.

We wish him all the success in future career.

For C3TECHNOLOGIES

kte Maraging Director

Dr. J.SUNDARARAJAN, B.E,Tech., Ph.D.,

Principal N.PR.College of Engineering&Technology

Natham, Dindigul (Dt)-624 401. NATHAM

IT2042 INFORMATION SECURITY 3003

AIM To study the critical need for ensuring Information Security in Organizations

OBJECTIVES 1. To understand the basics of Information Security 2. To know the legal, ethical and professional issues in Information Security

3. To know the aspects of risk management 4. To become aware of various standards in this area 5. To know the technological aspects of Information Security UNIT 1 INTRODUCTION 9

History, What is Information Security?, Critical Characteristics of Information, NSTISSC

Security Model. Components of an Information System, Securing the Components,

Balancing Security and Access, The SDLC, The Security SDLC UNIT II SECURITY INVESTIGATION

Need for Security, Business Needs, Threats, Attacks, Legal, Ethical and Professional Issues UNIT I1 SECURITY ANALYSIS Risk Management: Identifying and Assessing Risk, Assessing and Controlling Risk

UNIT IV LOGICAL DESIGN

9

9 Blueprint for Security, Information Security Poicy, Standards and Practices, IS0 17799/BS

7799, NIST Models, VISA International Security Model, Design of Security Architecture, Planning for Continuity UNIT V PHYSICAL DESIGN Security Technology, IDS, Scanning and Analysis Tools, Cryptography. Access Control Devices, Physical Security, Security and Personnel

TOTAL: 455

TEXT BOOK 1. Michael E Whitman and Herbert J Mattord, "Principles of Information Security", Vikas

Publishing House, New Delhi, 2003 REFERENCES

1. Micki Krause, Harold F. Tipton, " Handbook of Information Security Management", Vol 1-3

CRC Press LLC, 2004. 2. Stuart Mc Clure, Joel Scrambray, George Kurtz, "Hacking Exposed", Tata McGraw-Hil, 2003 3. Matt Bishop," Computer Security Art and Science", Pearson/PHI, 2002

ENGO

Dr. J.SUNDAR�RAJAN,

B.E., MTech., Ph.Du ATHA

N.PR.College ot Engineering&

Technolog

Natham, Dindigut

(Dt)-624 401

Principa

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight


UKAC


Date: 22.12.2015





For C3 TECHNOLOGIES

O Managing DIrector




NATHAM

GE2025 PROFESSIONAL ETHICS IN ENGINEERING LTPC 3 0 0 3

UNIT I ENGINEERING ETHICcs 9 Senses of 'Engineering Ethics' Variety of moral issues - Types of inquiry Moral ilemmas

- Moral Autonomy Kohlberg's theory Giligan's theory - Consensus and Controversy

Professions and Professionalism - Professional ldeals and Virtues Uses of Ethical

Theories UNIT I ENGINEERING AS SOCIAL EXPERIMENTATION 9

Engineering as Experimentation Engineers as responsible Experimenters - Research Ethics Codes of Ethics Industrial Standards A Balanced Outlook on Law The

ChallengerCaseStudy UNIT II ENGINEER'S RESPONSIBILITY FOR SAFETY Safety and Risk - Assessment of Safety and Risk Risk Benefit Analysis - Reducing Risk -

The Government Regulator's Approach to Risk

UNIT IV RESPONSIBILITIES AND RIGHTS Chernobyl Case Studies and Bhopal

9

Collegiality and Loyalty Respect for Authority Collective Bargaining Confidentiality Conflicts of Interest - Occupational Crime - Professional Rights

IntellectualPropertyRights(IPR)-Discrimination Employee Rights

UNIT V GLOBAL ISSUES 9

Multinational Corporations Business Ethics Environmental Ethics Computer Ethics Role in Technological Development -Weapons Development Engineers as Managers Consulting Engineers - Engineers as Expert Witnesses and Advisors Honesty Moral

Leadership-SamplecodeofConduct TOTAL: 45 PERIODS

TEXTBOOKS:

1. Mike Martin and Roland Schinzinger, "Ethics in Engineering", McGraw Hill, New York

(2005). 2. Charles E Harris, Michael S Pritchard and Michael J Rabins. "Engineering Ethics

ConceptsandCases", ThompsonLearning. (2000). REFERENCES 1. Charles D Fleddermann, "Engineering Ethics". Prentice Hall, New Mexico, (1999) 2. John R Boatright, "Ethics and the Conduct of Business", Pearson Education, (2003)

3. Edmund G Seebauer and Robert L Barry, "Fundamentals of Ethics for Scientists and

Engineers",OxfordUniversityPress, (2001) 4. Prof. (Col) P S Bajaj and Dr. Raj Agrawal, "Business Ethics An Indian Perspective"

Biztantra,NewDelhi, (2004) 5. David Ermann and Michele S Shauf, "Computers, Ethics and Society", Oxford University

Press. (2003)


Principal N.PR.Colege ot Engineering & Technoiogy

Natham, Dindigut (Dt) 624 401.

NAlnAM

karth

Highlight

karth

Highlight

karth

Highlight

karth

Highlight

CMS T TRAMCG S TITUTE

Expect The World From Us A Division of CMS IT Servtces Put Lud

25, June' 2016


This is to certify that Mr. Meenakshi Sundaram.5, studying B.E (cSE) student of NPR College of

Engineering & Technology. Natham, Dindigul has successfully completed Internship Training from


Yours Sincerely,


Dr. J.SUNDE RARAJAN,

aM.Tech., Ph.D. Princdpal

N.PR.College of Engineering& Technoiogy Natham, Dindigul (Dt)-624 401.

NATHAM Authorized Si

ucensee Entrust Technoser vices Pvt Ltd

3rd Floor, TABS Complex, Opp American Hospital, 41, Bharathidasan Salai, Cantonment, Trichy-620 001 TCMS. Phone 0431 4250437, Email [email protected] Website www.cmsinst1tute co.in

TRAFFIC SURVEILLANCE USING

BACKGROUND SUBTRACTION NPR

Oroup of lnstitutions

ALGORITHM Reach.the Star ROONEW OUONHDKOWLEDOE

A PROJECT REPORRT

Submitted by

A.NAVEEN (920812205022)

C.SENTHIL (920812205032)

A.SUNDAR@KARTHIK (920812205034)

In partial fulfillment for the award of the degree

of BACHELOR OF TECHNOLOGY

in

INFORMATION TECHNOLOGY


NATHAM, DINDIGUL

ANNA UNIVERSITY::CHENNAI 600 025

APRIL 20116

ENGG Dr. J.SUNDAR�EAJAN,

.E. ,Tecit, Pi.id, NATHAM Principat N.PR. College of Engineorii;& Technoiugy Natnan, Dindigui (Dt) b24 4u1.

ABSTRACT

Intelligent video surveillance systems deal with the real-time

monitoring of persistent and transient objects within a specific environment.

This can be applied not only to various security systems, but also to

environmental surveillance. Firstly, the basic principle of moving object

detecting is given by the Background Subtraction algorithm. Then, a self

adaptive background model that can update automatically and timely to

adapt to the slow and slight changes of natural environment is detailed. The

proposed algorithm can be implemented in an embedded system with little

memory consumption and storage space, so it's feasible for mobile phones

and other embedded platforms, and the proposed solution can be used in

constructing mobile security monitoring system with low-cost hardware and

equipments. This trained SVM is the core of a human detection algorithm

which searches optical flow images for human-like motion patterns. A SVM

builds a set of hyper planes in a high or multi-dimensional space can be

used for regression and classification.

Dr. J.SUNDARARAJAN,

B., M.Tech., Ph.0, NATHAM Principa N.P.R. Coege of Engineesi&TecthnO Nathai, Dindigu. i, uds 401.

CHAPTER8

CONCLUSION

We propose a novel framework named DEcOLOR to segment moving

objects from image sequences. It avoids complicated motion computation by

formulating the problem as outlier detection and makes use of the low-Tank

modelling to deal with complex background. We established the link between

DECOLOR and PCP. Compared with PCP, DECOLOR uses the non-convex

penalty and MRFs for outlier detection, which is more greedy to detect outlier

regions that are relatively dense and contiguous. Despite its satisfactory

performance in our experiments, DECOLOR also has some disadvantages.

Since DECOLOR minimizes a non-convex energy via alternating optimization,

it converges to a local optimum with results depending on initialization of^ S,

while PCP always minimizes its energy globally. In all our experiments, we

simply start from ^ S 4 0. Also, we have tested other random initialization of

S and it generally converges to a satisfactory result. This is because the SOFT

IMPUTE step will output similar results for each randomly generated S as long

as S is not too dense.

FUTURE WORK

Currently, DECOLOR works in a batch mode. Thus, it is not suitable for

real-time object detection. In the future, we plan to develop the online version of

DECOLOR thatcan work incrementally, eg, the low-rank model extracted

from beginning frames may be updated online when new frames amive.

DECOLOR may misclassify unmoved objects or large texture less regions as

background since they are prone to entering the low-rank model. To address

these problems, incorporating additional models such as objoct appearance or

shape prior to improve the power of DECOLOR can be further explored in

future. Dr. J.SUNDARARAJAN,

E .Tech., Ph.o., Principz N.PR.Colege of Enear,&schnsiogy

Nahan, Didg. jij C24 401. ATHAM 30

Documents

1.3.2 - NPR COLLEGE Of ENGINEERING AND