Thursday, November 13, 2014

CP7202 ADVANCED DATABASES EBOOKS

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 9
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 9
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 9
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 9
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.


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 distributed database
 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


EBOOKS


 
DOWNLOAD

Wednesday, November 12, 2014

M.E COMPUTER SCIENCE AND ENGINEERING
REGULATION 2013
SEMESTER-II
CP7201 THEORETICAL  FOUNDATIONS OF COMPUTER SCIENCE


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 12
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 12
Propositional logic – syntax – interpretations and models – deduction theorems – normal forms –
inference rules – SAT solvers – Davis Putnam procedure – binary decision diagrams – predicate
logic – syntax – proof theory – semantics of predicate logic – undecidability of predicate logic -
Normal form – unification – - 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 12
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 12
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 12
Languages and Grammars – Finite State Machines – State machines and languages – Turing
Machines – Computational Complexity – computability – Decidability – Church's Thesis.
                                                                                                                           TOTAL : 60 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.

EBOOKS: 








DOWNLOAD

Friday, April 19, 2013

THANKS FOR YOUR SUPPORT GUYS... WEBSITE WILL BE LIVE FROM JULY 10 2013

Thanks for your comments and feedback. 
I also thank you guys for tremendous support. 
The website will be updated with uploaded files from August 6 2013. 
I use file sharing websites like 4shared and uploading.com servers only. 
I also welcome for your future comments and feedback.
 

Regards 

VINOD D 

Admin

Saturday, October 13, 2012

Anna University Results of UG/ PG Examination (B.E/B.Tech/M.E/M.Tech) (Mark & Grade System)- June 2012


ANNA UNIVERSITY MAY/JUNE 2012 REVALUATION RESULTS | 2ND,4TH,6TH,8TH SEMESTER ANNA UNIVERSITY,CHENNAI REVALUATION RESULTS

Anna University Results of UG/ PG Examination (B.E/B.Tech/M.E/M.Tech) (Mark & Grade System)- June 2012 


Information regarding Anna University 2nd,4th,6th,8th  Semester May/June 2012 Revaluation Results – Common to Anna University Of technology,Tirunelveli,Maduari,Tirchy,Coimbatore

After A Long Duration In Years (Say 3 To 4 ) Anna University, Chennai Taken Charge To Conduct University Examinations For All College Students Who Are Admitted In The Colleges Affiliated To Anna University During May/June 2012 Session (Second,Third,Fourth Year) And June/July 2012(First Year).

After So Many Confusions In Releasing Exam results. Anna University Chennai Has Announced May/June 2012 Results for 2nd, 4th, 6th, 8th Semester on 18/08/2012 By 11 Pm
Later, Anna University, Chennai revealed that
“The last date for applying for Revaluation is 29-08-2012“

10/09/2012 - Right Now the status from officials is that Answer Script revaluation is yet to start, after appropriate extraction of papers from bundles

Anna University, Chennai (Common to All Colleges) Nov/Dec 2012 Examination is nearby, so many works like Review After Revaluation results , framing November/December 2012 timetable, So Anna University officials are hurry up to finish the revaluation process for all  the students as soon as possible.

Result update
27/10/2012 : Latest Result Status Update 

 


GRADE SYSTEM CLICK HERE

MARK SYSTEM CLICK HERE

Wednesday, August 22, 2012

Anna University Results of PG Examinations(M.E./M.Tech./B.Sc & M.Sc) (Mark & Grade System)- June 2012 (Madurai, Chennai, Trichy, Tirunelveli and Coimbatore)

Anna University Results of PG Examinations(M.E./M.Tech./B.Sc & M.Sc) (Mark & Grade System)- June 2012


Owing to administrative problems and the alleged leak of one paper, the results of final-year students with arrears have been delayed. “We have asked them to apply based on their TANCET and GATE scores. Results will anyway be out by August 25. If a candidate is found to have arrears at the time of his counselling, he will not be eligible,” Mr. Uthiariaraj said.- source:THE HINDU


GRADE SYSTEM CLICK HERE

MARK SYSTEM CLICK HERE


Result WH 1 indicates Withheld for suspected Malpractice
Result WH 2 indicates Withheld for want of approval of admission / re- admission / transfer from DTE & Director, Student Affairs.
Result WH 5 indicates Withheld for want of clearance from Director (Student Affairs)/Director CUIC
Result WH 6 indicates Withheld for want of clarification
Result Wh8 indicates withheld for want of clarification from the Director (AC) about the equivalency of subjects for the students admitted in v and vii semester)
Result Wh9 indicates Results Published Later
Result S.E indicates Sports Exemption
Result W indicates With drawal
Result AB indicates Absent
Result SA indicates Shortage of Attendance
Result RA indicates Reappearance (To Reappear)
Grade  Grade Point
S   10
A  9
B  8
C  7
D  6
E  5
U  0
I  0
W  0

Monday, August 20, 2012

Anna University Results of PG Examinations (M.B.A./M.C.A.) - MAY/JUNE 2012





GRADE SYSTEM CLICK HERE

MARK SYSTEM CLICK HERE



Anna University June 2012 Results & Arrear Results (Madurai, Chennai, Trichy, Tirunelveli and Coimbatore)

Anna University Results of UG Examinations(B.E./B.Tech./B.Arch.) (Mark & Grade System)- June 2012 


CLICK HERE