Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 56
Page 54
... fields , called the exponent field and the mantissa field . Let us designate the next three bits as the exponent field and the remaining four bits as the mantissa field . The byte is therefore divided as shown in Figure 1-23 . We ...
... fields , called the exponent field and the mantissa field . Let us designate the next three bits as the exponent field and the remaining four bits as the mantissa field . The byte is therefore divided as shown in Figure 1-23 . We ...
Page 55
... field from left to right , starting with the first nonzero bit in the binary representation . At this point , the byte looks like : 1001 We must now fill in the exponent field . To this end , we imagine the contents of the mantissa field ...
... field from left to right , starting with the first nonzero bit in the binary representation . At this point , the byte looks like : 1001 We must now fill in the exponent field . To this end , we imagine the contents of the mantissa field ...
Page 327
... field in each record as the key field . Our first task is to convert any key field value into a numeric value . This step may seem meaningless to you since the key field is , in fact , the employee identifi- cation number . However ...
... field in each record as the key field . Our first task is to convert any key field value into a numeric value . This step may seem meaningless to you since the key field is , in fact , the employee identifi- cation number . However ...
Other editions - View all
Common terms and phrases
abstract data type activities actually algorithm Alice application application software array assign binary bit patterns block bulk storage called Carol Chapter COBOL concept contains current entry Current Pointer data control block data flow diagram database declare search deleted diagram disk employee example execution Figure FILLED-BY FORTRAN hashed head pointer hexadecimal identify implemented input insertion sort instruction integer linked list loop machine language machine's memory main memory memory cells modified module move notation operating system password perform pivot entry problem produce program counter programming languages pseudocode Questions/Exercises queue record relation represented request result retrieve routines schedule search a failure search a success search tree sequence sequential file solution solving stack statement step storage system stored string subprogram syntax tape target value task technique terminal time-sharing translator Turing machine