- page
- parameter
- parent
- parent pointer representation
- parity
- parity bit
- parse tree
- parser
- partial order
- partially ordered set
- partition
- pass by reference
- pass by value
- path
- path compression
- PDA
- peripheral storage
- permutation
- persistent
- physical file
- physical form
- Pigeonhole Principle
- pivot, [1]
- platter
- point quadtree
- point-region quadtree
- pointee
- pointer
- pointer-based implementation for binary tree nodes
- polymorphism
- pop
- poset
- position
- postorder traversal
- potential
- powerset
- PR quadtree
|
- prefix property
- preorder traversal
- Prim's algorithm
- primary clustering
- primary index
- primary key
- primary key index
- primary storage
- primitive data type
- primitive element
- primitive nth root of unity
- priority
- priority queue
- probabilistic algorithm
- probabilistic data structure
- probe function
- probe sequence
- problem
- problem instance
- problem lower bound
- problem upper bound
- procedural
- procedural programming paradigm
- production
- production rule
- program
- promotion
- proof, [1]
- by contradiction
- by induction
- direct
- proof by contradiction
- proof by induction
- proving the contrapositive
- pseudo polynomial
- pseudo random
- pseudo-random probing
- push
- pushdown automata
|