Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 81
Page 80
... produces a single result . ( In contrast , consider an operation that finds the values that , when squared , produce a given positive number . It accepts one operand and produces two results ; for example , given the operand 4 , it will ...
... produces a single result . ( In contrast , consider an operation that finds the values that , when squared , produce a given positive number . It accepts one operand and produces two results ; for example , given the operand 4 , it will ...
Page 82
... produce a result with 1s in its most significant 4 bits and a a copy of the other operand in the least significant 4 ... produce bytes with parity bits equal to 0 , the OR operation along with the mask 10000000 can be used to produce ...
... produce a result with 1s in its most significant 4 bits and a a copy of the other operand in the least significant 4 ... produce bytes with parity bits equal to 0 , the OR operation along with the mask 10000000 can be used to produce ...
Page 232
... produce the empty state- ment . Conversely , if repeated resolution produces the empty statement , that state- ment must have been produced by resolving two contradictory statements , each of which was obtained from the original ...
... produce the empty state- ment . Conversely , if repeated resolution produces the empty statement , that state- ment must have been produced by resolving two contradictory statements , each of which was obtained from the original ...
Contents
Contents | 1 |
PART ONE Machine Architecture | 19 |
Data Manipulation | 61 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
abstract data type activities actually algorithm Alice application application software array ASCII assign binary bit patterns block bulk storage called Carol Chapter concept consider contains current entry Current Pointer data structures data types database declare search deleted devices diagram disk employee example execution Figure goal hash head pointer hexadecimal identified implemented input insertion sort instruction integer key field linked list loop machine language machine's memory main memory memory cells modified module move notation operating system parity bit password perform pivot entry position problem produce program counter programming languages pseudocode Questions/Exercises queue record represented request result retrieve routines search tree Section sequence sequential file solution solving sort algorithm stack statement step storage system stored string subprogram Tail pointer tape target value task technique terminal Turing machine two's complement