A tree representation of the abstract syntactic structure of source code written in a programming language.
"Compilers use ASTs to understand the structure of the program before generating machine code."
An algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks.
"Dijkstra's algorithm can be used in mapping services to find the shortest driving route between two locations."
A group of two or more computer systems linked together. Networks can involve various devices and protocols to facilitate communication and resource sharing.
"Networks enable computers to share resources such as files, printers, and internet connections."
A numbering scheme or indexing convention in computer science and programming where the first element in an array, list, or sequence is assigned an index of zero, rather than one, leading to the offset of one between the index and position of elements.
"In a zero-indexed array, the first element is accessed using index 0, the second element with index 1, and so on."
A garbage collection technique where each object has a count of the number of references to it. When the reference count drops to zero, the object's memory can be reclaimed.
"Reference counting helps manage memory usage in languages like Python, ensuring that objects are automatically destroyed when no longer needed."
