HOME > 상세정보

상세정보

Structured programming with comal : computers and their applications

Structured programming with comal : computers and their applications

자료유형
단행본
개인저자
Atherton, Roy. Meek, Brian.
서명 / 저자사항
Structured programming with comal : computers and their applications / Roy Atherton, Brian Meek.
발행사항
Chester :   Ellis Hrowood Limited,   1982.  
형태사항
266p. : ill. ; 24cm.
ISBN
0853124167
서지주기
Includes bibliographical references and index.
000 00619camuuu200193 a 4500
001 000000921417
005 19990126105232.0
008 961009s1982 enka b 001 0 eng d
020 ▼a 0853124167
040 ▼a 244002 ▼c 244002
049 0 ▼l 151028155 ▼l 151028156
082 0 4 ▼a 001.6424
090 ▼a 001.6424 ▼b A868s
100 1 ▼a Atherton, Roy.
245 1 0 ▼a Structured programming with comal : ▼b computers and their applications / ▼c Roy Atherton, Brian Meek.
260 ▼a Chester : ▼b Ellis Hrowood Limited, ▼c 1982.
300 ▼a 266p. : ▼b ill. ; ▼c 24cm.
504 ▼a Includes bibliographical references and index.
700 1 ▼a Meek, Brian.

소장정보

No. 소장처 청구기호 등록번호 도서상태 반납예정일 예약 서비스
No. 1 소장처 세종학술정보원/인문자료실1(2층)/ 청구기호 001.6424 A868s 등록번호 151028156 도서상태 대출가능 반납예정일 예약 서비스 B M ?
No. 2 소장처 세종학술정보원/보존서고(2층)/ 청구기호 001.6424 A868s 등록번호 151028155 도서상태 대출가능 반납예정일 예약 서비스 B M ?

컨텐츠정보

목차


CONTENTS
Author's Preface = 9
Chapter 1 - Experience of COMAL
 1.1 Introduction = 13
 1.2 Getting Ready = 14
 1.3 Output : The Print Statement = 16
 1.4 Numbers = 16
 1.5 Character Strings = 18
 1.6 The Operating Environment = 19
  1.6.1 Introduction = 19
  1.6.2 Program Entry = 20
  1.6.3 Testing and using Programs = 20
  1.6.4 Editing Programs = 20
  1.6.5 Storing and Retrieving Programs = 21
  1.6.6 Other System commands = 21
 1.7 Random Numbers and Random Characters = 22
Chapter 2 - Simple Data Representation and Movement
 2.1 Data and Information = 25
 2.2 Simple Data Types = 26
  2.2.1 Variables and Identifiers = 26
  2.2.2 Real Variables = 26
  2.2.3 Integer Variables = 27
  2.2.4 String Variables = 27
  2.2.5 Boolean(logical) Variables = 30
 2.3 The Stored Program = 31
 2.4 Input = 34
  2.4.1 READ and DATA Statements = 34
  2.4.2 INPUT Statements = 35
 2.5 Output = 35
  2.5.1 Text Output = 35
  2.5.2 Graphical Output = 36
Chapter 3 - Repetition
 3.1 Repeated Operations-1 FOR Loops = 40
 3.2 Repeated Operations-2 Nested FOR Loops = 42
 3.3 Repeated Operations-3 Repeat Until = 44
 3.4 Program Structure = 45
 3.5 Top Down Analysis and Stepwise Refinement = 48
Chapter 4 - Decisions
 4.1 Binary Decisions = 58
 4.2 Conditional Expressions = 61
 4.3 Worked Examples on Binary Decisions = 66
 4.4 Multiple Decisions-Cases = 71
 4.5 Variable Variables-arrays = 74
Chapter 5 - Modularity and Procedures
 5.1 Simple Procedures = 83
 5.2 Procedure Parameters = 85
  5.2.1 Actual Parameters and Formal Parameters = 85
  5.2.2 Local Variable(Parameter) = 87
  5.2.3 Local Working Variables = 88
 5.3 Modularity = 91
 5.4 Development of Programs = 96
