RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      Construction of data processing software

      한글로보기

      https://www.riss.kr/link?id=M560350

      • 저자
      • 발행사항

        Englewood Cliffs, N.J. : Prentice-Hall International, c1984

      • 발행연도

        1984

      • 작성언어

        영어

      • 주제어
      • DDC

        005.1005.74 판사항(20)

      • ISBN

        0131686755

      • 자료형태

        단행본(다권본)

      • 발행국(도시)

        New Jersey

      • 서명/저자사항

        Construction of data processing software / John Elder.

      • 형태사항

        xiv, 432 p. : ill. ; 23 cm.

      • 총서사항

        Prentice-Hall international series in computer science

      • 일반주기명

        Includes index.
        Bibliography: p. 418-419.

      • 소장기관
        • 경남대학교 중앙도서관 소장기관정보 Deep Link
        • 경희대학교 국제캠퍼스 도서관 소장기관정보
        • 국립중앙도서관 국립중앙도서관 우편복사 서비스
        • 국립한국해양대학교 도서관 소장기관정보
        • 성신여자대학교 도서관 소장기관정보
        • 이화여자대학교 도서관 소장기관정보 Deep Link
        • 인천대학교 학산도서관 소장기관정보
      • 0

        상세조회
      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      목차 (Table of Contents)

      • CONTENTS
      • PREFACE = xii
      • PART 1 - FILES AND FILE PROCESSING
      • 1. INTRODUCTION TO DATA PROCESSING = 1
      • 1.1 What is data processing? = 1
      • CONTENTS
      • PREFACE = xii
      • PART 1 - FILES AND FILE PROCESSING
      • 1. INTRODUCTION TO DATA PROCESSING = 1
      • 1.1 What is data processing? = 1
      • 1.2 Structure of data processing systems = 4
      • 1.3 The Model Savings Bank Limited = 9
      • 1.4 Commercial programming languages = 14
      • 2. PROGRAM AND DATA ABSTRACTIONS = 16
      • 2.1 The programming language Pascal = 17
      • 2.2 Abstract data types = 23
      • 2.3 The library = 28
      • 2.4 Concurrent processes = 31
      • 3. FILES = 37
      • 3.1 Introduction = 37
      • 3.2 Characteristics of magnetic storage media = 41
      • 3.2.1 Magnetic tape = 41
      • 3.2.2 File labels = 46
      • 3.2.3 Variable-length records = 46
      • 3.2.4 Magnetic disk = 47
      • 3.2.5 Applications appropriate to tape and disk = 50
      • 3.3 File organization methods = 51
      • 3.3.1 Sequential file organization = 51
      • 3.3.2 Random file organization = 53
      • 3.3.3 Indexed file organization = 59
      • 3.3.4 Inverted file organization = 64
      • 3.4 Access methods = 66
      • 3.4.1 Sequential access = 66
      • 3.4.2 Direct access = 67
      • 3.4.3 Indexed access = 67
      • 3.4.4 Dynamic access = 71
      • 3.4.5 Choosing a method of file organization = 71
      • 3.5 Basic file manipulation operations = 72
      • 3.5.1 Abstraction of the file-processing environment = 73
      • 3.5.2 Abstraction of a serial-access file = 76
      • 3.5.3 Abstraction of a direct-access file = 77
      • Exercises = 79
      • 4. FILE UPDATING = 82
      • 4.1 The problem = 82
      • 4.2 Program structure = 84
      • 4.3 The direct-access file update = 86
      • 4.4 The serial-access file update = 91
      • 4.5 The real-time file update = 94
      • 4.6 File security = 95
      • 5. PROCESSING SEQUENTIAL FILES = 97
      • 5.1 Introduction = 97
      • 5.2 Specification of a sequential file abstraction = 99
      • 5.3 Merging sequential files = 108
      • 5.4 Case study: sequential master file initialization = 110
      • 5.4.1 Specification of numeric and string abstractions = 112
      • 5.4.2 Specification of text file abstractions = 118
      • 5.4.3 Program implementation = 120
      • 5.5 Case study: sequential master file update = 125
      • 5.6 implementation of sequential files = 135
      • 5.6.1 The environment = 135
      • 5.6.2 Abstraction of a file block = 136
      • 5.6.3 implementation details = 138
      • Exercises = 145
      • 6. VALIDATION OF INPUT DATA FILES = 146
      • 6.1 Data input = 146
      • 6.2 Coding schemes = 148
      • 6.2.1 Some coding schemes = 149
      • 6.3 Data validation programs = 153
      • 6.4 Case study: transactions validation program = 154
      • Exercises = 167
      • 7. SORTING FILES = 169
      • 7.1 External sorting = 170
      • 7.1.1 Balanced N-way merge sorting = 170
      • 7.1.2 Von Neumann merge sort = 172
      • 7.1.3 Unbalanced merge sort = 173
      • 7.1.4 Polyphase merge sort = 175
      • 7.2 Internal sorting = 180
      • 7.2.1 Straight selection sort = 180
      • 7.2.2 Quicksort = 181
      • 7.2.3 Heapsort = 184
      • 7.3 An external sorting abstraction = 189
      • 7.4 Case study: sorting the valid transactions file = 195
      • Exercises = 198
      • 8. PROCESSING INDEXED SEQUENTIAL FILES = 201
      • 8.1 Introduction = 201
      • 8.2 Specification of an indexed sequential file abstraction = 204
      • 8.2.1 Sequential access = 206
      • 8.2.2 Indexed access = 208
      • 8.2.3 Dynamic access = 210
      • 8.3 Case study: indexed sequential master file initialization = 211
      • 8.4 Case study: indexed sequential master file update = 215
      • 8.5 Physical file structure = 218
      • 8.6 An implementation of indexed sequential files = 221
      • 8.6.1 The block control abstraction = 221
      • 8.6.2 Implementation details = 222
      • Exercises = 230
      • 9. PROCESSING RANDOM ORGANIZATION FILES = 231
      • 9.1 Introduction = 231
      • 9.2 Addressing algorithms = 233
      • 9.3 Specification of a random file abstraction = 237
      • 9.3.1 Sequential access = 239
      • 9.3.2 Direct access = 240
      • 9.3.3 Dynamic access = 241
      • 9.4 Case study: random organization master file initialization = 242
      • 9.5 Case study: random organization master file update = 245
      • 9.6 Implementation of random files = 248
      • Exercises = 253
      • 10. REPORT PRODUCTION = 254
      • 10.1 Introduction = 254
      • 10.2 Designing a report generation program = 262
      • 10.2.1 The input file structure = 262
      • 10.2.2 The report program structure = 265
      • 10.3 Resolving the structural clash = 275
      • Exercises = 277
      • PART 2 - FILE PROCESSING IN COBOL
      • 11. AN INTRODUCTION TO COBOL = 281
      • 11.1 An overview of COBOL = 281
      • 11.2 Structure of COBOL programs = 282
      • 11.2.1 The four divisions = 282
      • 11.2.2 Notation for defining COBOL syntax rules = 285
      • 11.2.3 Presentation of COBOL programs = 286
      • 11.3 An example COBOL program = 287
      • Exercises = 300
      • 12. BASICCOBOLDATAANDPROGRAMSTRUCTURES = 301
      • 12.1 Data in COBOL = 301
      • 12.1.1 Basic data types = 301
      • 12.1.2 Usage = 303
      • 12.1.3 Synchronization = 304
      • 12.1.4 Justification = 306
      • 12.1.5 Initialization = 307
      • 12.1.6 Records = 308
      • 12.1.7 Redefinition of data structures = 310
      • 12.1.8 Tables = 311
      • 12.2 Arithmetic facilities = 314
      • 12.2.1 Assignment = 314
      • 12.2.2 Arithmetic = 315
      • 12.3 Program sequence control in COBOL = 318
      • 12.3.1 Composition = 318
      • 12.3.2 Program termination = 320
      • 12.3.3 Unconditional branching = 320
      • 12.3.4 Alternation = 320
      • 12.3.5 Selection = 323
      • 12.3.6 Procedurization = 324
      • 12.3.7 Repetition = 326
      • 12.4 Low volume input and output = 327
      • 12.5 String handling = 330
      • 12.5.1 The INSPECT verb = 331
      • 12.5.2 Edited data items = 334
      • 12.6 Table handling = 337
      • 12.7 The COBOL Library = 340
      • Exercises = 343
      • 13.SEQUENTIAL FILES = 346
      • 13.1 File descriptions in COBOL = 346
      • 13.1.1 File descriptions in the ENVIRONMENT DIVISION = 346
      • 13.1.2 File descriptions in the DATA DIVISION = 348
      • 13.2 Sequential file processing in COBOL = 350
      • 13.3 Case study: sequential master file initialization = 355
      • 13.4 Case study: sequential master file update = 358
      • Exercises = 364
      • 14. DATA VALIDATION = 365
      • 14.1 Data validation features in COBOL = 365
      • 14.2 Case study: transactions validation program = 368
      • Exercises = 373
      • 15. SORTING IN COBOL = 374
      • 15.1 The SORT verb = 374
      • 15.2 Case study: sorting the valid transactions file = 377
      • Exercises = 381
      • 16.INDEXED SQUENTIAL FILES = 382
      • 16.1 Indexed sequential file processing in COBOL = 382
      • 16.1.1 File descriptions = 382
      • 16.1.2 Sequential access = 383
      • 16.1.3 Random access = 384
      • 16.1.4 Dynamic access = 385
      • 16.2 Case study: indexed sequential master file initialization = 386
      • 16.3 Case study: indexed sequential master file update = 388
      • Exercises = 391
      • 17. RELATIVE FILES = 392
      • 17.1 Random files in COBOL = 392
      • 17.1.1 Relative file descriptions = 392
      • 17.1.2 Sequential access = 393
      • 17.1.3 Random access = 394
      • 17.1.4 Dynamic access = 395
      • 17.2 Case study: relative master file initialization = 395
      • 17.3 Case study: relative master file update = 398
      • Exercises = 401
      • 18. REPORT WRITING IN COBOL = 402
      • 18.1 Case study: implementing the report program in COBOL = 402
      • 18.2 The COBOL Report Writer = 407
      • 18.3 Report Writer Declaratives = 416
      • BIBLIOGRAPHY = 418
      • APPENDIX: SOLUTIONS TO SELECTED EXERCISES = 420
      • INDEX = 428
      더보기

      온라인 도서 정보

      온라인 서점 구매

      온라인 서점 구매 정보
      서점명 서명 판매현황 종이책 전자책 구매링크
      정가 판매가(할인율) 포인트(포인트몰)
      예스24.com

      Construction of Data Processing Software

      판매중 92,400원 83,160원 (10%)

      종이책 구매

      4,160포인트 (5%)
      • 포인트 적립은 해당 온라인 서점 회원인 경우만 해당됩니다.
      • 상기 할인율 및 적립포인트는 온라인 서점에서 제공하는 정보와 일치하지 않을 수 있습니다.
      • RISS 서비스에서는 해당 온라인 서점에서 구매한 상품에 대하여 보증하거나 별도의 책임을 지지 않습니다.

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