Sunday 13 July 2014
Monday 7 July 2014
Anna University Counselling Vacancy Position 2014 @live
Anna University Counselling Vacancy Position 2014
Anna University Counselling Vacancy Position 2014 By College
TNEA 2014 Vacancy Status by Department or Course
Anna University Counselling 2014 Vacancy Position by College Code.
Sunday 6 July 2014
CS6601 DISTRIBUTED SYSTEMS | syllabus
CS6601 DISTRIBUTED SYSTEMS L T P C 3 0 0 3
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 II COMMUNICATION IN DISTRIBUTED SYSTEM (10)
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 Invocation – Introduction - Request-reply
protocols - Remote procedure call - Remote method invocation. Case study: Java RMI - Group
communication - Publish-subscribe systems - Message queues - Shared memory approaches -
Distributed objects - Case study: Enterprise Java Beans -from objects to components.
UNIT III PEER TO PEER SERVICES AND FILE SYSTEM (10)
Peer-to-peer Systems – Introduction - Napster and its legacy - Peer-to-peer – Middleware - Routing
overlays. Overlay case studies: Pastry, Tapestry- Distributed File Systems –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 REPLICATION (9)
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 Control– Transactions -Nested transactions –
Locks – Optimistic concurrency control - Timestamp ordering – Atomic Commit protocols -Distributed
deadlocks – Replication – Case study – Coda.
UNIT V PROCESS & RESOURCE MANAGEMENT (9)
Process Management: Process Migration: Features, Mechanism - Threads: Models, Issues,
Implementation. Resource Management: Introduction- Features of Scheduling Algorithms –Task
Assignment Approach – Load Balancing Approach – Load Sharing Approach.
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 Paradigms”, Pearson
Education, 2007.
3. Liu M.L., “Distributed Computing, Principles and Applications”, Pearson Education, 2004.
4. Nancy A Lynch, “Distributed Algorithms”, Morgan Kaufman Publishers, USA, 2003.
Click here to download full syllabus AULibrary.com
IT6601 MOBILE COMPUTING | syllabus
IT6601 MOBILE COMPUTING L T P C
3 0 0 3
OBJECTIVES:
The student should be made to:
Understand the basic concepts of mobile computing
Be familiar with the network protocol stack
Learn the basics of mobile telecommunication system
Be exposed to Ad-Hoc networks
Gain knowledge about different mobile platforms and application development
UNIT I 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 Issues – Fixed Assignment Schemes – Random Assignment Schemes – Reservation
Based Schemes.
UNIT II MOBILE INTERNET PROTOCOL AND TRANSPORT LAYER (9)
Overview of Mobile IP – Features of Mobile IP – Key Mechanism in Mobile IP – route Optimization.
Overview of TCP/IP – Architecture of TCP/IP- Adaptation of TCP Window – Improvement in TCP
Performance.
UNIT III MOBILE TELECOMMUNICATION SYSTEM (9)
Global System for Mobile Communication (GSM) – General Packet Radio Service (GPRS) –
Universal Mobile Telecommunication System (UMTS).
UNIT IV MOBILE AD-HOC NETWORKS (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, BlackBerry, Windows Phone – MCommerce
– Structure – Pros & Cons – Mobile Payment System – Security Issues.
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
Identify solution for each functionality at each layer
Use simulator tools and design Ad hoc networks
Develop a mobile application.
TEXT BOOK:
1. Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012.
REFERENCES:
1. Jochen H. Schller, “Mobile Communications”, Second Edition, Pearson Education, New Delhi,
2007.
2. Dharma Prakash Agarval, Qing and An Zeng, "Introduction to Wireless and Mobile systems",
Thomson Asia Pvt Ltd, 2005.
3. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, “Principles of Mobile
Computing”, Springer, 2003.
4. William.C.Y.Lee,“Mobile Cellular Telecommunications-Analog and Digital Systems”, Second
Edition,Tata Mc Graw Hill Edition ,2006.
5. C.K.Toh, “AdHoc Mobile Wireless Networks”, First Edition, Pearson Education, 2002.
6. Android Developers : http://developer.android.com/index.html
7. Apple Developer : https://developer.apple.com/
8. Windows Phone Dev Center : http://developer.windowsphone.com
9. BlackBerry Developer : http://developer.blackberry.com/
Click here to download full syllabus AULibrary.com
CS6660 COMPILER DESIGN | syllabus
CS6660 COMPILER DESIGN L T P C 3 0 0 3
OBJECTIVES:
The student should be made to:
Learn the design principles of a Compiler.
Learn the various parsing techniques and different levels of translation
Learn how to optimize and effectively generate machine codes
UNIT I INTRODUCTION TO COMPILERS (5)
Translators-Compilation and Interpretation-Language processors -The Phases of Compiler-Errors
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.
UNIT III SYNTAX ANALYSIS (10)
Need and Role of the Parser-Context Free Grammars -Top Down Parsing -General Strategies-
Recursive Descent Parser Predictive Parser-LL(1) Parser-Shift Reduce Parser-LR Parser-LR (0)Item-
Construction of SLR Parsing Table -Introduction to LALR Parser - Error Handling and Recovery in
Syntax Analyzer-YACC-Design of a syntax Analyzer for a Sample Language .
UNIT IV SYNTAX DIRECTED TRANSLATION & RUN TIME ENVIRONMENT (12)
Syntax directed Definitions-Construction of Syntax Tree-Bottom-up Evaluation of S-Attribute
Definitions- Design of predictive translator - Type Systems-Specification of a simple type checker-
Equivalence of Type Expressions-Type Conversions.
RUN-TIME ENVIRONMENT: Source Language Issues-Storage Organization-Storage Allocation-
Parameter Passing-Symbol Tables-Dynamic Storage Allocation-Storage Allocation in FORTAN.
UNIT V CODE OPTIMIZATION AND CODE GENERATION (9)
Principal Sources of Optimization-DAG- Optimization of Basic Blocks-Global Data Flow Analysis-
Efficient Data Flow Algorithms-Issues 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 Modern 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.
4. Charles N. Fischer, Richard. J. LeBlanc, “Crafting a Compiler with C”, Pearson Education,
2008.
IT6502 DIGITAL SIGNAL PROCESSING | syllabus
IT6502 DIGITAL SIGNAL PROCESSING L T P C 3 1 0 4
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 III IIR FILTER DESIGN (9)
Structures of IIR – Analog filter design – Discrete time IIR filter from analog filter – IIR 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 (9)
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.
TOTAL (L:45+T:15): 60 PERIODS
OUTCOMES:
Upon completion of the course, students will be able to:
Perform frequency transforms for the signals.
Design IIR 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.Ifeachor, 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, 8th Indian Reprint,
Pearson, 2004.
4. Andreas Antoniou, “Digital Signal Processing”, Tata McGraw Hill, 2006.
Click here to download full syllabus AULibrary.com
CS6659 ARTIFICIAL INTELLIGENCE | syllabus
CS6659 ARTIFICIAL INTELLIGENCE L T P C 3 0 0 3
The student should be made to:
Study the concepts of Artificial Intelligence.
Learn the methods of solving problems using Artificial Intelligence.
Introduce the concepts of Expert Systems and machine learning.
UNIT I INTRODUCTION TO Al AND PRODUCTION SYSTEMS (9)
Introduction to AI-Problem formulation, Problem Definition -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
performance and analysis of search algorithms.
UNIT II REPRESENTATION OF KNOWLEDGE (9)
Game playing - Knowledge representation, Knowledge representation using Predicate logic,
Introduction to predicate calculus, Resolution, Use of predicate calculus, Knowledge representation
using other logic-Structured representation of knowledge.
UNIT III KNOWLEDGE INFERENCE (9)
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 IV PLANNING AND MACHINE LEARNING (9)
Basic plan generation systems - Strips -Advanced plan generation systems – K strips -Strategic
explanations -Why, Why not and how explanations. Learning- Machine learning, adaptive Learning.
UNIT V EXPERT SYSTEMS (9)
Expert systems - Architecture of expert systems, Roles of expert systems - Knowledge Acquisition –
Meta knowledge, Heuristics. Typical expert systems - MYCIN, DART, XOON, Expert systems shells.
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to:
Identify problems that are amenable to solution by AI methods.
Identify appropriate AI methods to solve a given problem.
Formalise a given problem in the language/framework of different AI methods.
Implement basic AI algorithms.
Design and carry out an empirical evaluation of different 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 Hill- 2008.
(Units-I,II,VI & V)
2. Dan W. Patterson, “Introduction to AI and ES”, Pearson Education, 2007. (Unit-III).
REFERENCES:
1. Peter Jackson, “Introduction to Expert Systems”, 3rd Edition, Pearson Education, 2007.
2. Stuart Russel and Peter Norvig “AI – A Modern Approach”, 2nd Edition, Pearson Education 2007.
3. Deepak Khemani “Artificial Intelligence”, Tata Mc Graw Hill Education 2013.
4. http://nptel.ac.in
Click here to download full syllabus AULibrary.com
CS6611 MOBILE APPLICATION DEVELOPMENT LABORATORY |syllabus
CS6611 MOBILE APPLICATION DEVELOPMENT LABORATORY L T P C 0 0 3 2
The student should be made to:
Know the components and structure of mobile application development frameworks for
Android and windows OS based mobiles.
Understand how to work with various mobile application development frameworks.
Learn the basic and important design concepts and issues of development of mobile
applications.
Understand the capabilities and limitations of mobile devices.
LIST OF EXPERIMENTS:
1. Develop an application that uses GUI components, Font and Colours
2. Develop an application that uses Layout Managers and event listeners.
3. Develop a native calculator application.
4. Write an application that draws basic graphical primitives on the screen.
5. Develop an application that makes use of database.
6. Develop an application that makes use of RSS Feed.
7. Implement an application that implements Multi threading
8. Develop a native application that uses GPS location information.
9. Implement an application that writes data to the SD card.
10. Implement an application that creates an alert upon receiving a message.
11. Write a mobile application that creates alarm clock
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to:
Design and Implement various mobile applications using emulators.
Deploy applications to hand-held devices
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS
Standalone desktops with Windows or Android or
iOS or Equivalent Mobile Application Development
Tools with appropriate emulators and debuggers - 30 Nos.
Click here to download full syllabus AULibrary.com
CS6612 COMPILER LABORATORY | syllabus
CS6612 COMPILER LABORATORY L T P C 0 0 3 2
The student should be made to:
Be exposed to compiler writing tools.
Learn to implement the different Phases of compiler
Be familiar with control flow and data flow analysis
Learn simple optimization techniques
LIST OF EXPERIMENTS:
1. Implementation of Symbol Table
2. Develop a lexical analyzer to recognize a few patterns in C.
(Ex. identifiers, constants, comments, operators etc.)
3. Implementation of Lexical Analyzer using Lex Tool
4. Generate YACC specification for a few syntactic categories.
a) Program to recognize a valid arithmetic expression that usesoperator +, - , * and /.
b) Program to recognize a valid variable which starts with a letterfollowed by any
number of letters or digits.
d)Implementation of Calculator using LEX and YACC
5. Convert the BNF rules into Yacc form and write code to generate Abstract Syntax Tree.
6. Implement type checking
7. Implement control flow analysis and Data flow Analysis
8. Implement any one storage allocation strategies(Heap,Stack,Static)
9. Construction of DAG
10. Implement the back end of the compiler which takes the three address code and produces the
8086 assembly language instructions that can be assembled and run using a 8086 assembler.
The target assembly instructions can be simple move, add, sub, jump. Also simple addressing
modes are used.
11. Implementation of Simple Code Optimization Techniques (Constant Folding., etc.)
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to
Implement the different Phases of compiler using tools
Analyze the control flow and data flow of a typical program
Optimize a given program
Generate an assembly language program equivalent to a source language program
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:
Standalone desktops with C / C++ compiler and Compiler writing tools 30 Nos.
(or)
Server with C / C++ compiler and Compiler writing tools supporting 30 terminals or more.
LEX and YACC
Click here to download full syllabus AULibrary.com
GE6674 COMMUNICATION AND SOFT SKILLS - LABORATORY | syllabus
GE6674 COMMUNICATION AND SOFT SKILLS - LABORATORY BASED L T P C 0 0 4 2
OBJECTIVES:
To enable learners to develop their communicative competence.
To facilitate them to hone their soft skills.
To equip them with employability skills to enhance their prospect of placements.
UNIT I LISTENING AND SPEAKING SKILLS (12)
Conversational skills (formal and informal) – group discussion and interview skills – making
presentations.
Listening to lectures, discussions, talk shows, news programmes, dialogues from TV/radio/Ted
talk/Podcast – watching videos on interesting events on Youtube.
UNIT II READING AND WRITING SKILLS (12)
Reading different genres of tests ranging from newspapers to philosophical treatises – reading
strategies such as graphic organizers, summarizing and interpretation.
Writing job applications – cover letter – resume – emails – letters – memos – reports – blogs – writing
for publications.
UNIT III ENGLISH FOR NATIONAL AND INTERNATIONAL EXAMINATIONS
AND PLACEMENTS (12)
International English Language Testing System (IELTS) – Test of English as a Foreign Language
(TOEFL) – Graduate Record Examination (GRE) – Civil Service (Language related) – Verbal ability.
UNIT IV SOFT SKILLS(1) (12)
Motivation – self image – goal setting – managing changes – time management – stress management
– leadership traits – team work – career and life planning.
UNIT V SOFT SKILLS(2) (12)
Multiple intelligences – emotional intelligence – spiritual quotient (ethics) – intercultural
communication – creative and critical thinking – learning styles and strategies.
TOTAL: 60 PERIODS
TEACHING METHODS:
1. To be totally learner-centric with minimum teacher intervention as the course revolves
around practice.
2. Suitable audio/video samples from Podcast/YouTube to be used for illustrative purposes.
3. Portfolio approach for writing to be followed. Learners are to be encouraged to blog, tweet,
text and email employing appropriate language.
4. GD/Interview/Role Play/Debate could be conducted off the laboratory (in a regular
classroom) but learners are to be exposed to telephonic interview and video conferencing.
5. Learners are to be assigned to read/write/listen/view materials outside the classroom as
well for graining proficiency and better participation in the class.
LAB INFRASTRUCTURE:
S. No. Description of Equipment (minimum configuration) Qty Required
1 Server 1 No.
PIV System
1 GB RAM / 40 GB HDD
OS: Win 2000 server
Audio card with headphones
JRE 1.3
2 Client Systems 60 Nos.
PIII System
256 or 512 MB RAM / 40 GB HDD
OS: Win 2000
Audio card with headphones
JRE 1.3
3 Handicam 1 No.
4 Television 46” 1 No.
5 Collar mike 1 No.
6 Cordless mike 1 No.
7 Audio Mixer 1 No.
8 DVD recorder/player 1 No.
9 LCD Projector with MP3/CD/DVD provision for
Audio/video facility
1 No.
EVALUATION:
INTERNAL: 20 MARKS
Record maintenance: Students should write a report on a regular basis on the activities
conducted, focusing on the details such as the description of the activity, ideas emerged,
learning outcomes and so on. At the end of the semester records can be evaluated out of 20
marks.
EXTERNAL: 80 MARKS
Online Test - 35 marks
Interview - 15 marks
Presentation - 15 marks
Group Discussion - 15 marks
NOTE ON INTERNAL AND EXTERNAL EVALUATION:
1. Interview – mock interview can be conducted on one-on-one basis.
2. Speaking – example for role play:
a. Marketing engineer convincing a customer to buy his product.
b. Telephonic conversation- fixing an official appointment / placing an order / enquiring
and so on.
3. Presentation – should be extempore on simple topics.
4. Discussion – topics of different kinds; general topics, case studies and abstract concept.
OUTCOMES:
At the end of the course, learners should be able to
Take international examination such as IELTS and TOEFL
Make presentations and Participate in Group Discussions.
Successfully answer questions in interviews.
REFERENCES:
1. Business English Certificate Materials, Cambridge University Press.
2. Graded Examinations in Spoken English and Spoken English for Work downloadable
materials from Trinity College, London.
2. International English Language Testing System Practice Tests, Cambridge University Press.
3. Interactive Multimedia Programs on Managing Time and Stress.
4. Personality Development (CD-ROM), Times Multimedia, Mumbai.
5. Robert M Sherfield and et al. “Developing Soft Skills” 4th edition, New Delhi: Pearson Education,
2009.
WEB SOURCES:
http://www.slideshare.net/rohitjsh/presentation-on-group-discussion
http://www.washington.edu/doit/TeamN/present_tips.html
http://www.oxforddictionaries.com/words/writing-job-applications
http://www.kent.ac.uk/careers/cv/coveringletters.htm
http://www.mindtools.com/pages/article/newCDV_34.htm
CS6701 CRYPTOGRAPHY AND NETWORK SECURITY | syllabus
CS6701 CRYPTOGRAPHY AND NETWORK SECURITY L T P C 3 0 0 3
The student should be made to:
Understand OSI security architecture and classical encryption techniques.
Acquire fundamental knowledge on the concepts of finite fields and number theory.
Understand various block cipher and stream cipher models.
Describe the principles of public key cryptosystems, hash functions and digital signature.
UNIT I INTRODUCTION & NUMBER THEORY (10)
Services, Mechanisms and attacks-the OSI security architecture-Network security model-Classical
Encryption techniques (Symmetric cipher model, substitution techniques, transposition techniques,
steganography).FINITE FIELDS AND NUMBER THEORY: Groups, Rings, Fields-Modular arithmetic-
Euclid’s algorithm-Finite fields- Polynomial Arithmetic –Prime numbers-Fermat’s and Euler’s theorem-
Testing for primality -The Chinese remainder theorem- Discrete logarithms.
UNIT II BLOCK CIPHERS & PUBLIC KEY CRYPTOGRAPHY (10)
Data Encryption Standard-Block cipher principles-block cipher modes of operation-Advanced
Encryption Standard (AES)-Triple DES-Blowfish-RC5 algorithm. Public key cryptography: Principles
of public key cryptosystems-The RSA algorithm-Key management - Diffie Hellman Key exchange-
Elliptic curve arithmetic-Elliptic curve cryptography.
UNIT III HASH FUNCTIONS AND DIGITAL SIGNATURES (8)
Authentication requirement – Authentication function – MAC – Hash function – Security of hash
function and MAC –MD5 - SHA - HMAC – CMAC - Digital signature and authentication protocols –
DSS – EI Gamal – Schnorr.
UNIT IV SECURITY PRACTICE & SYSTEM SECURITY (8)
Authentication applications – Kerberos – X.509 Authentication services - Internet Firewalls for Trusted
System: Roles of Firewalls – Firewall related terminology- Types of Firewalls - Firewall designs - SET
for E-Commerce Transactions. Intruder – Intrusion detection system – Virus and related threats –
Countermeasures – Firewalls design principles – Trusted systems – Practical implementation of
cryptography and security.
UNIT V E-MAIL, IP & WEB SECURITY (9)
E-mail Security: Security Services for E-mail-attacks possible through E-mail - establishing keys
privacy-authentication of the source-Message Integrity-Non-repudiation-Pretty Good Privacy-S/MIME.
IPSecurity: Overview of IPSec - IP and IPv6-Authentication Header-Encapsulation Security Payload
(ESP)-Internet Key Exchange (Phases of IKE, ISAKMP/IKE Encoding). Web Security: SSL/TLS
Basic Protocol-computing the keys- client authentication-PKI as deployed by SSLAttacks fixed in v3-
Exportability-Encoding-Secure Electronic Transaction (SET).
TOTAL: 45 PERIODS
OUTCOMES:
Upon Completion of the course, the students should be able to:
Compare various Cryptographic Techniques
Design Secure applications
Inject secure coding in the developed applications
TEXT BOOKS:
1. William Stallings, Cryptography and Network Security, 6th Edition, Pearson Education, March
2013. (UNIT I,II,III,IV).
2. Charlie Kaufman, Radia Perlman and Mike Speciner, “Network Security”, Prentice Hall of India,
2002. (UNIT V).
REFERENCES:
1. Behrouz A. Ferouzan, “Cryptography & Network Security”, Tata Mc Graw Hill, 2007.
2. Man Young Rhee, “Internet Security: Cryptographic Principles”, “Algorithms and Protocols”, Wiley
Publications, 2003.
3. Charles Pfleeger, “Security in Computing”, 4th Edition, Prentice Hall of India, 2006.
4. Ulysess Black, “Internet Security Protocols”, Pearson Education Asia, 2000.
5. Charlie Kaufman and Radia Perlman, Mike Speciner, “Network Security, Second Edition, Private
Communication in Public World”, PHI 2002.
6. Bruce Schneier and Neils Ferguson, “Practical Cryptography”, First Edition, Wiley Dreamtech
India Pvt Ltd, 2003.
7. Douglas R Simson “Cryptography – Theory and practice”, First Edition, CRC Press, 1995.
8. http://nptel.ac.in/.
Click here to download full syllabus AULibrary.com
CS6702 GRAPH THEORY AND APPLICATIONS | syllabus
CS6702 GRAPH THEORY AND APPLICATIONS L T P C 3 0 0 3
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.
TOTAL: 45 PERIODS
OUTCOMES:
Upon Completion of the course, the students should be able to:
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”, Mc Graw Hill, 1985.
4. Rosen K.H., “Discrete Mathematics and Its Applications”, Mc Graw Hill, 2007
Click here to download full syllabus AULibrary.com
CS6703 GRID AND CLOUD COMPUTING | syllabus
CS6703 GRID AND CLOUD COMPUTING L T P C 3 0 0 3
OBJECTIVES:
The student should be made to:
Understand how Grid computing helps in solving large scale scientific problems.
Gain knowledge on the concept of virtualization that is fundamental to cloud computing.
Learn how to program the grid and the cloud.
Understand the security issues in the grid and the cloud environment.
UNIT I INTRODUCTION (9)
Evolution of Distributed computing: Scalable computing over the Internet – Technologies for network
based systems – clusters of cooperative computers - Grid computing Infrastructures – cloud
computing - service oriented architecture – Introduction to Grid Architecture and standards –
Elements of Grid – Overview of Grid Architecture.
UNIT II GRID SERVICES (9)
Introduction to Open Grid Services Architecture (OGSA) – Motivation – Functionality Requirements –
Practical & Detailed view of OGSA/OGSI – Data intensive grid service models – OGSA services.
UNIT III VIRTUALIZATION (9)
Cloud deployment models: public, private, hybrid, community – Categories of cloud computing:
Everything as a service: Infrastructure, platform, software - Pros and Cons of cloud computing –
Implementation levels of virtualization – virtualization structure – virtualization of CPU, Memory and
I/O devices – virtual clusters and Resource Management – Virtualization for data center automation.
UNIT IV PROGRAMMING MODEL (9)
Open source grid middleware packages – Globus Toolkit (GT4) Architecture , Configuration – Usage
of Globus – Main components and Programming model - Introduction to Hadoop Framework -
Mapreduce, Input splitting, map and reduce functions, specifying input and output parameters,
configuring and running a job – Design of Hadoop file system, HDFS concepts, command line and
java interface, dataflow of File read & File write.
UNIT V SECURITY (9)
Trust models for Grid security environment – Authentication and Authorization methods – Grid
security infrastructure – Cloud Infrastructure security: network, host and application level – aspects of
data security, provider data and its security, Identity and access management architecture, IAM
practices in the cloud, SaaS, PaaS, IaaS availability in the cloud, Key privacy issues in the cloud.
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to:
Apply grid computing techniques to solve large scale scientific problems.
Apply the concept of virtualization.
Use the grid and cloud tool kits.
Apply the security models in the grid and the cloud environment.
TEXT BOOK:
1. Kai Hwang, Geoffery C. Fox and Jack J. Dongarra, “Distributed and Cloud Computing: Clusters,
Grids, Clouds and the Future of Internet”, First Edition, Morgan Kaufman Publisher, an Imprint of
Elsevier, 2012.
REFERENCES:
1. Jason Venner, “Pro Hadoop- Build Scalable, Distributed Applications in the Cloud”, A Press, 2009
2. Tom White, “Hadoop The Definitive Guide”, First Edition. O’Reilly, 2009.
3. Bart Jacob (Editor), “Introduction to Grid Computing”, IBM Red Books, Vervante, 2005
4. Ian Foster, Carl Kesselman, “The Grid: Blueprint for a New Computing Infrastructure”, 2nd Edition,
Morgan Kaufmann.
5. Frederic Magoules and Jie Pan, “Introduction to Grid Computing” CRC Press, 2009.
6. Daniel Minoli, “A Networking Approach to Grid Computing”, John Wiley Publication, 2005.
7. Barry Wilkinson, “Grid Computing: Techniques and Applications”, Chapman and Hall, CRC, Taylor
and Francis Group, 2010.
Click here to download full syllabus AULibrary.com
CS6704 RESOURCE MANAGEMENT TECHNIQUES |syllabus
CS6704 RESOURCE MANAGEMENT TECHNIQUES L T P C 3 0 0 3
The student should be made to:
Be familiar with resource management techniques.
Learn to solve problems in linear programming and Integer programming.
Be exposed to CPM and PERT.
UNIT I LINEAR PROGRAMMING (9)
Principal components of decision problem – Modeling phases – LP Formulation and graphic solution –
Resource allocation problems – Simplex method – Sensitivity analysis.
UNIT II DUALITY AND NETWORKS (9)
Definition of dual problem – Primal – Dual relation ships – Dual simplex methods – Post optimality
analysis – Transportation and assignment model - Shortest route problem.
UNIT III INTEGER PROGRAMMING (9)
Cutting plan algorithm – Branch and bound methods, Multistage (Dynamic) programming.
UNIT IV CLASSICAL OPTIMISATION THEORY: (9)
Unconstrained external problems, Newton – Ralphson method – Equality constraints – Jacobean
methods – Lagrangian method – Kuhn – Tucker conditions – Simple problems.
UNIT V OBJECT SCHEDULING: (9)
Network diagram representation – Critical path method – Time charts and resource leveling – PERT.
TOTAL: 45 PERIODS
OUTCOMES:
Upon Completion of the course, the students should be able to:
Solve optimization problems using simplex method.
Apply integer programming and linear programming to solve real-life applications.
Use PERT and CPM for problems in project management
TEXT BOOK:
1. H.A. Taha, “Operation Research”, Prentice Hall of India, 2002.
REFERENCES:
1. Paneer Selvam, ‘Operations Research’, Prentice Hall of India, 2002
2. Anderson ‘Quantitative Methods for Business’, 8th Edition, Thomson Learning, 2002.
3. Winston ‘Operation Research’, Thomson Learning, 2003.
4. Vohra, ‘Quantitative Techniques in Management’, Tata Mc Graw Hill, 2002.
5. Anand Sarma, ‘Operation Research’, Himalaya Publishing House, 2003.
Click here to download full syllabus AULibrary.com
CS6711 SECURITY LABORATORY | syllabus
CS6711 SECURITY LABORATORY L T P C 0 0 3 2
OBJECTIVES:
The student should be made to:
Be exposed to the different cipher techniques
Learn to implement the algorithms DES, RSA,MD5,SHA-1
Learn to use network security tools like GnuPG, KF sensor, Net Strumbler
LIST OF EXPERIMENTS:
1. Implement the following SUBSTITUTION & TRANSPOSITION TECHNIQUES concepts:
a) Caesar Cipher
b) Playfair Cipher
c) Hill Cipher
d) Vigenere Cipher
e) Rail fence – row & Column Transformation
2. Implement the following algorithms
a) DES
b) RSA Algorithm
c) Diffiee-Hellman
d) MD5
e) SHA-1
5 Implement the SIGNATURE SCHEME - Digital Signature Standard 6. Demonstrate how to provide secure data storage, secure data transmission and for creating
digital signatures (GnuPG). 7. Setup a honey pot and monitor the honeypot on network (KF Sensor) 8. Installation of rootkits and study about the variety of options
9. Perform wireless audit on an access point or a router and decrypt WEP and WPA.( Net
Stumbler) 10. Demonstrate intrusion detection system (ids) using any tool (snort or any other s/w)
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to
Implement the cipher techniques
Develop the various security algorithms
Use different open source tools for network security and analysis
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:
SOFTWARE:
C / C++ / Java or equivalent compiler
GnuPG, KF Sensor or Equivalent, Snort, Net Stumbler or Equivalent
HARDWARE:
Standalone desktops - 30 Nos.
(or)
Server supporting 30 terminals or more.
Click here to download full syllabus AULibrary.com
IT6004 SOFTWARE TESTING | syllabus (ELECTIVE-I)
IT6004 SOFTWARE TESTING L T P C 3 0 0 3
OBJECTIVES:
The student should be made to:
Expose the criteria for test cases.
Learn the design of test cases.
Be familiar with test management and test automation techniques.
Be exposed to test metrics and measurements.
UNIT I INTRODUCTION (9)
Testing as an Engineering Activity – Testing as a Process – Testing axioms – Basic definitions –
Software Testing Principles – The Tester’s Role in a Software Development Organization – Origins of
Defects – Cost of defects – Defect Classes – The Defect Repository and Test Design – Defect
Examples – Developer/Tester Support of Developing a Defect Repository – Defect Prevention
strategies.
UNIT II TEST CASE DESIGN (9)
Test case Design Strategies – Using Black Bod Approach to Test Case Design – Random Testing –
Requirements based testing – Boundary Value Analysis – Equivalence Class Partitioning – Statebased
testing – Cause-effect graphing – Compatibility testing – user documentation testing – domain
testing – Using White Box Approach to Test design – Test Adequacy Criteria – static testing vs.
structural testing – code functional testing – Coverage and Control Flow Graphs – Covering Code
Logic – Paths – code complexity testing – Evaluating Test Adequacy Criteria.
UNIT III LEVELS OF TESTING (9)
The need for Levers of Testing – Unit Test – Unit Test Planning – Designing the Unit Tests – The Test
Harness – Running the Unit tests and Recording results – Integration tests – Designing Integration
Tests – Integration Test Planning – Scenario testing – Defect bash elimination
System Testing – Acceptance testing – Performance testing – Regression Testing –
Internationalization testing – Ad-hoc testing – Alpha, Beta Tests – Testing OO systems – Usability and
Accessibility testing – Configuration testing – Compatibility testing – Testing the documentation –
Website testing.
UNIT IV TEST MANAGEMENT (9)
People and organizational issues in testing – Organization structures for testing teams – testing
services – Test Planning – Test Plan Components – Test Plan Attachments – Locating Test Items –
test management – test process – Reporting Test Results – The role of three groups in Test Planning
and Policy Development – Introducing the test specialist – Skills needed by a test specialist – Building
a Testing Group.
UNIT V TEST AUTOMATION (9)
Software test automation – skill needed for automation – scope of automation – design and
architecture for automation – requirements for a test tool – challenges in automation – Test metrics
and measurements – project, progress and productivity metrics.
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course the students will be able to
Design test cases suitable for a software development for different domains.
Identify suitable tests to be carried out.
Prepare test planning based on the document.
Document test plans and test cases designed.
Use of automatic testing tools.
Develop and validate a test plan.
TEXT BOOKS:
1. Srinivasan Desikan and Gopalaswamy Ramesh, “Software Testing – Principles and
Practices”, Pearson Education, 2006.
2. Ron Patton, “Software Testing”, Second Edition, Sams Publishing, Pearson Education, 2007.
REFERENCES:
1. Ilene Burnstein, “Practical Software Testing”, Springer International Edition, 2003.
2. Edward Kit,” Software Testing in the Real World – Improving the Process”, Pearson Education,
1995.
3. Boris Beizer,” Software Testing Techniques” – 2nd Edition, Van Nostrand Reinhold, New York,
1990.
4. Aditya P. Mathur, “Foundations of Software Testing _ Fundamental Algorithms and
Techniques”, Dorling Kindersley (India) Pvt. Ltd., Pearson Education, 2008.
Click here to download full syllabus AULibrary.com