Shell Scripting
noun — “telling computers what to do… very firmly… one line at a time.”
Shell Scripting is the practice of writing small programs, called scripts, that instruct a command-line shell how to execute a sequence of commands automatically. These scripts act as glue between tools, turning individual commands into repeatable workflows. If typing the same commands more than twice makes you sigh, Shell Scripting has already been invented for you.
Oberon
/ˈoʊ.bə.rɒn/
noun — "because every language deserves a minimalist kingdom."
Modula-2
/ˈmɒd.jʊ.lə tuː/
noun — "because sometimes Pascal wanted a slightly cooler sibling."
Nested Interactive Array Language
/naɪəl/
noun — "array-oriented functional programming language."
Boolean Logic
/ˈbuːliən ˈlɑːdʒɪk/
noun … “Algebra of true/false values.”
Boolean Logic is a system of mathematics and reasoning that operates on binary values—typically true (1) and false (0)—to perform logical operations. It is the foundation of logic gates, digital circuits, and computer programming, enabling decision-making, conditional execution, and binary computation. Boolean expressions combine variables and operators such as AND, OR, NOT, NAND, NOR, XOR, and XNOR to define logical relationships.
Circular Reference
/ˈsɜːrkjələr ˈrɛfərəns/
noun … “Objects referencing each other in a loop.”
Weak Reference
/wiːk ˈrɛfərəns/
noun … “Reference that doesn’t prevent object deallocation.”
Reference Counting
/ˈrɛfərəns ˈkaʊntɪŋ/
noun … “Track object usage to reclaim memory.”
Reference Counting is a memory management technique in which each object maintains a counter representing the number of references or pointers to it. When the reference count drops to zero, the object is no longer accessible and can be safely deallocated from heap memory. This method is used to prevent memory leaks and manage lifetimes of objects in languages like Python, Swift, and Objective-C.
Key characteristics of Reference Counting include:
Vector
/ˈvɛktər/
noun … “Resizable sequential container.”
Dynamic Array
/daɪˈnæmɪk əˈreɪ/
noun … “Resizable contiguous memory collection.”
Dynamic Array is a data structure similar to an array but with the ability to grow or shrink at runtime. Unlike fixed-size arrays, dynamic arrays allocate memory on the heap and can expand when more elements are added, typically by allocating a larger block and copying existing elements. They balance the efficiency of indexed access with flexible memory usage.
Key characteristics of Dynamic Array include: