MG6088 Software Project Management Syllabus Semester VIII Elective IT BTECH Anna University

NotesKhan

MG6088                                    SOFTWARE PROJECT MANAGEMENT                                 L T P C
3  0  0 3
OBJECTIVES:

• To outline the need for Software Project Management
• To highlight different techniques for software cost estimation and activity planning.

UNIT I        PROJECT EVALUATION AND PROJECT PLANNING                                                     9
Importance of Software Project Management – Activities Methodologies – Categorization of Software Projects – Setting objectives – Management Principles – Management Control – Project portfolio Management   –   Cost-benefit   evaluation   technology   –   Risk   evaluation   –   Strategic   program Management – Stepwise Project Planning.

UNIT II        PROJECT LIFE CYCLE AND EFFORT ESTIMATION                                                      9
Software process and Process Models  –  Choice of  Process  models  -  mental delivery  –  Rapid Application development – Agile methods – Extreme Programming – SCRUM – Managing interactive processes – Basics of Software estimation – Effort and Cost estimation techniques – COSMIC Full function points - COCOMO II  A Parametric Productivity Model - Staffing Pattern.

UNIT III       ACTIVITY PLANNING AND RISK MANAGEMENT                                                           9
Objectives of  Activity planning  – Project schedules – Activities – Sequencing and scheduling –
Network Planning models – Forward Pass & Backward Pass techniques – Critical path (CRM) method
– Risk identification – Assessment – Monitoring – PERT technique – Monte Carlo simulation –
Resource Allocation – Creation of critical patterns – Cost schedules.

UNIT IV      PROJECT MANAGEMENT AND CONTROL                                                                     9
Framework  for  Management  and  control  –  Collection  of  data  Project  termination  –  Visualizing progress – Cost monitoring – Earned Value Analysis- Project tracking – Change control- Software Configuration Management – Managing contracts – Contract Management.

UNIT V       STAFFING IN SOFTWARE PROJECTS                                                                            9
Managing people – Organizational behavior – Best methods of staff selection – Motivation – The Oldham-Hackman job characteristic model – Ethical and Programmed concerns – Working in teams – Decision making – Team structures – Virtual teams – Communications genres – Communication plans.


OUTCOMES:

TOTAL: 45 PERIODS

• At the end of the course the students will be able to practice Project Management principles while developing a software.

TEXTBOOK:

1. Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth Edition, Tata

McGraw Hill, New Delhi, 2012.

REFERENCES:

1. Robert K. Wysocki “Effective Software Project Management” – Wiley Publication,2011.
2. Walker Royce: “Software Project Management”- Addison-Wesley, 1998.
3. Gopalaswamy Ramesh, “Managing Global Software Projects” – McGraw Hill Education (India), Fourteenth Reprint 2013.

IT6013 Software Quality Assurance Syllabus Semester VIII Elective IT BTECH Anna University

NotesKhan



IT6013                                      SOFTWARE QUALITY ASSURANCE                                    L  T  P  C
3  0 0 3
OBJECTIVES:
The student should be made to:

• Understand the basic tenets of software quality and quality factors.
• Be exposed to the Software Quality Assurance (SQA) architecture and the details of SQA

components.

• Understand of how the SQA components can be integrated into the project life cycle.
• Be familiar with  the software quality infrastructure.
• Be exposed to the management components of software quality.

UNIT I             INTRODUCTION TO SOFTWARE QUALITY & ARCHITECTURE                               9
Need for Software quality – Quality challenges – Software quality assurance (SQA) – Definition and objectives –  Software quality factors-  McCall?s  quality model  –  SQA system  and  architecture  – Software Project life cycle Components – Pre project quality components – Development and quality plans.

UNIT II            SQA COMPONENTS AND PROJECT LIFE CYCLE                                                     9
Software Development methodologies – Quality assurance activities in the development process- Verification & Validation – Reviews – Software Testing – Software Testing implementations – Quality of software maintenance – Pre-Maintenance of software quality components – Quality assurance tools – CASE tools for software quality – Software maintenance quality – Project Management.

UNIT III           SOFTWARE QUALITY INFRASTRUCTURE                                                                 9
Procedures and work instructions - Templates - Checklists – 3S developmenting - Staff training and certification  Corrective  and  preventive  actions  –  Configuration  management  –  Software  change control – Configuration management audit -Documentation control – Storage and retrieval.

UNIT IV          SOFTWARE QUALITY MANAGEMENT & METRICS                                                   9
Project  process control –  Computerized tools  -  Software quality metrics  –  Objectives  of  quality measurement – Process metrics – Product metrics – Implementation – Limitations of software metrics
– Cost of   software quality – Classical quality cost model – Extended model – Application of Cost model.

UNIT V         STANDARDS, CERTIFICATIONS & ASSESSMENTS                                                    9
Quality manangement standards – ISO 9001 and ISO 9000-3 – capability Maturity Models – CMM and CMMI assessment methodologies   - Bootstrap methodology – SPICE Project – SQA project process standards – IEEE st  1012 & 1028  – Organization  of  Quality Assurance  –  Department management responsibilities – Project management responsibilities – SQA units and other actors in SQA systems.



