EINSTEINS IDEA ON GRAVITY WRITTEN BY LORDSONROY

GRAVITY
The term”GRAVITY” has puzzled many people for centuries. But the first person to provide an answer to this question was Newton. When an apple fell on his head he wondered why the apple is falling down. He then worked on the subject and got the results on what we call as gravity. He said it is a force that exists between two bodies. He provided us with equation that enabled us to calculate the amount of force exerted on a body,

But he does not explain what, how and why gravity is caused. His theory also allowed us to calculate the behavior of matter to a certain limit.untill Einstein’s period no one was able to give a correct reason for gravity.Untill that newton’s idea on gravity was thought to be correct. Everything changed when Einstein published his theory of relativity.

EINSTEINS IDEA ON GRAVITY
Einstein with his concept of space time curvature rocked the world of physics. He said that mass distorts space thus creating space-time curvature. We think that gravity is just a force that holds us on our feet. He simply rejected the idea that gravity is just a force. But we feel gravity as a force and we cannot simply reject the idea of force and accept gravity as space time curvature. Because it is weird to imagine gravity in Einstein’s way and at the other hand have been brought up by the idea that gravity is a force as in our text books. But it’s time to get an update on gravity.

As per the concept of space time curvature gravity works on the two rules

• A particle travelling in a gravitational field will take the shortest path 
• A particle travelling in a gravitational field will travel along a straight path 

It is hard to accept the two rules but in this article I will try hard to make things simple and easier.

Gravity

CASE 1:
Consider that you throw a ball. It will make its path through air and hit the ground but what’s weird about that .The fact is that it has taken the shortest path. But you think that everything is normal and you would not experience any difference. This is normal in the case of a ball. But it’s totally different when gravity is stronger so that not even light can escape from it.in the case of the ball it is subjected to a little gravity so nothing extraordinary happens. The below figure represents a ball thrown from point a.The ball travels and hits the point b.The path is a projectile motion. In reality the ball goes straight. No curved path but we see a curved path of the ball. This is because that space time is curved

Gravity

Now in the below figure the real path of the ball is shown

Gravity

This is because we cannot see the dimensions like space and time and our brain should should somehow process it so it gives us a curved path. (NOTE: This is because of our brains inability to process info beyond a certain limit and as per some reports our brain only process only 10% of the data it gets).that’s the reason for the curved path.

CASE 2:
In this consider a beam of light travelling straight into a black hole (a black hole is a dead star but with a very high gravity. Not even light can escape from it) when the beam reaches near the black hole its bends and moves into the blackhole.This is because it takes the shortest path.(it is the first law and not well explained in case 1).so if you think gravity as a force it will be pulling the object to ground. But as per space time curvature it is not a force so it should be going forever (i.e.) a ball thrown

Gravity

Will be travelling and do it will not hit the ground. But as I have mentioned earlier that gravity is space time curvature it is the amount of time of the object (i.e.) when we throw a ball after an amount of time the ball will fall down because the time for the ball to be in motion expires so that it fall down and it is not the gravitational force which pulls it down.

---

Post Author : Lordson Roy
College : Bethlahem Institute of Engineering
Year : Third year IT (2013)

---

EC6202 ELECTRONIC DEVICES AND CIRCUITS - Anna university Second sem regulation 2013 syllabus

ANNA UNIVERSITY CHENNAI 

EC6202 ELECTRONIC DEVICES AND CIRCUITS

REGULATION - 2013 

SECOND SEMESTER SYLLABUS

OBJECTIVES
 To know the structure, operation and applications of the basic electronic devices.

UNIT I PN JUNCTION DEVICES
PN junction diode –structure, operation and V-I characteristics, diffusion and transient capacitance -Rectifiers – Half Wave and Full Wave Rectifier,– Display devices- LED, Laser diodes, Zener diodecharacteristics-Zener Reverse characteristics – Zener as regulator

UNIT II TRANSISTORS
BJT, JFET, MOSFET- structure, operation, characteristics and Biasing UJT, Thyristor and IGBT -Structure and characteristics.

UNIT III AMPLIFIERS
BJT small signal model – Analysis of CE, CB, CC amplifiers- Gain and frequency response –
MOSFET small signal model– Analysis of CS and Source follower – Gain and frequency response-High frequency analysis.

UNIT IV MULTISTAGE AMPLIFIERS AND DIFFERENTIAL AMPLIFIER
BIMOS cascade amplifier, Differential amplifier – Common mode and Difference mode analysis – FETinput stages – Single tuned amplifiers – Gain and frequency response – Neutralization methods,power amplifiers –Types (Qualitative analysis).

UNIT V FEEDBACK AMPLIFIERS AND OSCILLATORS
Advantages of negative feedback – voltage / current, series , Shunt feedback –positive feedback –Condition for oscillations, phase shift – Wien bridge, Hartley, Colpitts and Crystal oscillators.

