CS6403 SOFTWARE ENGINEERING SYLLABUS

CS6403 SOFTWARE ENGINEERING SYLLABUS
REGULATION 2013

UNIT I 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 III 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

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

Estimation – FP Based, LOC Based, Make/Buy Decision, COCOMO II - Planning – Project Plan, Planning Process, RFP Risk Management – Identification, Projection, RMMM - Scheduling and Tracking –Relationship between people and effort, Task Set & Network, Scheduling, EVA - Process and Project Metrics.

CS6304 ANALOG AND DIGITAL COMMUNICATION SYLLABUS

CS6304 ANALOG AND DIGITAL COMMUNICATION SYLLABUS FOR ANNA UNIVERSITY THIRD SEMESTER CSE IT STUDENTS
University : Anna university
Semester : 3rd Sem
Department : CSE , IT
Year : Second Yr
Regulation : 2013
Subject Credits : 3

CS6304 ANALOG AND DIGITAL COMMUNICATION
SYLLABUS
REGULATION 2013
OBJECTIVES:
The student should be made to:
Understand analog and digital communication techniques.
Learn data and pulse communication techniques.
Be familiarized with source and Error control coding.
Gain knowledge on multi-user radio communication.
UNIT I ANALOG COMMUNICATION
Noise: Source of Noise - External Noise- Internal 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 Modulation – Comparison of various Analog Communication System (AM –FM – PM).
UNIT II DIGITAL CO MMUNICATION
Amplitude Shift Keying (ASK) – Frequency Shift 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 Efficiency– Comparison of various Digital Communication System (ASK– FSK – PSK – QAM).
UNIT III DATA AND PULSE COMMUNICATION
Data Communication: History of Data Communication - Standards Organizations for Data Communication- Data Communication Circuits - Data Communication Codes - Error Detection and Correction Techniques - Data communication Hardware - serial and parallel interfaces. Pulse Communication: Pulse Amplitude Modulation (PAM) – Pulse Time Modulation (PTM) – Pulse code Modulation (PCM) - Comparison of various Pulse Communication System (PAM – PTM – PCM).
UNIT IV SOURCE AND ERROR CONTROL CODING
Entropy, Source encoding theorem, Shannon fano coding, Huffman coding, mutual information,
channel capacity, channel coding theorem, Error Control Coding, linear block codes, cyclic codes, convolution codes, viterbi decoding algorithm.
UNIT V MULTI-USER RADIO COMMUNICATION
Advanced Mobile Phone System (AMPS) - Global System for Mobile Communications (GSM) - Code division multiple access (CDMA) – Cellular Concept and Frequency Reuse - Channel Assignment and Hand - Overview of Multiple Access Schemes - Satellite Communication - Bluetooth.
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to:
Apply analog and digital communication techniques.
Use data and pulse communication techniques.
Analyze Source and Error control coding.
Utilize multi-user radio communication.
TEXT BOOK:
1. Wayne Tomasi, “Advanced Electronic Communication Systems”, 6th Edition, Pearson Education, 2009.
REFERENCES:
1. Simon Haykin, “Communication Systems”, 4th Edition, John Wiley & Sons, 2004
2. Rappaport T.S, "Wireless Communications: Principles and Practice", 2nd Edition, Pearson
Education, 2007
3. H.Taub, D L Schilling and G Saha, “Principles of Communication”, 3rd Edition, Pearson Education, 2007.
4. B. P.Lathi, “Modern Analog and Digital Communication Systems”, 3rd Edition, Oxford University Press, 2007.
5. Blake, “Electronic Communication Systems”, Thomson Delmar Publications, 2002.rd
6. Martin S.Roden, “Analog and Digital Communication System”, 3 Edition, Prentice Hall of India,2002. nd
7. B.Sklar, “Digital Communication Fundamentals and Applications” 2 Edition Pearson Education 2007.

CS6312/IT6312 DATABASE MANAGEMENT SYSTEMS LABORATORY SYLLABUS

CS6312/IT6312 DATABASE MANAGEMENT SYSTEMS LABORATORY
SYLLABUS
REGULATION 2013

OBJECTIVES:
The student should be made to:
Learn to create and use a database
Be familiarized with a query language
Have hands on experience on DDL Commands
Have a good understanding of DML Commands and DCL
commands Familiarize advanced SQL queries.
Be Exposed to different applications

LIST OF EXPERIMENTS:
1. Creation of a database and writing SQL queries to retrieve information from the database.
2. Performing Insertion, Deletion, Modifying, Altering, Updating and Viewing records based on
conditions.
3. Creation of Views, Synonyms, Sequence, Indexes, Save point.
4. Creating an Employee database to set various constraints.
5. Creating relationship between the databases.
6. Study of PL/SQL block.
7. Write a PL/SQL block to satisfy some conditions by accepting input from the user.
8. Write a PL/SQL block that handles all types of exceptions.
9. Creation of Procedures.
10. Creation of database triggers and functions
11. Mini project (Application Development using Oracle/ Mysql )
a) Inventory Control System.
b) Material Requirement Processing.
c) Hospital Management System.
d) Railway Reservation System.
e) Personal Information System.
f) Web Based User Identification System.
g) Timetable Management System.
h) Hotel Management System
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to:
Design and implement a database schema for a given problem domain
Populate and query a database
Create and maintain tables using
PL/SQL. Prepare reports.
REFERENCE:
spoken-tutorial.org
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:
HARDWARE:
Standalone desktops 30 Nos.
(or)
Server supporting 30 terminals or more.

