Showing posts with label 6th Semester. Show all posts
Showing posts with label 6th Semester. Show all posts

Thursday, December 30, 2010

CS 1004 – DATA WARE HOUSING AND MINING Question paper

0 comments

2010 Anna University Chennai B.E Computer Science BE/B.Tech DEGREE EXAMINATION APRIL/MAY 2010 SIXTH SEMESTER COMPUTER SCIENCE AND ENGINEERING CS 1004 – DATA WARE HOUSING AND MINING Question paper

BE/B.Tech DEGREE EXAMINATION APRIL/MAY 2010
SIXTH SEMESTER
COMPUTER SCIENCE AND ENGINEERING
CS 1004 – DATA WARE HOUSING AND MINING
(REGULATION 2004)

Thursday, September 16, 2010

MA1251 NUMERICAL METHODS

0 comments

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

0 comments

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

0 comments

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

0 comments

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

0 comments

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

0 comments

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

0 comments

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

Tuesday, August 31, 2010

GE 1002 INDIAN CONSTITUTION AND SOCIETY

0 comments

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
B.E. COMPUTER SCIENCE AND ENGINEERING
LIST OF ELECTIVES FOR COMPUTER SCIENCE AND ENGINEERING
GE 1002 INDIAN CONSTITUTION AND SOCIETY 3 0 0 100
UNIT I

IT1353 EMBEDDED SYSTEMS

0 comments

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 VI -ELECTIVES
IT1353 EMBEDDED SYSTEMS 3 0 0 100
AIM
To give sufficient background for undertaking embedded systems design.
OBJECTIVES

GE 1001 INTELLECTUAL PROPERTY RIGHTS (IPR) 3 0 0 100

0 comments

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
B.E. COMPUTER SCIENCE AND ENGINEERING
LIST OF ELECTIVES FOR COMPUTER SCIENCE AND ENGINEERING

GE 1001 INTELLECTUAL PROPERTY RIGHTS (IPR) 3 0 0 100

CS1006 ADVANCED DATABASES

0 comments

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
B.E. COMPUTER SCIENCE AND ENGINEERING
LIST OF ELECTIVES CS1006 ADVANCED DATABASES
AIM
Advanced database aims at developing computer application with different kinds of data models. It is also deals with the Transaction management of these different databases.
OBJECTIVES
• To study the needs of different databases.
• To understand about different data models that can be used for these databases.
• To make the students to get familiarized with transaction management of the database
• To develop in-depth knowledge about web and intelligent database.
• To provide an introductory concept about the way in which data can be stored in geographical information systems etc.,
UNIT I DISTRIBUTED DATABASES 9
Distributed DBMS Concepts and Design – Introduction – Functions and Architecture of DDBMS – Distributed Relational Database Design – Transparency in DDBMS – Distributed Transaction Management – Concurrency control – Deadlock Management – Database recovery – The X/Open Distributed Transaction Processing Model – Replication servers – Distributed Query Optimisation - Distribution and Replication in Oracle.

UNIT II OBJECT ORIENTED DATABASES 9
Object Oriented Databases – Introduction – Weakness of RDBMS – Object Oriented Concepts Storing Objects in Relational Databases – Next Generation Database Systems – Object Oriented Data models – OODBMS Perspectives – Persistence – Issues in OODBMS – Object Oriented Database Management System Manifesto – Advantages and Disadvantages of OODBMS – Object Oriented Database Design – OODBMS Standards and Systems – Object Management Group – Object Database Standard ODMG – Object Relational DBMS –Postgres - Comparison of ORDBMS and OODBMS.

UNIT III WEB DATABASES 9
Web Technology And DBMS – Introduction – The Web – The Web as a Database Application Platform – Scripting languages – Common Gateway Interface – HTTP Cookies – Extending the Web Server – Java – Microsoft’s Web Solution Platform – Oracle Internet Platform – Semi structured Data and XML – XML Related Technologies – XML Query Languages

UNIT IV INTELLIGENT DATABASES 9
Enhanced Data Models For Advanced Applications – Active Database Concepts And Triggers – Temporal Database Concepts – Deductive databases – Knowledge Databases.
UNIT V CURRENT TRENDS 9
Mobile Database – Geographic Information Systems – Genome Data Management – Multimedia Database – Parallel Database – Spatial Databases - Database administration – Data Warehousing and Data Mining.
TOTAL : 45
TEXT BOOK
1. Thomas M. Connolly, Carolyn E. Begg, “Database Systems - A Practical Approach to Design , Implementation , and Management”, Third Edition , Pearson Education, 2003
REFERENCES
1. Ramez Elmasri & Shamkant B.Navathe, “Fundamentals of Database Systems”, Fourth Edition , Pearson Education , 2004.
2. M.Tamer Ozsu , Patrick Ualduriel, “Principles of Distributed Database Systems”, Second Edition, Pearso nEducation, 2003.
3. C.S.R.Prabhu, “Object Oriented Database Systems”, PHI, 2003.
4. Peter Rob and Corlos Coronel, “Database Systems – Design, Implementation and Management”, Thompson Learning, Course Technology, 5th Edition, 2003.

CS1005 ADVANCED JAVA PROGRAMMING

0 comments

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
B.E. COMPUTER SCIENCE AND ENGINEERING
LIST OF ELECTIVES FOR COMPUTER SCIENCE AND ENGINEERING
CS1005 ADVANCED JAVA PROGRAMMING
AIM

CS1004 DATA WAREHOUSING AND MINING

