Jump to content

User:Dkidd928/Books/Computer Science

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Dkidd928 (talk | contribs) at 15:05, 7 June 2016 (Created page with '{{saved book |title= |subtitle= |cover-image= |cover-color= | setting-papersize = a4 | setting-toc = auto | setting-columns = 2 }} == Computer Science ==...'). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)


Computer Science

[edit]
Abstract data type
Abstraction
Algorithm
Anonymous function
Array data structure
Array data type
ASCII
Automata theory
AVL tree
B-tree
Bellman–Ford algorithm
Best, worst and average case
Big O notation
Binary code
Binary search algorithm
Binary search tree
Binary tree
Block (programming)
Boilerplate code
Boolean data type
Boolean expression
Breadth-first search
Byte
Character (computing)
Class (computer programming)
Class-based programming
Closure (computer programming)
Cohesion (computer science)
Collection (abstract data type)
Comment (computer programming)
Compiler
Complex data type
Composite data type
Computation
Computer
Computer program
Computer programming
Computer science
Computing
Constant (computer programming)
Coupling (computer programming)
Data (computing)
Data buffer
Data structure
Data type
Debugging
Decimal
Delimiter
Depth-first search
Determinism
Dijkstra's algorithm
Duck typing
Dynamic programming
Encapsulation (computer programming)
Enumerated type
Execution (computing)
Expression (computer science)
Fibonacci number
Finite-state machine
Floating point
Function type
Functional programming
Graph (abstract data type)
Greedy algorithm
Halting problem
Hash function
Hash table
Heap (data structure)
Heuristic
Hexadecimal
Identifier
Incremental build model
Information hiding
Inheritance (object-oriented programming)
Instance (computer science)
Instance variable
Integer (computer science)
Interpreter (computing)
Lambda calculus
Left recursion
Lex (software)
Lexeme
Lexical analysis
Lexical semantics
Lexicon
Linked list
Lint (software)
List (abstract data type)
List of data structures
Literal (computer programming)
Logic programming
Lookup table
Machine code
Memoization
Memory management
Metadata
Minimum spanning tree
Modular programming
Mutator method
Mutual recursion
Object (computer science)
Object-oriented programming
Octal
Operator (computer programming)
Parameter (computer programming)
Parsing
Pointer (computer programming)
Polymorphism (computer science)
Prettyprint
Prim's algorithm
Primitive data type
Program optimization
Programming language
Property (programming)
Queue (abstract data type)
Real number
Real-time computing
Record (computer science)
Red–black tree
Scope (computer science)
Scripting language
Scrum (software development)
Self-balancing binary search tree
Semantic analysis (compilers)
Semantics
Sequence
Shortest path problem
Side effect (computer science)
Software
Software engineering
Software prototyping
Sorting algorithm
Source code
Spanning tree
Spiral model
Stack (abstract data type)
State (computer science)
Statement (computer science)
String (computer science)
String literal
Strong and weak typing
Structured programming
Subroutine
Syntax (logic)
Syntax (programming languages)
Time complexity
Top-down parsing
Tree (data structure)
Tree rotation
Tree traversal
Tuple
Type conversion
Type system
Unicode
Unified Process
Variable (computer science)
Vertex (graph theory)
Waterfall model
Whitespace character
Word (computer architecture)
Worst-case execution time