SOFTWARE:
Front end: VB/VC ++/JAVA or Equivalent
Back end: Oracle / SQL / MySQL/ PostGress / DB2 or Equivalent.

CS6311/IT6311 PROGRAMMING AND DATA STRUCTURE LABORATORY 2 SYLLABUS

CS6311/IT6311 PROGRAMMING AND DATA STRUCTURE LABORATORY 2
SYLLABUS
REGULATION 2013

OBJECTIVES:

The student should be made to:
Be familiarized with good programming design methods, particularly Top- Down design. Getting exposure in implementing the different data structures using C++ Appreciate recursive algorithms.
LIST OF EXPERIMENTS:
IMPLEMENTATION IN THE FOLLOWING TOPICS:
1. Constructors & Destructors, Copy Constructor.
2. Friend Function & Friend Class.
3. Inheritance.
4. Polymorphism & Function Overloading.
5. Virtual Functions.
6. Overload Unary & Binary Operators Both as Member Function & Non Member Function.
7. Class Templates & Function Templates.
8. Exception Handling Mechanism.
9. Standard Template Library concept.
10. File Stream classes.
11. Applications of Stack and Queue
12. Binary Search Tree
13. Tree traversal Techniques
14. Minimum Spanning Trees
15. Shortest Path Algorithms
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to:
Design and implement C++ programs for manipulating stacks, queues, linked lists, trees, and graphs.
Apply good programming design methods for program development.
Apply the different data structures for implementing solutions to practical problems.
Develop recursive programs using trees and graphs.
REFERENCE:
spoken-tutorial.org.
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:
Standalone desktops with C++ complier 30 Nos.
(or)
Server with C++ compiler supporting 30 terminals or more.

CS6303 COMPUTER ARCHITECTURE SYLLABUS

CS6303 COMPUTER ARCHITECTURE SYLLABUS FOR ANNA UNIVERSITY THIRD SEMESTER CSE STUDENTS
University : Anna university
Semester : 3rd Sem
Department : CSE
Year : Second Yr
Regulation : 2013
Subject Credits : 3
CS6303 COMPUTER ARCHITECTURE
SYLLABUS
REGULATION 2013

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 andvirtual memory.
To expose the students with different ways of communicating with I/O devices and standard I/O interfaces.
UNIT I OVERVIEW & INSTRUCTIONS
Eight ideas – Components of a computer system – Technology – Performance – Power wall –
Uniprocessors to multiprocessors; Instructions – operations and operands – representing instructions – Logical operations – control operations – Addressing and addressing modes.
UNIT II ARITHMETIC OPERATIONS
ALU - Addition and subtraction – Multiplication – Division – Floating Point operations – Subword parallelism.
UNIT III 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
Instruction-level-parallelism – Parallel processing challenges – Flynn's classification – Hardware multithreading – Multicore processors
UNIT V MEMORY AND I/O SYSTEMS
Memory hierarchy - Memory technologies – Cache basics – Measuring and improving cache
performance - Virtual memory, TLBs - Input/output system, programmed I/O, DMA and interrupts, I/O 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“, VI th
edition, Mc Graw-Hill Inc, 2012.
2. William Stallings “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 Hill, New Delhi, 2005.
5. John P. Hayes, “Computer Architecture and Organization”, Third Edition, Tata Mc Graw Hill,
1998.
6. http://nptel.ac.in/.

MA6351 TRANSFORMS AND PARTIAL DIFFERENTIAL EQUATIONS TPDE SYLLABUS

MA6351 TRANSFORMS AND PARTIAL DIFFERENTIAL EQUATIONS TPDE SYLLABUS FOR ANNA UNIVERSITY THIRD SEMESTER STUDENTS

University : Anna university
Semester : 3rd Sem
Department : CSE,IT,EEE,ECE,MECH,CIVIL etc
Year : Second Yr
Regulation : 2013
Subject Credits : 4
MA6351 TRANSFORMS AND PARTIAL DIFFERENTIAL EQUATIONS
SYLLABUS
REGULATION 2013
OBJECTIVES
 To introduce Fourier series analysis which is central to many applications in engineering apartfrom its use in solving boundary value problems.
 To acquaint the student with Fourier transform techniques used in wide variety of situations.
 To introduce the effective mathematical tools for the solutions of partial differential equations
that model several physical processes and to develop Z transform techniques for discrete time
systems.
UNIT I PARTIAL DIFFERENTIAL E QUATIONS
Formation of partial differential equations – Singular integrals -- Solutions of standard types of first order partial differential equations - Lagrange’s linear equation -- Linear partial differential equations of second and higher order with constant coefficients of both homogeneous and non-homogeneous types.
UNIT II FOURIER SERIES
Dirichlet’s conditions – General Fourier series – Odd and even functions – Half range sine series – Half range cosine series – Complex form of Fourier series – Parseval’s identity – Harmonic analysis.
UNIT III APPLICATIONS OF PARTIAL DIFFERENTIAL EQUATIONS
Classification of PDE – Method of separation of variables - Solutions of one dimensional wave
equation – One dimensional equation of heat conduction – Steady state solution of two dimensional equation of heat conduction (excluding insulated edges).
UNIT IV FOURIER TRANSFORMS
Statement of Fourier integral theorem – Fourier transform pair – Fourier sine and cosine transforms – Properties – Transforms of simple functions – Convolution theorem – Parseval’s identity.
UNIT V Z - TRANSFORMS AND DIFFERENCE EQUATIONS
Z- transforms - Elementary properties – Inverse Z - transform (using partial fraction and residues) – Convolution theorem - Formation of difference equations – Solution of difference equations using Z - transform.
TOTAL (L:45+T:15): 60 PERIODS
OUTCOMES
 The understanding of the mathematical principles on transforms and partial differential equations would provide them the ability to formulate and solve some of the physical problems