OUTCOMES:
At the end of the course the students will be able to:

• Utilize the concepts in software development life cycle.
• Demonstrate their capability to adopt quality standards.
• Assess the quality of software product.
• Apply the concepts in preparing the quality plan & documents.

TEXT BOOK:

1. Daniel Galin, “Software Quality Assurance”, Pearson Publication, 2009.

TOTAL: 45 PERIODS


REFERENCES:

1. Alan C. Gillies, “Software Quality: Theory and Management”, International Thomson Computer

Press, 1997.

2. Mordechai Ben-Menachem “Software Quality: Producing Practical Consistent Software”,

International Thompson Computer Press, 1997.

CS6008 Human Computer Interaction Syllabus Semester VIII Elective IT BTECH Anna University

NotesKhan

CS6008	HUMAN COMPUTER INTERACTION	L	T  P C
		3	0  0 3

OBJECTIVES:
The student should be made to:

• Learn the foundations of Human Computer Interaction
• Be familiar with the design technologies for individuals and persons with disabilities
• Be aware of mobile HCI
• Learn the guidelines for user interface.

UNIT I             FOUNDATIONS OF HCI                                                                                                 9
The Human: I/O channels – Memory – Reasoning and problem solving; The computer:  Devices – Memory – processing and networks; Interaction: Models – frameworks – Ergonomics – styles – elements – interactivity- Paradigms.

UNIT II           DESIGN & SOFTWARE PROCESS                                                                                9
Interactive Design basics – process – scenarios – navigation – screen design – Iteration and prototyping. HCI in software process – software life cycle – usability engineering – Prototyping in practice – design rationale. Design rules – principles, standards, guidelines, rules. Evaluation Techniques – Universal Design.

UNIT III          MODELS AND THEORIES                                                                                             9
Cognitive models –Socio-Organizational issues and stake holder requirements –Communication and collaboration models-Hypertext, Multimedia and WWW.

UNIT IV          MOBILE HCI                                                                                                                     9
Mobile Ecosystem: Platforms, Application frameworks- Types of Mobile Applications: Widgets, Applications, Games- Mobile Information Architecture, Mobile 2.0, Mobile Design: Elements of Mobile Design, Tools.

UNIT V         WEB INTERFACE DESIGN                                                                                               9
Designing Web Interfaces – Drag & Drop, Direct Selection, Contextual Tools, Overlays, Inlays and
Virtual Pages, Process Flow. Case Studies.


OUTCOMES:
Upon completion of the course, the student should be able to:

• Design effective dialog for HCI.
• Design effective HCI for individuals and persons with disabilities.
• Assess the importance of user feedback.

TOTAL: 45 PERIODS

• Explain the HCI implications for designing multimedia/ ecommerce/ e-learning Web sites.
• Develop meaningful user interface.

TEXT BOOKS:

1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, “Human Computer Interaction”, 3rd Edition, Pearson Education, 2004 (UNIT I , II & III)
2. Brian Fling, “Mobile Design and Development”, First Edition , O?Reilly Media Inc., 2009 (UNIT –IV)
3. Bill Scott and Theresa Neil, “Designing Web Interfaces”, First Edition, O?Reilly, 2009.(UNIT-V)

IT6012 TCP/ IP Design and Implementation Syllabus Semester VIII Elective IT BTECH Anna University

NotesKhan



IT6012                                     TCP/IP DESIGN AND IMPLEMENTATION                             L T  P C
3  0  0  3
OBJECTIVES:
The student should be made to:

• Understand the IP addressing schemes .
• Understand the fundamentals of network design and implementation
• Understand the design and implementation of TCP/IP networks
• Understand on network management issues
• Learn to design and implement network applications.

UNIT I           INTRODUCTION                                                                                                               9
Internetworking concepts and architecture model  –  classful Internet address  –  CIDR  –  Subnetting and Supernetting – AARP – RARP- IP- IP Routing – ICMP – IPV6.

UNIT II         TCP                                                                                                                                   9
Services – header – connection establishment and termination – interactive data flow  –  bulk   data flow – timeout and retransmission – persist timer – keep alive timer – futures and performance.

UNIT III        IP IMPLEMENTATION                                                                                                     9
IP global software organization –routing table–routing algorithms – fragmentation and reassembly –
error processing (ICMP) – Multicast Processing (IGMP).

UNIT IV       TCP IMPLEMENTATION I                                                                                                 9
Data structure and input processing – transmission control blocks – segment format – comparision– finite  state  machine  implementation  –  Output  processing  –  mutual   exclusion –computing   the computing the TCP Data length.

UNIT V       TCP IMPLEMENTATION  II                                                                                               9
Timers – events and messages – timer process – deleting and inserting timer event – flow control and adaptive retransmission– congestion avoidance and control – urgent data processing and push function.


OUTCOMES:
Upon completion of the course, the student should be able to:

• Design and implement TCP/IP networks.
• Explain  network management issues.
• Design and implement  network applications.

Develop   data   structures   for  basic  protocol  functions   of   TCP/IP.

• Apply the members in the respective structures.

TOTAL: 45 PERIODS

• Design and implement data structures for maintaining multiple local and global timers.

TEXT BOOKS

