UNIVERSITY DEPARTMENTS
ANNA UNIVERSITY :: CHENNAI 600 025
REGULATIONS – 2008
CURRICULUM FROM III TO VIII SEMESTERS FOR
B.E. COMPUTER SCIENCE AND ENGINEERING
SEMESTER III
CODE NO COURSE TITLE L T P C
THEORY
MA9211 Mathematics III 3 1 0 4
EC9213 Electronic Devices and Circuits 3 0 0 3
CS9201 Design and Analysis of Algorithms 3 0 0 3
CS9202 Database Management Systems 3 0 0 3
CS9203 Programming and Data Structures II 3 0 0 3
CS9204 Computer Architecture 3 1 0 4
PRACTICAL
CS9205 Database Management Systems Laboratory 0 0 3 2
CS9206 Programming and Data Structures Laboratory II 0 0 3 2
CS9207 Algorithms Laboratory 0 0 3 2
MA 9211 MATHEMATICS III L T P C
(Common to all branches of BE / B.Tech Programmes) 3 1 0 4
AIM:
To facilitate the understanding of the principles and to cultivate the art of formulating
physical problems in the language of mathematics.
OBJECTIVES:
To introduce Fourier series analysis which is central to many applications in
engineering apart from its use in solving boundary value problems
To acquaint the student with Fourier transform techniques used in wide variety of
situations in which the functions used are not periodic
To introduce the effective mathematical tools for the solutions of partial differential
equations that model physical processes
To develop Z- transform techniques which will perform the same task for discrete time
systems as Laplace Transform, a valuable aid in analysis of continuous time systems
UNIT I FOURIER SERIES 9+3
Dirichlet’s conditions – General Fourier series – Odd and even functions – Half-range
Sine and Cosine series – Complex form of Fourier series – Parseval’s identity –
Harmonic Analysis.
UNIT II FOURIER TRANSFORM 9+3
Fourier integral theorem – Fourier transform pair-Sine and Cosine transforms –
Properties – Transform of elementary functions – Convolution theorem – Parseval’s
identity.
UNIT III PARTIAL DIFFERENTIAL EQUATIONS 9+3
Formation – Solutions of first order equations – Standard types and Equations reducible
to standard types – Singular solutions – Lagrange’s Linear equation – Integral surface
passing through a given curve – Solution of linear equations of higher order with
constant coefficients.
UNIT IV APPLICATIONS OF PARTIAL DIFFERENTIAL EQUATIONS 9+3
Method of separation of Variables – Solutions of one dimensional wave equation and
one-dimensional heat equation – Steady state solution of two-dimensional heat equation
– Fourier series solutions in Cartesian coordinates.
UNIT V Z – TRANSFORM AND DIFFERENCE EQUATIONS 9+3
Z-transform – Elementary properties – Inverse Z-transform – Convolution theorem –
Initial and Final value theorems – Formation of difference equation – Solution of
difference equation using Z-transform.
L: 45, T: 15, TOTAL = 60 PERIODS
TEXT BOOK:
1. Grewal, B.S. “Higher Engineering Mathematics”, Khanna Publications (2007)
REFERENCES:
1. Glyn James, “Advanced Modern Engineering Mathematics”, Pearson Education
(2007)
2. Ramana B.V., “Higher Engineering Mathematics” Tata McGraw Hill (2007).
3. Bali N.P. and Manish Goyal, “A Text Book of Engineering” 7
th
Edition (2007) Lakshmi
Publications (P) Limited, New Delhi.
EC 9213 ELECTRONIC DEVICES AND CIRCUITS L T P C
3 0 0 3
AIM:
The aim of this is to introduce the concept of Circuit theory, Electronic Devices and their
applications.
UNIT II CIRCUIT ANALYSIS TECHNIQUES 9
Linearity and Superposition, Sources Transformation, Thevinin and Norton
Equivalent Circuits, Maximum Power Transfer, Delta-Wye Conversion, Single Phase
and 3 Phase Circuits-Power Factor-Power-Concept of Phasor Diagrams.
UNIT III SEMICONDUCTOR DEVICES 9
PN-Junction Diode- Drift and Diffusion Current-Zener Diode-Zener Regulator-BJT- V-I
Characteristics-CE Configuration-Current Equation h-Parameter Model.JFET- V-I
Characteristics- Current Equation- Transconductance MOSFET-Types DMOS, EMOS –
V-I Characteristics-Moll Current Equation Equalitine Treatment only.
UNIT IV RECTIFIER, AMPLIFIER AND OSCILLATOR 9
FWR-Filter-Capacitors Input Filter-Choke Input Filter – CE Amplification with and
without feedback – Analysis and Frequency Response – CS MOSFET Amplifier -
Analysis
UNIT V OPERATION AMPLIFIER 9
Introduction of an Inverting Amplifier, Non Inverting Amplifier, Basic Application of
Operation Amplifier: Subractor, Summing Amplifier, Digital to Analogue Convertor, Low
Pass Filter, First Order Low Pass Filter, First Order High Pass Filter, Integrator,
Differentiator.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. David A.Bell “Electronic Devices and Circuit”,Oxford press-2008.
2. Robert T.Paynter “Introductory Electronic Devices and Circuits”, Pearson
Education-Sixth Edition
REFERENCES:
1. Denal A.Neamar, “Electronic Circuit Analysis and Design”, Second Edition, Tata
MCGraw Hill, 2002.
2. Adel S.Sedia Keanath “C with Micro Electronic Circuit”-Fourth Edition-Oxford
University Press-1998.
CS 9201 DESIGN AND ANALYSIS OF ALGORITHMS L T P C
3 0 0 3
AIM:
The aim is to introduce the basics of algorithm design paradigms and analysis to enable
designing of efficient algorithms.
OBJECTIVES:
- To introduce the basic concepts of algorithm analysis
- To introduce the design paradigms for algorithm design
- To introduce the basic complexity theory.
UNIT I PRELIMINARIES 9
The Role of Algorithms in Computing-Getting Started-Growth of Functions –
Recurrences-The Substitution Method- The Recurrence Tree Method-The Master
Method -Probabilistic Analysis and Randomized Algorithms-The Hiring Problem-
Random Variables-Randomized Algorithms
UNIT II DESIGN TECHNIQUE I 9
Quicksort-Description-Performance-Randomized version-Analysis.Sorting in linear timeLower bounds for sorting-Counting sort-Medians and order statistics-Minimum and
maximum-Selection in expected linear time- Selection in worst-case linear time-Dynamic
Programming – Matrix chain multiplication –Elements of Dynamic programming- Longest
common sequences.
UNIT III DESIGN TECHNIQUE II 9
Greedy Algorithms-Activity selection problem-Elements of Greedy StrategyHuffman code.Matrix Operations-Properties of matrices-Strassen's algorithmSolving systems of linear equations-Inverting matrices.
UNIT IV APPLICATIONS 9
Linear Programming-Standard and slack forms-Formulating problems-Simplex
algorithm-Duality-Initial basic feasible solution - String Matching-Naive string matching
algorithm-Knuth-Morris-Pratt algorithm.
UNIT V NP PROBLEMS 9
NP-completeness-Polynomial time-Polynomial-time verification-NP-completeness and
reducibility-NP-completeness proofs - NP-completeness problems. Approximation
Algorithms-The vertex-cover problem-The traveling-salesman problem.
TOTAL: 45 PERIODS
TEXT BOOK:
1. Thomas H.Cormen, Charles E.Leiserson, Ronald L.Rivest, Cliford Stein,
“Introduction to Algorithms”, Second Edition, Prentice Hall of India, 2007.
REFERENCES:
1. Jon Kleinberg, Eva Tardos, “Algorithm Design”, Pearson Education, 2006.
2. Michael T. Goodrich, Toberto Tamassisa, “ Algorithm Design: Foundations, Analysis
and Internet Examples”, Wiley Student Edition, 2007.
3. Anany Levitin, “Introduction to Design and Analysis of Algorithms”, Pearson
Education, 2003.
CS 9202 DATABASE MANAGEMENT SYSTEMS L T P C
3 0 0 3
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 Storage and Query processing techniques
UNIT I INTRODUCTION 9
Purpose of Database System -– Views of data – Data Models – Database Languages ––
Database System Architecture – Database users and Administrator – Entity–
Relationship model – E-R Diagrams -- Introduction to relational databases
UNIT II RELATIONAL MODEL 9
The relational Model – The catalog- Types– Keys - Relational Algebra – Domain
Relational Calculus – Tuple Relational Calculus - Fundamental operations – Additional
Operations- SQL fundamentals - Integrity – Triggers - Security – Advanced SQL
features –Embedded SQL– Dynamic SQL- Missing Information– Views – Introduction
to Distributed Databases and Client/Server Databases
UNIT III DATABASE DESIGN 9
Functional Dependencies – Non-loss Decomposition – Functional Dependencies – First,
Second, Third Normal Forms, Dependency Preservation – Boyce/Codd Normal Form-
Multi-valued Dependencies and Fourth Normal Form – Join Dependencies and Fifth
Normal Form
UNIT IV TRANSACTIONS 9
Transaction Concepts - Transaction Recovery – ACID Properties – System Recovery –
Media Recovery – Two Phase Commit - Save Points – SQL Facilities for recovery –
Concurrency – Need for Concurrency – Locking Protocols – Two Phase Locking –
Intent Locking – Deadlock- Serializability – Recovery Isolation Levels – SQL Facilities
for Concurrency.
UNIT V IMPLEMENTATION TECHNIQUES 9
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 –
Query Processing Overview – Catalog Information for Cost Estimation – Selection
Operation – Sorting – Join Operation – Database Tuning.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, “Database SystemConcepts”,
Fifth Edition, Tata McGraw Hill, 2006.
2. C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database
Systems”, Eighth Edition, Pearson Education, 2006.
REFERENCES:
1. Ramez Elmasri, Shamkant B. Navathe, “Fundamentals of Database Systems”,
FourthEdition , Pearson / Addision wesley, 2007.
2. Raghu Ramakrishnan, “Database Management Systems”, Third Edition, McGraw
Hill, 2003.
3. S.K.Singh, “Database Systems Concepts, Design and Applications”, First Edition,
Pearson Education, 2006.
CS 9203 PROGRAMMING AND DATA STRUCTURES II L T P C
3 0 0 3
AIM:
The aim is to introduce the concept of Object Oriented Programming and analyse the
implementation of Advanced Data Structures using Object Oriented Programming
Language.
OBJECTIVES:
- To introduce the concepts of Object Oriented Programming language.
- To introduce the concepts of Templates and Error Handling.
- To introduce the concepts of Advanced Data Structures.
UNIT I OOP CONCEPTS 9
Introduction – Learning C++ - Design of C++ - History and Use – Programming
Paradigms – Standard Library – Types and Declaration – Pointers, Arrays, Structures –
Expressions and Statements – Functions – Namespaces and Exceptions – Source Files
and Programs – Classes – User-Defined Types – Objects – Operator Overloading –
Operator Functions – Complex Number
UNIT II INHERITANCE 9
Type Conversion Operators – Friends – Large Objects – Essential Operators –
Subscripting – Function Call – Dereferencing – Increment and Decrement – String Class
– Derived Classes – Abstract Classes – Design of Class Hierarchies
UNIT III TEMPLATES AND EXCEPTIONS 9
Templates – Function Templates – Error Handling – Grouping of Exceptions – Catching
Exceptions – Resource Management – Multiple Inheritance – Access Control – Run
Time Type Information
UNIT IV DATA STRUCTURES 9
OO Perspective of List, Stack, Queue, and Search Tree ADTs – AVL Trees – Red Black
Trees – Splay Trees – B-trees – Priority Queues (Heaps)
UNIT V SET AND GRAPHS 9
Disjoint Set ADT – Graph Algorithms – Topological Sort – Shortest-Path Algorithm –
Network Flow Problems – Minimum Spanning Tree – Applications of Depth-First Search
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Bjarne Stroustrup, “The C++ Programming Language”, 3rd ed., Pearson Education,
2007.
2. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, 2nded., Pearson Education, 2005.
REFERENCES:
1. Ira Pohl, “Object-Oriented Programming using C++”, 2nded., Pearson Education, 1997.
2. Goodrich, Michael T., Roberto Tamassia, David Mount. “Data Structures and Algorithms in C++”. 7th
edition, Wiley, 2004.
CS 9204 COMPUTER ARCHITECTURE L T P C
3 1 0 4
AIM:
To understand the organization of a computer, and the hardware-software interface.
OBJECTIVES:
To know about the various components of a computer and their internals.
To comprehend the importance of the hardware-software interface, and instructionset architecture.
To understand the architectural features of superscalar processors.
UNIT I BASIC STRUCTURE OF COMPUTERS 9+3
Functional units – Basic operational concepts – Bus structures – Performance and
metrics – Instructions and instruction sequencing – Hardware – Software Interface –
Instruction set architecture – Addressing modes – RISC – CISC - ALU design – Fixed
point and floating point operations.
UNIT II BASIC PROCESSING UNIT 6+3
Fundamental concepts – Execution of a complete instruction – Multiple bus organization
– Hardwired control – Micro programmed control – Nano programming.
UNIT III PIPELINING AND ILP 12+3
Basic concepts – Data hazards – Instruction hazards – Influence on instruction sets –
Data path and control considerations – Performance considerations – Exception
handling – Advanced concepts in pipelining –Exploitation of more ILP – Hardware and
software approaches – Dynamic scheduling – Speculation – Compiler approaches –
Multiple issue processors.
UNIT IV MEMORY SYSTEM 9+3
Basic concepts – Semiconductor RAM – ROM – Speed – Size and cost – Cache
memories – Improving cache performance – Virtual memory – Memory management
requirements – Associative memories – Secondary storage devices.
UNIT V I/O ORGANIZATION 9+3
Accessing I/O devices – Programmed Input/Output -Interrupts – Direct Memory Access
– Buses – Interface circuits – Standard I/O Interfaces (PCI, SCSI, USB), I/O devices and
processors.
L: 45, T: 15, TOTAL = 60 PERIODS
TEXT BOOKS:
1. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, “Computer Organization”, Fifth
Edition, Tata McGraw Hill, 2002.
2. David A. Patterson and John L. Hennessy, “Computer Organization and Design: The
Hardware/Software interface”, Third Edition, Elsevier, 2005.
REFERENCES:
1. William Stallings, “Computer Organization and Architecture – Designing for
Performance”, Sixth Edition, Pearson Education, 2003.
2. John P. Hayes, “Computer Architecture and Organization”, Third Edition, Tata
McGraw Hill, 1998.
3. V.P. Heuring, H.F. Jordan, “Computer Systems Design and Architecture”, Second
Edition, Pearson Education, 2004.
4. Behrooz Parhami, “Computer Architecture”, Oxford University Press, 2007.
CS 9205 DATABASE MANAGEMENT SYSTEMS LABORATORY LT P C
0 0 3 2
AIM:
The aim of this laboratory is to inculcate the abilities of applying the principles of
database management systems. The course aims to prepare the students for projects
where a proper implementation of databases will be required.
OBJECTIVES:
The students will be able to create a database file
The students will be able to query a database file
The students will be able to append and update a database file
EXPERIMENTS IN THE FOLLOWING TOPICS:
1. Data Definition, Manipulation of base tables and views
2. High level programming language extensions.
3. Front end tools
4. Forms
5. Triggers
6. Menu Design
7. Importing/ Exporting Data.
8. Reports.
9. Database Design and implementation (Mini Project).
TOTAL: 45 PERIODS 11
CS 9206 PROGRAMMING AND DATA STRUCTURES LABORATORY II L T P C
0 0 3 2
AIM:
To implement different data structures and their algorithms for storing, accessing and
manipulating data using an object oriented programming language.
OBJECTIVES:
To implement the concepts of object oriented programming.
To implement different data structures using object oriented programming language.
To use standard template library in the implementation of standard data structures.
EXPERIMENTS IN THE FOLLOWING:
1. Implementation of any one of the following List, Stack, Queue ADTs, binary search
trees.
2. Implement data abstraction by separate compilation of implementation (.h & .cpp)
and application (main.cpp).
3. Use of standard Template Library: Strings, containers.
4. Use of STL: Iterators.
5. Operator Overloading.
6. Templates.
7. Exception handling, Class Hierarchies.
8. AVL Tree.
9. Splay Tree.
10. B Tree.
11. Graph algorithms.
TOTAL: 45 PERIODS
CS 9207 ALGORITHMS LABORATORY L T P C
0 0 3 2
AIM:
To understand the running time of algorithms.
OBJECTIVES:
To understand the need for analyzing algorithms.
To understand that algorithms execution speed cannot be expressed as a fixed time
quantity.
To know the ways of estimating time speed for different algorithms
To study about applications of the different algorithms.
To know about the various tools available for analyzing algorithms.
IMPLEMENT THE FOLLOWING
1. Simple recursive programs like Towers of Hanoi ,Generating Permutations.
2. Sort algorithms.
3. Randomized quick sort algorithm.
4. Merge sort using Divide and Conquer approach.
5. Generation of Huffman code using Greedy Approach.
6. Floyd's Algorithm -Dynamic Programming.
7. Simplex Method.
8. String matching algorithms.
9. Study of Benchmarking algorithms.
10. Study of Algorithms Tools.
For more information contact us via Studentstrainer@gmail.com. Caring is sharing, show your caring to us by sharing our post in social sites and keep like us,,,
{ 0 comments... read them below or add one }
Post a Comment
Enter your comments here