of engineering.
TEXT BOOKS
1. Veerarajan. T., "Transforms and Partial Differential Equations", Tata McGraw Hill Education Pvt. Ltd., Second reprint, New Delhi, 2012.
2. Grewal. B.S., "Higher Engineering Mathematics", 42nd Edition, Khanna Publishers, Delhi, 2012.
3. Narayanan.S., Manicavachagom Pillay.T.K and Ramanaiah.G "Advanced Mathematics for Engineering Students" Vol. II & III, S.Viswanathan Publishers Pvt Ltd. 1998.
REFERENCES
1. Bali.N.P and Manish Goyal, "A Textbook of Engineering Mathematics", 7th Edition, Laxmi Publications Pvt Ltd, 2007.
2. Ramana.B.V., "Higher Engineering Mathematics", Tata Mc-Graw Hill Publishing Company Limited, New Delhi, 2008.
3. Glyn James, "Advanced Modern Engineering Mathematics", 3rd Edition, Pearson Education, 2007.
4. Erwin Kreyszig, "Advanced Engineering Mathematics", 8th Edition, Wiley India, 2007.
5. Ray Wylie. C and Barrett.L.C, "Advanced Engineering Mathematics", Sixth Edition, Tata McGraw Hill Education Pvt Ltd, New Delhi, 2012.
6. Datta.K.B., "Mathematical Methods of Science and Engineering", Cengage Learning India Pvt Ltd, Delhi, 2013.

CS6302 DATABASE MANAGEMENT SYSTEMS SYLLABUS

CS6302 DATABASE MANAGEMENT SYSTEMS SYLLABUS FOR ANNA UNIVERSITY THIRD SEMESTER CSE STUDENTS
University : Anna university
Semester : 3rd Sem
Department : CSE
Year : Second Yr
Regulation : 2013
Subject Credits : 3
CS6302 DATABASE MANAGEMENT SYSTEMS
SYLLABUS
REGULATION 2013
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 SQL-Static Vs Dynamic SQL - QUERY OPTIMIZATION: Query Processing and Optimization - Heuristics and Cost Estimates in Query Optimization.
UNIT III 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
Overview of Physical Storage Media – Magnetic Disks – RAID – Tertiary storage – File Organization – Organization of Records in Files – Indexing and Hashing –Ordered Indices – 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 - Mobile and web databases- Data Warehouse-Mining- Data marts.
UNIT V ADVANCED TOPICS
DATABASE SECURITY: Data Classification-Threats and risks – Database access Control – Types of Privileges –Cryptography- Statistical Databases.- Distributed Databases-Architecture-Transaction Processing-Data Warehousing and Mining-Classification-Association rules-Clustering-Information Retrieval- Relevance ranking-Crawling and Indexing the Web- Object Oriented Databases-XML Databases.
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 System Concepts”, Sixth Edition, Tata Mc Graw Hill, 2011.
2. C.J.Date, A.Kannan and S.Swamynathan, “An Introduction to Database Systems”, Eighth
Edition, Pearson Education, 2006.
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.
5. Raghu Ramakrishnan, “Database Management Systems”, Fourth Edition, Tata Mc Graw Hill, 2010.
6. G.K.Gupta, “Database Management Systems”, Tata Mc Graw Hill, 2011.
7. Rob Cornell, “Database Systems Design and Implementation”, Cengage Learning, 2011.

GE6351 ENVIRONMENTAL SCIENCE AND ENGINEERING SYLLABUS

GE6351 ENVIRONMENTAL SCIENCE AND ENGINEERING SYLLABUS FOR ANNA UNIVERSITY THIRD SEMESTER CSE STUDENTS
University : Anna university
Semester : 3rd Sem
Department : CSE/IT/EEE
Year : Second Yr
Regulation : 2013
Subject Credits : 3

GE6351 ENVIRONMENTAL SCIENCE AND ENGINEERING
SYLLABUS
REGULATION 2013
OBJECTIVES:
To the study of nature and the facts about environment.
To find and implement scientific, technological, economic and political solutions to environmental problems.
To study the interrelationship between living organism and environment.
To appreciate the importance of environment by assessing its impact on the human world; envision the surrounding environment, its functions and its value.
To study the dynamic processes and understand the features of the earth’s
interior
and surface.
To study the integrated themes and biodiversity, natural resources, pollution control and waste management.

UNIT I ENVIRONMENT, ECOSYSTEMS AND BIODIVERSITY

Definition, scope and importance of Risk and hazards; Chemical hazards, Physical hazards,

Biological hazards in the environment – concept of an ecosystem – structure and function of an