TOTAL: 60 PERIODS

TEXT BOOKS:
1. David A. Bell ,”Electronic devices and circuits”, Prentice Hall of India, 2004.
2. Sedra and smith, “Microelectronic circuits “ Oxford University Press, 2004.
REFERENCES:
1. Rashid, “Micro electronic circuits” Thomson publications, 1999.
2. Floyd, “Electron devices” Pearson Asia 5th Edition, 2001.
3. Donald A Neamen, “Electronic Circuit Analysis and Design” Tata McGraw Hill, 3rd Edition, 2003.
4. Robert L.Boylestad, “Electronic devices and circuit theory”, 2002.
5. Robert B. Northrop, “Analysis and Application of Analog Electronic Circuits to Biomedical
Instrumentation”, CRC Press, 2004.

CS6202 PROGRAMMING AND DATA STRUCTURES I - Anna university Second sem regulation 2013 syllabus

ANNA UNIVERSITY CHENNAI 

CS6202 PROGRAMMING AND DATA STRUCTURES I

REGULATION - 2013 

SECOND SEMESTER SYLLABUS

OBJECTIVES:
 To introduce the basics of C programming language
 To introduce the concepts of ADTs
 To introduce the concepts of Hashing and Sorting

UNIT I C PROGRAMMING FUNDAMENTALS- A REVIEW
Conditional statements – Control statements – Functions – Arrays – Preprocessor - Pointers -
Variation in pointer declarations – Function Pointers – Function with Variable number of arguments

UNIT II C PROGRAMMING ADVANCED FEATURES
Structures and Unions - File handling concepts – File read – write – binary and Stdio - File
Manipulations

UNIT III LINEAR DATA STRUCTURES – LIST
Abstract Data Types (ADTs) – List ADT – array-based implementation – linked list implementation – singly linked lists- circularly linked lists- doubly-linked lists – applications of lists –Polynomial Manipulation – All operation (Insertion, Deletion, Merge, Traversal)

UNIT IV LINEAR DATA STRUCTURES – STACKS, QUEUES
Stack ADT – Evaluating arithmetic expressions- other applications- Queue ADT – circular queue implementation – Double ended Queues – applications of queues

UNIT V SORTING, SEARCHING AND HASH TECHNIQUES
Sorting algorithms: Insertion sort - Selection sort - Shell sort - Bubble sort - Quick sort - Merge sort -Radix sort – Searching: Linear search –Binary Search Hashing: Hash Functions – Separate Chaining – Open Addressing – Rehashing – Extendible Hashing.

TOTAL: 45 PERIODS

TEXT BOOKS:
1. Brian W. Kernighan and Dennis M. Ritchie, “The C Programming Language”, 2nd Edition,
Pearson Education, 1988.
2. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, Pearson
Education, 1997.

REFERENCES:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, “Introduction to
Algorithms", Second Edition, Mcgraw Hill, 2002.
2. Reema Thareja, “Data Structures Using C”, Oxford University Press, 2011
3. Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson Education,1983.
4. Stephen G. Kochan, “Programming in C”, 3rd edition, Pearson Ed.,

CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN - Anna university Second sem regulation 2013 syllabus

ANNA UNIVERSITY CHENNAI 

CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN

REGULATION - 2013 

SECOND SEMESTER SYLLABUS

OBJECTIVES:
 Learn how to design digital circuits, by simplifying the Boolean functions. Also, gives an idea
about designs using PLDs, and writing codes for designing larger digital systems.

UNIT I BOOLEAN ALGEBRA AND LOGIC GATES
Review of Number Systems – Arithmetic Operations – Binary Codes – Boolean Algebra and
Theorems – Boolean Functions – Simplification of Boolean Functions using Karnaugh Map nd
Tabulation Methods – Logic Gates – NAND and NOR Implementations.

UNIT II COMBINATIONAL LOGIC
Combinational Circuits – Analysis and Design Procedures – Circuits for Arithmetic Operations,
Code Conversion – Decoders and Encoders – Multiplexers and Demultiplexers – Introduction to HDL – HDL Models of Combinational circuits.

UNIT III SYNCHRONOUS SEQUENTIAL LOGIC
Sequential Circuits – Latches and Flip Flops – Analysis and Design Procedures – State Reduction and State Assignment – Shift Registers – Counters – HDL for Sequential Logic Circuits.

UNIT IV ASYNCHRONOUS SEQUENTIAL LOGIC
Analysis and Design of Asynchronous Sequential Circuits – Reduction of State and Flow Tables –Race-free State Assignment – Hazards.

UNIT V MEMORY AND PROGRAMMABLE LOGIC
RAM and ROM – Memory Decoding – Error Detection and Correction – Programmable Logic Array– Programmable Array Logic – Sequential Programmable Devices – Application Specific Integrated Circuits.

