DOCSLIB.ORG

Unit 3 Operating System

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Unit 3 Operating System UNIT 3 OPERATING SYSTEM STRUCTURE 3.1 Objective 3.2 Programming Language 3.3 Operating System 3.3.1 Single User Operating system 3.3.2 Batch Operating System 3.3.3 Real time Operating system 3.3.4 Multi users operating system 3.3.5 Distributed Operating System 3.3.6 Embedded Operating System 3.3.7 Network Operating System 3.8 Local Area Network (LAN) 3.9 Wide Area Network (WAN) 3.10 Popular Operating Systems 3.10.1 Windows 3.10.2 Mac OS X 3.10.3 UNIX 3.10.4 Linux 3.11 Application Software 3.12 Virus and other destructive programmes 3.13 Don’ts while running software 3.14 Do’s while running of software 3.15 Future trends in operating system 3.16 Let us sum up 3.17 Model Answers to check your progress 3.1 OBJECTIVE In units 1 and 2, we have discussed about hardware components of the computer. This unit is about software component of computer. A computer is a dead machine without software. Software is the soul of computer. It brings life to computer and induces work environment conducive for users. After reading this unit, you will be able: 1 To explain role of software, To classify software on the basis of its functions, To understand functions of the operating system, and To understand different types of operating system 3.2 PROGRAMMING LANGUAGES Computer works on sequentially arranged instructions. Sequence of related instructions is called programme. Computer programmes are also known as software. Thus, the term software denotes predefined sequence of instructions used to execute specific tasks. Programmes are written with special languages understood by computer. Languages used to write programmes are called programming languages. Programming languages are classified into two categories i.e. high level and low-level languages. The low level programming languages provide little or no abstraction from computers’ instructions set architecture of a CPU. The Instructions set in low-level languages is highly depend on microprocessor’s architecture. Thus, programmes designed with low level language are not portable from one microprocessor to another. Programmes in low-level language are very lengthy. It is difficult to understand and amend these programmes. Many household electronic applications such as microwave ovens, washing machines, dishwashers etc are programmed on low-level languages. The instructions set of CPU is known as machine language. Programmes written in low-level languages are executed directly by the CPU. Thus, the execution of programme is fast, when it is designed in low-level languages. Therefore, low-level languages are used to design applications run in the real time mode. Applications, which function under the real time mode, are characterized by its ability to generate results within specific time limits. Low-level languages are also used for writing system programmes, these programmes control PC and attached peripherals. System programmes are discussed latter in this unit. Assembly language and machine codes are examples of the low-level language. Low-level language has poor presence in office environment. A high level programming language is based on strong abstraction. It is close to natural language used for human communication. Programmes written in high-level language are easy to read, write and edit. Plankalkul programming language designed by Konrad Zuse is considered as the first high level programming language. These languages hide the details of CPU’s architecture and memory management from programmers. Thus, programmes written in high language are portable from one computer to another. Ada, Algol, Basic, COBOL, FORTRAN and Pascal are example of the high-level language. High and low level languages are relative terms. Some decades ago, the C language was considered as high-level language. However many programmers, today, might refer C language as low-level language. Similarly, at one time, Assembly language was treated as high-level language, now it was treated as low-level language. Instruction set of microprocessor in the form of binary language is known as machine language of that microprocessor. Every instruction in machine language consists of two parts. The first part of each instruction is command to microprocessor to perform specific task. The second 2 component of instruction has detail about data being used in executing command reflected in the first part of the instruction. The second part may be address of memory location where data is stored or value of data directly. Programmes written in machine language run very fast as microprocessor directly executes programme without any interpreter. Machine language has no abstraction. It is difficult for human to remember instructions codes in the binary form. Programmes written in machine language are very lengthy. These Programmes have low portability across computers as these programmes are written for specific computer architecture or microprocessor. Machine language is used mainly to write system programmes to control devices because speed of execution is the first priority in writing such programmes. Programmers can easily remember instructions set in the form of codes rather as series of 0 and 1. We use symbols instead of binary numbers for first and second parts (command and address of data respectively) of instructions set of machine language. This abstraction is known as assembly language. Every microprocessor has its own assembly language, which is not portable to microprocessors of other families. Assembly languages of microprocessors of same family have certain resemblance. Assembly language of every new microprocessor is compatible with assembly languages of old microprocessors of the same family. Programmers can easily develop programmes in assembly language of new microprocessor, when its assembly language is compatible with well established assembly languages. Programmes designed for earlier microprocessors can be run of new microprocessor with slight modification due to this compatibility. Microprocessor converts programme written in assembly language in to machine language before executing it. The advantages and limitations of assembly language are similar to those of machine language. We have discussed in the unit 1 that computer execute programmes and instructions in binary form only. You may use high or low languages for writing programmes but computer understands and execute programmes written in the binary form. Programmes written in any other language is translated into binary language before execution. Programmes written in high- level languages are translated into low-level language with the help of compiler or interpreter before execution. Compiler converts the whole programme into low level before execution. Interpreter converts each line into low language and executes it and then converts next line and executes it. This process continues until the end of the programme. Compiler converts and stores programmes into low-level language. Compiler checks and converts programmes line by line from high to low language. Whenever, compiler notices any error in programme, compiler list- out errors on monitor or paper and halts the compilation of programme. Programmers remove the listed errors and start the compilation of programme from the beginning. This process is repeated until all errors in programmes are removed. Once all errors are removed, compiler generates and saves compiled copy of the programme. Computer will use the compiled version of programmes and execute it directly without any support from compiler and programme written in high-level language. However, interpreter converts programme written in high-level language into low level language; each time programme is executed. Thus, execution of programme with interpreter is time consuming. Interpreter is mainly used for debugging of the programme. Table 1 Comparison of Compiler and Interpreter Compiler Interpreter Scans the entire programme first for syntax Translates and run programme line by line. 3 errors in coding and then translates it into machine code. Converts the entire program to machine code; Programme is converted into low language before execution. The execution takes place and executed line by line from the beginning, only when all the syntax errors in the coding each time you run the programme. Every line are removed and entire programme is complied is checked for syntax error and then into low language converted into equivalent machine code before execution Debugging of programme is slow. Debugging Debugging of programme is fast. is a process of testing programmes for Programmes can be easily tested for errors robustness and syntax errors. It is conducted and robustness. Programmer’s prefer to use during the development phase of a software interpreter for debugging of programmes Execution time is less as programme is Execution time is more in using interpreter as compiled only once. Later, only compiled it converts and executes the entire version of the programme is used for programme line by line into machine execution. language each time you run the programme. 3.3 OPERATING SYSTEM Till 1960s, computers were built to execute single task like a calculator. Operating system was not needed to run computer at that time. Computer either completed task or crashed in case of error in the programme. As computer evolved, it was involved in processing multiple tasks at a time. Computer needed a programme to share and manage resources of computer among various applications running at a time. Programmes of this category are known as operating system or system programmes. Operating system is large size software capable of controlling the computer system independently. Operating system is an integral component of a computer. It is referred as the soul of the computer. Operating system can be defined as collection of programmes, which controls and manages operations of computer and connected peripherals. It manages memory, computation resources, input and output devices. Operating systems is like a manager of a store, who keeps proper account of inventory of the stock in the store, attends needs of customers, records financial transactions and places order to suppliers. A manager manages these activities without bothering to customers.
Load more