ecosystem – producers, consumers and decomposers-Oxygen cycle and Nitrogen cycle – energy flow in the ecosystem – ecological succession processes – Introduction, types, characteristic features, structure and function of the (a) forest ecosystem (b) grassland ecosystem (c) desert ecosystem (d) aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries) – Introduction to biodiversity definition: genetic, species and ecosystem diversity – biogeographical classification of India – value of biodiversity: consumptive use, productive use, social, ethical, aesthetic and option values – Biodiversity at global, national and local levels – India as a mega-diversity nation – hot-spots of biodiversity – threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts – endangered and endemic species of India – conservation of biodiversity: In-situ and ex-situ conservation of biodiversity. Field study of common plants, insects, birds Field study of simple ecosystems – pond, river, hill slopes, etc.
UNIT II ENVIRONMENTAL POLLUTION
Definition – causes, effects and control measures of: (a) Air pollution (Atmospheric chemistry- Chemical composition of the atmosphere; Chemical and photochemical reactions in the atmosphere -formation of smog, PAN, acid rain, oxygen and ozone chemistry;- Mitigation procedures- Control of particulate and gaseous emission, Control of SO2, NO X, CO and HC) (b) Water pollution : Physical and chemical properties of terrestrial and marine water and their environmental significance; Water quality parameters – physical, chemical and biological; absorption of heavy metals - Water treatment processes. (c) Soil pollution - soil waste management: causes, effects and control measures of municipal solid wastes – (d) Marine pollution (e) Noise pollution (f) Thermal pollution (g) Nuclear hazards–role of an individual in prevention of pollution – pollution case studies – Field study of local polluted site – Urban / Rural / Industrial / Agricultural.

UNIT III NATURAL RESOURCES
Forest resources: Use and over-exploitation, deforestation, case studies- timber extraction, mining, dams and their effects on forests and tribal people – Water resources: Use and overutilization of surface and ground water, dams-benefits and problems – Mineral resources: Use and exploitation, environmental effects of extracting and using mineral resources, case studies – Food resources: World food problems, changes caused by agriculture and overgrazing, effects of modern agriculture, fertilizer-pesticide problems, water logging, salinity, case studies – Energy resources: Growing energy needs, renewable and non renewable energy sources, use of alternate energy sources. Energy Conversion processes – Biogas – production and uses, anaerobic digestion; case studies – Land resources: Land as a resource, land degradation, man induced landslides, soil erosion and desertification – role of an individual in conservation of natural resources – Equitable use of resources for sustainable lifestyles. Introduction to Environmental Biochemistry: Proteins –Biochemical degradation of pollutants, Bioconversion of pollutants. Field study of local area to document environmental assets – river/forest/grassland/hill/mountain.
UNIT IV SOCIAL ISSUES AND THE ENVIRONMENT
From unsustainable to sustainable development – urban problems related to energy – water conservation, rain water harvesting, watershed management – resettlement and rehabilitation of people; its problems and concerns, case studies – role of non-governmental organizationenvironmental ethics: Issues and possible solutions – 12 Principles of green chemistry- nuclear accidents and holocaust, case studies. – wasteland reclamation – consumerism and waste products – environment production act – Air act – Water act – Wildlife protection act – Forest conservation act – The Biomedical Waste (Management and Handling) Rules; 1998 and amendments- scheme of labeling of environmentally friendly products (Ecomark). enforcement machinery involved in environmental legislation- central and state pollution control boards- disaster management: floods, earthquake, cyclone and landslides. Public awareness.
UNIT V HUMAN POPULATION AND THE ENVIRONMENT
Population growth, variation among nations – population explosion – family welfare programme – environment and human health – human rights – value education – HIV / AIDS – women and child welfare –Environmental impact analysis (EIA)- -GIS-remote sensing-role of information technology in environment and human health – Case studies.
TOTAL: 45 PERIODS
OUTCOMES:
Environmental Pollution or problems cannot be solved by mere laws. Public participation is an important aspect which serves the environmental Protection. One will obtain knowledge on the following after completing the course.
Public awareness of environment at infant stage.
Ignorance and incomplete knowledge has lead to misconceptions.
Development and improvement in standard of living has lead to seriousenvironmental disasters.
TEXT BOOKS:
1. Gilbert M.Masters, ‘Introduction to Environmental Engineering and Science’, 2nd Edition, Pearson Education 2004.
2. Benny Joseph, ‘Environmental Science and Engineering’, Tata Mc Graw-Hill, New Delhi, 2006.
REFERENCES:
1. R.K. Trivedi, “Handbook of Environmental Laws, Rules, Guidelines, Compliances and Standard”, Vol. I and II, Enviro Media.
2. Cunningham, W.P. Cooper, T.H. Gorhani, ‘Environmental Encyclopedia’,Jaico Publ.,House,
Mumbai, 2001.
3. Dharmendra S. Sengar, ‘Environmental law’, Prentice Hall of India PVT LTD, New Delhi, 2007.
4. Rajagopalan, R, ‘Environmental Studies-From Crisis to Cure’, Oxford University Press 2005.

CS6301 PROGRAMMING AND DATA STRUCTURES 2 SYLLABUS

CS6301 PROGRAMMING AND DATA STRUCTURES 2 SYLLABUS FOR ANNA UNIVERSITY THIRD SEMESTER CSE STUDENTS
University : Anna university
Semester : 3rd Sem
Department : CSE
Year : Second Yr
Regulation : 2013
Subject Credits : 3
CS6301 PROGRAMMING AND DATA STRUCTURES 2
SYLLABUS
REGULATION 2013

OBJECTIVES:
The student should be made to:
Be familiar with the C++ concepts of abstraction, encapsulation, constructor, polymorphism,
overloading and Inheritance. Learn advanced nonlinear data structures. Be exposed to graph algorithms Learn 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 OBJECT 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 III C++ PROGRAMMING ADVANCED FEATURES
Abstract class – Exception handling - Standard libraries - Generic Programming - templates – class 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 – Shortest path algorithm – Dijkstra’s algorithm – Bellman-Ford algorithm – Floyd - Warshall algorithm.
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 C++ 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++”, 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 Algorithms in C++”, 7th Edition, Wiley Publishers, 2004.