TOTAL: 45 PERIODS

TEXT BOOK:
1. Morris Mano M. and Michael D. Ciletti, “Digital Design”, IV Edition, Pearson Education, 2008.

REFERENCES:
1. John F. Wakerly, “Digital Design Principles and Practices”, Fourth Edition, Pearson Education,
2007.
2. Charles H. Roth Jr, “Fundamentals of Logic Design”, Fifth Edition – Jaico Publishing House,
Mumbai, 2003.
3. Donald D. Givone, “Digital Principles and Design”, Tata Mcgraw Hill, 2003.
4. Kharate G. K., “Digital Electronics”, Oxford University Press, 2010.

CU7006 WAVELET TRANSFORMS AND APPLICATIONS-ANNA UNIV PG 1ST SEM SYLLABUS

ANNA UNIVERSITY, CHENNAI

REGULATIONS - 2013

M.E. APPLIED ELECTRONICS

CU7006 WAVELET TRANSFORMS AND APPLICATIONS

COURSE OBJECTIVES:
 To study the basics of signal representation and Fourier theory
 To understand Multi Resolution Analysis and Wavelet concepts
 To study the wavelet transform in both continuous and discrete domain
 To understand the design of wavelets using Lifting scheme
 To understand the applications of Wavelet transform

UNIT I FUNDAMENTALS
Vector Spaces – Properties– Dot Product – Basis – Dimension, Orthogonality and Orthonormality – Relationship Between Vectors and Signals – Signal Spaces – Concept
of Convergence – Hilbert Spaces for Energy Signals- Fourier Theory: Fourier series expansion,Fourier transform, Short time Fourier transform, Time-frequency analysis
.
UNIT II MULTI RESOLUTION ANALYSIS
Definition of Multi Resolution Analysis (MRA) – Haar Basis – Construction of General
Orthonormal MRA – Wavelet Basis for MRA – Continuous Time MRA Interpretation for the
DTWT – Discrete Time MRA – Basis Functions for the DTWT – PRQMF Filter Banks.

UNIT III CONTINUOUS WAVELET TRANSFORMS
Wavelet Transform – Definition and Properties – Concept of Scale and its Relation with
Frequency – Continuous Wavelet Transform (CWT) – Scaling Function and Wavelet Functions
(Daubechies Coiflet, Mexican Hat, Sinc, Gaussian, Bi Orthogonal)– Tiling of Time – Scale Plane for CWT.

UNIT IV DISCRETE WAVELET TRANSFORM
Filter Bank and Sub Band Coding Principles – Wavelet Filters – Inverse DWT Computation by Filter Banks – Basic Properties of Filter Coefficients – Choice of Wavelet
Function Coefficients – Derivations of Daubechies Wavelets – Mallat's Algorithm for DWT –
Multi Band Wavelet Transforms Lifting Scheme- Wavelet Transform Using Polyphase Matrix
Factorization – Geometrical Foundations of Lifting Scheme – Lifting Scheme in Z –Domain.

UNIT V APPLICATIONS
Wavelet methods for signal processing- Image Compression Techniques: EZW–SPHIT Coding– Image Denoising Techniques: Noise Estimation – Shrinkage Rules – Shrinkage Functions –Edge Detection and Object Isolation, Image Fusion, and Object Detection.

TOTAL: 45 PERIODS 

COURSE OUTCOMES:
Upon Completion of the course, the students will be able to
 Use Fourier tools to analyse signals
 Gain knowledge about MRA and representation using wavelet bases
 Acquire knowledge about various wavelet transforms and design wavelet transform
 Apply wavelet transform for various signal & image processing applications
TEXT BOOKS:
1. Rao R M and A S Bopardikar, ―Wavelet Transforms Introduction to theory and
Applications, Pearson Education, Asia, 2000.
2. L.Prasad & S.S.Iyengar, Wavelet Analysis with Applications to Image Processing, CRC
Press, 1997.

REFERENCES:
1. J. C. Goswami and A. K. Chan, “Fundamentals of wavelets: Theory, Algorithms and
Applications" WileyInterscience Publication,John Wiley & Sons Inc., 1999.
2. M. Vetterli, J. Kovacevic, “Wavelets and subband coding" Prentice Hall Inc, 1995.
3. Stephen G. Mallat, “A wavelet tour of signal processing" 2 nd Edition Academic Press,
2000.
4. Soman K P and Ramachandran K I, ―Insight into Wavelets From Theory to practice􀀀,
Prentice Hall, 2004.

How to fix corrupted files in Windows XP operating system | Computer Tricks

This post will help you to fix the corrupted file in your computer.Due to some virus or due to some improper saving the file may be corrupted.This trick will help you to recover or fix the corrupted file.

fix corrupted files in windows

Lets start to learn "How to fix corrupted Files"

Requirements :

• Windows XP operating system
• Windows XP cd

Procedure :