1. Douglas E Comer,”Internetworking with TCP/IP Principles, Protocols and  Architecture”,  Vol  1,

Vth  Edition  2006 and Vol 2, IIIrd  Edition, 1999.

2. W.Richard Stevens “TCP/IP Illustrated” Vol 1. Pearson Education, 2003.

REFERENCES

1. 1. Forouzan, “ TCP/IP Protocol Suite” Second Edition, Tata MC Graw Hill,
2. 2. W.Richard Stevens “TCP/IP Illustrated” Volume 2, Pearson Education 2003

IT6011 Knowledge Management Syllabus Semester VIII Elective IT BTECH Anna University

NotesKhan

IT6011	KNOWLEDGE MANAGEMENT	L	T  P  C
		3	0  0  3

OBJECTIVES:
The student should be made to:

• Learn the Evolution of Knowledge management.
• Be familiar with tools.
• Be exposed to Applications.
• Be familiar with some case studies.

UNIT I              INTRODUCTION                                                                                                           9
Introduction:   An   Introduction   to   Knowledge   Management   -   The   foundations   of   knowledge management- including cultural issues- technology applications organizational concepts and processes- management aspects- and decision support systems. The Evolution of Knowledge management: From Information Management to Knowledge Management - Key Challenges Facing the Evolution of Knowledge Management - Ethics for Knowledge Management.

UNIT II            CREATING THE CULTURE OF LEARNING
AND KNOWLEDGE SHARING                                                                                      8
Organization and Knowledge Management - Building the Learning Organization. Knowledge Markets: Cooperation among Distributed Technical Specialists – Tacit Knowledge and Quality Assurance.

UNIT III           KNOWLEDGE MANAGEMENT-THE TOOLS                                                             10
Telecommunications and Networks in Knowledge Management - Internet Search Engines and Knowledge  Management  -  Information  Technology  in  Support  of  Knowledge  Management  - Knowledge Management and Vocabulary Control - Information Mapping in Information Retrieval - Information Coding in the Internet Environment - Repackaging Information.

UNIT IV          KNOWLEDGEMANAGEMENT-APPLICATION                                                            9
Components of a Knowledge Strategy - Case Studies (From Library to Knowledge Center, Knowledge
Management in the Health Sciences, Knowledge Management in Developing Countries).

UNIT V           FUTURE TRENDS AND CASE STUDIES                                                                     9
Advanced topics and case studies in knowledge management - Development of a knowledge management map/plan that is integrated with an organization's strategic and business plan - A case study on Corporate Memories for supporting various aspects in the process life -cycles of an organization.


OUTCOMES:
Upon completion of the course, the student should be able to:

• Use the knowledge management tools.
• Develop knowledge management Applications.
• Design and develop enterprise applications.

TEXT BOOK:

TOTAL: 45 PERIODS

1. Srikantaiah, T.K.,  Koenig,  M.,  “Knowledge  Management  for  the  Information  Professional”

Information Today, Inc., 2000.

REFERENCE:

1. Nonaka, I., Takeuchi, H., “The Knowledge-Creating Company: How Japanese Companies Create the Dynamics of Innovation”, Oxford University Press, 1995.

IT6010 Business Intelligence Syllabus Semester VIII Elective IT BTECH Anna University

NotesKhan

IT6010	BUSINESS INTELLIGENCE	L  T	P C
		3  0	0 3

OBJECTIVES:
The student should be made to:

• Be exposed with the basic rudiments of business intelligence system
• understand the modeling aspects behind Business Intelligence
• understand of the business intelligence life cycle and the techniques used in it
• Be exposed with different data analysis tools and techniques

UNIT I           BUSINESS INTELLIGENCE                                                                                              9
Effective and timely decisions – Data, information and knowledge – Role of mathematical models – Business intelligence architectures: Cycle of a business intelligence analysis – Enabling factors in business intelligence projects – Development of a business intelligence system – Ethics and business intelligence.

UNIT II          KNOWLEDGE DELIVERY                                                                                               9
The business intelligence user types, Standard reports, Interactive Analysis and Ad Hoc Querying, Parameterized Reports and Self-Service Reporting, dimensional analysis, Alerts/Notifications, Visualization: Charts, Graphs, Widgets, Scorecards and Dashboards, Geographic Visualization, Integrated Analytics, Considerations: Optimizing the Presentation for the Right Message.

UNIT III        EFFICIENCY                                                                                                                      9
Efficiency measures – The CCR model: Definition of target objectives- Peer groups – Identification of good operating practices; cross efficiency analysis – virtual inputs and outputs – Other models. Pattern matching – cluster analysis, outlier analysis

UNIT IV      BUSINESS INTELLIGENCE APPLICATIONS                                                                  9
Marketing models – Logistic and Production models – Case studies.

UNIT V       FUTURE OF BUSINESS INTELLIGENCE                                                                          9
Future of business intelligence – Emerging Technologies, Machine Learning, Predicting the Future, BI Search & Text Analytics – Advanced Visualization – Rich Report, Future beyond Technology.

TOTAL: 45 PERIODS

OUTCOMES:
At the end of the course the students will be able to

