Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 55
Page 132
... expressed . Computer science attacks both of these issues through the use of primitives . A primitive consists of a well - defined semantic structure together with an unambiguous syntax for representing it . Using this approach , the ...
... expressed . Computer science attacks both of these issues through the use of primitives . A primitive consists of a well - defined semantic structure together with an unambiguous syntax for representing it . Using this approach , the ...
Page 209
... expressed as : MOVE TAX TO EXTRA whereas the computation - oriented process of placing the sum of PRICE and TAX in TOTAL might be expressed as : COMPUTE TOTAL = PRICE + TAX In general , any algebraic expression can be used in place of ...
... expressed as : MOVE TAX TO EXTRA whereas the computation - oriented process of placing the sum of PRICE and TAX in TOTAL might be expressed as : COMPUTE TOTAL = PRICE + TAX In general , any algebraic expression can be used in place of ...
Page 231
... expressed by the two clauses : R or Q and R or S ( the clause form of " if ( Q or S ) then R " ) , while requirement B can be expressed as : P or Q or S We now wish to decide what effect these rules have on Sue , a student who has not ...
... expressed by the two clauses : R or Q and R or S ( the clause form of " if ( Q or S ) then R " ) , while requirement B can be expressed as : P or Q or S We now wish to decide what effect these rules have on Sue , a student who has not ...
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