An Introduction to Computer Science: A Structured Problem-solving ApproachGeneral literature -- Introductory and Survey. |
Contents
Algorithms | 80 |
Solution Structures and Representation | 123 |
UNIT II | 193 |
Copyright | |
11 other sections not shown
Common terms and phrases
algorithm arithmetic assembly language assigned assume base binary tree byte Character Array complement control processor correct COUNT decimal Declare defined deleted digit discussion disk divisor element End-for End-if End-while equal error example execution expression F-Block FLAG FORTRAN function given greatest common divisor hexadecimal implementation initial input data input/output instruction integer iteration logical loop magic square memory method node Note null characters NUM1 NUM2 obtained octal one's complement operand operation output partial product performed pointer position postcondition prime number printed programming language queue record Repeat represented result SCORE secondary storage selection structure sequential shown in Figure solution sort stack step storage stored string subproblem subprogram SUBROUTINE symbol Table task TEMP terminates truth table two's complement variable word zero