Registered Users & Guests Online
There are currently 0 users and 1 guest online.

Computer ScienceOpen Courseware and Resources (general) Computer Science: study of the theoretical foundations of information and computation and their implementation and application in computer systems (Wikipedia).Information and Entropyultimate limits to communication and computation, emphasis on physical nature of information and information processing: information and computation, digital signals, codes and compression, applications (biological representations of information, logic circuits, computer architectures, and algorithmic information, noise, probability, error correction, reversible and irreversible operations, physics of computation, quantum computation), concept of entropy applied to channel capacity and second law of thermodynamics
Design and Analysis of AlgorithmsIterative Algorithms & Loop Invariants, Recursion, Optimization Problems, slides (Iterative Technique, Recursion, Searching Graphs, Network Flows, Greedy Algorithms, Recursive Back Tracking and Dynamic Programming, NPCompleteness, Lower Bounds & Models, Review)
******* Candy Button Paper and Turing Machines ******
CSC Mediavariety of recordings of past CSC Talks  some large files
Stanford CS Education Librarycollects education CS material from courses and distributes them for free: Pointers and Memory, Lists & Trees, Languages, Unix, Tetris, Beta Materials
Introduction to Algorithmstechniques for design & analysis of efficient algorithms emphasizing methods useful in practice, sorting; search trees, heaps & hashing, divideandconquer, dynamic programming, amortized analysis, graph algorithms, shortest paths, network flow, computational geometry, numbertheoretic algorithms, polynomial & matrix calculations, caching, & parallel computing, readings, quizzes & solutions
Skiena's Algorithms LecturesIntroduction to Algorithms, Asymptotic Notation, Modeling / Logarithms, Elementary Data Structures, Trees, Sorting, Graph Data Structures, Breadth/DepthFirst Search, Topological Sort / Connectivity, Minimum Spanning Trees, Shortest Path, AllPairs Shortest Paths, Combinatorial Search, Program optimization, Dynamic Programming, NPcompleteness, Reductions, Cook's Theorem, The NPcompleteness challenge, Approximation Algorithms, Heuristic Methods
Introduction to Computer Science and Programmingunderstanding of the role computation can play in solving problems, small programs that allow useful goals, Python™ programming language: readings
Interactive Computer Theorem Provingbasic logic and natural deduction, data structures and induction, inductivelydefined predicates, proofs as programs, tactics for automation, programming with proofs, beyond primitive recursion, automation, proof by reflection, denotational semantics, reflecting Coq into Coq, Twelf
Understanding Computers and the Internethardware, software, the Internet, multimedia, security, website development, programming, and dotcoms, designed both for those with little, if any, computer experience and for those who use a computer every day: optional handson sections and workshops, problem sets

NewsBookmark iBerry !Search iBerryUser loginLanguage Translation 
Recent comments
5 weeks 2 days ago
42 weeks 21 hours ago
1 year 36 weeks ago
1 year 45 weeks ago
2 years 30 weeks ago
2 years 46 weeks ago
2 years 50 weeks ago
3 years 2 weeks ago
2 years 3 weeks ago