Recommended publications
  • Xerox 4890 Highlight Color Laser Printing System Product Reference
    XEROX Xerox 4890 HighLight Color Laser Printing System Product Reference Version 5.0 November 1994 720P93720 Xerox Corporation 701 South Aviation Boulevard El Segundo, California 90245 ©1991, 1992, 1993, 1994 by Xerox Corporation. All rights reserved. Copyright protection claimed includes all forms and matters of copyrightable material and information now allowed by statutory or judicial law or hereinafter granted, including without limitation, material generated from the software programs which are displayed on the screen such as icons, screen displays, looks, etc. November 1994 Printed in the United States of America. Publication number: 721P82591 Xerox® and all Xerox products mentioned in this publication are trademarks of Xerox Corporation. Products and trademarks of other companies are also acknowledged. Changes are periodically made to this document. Changes, technical inaccuracies, and typographic errors will be corrected in subsequent editions. This book was produced using the Xerox 6085 Professional Computer System. The typefaces used are Optima, Terminal, and monospace. Table of contents 1. LPS fundamentals 1-1 Electronic printing 1-1 Advantages 1-1 Highlight color 1-2 Uses for highlight color in your documents 1-2 How highlight color is created 1-2 Specifying 4890 colors 1-3 Color-related software considerations 1-4 Adding color to line printer and LCDS data streams 1-4 Adding color to Interpress and PostScript data streams 1-5 Adding color to forms 1-6 Fonts 1-8 Acquiring and loading fonts 1-9 LPS production process overview 1-9 Ink referencing 1-10 Unformatted data 1-10 Formatted data 1-11 4890 HighLight Color LPS major features 1-11 4890 feature reference 1-12 LPS connection options 1-12 System controller 1-13 Optional peripheral cabinet 1-13 Printer 1-13 Paper handling 1-14 Forms 1-15 Fonts 1-15 Printed format 1-15 Highlight color 1-16 Types of output 1-16 DFA/Segment Management 1-16 SCSI System Disk/Floppy Disk 1-18 Color Enhancements 1-18 XEROX 4890 HIGHLIGHT COLOR LPS PRODUCT REFERENCE iii TABLE OF CONTENTS 2.
    [Show full text]
  • Msc THESIS Exploiting the Reconfigurability of Ρ-VEX Processor for Real-Time Robotic Applications
    Computer Engineering 2016 Mekelweg 4, 2628 CD Delft The Netherlands http://ce.et.tudelft.nl/ MSc THESIS Exploiting the Reconfigurability of ρ-VEX Processor for Real-Time Robotic Applications Muhammad Muneeb Yousaf Abstract Autonomous mobile robots generally have limited computational power on-board, and they have to perform their tasks in real-time in order to interact with their surroundings effectively. Therefore, there is a need to utilize the available computational capabilities ef- ficiently. The ρ-VEX is a run-time reconfigurable VLIW processor. CE-MS-2016-10 This unique processor allows separation of its issue lanes to form independently operating processing cores. Switching between these configurations during run-time allows optimizing the computing re- sources for the task(s) it is performing. In this project FreeRTOS is ported to the ρ-VEX processor and a control layer is developed. FreeRTOS manages the applications based on given real time parameters. The control layer decides the number of active cores (hardware contexts) and issue width of each core to best match the processing requirements of the applications. In this way, FreeRTOS and the control layer together can reconfigure the number of active cores at run-time. This is a very unique feature of this thesis project and can not be found in any other multicore implementation of FreeRTOS. The control layer along with FreeR- TOS provides the user a facility to run applications under real-time constraints and with the best possible efficiency. In order to evaluate the performance, the overhead of the FreeRTOS is quantified and a performance comparison is made between several configurations of this system.
    [Show full text]
  • TCD-SCSS-T.20121208.032.Pdf
    AccessionIndex: TCD-SCSS-T.20121208.032 Accession Date: 8-Dec-2012 Accession By: Prof.J.G.Byrne Object name: Burroughs 1714 Vintage: c.1972 Synopsis: Commercial zero-instruction-set computer used by the Dept.Computer Science from 1973-1979. Just two prototyping boards survive. Description: The Burroughs 1714 was one of their B1700 family, introduced in 1972 to compete with IBM's System/3. The original research for the B1700 series, initially codenamed the Proper Language Processor or Program Language Processor (PLP) was done at the Burroughs Pasadena plant. The family were known as the Burroughs Small Systems, as distinct from the Burroughs Medium Systems (B2000, etc) and the Burroughs Large Systems (B5000, etc). All the Burroughs machines had high-level language architectures. The large were ALGOL machines, the medium COBOL machines, but the small were universal machines. The principal designer of the B1700 family was Wayne T. Wilner. He designed the architecture as a zero-instruction-set computer, an attempt to bridge the inefficient semantic gap between the ideal solution to a particular programming problem and the real physical hardware. The B1700 architecture executed idealized virtual machines for any language from virtual memory. It achieved this feat by microprogramming, see the microinstruction set further below. The Burroughs MCP (Master Control Program) would schedule a particular job to run, then preload the interpreter for whatever language was required into a writeable control store, allowing the machine to emulate the desired virtual machine. The hardware was optimised for this. It had bit-addressable memory, a variable-width ALU, could OR in data from a register into the instruction register (for very efficient instruction parsing), and the output of the ALU was directly addressable as X+Y or X-Y read-only registers.
    [Show full text]
  • Considerations for the SDP Operating System
    DocuSign Envelope ID: E376CF60-053D-4FF0-8629-99235147B54B Considerations for the SDP Operating System Document Number .......SDP Memo 063 ………………………………………………………………… Document Type .. MEMO ……………………………………………………………………… ………… Revision . 01 ………………………………………………………………………… ………… ………… Author . N. Erdödy, R. O’Keefe ………………………………………………………………………… … Release Date ... .2018-08-31 …………………………………………………………………………… … Document Classification ... Unrestricted ………………………………………………………………… Status ... Draft ………………………………………………………………………………………… … Document No: 063 Unrestricted Revision: 01 Author: N. Erdödy ​ Release Date: 2018-08-31 Page 1 of 56 DocuSign Envelope ID: E376CF60-053D-4FF0-8629-99235147B54B Lead Author Designation Affiliation Nicolás Erdödy SDP Team Open Parallel Ltd. NZ SKA Alliance (NZA). Signature & Date: 10/21/2018 8:19:36 PM PDT With contributions and reviews Affiliation greatly appreciated from Dr. Richard O’Keefe SDP Team, NZA University of Otago - Open Parallel (NZA) Dr. Andrew Ensor Director, NZA AUT University (NZA) Piers Harding SDP Team, NZA Catalyst IT (NZA) Robert O’Brien Systems Engineer / Security Independent Anonymous Reviewer CEng (UK), CPEng (NZ) Manager, NZ Govt ORGANISATION DETAILS Name Science Data Processor Consortium Address Astrophysics Cavendish Laboratory JJ Thomson Avenue Cambridge CB3 0HE Website http://ska-sdp.org Email [email protected] Document No: 063 Unrestricted Revision: 01 Author: N. Erdödy ​ Release Date: 2018-08-31 Page 2 of 56 DocuSign Envelope ID: E376CF60-053D-4FF0-8629-99235147B54B 1. SDP Memo Disclaimer The SDP memos are designed to allow the quick recording of investigations and research done by members of the SDP. They are also designed to raise questions about parts of the SDP design or SDP process. The contents of a memo may be the opinion of the author, not the whole of the SDP. Acknowledgement: The authors wish to acknowledge the inputs, corrections and continuous support from the NZA Team Members Dr.
    [Show full text]
  • BCIS 1305 Business Computer Applications
    BCIS 1305 Business Computer Applications BCIS 1305 Business Computer Applications San Jacinto College This course was developed from generally available open educational resources (OER) in use at multiple institutions, drawing mostly from a primary work curated by the Extended Learning Institute (ELI) at Northern Virginia Community College (NOVA), but also including additional open works from various sources as noted in attributions on each page of materials. Cover Image: “Keyboard” by John Ward from https://flic.kr/p/tFuRZ licensed under a Creative Commons Attribution License. BCIS 1305 Business Computer Applications by Extended Learning Institute (ELI) at NOVA is licensed under a Creative Commons Attribution 4.0 International License, except where otherwise noted. CONTENTS Module 1: Introduction to Computers ..........................................................................................1 • Reading: File systems ....................................................................................................................................... 1 • Reading: Basic Computer Skills ........................................................................................................................ 1 • Reading: Computer Concepts ........................................................................................................................... 1 • Tutorials: Computer Basics................................................................................................................................ 1 Module 2: Computer
    [Show full text]
  • Newsletter #9-#10
    PASCAL USER'S GROUP Pascal. News (FORMERLY PASCAL NEWSLETTER) NUMBERS 9 AND 10 (COMBINED ISSUE) COMMUNICATIONS ABOUT THE PROGRAMMING LANGUAGE PASCAL BY PASCALERS SEPTEMBER" 1977 (Y)o TAB LEO F CON TEN T S N I'- '0 U'I C/I tG c.. U'I '-tG 0.0 C c.. tG o POLICY: Pascal News wtG::.::- 3 . 0.0 M 1 ALL PURPOSE COUPON ~ C/I tG "tJ_ "tJ LU .- 3 EDITOR'S CONTRIBUTION .- .&; :>'Ou tG (Y) .- 4 HERE AND THERE QI'-3 4 News .. ..... 8 Conferences (I) .... 8 Books and Articles Ct: m 11 Past Issues of Pascal Newsletter .... 11 PUG Finances ..J X 12 Roster LU ....== 39 ART! CLES ~. 39 "Pascal at Sydney University" - A. J. Gerber andC. C. Morgan 40 "Disposing of Dispose" - Stephen P. Wagstaff 42 "What is a Textfile?" - William C. Price 43 "Generic Routines and Variable Types in Pascal II - B. Austermuehl and H.-J. Hoffmann 47 OPEN FORUM FOR MEMBERS 54 Special Topic: Micro/Personal Computers and Pascal 58 Special Topic: Pascal Standards L 60 IMPLEMENTATION NOTES 60 Checklist 60 General Information ".. 61 Software Writing Tools 61 Portable Pascals 63 Pascal Variants 64 Feature Implementation Notes 73 Machine Dependent Implementations 113 POLICY: Pascal User's Group r- ! POLICY: PASCAL NEWS (77/09/01) * Pascal News is the official but informal publication of the User's Group. ~ Pascal News contains all we (the editors) know about Pascal; we use it as the vehicle to answer all inquiries because our physical energy and resources for answering individual requests are finite. As PUGgrows, we unfortunately succumb to the reality of (1) having to insist that people who need to know "about Pascal" join PUGand read Pascal News - that is why we spend time to produce it! and (2) refusing to return phone calls or answer letters full of questions - we will pass the questions on to the readership of Pascal News.
    [Show full text]
  • Correctional Data Analysis Systems. INSTITUTION Sam Honston State Univ., Huntsville, Tex
    I DocdnENT RESUME ED 209 425 CE 029 723 AUTHOR Friel, Charles R.: And Others TITLE Correctional Data Analysis Systems. INSTITUTION Sam Honston State Univ., Huntsville, Tex. Criminal 1 , Justice Center. SPONS AGENCY Department of Justice, Washington, D.C. Bureau of Justice Statistics. PUB DATE 80 GRANT D0J-78-SSAX-0046 NOTE 101p. EDRS PRICE MF01fPC05Plus Postage. DESCRIPTORS Computer Programs; Computers; *Computer Science; Computer Storage Devices; *Correctional Institutions; *Data .Analysis;Data Bases; Data Collection; Data Processing; *Information Dissemination; *Iaformation Needs; *Information Retrieval; Information Storage; Information Systems; Models; State of the Art Reviews ABSTRACT Designed to help the-correctional administrator meet external demands for information, this detailed analysis or the demank information problem identifies the Sources of teguests f6r and the nature of the information required from correctional institutions' and discusses the kinds of analytic capabilities required to satisfy . most 'demand informhtion requests. The goals and objectives of correctional data analysis systems are ontliled. Examined next are the content and sources of demand information inquiries. A correctional case law demand'information model is provided. Analyzed next are such aspects of the state of the art of demand information as policy considerations, procedural techniques, administrative organizations, technology, personnel, and quantitative analysis of 'processing. Availa4ie software, report generators, and statistical packages
    [Show full text]
  • Operating Systems
    Operating Systems Julian Bradfield [email protected] IF{4.07 Course Aims I general understanding of structure of modern computers I purpose, structure and functions of operating systems I illustration of key OS aspects by example Course Outcomes By the end of the course you should be able to I describe the general architecture of computers I describe, contrast and compare differing structures for operating systems I understand and analyse theory and implementation of: processes, resource control (concurrency etc.), physical and virtual memory, scheduling, I/O and files In addition, during the practical exercise and associated self-study, you will: I become familiar (if not already) with the C language, gcc compiler, and Makefiles I understand the high-level structure of the Linux kernel both in concept and source code I acquire a detailed understanding of one aspect (the scheduler) of the Linux kernel Course Outline This outline is subject to modification during the course. I Introduction; history of computers; overview of OS (this lecture) I Computer architecture (high-level view); machines viewed at different abstraction levels I Basic OS functions and the historical development of OSes I Processes (1) I Processes (2) { threads and SMP I Scheduling (1) { cpu utilization and task scheduling I Concurrency (1) { mutual exclusion, synchronization I Concurrency (2) { deadlock, starvation, analysis of concurrency I Memory (1) { physical memory, early paging and segmentation techniques I Memory (2) { modern virtual memory concepts and techniques I I/O (1) { low level I/O functions I I/O (2) { high level I/O functions and filesystems I Case studies: one or both of: the Windows NT family; IBM's System/390 family { N.B.
    [Show full text]
  • Sumy State University Group IN-02 SH Zolotova EL Adviser an Assembly
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Electronic Sumy State University Institutional Repository ASSEMBLY LANGUAGE A.I.Titenko – Sumy State University group IN-02 S.H. Zolotova E L Adviser An assembly language is a low-level programming language for computers, microprocessors, microcontrollers, and other programmable devices in which each statement corresponds to a single machine language instruction. An assembly language is specific to a certain computer architecture, in contrast to most high-level programming languages, which may be more portable. Assembly language allows the programmer to use symbolic representation for machine operation codes (usually called mnemonics), memory locations, registers and other parts of an instruction. A utility program called an assembler is used to translate assembly language statements into the target computer's machine code. In normal professional usage, the term assembler is used to refer both to an assembly language, and to software which assembles an assembly-language program. Thus: "CP/CMS was written in S/360 assembler" as well as "ASM-H was a widely-used S/370 assembler." Many assemblers offer additional mechanisms to facilitate program development, control the assembly process, and aid debugging. Assemblers often include a macro facility (described below), and are called macro assemblers. An assembler creates object code by translating assembly instruction mnemonics into opcodes, and by resolving symbolic names for memory locations and other entities. The use of symbolic references is a key feature of assemblers, saving tedious calculations and manual address updates after program modifications. Most assemblers also include macro facilities for performing textual substitution—e.g., to generate common short sequences of instructions as inline, instead of called subroutines.
    [Show full text]
  • An Advanced Transportable Operator Training Simulator
    AN ADVANCED TRANSPORTABLE OPERATOR TRAINING SIMULATOR J.G. Waight, K. Nodehi, M. Rafian, H. Van Meeteren* A. Bose Empros Systems International Arizona State University R. Wasley E. Stackfleth E. Dobrowolski Macro Corporation Hughes Training Systems Philadelphia Electric Company ABSTRACT widely accepted in other contexts, was first introduced as a tool for operator training with the announcement and demonstration Since the introduction of the first Dispatcher Training of the Dispatcher Training Simulator (DTS) at PICA in 1977 [1]. Simulator (DTS) at PICA in 1977, DTS systems have evolved in This DTS had limited capabilities in terms of model size and in scope, complexity and performance. This paper outlines the the fidelity of the simulation, the User Interface, and the control design of an advanced, transportable Operator Training functions. Simulator (OTS) which was developed as part of EPRI research project 1915-2. Advanced modeling technology and instructor In the following years many vendors introduced DTS systems, capabilities are described along with training examples which mostly integrated with new energy management systems [2], demonstrate the capabilities of this OTS. [3], [4], [5]. Model sizes grew, and improvements were made in the fidelity of the training devices. Yet certain limitations persisted especially in the area of simulation of complex INTRODUCTION voltage phenomena, in instructor tools, and in capabilities for trainee evaluation. The Electric Power Research Institute During the past few decades, the complexity of the job of the undertook the development of an advanced Operator Training power system control center operator has increased Simulator (OTS) with improvements over other simulators then dramatically. Several factors have contributed to this change in on the market.
    [Show full text]
  • MODULES PROGRAM STRUCTURES and the STRUCTURING of OPERATING SYSTEMS
    MODULES PROGRAM STRUCTURES and the STRUCTURING OF OPERATING SYSTEMS C. Bron Department of Electrical Engineering Twente University of Technology P.O. Box 217, Enschede, Netherlands Abstract In this paper some views are presented on the way in which complex systems, such as Operating Systems and the programs to be interfaced with them can be constructed, and how such systems may become heavily library oriented. Although such systems have a dynamic nature, all interfacing within and among modules can be checked statically. It will be shown that the concepts presented are equally valid for single user systems, multi-programming systems and even distributed systems. The ideas have been spurred by the implementation of a modular version of Pascal and a supporting Operating System, currently nearing completion at Twente University of Technology, The Netherlands. 136 I. Co-operating Modules 1.! Modules The basic progra~ing tool we consider in this paper is a module. This concept is incorporated in several recent languages (ADA[I] (where it is called "package"), Concurrent Pascal[61 ( where it is called "classY'), Pascal Plus[17], LIS[13], MESA[15], Modula[19~, Modula-2[20~ and many others). Although details may differ from one language to another, the following description should suffice for the sake of this paper: A module is a set of related (type-)definitions, data declarations, operation declarations (viz. procedures and/or functions) and a section describing the initialization (sometimes also the finalization~ as in Pascal Plus) of the module's local data. In order that programs (or systems) may be composed from co-operating modules some of the declarations within modules may have to be mede accessible outside these modules.
    [Show full text]
  • P.O. #255L5-O-R{C
    Spec #25 169-3990-IMLlrn (re-bid) P.O. #255L5-o-r{c 1' /hit ¿flgcecneDt, made this ¡ day of : A.D.2007 Between the COUNTY OF MONTGOMERY, Pennsylvania, hereinafter called Party of th,l First Part, and DATA MANAGEMENT INTERNATIONALE, a Corporation, with principal pla,:e of business at 55 Lukens Drive, New Castle, DE 19720 hereinafter called Party of the Second Part. WITNESSETH, that the said Party of the Second Part, for and in consideration of the paynrents hereinafter specified and agreed to be made by the Party of the First Part to the said Party of the Second Part, hereby covenants and agrees to and with the said Party of the First Part, to furnish and rleliver all Iabor, materials, equipment, and/or supplies required to be furnished and delivered, being: Furnishing and delivering of electronic digital copies of an estimated 8,000 rolls, more or less, c,f film for the Prothonotary of Montgomery County, Swede and Airy Streets, Norristown, PA 1g40.1, and in strict and exact accordance with the bid, proposal and/or specifications, which said bid, ¡rroposal and specifications are hereby made a part of this agreement by reference thereto as fully to all intents and purposes and to the same extent as though herein set out at length. It is further agreed that in case any of the said labor, materials, equipment and/or supplies iurnished and delivered under this contract are rejected by the authorized or proper County Agent as unsr¡ir.able or unfit, such labor, materials, equipment, and/or supplies so rejected shall be removed at once by the,
    [Show full text]