Friday, 25 October 2013

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
National Level Management Meet in 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

Wednesday, 23 October 2013

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.

Tuesday, 22 October 2013

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.

Monday, 21 October 2013

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.