File Organization and Management Com 214 Pdf

Total Page:16

File Type:pdf, Size:1020Kb

File Organization and Management Com 214 Pdf File organization and management com 214 pdf Continue 1 1 UNESCO-NIGERIA TECHNICAL - VOCATIONAL EDUCATION REVITALISATION PROJECT-PHASE II NATIONAL DIPLOMA IN COMPUTER TECHNOLOGY FILE Organization AND MANAGEMENT YEAR II- SE MESTER I THEORY Version 1: December 2 2 Content Table WEEK 1 File Concepts... 6 Bit:... 7 Binary figure... 8 Representation... 9 Transmission... 9 Storage... 9 Storage unit... 9 Abbreviation and symbol More than one bit, trit, dontcare, what? RfC on trivial bits Alternative Words WEEK 2 WEEK 3 Identification and File File System Aspects of File Systems File Names Metadata Hierarchical File Systems Means Secure Access WEEK 6 Types of File Systems Disk File Systems File Systems File Systems Transactional Systems File Systems Network File Systems Special Purpose File Systems 3 3 File Systems and Operating Systems Flat File Systems File Systems according to Unix-like Operating Systems File Systems according to Plan 9 from Bell Files under Microsoft Windows WEEK 7 File Storage Backup Files Purpose Storage Primary Storage Secondary Storage Third Storage Out Storage Features Storage Volatility Volatility UncertaintyAbility Availability Availability Performance Key Storage Technology Semiconductor Magnetic Paper Unusual Related Technology Connecting Network Connection Robotic Processing Robotic Processing File Processing Activity 4 4 Technology Execution Program interrupts secure mode and memory control mode Virtual Memory Operating Systems Linux and UNIX Microsoft Windows Mac OS X Special File Systems Journalized File Systems Graphic User Interfaces History Mainframes Microcomputers Microsoft Windows Plan Unix and Unix-like operating systems Mac OS X Real-time Operating Systems Built-in Core Development Hobby Systems Pre-Emptification 5 5 WEEK 1 THIS WEEK SPECIFIC LEARNING OUTCOMES To understand: The concept of the file in the computing concept, field, character, byte and bits in relation to File 5 6 6 Concept Files In this section, we will deal with the concepts of the file and their relationship. Many operating systems view files as a set of bytes. At a higher level where the contents of the file are viewed, these binary numbers may represent more general values or text symbols, or anything else. It's up to the program, using the file to understand the meaning and internal layout of the information in the file and present it to the user as more meaningful information (such as text, images, sounds). At any given time, the file may be in size, usually expressed by bytes, indicating how much memory is associated with the file. In most modern operating systems, the size can be any number up to the system limit. However, the total File doesn't require its its size has any real value if the data in the file does not match the data in the permanent storage pool. The information in a computer file may consist of smaller packets of information, often called records or lines, that are individually different but have some common traits. For example, a salary file may contain information about all employees of the company and their salary data; each entry in the payroll file concerns only one employee, and all records have a common trait to be associated with wages. It's very similar to placing all the salary information in a specific closet in an office that doesn't have a computer. A text file may contain lines of text corresponding to printed lines on a piece of paper. In addition, the file may contain an arbitrary binary image (BLOB) or may contain a complete one. The way information is grouped into a file depends entirely on the person projected by the file. This has led to a plethora of more or less standardized file structures for every conceivable purpose, from the simplest to the most complex. Most computer files are used by computer programs. These programs create, modify, and delete files for their own use as needed. Programmers, creating programs, decide what files are needed, how they should be used and their names. 6 7 7 In some cases, computer programs manipulate files that are visible to the computer user. For example, in a word processing program, a user manipulates files of documents that she calls herself. The contents of the document file are designed in such a way that the text processing program understands, but the user chooses the name and location of the file, and it provides the bulk of the information (such as words and text) that will be stored in the file. Many apps pack all their data files into a single file, using internal markers to recognize the different types of information inside. Files on your computer can be created, moved, modified, grown, shortened, and deleted. In most cases, computer programs that run on the computer handle these operations, but the computer user can also manipulate the files if necessary. For example, Microsoft Word files are typically created and modified by Microsoft Word in response to user commands, but users can also move, rename, or delete those files directly using a file manager program such as Windows Explorer. In Systems Similar to Unix, userspace processes usually don't apply to files at all; The operating system provides a level of abstraction, which means that almost all interactions with files from the user space are through hard links. Solid links allow the name to be With a file (or they may be anonymous - and therefore temporary); files have no names in the OS. For example, a user's space program can't delete a file; he can link to a file (e.g. using a rm or mv shell command or, in an anonymous case, just leaving), and if the kernel determines that there are no more existing links to the file, it can delete the file. In fact, it's really just a core that deals with files, but it serves to process all interactions between the user and the space with (virtual) files in a way that is transparent to the user's space programs. Bit: The bit is simply defined as binary digits, which with 0 to 1 s. Bit is the smallest storage unit. 7 8 8 Number of bits SI prefixes Binary prefixes Title (Symbol) Standard SI Binary Use name (symbol) Value kilobit (kb) kibibit (Kibit) 2 10 megabits (Mbit) mebibit (Mibit) 2 20 gigabit (Gbit) gibit (Gibit) 2 30 tera (Tbit) tebibit (Tibit) 2 40 petabit (Pbit) pebibit (Pibit) 2 50 exabit (Ebit) exbibit (Eibit) 2 60 zettabit (sbit) zebibit (Sibit) 2 70 yottabit (Ybit) yobibit (Yibit) Bit binary figure taking the value to either 0 or 1. Binary numbers are the main unit of information storage and communication in the field of digital computing and digital information theory. Information theory also often uses a natural figure called either nit or nat. The quantum computing also uses cubes, one piece of information that is likely to be true. The bit is also a unit of measurement, an information capacity of one binary digit. It has a bit symbol, or b (see discussion below). Binary figure Claude E. Shannon first used the word bit in his 1948 work Mathematical Communication Theory. He explained its origins by John W. Tooky, who wrote Bell Labs 8 9 9 9 memo on January 9, 1947, in which he contracted binary digits to just bit. Interestingly, Vannevar Bush wrote in 1936 about bits of information that could be stored on the punches used in mechanical computers of the time. A little storage can be both on and off (0). One bit is one or zero, true or false, flag that is on or off, or in general, the amount of information needed to distinguish between two mutually exclusive equally likely states from each other. Gregory Bateson defined a bit as the difference that makes the difference. Parts of representation transfers can be implemented in many forms depending on the context. For example, in digital circuits in most computing devices, as well as flash memory, a little electrical impulse generated by an internal clock in a control unit or data register. For devices that use positive logic, the logical value of 1 (true value) is up to 5 volts, while the logical 0 (false value) is represented by 0 volts. Storage bits are manipulated into the computer's volatile memory, and can be stored permanently on a continuous basis storage device, such as a tape or disk, as well as on optical discs. It is important to distinguish between the use of a bit when discrete storage unit and the use of a bit when using a statistical unit of information. A bit, like a discrete storage device, can by definition only store 0 or 1. The statistical bit is the amount of information that can be stored in a discrete bit on average. Thus, it is the amount of information that is chosen between two equally likely outcomes. One bit corresponds about nats (ln (2)), or Hartley (magazine 10 (2)). 9 10 10 Consider, for example, a computer file with a thousand 0s and 1s that can be compressed without loss into a file of five hundred 0s and 1s (on average, on all files of this kind). The original file, although it has 1,000 bits of storage, has no more than 500 bits of information entropy, as the information is not destroyed as a result without loss of compression. A file can have no more theoretical bits of information than bits of storage. If these two ideas need to be distinguished, sometimes a bit of the name is used when discussing data storage, while Shannon is used for a statistical bit. However, most of the time, the meaning is clear out of context.
Recommended publications
  • MOAT004 1 Eprint Cs.DC/0306067 Computing in High Energy and Nuclear Physics, 24-28 March 2003, La Jolla, California Resources
    Computing in High Energy and Nuclear Physics, 24-28 March 2003, La Jolla, California The AliEn system, status and perspectives P. Buncic Institut für Kernphysik, August-Euler-Str. 6, D-60486 Frankfurt, Germany and CERN, 1211, Geneva 23, Switzerland A. J. Peters, P.Saiz CERN, 1211, Geneva 23, Switzerland In preparation of the experiment at CERN's Large Hadron Collider (LHC), the ALICE collaboration has developed AliEn, a production environment that implements several components of the Grid paradigm needed to simulate, reconstruct and analyse data in a distributed way. Thanks to AliEn, the computing resources of a Virtual Organization can be seen and used as a single entity – any available node can execute jobs and access distributed datasets in a fully transparent way, wherever in the world a file or node might be. The system is built aroun d Open Source components, uses the Web Services model and standard network protocols to implement the computing platform that is currently being used to produce and analyse Monte Carlo data at over 30 sites on four continents. Several other HEP experiments as well as medical projects (EU MammoGRID, INFN GP -CALMA) have expressed their interest in AliEn or some components of it. As progress is made in the definition of Grid standards and interoperability, our aim is to interface AliEn to emerging products from both Europe and the US. In particular, it is our intention to make AliEn services compatible with the Open Grid Services Architecture (OGSA). The aim of this paper is to present the current AliEn architecture and outline its future developments in the light of emerging standards.
    [Show full text]
  • Z/OS ♦ Z Machines Hardware ♦ Numbers and Numeric Terms ♦ the Road to Z/OS ♦ Z/OS.E ♦ Z/OS Futures ♦ Language Environment ♦ Current Compilers ♦ UNIX System Services
    Mainframes The Future of Mainframes Is Now ♦ z/Architecture ♦ z/OS ♦ z Machines Hardware ♦ Numbers and Numeric Terms ♦ The Road to z/OS ♦ z/OS.e ♦ z/OS Futures ♦ Language Environment ♦ Current Compilers ♦ UNIX System Services by Steve Comstock The Trainer’s Friend, Inc. http://www.trainersfriend.com 800-993-8716 [email protected] Copyright © 2002 by Steven H. Comstock 1 Mainframes z/Architecture z/Architecture ❐ The IBM 64-bit mainframe has been named "z/Architecture" to contrast it to earlier mainframe hardware architectures ♦ S/360 ♦ S/370 ♦ 370-XA ♦ ESA/370 ♦ ESA/390 ❐ Although there is a clear continuity, z/Architecture also brings significant changes... ♦ 64-bit General Purpose Registers - so 64-bit integers and 64-bit addresses ♦ 64-bit Control Registers ♦ 128-bit PSW ♦ Tri-modal addressing (24-bit, 31-bit, 64-bit) ♦ Over 140 new instructions, including instructions to work with ASCII and UNICODE strings Copyright © 2002 by Steven H. Comstock 2 z/Architecture z/OS ❐ Although several operating systems can run on z/Architecture machines, z/OS is the premier, target OS ❐ z/OS is the successor to OS/390 ♦ The last release of OS/390 was V2R10, available 9/2000 ♦ The first release of z/OS was V1R1, available 3/2001 ❐ z/OS can also run on G5/G6 and MP3000 series machines ♦ But only in 31-bit or 24-bit mode ❐ Note these terms: ♦ The Line - the 16MiB address limit of MVS ♦ The Bar - the 2GiB limit of OS/390 ❐ For some perspective, realize that 16EiB is... ♦ 8 billion times 2GiB ♦ 1 trillion times 16MiB ❐ The current release of z/OS is V1R4; V1R5 is scheduled for 1Q2004 Copyright © 2002 by Steven H.
    [Show full text]
  • Release 0.5.0 Will Mcgugan
    PyFilesystem Documentation Release 0.5.0 Will McGugan Aug 09, 2017 Contents 1 Guide 3 1.1 Introduction...............................................3 1.2 Getting Started..............................................4 1.3 Concepts.................................................5 1.4 Opening Filesystems...........................................7 1.5 Filesystem Interface...........................................7 1.6 Filesystems................................................9 1.7 3rd-Party Filesystems.......................................... 10 1.8 Exposing FS objects........................................... 10 1.9 Utility Modules.............................................. 11 1.10 Command Line Applications....................................... 11 1.11 A Guide For Filesystem Implementers.................................. 14 1.12 Release Notes.............................................. 16 2 Code Documentation 17 2.1 fs.appdirfs................................................ 17 2.2 fs.base.................................................. 18 2.3 fs.browsewin............................................... 30 2.4 fs.contrib................................................. 30 2.5 fs.errors.................................................. 32 2.6 fs.expose................................................. 34 2.7 fs.filelike................................................. 40 2.8 fs.ftpfs.................................................. 42 2.9 fs.httpfs.................................................. 43 2.10 fs.memoryfs..............................................
    [Show full text]
  • Broadband/IP/Cloud Computing
    Broadband/IP/Cloud Computing Presentation to the Colorado Telecommunications Association www.cellstream.com (c) 2011 CellStream, Inc. 1 www.cellstream.com (c) 2011 CellStream, Inc. 2 www.cellstream.com (c) 2011 CellStream, Inc. 3 www.cellstream.com (c) 2011 CellStream, Inc. 4 www.cellstream.com (c) 2011 CellStream, Inc. 5 Past vs. Present The Past – 20th Century The Present – 21st Century • Peer-to-Peer with broadcast • Many-to-Many with multicast • Mix of Analog and Digital • All media is digital – single • Producers supply transport Consumers • All media is connected • Peer-to-Peer is 1:1 • Many-to-Many is M:N o Traditional Telephone • Producers and Consumers • Broadcast is 1:N do both o Newspaper o CNN takes reports from Twitter o TV/Radio o End users send pictures and reports www.cellstream.com (c) 2011 CellStream, Inc. 6 Where are we in Phone Evolution? PHONE 1.0 PHONE 2.0 PHONE 3.0 Soft phone Your Phone Number Your Phone Number Your Phone Number represents where you represents you represents an IP Address – are (e.g. 972-747- regardless of where you independent of location 0300 is home, 214- are. and appliance you are 405-3708 is work) using (e.g. IP Phone, Cell Phone, PDA, Computer, Television, etc.) www.cellstream.com (c) 2011 CellStream, Inc. 7 Phone 3.X • Examples of Phone 3.0 are Skype, Google Talk, others on a PC. • Phone 3.1 – Skype on an iTouch • Phone 3.2 – Android OS from Google – a phone Centric OS that runs on cellular appliances • Phone 3.3 – Android OS from Google that runs on a Phone Appliance www.cellstream.com (c) 2011 CellStream, Inc.
    [Show full text]
  • Etir Code Lists
    eTIR Code Lists Code lists CL01 Equipment size and type description code (UN/EDIFACT 8155) Code specifying the size and type of equipment. 1 Dime coated tank A tank coated with dime. 2 Epoxy coated tank A tank coated with epoxy. 6 Pressurized tank A tank capable of holding pressurized goods. 7 Refrigerated tank A tank capable of keeping goods refrigerated. 9 Stainless steel tank A tank made of stainless steel. 10 Nonworking reefer container 40 ft A 40 foot refrigerated container that is not actively controlling temperature of the product. 12 Europallet 80 x 120 cm. 13 Scandinavian pallet 100 x 120 cm. 14 Trailer Non self-propelled vehicle designed for the carriage of cargo so that it can be towed by a motor vehicle. 15 Nonworking reefer container 20 ft A 20 foot refrigerated container that is not actively controlling temperature of the product. 16 Exchangeable pallet Standard pallet exchangeable following international convention. 17 Semi-trailer Non self propelled vehicle without front wheels designed for the carriage of cargo and provided with a kingpin. 18 Tank container 20 feet A tank container with a length of 20 feet. 19 Tank container 30 feet A tank container with a length of 30 feet. 20 Tank container 40 feet A tank container with a length of 40 feet. 21 Container IC 20 feet A container owned by InterContainer, a European railway subsidiary, with a length of 20 feet. 22 Container IC 30 feet A container owned by InterContainer, a European railway subsidiary, with a length of 30 feet. 23 Container IC 40 feet A container owned by InterContainer, a European railway subsidiary, with a length of 40 feet.
    [Show full text]
  • Z/OS, Language Environment, and UNIX How They Work Together
    The Trainer’s Friend, Inc. 256-B S. Monaco Parkway Telephone: (800) 993-8716 Denver, Colorado 80224 (303) 393-8716 U.S.A. Fax: (303) 393-8718 E-mail: [email protected] Internet: www.trainersfriend.com z/OS, Language Environment, and UNIX How They Work Together The following terms that may appear in these materials are trademarks or registered trademarks: Trademarks of the International Business Machines Corporation: AD/Cycle, AIX, AIX/ESA, Application System/400, AS/400, BookManager, CICS, CICS/ESA, COBOL/370, COBOL for MVS and VM, COBOL for OS/390 & VM, Common User Access, CORBA, CUA, DATABASE 2, DB2, DB2 Universal Database, DFSMS, DFSMSds, DFSORT, DOS/VSE, Enterprise System/3090, ES/3090, 3090, ESA/370, ESA/390, Hiperbatch, Hiperspace, IBM, IBMLink, IMS, IMS/ESA, Language Environment, MQSeries, MVS, MVS/ESA, MVS/XA, MVS/DFP, NetView, NetView/PC, Object Management Group, Operating System/400, OS/400, PR/SM, OpenEdition MVS, Operating System/2, OS/2, OS/390, OS/390 UNIX, OS/400, QMF, RACF, RS/6000, SOMobjects, SOMobjects Application Class Library, System/370, System/390, Systems Application Architecture, SAA, System Object Model, TSO, VisualAge, VisualLift, VTAM, VM/XA, VM/XA SP, WebSphere, z/OS, z/VM, z/Architecture, zSeries Trademarks of Microsoft Corp.: Microsoft, Windows, Windows NT, Windows ’95, Windows ’98, Windows 2000, Windows SE, Windows XP Trademark of Chicago-Soft, Ltd: MVS/QuickRef Trademark of Phoenix Software International: (E)JES Registered Trademarks of Institute of Electrical and Electronic Engineers: IEEE, POSIX Registered Trademark of The Open Group: UNIX Trademark of Sun Microsystems, Inc.: Java Registered Trademark of Linus Torvalds: LINUX Registered Trademark of Unicode, Inc.: Unicode Preface This document came about as a result of writing my first course for UNIX on the IBM mainframe.
    [Show full text]
  • Jordan Hubbard Apple Computer, Inc. Oh Really?
    *BSD is dying - Anonymous Coward, Slashdot ©1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004 Jordan Hubbard Apple Computer, Inc. Oh really? Let’s look at some stats... FreeBSD Users: 2.5 Million Server Installations (Netcraft) 2,500,000 1,875,000 1,250,000 625,000 0 1993 1997 2001 2003 2004 12 Mac OS X Users: 9 6 3 0 12 Million Jul '01 Oct '01 Jan '02 Apr '02 Jul '02 Oct '02 Jan '03 Apr '03 Jun '03 Oct '03 Oct '04 Applications: FreeBSD ports 12,000 9,000 6,000 10,796 9,662 3,000 6,077 2,723 1,161 0 209 1995 1997 1999 2001 2003 2004 Applications: 12,000 Mac OS X Native 12,000 9,000 6,000 3,000 0 Apr '01 Jul '01 Oct '01 Jan '02 Apr '02 Jul '02 Oct '02 Jan '03 Apr '03 Jun '03 Oct '03 Oct '04 Since the arrival of Mac OS X, BSD has become the biggest desktop UNIX variant on the planet. Yes, even bigger than Linux Take that, Anonymous Coward! Selective overview of Mac OS X Mac OS X Architecture Applications User Interface Application Frameworks Graphics and Media System Services OS Foundation Apple Confidential OS Foundation Usermode BSD Commands and Usermode User FileSystem Libraries Drivers Kernel BSD Kernel IOKit Driver FileSystem Network Families Process Management Drivers Mach Kernel VM Scheduling IPC Open Source “Darwin” base OS Foundation Usermode BSD Commands and Usermode User FileSystem Libraries Drivers Kernel BSD Kernel IOKit Driver FileSystem Network Families Process Management Drivers Mach Kernel VM Scheduling IPC BSD Kernel • FreeBSD 5.1 based (networking, vfs, filesystems, etc) • Unified Buffer Cache (different
    [Show full text]
  • Breaking Through the Myths to Reality: a Future-Proof View Of
    Breaking Through the Myths to Reality A Future-Proof View of Fiber Optic Inspection and Cleaning Dear Viewer: As presented at BICSI® in February- 2018, this seminar has video and animations that Edward J. Forrest, Jr. are not available as a .pdf file. If you would like the RMS(RaceMarketingServices) original version, please contact BICSI or the author. Bringing Ideas Together Caution: This Presentation is going to be controversial! IT IS BASED ON 2,500 YEARS OF SCIENCE AND PRODUCT DEVELOPMENT 2 Fact OR FICTION of Fiber Optic Cleaning and Inspection This seminarWE WILL mayDISCUSS contradictAND currentDEFINE: trends ➢ There➢ Cleaningand are what OTHER you’ve is notWAYS been important…BESIDES taught. VIDEO ➢ ➢➢“Automatic99.9%Debris➢ ➢ExistingA “Reagent FiberonS Detection” CIENTIFICthe standards, Optic surface Grade” ConnectorR isEALITY of such“good Isopropanola fiber… as enough”.is optic a is IECconnector“Pass 61300Let’sanI NSPECTIONanythingeffective- Fail”separate- 3surface-35, is is bettereasy are Factsfiberto is “Best determine thantwoto from optic understand nothing!-dimensional Practice”Fiction cleaner What we’veTwoif the ( ALL-Dimensional connector) been taught/bought/soldand is Structure“clean” over the last 30+Myth yearsfrom may“diameter”. Scientific not be the same Reality thing! 3 Fact OR FICTION of Fiber Optic Cleaning and Inspection ➢ A Fiber Optic Connector is a Two-Dimensional Structure ➢ 99.9% “Reagent Grade” Isopropanol is an effective fiber optic cleaner ➢ Cleaning is not important… anything is better than nothing! ➢ There are OTHER WAYS BESIDES VIDEO INSPECTION to determine if the connector is “clean” ➢ Debris on the surface of a fiber optic connector surface is two-dimensional “diameter”. ➢ “Automatic Detection” is “good enough”.
    [Show full text]
  • Creating User-Mode Device Drivers with a Proxy Galen C
    Creating User-Mode Device Drivers with a Proxy Galen C. Hunt [email protected] Department of Computer Science University of Rochester Rochester, NY 14627-0226 Abstract Writing device drivers is complicated because drivers operate as kernel-mode programs. Device drivers have Writing Windows NT device drivers can be a daunting limited access to other OS services and must be task. Device drivers must be fully re-entrant, must use conscious of kernel paging demands. Debugging only limited resources and must be created with special kernel-mode device drivers normally requires two development environments. Executing device drivers machines: one for the driver and another for the in user-mode offers significant coding advantages. debugger. User-mode device drivers have access to all user-mode libraries and applications. They can be developed using Device drivers run in kernel mode to optimize system standard development tools and debugged on a single performance. Kernel-mode device drivers have full machine. Using the Proxy Driver to retrieve I/O access to hardware resources and the data of user-mode requests from the kernel, user-mode drivers can export programs. From kernel mode, device drivers can full device services to the kernel and applications. exploit operations such as DMA and page sharing to User-mode device drivers offer enormous flexibility for transfer data directly into application address spaces. emulating devices and experimenting with new file Device drivers are placed in the kernel to minimize the systems. Experimental results show that in many number of times the CPU must cross the user/kernel cases, the overhead of moving to user-mode for boundary.
    [Show full text]
  • IBM-IS-DCI-UR-Newsletter.Pdf
    Monthly Newsletter Mar 2016 Monthly Journal on Technology Know-How of IBM’s Technology space Tech Updates on Mainframe Platform “Mainframe“ the IBM Dictionary Of Computing defines "mainframe" as "a large computer, in particular one to which other computers can be connected so that they can share facilities the mainframe provides (for example, a System/370 computing system to which personal computers are attached so that they can upload and download programs and data). The term “Mainframe “ usually refers to hardware only, namely, main storage, execution circuitry and peripheral units“ level, as opposed to trying to do it all from the System z platform. Did you know that mainframes and all other computers have two types of physical storage: Internal and external. Physical storage located on the mainframe processor itself. This is called processor storage, real storage or central storage; think of it as memory for the mainframe. Physical storage external to the mainframe, including storage on direct access devices, such as disk drives and tape drives. This storage is called paging storage or auxiliary storage. The primary difference between the two kinds of storage relates to the way in which it is accessed, as follows: Central storage is accessed synchronously with the processor. That is, the processor must wait while data is retrieved from central storage. Auxiliary storage is accessed asynchronously. The processor accesses auxiliary storage through an input/output (I/O) request, which is scheduled to run amid other work requests in the system. During an I/O request, the processor is free to execute other, unrelated work.
    [Show full text]
  • Dictionary of Ibm & Computing Terminology 1 8307D01a
    1 DICTIONARY OF IBM & COMPUTING TERMINOLOGY 8307D01A 2 A AA (ay-ay) n. Administrative Assistant. An up-and-coming employee serving in a broadening assignment who supports a senior executive by arranging meetings and schedules, drafting and coordinating correspondence, assigning tasks, developing presentations and handling a variety of other administrative responsibilities. The AA’s position is to be distinguished from that of the executive secretary, although the boundary line between the two roles is frequently blurred. access control n. In computer security, the process of ensuring that the resources of a computer system can be accessed only by authorized users in authorized ways. acknowledgment 1. n. The transmission, by a receiver, of acknowledge characters as an affirmative response to a sender. 2. n. An indication that an item sent was received. action plan n. A plan. Project management is never satisfied by just a plan. The only acceptable plans are action plans. Also used to mean an ad hoc short-term scheme for resolving a specific and well defined problem. active program n. Any program that is loaded and ready to be executed. active window n. The window that can receive input from the keyboard. It is distinguishable by the unique color of its title bar and window border. added value 1. n. The features or bells and whistles (see) that distinguish one product from another. 2. n. The additional peripherals, software, support, installation, etc., provided by a dealer or other third party. administrivia n. Any kind of bureaucratic red tape or paperwork, IBM or not, that hinders the accomplishment of one’s objectives or goals.
    [Show full text]
  • A Practical Introduction to Computer Architecture
    A Practical Introduction to Computer Architecture Daniel Page [email protected] h i git # ba293a0e @ 2019-11-14 © Daniel Page [email protected] h i git # ba293a0e @ 2019-11-14 2 © Daniel Page [email protected] h i MATHEMATICAL PRELIMINARIES In Mathematics you don’t understand things. You just get used to them. – von Neumann The goal of this Chapter is to provide a fairly comprehensive overview of theory that underpins the rest of the book. At first glance the content may seem a little dry, and is often excluded in other similar books. It seems clear, however, that without a solid understanding of said theory, using the constituent topics to solve practical problems will be much harder. The topics covered all relate to the field of discrete Mathematics; they include propositional logic, sets and functions, Boolean algebra and number systems. These four topics combine to produce a basis for formal methods to describe, manipulate and implement digital systems. Readers with a background in Mathematics or Computer Science might skip this Chapter and use it simply for reference; those approaching it from some other background would be advised to read the material in more detail. 1 Propositional logic Definition 0.1. A proposition is a statement whose meaning, termed the truth value, is either true or false (less formally, we say the statement is true if it has a truth value of true and false if it has a truth value of false). A given proposition can involve one or more variables; only when concrete values are assigned to the variables can the meaning of a proposition be evaluated.
    [Show full text]