Computer Science Fundamentals

The Reverse Address Resolution Protocol (RARP) is a computer networking protocol used by a host computer to request its Internet Protocol (IPv4) address from an administrative host, when it has its Link Layer or hardware address available, such as a MAC address.

A stack is a particular kind of abstract data type or collection in which the principal (or only) operations on the collection are the addition of an entity to the collection, known as push and removal of an entity, known as pop. The relation between the push and pop operations is such that the stack is a Last-In-First-Out (LIFO) data structure. It is the best data for checking the balancing of parenthesis.

Writing the microcode is often called microprogramming and the microcode in a particular processor implementation is sometimes called a microprogram. Microprogramming is the designing of the CPU.

The Spanning Tree Protocol (STP) is a network protocol that ensures a loop-free topology for any bridged Ethernet local area network. The basic function of STP is to prevent bridge loops and the broadcast radiation that results from them. Spanning tree also allows a network design to include spare (redundant) links to provide automatic backup paths if an active link fails, without the danger of bridge loops, or the need for manual enabling/disabling of these backup links.

The Constructive Cost Model (COCOMO Model) is an algorithmic model used for software cost estimation.

UDP uses a simple transmission model with a minimum of protocol mechanism. It has no handshaking dialogues and thus exposes any unreliability of the underlying network protocol to the user's program.

Kernel threads do not own resources except for a stack, a copy of the registers including the program counter and thread-local storage (if any).