• Explain the fundamentals of business intelligence.
• Link data mining with business intelligence.
• Apply various modeling techniques.
• Explain the data analysis and knowledge delivery stages.
• Apply business intelligence methods to various situations.
• Decide on appropriate technique.

TEXT BOOK:

1. Efraim Turban, Ramesh Sharda, Dursun Delen, “Decision Support and Business Intelligence

Systems”, 9th Edition, Pearson 2013.

REFERENCES:

2. Larissa T. Moss, S. Atre, “Business Intelligence Roadmap: The Complete Project Lifecycle of

Decision Making”, Addison Wesley, 2003.

3. Carlo Vercellis, “Business Intelligence: Data Mining and Optimization for Decision Making”, Wiley

Publications, 2009.

4. David Loshin Morgan, Kaufman, “Business Intelligence: The Savvy Manager?s Guide”, Second

Edition, 2012.

5. Cindi Howson, “Successful Business Intelligence: Secrets to Making BI a Killer App”, McGraw- Hill, 2007.
6. Ralph Kimball , Margy Ross , Warren Thornthwaite, Joy Mundy, Bob Becker, “The Data

Warehouse Lifecycle Toolkit”, Wiley Publication Inc.,2007.

CS6010 Social Network Analysis Syllabus Semester VIII Elective IT BTECH Anna University

NotesKhan

CS6010	SOCIAL NETWORK ANALYSIS	L	T	P C
		3	0	0 3

OBJECTIVES:
The student should be made to:

• Understand the concept of semantic web and related applications.
• Learn knowledge representation using ontology.
• Understand human behaviour in social web  and related communities
• Learn visualization of  social networks.

UNIT I              INTRODUCTION                                                                                                           9
Introduction to Semantic Web: Limitations of current Web - Development of Semantic Web - Emergence of the Social Web - Social Network analysis: Development of Social Network Analysis - Key concepts and measures in network analysis - Electronic sources for network analysis: Electronic discussion networks, Blogs and online communities - Web-based networks - Applications of Social Network Analysis.

UNIT II            MODELLING, AGGREGATING AND KNOWLEDGE
REPRESENTATION                                                                                                       9
Ontology and their role in the Semantic Web: Ontology-based knowledge Representation - Ontology languages for the Semantic Web: Resource Description Framework   - Web Ontology Language - Modelling and aggregating social network data: State-of-the-art in network data representation - Ontological representation of social individuals -  Ontological representation of social relationships - Aggregating and reasoning with social network data - Advanced representations.

UNIT III           EXTRACTION AND MINING COMMUNITIES IN WEB SOCIAL
NETWORKS                                                                                                                   9
Extracting evolution of  Web Community from a Series of Web Archive - Detecting communities in social  networks  -  Definition  of  community  -  Evaluating  communities  -  Methods  for  community detection  and     mining  -  Applications  of  community  mining  algorithms  -  Tools  for  detecting communities social network infrastructures and communities - Decentralized online social networks - Multi-Relational characterization of dynamic social network communities.

UNIT IV          PREDICTING HUMAN BEHAVIOUR AND PRIVACY ISSUES                                    9
Understanding and predicting human behaviour for social communities - User data management - Inference and Distribution - Enabling new human experiences - Reality mining - Context - Awareness
- Privacy in online social networks - Trust in online environment - Trust models based on subjective logic - Trust network analysis - Trust transitivity analysis - Combining trust and reputation - Trust
derivation based on trust comparisons - Attack spectrum and countermeasures.

UNIT V           VISUALIZATION AND APPLICATIONS OF SOCIAL NETWORKS                             9
Graph theory - Centrality - Clustering - Node-Edge Diagrams -   Matrix representation - Visualizing online social networks, Visualizing social networks with matrix-based representations - Matrix and Node-Link Diagrams - Hybrid representations - Applications - Cover networks - Community welfare - Collaboration networks - Co-Citation networks.


OUTCOMES:
Upon completion of the course, the student should be able to:

• Develop semantic web related applications.
• Represent knowledge using ontology.
• Predict human behaviour in social web  and related communities.
• Visualize social networks.

TOTAL: 45 PERIODS

TEXT BOOKS:

1. Peter Mika, “Social Networks and the Semantic Web”, , First Edition, Springer 2007.
2. Borko Furht, “Handbook of Social Network Technologies and Applications”, 1st Edition, Springer,

2010.

REFERENCES:

1. Guandong Xu ,Yanchun Zhang and Lin Li, “Web Mining and Social Networking – Techniques and

applications”, First Edition Springer, 2011.

2. Dion Goh and Schubert Foo, “Social information Retrieval Systems: Emerging Technologies and

Applications for Searching the Web Effectively”, IGI Global Snippet, 2008.

3. Max Chevalier, Christine Julien and Chantal Soulé-Dupuy, “Collaborative and Social Information

Retrieval and Access: Techniques for Improved user Modelling”, IGI Global Snippet, 2009.

4. John G. Breslin, Alexandre Passant and Stefan Decker, “The Social Semantic Web”, Springer,

2009.

CS6702 Graph Theory and Applications Syllabus Semester VIII Elective IT BTECH Anna University

NotesKhan



CS6702                                   GRAPH THEORY AND APPLICATIONS                                 L  T  P C
3 0  0 3
OBJECTIVES:
The student should be made to:

• Be familiar with the most fundamental Graph Theory topics and results.
• Be exposed to the techniques of proofs and analysis.

UNIT I            INTRODUCTION                                                                                                             9
Graphs – Introduction – Isomorphism – Sub graphs – Walks, Paths, Circuits –Connectedness – Components – Euler graphs – Hamiltonian paths and circuits – Trees – Properties of trees – Distance and centers in tree – Rooted and binary trees.

UNIT II          TREES, CONNECTIVITY & PLANARITY                                                                       9
Spanning trees – Fundamental circuits – Spanning trees in a weighted graph – cut sets – Properties of cut set – All cut sets – Fundamental circuits and cut sets – Connectivity and separability – Network flows – 1-Isomorphism – 2-Isomorphism – Combinational and geometric graphs – Planer graphs – Different representation of a planer graph.

UNIT III         MATRICES, COLOURING AND DIRECTED GRAPH                                                     8
Chromatic number – Chromatic partitioning – Chromatic polynomial – Matching – Covering – Four color problem – Directed graphs – Types of directed graphs – Digraphs and binary relations – Directed paths and connectedness – Euler graphs.

UNIT IV        PERMUTATIONS & COMBINATIONS                                                                            9
Fundamental principles of counting - Permutations and combinations - Binomial theorem - combinations with repetition - Combinatorial numbers - Principle of inclusion and exclusion - Derangements - Arrangements with forbidden positions.

UNIT V        GENERATING FUNCTIONS                                                                                            10
Generating functions - Partitions of integers - Exponential generating function – Summation operator - Recurrence relations - First order and second order – Non-homogeneous recurrence relations - Method of generating functions.


OUTCOMES:
Upon Completion of the course, the students should be able to:

TOTAL: 45 PERIODS

• Write precise and accurate mathematical definitions of objects in graph theory.
• Use mathematical definitions to identify and construct examples and to distinguish examples from non-examples.
• Validate and critically assess a mathematical proof.
• Use a combination of theoretical knowledge and independent mathematical thinking in creative investigation of questions in graph theory.
• Reason from definitions to construct mathematical proofs.

TEXT BOOKS:

1. Narsingh Deo, “Graph  Theory:  With  Application  to  Engineering  and  Computer  Science”,

Prentice Hall of India, 2003.

2. Grimaldi R.P. “Discrete  and  Combinatorial  Mathematics:  An  Applied  Introduction”,  Addison

Wesley, 1994.

REFERENCES:

1. Clark J. and Holton D.A, “A First Look at Graph Theory”, Allied Publishers, 1995.
2. Mott J.L.,  Kandel A.  and Baker T.P. “Discrete  Mathematics for  Computer  Scientists and

Mathematicians” , Prentice Hall of India, 1996.

3. Liu C.L., “Elements of Discrete Mathematics”, McGraw Hill, 1985.
4. Rosen K.H., “Discrete Mathematics and Its Applications”, McGraw Hill, 2007.

CS6004 Cyber Forensics Syllabus Semester VIII Elective IT BTECH Anna University

NotesKhan

CS6004	CYBER FORENSICS	L	T	P C
		3	0	0 3

OBJECTIVES:
The student should be made to:

• Learn the security issues network layer and transport layer.
• Be exposed to security issues of the application layer.
• Learn computer forensics.
• Be familiar with forensics tools.
• Learn to analyze and validate forensics data.

UNIT I             NETWORK LAYER SECURITY &TRANSPORT LAYER SECURITY                            9
IPSec Protocol - IP Authentication Header - IP ESP - Key Management Protocol for IPSec.Transport layer Security: SSL protocol, Cryptographic Computations – TLS Protocol.

UNIT II            E-MAIL SECURITY & FIREWALLS                                                                                9
PGP - S/MIME - Internet Firewalls for Trusted System: Roles of Firewalls – Firewall related terminology- Types of Firewalls - Firewall designs - SET for E-Commerce Transactions.

UNIT III         INTRODUCTION TO COMPUTER FORENSICS                                                            9
Introduction to Traditional Computer Crime, Traditional problems associated with Computer Crime. Introduction  to  Identity  Theft  &  Identity  Fraud.  Types  of  CF  techniques  -  Incident  and  incident response methodology - Forensic duplication and investigation. Preparation for IR: Creating response tool kit and IR team. - Forensics Technology and Systems - Understanding Computer Investigation – Data Acquisition.

UNIT IV         EVIDENCE COLLECTION AND FORENSICS TOOLS                                                  9
Processing  Crime  and  Incident  Scenes  –  Working  with  Windows  and  DOS  Systems.  Current
Computer Forensics Tools: Software/ Hardware Tools.

UNIT V          ANALYSIS AND VALIDATION                                                                                       9
Validating Forensics Data – Data Hiding Techniques – Performing Remote Acquisition – Network
Forensics – Email Investigations – Cell Phone and Mobile Devices Forensics.


OUTCOMES:
Upon completion of the course, the student should be able to:

• Discuss the security issues network layer and transport layer.
• Apply security principles in the application layer.
• Explain computer forensics.
• Use forensics tools.
• Analyze and validate forensics data.