• Insert the xp cd in your cd/dvd drive
• Go to start
• Click run or click Win key+R
• type in 'sfc /scannow' (without quotes)

Now it will start to load, and fix all your corrupted files on windows XP...

---

To see more computer tricks --> Click Here

---

DS7201 ADVANCED DIGITAL IMAGE PROCESSING-ANNA UNIV PG 1ST SEM SYLLABUS

ANNA UNIVERSITY, CHENNAI

REGULATIONS - 2013

M.E. APPLIED ELECTRONICS

DS7201 ADVANCED DIGITAL IMAGE PROCESSING

COURSE OBJECTIVES:

 To understand the image fundamentals and mathematical transforms necessary for image

processing and to study the image enhancement techniques.

 To understand the image segmentation and representation techniques.

 To understand how image are analyzed to extract features of interest.

 To introduce the concepts of image registration and image fusion.

 To analyze the constraints in image processing when dealing with 3D data sets.

UNIT I FUNDAMENTALS OF DIGITAL IMAGE PROCESSING

Elements of visual perception, brightness, contrast, hue, saturation, mach band effect, 2D

image transforms-DFT, DCT, KLT, and SVD. Image enhancement in spatial and frequency

domain, Review of morphological image processing

UNIT II SEGMENTATION

Edge detection, Thresholding, Region growing, Fuzzy clustering, Watershed algorithm, Active

contour methods, Texture feature based segmentation, Model based segmentation, Atlas based segmentation, Wavelet based Segmentation methods

UNIT III FEATURE EXTRACTION

First and second order edge detection operators, Phase congruency, Localized feature

extraction-detecting image curvature, shape features Hough transform, shape skeletonization,

Boundary descriptors, Moments, Texture descriptors- Autocorrelation, Co-occurrence features,

Runlength features, Fractal model based features, Gabor filter, wavelet features

UNIT IV REGISTRATION AND IMAGE FUSION

Registration- Preprocessing, Feature selection-points, lines, regions and templates Feature

correspondence-Point pattern matching, Line matching, region matching Template matching

.Transformation functions-Similarity transformationand Affine Transformation. Resampling-

Nearest Neighbour and Cubic Splines Image Fusion-Overview of image fusion, pixel fusion,

Multiresolution based fusiondiscrete wavelet transform, Curvelet transform. Region based

fusion.

UNIT V 3D IMAGE VISUALIZATION

Sources of 3D Data sets, Slicing the Data set, Arbitrary section planes, The use of color,

Volumetric display, Stereo Viewing, Ray tracing, Reflection, Surfaces, Multiply connected

surfaces, Image processing in 3D, Measurements on 3D images.

TOTAL: 45 PERIODS

COURSE OUTCOMES:

Upon Completion of the course, the students will be able to

 To understand image formation and the role human visual system plays in perception of

gray and color image data.

 To apply image processing techniques in both the spatial and frequency (Fourier) domains.

 To design image analysis techniques in the form of image segmentation and to evaluate the

methodologies for segmentation.

 To conduct independent study and analysis of feature extraction techniques.

 To understand the concepts of image registration and image fusion.

 To analyze the constraints in image processing when dealing with 3D data sets and to apply

image processing algorithms in practical applications.

TEXT BOOKS:

1. John C.Russ, “The Image Processing Handbook”, CRC Press,2007.

2. Mark Nixon, Alberto Aguado, “Feature Extraction and Image Processing”, Academic Press,

2008.

3. Ardeshir Goshtasby, “ 2D and 3D Image registration for Medical, Remote Sensing and

Industrial Applications”,John Wiley and Sons,2005.

REFERENCE BOOKS:

1. Rafael C. Gonzalez, Richard E. Woods, , Digital Image Processing', Pearson,Education,

Inc., Second Edition, 2004.

2. Anil K. Jain, , Fundamentals of Digital Image Processing', Pearson Education,Inc., 2002.

3. Rick S.Blum,Zheng Liu,“ Multisensor image fusion and its Applications“,Taylor&

Francis,2006.

CP7204 ADVANCED OPERATING SYSTEMS - ANNA UNIV CSE PG 2ND SEM SYLLABUS

ANNA UNIVERSITY, CHENNAI

REGULATIONS - 2013

M.E. COMPUTER SCIENCE AND ENGINEERING

CP7204 ADVANCED OPERATING SYSTEMS

OBJECTIVES:
 To learn the fundamentals of Operating Systems
 To gain knowledge on Distributed operating system concepts that includes architecture, 
Mutual exclusion algorithms, Deadlock detection algorithms and agreement protocols
 To gain insight on to the distributed resource management components viz. the 
algorithms for implementation of distributed shared memory, recovery and commit 
protocols
 To know the components and management aspects of Real time, Mobile operating 
systems

