The UNIX Time-Sharing System

Total Page:16

File Type:pdf, Size:1020Kb

The UNIX Time-Sharing System t ·,) DRAFT The UNIX Time-Sha.ring Syste:n D. M. Ritchie 1· ~oduction UNIX is a general-purpose, multi-user time sharing system in- ) plernented on several Digital Equip~ent Corporation PDP series machines. UNIX was written by K. L. Tho::ipson, who also wrote many of the command prograns. The author of this meraorandurn contributed several of the major corilinands, including the assembler and tne debugger. The file system was originally designed by Thom?son, the author, and R.H. Canaday. There are two versions of UNIX. The first, which has been in ex- istence about a year, rtins on the PDP-7 and -9 coraput~rs; a more modern version, a few months old, uses the PD?-11. This docu,f'.ent describes U:-HX-11, since it is more modern and many of the dif- ferences between it and UNIX-7 result from redesign of features found to be deficient or lacking in the earlier system. Although the PDP-7 and PDP-11 are both small computers, the design of UNIX is amenable to expansion for use on more powerful machines. Indeed, UNIX contains a number of features w,~ry selc.om offered even by larger syste~s, including 1 o A versatile, conveni<?nt file system with co:nplete integra- tion between disk files and I/0 devices; .. - 2 - i " 2. The ability to initiate asynchrously running processes. It must be said, however, that the most important features of UNIX are its simplicity, elegance, and ease of use. Besides the system proper, the major programs available under UNIX are an assembler, a text editor based on QED, a symbolic debugger for examining and patching faulty programs, and " B " t a higher level language resembling BCPL. UNIX-7 also has a version of the compiler writini:r language TMGL contributed by M. D. ·~~ Mcilroy, and besides its own assembler, there~~ is a PDP-11 assembler which was used to write UNIX-11. On the PDP-11 there is a version of BASIC ·[reference] adapted from the one supplied by DEC [reference]. All but the last of these programs were written locally, and except for the very first versions of the editor and assembler, using UNIX itself. £• B:ardware The PDP-11 on 'i~hich UNIX is implemented is a 16-bit 1 2K computer, and UNIX occupies BK words. More than half of this space, however, is utilized for a variable number of disk buffers; with ) some loss of speed the number of buffers could be cut significantly. The PDP-11 has a 256K word disk, almost all of which is used for ) file system storage. It is equipped with DECTAPE, a variety of magnetic tape facility in which individual rRcords may be addres- sed and rewritten at will. Also available are a high-speed paper tape reader and punch. Bes ides the standarcJ Teletype, there ar'::! .. - 3 - several variable-speed communications inter.=aces. d• The File System The most important role of UNIX is to provide a file system. From the point of view of the user, there are three kinds of files: ordinary disk files, directories, and special files. -\ J 1•1 Ordinary Files A file contains whatever information the user places there, for example symbolic or binary (object) programs. No particular structuring is expected by the system. Files of text ordinarily consist simply of a string of characters, with lines demarcated by the new-line character. Binary programs are sequences of words as they will appear in core memory when the program starts executing. A few user programs generate and expect files with more structure; for example, the assembler genera~es, and the debugger expec~s, a name list file in a particular format; however, the structure of files is controlled solely by the programs which use them, not by the system. l•I Directories Directories (sometimes, "catalogs"), provide the mapping between the names of files and the files themselves, and thus induce a structure on the file system as a whole. Each user has a direc- tory of his own files; he may also create subdirectories to con- tain qroups of files conveniently treated together. ~ - 4 - A directory is exactly like an ordinary file except that it can- not be written on by user programs, so that the system controls the contents of directories. However, anyone with appropriate -) permission may read a directory just like any other file. The system maintains several directories for its own use. One of these is the root directory. All files in the system can be found by tracing a path through a chain of directories until the ) / desired file is reached. The starting point for such searches is often the root, which contains an entry for each user's master directory. Another system directory contains all the programs provided as part of the system; that is, all the commands (elsewhere, "subsystems"). As will be seen, however, it is by no means necessary that a program reside in this directory for it to be used as a command. Files and directories are named by sequences of eight or fewer characters. ·when the name of a file is specified to t:he system, it may be in the form of a path~' which is a sequence of directory names separated by slashes and ending in a file nameo If the sequence begins with a slash, the search begins in the root directory. The name "/a/b/c" causes the system to search the root for directory ..a ... then to search ..a .. for "b .. and then to .. .. .. ' ' find " C " in b. " C may be an ordinary file, a directory, or a special file. As a limiting case, the name "/" refers to the root ) itself. The same non-directory file may appear in several directories un­ der possibly different names. This feature is called "linking"; a directory entry for a file is so:netimes called a link. UNIX dif- - 5 - fers from other systems in which linking is permitted in that all links to a file have equal status. That is, a file does not ex- ist within a particular directory; the directory entry for a file --) consists merely of its name and a pointer to the information ac-· tually describing the file. Thus a file exists independently of any directory entry, although in practice a file is made to disappear along with the last link to it. When a user logs into UNIX, he is assigned a default current directory, but he may change to any directory·readable by him. A path name not starting with"/" causes the system to begin the search in the user's current directory. Thus, the name "a/b" specifies the file named "b" in directory "a", which is found in the current working directory. The simplest kind of name, for ex- ample " a," refers to a file which itself is found in the working directory. Each directory always·has at least two entries. The ·name"." in each directory,refers to the directory itself. Thus a program may read the current directory under the name " • " without knowing. its II II actual path name. The name • • by convention refers to the parent of the directory in which it appears; that is, the direc- tory in which it was first created. The directory structure is constrained to have the form of a ti " rooted tree. Except for the special entries • and " .. " ' each directory must appear as an entry in exactly one other, which is its parent. The reason for this is to simplify the writing of programs which visit subtrees of the directory structure, and more important, to avoid the separation of portions of the - 6 - hierarchy. If arbitrary links to directories were permitted, it would be quite difficult to detect when the last connection fro~ the root to a directory was severed. l•l Special Files Special files constitute the most unusual feature of the UNIX file system. Each I/0 device supported by UNIX is associated with \ ) at least one special file. Special files are read and written just like ordinary disk files, but the result· is activation of the associated device. Entries for all special files reside in the root directory, so they may all be referred to by "/" fol- lowed by the appropriate name. The special files are discussed further in section 6 below. 3.,1 Protection The protection scheme in UNIX is quite simple. Each user of the system is assigned a uniq-µe user number. When a file ·is created, it is marked with the number of its creator. Also given for new \ files is a set of protection bits. Four of these specify indepen- ) dently permission to read or write for the owner of the file and for all other users. A fifth bit indicates permission to execute the file as a program. If the sixth bit is on, the system will temporarily change the user identification of the current user to that of the creator of the file whenever the file is executed as a program. This feature provides for privileged programs which may use files which should neither be read nor changed by other users. If the set-user-identification bit is on for a program, ., - 7 - the accounting file may be accessed during the program's execu- tion but not otherwise. ) 1-~ System I/Q Calls The system calls to do I/0 are designed to eliminate the dif- ferences between the various devices and styles of access. There is no distinction between "random" and sequential I/o, nor is any logical or physical record size imposed by the system.
Recommended publications
  • Fundamentals of UNIX Lab 5.4.6 – Listing Directory Information (Estimated Time: 30 Min.)
    Fundamentals of UNIX Lab 5.4.6 – Listing Directory Information (Estimated time: 30 min.) Objectives: • Learn to display directory and file information • Use the ls (list files) command with various options • Display hidden files • Display files and file types • Examine and interpret the results of a long file listing • List individual directories • List directories recursively Background: In this lab, the student will use the ls command, which is used to display the contents of a directory. This command will display a listing of all files and directories within the current directory or specified directory or directories. If no pathname is given as an argument, ls will display the contents of the current directory. The ls command will list any subdirectories and files that are in the current working directory if a pathname is specified. The ls command will also default to a wide listing and display only file and directory names. There are many options that can be used with the ls command, which makes this command one of the more flexible and useful UNIX commands. Command Format: ls [-option(s)] [pathname[s]] Tools / Preparation: a) Before starting this lab, the student should review Chapter 5, Section 4 – Listing Directory Contents b) The student will need the following: 1. A login user ID, for example user2, and a password assigned by their instructor. 2. A computer running the UNIX operating system with CDE. 3. Networked computers in classroom. Notes: 1 - 5 Fundamentals UNIX 2.0—-Lab 5.4.6 Copyright 2002, Cisco Systems, Inc. Use the diagram of the sample Class File system directory tree to assist with this lab.
    [Show full text]
  • Your Performance Task Summary Explanation
    Lab Report: 11.2.5 Manage Files Your Performance Your Score: 0 of 3 (0%) Pass Status: Not Passed Elapsed Time: 6 seconds Required Score: 100% Task Summary Actions you were required to perform: In Compress the D:\Graphics folderHide Details Set the Compressed attribute Apply the changes to all folders and files In Hide the D:\Finances folder In Set Read-only on filesHide Details Set read-only on 2017report.xlsx Set read-only on 2018report.xlsx Do not set read-only for the 2019report.xlsx file Explanation In this lab, your task is to complete the following: Compress the D:\Graphics folder and all of its contents. Hide the D:\Finances folder. Make the following files Read-only: D:\Finances\2017report.xlsx D:\Finances\2018report.xlsx Complete this lab as follows: 1. Compress a folder as follows: a. From the taskbar, open File Explorer. b. Maximize the window for easier viewing. c. In the left pane, expand This PC. d. Select Data (D:). e. Right-click Graphics and select Properties. f. On the General tab, select Advanced. g. Select Compress contents to save disk space. h. Click OK. i. Click OK. j. Make sure Apply changes to this folder, subfolders and files is selected. k. Click OK. 2. Hide a folder as follows: a. Right-click Finances and select Properties. b. Select Hidden. c. Click OK. 3. Set files to Read-only as follows: a. Double-click Finances to view its contents. b. Right-click 2017report.xlsx and select Properties. c. Select Read-only. d. Click OK. e.
    [Show full text]
  • Debates in the Digital Humanities This Page Intentionally Left Blank DEBATES in the DIGITAL HUMANITIES
    debates in the digital humanities This page intentionally left blank DEBATES IN THE DIGITAL HUMANITIES Matthew K. Gold editor University of Minnesota Press Minneapolis London Chapter 1 was previously published as “What Is Digital Humanities and What’s It Doing in English Departments?” ADE Bulletin, no. 150 (2010): 55– 61. Chap- ter 2 was previously published as “The Humanities, Done Digitally,” The Chron- icle of Higher Education, May 8, 2011. Chapter 17 was previously published as “You Work at Brown. What Do You Teach?” in #alt- academy, Bethany Nowviskie, ed. (New York: MediaCommons, 2011). Chapter 28 was previously published as “Humanities 2.0: Promises, Perils, Predictions,” PMLA 123, no. 3 (May 2008): 707– 17. Copyright 2012 by the Regents of the University of Minnesota all rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the publisher. Published by the University of Minnesota Press 111 Third Avenue South, Suite 290 Minneapolis, MN 55401- 2520 http://www.upress.umn.edu library of congress cataloging-in-publication data Debates in the digital humanities / [edited by] Matthew K. Gold. ISBN 978-0-8166-7794-8 (hardback)—ISBN 978-0-8166-7795-5 (pb) 1. Humanities—Study and teaching (Higher)—Data processing. 2. Humanities —Technological innovations. 3. Digital media. I. Gold, Matthew K.. AZ182.D44 2012 001.3071—dc23 2011044236 Printed in the United States of America on acid- free paper The University of Minnesota is an equal- opportunity educator and employer.
    [Show full text]
  • NETSTAT Command
    NETSTAT Command | NETSTAT Command | Use the NETSTAT command to display network status of the local host. | | ┌┐────────────── | 55──NETSTAT─────6─┤ Option ├─┴──┬────────────────────────────────── ┬ ─ ─ ─ ────────────────────────────────────────5% | │┌┐───────────────────── │ | └─(──SELect───6─┤ Select_String ├─┴ ─ ┘ | Option: | ┌┐─COnn────── (1, 2) ──────────────── | ├──┼─────────────────────────── ┼ ─ ──────────────────────────────────────────────────────────────────────────────┤ | ├─ALL───(2)──────────────────── ┤ | ├─ALLConn─────(1, 2) ────────────── ┤ | ├─ARp ipaddress───────────── ┤ | ├─CLients─────────────────── ┤ | ├─DEvlinks────────────────── ┤ | ├─Gate───(3)─────────────────── ┤ | ├─┬─Help─ ┬─ ───────────────── ┤ | │└┘─?──── │ | ├─HOme────────────────────── ┤ | │┌┐─2ð────── │ | ├─Interval─────(1, 2) ─┼───────── ┼─ ┤ | │└┘─seconds─ │ | ├─LEVel───────────────────── ┤ | ├─POOLsize────────────────── ┤ | ├─SOCKets─────────────────── ┤ | ├─TCp serverid───(1) ─────────── ┤ | ├─TELnet───(4)───────────────── ┤ | ├─Up──────────────────────── ┤ | └┘─┤ Command ├───(5)──────────── | Command: | ├──┬─CP cp_command───(6) ─ ┬ ────────────────────────────────────────────────────────────────────────────────────────┤ | ├─DELarp ipaddress─ ┤ | ├─DRop conn_num──── ┤ | └─RESETPool──────── ┘ | Select_String: | ├─ ─┬─ipaddress────(3) ┬ ─ ───────────────────────────────────────────────────────────────────────────────────────────┤ | ├─ldev_num─────(4) ┤ | └─userid────(2) ─── ┘ | Notes: | 1 Only ALLCON, CONN and TCP are valid with INTERVAL. | 2 The userid
    [Show full text]
  • Respiratory Therapy Pocket Reference
    Pulmonary Physiology Volume Control Pressure Control Pressure Support Respiratory Therapy “AC” Assist Control; AC-VC, ~CMV (controlled mandatory Measure of static lung compliance. If in AC-VC, perform a.k.a. a.k.a. AC-PC; Assist Control Pressure Control; ~CMV-PC a.k.a PS (~BiPAP). Spontaneous: Pressure-present inspiratory pause (when there is no flow, there is no effect ventilation = all modes with RR and fixed Ti) PPlateau of Resistance; Pplat@Palv); or set Pause Time ~0.5s; RR, Pinsp, PEEP, FiO2, Flow Trigger, rise time, I:E (set Pocket Reference RR, Vt, PEEP, FiO2, Flow Trigger, Flow pattern, I:E (either Settings Pinsp, PEEP, FiO2, Flow Trigger, Rise time Target: < 30, Optimal: ~ 25 Settings directly or by inspiratory time Ti) Settings directly or via peak flow, Ti settings) Decreasing Ramp (potentially more physiologic) PIP: Total inspiratory work by vent; Reflects resistance & - Decreasing Ramp (potentially more physiologic) Card design by Respiratory care providers from: Square wave/constant vs Decreasing Ramp (potentially Flow Determined by: 1) PS level, 2) R, Rise Time (­ rise time ® PPeak inspiratory compliance; Normal ~20 cmH20 (@8cc/kg and adult ETT); - Peak Flow determined by 1) Pinsp level, 2) R, 3)Ti (shorter Flow more physiologic) ¯ peak flow and 3.) pt effort Resp failure 30-40 (low VT use); Concern if >40. Flow = more flow), 4) pressure rise time (¯ Rise Time ® ­ Peak v 0.9 Flow), 5) pt effort (­ effort ® ­ peak flow) Pplat-PEEP: tidal stress (lung injury & mortality risk). Target Determined by set RR, Vt, & Flow Pattern (i.e. for any set I:E Determined by patient effort & flow termination (“Esens” – PDriving peak flow, Square (¯ Ti) & Ramp (­ Ti); Normal Ti: 1-1.5s; see below “Breath Termination”) < 15 cmH2O.
    [Show full text]
  • The Evolution of the Unix Time-Sharing System*
    The Evolution of the Unix Time-sharing System* Dennis M. Ritchie Bell Laboratories, Murray Hill, NJ, 07974 ABSTRACT This paper presents a brief history of the early development of the Unix operating system. It concentrates on the evolution of the file system, the process-control mechanism, and the idea of pipelined commands. Some attention is paid to social conditions during the development of the system. NOTE: *This paper was first presented at the Language Design and Programming Methodology conference at Sydney, Australia, September 1979. The conference proceedings were published as Lecture Notes in Computer Science #79: Language Design and Programming Methodology, Springer-Verlag, 1980. This rendition is based on a reprinted version appearing in AT&T Bell Laboratories Technical Journal 63 No. 6 Part 2, October 1984, pp. 1577-93. Introduction During the past few years, the Unix operating system has come into wide use, so wide that its very name has become a trademark of Bell Laboratories. Its important characteristics have become known to many people. It has suffered much rewriting and tinkering since the first publication describing it in 1974 [1], but few fundamental changes. However, Unix was born in 1969 not 1974, and the account of its development makes a little-known and perhaps instructive story. This paper presents a technical and social history of the evolution of the system. Origins For computer science at Bell Laboratories, the period 1968-1969 was somewhat unsettled. The main reason for this was the slow, though clearly inevitable, withdrawal of the Labs from the Multics project. To the Labs computing community as a whole, the problem was the increasing obviousness of the failure of Multics to deliver promptly any sort of usable system, let alone the panacea envisioned earlier.
    [Show full text]
  • Open Geospatial Consortium
    Open Geospatial Consortium Submission Date: 2016-08-23 Approval Date: 2016-11-29 Publication Date: 2016-01-31 External identifier of this OGC® document: http://www.opengis.net/doc/geosciml/4.1 Internal reference number of this OGC® document: 16-008 Version: 4.1 Category: OGC® Implementation Standard Editor: GeoSciML Modelling Team OGC Geoscience Markup Language 4.1 (GeoSciML) Copyright notice Copyright © 2017 Open Geospatial Consortium To obtain additional rights of use, visit http://www.opengeospatial.org/legal/. IUGS Commission for the Management and Application of Geoscience Information, Copyright © 2016-2017. All rights reserved. Warning This formatted document is not an official OGC Standard. The normative version is posted at: http://docs.opengeospatial.org/is/16-008/16-008.html This document is distributed for review and comment. This document is subject to change without notice and may not be referred to as an OGC Standard. Recipients of this document are invited to submit, with their comments, notification of any relevant patent rights of which they are aware and to provide supporting documentation. Document type: OGC® Standard Document subtype: Document stage: Approved for Publis Release Document language: English i Copyright © 2016 Open Geospatial Consortium License Agreement Permission is hereby granted by the Open Geospatial Consortium, ("Licensor"), free of charge and subject to the terms set forth below, to any person obtaining a copy of this Intellectual Property and any associated documentation, to deal in the Intellectual Property without restriction (except as set forth below), including without limitation the rights to implement, use, copy, modify, merge, publish, distribute, and/or sublicense copies of the Intellectual Property, and to permit persons to whom the Intellectual Property is furnished to do so, provided that all copyright notices on the intellectual property are retained intact and that each person to whom the Intellectual Property is furnished agrees to the terms of this Agreement.
    [Show full text]
  • User's Manual
    USER’S MANUAL USER’S > UniQTM UniQTM User’s Manual Ed.: 821003146 rev.H © 2016 Datalogic S.p.A. and its Group companies • All rights reserved. • Protected to the fullest extent under U.S. and international laws. • Copying or altering of this document is prohibited without express written consent from Datalogic S.p.A. • Datalogic and the Datalogic logo are registered trademarks of Datalogic S.p.A. in many countries, including the U.S. and the E.U. All other brand and product names mentioned herein are for identification purposes only and may be trademarks or registered trademarks of their respective owners. Datalogic shall not be liable for technical or editorial errors or omissions contained herein, nor for incidental or consequential damages resulting from the use of this material. Printed in Donnas (AO), Italy. ii SYMBOLS Symbols used in this manual along with their meaning are shown below. Symbols and signs are repeated within the chapters and/or sections and have the following meaning: Generic Warning: This symbol indicates the need to read the manual carefully or the necessity of an important maneuver or maintenance operation. Electricity Warning: This symbol indicates dangerous voltage associated with the laser product, or powerful enough to constitute an electrical risk. This symbol may also appear on the marking system at the risk area. Laser Warning: This symbol indicates the danger of exposure to visible or invisible laser radiation. This symbol may also appear on the marking system at the risk area. Fire Warning: This symbol indicates the danger of a fire when processing flammable materials.
    [Show full text]
  • January 22, 2021. OFLC Announces Plan for Reissuing Certain
    January 22, 2021. OFLC Announces Plan for Reissuing Certain Prevailing Wage Determinations Issued under the Department’s Interim Final Rule of October 8, 2020; Compliance with the District Court’s Modified Order. On January 20, 2021, the U.S. District Court for the District of Columbia in Purdue University, et al. v. Scalia, et al. (No. 20-cv-3006) and Stellar IT, Inc., et al. v. Scalia, et al. (No. 20-cv- 3175) issued a modified order governing the manner and schedule in which the Office of Foreign Labor Certification (OFLC) will reissue certain prevailing wage determinations (PWDs) that were issued from October 8, 2020 through December 4, 2020, under the wage methodology for the Interim Final Rule (IFR), Strengthening Wage Protections for the Temporary and Permanent Employment of Certain Aliens in the United States, 85 FR 63872 (Oct. 8, 2020). The Department is taking necessary steps to comply with the modified order issued by the District Court. Accordingly, OFLC will be reissuing certain PWDs issued under the Department’s IFR in two phases. Employers that have already submitted a request in response to the December 3, 2020 announcement posted by OFLC have been issued a PWD and do not need to resubmit a second request for reissuance or take other additional action. PHASE I: High Priority PWDs Within 15 working days of receiving the requested list of named Purdue Plaintiffs and Associational Purdue Plaintiffs from Plaintiffs’ counsel, OFLC will reissue all PWDs that have not yet been used in the filing of a Labor Condition Application (LCA) or PERM application as of January 20, 2021, and that fall into one or more of the following categories: 1.
    [Show full text]
  • The UNIX Time- Sharing System
    1. Introduction There have been three versions of UNIX. The earliest version (circa 1969–70) ran on the Digital Equipment Cor- poration PDP-7 and -9 computers. The second version ran on the unprotected PDP-11/20 computer. This paper describes only the PDP-11/40 and /45 [l] system since it is The UNIX Time- more modern and many of the differences between it and older UNIX systems result from redesign of features found Sharing System to be deficient or lacking. Since PDP-11 UNIX became operational in February Dennis M. Ritchie and Ken Thompson 1971, about 40 installations have been put into service; they Bell Laboratories are generally smaller than the system described here. Most of them are engaged in applications such as the preparation and formatting of patent applications and other textual material, the collection and processing of trouble data from various switching machines within the Bell System, and recording and checking telephone service orders. Our own installation is used mainly for research in operating sys- tems, languages, computer networks, and other topics in computer science, and also for document preparation. UNIX is a general-purpose, multi-user, interactive Perhaps the most important achievement of UNIX is to operating system for the Digital Equipment Corpora- demonstrate that a powerful operating system for interac- tion PDP-11/40 and 11/45 computers. It offers a number tive use need not be expensive either in equipment or in of features seldom found even in larger operating sys- human effort: UNIX can run on hardware costing as little as tems, including: (1) a hierarchical file system incorpo- $40,000, and less than two man years were spent on the rating demountable volumes; (2) compatible file, device, main system software.
    [Show full text]
  • Automating Admin Tasks Using Shell Scripts and Cron Vijay Kumar Adhikari
    AutomatingAutomating adminadmin taskstasks usingusing shellshell scriptsscripts andand croncron VijayVijay KumarKumar AdhikariAdhikari vijayvijay@@kcmkcm..eduedu..npnp HowHow dodo wewe go?go? IntroductionIntroduction toto shellshell scriptsscripts ExampleExample scriptsscripts IntroduceIntroduce conceptsconcepts atat wewe encounterencounter themthem inin examplesexamples IntroductionIntroduction toto croncron tooltool ExamplesExamples ShellShell The “Shell” is a program which provides a basic human-OS interface. Two main ‘flavors’ of Shells: – sh, or bourne shell. It’s derivatives include ksh (korn shell) and now, the most widely used, bash (bourne again shell). – csh or C-shell. Widely used form is the very popular tcsh. – We will be talking about bash today. shsh scriptscript syntaxsyntax The first line of a sh script must (should?) start as follows: #!/bin/sh (shebang, http://en.wikipedia.org/wiki/Shebang ) Simple unix commands and other structures follow. Any unquoted # is treated as the beginning of a comment until end-of-line Environment variables are $EXPANDED “Back-tick” subshells are executed and `expanded` HelloHello WorldWorld scriptscript #!/bin/bash #Prints “Hello World” and exists echo “Hello World” echo “$USER, your current directory is $PWD” echo `ls` exit #Clean way to exit a shell script ---------------------------------------- To run i. sh hello.sh ii. chmod +x hello.sh ./hello.sh VariablesVariables MESSAGE="Hello World“ #no $ SHORT_MESSAGE=hi NUMBER=1 PI=3.142 OTHER_PI="3.142“ MIXED=123abc new_var=$PI echo $OTHER_PI # $ precedes when using the var Notice that there is no space before and after the ‘=‘. VariablesVariables contcont…… #!/bin/bash echo "What is your name?" read USER_NAME # Input from user echo "Hello $USER_NAME" echo "I will create you a file called ${USER_NAME}_file" touch "${USER_NAME}_file" -------------------------------------- Exercise: Write a script that upon invocation shows the time and date and lists all logged-in users.
    [Show full text]
  • Time-Space Analysis in Programming Languages 109
    Time-space analysis in Programming Languages Jatinder Manhas* Abstract Time and space complexity of a program always remain an issue of greater consideration for programmers. The author in this paper has discussed the time and space complexity of a single program written in different languages. The sample program was one by one executed on a single machine with similar configuration in each case with different compiler versions. It has been observed that in different languages (C, C++, Java, C#) time taken varies. Mostly the research done for language in case of time-space trade-off is usually not bounded with fixed system configuration. In that case we calculate the time and space complexity of a particular algorithm with no system constraints. Such procedure does not give us time and space complexity of program with respect to language. The author here believes to calculate the time and space complexity of a program with respect to language. While execution of a sample code written in different Introduction languages on fixed system configuration, for each run of sample code, CPU time is calculated and compared. It In dealing time and space complexity we come up with the shows how the choices of language affect the time and introduction of following elements: space resource. Time and Space Complexity Keywords: Time and space Complexity, Program, Language, Time Complexity, Space Complexity In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the string representing the input. The time complexity of an algorithm is commonly expressed using big O notation, which excludes coefficients and lower order terms.
    [Show full text]