DOCSLIB.ORG

Modellierung & Programmierung II

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Modellierung & Programmierung II Übung - Modellierung & Programmierung II Mathias Goldau, Stefan Koch, Wieland Reich [email protected] [email protected] [email protected] Organisatorisches • Anmeldung: 1. Lernserver: http://informatik.uni-leipzig.de/ifi/studium/lernserver.html 2. Moodle: https://moodle2.uni-leipzig.de/ Einschreibeschlüssel: mup2_0XX, XX 2 f01,02,..,10g • Problem? Neuigkeiten auf Lehrstuhlseite! Immernoch? Übungsleiter kontaktieren! • Übungsserien via Moodle: • 5 Serien je 4 Aufgaben + 1 Zusatzaufgabe • Abgabe per Moodle • Alle Lösungen in ein Archiv zusammenfassen (bspw. ZIP) • Alle Gruppen haben einen gemeinsamen Ausgabe- und Abgabetermin, jeweils zu Beginn und Ende des Übungsblocks • Besprechung im nächsten Seminar soweit als möglich. • Problem mit Kontrolle? Kontrolleur kontaktieren! Immernoch? Übungsleiter kontaktieren! Mathias Goldau, Stefan Koch, Wieland Reich Übung - Modellierung & Programmierung II Organisatorisches • Zulassungsvoraussetzung für Klausur: mindestens 30 Punkte • Konsulationen zu Sprechstunden • Neugikeiten auf Lehrstuhlseite: Lehre > MuP2 Mathias Goldau, Stefan Koch, Wieland Reich Übung - Modellierung & Programmierung II Outline 1 Einleitung Mathias Goldau, Stefan Koch, Wieland Reich Übung - Modellierung & Programmierung II Programmiersprachen • Dienen zur Kommunikation von Menschen mit einem Computer • Synthetisch und exakt • Es gibt mehr als 8500 Programmiersprachen 1 • Historischer Abriss: http://en.wikipedia.org/wiki/History_of_programming_languages • Gibt es die “beste” Programmiersprache? • Eine Sprache ist Turing-Vollständig gdw Sie alle Funktionen berechnen kann welche auch eine Turing-Maschine berechnen kann.2 • Die meisten Programmiersprachen sind Turing-Vollständig 1 Thomas J. (Tim) Bergin. “A history of the history of programming languages”. In: Com. ACM 50.5 (2007), S. 69–74 2 Vgl. Berechenbarkeitstheorie. Mathias Goldau, Stefan Koch, Wieland Reich Übung - Modellierung & Programmierung II 1954 1957 1960 1965 1970 1975 1980 1985 1990 1995 2000 PostScript PostScript level 2 PostScript level 3 1982 1992 september 11, 1996 OO Forth 1987 Forth FIG-Forth Forth-83 ANS Forth ISO Forth 1968 1978 1983 1986 1997 Logo Object Logo Tcl Tcl/Tk Tcl/Tk 8.1 Tcl/Tk 8.2.3 Tcl/Tk 8.3 1968 1986 mid 1988 end 1988 april 1999 dec. 16, 1999 october 22, 2001 FORTRAN I FORTRAN II FORTRAN III FORTRAN IV FORTRAN IV FORTRAN V Fortran 90 ISO FORTRAN (Fortran 66 ANS) (Fortran 77 ANSI) Fortran 95 ISO november 1954 october 1956 1957 end-1958 1962 1991 december 15, 1997 1966 april 1978 A A+ Prolog Prolog II Prolog III 1988 1992 Prolog IV 1970 october 1982 1984 1997 J K Sharp APL 1990 1996 JOSS TELCOMP MUMPS MUMPS (ANSI) MUMPS (FIPS) MUMPS ISO M M ANSI Open M M ISO 1964 1965 1966 september 15, 1977 1986 1992 1994 dec 8, 1995 1999 Modula 3 Delphi dec 11, 1995 Delphi 5 Delphi 6 1988 march 2, 1995 august, 1999 may 1, 2001 APL APL 2 APL96 1960 august 1984 1996 B ABC 1981 1987 Python Python 1.5.2 Python 1.6 Python 2.0 Python 2.1 Python 2.2 1991 april 13, 1999 april 17, 2001 Object Pascal Borland september 5, 2000 october 16, 2000 december 21, 2001 1985 Turbo Pascal B-O Flow-Matic COBOL COBOL 61 COBOL 61 COBOL COBOL 68 ANS COBOL 74 ANSI COBOL 85 ISO/ANSI OO COBOL 1957 1958 1959 1961 Extended 1965 1968 1974 1985 1997 1962 Rex 1.00 Rex 2.00 Rex 3.00 Rexx 3.20 ANSI Rexx Object Rexx may 1979 1980 1982 1984 february 25, 1997 Pascal Pascal AFNOR 1970 1983 Oberon Oberon-2 Active Oberon 1987 1991 Modula-2 ISO 2001 PL/M Modula Modula 2 Modula-2 ISO 1972 1979 june 1, 1996 Generic Extension 1975 Ada Ada 83 ANSI Ada ISO Ada 95 december 19, 1998 january 1983 1995 1979 1987 NetRexx C# PL/I PL/1 ANS NetRexx 1.150 C# 1964 1976 1991 july 23, 1999 (ECMA) Concurrent C june 26, 2000 december 13, 2001 1984 ISO C CPL BCPL B C (K&R) ANSI C ISO C ISO C (C99) C Classic C (C89) (C90) (C95) 1963 july 1967 1969 1971 1978 december 1, 1999 1989 december 15, 1990 april 1, 1996 JScript JScript JOVIAL JOVIAL I JOVIAL II JOVIAL 3 Objective-C may 1996 1959 1960 1961 1965 1983 LiveScript JavaScript 2.0 Cmm JavaScript JavaScript 1.5 (draft 1) CORAL 64 CORAL 66 1992 1995 december 1995 C with Classes C++ ARM C++ C++98 ANSI/ISO february 18, 1999 1964 1966 april 1980 1989 1998 CLU july 1983 ECMAScript ECMAScript ed3 1974 june 1997 december 1999 Simula I Simula 67 Java 2 (v1.3) Java 2 (v1.4) Oak Java 1 Java 2 (v1.2) early access 1964 1967 june 1991 may 23, 1995 december 8, 1998 may 8, 2000 ALGOL W Mesa february 6, 2002 1977 Ruby IAL ALGOL 58 ALGOL 60 1966 ALGOL 68 Cedar Ruby 0.95 Ruby 1.1 alpha 0 Ruby 1.3.2 february 24, 1993 august 13, 1997 Ruby 1.6.1 Ruby 1.6.5 1958 1958 1960 december 1983 december 1995 april 2, 1999 september 27, 2000 september 19, 2001 1968 GOGOL GOGOL III Smalltalk Smalltalk-72 Smalltalk-74 Smalltalk-76 Smalltalk-78 Smalltalk-80 ANSI Smalltalk 1964 1967 1971 1972 1974 1976 1978 1980 may 19, 1998 sed Self Self 4.0 Self 4.1 Sail 1973 Mainsail Eiffel Eiffel 2 Eiffel 3 july 10, 1995 Eiffel 4 Eiffel 4.2 ISE Eiffel 5 august 7, 2001 1968 1975 1986 1988 1993 december 11, 1996 february 6, 1998 2001 ISWIM awk nawk PHP/FI PHP 2.0 PHP 3.0 PHP 4.0 PHP 4.1.0 1966 1978 1985 1995 june 6, 1998 may 22, 2000 KRC Sather 0.1 Sather 1.0 Sather 1.1 nov. 13, 1997 Sather 1.2.1 december 8, 2001 1981 june 1991 mid-1994 september 1995 csh november 4, 1999 october 1978 SASL Perl 2.000 Perl 3.000 Perl 4.000 Perl 5.000 Perl 5.005_50 Perl 5.6.0 Perl 5.7,0 Perl 1.000 july 26, 1998 1976 Miranda december 18, 1987 january 5, 1988 october 18, 1989 march 21, 1991 october 18, 1994 march 28, 2000 september 2, 2000 1982 Objective Caml O’Caml 2 O’Caml 3.00 O’Caml 3.02 O’Caml 3.03 O’Caml 3.04 sh 1996 O’Caml 1.0.7 1969 december 11, 1997 1998 june 2000 july 30, 2001 dec 10, 2001 dec 12, 2001 MS Basic 2.0 BASICA GW-Basic QuickBasic 1.0 QuickBasic 4.5 MS Basic PDS 7.0 MS PDS 7.1 Visual Basic 3.0 Visual Basic 4.0 Visual Basic 5.0 Visual Basic 6.0 VB.NET BASIC 1989 Visual Basic 1.0 Visual Basic 2.0 may 1, 1964 july 1975 1981 1983 1985 1988 1990 may 20, 1991 march 1992 june 93 september 1995 april 1997 june 16, 1998 (Visual Basic 7.0) Clos 2001 Lisp Lisp 1 Lisp 1.5 Common Lisp 1989 Common Lisp ANSI 1958 1959 1962 1984 december 8, 1994 Scheme Scheme MIT Scheme 84 Scheme IEEE Scheme R5RS 1975 1978 1984 1990 1998 Haskell 1.0 Haskell 1.1 Haskell 1.2 Haskell 1.3 Haskell 1.4 Haskell 98 1987 april 1, 1990 march 1992 may 1996 april 1997 february 1999 ML SML SML ‘90 SML ‘97 1973 1984 1990 1997 SL5 Icon Unicon Languages SNOBOL SNOBOL 2 SNOBOL 3 SNOBOL 4 1976 1977 Caml 2-6.1 2001 february 27, 2011 Caml Caml 3.1 1962 april 1964 1965 1967 1987 1991 1993 © Éric Lévénez 1999-2011 <http://www.levenez.com/lang/> 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 PostScript level 3 PostScript level 3 v 3016 v 3017 2003 september 11, 2005 Tcl/Tk 8.4 Tcl/Tk 8.4.1 Tcl/Tk 8.4.2 Tcl/Tk 8.4.3 Tcl/Tk 8.4.4 Tcl/Tk 8.4.5 Tcl/Tk 8.4.6 Tcl/Tk 8.4.7 Tcl/Tk 8.4.8 Tcl/Tk 8.4.9 Tcl/Tk 8.4.11 Tcl/Tk 8.4.12 Tcl/Tk 8.4.13 Tcl/Tk 8.4.14 Tcl/Tk 8.4.15 Tcl/Tk 8.5 Tcl/Tk 8.5.5 Tcl/Tk 8.5.6 Tcl/Tk 8.5.7 Tcl/Tk 8.5.9 september 10, 2002 october 22, 2002 march 3, 2003 may 20, 2003 july 22, 2003 november 24, 2003 march 1, 2004 july 25, 2004 nov. 22, 2004 december 7, 2004 june 28, 2005 december 6, 2005 april 19, 2006 october 19, 2006 may 25, 2007 december 20, 2007 october 15, 2008 january 2009 april 15, 2009 september 8, 2010 Fortran 2000 Fortran 2003 Fortran 2008 (draft) september 2010 september 30, 2002 november 30, 2004 M ISO january 6, 2005 Delphi 7 Delphi 8 Delphi 2005 Delphi 2006 Delphi 2007 Delphi 2009 Delphi 2010 october 30, 2005 march 2007 august 2008 august 2009 august 6, 2002 november 2003 november 2004 Python 3.0a2 Python 3.0.1 Python 3.1 Python 3.2 december 7, 2007 Python 3.0 june 27, 2009 december 3, 2008 february 13, 2009 february 20, 2011 Python 2.2.1 Python 2.2.2 Python 2.3a2 Python 2.2.3 Python 2.3 Python 2.3.1 Python 2.3.2 Python 2.3.3 Python 2.3.4 Python 2.4 Python 2.4.1 Python 2.4.2 Python 2.5 Python 2.5.1 Python 2.6 Python 2.6.1 Python 2.6.2 Python 2.6.3 Python 2.7 Python 2.7.1 april 10, 2002 october 14, 2002 february 19, 2003 may 30, 2003 july 29, 2003 september 23, 2003 october 3, 2003 december 19, 2003 may 27, 2004 november 30, 2004 march 30, 2005 september 28, 2005 september 19, 2006 april 19, 2007 october 1, 2008 december 4, 2008 april 14, 2009 october 2, 2009 july 4, 2010 november 27, 2010 COBOL 2002 ISO/ANSI december 2002 Ada 2006 (draft) Ada 2005 2005 C# C# 2.0 march 9, 2007 (beta) C# 2.0 (ISO) november 2005 march 28, 2003 july 2003 C# 3.0 (beta) C# 3.0 C# 3.5 C# 4.0 september 2005 november 6, 2006 november 19, 2007 april 12, 2010 Objective-C 2.0 Objective-C 2.1 august 7, 2006 august 28, 2009 JavaScript 2.0 Java 2 (v6.0 beta) Java 6 update 2 Java 6 update 7 Java 6 update 11 Java 6 update 14 Java 6 update 24 (draft 4) Java 6 july 11, 2008 december 2004 december 11, 2006 july 5, 2007 december 2, 2008 june 10, 2009 february 15, 2011 april 26, 2002 C++03 ISO/IEC C++0x draft 2003 C++1x draft ECMAScript ed4 (draft) 2008 july 22, 2009 Java 2 (v1.5.0) 2002 Java 2 Java 2 (v5.0 update 3) Java 2 (v5.0 update 12) Java 2 (v5.0 update 16) Java 2 (v5.0 update 17) Java 2 (v5.0 update 18) Java 2 (v1.4.0_01) Java 2 (v1.4.1_03) (beta 1) Java 2 (v5.0) (beta 2) Java 2 (v5.0) Java 2 (v5.0 update 8) Java 2 (v5.0 update 21) Java 2 (v1.4.1) (v1.4.1_02) june 11, 2003 june 28, 2004 september 30, 2004 april 28, 2005 august 11, 2006 may 31, 2007 july 11, 2008 december 2, 2008 march 24, 2009 september 11, 2009 june 4, 2002 september 2002 february 27, 2003 Java 2 (v1.4.2) Java 2 (v1.4.2_01) Java 2 (v1.4.2_02) february
Load more

Recommended publications
  • Functional Thinking
    Functional Thinking director / software architect NEAL FORD meme wrangler ® ThoughtWorks [email protected] 2002 Summit Boulevard, Atlanta, GA 30319 nealford.com thoughtworks.com memeagora.blogspot.com @neal4d 1 a metaphor an essay a history lesson 2 3 4 new language: easy new paradigm: hard 5 “functional” is more a way of thinking than a tool set 6 Execution in the Kingdom of Nouns Steve Yegge http://steve-yegge.blogspot.com/ 2006/03/execution-in-kingdom-of-nouns.html 7 v e r b s ! 8 ! 9 http://oreilly.com/news/languageposter_0504.html 1954 1957 1960 1965 1970 1975 1980 1985 1990 1995 2000 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 PostScript level 3 PostScript level 3 PostScript PostScript level 2 PostScript level 3 v 3016 v 3017 1982 1992 september 11, 1996 OO Forth 2003 september 11, 2005 1987 Forth FIG-Forth Forth-83 ANS Forth ISO Forth 1968 1978 1983 1986 1997 Logo Object Logo Tcl Tcl/Tk Tcl/Tk 8.1 Tcl/Tk 8.2.3 Tcl/Tk 8.3 Tcl/Tk 8.4 Tcl/Tk 8.4.1 Tcl/Tk 8.4.2 Tcl/Tk 8.4.3 Tcl/Tk 8.4.4 Tcl/Tk 8.4.5 Tcl/Tk 8.4.6 Tcl/Tk 8.4.7 Tcl/Tk 8.4.8 Tcl/Tk 8.4.9 Tcl/Tk 8.4.11 Tcl/Tk 8.4.12 Tcl/Tk 8.4.13 Tcl/Tk 8.4.14 Tcl/Tk 8.4.15 Tcl/Tk 8.5 Tcl/Tk 8.5.5 Tcl/Tk 8.5.6 Tcl/Tk 8.5.7 Tcl/Tk 8.5.9 1968 1986 mid 1988 end 1988 april 1999 dec.
    [Show full text]
  • BBN and Computer Technology Timeline 1948 • Establishment Of
    BBN and Computer Technology Timeline 1948 • Establishment of Bolt Beranek and Newman Inc. (BBN) 1958 • Purchase of BBN's first computer, an LPG-30, manufactured by the Royal McBee Company 1959 • Purchase of PDP-1 from the Digital Equipment Corporation (DEC); Serial #0 [??] 1960 • Design of a priority-interrupt system for the PDP-1. • Development of Cyclops, an AI program for pattern recognition. 1962 • Public demonstration of computer time-sharing. 1963 • Demonstration of Data Dial, a modem to enable remote communication with computers by telephone. 1964 • Public demonstration of a computer-based communications system for the Massachusetts General Hospital. • Development of MENTOR and the SOCRATIC SYSTEM, systems for computer- based mixed-initiative tutoring. 1965 • Development of TELCOMP, an interactive computer language. • Development of the Grafacon, a tablet for scanning and digitizing graphic data. • Publication of Libraries of the Future, a consideration of the implications of computer technology for future libraries, based on a project for the Council of Library Resources. 1966 • Creation of LOGO, a computer programming language designed especially for use by children. 1967 • Formation of Time Share Ltd., a subsidiary offering computing services in the UK. 1968 • Development of packet-switching protocols for the ARPANET 1969 • Launching of the ARPANET; demonstration of four-node network. • Automation of odd-lot stock transactions for the Pacific Coast Stock Exchange. • Grammatical analysis of English text by augmented transition networks. 1970 • Development of TENEX, a virtual-memory operating system for DEC computers. • Demonstration of SCHOLAR, a computer-based system that modeled a Socratic tutor. • 1971 Transmission of person-to-person email message using the @ sign.
    [Show full text]
  • Learning to Code
    PART ILEARNING TO CODE How Important is Programming? “To understand computers is to know about programming. The world is divided… into people who have written a program and people who have not.” Ted Nelson, Computer Lib/Dream Machines (1974) How important is it for you to learn to program a computer? Since the introduction of the first digital electronic computers in the 1940s, people have answered this question in surprisingly different ways. During the first wave of commercial computing—in the 1950s and 1960s, when 1large and expensive mainframe computers filled entire rooms—the standard advice was that only a limited number of specialists would be needed to program com- puters using simple input devices like switches, punched cards, and paper tape. Even during the so-called “golden age” of corporate computing in America—the mid- to late 1960s—it was still unclear how many programming technicians would be needed to support the rapid computerization of the nation’s business, military, and commercial operations. For a while, some experts thought that well-designed computer systems might eventually program themselves, requiring only a handful of attentive managers to keep an eye on the machines. By the late 1970s and early 1980s, however, the rapid emergence of personal computers (PCs), and continuing shortages of computer professionals, shifted popular thinking on the issue. When consumers began to adopt low-priced PCs like the Apple II (1977), the IBM PC (1981), and the Commodore 64 (1982) by the millions, it seemed obvious that ground-breaking changes were afoot. The “PC Revolution” opened up new frontiers, employed tens of thousands of people, and (according to some enthusiasts) demanded new approaches to computer literacy.
    [Show full text]
  • Application Notes for Telcomp Software Applications and Avaya IP Office - Issue 1.0
    Avaya Solution & Interoperability Test Lab Application Notes for Telcomp Software Applications and Avaya IP Office - Issue 1.0 Abstract These Application Notes describe the configuration steps required for Telcomp software applications to successfully interoperate with the Avaya IP Office. The Telcomp PickUpIp application provides Caller ID capabilities to a single computer, or to a network of computers via the Telcomp PickUp application. The Telcomp PickUpEm application provides 911 emergency alert messages to be directed at a central console. All three of these applications work in conjunction with the Telcomp TcIpOff connection server application. Each of the Telcomp applications requires the functionality of run-time telephony event data streams provided by the Avaya IP Office DevLink PRO SDK interface. Information in these Application Notes has been obtained through DevConnect compliance testing and additional technical discussions. Testing was conducted via the DevConnect Program at the Avaya Solution and Interoperability Test Lab. SVS; Reviewed: Solution & Interoperability Test Lab Application Notes 1 of 18 SPOC 10/16/2007 ©2007 Avaya Inc. All Rights Reserved. IPO40-Telcomp 1. Introduction These Application Notes describe the compliance-tested configuration utilizing Telcomp software applications and Avaya IP Office. The Telcomp software application solution for Avaya IP Office consists of the following applications: PickUpIp – CallerID IP Server for IP Office TcIpOff – IP Office / Partner Translator for IP Office PickUp – CallerID client PickUpEm - 911 Alert Indicator Telcomp PickUpIp is a client/server middleware application that provides CallerID number information via a single-line screen pop and/or a multi-line menu capability from Avaya IP Office to a single computer, or a network of computers.
    [Show full text]
  • 1. with Examples of Different Programming Languages Show How Programming Languages Are Organized Along the Given Rubrics: I
    AGBOOLA ABIOLA CSC302 17/SCI01/007 COMPUTER SCIENCE ASSIGNMENT ​ 1. With examples of different programming languages show how programming languages are organized along the given rubrics: i. Unstructured, structured, modular, object oriented, aspect oriented, activity oriented and event oriented programming requirement. ii. Based on domain requirements. iii. Based on requirements i and ii above. 2. Give brief preview of the evolution of programming languages in a chronological order. 3. Vividly distinguish between modular programming paradigm and object oriented programming paradigm. Answer 1i). UNSTRUCTURED LANGUAGE DEVELOPER DATE Assembly Language 1949 FORTRAN John Backus 1957 COBOL CODASYL, ANSI, ISO 1959 JOSS Cliff Shaw, RAND 1963 BASIC John G. Kemeny, Thomas E. Kurtz 1964 TELCOMP BBN 1965 MUMPS Neil Pappalardo 1966 FOCAL Richard Merrill, DEC 1968 STRUCTURED LANGUAGE DEVELOPER DATE ALGOL 58 Friedrich L. Bauer, and co. 1958 ALGOL 60 Backus, Bauer and co. 1960 ABC CWI 1980 Ada United States Department of Defence 1980 Accent R NIS 1980 Action! Optimized Systems Software 1983 Alef Phil Winterbottom 1992 DASL Sun Micro-systems Laboratories 1999-2003 MODULAR LANGUAGE DEVELOPER DATE ALGOL W Niklaus Wirth, Tony Hoare 1966 APL Larry Breed, Dick Lathwell and co. 1966 ALGOL 68 A. Van Wijngaarden and co. 1968 AMOS BASIC FranÇois Lionet anConstantin Stiropoulos 1990 Alice ML Saarland University 2000 Agda Ulf Norell;Catarina coquand(1.0) 2007 Arc Paul Graham, Robert Morris and co. 2008 Bosque Mark Marron 2019 OBJECT-ORIENTED LANGUAGE DEVELOPER DATE C* Thinking Machine 1987 Actor Charles Duff 1988 Aldor Thomas J. Watson Research Center 1990 Amiga E Wouter van Oortmerssen 1993 Action Script Macromedia 1998 BeanShell JCP 1999 AngelScript Andreas Jönsson 2003 Boo Rodrigo B.
    [Show full text]
  • The Logo Lineage
    id302705 pdfMachine by Broadgun Software - a great PDF writer! - a great PDF creator! - http://www.pdfmachine.com http://www.broadgun.com THE LOGO LINEAGE by Wallace Feurzeig Wallace Feurzeig is a division scientist in information sciences for Bolt Beranek and Newman. His favorite implementation of Logo is still Logo-S for minicomputers. L ogo was created in 1966 at Bolt Beranek and Newman, a Cambridge research firm. Its intellectual roots are in artificial intelligence, mathematical logic and developmental psychology. The first four years of Logo research, development and teaching work was done at BBN. During the early 1960s, BBN had become a major center of computer science research and innovative applications. I joined the firm in 1962 to work with its newly available facilities in the Artificial Intelligence Department, one of the earliest AI organizations. My colleagues were actively engaged in some of the pioneering AI work in computer pattern recognition, natural language understanding, theorem proving, LISP language development and robot problem solving. Much of this work was done in collaboration with distinguished researchers at M.I.T. such as Marvin Minsky and John McCarthy, who were regular BBN consultants during the early 1960s. Other groups at BBN were doing original work in cognitive science, instructional research and man- computer communication. Some of the first work on knowledge representation (semantic networks), question-answering, interactive graphics and computer- aided instruction was actively underway. J. C. R. Licklider was the spiritual as well as the scientific leader of much of this work, championing the cause of on- line interaction during an era when almost all computation was being done via batch processing.
    [Show full text]
  • Computer Time-Sharing (T-S) "An Engineering Tool" for the Engineering Applications of the Small Company
    Scholars' Mine Masters Theses Student Theses and Dissertations 1970 Computer time-sharing (T-S) "an engineering tool" for the engineering applications of the small company James Binford Summers Follow this and additional works at: https://scholarsmine.mst.edu/masters_theses Part of the Civil Engineering Commons Department: Recommended Citation Summers, James Binford, "Computer time-sharing (T-S) "an engineering tool" for the engineering applications of the small company" (1970). Masters Theses. 5477. https://scholarsmine.mst.edu/masters_theses/5477 This thesis is brought to you by Scholars' Mine, a service of the Missouri S&T Library and Learning Resources. This work is protected by U. S. Copyright Law. Unauthorized use including reproduction for redistribution requires the permission of the copyright holder. For more information, please contact [email protected]. COMPUTER TIME-SHARING (T-S) "AN ENGINEERING TOOL" FOR THE ENGINEERING APPLICATIONS OF THE SMALL COMPANY BY JAMES BINFORD SUMMERS, 1938- A THESIS submitted to the faculty of the UNIVERSITY OF MISSOURI - ROLLA in partial fulfillment of the requirements for the Degree of MASTER OF SCIENCE IN CIVIL ENGINEERING Rolla., Missouri 1970 T2478 c.l 62 pages Approved by ~Jt£.~ ~.(advisor)~~ 187982 ~tiM/ ii ABSTRACT The objectives of this investigation were to illustrate the capabilities of the time-sharing (T-S) industry, identify the means by which the small sized company, with a need to solve engineering problems, can best be served through T-S, and to present T-S to these potential users. Investigation was made of distinctive T-S services to formulate a com­ posite of the T-S industry. Examples of three distinctive T-S services were used within this composite to exemplify the variations of services within the industry.
    [Show full text]
  • Writing Cybersecurity Job Descriptions for the Greatest Impact
    Writing Cybersecurity Job Descriptions for the Greatest Impact Keith T. Hall U.S. Department of Homeland Security Welcome Writing Cybersecurity Job Descriptions for the Greatest Impact Disclaimers and Caveats • Content Not Officially Adopted. The content of this briefing is mine personally and does not reflect any position or policy of the United States Government (USG) or of the Department of Homeland Security. • Note on Terminology. Will use USG terminology in this brief (but generally translatable towards Private Sector equivalents) • Job Description Usage. For the purposes of this presentation only, the Job Description for the Position Description (PD) is used synonymously with the Job Opportunity Announcement (JOA). Although there are potential differences, it is not material to the concepts presented today. 3 Key Definitions and Concepts (1 of 2) • What do you want the person to do? • Major Duties and Responsibilities. “A statement of the important, regular, and recurring duties and responsibilities assigned to the position” SOURCE: https://www.opm.gov/policy-data- oversight/classification-qualifications/classifying-general-schedule-positions/classifierhandbook.pdf • Major vs. Minor Duties. “Major duties are those that represent the primary reason for the position's existence, and which govern the qualification requirements. Typically, they occupy most of the employee's time. Minor duties generally occupy a small portion of time, are not the primary purpose for which the position was established, and do not determine qualification requirements” SOURCE: https://www.opm.gov/policy-data- oversight/classification-qualifications/classifying-general-schedule-positions/positionclassificationintro.pdf • Tasks. “Activities an employee performs on a regular basis in order to carry out the functions of the job.” SOURCE: https://www.opm.gov/policy-data-oversight/assessment-and-selection/job-analysis/job_analysis_presentation.pdf 4 Key Definitions and Concepts (2 of 2) • What do you want to see on resumes that qualifies them to do this work? • Competency.
    [Show full text]
  • Procedural Programming
    NASIR FIRDAUS OPEYEMI 17/SCI01/051 CSC302 1. (I) Examples of Structured Programming language are C, C+, C++, C#, Java, PERL, Ruby, PHP, ALGOL, Pascal, PL/I and Ada The structured programming language allows a programmer to code a program by dividing the whole program into smaller units or modules. Structured programming is not suitable for the development of large programs and does not allow reusability of any set of codes. (ii)A typical example of non-structured if BASIC. other unstructured include JOSS, FOCAL, TELCOMP, assembly languages, MS-DOS batch files, and early versions of BASIC, Fortran, COBOL, and MUMPS. Unstructured programming is a procedural program – the statements are executed in sequence as written(The statements execute in order you write) (iii)Example of procedural programming language are; FORTRAN, C, PASCAL, e.t.c Procedural programming is a programming paradigm, derived from structured programming, based on the concept of the procedure call. Procedures, also known as routines, subroutines, or functions, simply contain a series of computational steps to be carried out. (iv)Modular object oriented: Languages that formally support the module concept include Ada, Algol, BlitzMax, C#, Clojure, COBOL, D, Dart, Modular programming is a software design technique that emphasizes separating the functionality of a program into independent, interchangeable modules, such that each contains everything necessary to execute only one aspect of the desired functionality. (V)Example of Aspect oriented is Haskell Language. Aspect-Oriented Programming (AOP) is a programming paradigm which complements Object-Oriented Programming (OOP) by separating concerns of a software application to improve modularization. (Vi)Example of Activity Oriented: Activity-oriented knowledge representation methods.
    [Show full text]
  • Comparative Programming Languages CM20253
    We have briefly covered many aspects of language design And there are many more factors we could talk about in making choices of language The End There are many languages out there, both general purpose and specialist And there are many more factors we could talk about in making choices of language The End There are many languages out there, both general purpose and specialist We have briefly covered many aspects of language design The End There are many languages out there, both general purpose and specialist We have briefly covered many aspects of language design And there are many more factors we could talk about in making choices of language Often a single project can use several languages, each suited to its part of the project And then the interopability of languages becomes important For example, can you easily join together code written in Java and C? The End Or languages And then the interopability of languages becomes important For example, can you easily join together code written in Java and C? The End Or languages Often a single project can use several languages, each suited to its part of the project For example, can you easily join together code written in Java and C? The End Or languages Often a single project can use several languages, each suited to its part of the project And then the interopability of languages becomes important The End Or languages Often a single project can use several languages, each suited to its part of the project And then the interopability of languages becomes important For example, can you easily
    [Show full text]
  • 1^0 ^ Tkbocro' Project 16 A-Prll 1966 ;:Llrji:Ops
    1^0 ^ ]?Xl0 \U Jo Bro'i'jn ;:llrJi:OPs TKbOCrO’ Project 16 A-prll 1966 lU.f -fCvt? :1s th^ nano mod hero to do;^o?/;lbe a vropofsod syst^-m }::)attorncc:l after OSS-’-[I vjM.vh p^culd pz^ovlde :/?-n.pld and vo:^:^:atlle ccimutational :';c-:e to or.,g:.l;‘ieiO:es and salontiints via a tole-' !b;:^->;uiatc! am pex^sonaX latoraction of tho sairze \i a amarlonoad vilth a vnl^ate cisal?; calc^tl.ator comXad tro poT^Jor and fXenibility of a hiy^U apaad ccaapntsn is the 'note of this ayste^o i:t:e lann;i:>a^e used to coiimnnicate with tl'v:; aysteu Is easy to loanop sbeplo to use and natuvaX for itVinorioal problons^ Pnp?:i/iQnc0 vlth tho JOSS aysten? at rlAlW Coy-pnx^ntlorx has ar;.o'i^;n that systens of this sort ana oxtnamely usoful for a nide variety of en^;inooring and solentific cal- cnlationSo Our local e^iserienoe nita_a similar system-^ ■ Xi:.' lementod on the Hospital Cci;iputc;r (SOS-ld) shons tliat tlia /I ability to do useful ccmputaticus at the GOEa;and of in: Individual onyinaer or sclontist comornod uith a pmblGii:i V. indeed imomssme 1,1ut that res ability and doci^isentaticLi must rn-ovt very high standaisda in order to achieve eompleto aoo0j>tan,CGo n Vi out Version;●-> Vavyioi.-s im:plemen1'atioris of JOSS-lihe rysteins ?aave been^ rimm ins on the Hospital Cemputor (ifF-ld) since August i9t4« mono of thoBo has mar boon as coipplete a system as its parent (joss) and the documentatiGn has been quite inadequate= HemartmiesB.
    [Show full text]
  • Compatible Time-Sharing System (1961-1973) Fiftieth Anniversary
    Compatible Time-Sharing System (1961-1973) Fiftieth Anniversary Commemorative Overview The Compatible Time Sharing System (1961–1973) Fiftieth Anniversary Commemorative Overview The design of the cover, half-title page (reverse side of this page), and main title page mimics the design of the 1963 book The Compatible Time-Sharing System: A Programmer’s Guide from the MIT Press. The Compatible Time Sharing System (1961–1973) Fiftieth Anniversary Commemorative Overview Edited by David Walden and Tom Van Vleck With contributions by Fernando Corbató Marjorie Daggett Robert Daley Peter Denning David Alan Grier Richard Mills Roger Roach Allan Scherr Copyright © 2011 David Walden and Tom Van Vleck All rights reserved. Single copies may be printed for personal use. Write to us at [email protected] for a PDF suitable for two-sided printing of multiple copies for non-profit academic or scholarly use. IEEE Computer Society 2001 L Street N.W., Suite 700 Washington, DC 20036-4928 USA First print edition June 2011 (web revision 03) The web edition at http://www.computer.org/portal/web/volunteercenter/history is being updated from the print edition to correct mistakes and add new information. The change history is on page 50. To Fernando Corbató and his MIT collaborators in creating CTSS Contents Preface . ix Acknowledgments . ix MIT nomenclature and abbreviations . x 1 Early history of CTSS . 1 2 The IBM 7094 and CTSS at MIT . 5 3 Uses . 17 4 Memories and views of CTSS . 21 Fernando Corbató . 21 Marjorie Daggett . 22 Robert Daley . 24 Richard Mills . 26 Tom Van Vleck . 31 Roger Roach .
    [Show full text]