Refers to the time a program or device takes to locate a particular piece of data. For disk drives, the terms seek time and access time are often used interchangeably. Technically speaking, however, the access time is often longer the seek time because it includes a brief latency period.
(1) In networks, a section of a network that is bounded by bridges, routers or switches. Dividing an Ethernet into multiple segments is one of the most common ways of increasing available bandwidth on the LAN. If segmented correctly, most network traffic will remain within a single segment, enjoying the full 10 Mbps bandwidth. Hubs […]
- segmented address space
An address space logically divided into sections, called segments. To access a particular memory location, a program must specify both the segment number and the offset within that segment. In contrast, a flat address space consists of simple memory addresses that start at 0 and increment to the maximum address. Intel’s 16-bit x86 architecture uses […]
To choose an object so that you can manipulate it in some way. In graphical user interfaces, you usually need to select an object — an icon, file, folder, and so on — before you can do anything with it. To select an object, you move the pointer to the object and click a mouse […]
Also called a decision, one of the three basic logic structures in computer programming. The other two logic structures are sequence and loop. In a selection structure, a question is asked, and depending on the answer, the program takes one of two courses of action, after which the program moves on to the next event. […]
- selective backup
A type of backup where only the user specified files and directories are backed up. A selective backup is commonly used for backing up files which change frequently or in situations where the space available to store backups is limited. Also called a partial backup.