start node
31Algorithmen für hierarchisches Layout — Dieser Artikel wurde aufgrund von inhaltlichen Mängeln auf der Qualitätssicherungsseite der Redaktion Informatik eingetragen. Dies geschieht, um die Qualität der Artikel aus dem Themengebiet Informatik auf ein akzeptables Niveau zu bringen. Hilf… …
32A* search algorithm — In computer science, A* (pronounced A star ) is a best first, graph search algorithm that finds the least cost path from a given initial node to one goal node (out of one or more possible goals). It uses a distance plus cost heuristic function… …
33I²C — (Inter Integrated Circuit) is a multi master serial computer bus invented by Philips that is used to attach low speed peripherals to a motherboard, embedded system, or cellphone. The name is pronounced eye squared see or eye two see . As of… …
34Recursion (computer science) — Recursion in computer science is a way of thinking about and solving problems. It is, in fact, one of the central ideas of computer science. [cite book last = Epp first = Susanna title = Discrete Mathematics with Applications year=1995… …
35Controller-area network — (CAN or CAN bus) is a computer network protocol and bus standard designed to allow microcontrollers and devices to communicate with each other without a host computer.It was designed specifically for automotive applications but is now also used… …
36Interval tree — In computer science, an interval tree, also called a segment tree or segtree, is an ordered tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is… …
37Program Evaluation and Review Technique — For other uses, see Pert (disambiguation). PERT network chart for a seven month project with five milestones (10 through 50) and six activities (A through F). The Program (or Project) Evaluation and Review Technique, commonly abbreviated PERT, is …
38Melanoma — Classification and external resources A melanoma ICD 10 C43 …
39Linked list — In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the… …
40Heapsort — Infobox Algorithm class=Sorting algorithm A run of the heapsort algorithm sorting an array of randomly permuted values. In the first stage of the algorithm the array elements are reordered to satisfy the heap property. Before the actual sorting… …