Chapter 6 - Structure Diagrams
 6.1 Graphs of Algorithms = 98
 6.2 Structure Diagrams = 102
  6.2.1 Sequence = 102
  6.2.2 Repetition = 102
  6.2.3 Binary Decisions = 103
  6.2.4 Multiples Decisions = 105
  6.2.5 Procedures = 106
  6.2.6 Connectors = 107
  6.2.7 Creating Space = 107
  6.3.1 Natural Walk Rules = 108
 6.4 Examples of Structure Diagrams = 109
Chapter 7 - Top Down Analysis
 7.1 The Top Down Method = 113
 7.2 A Worked Example = 115
  7.2.1 Problem = 115
  7.2.2 Analysis = 115
  7.2.3 PROCEDURE Letter = 116
  7.2.4 PROCEDURE Nonletter = 116
 7.3 Program Correctness = 119
 7.4 Testing and Debugging = 121
  7.4.1 Variables = 121
  7.4.2 Control Structures = 121
  7.4.3 Loops = 122
  7.4.4 Decisions = 122
  7.4.5 Procedures and Functions = 122
  7.4.6 Control Paths = 122
  7.4.7 Data = 122
  7.4.8 Field Testing = 122
  7.4.9 Debugging = 123
Chapter 8 - More about Structures and Control
 8.1 Repetition = 125
  8.1.1 FOR Loops = 125
  8.1.2 WHILE Loops = 127
 8.2 Decisions = 129
 8.3 Procedures = 131
  8.3.1 The Post Holes Problem = 131
  8.3.2 Reference Parameters = 133
 8.4 Functions = 134
  8.4.1 A Random Number Generator = 135
 8.5 Recursion = 136
 8.6 The GOTO Statement = 139
Chapter 9 - Structured Programming with BASIC
 9.1 BASIC = 143
  9.1.1 FOR loop = 144
  9.1.2 CONDITIONAL Statement = 144
  9.1.3 GOTO Statement = 144
  9.1.4 Multiple Branching = 144
  9.1.5 Subroutine = 145
  9.1.6 Random Number Function = 145
 9.2 Structural Principles and Rules = 145
 9.3 BASIC Constructs = 146
  9.3.1 FOR loop = 146
  9.3.2 REPEAT loop = 147
  9.3.3 Binary Decision = 147
  9.3.4 Procedure = 148
  9.3.5 WHILE loop = 149
  9.3.6 Multiple Decision = 149
  9.3.7 A Complete Program = 150
Chapter 10 - Sort Processes
 10.1 Introduction = 153
 10.2 Selections Sorts = 154
 10.3 Insertion Sorts = 156
 10.4 Exchange Sorts = 158
  10.4.1 Bubblesort = 158
  10.4.2 Shakersort = 160
  10.4.3 Quicksort = 162
Chapter 11 - Internal Data Structures
 11.1 The Concept of Structured Data = 167
 11.2 Simple Data Structures of COMAL = 168
  11.2.1 Numeric Arrays = 168
  11.2.2 String Arrays = 174
 11.3 Simple Derived Data Structures = 177
  11.3.1 Conceptual Structures = 177
  11.3.2 Queues = 177
  11.3.3 Stacks = 186
  11.3.4 Trees = 189
Chapter 12 - External Data Structures - Files
 12.1 Types of Files = 195
 12.2 File Concepts = 196
 12.3 Serial or Sequential Files = 200
  12.3.1 File operations = 198
  12.3.2 Searching a Sequential File = 200
  12.3.3 Data Validation = 201
 12.4 Direct Access or Random Access Files = 204
 12.5 File Handling = 205
Bibliography = 212
Appendices
 Ⅰ Problem Grading System = 214
 Ⅱ Notes on Comal Syntax = 216
  Notes on Metanic Comal = 224
 Ⅲ ASCII Code = 227
 Ⅳ Notes on SBAS - Structured BASIC for RML 380Z = 228
Solutions to Problems = 231
Index = 263


관련분야 신착자료

윤지선 (2026)
고려대학교. D-HUSS사업단 (2025)
한국일본학회 (2025)