Sunday, October 16, 2011

Charles Babbage


Father of Computer Charles Babbage and his engine.......

0 comments


Charles Babbage (1791-1871), computer pioneer, designed the first automatic computing engines. He invented computers but failed to build them. The first complete Babbage Engine was completed in London in 2002, 153 years after it was designed. Difference Engine No. 2, built faithfully to the original drawings, consists of 8,000 parts, weighs five tons, and measures 11 feet long.
We invite you to learn more about this extraordinary object, its designer Charles Babbage and the team of people who undertook to build it. Discover the wonder of a future already passed. A sight no Victorian ever saw.
An identical Engine completed in March 2008 is on display at the Computer History Museum in Mountain View, California

 For more Info visit    http://www.computerhistory.org/babbage/howitworks/

.

FREE NETWORKING RESOURCES


FREE NETWORKING RESOURCES



(ebook - PDF) - Networking - Cisco IP Routing Fundamentals

FREE DOWNLOAD 


Computers Networking Unix - Solaris - TCPIP Network Administration


FREE DOWNLOAD


Addison Wesley - Advanced Linux Networking


FREE DOWNLOAD


An Introduction To Ip Security (Ipsec) Encryption


FREE DOWNLOAD


Computer Science - Network and Networking Programming


FREE DOWNLOAD


Data Center Networking - Integrating Security_ Load Balancing_and SSL Services using Service Modules


FREE DOWNLOAD

Interconnections--Bridges_ Routers_ Switches_ and Internetworking Protocols (2nd Edition)


FREE DOWNLOAD


Introduction to New IP Switching Protocols


FREE DOWNLOAD


Linux Networking HOWTO


FREE DOWNLOAD


Network Capacity & Performance Management


FREE DOWNLOAD

JNTU - LAB MANUALS for CSE, IT, ECE and EEE

Database Management Systems (DBMS)


Database Management Systems (DBMS) Materials -PPT and PDF


    Database System Concepts by  Avi Silberschatz ,Henry F. Korth , S. Sudarshan .  Download links for all chapters in PPT and PDF formats are below...



ChapterFormats
1. Introductionppt, pdf
Part 1: Relational Databases
2. Introduction to the Relational Modelppt, pdf
3. Introduction to SQLppt, pdf
4. Intermediate SQLppt, pdf
5. Advanced SQLppt, pdf
6. Formal Relational Query Languagesppt, pdf
Part 2: Database Design
7. Database Design: The Entity-Relationship Approachppt, pdf
8. Relational Database Designppt, pdf
9. Application Designppt, pdf
Part 3: Data Storage and Querying
10. Storage and File Structureppt, pdf
11. Indexing and Hashingppt, pdf
12. Query Processingppt, pdf
13. Query Optimizationppt, pdf
Part 4: Transaction Management
14. Transactionsppt, pdf
15. Concurrency Controlppt, pdf
16. Recovery Systemppt, pdf
Part 5: System Architecture
17. Database System Architecturesppt, pdf
18. Parallel Databasesppt, pdf
19. Distributed Databasesppt, pdf
Part 6: Data Warehousing, Mining, and IR
20. Data Miningppt, pdf
21. Information Retrievalppt, pdf
Part 8: Specialty Databases
22. Object-Based Databasesppt, pdf
23. XMLppt, pdf
Part 8: Advanced Topics
24. Advanced Application Developmentppt, pdf
25. Advanced Data Typesppt, pdf
26. Advanced Transaction Processingppt, pdf
Part 9: Case Studies
27. PostgreSQLppt, pdf
28. Oracleppt, pdf
29. IBM DB2 Universal Databaseppt, pdf
30. Microsoft SQL Serverppt, pdf
Appendices
A. Detailed University Schemappt, pdf
B. Advanced Relational Database Designppt, pdf
C. Other Relational Query Languagesppt, pdf
D. Network Modelppt, pdf
E. Hierarchical Modelppt, pdf

ACA

ADS


ADVANCED DATA STRUCTURES USING JAVA ( univ of florida  


Lecture

Content
Slides
1
Amortized complexity.

2
Amortized Complexity.

3
Introduction to external sorting.
4
Introduction to external sorting.
5
Selection trees & k-way merging.
6
Run generation.
7
Optimal merging of runs.
8
Buffering.
9
Double-ended priority queues. General methods.
10
Double-ended priority queues. Interval heaps.
11
Leftist trees.
12
Binomial heaps.
13
Binomial heaps.
14
Fibonacci heaps.
15
Pairing heaps.
16
Dictionaries.

17
Optimal Binary Search Trees.
18
AVL trees.
19
AVL trees.
20
Red-black trees
21
Red-black trees.
22
B-trees.
23
B-trees.
24
B+ and B*-trees.
25
Splay trees.
26
Splay Trees.
27
Binary Tries.
28
Compressed Binary Tries.
29
Tries and Packet Forwarding.
30
High-order Tries.
31
Suffix Trees.

32
Bloom Filters.
33
Segment Trees.
34
Interval Trees.
35
Priority Search Trees.
36
Priority Search Trees.
37
Multidimensional Search Trees.
38
Quad Trees.

39
BSP Trees.
40
R-Trees.