MA1251 NUMERICAL METHODS

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER

MA1251 NUMERICAL METHODS 3 1 0 100
AIM
With the present development of the computer technology, it is necessary to develop efficient algorithms for solving problems in science, engineering and technology. This course gives a complete procedure for solving different kinds of problems occur in engineering numerically.

UNIT I SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS 9+3
Linear interpolation methods (method of false position) – Newton’s method – Statement of Fixed Point Theorem – Fixed point iteration: x=g(x) method – Solution of linear system by Gaussian elimination and Gauss-Jordon methods- Iterative methods: Gauss Jacobi and Gauss-Seidel methods- Inverse of a matrix by Gauss Jordon method – Eigenvalue of a matrix by power method.

UNIT II INTERPOLATION AND APPROXIMATION 9+ 3
Lagrangian Polynomials – Divided differences – Interpolating with a cubic spline – Newton’s forward and backward difference formulas.

UNIT III NUMERICAL DIFFERENTIATION AND INTEGRATION 9+ 3

Derivatives from difference tables – Divided differences and finite differences –Numerical integration by trapezoidal and Simpson’s 1/3 and 3/8 rules – Romberg’s method – Two and Three point Gaussian quadrature formulas – Double integrals using trapezoidal and Simpson’s rules.

UNIT IV INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL EQUATIONS 9+ 3
Single step methods: Taylor series method – Euler and modified Euler methods – Fourth order Runge – Kutta method for solving first and second order equations – Multistep methods: Milne’s and Adam’s predictor and corrector methods.

UNIT V BOUNDARY VALUE PROBLEMS IN ORDINARY AND PARTIAL DIFFERENTIAL EQUATIONS 9+ 3
Finite difference solution of second order ordinary differential equation – Finite difference solution of one dimensional heat equation by explicit and implicit methods – One dimensional wave equation and two dimensional Laplace and Poisson equations.

TUTORIAL 15

TOTAL : 60
TEXT BOOKS
1. Gerald, C.F, and Wheatley, P.O, “Applied Numerical Analysis”, Sixth Edition, Pearson Education Asia, New Delhi, 2002.
2. Balagurusamy, E., “Numerical Methods”, Tata McGraw-Hill Pub.Co.Ltd, New Delhi, 1999.

REFERENCES
1. Kandasamy, P., Thilagavathy, K. and Gunavathy, K., “Numerical Methods”, S.Chand Co. Ltd., New Delhi, 2003.
2. Burden, R.L and Faires, T.D., “Numerical Analysis”, Seventh Edition, Thomson Asia Pvt. Ltd., Singapore, 2002.

CS1356 COMPILER DESIGN LAB

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER

CS1356 COMPILER DESIGN LAB 0 0 3 100

CS1355 GRAPHICS AND MULTIMEDIA LAB

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER

CS1355 GRAPHICS AND MULTIMEDIA LAB 0 0 3 100

1. To implement Bresenham’s algorithms for line, circle and ellipse drawing
2. To perform 2D Transformations such as translation, rotation, scaling, reflection and sharing.
3. To implement Cohen-Sutherland 2D clipping and window-viewport mapping
4. To perform 3D Transformations such as translation, rotation and scaling.
5. To visualize projections of 3D images.
6. To convert between color models.
7. To implement text compression algorithm
8. To implement image compression algorithm
9. To perform animation using any Animation software
10. To perform basic operations on image using any image editing software

CS1354 GRAPHICS AND MULTIMEDIA

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER

CS1354 GRAPHICS AND MULTIMEDIA 3 0 0 100

AIM
To impart the fundamental concepts of Computer Graphics and Multimedia.

OBJECTIVES
• To study the graphics techniques and algorithms.
• To study the multimedia concepts and various I/O technologies.
• To enable the students to develop their creativity

CS1353 SOFTWARE ENGINEERING

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER

CS1353 SOFTWARE ENGINEERING 3 0 0 100

AIM
To introduce the methodologies involved in the development and maintenance of software (i.e) over its entire life cycle.

OBJECTIVE
To be aware of
• Different life cycle models
• Requirement dictation process
• Analysis modeling and specification
• Architectural and detailed design methods
• Implementation and testing strategies
• Verification and validation techniques
• Project planning and management
• Use of CASE tools

CS1352 PRINCIPLES OF COMPILER DESIGN

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER

CS1352 PRINCIPLES OF COMPILER DESIGN 3 1 0 100