0 comments

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
B.E. COMPUTER SCIENCE AND ENGINEERING
LIST OF ELECTIVES FOR COMPUTER SCIENCE AND ENGINEERING
CS1004 DATA WAREHOUSING AND MINING
AIM
To serve as an introductory course to under graduate students with an emphasis on the design aspects of Data Mining and Data Warehousing
OBJECTIVE
This course has been designed with the following objectives:
• To introduce the concept of data mining with in detail coverage of basic tasks, metrics, issues, and implication. Core topics like classification, clustering and association rules are exhaustively dealt with.
• To introduce the concept of data warehousing with special emphasis on architecture and design.

UNIT I INTRODUCTION AND DATA WAREHOUSING 8
Introduction, Data Warehouse, Multidimensional Data Model, Data Warehouse Architecture, Implementation, Further Development, Data Warehousing to Data Mining
UNIT II DATA PREPROCESSING, LANGUAGE, ARCHITECTURES, CONCEPT DESCRIPTION 8
Why Preprocessing, Cleaning, Integration, Transformation, Reduction, Discretization, Concept Hierarchy Generation, Data Mining Primitives, Query Language, Graphical User Interfaces, Architectures, Concept Description, Data Generalization, Characterizations, Class Comparisons, Descriptive Statistical Measures.
UNIT III ASSOCIATION RULES 9
Association Rule Mining, Single-Dimensional Boolean Association Rules from Transactional Databases, Multi-Level Association Rules from Transaction Databases
UNIT IV CLASSIFICATION AND CLUSTERING 12
Classification and Prediction, Issues, Decision Tree Induction, Bayesian Classification, Association Rule Based, Other Classification Methods, Prediction, Classifier Accuracy, Cluster Analysis, Types of data, Categorisation of methods, Partitioning methods, Outlier Analysis.
UNIT V RECENT TRENDS 8
Multidimensional Analysis and Descriptive Mining of Complex Data Objects, Spatial Databases, Multimedia Databases, Time Series and Sequence Data, Text Databases, World Wide Web, Applications and Trends in Data Mining
TOTAL : 45
TEXT BOOK

1. J. Han, M. Kamber, “Data Mining: Concepts and Techniques”, Harcourt India / Morgan Kauffman, 2001.
REFERENCES
1. Margaret H.Dunham, “Data Mining: Introductory and Advanced Topics”, Pearson Education 2004.
2. Sam Anahory, Dennis Murry, “Data Warehousing in the real world”, Pearson Education 2003.
3. David Hand, Heikki Manila, Padhraic Symth, “Principles of Data Mining”, PHI 2004.
4. W.H.Inmon, “Building the Data Warehouse”, 3rd Edition, Wiley, 2003.
5. Alex Bezon, Stephen J.Smith, “Data Warehousing, Data Mining & OLAP”, MeGraw-Hill Edition, 2001.
6. Paulraj Ponniah, “Data Warehousing Fundamentals”, Wiley-Interscience Publication, 2003.

CS1003 HIGH PERFORMANCE MICROPROCESSORS

0 comments

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
B.E. COMPUTER SCIENCE AND ENGINEERING
LIST OF ELECTIVES FOR COMPUTER SCIENCE AND ENGINEERING
CS1003 HIGH PERFORMANCE MICROPROCESSORS
AIM

CS1002 UNIX INTERNALS COMPUTER SCIENCE AND ENGINEERING

0 comments

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
B.E. COMPUTER SCIENCE AND ENGINEERING
LIST OF ELECTIVES FOR COMPUTER SCIENCE AND ENGINEERING
CS1002 UNIX INTERNALS 3 0 0 100
AIM
To understand the kernel, I/O & files, process control, scheduling and memory management policies in unix.
OBJECTIVES
• To get thorough understanding of the kernel..
• To understand the file organization and management.
• To know the various system calls.
• To have a knowledge of process architecture, process control & scheduling and memory management.
UNIT I GENERAL OVERVIEW OF THE SYSTEM 9
History – System structure – User perspective – Operating system services – Assumptions about hardware. Introduction to the Kernel : Architecture of the UNIX operating system – Introduction to system concepts – Kernel data structures – System administration – Summary and Preview.
UNIT II BUFFER CACHE 9
Buffer headers – Structure of the buffer pool – Advantages and disadvantages of the buffer cache. Internal representation of files : Inodes – Structure of a regular file – Directories – Conversion of a path name to an Inode – Super block – Other file types.
UNIT III SYSTEM CALLS FOR FILE SYSTEM 9
Open – Read – Write – File and record locking – Adjusting the position of file I/O –LSEEK – Close – File creation – Creation of special files – Pipes – Dup – Mounting and unmounting file systems
UNIT IV THE STRUCTURE OF PROCESSES 9
Process states and transitions – Layout of system memory – The context of a process – Saving the context of a process. Process Control: Process creation – Signals – Process termination – Awaiting process termination – Invoking other programs – The shell – System boot and the INIT process.
UNIT V PROCESS SCHEDULING AND MEMORY MANAGEMENT POLICIES 9
Process Scheduling – Memory Management Policies : Swapping – A hybrid system with swapping and demand paging. The I/O Subsystem : Driver Interfaces– Disk Drivers-Terminal Drivers.

TOTAL : 45
TEXT BOOK
1. Maurice J. Bach, “The Design of the Unix Operating System”, Prentice Hall of India, 2004.
REFERENCE
1. Vahalia, “Unix Internals: The New Frontiers”, Pearson Education Inc, 2003.

CS1001 RESOURCE MANAGEMENT TECHNIQUES

0 comments

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
B.E. COMPUTER SCIENCE AND ENGINEERING
LIST OF ELECTIVES FOR COMPUTER SCIENCE AND ENGINEERING
CS1001 RESOURCE MANAGEMENT TECHNIQUES 3 0 0 100
1. LINEAR PROGRAMMING: 9