- Topic outline of computer science
Computer science , or computing science, is the study of the theoretical foundations ofinformation andcomputation and their implementation and application incomputer system s. One well known subject classification system forcomputer science is theACM Computing Classification System devised by theAssociation for Computing Machinery .The following outline is provided as an overview of and introduction to computer science:
Branches of computer science
Mathematical foundations
*
Mathematical logic - Boolean logic and other ways of modeling logical queries; the uses and limitations of formal proof methods
*Number theory - Theory of proofs and heuristics for finding proofs in the simple domain of integers. Used incryptography as well as a test domain inartificial intelligence .
*Graph theory - Foundations for data structures and searching algorithms.
*Game theory - useful inartificial intelligence andcybernetics .Theory of computation
*
Automata theory - Different logical structures for solving problems.
* Computability theory - What is calculable with the current models of computers. Proofs developed byAlan Turing and others provide insight into the possibilities of what may be computed and what may not.
*Computational complexity theory - Fundamental bounds (especially time and storage space) on classes of computations.
*Quantum computing theory - Explores computational models involvingquantum superposition of bits.Algorithms and data structures
*
Algorithms - Sequential and parallel computational procedures for solving a wide range of problems.
*Data structure s - The organization and manipulation of data.Programming languages and compilers
*
Compiler theory - Theory ofcompiler design, based onAutomata theory .
* Programing language pragmatics - Taxonomy of programming languages, their strength and weaknesses. Variousprogramming paradigms , such asobject-oriented programming .
*Programming language theory
** Formal semantics - rigorous mathematical study of the meaning of programs.
**Type theory - Formal analysis of the types of data, and the use of these types to understand properties of programs — especially program safety.Concurrent, parallel, and distributed systems
* Concurrency - The theory and practice of simultaneous computation; data safety in any multitasking or multithreaded environment.
*Parallel computing - Computing using multiple concurrent threads of execution, devising algorithms for solving problems on multiple processors to achieve maximal speed-up compared to sequential execution.
*Distributed computing - Computing using multiple computing devices over a network to accomplish a common objective or task and there by reducing the latency involved in single processor contributions for any task.Software engineering
*
Formal methods - Mathematical approaches for describing and reasoning about software designs.
*Software engineering - The principles and practice of designing, developing, and testing programs, as well as proper engineering practices.
*Reverse engineering - The application of the scientific method to the understanding of arbitrary existing software
*Algorithm design - Using ideas from algorithm theory to creatively design solutions to real tasks
*Computer programming - The practice of using a programming language to implement algorithmsComputer architecture
*
Computer architecture - The design, organization, optimization and verification of a computer system, mostly aboutCPU s and Memory subsystem (and the bus connecting them).
*Operating system s - Systems for managing computer programs and providing the basis of a usable system.Communications and Security
* Networking - Algorithms and protocols for reliably communicating data across different shared or dedicated media, often including
error correction .
*Computer security - Practical aspects of securing computer systems and computer networks.
*Cryptography - Applies results from complexity, probability and number theory to invent and break codes, and analyze the security ofcryptographic protocols .Databases
*
Relational databases - the set theoretic and algorithmic foundation of databases.
*Data mining - Study of algorithms for searching and processing information in documents and databases; closely related toinformation retrieval .Artificial intelligence
*
Artificial intelligence - The implementation and study of systems that exhibit an autonomous intelligence or behaviour of their own.
*Automated reasoning - Solving engines, such as used inProlog , which produce steps to a result given a query on a fact and rule database, and automated theorem provers that aim to provemathematical theorem s with some assistance from a programmer.
*Robotics - Algorithms for controlling the behavior of robots.
*Computer vision - Algorithms for identifying three dimensional objects from a two dimensional picture.
*Machine learning - Automated creation of a set of rules and axioms based on input.Computer graphics
*
Computer graphics - Algorithms both for generating visual images synthetically, and for integrating or altering visual and spatial information sampled from the real world.
*Image processing - Determining information from an image through computation.
*Human computer interaction - The study and design of computer interfaces that people use.Scientific computing
*
Numerical analysis - Approximate numerical solution of mathematical problems such as root-finding, integration, the solution of ordinary differential equations; the approximation ofspecial functions .
*Symbolic computation - Manipulation and solution of expressions in symbolic form, also known asComputer algebra .
*Computational physics - Numerical simulations of large non-analytic systems
*Computational chemistry - Computational modelling of theoretical chemistry in order to determine chemical structures and properties
*Bioinformatics - The use of computer science to maintain, analyse, storebiological data and to assist in solving biological problems such asProtein folding , function prediction andPhylogeny .
*Computational neuroscience - Computational modelling ofneurophysiology .History of computer science
Vocations of computer science
*
Programmer
*Software architect
*Software developer
*Software tester Basic computer science concepts
Data and data structures
*
Array
*Data structure
*Data type
*Database
*List
*Matrix (computer science)
*String
*TreeObject oriented
*Class
*Inheritance
*Object
*Object-oriented programming Other
*Abstraction
*Algorithm
*Automata
*Big O notation
*Closure
*Compiler
*Computation
*Computability
*Computational complexity
*Computer networking
*Computer programming
*Concurrency
*Continuation
*Control flow
*Declarative programming
*Finite state machine
*Flowchart
*Formal methods
*Functional programming
*Graph
*Halting problem
*Imperative programming
*Information hiding
*Invariant
*Iteration
*λ-calculus
*Logic programming
*Operating system
*Parsing
*π-calculus
*Polymorphism
*Procedural programming
*Programming language design
*Programming language semantics
*Recursion
*Regular expression
*Subroutine
*Systems programming
*Turing machinePeople in computer science
See also
*
Cognitive science External links
*
* [http://www.lecturefox.com/computerscience/ Directory of free university lectures in Computer Science]
* [http://liinwww.ira.uka.de/bibliography/ Collection of Computer Science Bibliographies]
* [http://se.ethz.ch/~meyer/gallery/ Photographs of computer scientists] (Bertrand Meyer 's gallery); Webcasts
* [http://www.oid.ucla.edu/webcasts/courses/2006-2007/2006fall/cs1 UCLA Computer Science 1 Freshman Computer Science Seminar Section 1]
* [http://webcast.berkeley.edu/course_details.php?seriesid=1906978395 Berkeley Introduction to Computers]
Wikimedia Foundation. 2010.