AIM
At the end of the course the student will be able to design and implement a simple compiler.

OBJECTIVES
• To understand, design and implement a lexical analyzer.
• To understand, design and implement a parser.
• To understand, design code generation schemes.
• To understand optimization of codes and runtime environment.

CS1351 ARTIFICIAL INTELLIGENCE

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER

CS1351 ARTIFICIAL INTELLIGENCE 3 0 0 100

IT1252 DIGITAL SIGNAL PROCESSING

ANNA UNIVERSITY CHENNAI:: CHENNAI 600 025
CURRICULUM 2004
B.TECH. INFORMATION TECHNOLOGY
SEMESTER IV

IT1252 DIGITAL SIGNAL PROCESSING

AIM

To review signals and systems, study DFT and FFT, discuss the design of IIR & FIR filters and study typical applications of digital signal processing.

OBJECTIVES

• To have an overview of signals and systems.
• To study DFT & FFT
• To study the design of IIR filters.
• To study the design of FIR filters.
• To study the effect of finite word lengths & applications of DSP

CS1404 INTERNET PROGRAMMING LABORATORY

CS1404 INTERNET PROGRAMMING LABORATORY 0 3 100

LIST OF EXPERIMENTS

1. Write programs in Java to demonstrate the use of following components Text fields, buttons, Scrollbar, Choice, List and Check box
2. Write Java programs to demonstrate the use of various Layouts like Flow Layout, Border Layout, Grid layout, Grid bag layout and card layout
3. Write programs in Java to create applets incorporating the following features:
• Create a color palette with matrix of buttons
• Set background and foreground of the control text area by selecting a color from color palette.
• In order to select Foreground or background use check box control as radio buttons
• To set background images
4. Write programs in Java to do the following.

CS1403 CASE TOOLS LAB

CS1403 CASE TOOLS LAB 0 3 100

1. Prepare the following documents for two or three of the experiments listed below and develop the software engineering methodology.
2. Program Analysis and Project Planning.
Thorough study of the problem – Identify project scope, Objectives, Infrastructure.
3. Software requirement Analysis
Describe the individual Phases / Modules of the project, Identify deliverables.
4. Data Modeling
Use work products – Data dictionary, Use diagrams and activity diagrams, build and test lass diagrams, Sequence diagrams and add interface to class diagrams.
5. Software Development and Debugging
6. Software Testing
Prepare test plan, perform validation testing, Coverage analysis, memory leaks, develop test case hierarchy, Site check and Site monitor.

SUGGESTED LIST OF APPLICATIONS
1. Student Marks Analyzing System
2. Quiz System
3. Online Ticket Reservation System
4. Payroll System
5. Course Registration System
6. Expert Systems
7. ATM Systems
8. Stock Maintenance
9. Real-Time Scheduler
10. Remote Procedure Call Implementation

CS1402 OBJECT ORIENTED ANALYSIS AND DESIGN

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER

CS1402 OBJECT ORIENTED ANALYSIS AND DESIGN 3 1 0 100

AIM
To understand the concepts of object oriented analysis and design.
OBJECTIVES
• To understand the object oriented life cycle.
• To know how to identify objects, relationships, services and attributes through UML.
• To understand the use-case diagrams.
• To know the Object Oriented Design process.
• To know about software quality and usability.

CS1401 INTERNET PROGRAMMING

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER

CS1401 INTERNET PROGRAMMING 3 0 0 100

AIM
To explain Internet Programming concepts and related programming and scripting languages.

OBJECTIVES
• To describe basic Internet Protocols.
• Explain JAVA and HTML tools for Internet programming.
• Describe scripting languages – Java Script.
• Explain dynamic HTML programming.
• Explain Server Side Programming tools.

IT1402 MOBILE COMPUTING

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER

IT1402 MOBILE COMPUTING 3 0 0 100

AIM
To provide basics for various techniques in Mobile Communications and Mobile Content services.

OBJECTIVES
• To learn the basics of Wireless voice and data communications technologies.
• To build working knowledge on various telephone and satellite networks.
• To study the working principles of wireless LAN and its standards.
• To build knowledge on various Mobile Computing algorithms.
• To build skills in working with Wireless application Protocols to develop mobile content applications.

MG1351 PRINCIPLES OF MANAGEMENT

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER V

MG1351 PRINCIPLES OF MANAGEMENT 3 0 0 100
(Common to all Branches)

