`
`and
`
`Handbook
`
`THIRD EDITION
`
`by
`
`Charles J. Sippl
`
`and
`
`Roger J. Sippl
`
`Howard llJ. Soms & Co., Inc.
`4300 WEST BEND ST. INDIANAPOLIS,
`INDIANA 46268 USA
`
`PMC Exhibit 2029
`
`Apple v. PMC
`|PR2016-00755
`
`Page 1
`
`PMC Exhibit 2029
`Apple v. PMC
`IPR2016-00755
`Page 1
`
`
`
`Copyright © 1966, 1972, and 1980 by Howard W.
`Sams 8: Co., Inc.
`
`Indianapolis, Indiana 46268
`
`THIRD EDITION
`FIFTH PRINTING—4983
`
`All rights reserved. No part of this book shall be
`reproduced, stored in a retrieval system, or transmitted
`by any means, electronic, mechanical, photocopying,
`recording, or otherwise, without written permission
`from the publisher. No patent liability is assumed
`with respect to the use of the information contained
`herein. While every precaution has been taken in
`the preparation of this book,
`the publisher
`assumes no responsibility for errors or omissions.
`Neither is any liability assumed for damages
`resulting from the use of the information contained
`herein.
`
`International Standard Book Number: 0-672-21632-9
`
`Library of Congress Catalog Card Number: 79-67133
`
`Printed in the United States of America.
`
`PMC Exhibit 2029
`
`Apple v. PMC
`|PR20-16-00755
`
`Page 2
`
`PMC Exhibit 2029
`Apple v. PMC
`IPR2016-00755
`Page 2
`
`
`
`exchange device .
`
`.
`
`.
`
`execution time
`
`.
`
`_ “In”. device. rernote computing cyc—
`‘x'.m..—']‘he exchange device controls
`the flow of information between the
`computer and the terminals. Characters
`[wed at the terminals are sent to the
`computer one line at a tune vta the ex-
`change device. The computer returns
`ah answer
`to the exchan e device.
`which, in turn. sends It to t_e proper
`terminal.
`_1 he exchan e device allows
`each terminal to sen
`or receive data
`independent of all other terminals.
`“"9" di"—. 5" “Change where all
`exsfilbscribers originate their calls bY diaL
`ing-
`"flhgnge instruction—An instruction to
`replace the contents of one register (or
`set of registers) With the contents ol'an-
`other and vice versa.
`
`exchonge, monUoI—An exchange where
`calls are routed by an operator.
`.xchonge, message — A device placed be-
`tween :1 communication line and a com-
`puter in order to take care of certain
`communication functions and thereby
`free the computer for other work.
`
`exchange, storoge -- Smltt’ as memory ex-
`change.
`exclusive NOR gate—SN gate. exclusive
`NOR.
`
`exclusive OR — A Boolean lo ic operation
`performed between 5 eci ed registers
`on a bu-by-btt basis.
`'
`lo ic one is left
`in the results register ifeit ter bit in any
`bit position of either register is a one. A
`logic zero is left if both are a logic one
`or both are a logic zero.
`exclusive OR function — A lo ic operation
`in which the result is logica ly true when
`only one inpttl function is true. and false
`when both inputs are true or false.
`exclusive OR, logical—Smite as gate. ex-
`clusuve OR.
`
`exclusive segments—See segments. ex-
`clusrve.
`
`
`
`execute cycle -~ The portion of the opera-
`tional sequence ofa computer when the
`actions required to perform an instruc-
`tion are actually accomplished. Occurs
`after a "fetch" cycle has obtained an in-
`struction from memory.
`execute phose — l. The part of the com-
`
`puter operating cycle wherein a com-
`mand in the program register is carried
`out u on the address indicated. ‘2. The
`
`act 0 performing a command.
`execution -— The processes which are per-
`formed by computer devices and cir-
`cuitry which accomplish a particular in-
`struction or design.
`
`execution cycle—That portion of a ma-
`chine cycle during which the actual exe-
`cution of the instruction takes
`lace.
`Some operations (e.g.. divide. mu tiply}
`may need a large number ol‘these oper-
`ation cycles to complete the operation.
`and the normal
`instruction/operation
`alternation will be held up during this
`time. Also called operation cycle.
`execution-error
`detection — Detection
`concerned with those errors detected
`
`during the execution ol'the user's pro-
`gram. 'l‘hey include errors that are de-
`teclable only during program execution
`(e.g.. invalid subscript value. reference
`to an undefined variable. arithmetic
`spills. etc.) along with those errors of
`completeness detected because either
`(1) they were disregarded by the user
`when previously detected or (2)
`they
`were not detected in the first place be-
`cause the user did not indicate that his
`
`program was completed.
`execution
`errors,
`remote-computing—
`Sfl errors. execution (remote-comput-
`ing system}.
`execution,
`interpretive—Permits reten«
`tion of all of the information contained
`
`in the user's original source statements.
`thereby
`rnalung
`source-language
`debug ing possible. interpretive execu-
`tion. p tts tnulliprogramming. make the
`conversational mode of operation a
`practical reality.
`execution,
`looping—See looping execu-
`llOl'l.
`
`execution of on instruction—'l'hc set of
`
`elementary steps carried out by the
`Computer to produce the result spe-
`cified by the operation code of the in-
`strttction.
`
`execution path ——The principal course or
`line of direction taken by a computer in
`the execution of a routine, directed by
`the logic ofthe program and the nature
`of the data.
`
`execution tlrne— l. The sum total of the
`
`amount oftime required to complete a
`given command. ‘2. The portion of an
`Instruction cycle during which the ac-
`I91
`
`PMC Exhibit 2029
`
`Apple v. PMC
`|PR2016-00755
`
`Page 3
`
`PMC Exhibit 2029
`Apple v. PMC
`IPR2016-00755
`Page 3
`
`