TOTAL: 45 PERIODS


TEXT BOOKS:

1. Man Young Rhee, “Internet Security: Cryptographic Principles”, “Algorithms and Protocols”, Wiley Publications, 2003.
2. Nelson, Phillips, Enfinger, Steuart, “Computer Forensics and Investigations”, Cengage Learning,

India Edition, 2008.

REFERENCES:

1. John R.Vacca, “Computer Forensics”, Cengage Learning, 2005
2. Richard E.Smith, “Internet Cryptography”, 3rd Edition Pearson Education, 2008.
3. Marjie T.Britz, “Computer Forensics and Cyber Crime”: An Introduction”, 3rd  Edition, Prentice

Hall, 2013.

BM6005 Bio Informatics Syllabus Semester VIII Elective IT BTECH Anna University

NotesKhan





BM6005                                                  BIO INFORMATICS                                                     L T P C
3 0 0  3
OBJECTIVES:
The student should be made to:

• Exposed to the need for Bioinformatics technologies.
• Be familiar with the modeling techniques.
• Learn microarray analysis.
• Exposed to Pattern Matching and Visualization.

UNIT I          INTRODUCTION                                                                                                               9
Need for Bioinformatics technologies – Overview of Bioinformatics technologies Structural bioinformatics – Data format and processing – Secondary resources and applications – Role of Structural bioinformatics - Biological Data Integration System.

UNIT II         DATAWAREHOUSING AND DATAMINING IN BIOINFORMATICS                               9
Bioinformatics data – Data warehousing architecture – data quality – Biomedical data analysis – DNA data analysis – Protein data analysis – Machine learning – Neural network architecture and applications in bioinformatics.

UNIT III       MODELING FOR BIOINFORMATICS                                                                               9
Hidden markov modeling for biological data analysis – Sequence identification –Sequence classification – multiple alignment generation – Comparative modeling –Protein modeling – genomic modeling – Probabilistic modeling – Bayesian networks – Boolean networks - Molecular modeling – Computer programs for molecular modeling.

UNIT IV       PATTERN MATCHING AND VISUALIZATION                                                                9
Gene regulation – motif recognition – motif detection – strategies for motif detection – Visualization – Fractal analysis – DNA walk models – one dimension – two dimension – higher dimension – Game representation of Biological sequences – DNA, Protein, Amino acid sequences.

UNIT V        MICROARRAY ANALYSIS                                                                                                9
Microarray  technology  for  genome  expression  study  –  image  analysis  for  data  extraction  –
preprocessing – segmentation – gridding – spot extraction – normalization, filtering – cluster analysis
– gene network analysis – Compared Evaluation of Scientific Data Management Systems – Cost
Matrix – Evaluation model - Benchmark – Tradeoffs.



OUTCOMES:
Upon Completion of the course, ?the students will be able to

• Develop models for biological data

TOTAL: 45 PERIODS

• Apply pattern matching techniques to bioinformatics data – protein data genomic data.
• Apply micro array technology for genomic expression study

TEXT BOOK:

1. Yi-Ping Phoebe Chen (Ed), “BioInformatics Technologies”, First Indian Reprint, Springer Verlag,

2007.

REFERENCES:

1. Bryan Bergeron, “Bio Informatics Computing”, Second Edition, Pearson Education, 2003.
2. Arthur M Lesk, “Introduction to Bioinformatics”, Second Edition, Oxford University Press, 2005

IT6009 Web Engineering Syllabus Semester VIII Elective IT BTECH Anna University

NotesKhan

IT6009	WEB ENGINEERING	L	T	P C
		3	0	0 3

OBJECTIVES:
The student should be made to:

• Understand the characteristics of web applications
• Learn to Model web applications
• Be aware of Systematic methods
• Be familiar with the testing techniques for web applications

UNIT I          INTRODUCTION TO WEB ENGINEERING AND REQUIREMENTS
ENGINEERING                                                                                                                   9
Motivation, Categories of Web Applications, Characteristics of Web Applications, Product-related Characteristics, Usage related Characteristics, Development-related Characteristic, Evolution of web engineering - Requirements Engineering Activities RE Specifics in Web Engineering, Principles for RE  of  Web  Applications,  Adapting  RE  Methods  to Web  Application  Development,  Requirement Types, Notations, Tools

UNIT II         WEB APPLICATION ARCHITECTURES & MODELLING WEB APPLICATIONS         10
Introduction- Categorizing Architectures, Specifics of Web Application Architectures, Components of a Generic Web Application Architecture, Layered Architectures, 2-Layer Architectures, N-Layer Architectures Data-aspect Architectures, Database-centric Architectures, Architectures for Web Document Management, Architectures for Multimedia Data Modeling Specifics in Web Engineering, Levels, Aspects, Phases Customization, Modeling Requirements, Hypertext Modeling, Hypertext Structure   Modeling   Concepts,   Access   Modeling   Concepts,   Relation   to   Content   Modeling, Presentation Modeling, Relation to Hypertext Modeling, Customization Modeling, Relation to Content, Hypertext, and Presentation Modeling