OBJECTIVE
Knowledge on the principles of management is essential for all kinds of people in all kinds of organizations. After studying this course, students will be able to have a clear understanding of the managerial functions like planning, organizing, staffing, leading and controlling. Students will also gain some basic knowledge on international aspect of management.

MA1256 DISCRETE MATHEMATICS

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER V

MA1256 DISCRETE MATHEMATICS 3 1 0 100

AIM
To extend student’s 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.

OBJECTIVES
At the end of the course, students would
• Have knowledge of the concepts needed to test the logic of a program.
• Have gained knowledge which has application in expert system, in data base and a basic for the prolog language.
• Have an understanding in identifying patterns on many levels.
• Be aware of a class of functions which transform a finite set into another finite set which relates to input output functions in computer science.
• Be exposed to concepts and properties of algebraic structures such as semigroups, monoids and groups.

UNIT I PROPOSITIONAL CALCULUS 10 + 3

CS1307 DATABASE MANAGEMENT SYSTEMS LAB

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER V

CS1307 DATABASE MANAGEMENT SYSTEMS LAB 0 0 3 100

LIST OF EXPERIMENTS
1. Data Definition Language (DDL) commands in RDBMS.
2. Data Manipulation Language (DML) and Data Control Language (DCL) commands in RDBMS.
3. High-level language extension with Cursors.
4. High level language extension with Triggers
5. Procedures and Functions.
6. Embedded SQL.
7. Database design using E-R model and Normalization.
8. Design and implementation of Payroll Processing System.
9. Design and implementation of Banking System.
10. Design and implementation of Library Information System.

CS1306 MICROPROCESSORS AND MICROCONTROLLERS LAB

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER V

CS1306 MICROPROCESSORS AND MICROCONTROLLERS LAB 0 0 3 100

LIST OF EXPERIMENTS

1. Programming with 8085 – 8-bit / 16-bit multiplication/division using repeated addition/subtraction
2. Programming with 8085-code conversion, decimal arithmetic, bit manipulations.
3. Programming with 8085-matrix multiplication, floating point operations
4. Programming with 8086 – String manipulation, search, find and replace, copy operations, sorting. (PC Required)
5. Using BIOS/DOS calls: Keyboard control, display, file manipulation. (PC Required)
6. Using BIOS/DOS calls: Disk operations. (PC Required)
7. Interfacing with 8085/8086 – 8255, 8253
8. Interfacing with 8085/8086 – 8279,8251
9. 8051 Microcontroller based experiments – Simple assembly language programs (cross assembler required).
10. 8051 Microcontroller based experiments – Simple control applications (cross assembler required).

CS1305 NETWORK LAB

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER V

CS1305 NETWORK LAB 0 0 3 100
(All the programs are to be written using C)

1. Simulation of ARP / RARP.
2. Write a program that takes a binary file as input and performs bit stuffing and CRC Computation.
3. Develop an application for transferring files over RS232.
4. Simulation of Sliding-Window protocol.
5. Simulation of BGP / OSPF routing protocol.
6. Develop a Client – Server application for chat.
7. Develop a Client that contacts a given DNS Server to resolve a given host name.
8. Write a Client to download a file from a HTTP Server.
9 &10 Study of Network Simulators like NS2/Glomosim / OPNET .

CS1304 MICROPROCESSORS AND MICROCONTROLLERS

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER V

CS1304 MICROPROCESSORS AND MICROCONTROLLERS 3 1 0 100

AIM
To have an in depth knowledge of the architecture and programming of 8-bit and 16-bit Microprocessors, Microcontrollers and to study how to interface various peripheral devices with them.

OBJECTIVE
• To study the architecture and Instruction set of 8085 and 8086
• To develop assembly language programs in 8085 and 8086.
• To design and understand multiprocessor configurations
• To study different peripheral devices and their interfacing to 8085/8086.
• To study the architecture and programming of 8051 microcontroller.

UNIT I THE 8085 MICROPROCESSOR 9
Introduction to 8085 – Microprocessor architecture – Instruction set – Programming the 8085 – Code conversion.

UNIT II 8086 SOFTWARE ASPECTS 9
Intel 8086 microprocessor – Architecture – Instruction set and assembler directives – Addressing modes – Assembly language programming – Procedures – Macros – Interrupts and interrupt service routines.

UNIT III 8086 SYSTEM DESIGN 9
8086 signals and timing – MIN/MAX mode of operation – Addressing memory and I/O – Multiprocessor configurations – System design using 8086

UNIT IV I/O INTERFACING 9
Memory Interfacing and I/O interfacing - Parallel communication interface – Serial communication interface – Timer – Keyboard /display controller – Interrupt controller – DMA controller – Programming and applications.

UNIT V MICROCONTROLLERS 9
Architecture of 8051 – Signals – Operational features – Memory and I/O addressing – Interrupts – Instruction set – Applications.

TUTORIAL 15

TOTAL : 60
TEXT BOOKS
1. Ramesh S.Gaonkar, “Microprocessor - Architecture, Programming and Applications with the 8085”, Penram International publishing private limited, fifth edition.
(UNIT-1: – Chapters 3,5,6 and programming examples from chapters 7-10)
2. A.K. Ray & K.M.Bhurchandi, “Advanced Microprocessors and peripherals- Architectures, Programming and Interfacing”, TMH, 2002 reprint.
(UNITS 2 to 5: – Chapters 1-6, 7.1-7.3, 8, 16)

REFERENCES
1. Douglas V.Hall, “Microprocessors and Interfacing: Programming and Hardware”, TMH, Third edition
2. Yu-cheng Liu, Glenn A.Gibson, “Microcomputer systems: The 8086 / 8088 Family architecture, Programming and Design”, PHI 2003
3. Mohamed Ali Mazidi, Janice Gillispie Mazidi, “The 8051 microcontroller and embedded systems”, Pearson education, 2004.

CS1303 THEORY OF COMPUTATION

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER V

CS1303 THEORY OF COMPUTATION 3 1 0 100

AIM
To have a introductory knowledge of automata, formal language theory and computability.

OBJECTIVES
• To have an understanding of finite state and pushdown automata.
• To have a knowledge of regular languages and context free languages.
• To know the relation between regular language, context free language and corresponding recognizers.
• To study the Turing machine and classes of problems.

UNIT I AUTOMATA 9
Introduction to formal proof – Additional forms of proof – Inductive proofs –Finite Automata (FA) – Deterministic Finite Automata (DFA)– Non-deterministic Finite Automata (NFA) – Finite Automata with Epsilon transitions.

UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9
Regular Expression – FA and Regular Expressions – Proving languages not to be regular – Closure properties of regular languages – Equivalence and minimization of Automata.

UNIT III CONTEXT-FREE GRAMMAR AND LANGUAGES 9

Context-Free Grammar (CFG) – Parse Trees – Ambiguity in grammars and languages – Definition of the Pushdown automata – Languages of a Pushdown Automata – Equivalence of Pushdown automata and CFG, Deterministic Pushdown Automata.

UNIT IV PROPERTIES OF CONTEXT-FREE LANGUAGES 9
Normal forms for CFG – Pumping Lemma for CFL - Closure Properties of CFL – Turing Machines – Programming Techniques for TM.

UNIT V UNDECIDABILITY 9
A language that is not Recursively Enumerable (RE) – An undecidable problem that is RE – Undecidable problems about Turing Machine – Post’s Correspondence Problem - The classes P and NP.

TUTORIAL 15

TOTAL : 60
TEXT BOOK
1. J.E.Hopcroft, R.Motwani and J.D Ullman, “Introduction to Automata Theory, Languages and Computations”, Second Edition, Pearson Education, 2003.

REFERENCES
1. H.R.Lewis and C.H.Papadimitriou, “Elements of The theory of Computation”, Second Edition, Pearson Education/PHI, 2003
2. J.Martin, “Introduction to Languages and the Theory of Computation”, Third Edition, TMH, 2003.
3. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Brokecole, 1997.

CS1302 COMPUTER NETWORKS

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER V

CS1302 COMPUTER NETWORKS 3 0 0 100

AIM
To introduce the concepts, terminologies and technologies used in modern days data communication and computer networking.

OBJECTIVES
• To understand the concepts of data communications.
• To study the functions of different layers.
• To introduce IEEE standards employed in computer networking.
• To make the students to get familiarized with different protocols and network components.

UNIT I DATA COMMUNICATIONS 8
Components – Direction of Data flow – networks – Components and Categories – types of Connections – Topologies –Protocols and Standards – ISO / OSI model – Transmission Media – Coaxial Cable – Fiber Optics – Line Coding – Modems – RS232 Interfacing sequences.

