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.