UNIT III           WEB APPLICATION DESIGN                                                                                     10
Introduction, Web Design from an Evolutionary Perspective, Information Design, Software Design: A Programming Activity, Merging Information Design and Software Design, Problems and Restrictions in Integrated Web Design, A Proposed Structural Approach, Presentation Design, Presentation of Nodes and Meshes, Device-independent Development, Approaches, Inter action Design, User Interaction User Interface Organization, Navigation Design, Designing a Link Representation, Designing  Link  Internals,  Navigation  and  Orientation,  Structured  Dialog  for  Complex  Activities, Interplay with Technology and Architecture, Functional Design.

UNIT IV          TESTING WEB APPLICATIONS                                                                                    8
Introduction, Fundamentals, Terminology, Quality Characteristics, Test Objectives, Test Levels, Role of the Tester, Test Specifics in Web Engineering, Test Approaches, Conventional Approaches, Agile Approaches, Test Scheme, Three Test Dimensions, Applying the Scheme to Web Applications, Test Methods and Techniques, Link   Testing, Browser Testing, Usability Testing, Load, Stress, and Continuous Testing, Testing Security, Test-driven Development, Test Automation, Benefits and Drawbacks of Automated Test, Test Tools.

UNIT V           WEB PROJECT MANAGEMENT                                                                                  8
Understanding Scope, Refining Framework Activities, Building a Web Team, Managing Risk, Developing a Schedule, Managing Quality, Managing Change, Tracking the Project. Introduction to node JS - web sockets.


OUTCOMES:
Upon completion of the course, the student should be able to:

• Apply the characteristics of web applications.
• Model web applications.
• Design web applications.
• Test web applications.

TOTAL: 45 PERIODS


TEXT BOOKS:

1. Gerti Kappel, Birgit Proll, “Web Engineering”, John Wiley and Sons Ltd, 2006.
2. Roger S. Pressman, David Lowe, “Web Engineering”, Tata McGraw Hill Publication, 2007.
3. Guy W. Lecky-Thompson, “Web Programming”, Cengage Learning, 2008.

REFERENCES:

1. Chris  Bates,  “Web  Programming:  Building  Internet  Applications”,  Third  Edition,  Wiley  India

Edition, 2007

2. John Paul Mueller, “Web Development with Microsoft Visual Studio 2005”, Wiley Dream tech,

2006.

CS6503 Theory of Computation Syllabus Semester VIII Elective IT BTECH Anna University

NotesKhan







CS6503                                              THEORY OF COMPUTATION                                        L  T P C
3  0  0 3
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.
• Learn types of grammars

UNIT I           FINITE AUTOMATA                                                                                                         9
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 €-moves – Equivalence of finite Automaton and regular expressions –Minimization of DFA- - Pumping Lemma for Regular sets – Problems based on Pumping Lemma.

UNIT II         GRAMMARS                                                                                                                      9
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 Normal form – Chomsky normal form – Problems related to CNF and GNF

UNIT III        PUSHDOWN AUTOMATA                                                                                               9
Pushdown Automata- Definitions – Moves – Instantaneous descriptions – Deterministic pushdown automata – Equivalence of Pushdown automata and CFL - pumping lemma for CFL – problems based on pumping Lemma.

UNIT IV        TURING MACHINES                                                                                                         9
Definitions of Turing machines – Models – Computable languages and functions –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        UNSOLVABLE PROBLEMS AND COMPUTABLE FUNCTIONS                                    9
Unsolvable Problems and Computable Functions –  Primitive recursive functions – Recursive and recursively enumerable languages – Universal Turing machine. MEASURING AND CLASSIFYING COMPLEXITY: Tractable and Intractable problems- Tractable and possibly intractable problems - P and NP completeness - Polynomial time reductions.


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

TOTAL: 45 PERIODS

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”, Tata McGraw Hill

Publishing Company, New Delhi, Third Edition, 2007. (UNIT 4,5).

REFERENCES:

1. Mishra K L P 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, 2003.

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, Automata Theory and

Computation”, Pearson Education 2009.

GE6075 Professional Ethics in Engineering Syllabus Semester VIII Elective IT BTECH Anna University

NotesKhan

GE6075                                PROFESSIONAL ETHICS IN ENGINEERING                               L T P C
3  0 0  3
OBJECTIVES:

• To enable the students to create an awareness on Engineering Ethics and Human Values, to instill Moral and Social Values and Loyalty and to appreciate the rights of others.

UNIT I           HUMAN VALUES                                                                                                            10
Morals, values and Ethics – Integrity – Work ethic – Service learning – Civic virtue – Respect for others – Living peacefully – Caring – Sharing – Honesty – Courage – Valuing time – Cooperation – Commitment – Empathy – Self confidence – Character – Spirituality – Introduction to Yoga and meditation for professional excellence and stress management.

UNIT II         ENGINEERING ETHICS                                                                                                    9
Senses of „Engineering Ethics? – Variety of moral issues – Types of inquiry – Moral dilemmas – Moral Autonomy – Kohlberg?s theory – Gilligan?s theory – Consensus and Controversy – Models of professional roles - Theories about right action – Self-interest – Customs and Religion – Uses of Ethical Theories