UNIT I FUNDAMENTALS OF OPERATING SYSTEMS    
Overview – Synchronization Mechanisms – Processes and Threads - Process Scheduling –
Deadlocks: Detection, Prevention and Recovery  – Models of Resources  – Memory 
Management Techniques.

UNIT II DISTRIBUTED OPERATING SYSTEMS 
Issues in Distributed Operating System  – Architecture  – Communication Primitives  –
Lamport’s Logical clocks  – Causal Ordering of Messages  – Distributed Mutual Exclusion 
Algorithms  – Centralized and Distributed Deadlock Detection Algorithms  – Agreement 
Protocols. 

UNIT III DISTRIBUTED RESOURCE MANAGEMENT
Distributed File Systems  – Design Issues  - Distributed Shared Memory  – Algorithms for 
Implementing Distributed Shared memory–Issues in Load Distributing  – Scheduling 
Algorithms  – Synchronous and Asynchronous Check Pointing and Recovery  – Fault 
Tolerance  – Two-Phase Commit Protocol  – Nonblocking Commit Protocol  – Security and 
Protection.

UNIT IV REAL TIME AND MOBILE OPERATING SYSTEMS
Basic Model of Real Time Systems  - Characteristics- Applications of Real Time Systems –
Real Time Task Scheduling  - Handling Resource Sharing  - Mobile Operating Systems  –
Micro Kernel Design  - Client Server Resource Access – Processes and Threads  - Memory 
Management - File system.

UNIT V CASE STUDIES
Linux System: Design Principles  - Kernel Modules  - Process Management Scheduling  -
Memory Management  - Input-Output Management  - File System  - Interprocess 
Communication. iOS and Android:  Architecture and SDK Framework  - Media Layer  -
Services Layer - Core OS Layer - File System.

OUTCOMES:
Upon Completion of the course, the students should be able to:
 Discuss the various synchronization, scheduling and memory management issues
 Demonstrate the Mutual exclusion, Deadlock detection and agreement protocols of 
Distributed operating system 
 Discuss the various resource management techniques for distributed systems
 Identify the different features of real time and mobile operating systems
 Install and use available open source kernel
 Modify existing open source kernels in terms of functionality or features used

REFERENCES:
1. Mukesh Singhal and Niranjan G. Shivaratri, “Advanced Concepts in Operating Systems 
– Distributed, Database, and Multiprocessor Operating Systems”, Tata McGraw-Hill, 
2001.
2. Abraham Silberschatz; Peter Baer Galvin; Greg Gagne, “Operating System Concepts”, 
Seventh Edition, John Wiley & Sons, 2004.  
3. Daniel P Bovet and Marco Cesati, “Understanding the Linux kernel”, 3rd edition, 
O’Reilly, 2005. 
4. Rajib Mall, “Real-Time Systems: Theory and Practice”, Pearson Education India, 2006.
5. Neil Smyth, “iPhone iOS 4 Development Essentials – Xcode”, Fourth Edition, Payload 
media, 2011. 

CP7203 PRINCIPLES OF PROGRAMMING LANGUAGES - ANNA UNIV CSE PG 2ND SEM SYLLABUS

ANNA UNIVERSITY, CHENNAI

REGULATIONS - 2013

M.E. COMPUTER SCIENCE AND ENGINEERING

CP7203 PRINCIPLES OF PROGRAMMING LANGUAGES   

OBJECTIVES:
 To understand and describe syntax and semantics of programming languages
 To understand data, data types, and basic statements
 To understand call-return architecture and ways of implementing them
 To understand object-orientation,concurrency, and event handling in programming languages
 To develop programs in non-procedural programming paradigms

UNIT I SYNTAX AND SEMANTICS
Evolution of programming languages – describing syntax – context-free grammars – attribute 
grammars – describing semantics – lexical analysis – parsing – recursive-decent – bottomup parsing

UNIT II DATA, DATA TYPES, AND BASIC STATEMENTS 
Names – variables – binding – type checking – scope – scope rules – lifetime and garbage 
collection – primitive data types – strings – array types – associative arrays – record types –
union types  – pointers and references  – Arithmetic expressions  – overloaded operators  –
type conversions  – relational and boolean expressions  – assignment statements  – mixedmode assignments  – control structures  – selection  – iterations  – branching  – guarded 
statements

UNIT III SUBPROGRAMS AND IMPLEMENTATIONS
Subprograms  – design issues  – local referencing  – parameter passing  – overloaded 
methods  – generic methods – design issues for functions  – semantics of call and return –
implementing simple subprograms  – stack and dynamic local variables  – nested 
subprograms – blocks – dynamic scoping

UNIT IV OBJECT-ORIENTATION, CONCURRENCY, AND EVENT HANDLING
Object-orientation  – design issues for OOP languages  – implementation of object-oriented 
constructs  – concurrency  – semaphores  – monitors  – message passing  – threads  –
statement level concurrency – exception handling – even handling