Seaech by google keywords:

Annauniversity 2013 regulation pds 2 syllabus,

Anna university pds2 syllabus

Programming data structures 2 syllabus

Cs6301 Syllabus

Cs6301 programming data structures 2 syllabus

Cse 3rd sem Syllabus

CY6251 ENGINEERING CHEMISTRY

ANNA UNIVERSITY CHENNAI
CY6251 ENGINEERING CHEMISTRY - II SYLLABUS
REGULATION - 2013
SECOND SEMESTER SYLLABUS

CY6251                                      ENGINEERING CHEMISTRY - II             

UNIT I WATER TECHNOLOGY 9
Introduction to boiler feed water-requirements-formation of deposits in steam boilers and heat exchangers- disadvantages (wastage of fuels, decrease in efficiency, boiler explosion) prevention of scale formation -softening of hard water -external treatment zeolite and demineralization - internal treatment- boiler compounds (phosphate, calgon, carbonate, colloidal) - caustic embrittlement-boiler corrosion-priming and foaming- desalination of brackish water –reverse osmosis.

UNIT II ELECTROCHEMISTRY AND CORROSION 9
Electrochemical cell - redox reaction, electrode potential- origin of electrode potential- oxidation potential- reduction potential, measurement and applications - electrochemical series and its significance - Nernst equation (derivation and problems). Corrosion- causes- factors- typeschemical, electrochemical corrosion (galvanic, differential aeration), corrosion control - material selection and design aspects - electrochemical protection – sacrificial anode method and impressed current cathodic method. Paints- constituents and function. Electroplating of Copper and electroless plating of nickel.

UNIT III ENERGY SOURCES 9
Introduction- nuclear energy- nuclear fission- controlled nuclear fission- nuclear fusion- differences between nuclear fission and fusion- nuclear chain reactions- nuclear reactor power generatorclassification of nuclear reactor- light water reactor- breeder reactor- solar energy conversion- solar cells- wind energy. Batteries and fuel cells:Types of batteries- alkaline battery- lead storage batterynickel-cadmium battery- lithium battery- fuel cell H2 -O2 fuel cell- applications.

UNIT IV ENGINEERING MATERIALS 9
Abrasives: definition, classification or types, grinding wheel, abrasive paper and cloth. Refractories: definition, characteristics, classification, properties – refractoriness and RUL, dimensional stability, thermal spalling, thermal expansion, porosity; Manufacture of alumina, magnesite and silicon carbide, Portland cement- manufacture and properties - setting and hardening of cement, special cement- waterproof and white cement–properties and uses. Glass - manufacture, types, properties and uses.

UNIT V FUELS AND COMBUSTION 9
Fuel: Introduction- classification of fuels- calorific value- higher and lower calorific values- coalanalysis of coal (proximate and ultimate)- carbonization- manufacture of metallurgical coke (Otto Hoffmann method) - petroleum- manufacture of synthetic petrol (Bergius process)- knocking- octane number - diesel oil- cetane number - natural gas- compressed natural gas(CNG)- liquefied petroleum gases(LPG)- producer gas- water gas. Power alcohol and bio diesel. Combustion of fuels: introduction- theoretical calculation of calorific value- calculation of stoichiometry of fuel and air ratioignition temperature- explosive range - flue gas analysis (ORSAT Method).

TOTAL: 45 PERIODS

TEXT BOOKS
1. Vairam S, Kalyani P and SubaRamesh.,“Engineering Chemistry”., Wiley India PvtLtd.,New
Delhi., 2011
2. DaraS.S,UmareS.S.“Engineering Chemistry”, S. Chand & Company Ltd., New Delhi , 2010

REFERENCES
1 Kannan P. and Ravikrishnan A., “Engineering Chemistry”, Sri Krishna Hi-tech Publishing
Company Pvt. Ltd. Chennai, 2009
2. AshimaSrivastava and Janhavi N N., “Concepts of Engineering Chemistry”, ACME Learning
Private Limited., New Delhi., 2010.
3. RenuBapna and Renu Gupta., “Engineering Chemistry”, Macmillan India Publisher Ltd., 2010.
4 Pahari A and Chauhan B., “Engineering Chemistry”., Firewall Media., New Delhi., 2010.

Anna University 2013 Syllabus all Departments

Anna university BE Syllabus-2013 Regulation

You can find the B.E Engineering syllabus below. You can view online or download PDF by clicking on your department. This contains the 1st semester, 2nd, 3rd, 4th, 5th, 6th, 7th, 8th semester syllabus. All the subject syllabus with the subject codes and credits table is given. This syllabus is given as syllabus book in many colleges.
Civil Engineering
Aeronautical Engineering
Automobile Engineering
Mechanical Engineering
Electrical and Electronics Engineering (EEE)
Electronics and Instrumentation (E&I / EIE)
Computer Science and Engineering (CSE)
Electronics and Communication Engineering (ECE)
Information Technology (IT)
Other Branches

CS6501 INTERNET PROGRAMMING SYLLABUS

ANNA UNIVERSITY CSE SYLLABUS

5TH SEM CSE
REGULATION 2013
OBJECTIVES:
The student should be made to:
Learn Java Programming.
Understand different Internet Technologies.
Be exposed to java specific web services architecture.
UNIT I JAVA PROGRAMMING
An overview of Java – Data Types – Variables and Arrays – Operators – Control Statements – Classes – Objects – Methods – Inheritance - Packages – Abstract classes – Interfaces and Inner classes – Exception handling - Introduction to Threads – Multithreading – String handling – Streams and I/O – Applets.