UNIT III        ENGINEERING AS SOCIAL EXPERIMENTATION                                                          9
Engineering as Experimentation – Engineers as responsible Experimenters – Codes of Ethics –
A Balanced Outlook on Law.

UNIT IV       SAFETY, RESPONSIBILITIES AND RIGHTS                                                                   9
Safety and Risk – Assessment of Safety and Risk – Risk Benefit Analysis and Reducing Risk - Respect for Authority – Collective Bargaining – Confidentiality – Conflicts of Interest – Occupational Crime – Professional Rights – Employee Rights – Intellectual Property Rights (IPR) – Discrimination

UNIT V       GLOBAL ISSUES                                                                                                                8
Multinational Corporations – Environmental Ethics – Computer Ethics – Weapons Development – Engineers as Managers – Consulting Engineers – Engineers as Expert Witnesses and Advisors – Moral Leadership –Code of Conduct – Corporate Social Responsibility


OUTCOMES :

TOTAL: 45 PERIODS

• Upon completion of the course, the student should be able to apply ethics in society, discuss the ethical issues related to engineering and realize the responsibilities and rights in the society

TEXTBOOKS:

1. Mike W. Martin and Roland Schinzinger, “Ethics in Engineering”, Tata McGraw Hill, New Delhi, 2003.
2. Govindarajan M, Natarajan S, Senthil Kumar V. S, “Engineering Ethics”, Prentice Hall of India, New

Delhi, 2004.

REFERENCES:

1. Charles B. Fleddermann, “Engineering Ethics”, Pearson Prentice Hall, New Jersey, 2004.
2. Charles E. Harris, Michael S. Pritchard and Michael J. Rabins, “Engineering Ethics – Concepts and

Cases”, Cengage Learning, 2009

3. John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, New Delhi, 2003
4. Edmund G Seebauer and Robert L Barry, “Fundametals of Ethics for Scientists and Engineers”,

Oxford University Press, Oxford, 2001

5. Laura P. Hartman and Joe Desjardins, “Business Ethics: Decision Making for Personal Integrity

and Social Responsibility” Mc Graw Hill education, India Pvt. Ltd.,New Delhi 2013.\

6. World Community Service Centre, „ Value Education?, Vethathiri publications, Erode, 2011

Web sources:

1. www.onlineethics.org
2. www.nspe.org
3. www.globalethics.org
4. www.ethics.org

IT6008 Network Programming and Management Syllabus Semester VIII Elective IT BTECH Anna University

NotesKhan

IT6008	NETWORK PROGRAMMING AND MANAGEMENT	L T P	C
		3  0  0	3

OBJECTIVES:
The student should be made to:

• Learn the basics of socket programming using TCP Sockets.
• Learn about Socket Options.
• Learn to develop Macros for including Objects In MIB Structure.
• Understand SNMPv1, v2 and v3 protocols & practical issues.

UNIT I       SOCKETS AND APPLICATION DEVELOPMENT                                                              9
Introduction to Socket Programming - System Calls - Address conversion functions - POSIX Signal Handling - Server with multiple clients - Boundary conditions - Server process Crashes, Server host Crashes, Server Crashes and reboots, Server Shutdown  - I/O Multiplexing - I/O Models -TCP echo client/server with I/O Multiplexing

UNIT II        SOCKET OPTIONS                                                                                                           9
Socket options - getsockopt and setsockopt functions - Generic socket options - IP socket options - ICMP socket options - TCP socket options - Multiplexing TCP and UDP sockets - SCTP Sockets - SCTP Client/server - Streaming Example - Domain name system - gethostbyname, gethostbyaddr, getservbyname and getservbyport functions - Protocol Independent functions in TCP Client/Server Scenario

UNIT III        ADVANCED SOCKETS                                                                                                     9
IPv4 and IPv6 interoperability - Threaded servers - Thread creation and termination - TCP echo server using threads - Mutex - Condition variables - Raw sockets - Raw socket creation - Raw socket output - Raw socket input - ping program - traceroute program

UNIT IV       SIMPLE NETWORK MANAGEMENT                                                                               9
SNMP network management concepts - SNMPv1 - Management information - MIB Structure - Object syntax - Standard MIB?s - MIB-II Groups - SNMPv1 protocol and Practical issues.

UNIT V       SNMP V2, V3 AND RMO                                                                                                    9
Introduction to SNMPv2 - SMI for SNMPV2 - Protocol - SNMPv3 - Architecture and applications - Security and access control model - Overview of RMON.



OUTCOMES:
Upon completion of the course, the student should be able to:
Develop programs using TCP Sockets.

• Use Socket Options.
• Develop Macros for including Objects In MIB Structure.
• Use SNMPv1, v2 and v3 protocols.

TOTAL: 45 PERIODS


TEXT BOOKS:

1. W. Richard Stevens, “UNIX Network Programming Vol-I”, Third Edition, PHI Pearson Education,

2003.

2. William  Stallings, “SNMP,  SNMPv2,  SNMPv3  and  RMON 1  and  2”, Third  Edition,  Pearson

Edition, 2009.

REFERENCE:

1. D.E. Comer, “Internetworking with TCP/IP Vol- III: Client-Server Programming and Application

BSD Sockets Version”, Second Edition, Pearson Edition, 2003.