UNIT V FUNCTIONAL AND LOGIC PROGRAMMING LANGUAGES
Introduction to lambda calculus  – fundamentals of functional programming languages  –
Programming with Scheme  – Programming with ML  – Introduction to logic and logic 
programming – Programming with Prolog – multi-paradigm languages

OUTCOMES:
Upon Completion of the course,the students will be able to
 Describe syntax and semantics of programming languages
 Explain data, data types, and basic statements of programming languages
 Design and implement subprogram constructs14
 Apply object-oriented, concurrency, and event handling programming constructs
 Develop programs in Scheme, ML, and Prolog
 Understand and adopt new programming languages

REFERENCES:
1. Robert W. Sebesta, “Concepts of Programming Languages”, Tenth Edition, Addison 
Wesley, 2012.
2. Michael L. Scott, “Programming Language Pragmatics”, Third Edition, Morgan 
Kaufmann, 2009.
3. R. Kent Dybvig, “The Scheme programming language”, Fourth Edition, MIT Press, 2009.
4. Jeffrey D. Ullman, “Elements of ML programming”, Second Edition, Prentice Hall, 1998.
5. Richard A. O'Keefe, “The craft of Prolog”, MIT Press, 2009.
6. W. F. Clocksin and C. S. Mellish, “Programming in Prolog: Using the ISO Standard”, Fifth 
Edition, Springer, 2003.

ANNA UNIVERSITY AFFILIATED COLLEGES RANK HOLDERS 2009-2013 BATCH

Anna University officially published the Anna University affiliated colleges Rank list for the April/may 2013 Examination.That is Rank holders of 2009 to 2013 batch.Now we updated this in our Website just click the link given below to view the Rank holders of 2013.

Rank Holders of 2009 -2013 Batch

To see Rank Holders List --> Click Here

How to get University Rank :

• A candidate should get pass in all the subjects in first class or first class with distinction in the first attempt.(Pass in currents semester)
• And some calculations will be done to select the rank holders at the rate of 1 for every 20 students who are eligible as above.

Protentoso 2013 - National Level Management Meet in Nehru Institute of Information Technology and Management

Event Name : Protentoso 2013

Event Type : National Level Management Meet

College Name : Nehru Institute of Information Technology and Management

Important Dates:

Event  Date :29th October, 2013 On spot Registration

Organizer Details:
Department of Management Studies(MBA).

