Hierarchy — A hierarchy (Greek: hierarchia (ἱεραρχία), from hierarches, leader of sacred rites ) is an arrangement of items (objects, names, values, categories, etc.) in which the items are represented as being above, below, or at the same level as one… … Wikipedia
Control Structure Diagram — The Control Structure Diagram automatically documents the program flow within the source code and adds indentation with graphical symbols. Thereby the source code becomes visibly structured without sacrificing space. See also Diagram Entity… … Wikipedia
Memory hierarchy — Diagram of the computer memory hierarchy See also: Computer data storage The term memory hierarchy is used in the theory of computation when discussing performance issues in computer architectural design, algorithm predictions, and the lower… … Wikipedia
Analytic Hierarchy Process — The Analytic Hierarchy Process (AHP) is a structured technique for helping people deal with complex decisions. Rather than prescribing a correct decision, the AHP helps people to determine one. Based on mathematics and human psychology, it was… … Wikipedia
Warnier/Orr diagram — A Warnier/Orr diagram (also known as a logical construction of a program/system) is a kind of hierarchical flowchart that allow the description of the organization of data and procedures. They were initially developed in France by Jean Dominique… … Wikipedia
Spiritual Hierarchy — Part of a series on Theosophy Founders of the T. S. Helena Blavatsky · … Wikipedia
Class diagram — UML diagrams Structural UML diagrams Class diagram Component diagram Composite structure diagram Deployment diagram Object diagram … Wikipedia
Integrated development environment — Anjuta, a C and C++ IDE for the GNOME environment An integrated development environment (IDE) (also known as integrated design environment, integrated debugging environment or interactive development environment) is a software application that… … Wikipedia
Network topology — Diagram of different network topologies. Network topology is the layout pattern of interconnections of the various elements (links, nodes, etc.) of a computer[1][2] … Wikipedia
NP (complexity) — Diagram of complexity classes provided that P ≠ NP. The existence of problems outside both P and NP complete in this case was established by Ladner.[1] In computational complexity theory, NP is one of the most fundamental complexity classes. The… … Wikipedia