UNIT II DATA LINK LAYER 10
Error – detection and correction – Parity – LRC – CRC – Hamming code – low Control and Error control - stop and wait – go back-N ARQ – selective repeat ARQ- sliding window – HDLC. - LAN - Ethernet IEEE 802.3 - IEEE 802.4 - IEEE 802.5 - IEEE 802.11 – FDDI - SONET – Bridges.
UNIT III NETWORK LAYER 10
Internetworks – Packet Switching and Datagram approach – IP addressing methods – Subnetting – Routing – Distance Vector Routing – Link State Routing – Routers.

UNIT IV TRANSPORT LAYER 9
Duties of transport layer – Multiplexing – Demultiplexing – Sockets – User Datagram Protocol (UDP) – Transmission Control Protocol (TCP) – Congestion Control – Quality of services (QOS) – Integrated Services.

UNIT V APPLICATION LAYER 8
Domain Name Space (DNS) – SMTP – FTP – HTTP - WWW – Security – Cryptography.

TOTAL : 45
TEXT BOOKS
1. Behrouz A. Forouzan, “Data communication and Networking”, Tata McGraw-Hill, 2004.

REFERENCES
1. James F. Kurose and Keith W. Ross, “Computer Networking: A Top-Down Approach Featuring the Internet”, Pearson Education, 2003.
2. Larry L.Peterson and Peter S. Davie, “Computer Networks”, Harcourt Asia Pvt. Ltd., Second Edition.
3. Andrew S. Tanenbaum, “Computer Networks”, PHI, Fourth Edition, 2003.
4. William Stallings, “Data and Computer Communication”, Sixth Edition, Pearson Education, 2000.

CS1301 DATABASE MANAGEMENT SYSTEMS

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER V

CS1301 DATABASE MANAGEMENT SYSTEMS 3 1 0 100
AIM
To provide a strong foundation in database technology and an introduction to the current trends in this field.

OBJECTIVES
• To learn the fundamentals of data models and to conceptualize and depict a database system using ER diagram.
• To make a study of SQL and relational database design.
• To understand the internal storage structures using different file and indexing techniques which will help in physical DB design.
• To know the fundamental concepts of transaction processing- concurrency control techniques and recovery procedure.
• To have an introductory knowledge about the emerging trends in the area of distributed DB- OO DB- Data mining and Data Warehousing and XML.

UNIT I INTRODUCTION AND CONCEPTUAL MODELING 9
Introduction to File and Database systems- Database system structure – Data Models – Introduction to Network and Hierarchical Models – ER model – Relational Model – Relational Algebra and Calculus.

UNIT II RELATIONAL MODEL 9
SQL – Data definition- Queries in SQL- Updates- Views – Integrity and Security – Relational Database design – Functional dependences and Normalization for Relational Databases (up to BCNF).

UNIT III DATA STORAGE AND QUERY PROCESSING 9
Record storage and Primary file organization- Secondary storage Devices- Operations on Files- Heap File- Sorted Files- Hashing Techniques – Index Structure for files –Different types of Indexes- B-Tree - B+Tree – Query Processing.

UNIT IV TRANSACTION MANAGEMENT 9
Transaction Processing – Introduction- Need for Concurrency control- Desirable properties of Transaction- Schedule and Recoverability- Serializability and Schedules – Concurrency Control – Types of Locks- Two Phases locking- Deadlock- Time stamp based concurrency control – Recovery Techniques – Concepts- Immediate Update- Deferred Update - Shadow Paging.

UNIT V CURRENT TRENDS 9
Object Oriented Databases – Need for Complex Data types- OO data Model- Nested relations- Complex Types- Inheritance Reference Types - Distributed databases- Homogenous and Heterogenous- Distributed data Storage – XML – Structure of XML- Data- XML Document- Schema- Querying and Transformation. – Data Mining and Data Warehousing.

TUTORIAL 15

TOTAL : 60
TEXT BOOKS
1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan- “Database System Concepts”, Fourth Edition, McGraw-Hill, 2002.

REFERENCES
1. Ramez Elmasri and Shamkant B. Navathe, “Fundamental Database Systems”, Third Edition, Pearson Education, 2003.
2. Raghu Ramakrishnan, “Database Management System”, Tata McGraw-Hill Publishing Company, 2003.
3. Hector Garcia–Molina, Jeffrey D.Ullman and Jennifer Widom- “Database System Implementation”- Pearson Education- 2000.
4. Peter Rob and Corlos Coronel- “Database System, Design, Implementation and Management”, Thompson Learning Course Technology- Fifth edition, 2003.