UNIT II WEBSITES BASICS, HTML 5, CSS 3, WEB 2.0
Web 2.0: Basics-RIA Rich Internet Applications - Collaborations tools - Understanding websites and web servers: Understanding Internet – Difference between websites and web server- Internet technologies Overview – Understanding the difference between internet and intranet; HTML and CSS: HTML 5.0 , XHTML, CSS 3.

UNIT III CLIENT SIDE AND SERVER SIDE PROGRAMMING
Java Script: 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: JDBC perspectives, JDBC program example - JSP: Understanding Java Server Pages-JSP Standard Tag Library(JSTL)-Creating HTML forms by embedding JSP code.

UNIT IV PHP and XML
An introduction to PHP: PHP- Using PHP- Variables- Program control- Built-in functions-Connecting to Database – Using Cookies-Regular Expressions; XML: Basic XML- 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
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:45+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 Hall, 5th 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, 2 nd Edition,1999.
2. Chris Bates, Web Programming – Building Intranet Applications, 3 rd Edition, Wiley
Publications, 2009.
3. Jeffrey C and Jackson, “Web Technologies A Computer Science Perspective”, Pearson
Education, 2011.
4. Gopalan N.P. and Akilandeswari J., “Web Technology”, Prentice Hall of India, 2011.
5. Paul Dietel and Harvey Deitel, “Java How to Program”, , 8 th Edition Prentice Hall of India.
6. Mahesh P. Matha, “Core Java A Comprehensive Study”, Prentice Hall of India, 2011.
7. Uttam K.Roy, “Web Technologies”, Oxford University Press, 2011.

CS6502 OBJECT ORIENTED ANALYSIS AND DESIGN SYLLABUS

ANNA UNIVERSITY CSE SYLLABUS

5TH SEM CSE
REGULATION 2013
OBJECTIVES:
The student should be made to:
Learn the basics of OO analysis and design
skills. Learn the UML design diagrams.
Learn 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
GRASP: Designing objects with responsibilities – Creator – Information expert – Low Coupling – High Cohesion – Controller - Design Patterns – creational - factory method - structural – Bridge – Adapter - behavioral – Strategy – observer.

UNIT III CASE STUDY
Case study – the Next Gen POS system, Inception -Use case Modeling - Relating Use cases – include, extend and generalization - Elaboration - Domain Models - Finding conceptual classes and description classes – Associations – Attributes – Domain model refinement – Finding conceptual class Hierarchies - Aggregation and Composition.

UNIT IV APPLYING DESIGN PATTERNS
System sequence diagrams - Relationship between sequence diagrams and use cases Logical architecture and UML package diagram – Logical architecture refinement - UML class diagrams - UML interaction diagrams - Applying GoF design patterns.

UNIT V CODING AND TESTING
Mapping design to code – Testing: Issues in OO Testing – Class Testing – OO Integration Testing – GUI Testing – OO System Testing.

TOTAL: 45 PERIODS

OUTCOMES:
At the end of the course, the student should be able to:
Design and implement projects using OO concepts.
Use the UML analysis and design diagrams.
Apply appropriate design patterns.
Create code from design.
Compare and contrast various testing techniques.
TEXT BOOK:
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. Richard Helm, Ralph Johnson, John Vlissides, “Design patterns:
2. Erich Gamma, a n d Elements of Reusable Object-Oriented Software”, Addison-Wesley, 1995.
3. Martin Fowler, “UML Distilled: A Brief Guide to the Standard Object Modeling Language”, Third edition, Addison Wesley, 2003.
4. Paul C. Jorgensen, “Software Testing:- A Craftsman’s Approach”, Third Edition, Auerbach
Publications, Taylor and Francis Group, 2008.

CS6504 COMPUTER GRAPHICS SYLLABUS

ANNA UNIVERSITY CSE SYLLABUS

5TH SEM CSE
REGULATION 2013
OBJECTIVES:
The student should be made to:
Gain knowledge about graphics hardware devices and software
used. Understand the two dimensional graphics and their
transformations. Understand the three dimensional graphics and their
transformations. Appreciate illumination and color models.
Be familiar with understand clipping techniques.
UNIT I 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 algorithms, loading the frame buffer, line function; circle and ellipse generating algorithms; Pixel addressing and object geometry, filled area primitives.

UNIT II TWO DIMENSIONAL GRAPHICS
Two dimensional geometric transformations – Matrix representations and homogeneous coordinates, composite transformations; Two dimensional viewing – viewing pipeline, viewing coordinate reference frame; widow-to-viewport coordinate transformation, Two dimensional viewing functions; clipping operations – point, line, and polygon clipping algorithms.

UNIT III THREE DIMENSIONAL GRAPHICS
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 patterns 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 animation – key frame systems – motion specification –morphing – tweening.
COMPUTER GRAPHICS REALISM : Tiling the plane – Recursively defined curves – Koch curves – C curves – Dragons – space filling curves – fractals – Grammar based models – fractals –turtle graphics – ray tracing.

TOTAL: 45 PERIODS

OUTCOMES:
At the end of the course, the student should be able to:
Design two dimensional graphics.
Apply two dimensional transformations.
Design three dimensional graphics.
Apply three dimensional transformations.
Apply Illumination and color models.
Apply clipping techniques to graphics.
Design animation sequences.
TEXT BOOKS:
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 Practice”, , 3 rd Edition, Addison-Wesley Professional,2013. (UNIT I, II, III, IV).
2. Donald Hearn and Pauline Baker M, “Computer Graphics", Prentice Hall, New Delhi, 2007 (UNIT V).