Events:
1. Best Manager (PK DAS YOUNG BUSINESS LEADER AWARD '13)
2. Business Quiz
3. Best Management Team
4. Ad Zap
5. Business Plan

Web Address:
-----------------------

Facebook Page Address:
https://www.facebook.com/Protentoso13

Contact Information

Faculty Coordinator
Mr. V. Sathya Murthy +91 9677886632
Student Coordinator
Mr. C. Gobinath +91 9442649433

College Address
Thirumalayampalayam,
Coimbatore- 641 105.
Tamil Nadu. India

Submitted by : Sangameswaran

---

Do you want to post your college events in StudentsBlog100,Just click here

---

CP7202 ADVANCED DATABASES - ANNA UNIV CSE PG 2ND SEM SYLLABUS

ANNA UNIVERSITY, CHENNAI

REGULATIONS - 2013

M.E. COMPUTER SCIENCE AND ENGINEERING

CP7202 ADVANCED DATABASES

OBJECTIVES:
 To learn the modeling and design of databases.
 To acquire knowledge on parallel and distributed databases and its applications.
 To study the usage and applications of Object Oriented database
 To understand the principles of intelligent databases.
 To understand the usage of advanced data models.
 To learn emerging databases such as XML, Cloud and Big Data.
 To acquire inquisitive attitude towards research topics in databases.

UNIT I PARALLEL AND DISTRIBUTED DATABASES
Database System Architectures: Centralized and Client-Server Architectures – Server
System Architectures – Parallel Systems- Distributed Systems – Parallel Databases: I/O
Parallelism – Inter and Intra Query Parallelism – Inter and Intra operation Parallelism –
Design of Parallel Systems- Distributed Database Concepts - Distributed Data Storage –
Distributed Transactions – Commit Protocols – Concurrency Control – Distributed Query
Processing – Case Studies

UNIT II OBJECT AND OBJECT RELATIONAL DATABASES
Concepts for Object Databases: Object Identity – Object structure – Type Constructors –
Encapsulation of Operations – Methods – Persistence – Type and Class Hierarchies –
Inheritance – Complex Objects – Object Database Standards, Languages and Design:
ODMG Model – ODL – OQL – Object Relational and Extended – Relational Systems: Object
Relational features in SQL/Oracle – Case Studies.

UNIT III INTELLIGENT DATABASES
Active Databases: Syntax and Semantics (Starburst, Oracle, DB2)- Taxonomy- Applications-
Design Principles for Active Rules- Temporal Databases: Overview of Temporal Databases-
TSQL2- Deductive Databases: Logic of Query Languages – Datalog- Recursive Rules-
Syntax and Semantics of Datalog Languages- Implementation of Rules and Recursion-
Recursive Queries in SQL- Spatial Databases- Spatial Data Types- Spatial Relationships-
Spatial Data Structures-Spatial Access Methods- Spatial DB Implementation.

UNIT IV ADVANCED DATA MODELS
Mobile Databases: Location and Handoff Management - Effect of Mobility on Data
Management - Location Dependent Data Distribution - Mobile Transaction Models -
Concurrency Control - Transaction Commit Protocols- Multimedia Databases- Information
Retrieval- Data Warehousing- Data Mining- Text Mining.

UNIT V EMERGING TECHNOLOGIES
XML Databases: XML-Related Technologies-XML Schema- XML Query Languages- Storing
XML in Databases-XML and SQL- Native XML Databases- Web Databases- Geographic
Information Systems- Biological Data Management- Cloud Based Databases: Data Storage
Systems on the Cloud- Cloud Storage Architectures-Cloud Data Models- Query Languages-
Introduction to Big Data-Storage-Analysis.

TOTAL: 45 PERIODS

OUTCOMES:
Upon completion of the course, the students will be able to
 Select the appropriate high performance database like parallel and distributeddatabase
 Model and represent the real world data using object oriented database
 Design a semantic based database to meaningful data access
 Embed the rule set in the database to implement intelligent databases
 Represent the data using XML database for better interoperability
 Handle Big data and store in a transparent manner in the cloud
 To solve the issues related to the data storage and retrieval

REFERENCES:
1. R. Elmasri, S.B. Navathe, “Fundamentals of Database Systems”, Fifth Edition,
Pearson Education/Addison Wesley, 2007.
2. Thomas Cannolly and Carolyn Begg, “Database Systems, A Practical Approach to
Design, Implementation and Management”, Third Edition, Pearson Education, 2007.
3. Henry F Korth, Abraham Silberschatz, S. Sudharshan, “Database System Concepts”,
Fifth Edition, McGraw Hill, 2006.
4. C.J.Date, A.Kannan and S.Swamynathan, ”An Introduction to Database Systems”,
Eighth Edition, Pearson Education, 2006.
5. Raghu Ramakrishnan, Johannes Gehrke, “Database Management Systems”,
McGraw Hill, Third Edition 2004.

CP7201 THEORETICAL FOUNDATIONS OF COMPUTER SCIENCE - ANNA UNIV CSE PG 2ND SEM SYLLABUS

ANNA UNIVERSITY, CHENNAI

REGULATIONS - 2013

M.E. COMPUTER SCIENCE AND ENGINEERING

CP7201 THEORETICAL FOUNDATIONS OF COMPUTER SCIENCE

OBJECTIVES:
 To review sets, relations, functions, and other foundations
 To understand propositional and predicate logics and their applications
 To understand lambda calculus and functional programming
 To understand graph structures and their applications
 To understand formal models of computation, computability, and decidability

UNIT I FOUNDATIONS
Sets – relations – equivalence relations – partial orders – functions – recursive functions –
sequences – induction principle – structural induction – recursive algorithms – counting –
pigeonhole principle – permutations and combinations – recurrence relations

UNIT II LOGIC AND LOGIC PROGRAMMING
Propositional logic – syntax – interpretations and models – deduction theorems – normal
forms – inference rules – SAT solvers - predicate logic – syntax – proof theory – semantics
of predicate logic – undecidability of predicate logic – inferences in first-order logic – logic
programming – definite programs – SLD resolution – normal programs – SLDNF resolution –
introduction to Prolog

UNIT III LAMBDA CALCULUS AND FUNCTIONAL PROGRAMMING
Lambda notation for functions – syntax – curried functions – parametric polymorphism –
lambda reduction – alpha reduction – beta reduction – beta abstraction – extensionality
theorem – delta reduction – reduction strategies – normal forms – Church-Rosser Theorems
– pure lambda calculus – constants – arithmetic – conditionals – Iteration – recursion –
introduction to functional programming

UNIT IV GRAPH STRUCTURES
Tree Structures – Graph structures – graph representations – regular graph structures –
random graphs – Connectivity – Cycles – Graph Coloring – Cliques, Vertex Covers,
Independent sets – Spanning Trees – network flows – matching

UNIT V STATE MACHINES
Languages and Grammars – Finite State Machines – State machines and languages –
Turing Machines – Computational Complexity – computability – Decidability – Church's
Thesis

TOTAL : 45 PERIODS

OUTCOMES:
Upon Completion of the course,the students will be able
 To explain sets, relations, functions
 To conduct proofs using induction, pigeonhole principle, and logic
 To apply counting, permutations, combinations, and recurrence relations
 To apply recursive functions and lambda calculus
 To explain logic programming and functional programming principles
 To apply sequential structures, tree structures, and graph structures
 To explain computational models, computability, and complexity

REFERENCES:
1. Uwe Schoning, “Logic for Computer Scientists”, Birkhauser, 2008.
2. M. Ben-Ari, “Mathematical logic for computer science”, Second Edition, Springer,
2003.
3. John Harrison, “Handbook of Practical Logic and Automated Reasoning”, Cambridge
University Press, 2009.
4. Greg Michaelson, “An introduction to functional programming through lambda
calculus”, Dover Publications, 2011.
5. Kenneth Slonneger and Barry Kurtz, “Formal syntax and semantics of programming
languages”, Addison Wesley, 1995.
6. Kenneth H. Rosen, “Discrete Mathematics and its applications”, Seventh Edition,
Tata McGraw Hill, 2011.
7. Sriram Pemmaraju and Steven Skiena, “Computational Discrete Mathematics”,
Cambridge University Press, 2003.
8. M. Huth and M. Ryan, “Logic in Computer Science – Modeling and Reasoning about
systems”, Second Edition, Cambridge University Press, 2004.
9. Norman L. Biggs, “Discrete Mathematics”, Second Edition, Oxford University Press,
2002.
10. Juraj Hromkovic, “Theoretical Computer Science”, Springer, 1998.
11. J. E. Hopcroft, Rajeev Motwani, and J. D. Ullman, “Introduction to Automata Theory,
Languages, and Computation”, Third Edition, Pearson, 2008.

CP7103 MULTICORE ARCHITECTURES - ANNA UNIV 1ST SEM REG 2013 ME CSE SYLLABUS

ANNA UNIVERSITY, CHENNAI

REGULATIONS - 2013

M.E. COMPUTER SCIENCE AND ENGINEERING

CP7103 MULTICORE ARCHITECTURES

OBJECTIVES: 
 To understand the recent trends in the field of Computer Architecture and identify 
performance related parameters 
 To appreciate the need for parallel processing 
 To expose the students to the problems related to multiprocessing 
 To understand the different types of multicore architectures 
 To expose the students to warehouse-scale and embedded architectures 

UNIT I FUNDAMENTALS OF QUANTITATIVE DESIGN AND ANALYSIS
Classes of Computers – Trends in Technology, Power, Energy and Cost – Dependability – 
Measuring, Reporting and Summarizing Performance – Quantitative Principles of Computer 
Design – Classes of Parallelism - ILP, DLP, TLP and RLP - Multithreading - SMT and CMP 
Architectures – Limitations of Single Core Processors - The Multicore era – Case Studies of 
Multicore Architectures. 

UNIT II DLP IN VECTOR, SIMD AND GPU ARCHITECTURES
Vector Architecture - SIMD Instruction Set Extensions for Multimedia – Graphics Processing 
Units - Detecting and Enhancing Loop Level Parallelism - Case Studies.  

UNIT III TLP AND MULTIPROCESSORS
Symmetric and Distributed Shared Memory Architectures – Cache Coherence Issues - 
Performance Issues – Synchronization Issues – Models of Memory Consistency - 
Interconnection Networks – Buses, Crossbar and Multi-stage Interconnection Networks. 

UNIT IV RLP AND DLP IN WAREHOUSE-SCALE ARCHITECTURES
Programming Models and Workloads for Warehouse-Scale Computers – Architectures for 
Warehouse-Scale Computing – Physical Infrastructure and Costs – Cloud Computing – 
Case Studies. 

UNIT V ARCHITECTURES FOR EMBEDDED SYSTEMS
Features and Requirements of Embedded Systems – Signal Processing and Embedded 
Applications – The Digital Signal Processor – Embedded Multiprocessors - Case Studies. 

TOTAL : 45 PERIODS 

OUTCOMES: 
Upon completion of the course, the students will be able to 
 Identify the limitations of ILP and the need for multicore architectures 
 Discuss the issues related to multiprocessing and suggest solutions 
 Point out the salient features of different multicore architectures and how they exploit 
parallelism 
 Critically analyze the different types of inter connection networks 
 Discuss the architecture of GPUs, warehouse-scale computers and embedded 
processors 

REFERENCES: 
1. John L. Hennessey and David A. Patterson, “ Computer Architecture – A Quantitative 
Approach”, Morgan Kaufmann / Elsevier, 5th
 edition, 2012. 
2. Kai Hwang, “Advanced Computer Architecture”, Tata McGraw-Hill Education, 2003 
3. Richard Y. Kain, “Advanced Computer Architecture a Systems Design Approach”, 
Prentice Hall, 2011. 
4. David E. Culler, Jaswinder Pal Singh, “Parallel Computing Architecture : A Hardware/ 

Software Approach” , Morgan Kaufmann / Elsevier, 1997.