Registered Users & Guests Online
There are currently 0 users and 0 guests 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).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
ArsDigita University Curriculum (courses)Math for Computer Science, Structure and Interpretation of Computer Programs, Discrete Math, How Computers Work, Objectoriented Program Design, Algorithms, Systems, Web Applications, Theory of Computation, Artificial Intelligence, Unix Workshop, Database Management Systems, Applied Probability

NewsBookmark iBerry !Search iBerryUser loginLanguage Translation 
Recent comments
7 weeks 3 days ago
8 weeks 19 hours ago
9 weeks 11 hours ago
41 weeks 2 days ago
1 year 2 weeks ago
1 year 11 weeks ago
1 year 19 weeks ago
1 year 20 weeks ago
1 year 21 weeks ago