REFERENCES:
1. Donald Hearn and M. Pauline Baker, Warren Carithers,“Computer Graphics With Open GL”, 4th Edition, Pearson Education, 2010.
2. Jeffrey McConnell, “Computer Graphics: Theory into Practice”, Jones and Bartlett Publishers, 2006.
3. Hill F S Jr., "Computer Graphics", Maxwell Macmillan” , 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/

CS6503 THEORY OF COMPUTATION SYLLABUS

ANNA UNIVERSITY CSE SYLLABUS

5TH SEM CSE
REGULATION 2013

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
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
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
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
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
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.

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 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.

MA6566 DISCRETE MATHMATICS syllabus

ANNA UNIVERSITY CSE SYLLABUS
5TH SEM CSE
REGULATION 2013
OBJECTIVES:
To extend student’s Logical and Mathematical maturity and ability to deal with abstraction and to introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems.

UNIT I LOGIC AND PROOFS
Propositional Logic – Propositional equivalences - Predicates and Quantifiers – Nested Quantifiers – Rules of inference - Introduction to proofs – Proof methods and strategy.

UNIT II COMBINATORICS
Mathematical induction – Strong induction and well ordering – The basics of counting – The
pigeonhole principle – Permutations and combinations – Recurrence relations – Solving linear recurrence relations – Generating functions – Inclusion and exclusion principle and its applications.

UNIT III GRAPHS
Graphs and graph models – Graph terminology and special types of graphs – Matrix representation of graphs and graph isomorphism – Connectivity – Euler and Hamilton paths.

UNIT IV ALGEBRAIC STRUCTURES
Algebraic systems – Semi groups and monoids - Groups – Subgroups – Homomorphism’s – Normal subgroup and cosets – Lagrange’s theorem – Definitions and examples of Rings and Fields.

UNIT V LATTICES AND BOOLEAN ALGEBRA
Partial ordering – Posets – Lattices as posets – Properties of lattices - Lattices as algebraic systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean algebra.

TOTAL (L: 45+T:15): 60 PERIODS

OUTCOMES:
At the end of the course, students would:
Have knowledge of the concepts needed to test the logic of a program.
Have an understanding in identifying structures on many levels.
Be aware of a class of functions which transform a finite set into another finite set which relates to input and output functions in computer science.
Be aware of the counting principles.
Be exposed to concepts and properties of algebraic structures such as groups, rings and fields.

TEXT BOOKS:
1. Kenneth H.Rosen, "Discrete Mathematics and its Applications", 7 th Edition, Tata Mc Graw Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2011.
2. Tremblay J.P. and Manohar R, "Discrete Mathematical Structures with Applications to Computer Science", Tata Mc Graw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011.

REFERENCES:
1. Ralph.P.Grimaldi., "Discrete and Combinatorial Mathematics: An Applied Introduction", 4th Edition, Pearson Education Asia, Delhi, 2007.
2. Thomas Koshy., "Discrete Mathematics with Applications", Elsevier Publications, 2006.
3. Seymour Lipschutz and Mark Lipson., "Discrete Mathematics", Schaum’s Outlines, Tata Mc Graw Hill Pub. Co. Ltd., New Delhi, 3 rd Edition, 2010.

CS6401 Operating System Syllabus

CS6401 OPERATING SYSTEMS SYLLABUS

REGULATION 2013

COMMON FOR 4TH SEMESTER CSE AND IT

Subject Credit : 3

OBJECTIVES:

The student should be made to:

Study the basic concepts and functions of operating systems.

Understand the structure and functions of OS.

Learn about Processes, Threads and Scheduling algorithms.

Understand the principles of concurrency and Deadlocks.

Learn various memory management schemes.

Study I/O management and File systems.

Learn the basics of Linux system and perform administrative tasks on Linux Servers.

UNIT I OPERATING SYSTEMS OVERVIEW

Computer System Overview-Basic Elements, Instruction Execution, Interrupts, Memory Hierarchy, Cache Memory, Direct Memory Access, Multiprocessor and Multicore 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

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 III STORAGE MANAGEMENT

Main Memory-Contiguous Memory Allocation, Segmentation, Paging, 32 and 64 bit architecture Examples; Virtual Memory- Demand Paging, Page Replacement, Allocation, Thrashing; Allocating Kernel Memory, OS Examples.

UNIT IV I/O SYSTEMS

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, I/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.

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 file systems.

Perform administrative tasks on Linux Servers.

TEXT BOOK:

1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, 9th Edition, John Wiley and Sons Inc., 2012.

REFERENCES:

1. William Stalling

s, “Operating Systems – Internals and Design Principles”, 7th Edition, Prentice Hall, 2011.

2. Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition, Addison Wesley, 2001.

3. Charles Crowley, “Operating Systems: A Design-Oriented Approach”, Tata McGraw Hill Education”, 1996.

4. D M Dhamdhere, “Operating Systems: A Concept-Based Approach”, Second Edition, Tata McGraw-Hill Education, 2007.

5. http://nptel.ac.in/.

Seaech by google keywords:

Annauniversity 2013 regulation os syllabus,

Anna university os syllabus

Operating system syllabus

Cs6401 Syllabus

Cs6401 operating system syllabus

Cse 4th sem Syllabus

CS6402 Design and Analysis of Algorithm Syllabus

CS6402 DESIGN AND ANALYSIS OF ALGORITHMS  SYLLABUS
REGULATION 2013
COMMON FOR 4TH SEMESTER CSE AND IT

Subject Credit : 3

OBJECTIVES:

The student should be made to:

Learn the algorithm analysis techniques.
Become familiar with the different algorithm design techniques.
Understand the limitations of Algorithm power.

UNIT I INTRODUCTION
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 II BRUTE FORCE AND DIVIDE-AND-CONQUER
Brute 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 III 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’s algorithm- Kruskal's Algorithm - Dijkstra's Algorithm-Huffman Trees.

UNIT IV ITERATIVE IMPROVEMENT
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 Limitations - Backtracking – n-Queens problem – Hamiltonian Circuit Problem – Subset Sum Problem-Branch and Bound – Assignment problem – Knapsack Problem – Traveling Salesman Problem- Approximation Algorithms for NP – Hard Problems – Traveling Salesman problem – Knapsack 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, Ronald 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 and Algorithms”,
Pearson Education, Reprint 2006.
3. Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3 Pearson Education,
2009. Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer, 2008.
4. http://nptel.ac.in/

Anna University CSE syllabus semester wise 2013

As per the Anna university CSE department regulation 2013 is given below or you may download is as a pdf or docx by clicking on the link below

Anna University CSE syllabus Semester wise regulation 2013:
Semester 1
(As per Anna University CSE Syllabus Regulation 2013)
THEORY
1. HS6151       Technical English – I
2. MA6151     Mathematics – I
3. PH6151       Engineering Physics – I
4. CY6151      Engineering Chemistry – I
5. GE6151      Computer Programming
6. GE6152      Engineering Graphics

PRACTICALS

7. GE6161      Computer Practices Laboratory
8. GE6162      Engineering Practices Laboratory
9. GE6163     Physics and Chemistry Laboratory - I

Semester 2
(As per Anna University CSE Syllabus Regulation 2013)

THEORY

1. HS6251        Technical English – II
2. MA6251       Mathematics – II
3. PH6251         Engineering Physics – II
4. CY6251        Engineering Chemistry – II
5. CS6201         Digital Principles and System Design
6. CS6202         Programming and Data Structures I

PRACTICALS

7. GE6262         Physics and Chemistry Laboratory - II
8. CS6211          Digital Laboratory

Second Year Semester 3
(As per Anna University CSE Syllabus Regulation 2013)

THEORY

1. MA6351        Transforms and Partial Differential Equations
2. CS6301          Programming and Data Structure II
3. CS6302          Database Management Systems
4. CS6303          Computer Architecture
5. CS6304          Analog and Digital Communication
6. GE6351         Environmental Science and Engineering

PRACTICAL

7. CS6311        Programming and Data Structure Laboratory II
8. CS6312         Database Management Systems Laboratory
9. CS6212         Programming and Data Structures Laboratory I

Semester 4
(As per Anna University CSE Syllabus Regulation 2013)
THEORY

1. MA6453       Probability and Queueing Theory
2. CS6551         Computer Networks
3. CS6401          Operating Systems
4. CS6402          Design and Analysis of Algorithms
5. EC6504         Microprocessor and Microcontroller
6. CS6403        Software Engineering

PRACTICAL

7. CS6411       Networks Laboratory
8. CS6412       Microprocessor and Microcontroller Laboratory
9. CS6413        Operating Systems Laboratory

Third year Semester 5
(As per Anna University CSE Syllabus Regulation 2013)

THEORY

1. MA6566       Discrete Mathematics
2. CS6501         Internet Programming
3. CS6502        Object Oriented Analysis and Design
4. CS6503        Theory of Computation
5. CS6504         Computer Graphics

PRACTICAL

6. CS6511          Case Tools Laboratory
7. CS6512          Internet Programming Laboratory
8. CS6513         Computer Graphics Laboratory

Semester 6
(As per Anna University CSE Syllabus Regulation 2013)

THEORY

1. CS6601         Distributed Systems 3
2. IT6601          Mobile Computing
3. CS6660         Compiler Design
4. IT6502         Digital Signal Processing
5. CS6659         Artificial Intelligence
6. Elective I

PRACTICAL

7. CS6611       Mobile Application Development Laboratory
8. CS6612       Compiler Laboratory
9. GE6674       Communication and Soft Skills - Laboratory Based

Fourth year Semester 7
(As per Anna University CSE Syllabus Regulation 2013)

THEORY

1. CS6701        Cryptography and Network Security
2. CS6702        Graph Theory and Applications
3. CS6703        Grid and Cloud Computing
4. CS6704        Resource Management Techniques
5. Elective II
6. Elective III

PRACTICAL

7. CS6711     Security Laboratory
8. CS6712     Grid and Cloud Computing Laboratory

Semester 8
(As per Anna University CSE Syllabus Regulation 2013)

THEORY

1. CS6801      Multi – Core Architectures and Programming
2. Elective IV
3. Elective V

PRACTICAL

4. CS6811       Project Work.

CS6401 Operating System CSE Fourth Semester

CS6401 Operating System Syllabus

• CLICK HERE to download CS6401 Operating System Syllabus - R2013

CS6401 Operating System Lecture Notes

• CLICK HERE to download CS6401 Operating System Lecture Notes - R2013

CS6401 Operating System PART A 2 Mark Question Bank

• CLICK HERE to download CS6401 Operating System Part A 2 Mark Question Bank

CS6401 Operating System PART B 16 Mark Question Bank

• CLICK HERE to download CS6401 Operating System Part B 16 Mark Question Bank