Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.
35 Pages
chap9Security
Course: CS 6580, Fall 2009School: CSU Mont. Bay
Rating:
Word Count: 1199
Document Preview
SYSTEMS DISTRIBUTED Principles and Paradigms Second Edition ANDREW S. TANENBAUM MAARTEN VAN STEEN Chapter 9 Security Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5 Security Threats, Policies, and Mechanisms Types of security threats to consider: Interception Interruption Modification Fabrication Tanenbaum...
Unformatted Document Excerpt
Coursehero >> California >> CSU Mont. Bay >> CS 6580Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
SYSTEMS DISTRIBUTED Principles and Paradigms
Second Edition ANDREW S. TANENBAUM MAARTEN VAN STEEN
Chapter 9 Security
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Security Threats, Policies, and Mechanisms
Types of security threats to consider: Interception Interruption Modification Fabrication
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Example: The Globus Security Architecture (1)
1. The environment consists of multiple administrative domains. 2. Local operations are subject to a local domain security policy only. 3. Global operations require the initiator to be known in each domain where the operation is carried out.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Example: The Globus Security Architecture (2)
1. Operations between entities in different domains require mutual authentication. 2. Global authentication replaces local authentication. 3. Controlling access to resources is subject to local security only. 4. Users can delegate rights to processes. 5. A group of processes in the same domain can share credentials.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Example: The Globus Security Architecture (2)
Figure 9-1. The Globus security architecture.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Focus of Control (1)
Figure 9-2. Three approaches for protection against security threats. (a) Protection against invalid operations
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Focus of Control (2)
Figure 9-2. Three approaches for protection against security threats. (b) Protection against unauthorized invocations.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Focus of Control (3)
Figure 9-2. Three approaches for protection against security threats. (c) Protection against unauthorized users.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Layering of Security Mechanisms (1)
Figure 9-3. The logical organization of a distributed system into several layers.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Layering of Security Mechanisms (2)
Figure 9-4. Several sites connected through a wide-area backbone service.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Distribution of Security Mechanisms
Figure 9-5. The principle of RISSC as applied to secure distributed systems.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Cryptography (1)
Figure 9-6. Intruders and eavesdroppers in communication.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Cryptography (2)
Figure 9-7. Notation used in this chapter.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Symmetric Cryptosystems: DES (1)
Figure 9-8. (a) The principle of DES.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Symmetric Cryptosystems: DES (2)
Figure 9-8. (b) Outline of one encryption round.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Symmetric Cryptosystems: DES (3)
Figure 9-9. Details of per-round key generation in DES.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Public-Key Cryptosystems: RSA
Generating the private and public keys requires four steps: Choose two very large prime numbers, p and q. Compute n = p q and z (p = - 1) (q - 1). Choose a number d that is relatively prime to z. Compute the number e such that e d = 1 mod z.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Hash Functions: MD5 (1)
Figure 9-10. The structure of MD5.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Authentication Based on a Shared Secret Key (1)
Figure 9-12. Authentication based on a shared secret key.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Authentication Based on a Shared Secret Key (2)
Figure 9-13. Authentication based on a shared secret key, but using three instead of five messages.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Authentication Based on a Shared Secret Key (3)
Figure 9-14. The reflection attack.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Authentication Using a Key Distribution Center (1)
Figure 9-15. The principle of using a KDC.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Authentication Using a Key Distribution Center (2)
Figure 9-16. Using a ticket and letting Alice set up a connection to Bob.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Authentication Using a Key Distribution Center (5)
Figure 9-19. Mutual authentication in a public-key cryptosystem.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Digital Signatures (1)
Figure 9-20. Digital signing a message using public-key cryptography.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Digital Signatures (2)
Figure 9-21. Digitally signing a message using a message digest.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Secure Replicated Servers
Figure 9-22. Sharing a secret signature in a group of replicated servers.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Example: Kerberos (1)
Figure 9-23. Auth...
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more.
Course Hero has millions of course specific materials providing students with the best way to expand
their education.
Below is a small sample set of documents:
Below is a small sample set of documents:
CSU Mont. Bay - CS - 6580
CORBA (Java IDL) Program Source Codehelloworld examplehelloworld subdirectory (or folder)-snazzy% lsCompileRun.txt HelloClient.class HelloServer.class READMEHello.idl HelloClient.java HelloServer.javaHelloApp
CSU Mont. Bay - CS - 6580
Lamport's Logical Clocks & Totally Ordered MulticastingReference L. Lamport, "Time, Clocks and the Ordering of Events in Distributed Systems," Communications of the ACM, Vol. 21, No. 7, July 1978, pp. 558565.The HappenedBefore RelationLamp
CSU Mont. Bay - CS - 6580
import java.net.*;import java.io.*;public class MulticastPeer{ public static void main(String args[]){ / args give message contents and destination multicast group / (e.g. "228.5.6.7") MulticastSocket s =null; tr
CSU Mont. Bay - CS - 6580
PRODUCT EXAMPLEProduct.java-import java.rmi.*;public interface Product extends Remote{ String getDescription() throws RemoteException;}ProductClient.java-import java.rmi.*;import java.rmi.server.*;public class ProductClient{
CSU Mont. Bay - CS - 6580
PRODUCT EXAMPLEProduct.java-import java.rmi.*;public interface Product extends Remote{ String getDescription() throws RemoteException;}ProductClient.java-import java.rmi.*;import java.rmi.server.*;public class ProductClient{
CSU Mont. Bay - CS - 6580
/HelloInterface.javaimport java.rmi.Remote;public interface HelloInterface extends java.rmi.Remote { public void sayHello( String from ) throws java.rmi.RemoteException;}/HelloImpl.javaimport javax.rmi.PortableRemoteObject;public class
CSU Mont. Bay - CS - 6580
date.x-program DATE_PROG { version DATE_VERS { long BIN_DATE (void) = 1; string STR_DATE(long) =2; } = 1;} = 0x31234999;~client.c-#include <stdio.h>#include <rpc/rpc.h>#include
CSU Mont. Bay - CS - 6580
date.x-program DATE_PROG { version DATE_VERS { long BIN_DATE (void) = 1; string STR_DATE(long) =2; } = 1;} = 0x31234999;~client.c-#include <stdio.h>#include <rpc/rpc.h>#include
CSU Mont. Bay - CS - 6580
SERVER PROGRAM/* server.c - code for example server program that uses TCP */#ifndef unix#define WIN32#include <windows.h>#include <winsock.h>#else#define closesocket close#include <sys/types.h>#include <sys/socket.h>#include <netinet/
CSU Mont. Bay - CS - 6580
DISTRIBUTED SYSTEMS Principles and ParadigmsSecond Edition ANDREW S. TANENBAUM MAARTEN VAN STEENChapter 6 SynchronizationTanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved.
CSU Mont. Bay - CS - 6580
Distributed Systems: SynchronizationPart IGian Pietro PiccoDipartimento di Elettronica e Informazione Politecnico di Milano, Italypicco@elet.polimi.it http:/www.elet.polimi.it/~picco Presented by:Luca Mottolamottola@elet.polimi.itPolitecnico
Wisc Stevens Point - JSCHI - 388
Wisc Stevens Point - JSCHI - 388
UNIVERSITY OF WISCONSIN-STEVENS POINTClinical Field Experience ReportStudent_\)}517jJlL_Y;_?CJfi~4:_. Cooperating Teacher-11!~pJ-,Z2 ~Ul.[1l?1?:Z.-SChOOI/City-'J~bG'~.Y~'=~-/In; L!L~'pIijED11;J1I~L/J'1I; ;f5t711{elP~Subject/Grade LeveL
Wisc Stevens Point - JSCHI - 388
Wisc Stevens Point - JSCHI - 388
Wisc Stevens Point - JSCHI - 388
Wisc Stevens Point - JSCHI - 388
Wisc Stevens Point - JSCHI - 388
Wisc Stevens Point - JSCHI - 388
UNIVERSITY OF WISCONSIN STEVENS POINT Observation & Proactive Evaluation Report-1 'I -lntern -Practicum -Total Practicum Hours Student eacher ~arne ;Tos~hC;ch;d/dDate 5#mbL? 17: 200,Cooperating Teacfpr-rSubjectIGrade Level N a m e of Work Wisce
Wisc Stevens Point - JSCHI - 388
University of Wisconsin - Stevens Point Student Tqching Summary Evaluation Report Teacher Candidate: Joseph J. Shielka Cooperating Teacher: Roger SchmidekeGrade/Subjeets Taught: Grades 7-11Severe Learning Disabilities, EmotionaVBehavid Disabilities
Wisc Stevens Point - JSCHI - 388
FILE NUMBm.72 MIDDLE CHILDHOOD to EAR73 EARLY ADOLESCEThe holder must be successfully 8RAL .DJSABILITIESofessional Development Plan as
Wisc Stevens Point - JSCHI - 388
Wisc Stevens Point - JSCHI - 388
Unlverslty of Wisconsin-Stevens PointCollege of Professional Studies School of Education - Graduate AdvisingStevens Point, WI 54481-3897 (7 15) 346-4403 FAX ( 7 1 5) 346-4846Education ' Health Promotion 8. Human Development Communicative Disorders
Wisc Stevens Point - JSCHI - 388
University of Wisconsin-Stevens PointCollege of Professional Studies School of EducationStevens Point,W 54481-3897 I(7 15) 346-4430 FAX (7 15) 346-4846Education Health Promotion & Human Dwelopment Communicative Disorders Medical Technology He
Wisc Stevens Point - JSCHI - 388
UPenn - CIS - 610
Math 602, Fall 2002, HW 5, due 12/10/2002Part A AI) (Vector bundles) As usual, TOP is the category of topological spaces and k will be either the real or complex numbers. All vector spaces are to be finite dimensional. A vector space family over X,
University of Texas - I - 382
Intellectual PropertyISchool 2004 SciTech Reference Sources Nature of PropertyProperty can be bought, sold, rented, willed, inherited, or otherwise possessed. It can also be lost, found, stolen, or taxed. Property ownership entails many p
University of Texas - I - 382
Gray & Proprietary LiteratureISchool 2004 Definition: Gray Lit Frankly, gray literature is an abstract concept because for every generalization there are exceptions. Most reference people just know it when they see it! After this lectur
University of Texas - I - 382
Standards and Specifications and Product InformationISchool 2004 Bit of vocabStandards SpecificationsCodes Regulations Rules Used interchangably Standards are where:All aspects of GovernmentIndustry/manufacturing Societypeople
Michigan State University - MURPH - 250
Alison M. Murphymurph250@msu.edu 327 Chesterfield Pkwy East Lansing, Mi 48823 60 Merwood Dr. Battle Creek, MI 49017Professional Goals: I hope to one day be a secondary physics and mathematics teacher. Education: 2006 Michigan State University, Eas
UPenn - V - 000411
UNIVERSITY of PENNSYLVANIATuesday, April 11, 2000 Volume 46 Number 28 www.upenn.edu/almanac/Drew Faust: Dean of Radcliffe Institute for Advanced StudyDr. Drew Gilpin Faust, the Annenberg Professor of History, has been named the first Dean of the
Wisc Stevens Point - EBRUH - 731
Pre-Evaluation LetterErinn Bruhnp. 1 of 6To the Parent/Guardian of DaisyI have been observing your daughter Daisy, a kindergartener in the local elementary school. In her classroom, there are twenty-two other students. The classroom is warm an
Wisc Stevens Point - EDU - 731
Title One ReadingErinn Bruhn Education 205 Spring 2006What is Title One Reading? Definition Who does this help?Where Did This Program Come From? Elementary and Secondary Act (ESEA)How Is This Program Funded? Congress SchoolsEvidence
SCAD - CA - 301
float wave_height(float direction, phase, freq, amplitude){return sin(direction + phase) * 2 * PI * freq) * amplitude;}displacement ren_wave1(float Km = 0.1, freq = 1.0, phase = 0){floathump = 0;pointn = normalize(N);if (s > 0.3) & (s < 0.7)h
SCAD - CA - 301
float wave_height(float direction, phase, freq, amplitude){return sin(direction + phase) * 2 * PI * freq) * amplitude;}displacement ren_wave2(float Km = 0.1, freq = 1.0, phase = 0){floathump = 0;pointn = normalize(N);if (s > 0.5 & t < 0.5) | (s
SCAD - CA - 301
float wave_height(float direction, phase, freq, amplitude){return sin(direction + phase) * 2 * PI * freq) * amplitude;}displacement ren_wave3(float Km = 0.1, freq = 1.0, phase = 0){floathump = 0;pointn = normalize(N);float rounding = 0.05;float ra
SCAD - CA - 301
float wave_height(float direction, phase, freq, amplitude){return sin(direction + phase) * 2 * PI * freq) * amplitude;}displacement ren_wave4(float Km = 0.1, freq = 1.0, phase = 0){floathump = 0;pointn = normalize(N);float rounding = 0.05;float ra
SCAD - CA - 301
displacement disp_shader_s1(float Km = 0.1){floathump = 0, i;pointn;n = normalize(N);for (i = 0.0; i < 1.0; i = i + 0.1) {if (t > i & t <= (i + 0.1) {hump = i;}}P = P - n * hump * Km;N = calculatenormal(P);}
SCAD - CA - 301
displacement disp_shader_s1(float Km = 0.1){floathump = 0;pointn;n = normalize(N);if (t < 0.5) hump = t;else hump = 1 - t;P = P - n * hump * Km;N = calculatenormal(P);}
SCAD - CA - 301
displacement disp_shader_s1(float Km = 0.1){floathump = 0;pointn;n = normalize(N);if (s + t) < 1.0) hump = 1.0;P = P - n * hump * Km;N = calculatenormal(P);}
SCAD - CA - 301
displacement disp_shader_s1(float Km = 0.1){floathump = 0, a;pointn;n = normalize(N);a = s + t;if (a < 0.7 | a > 1.3) hump = 1.0;P = P - n * hump * Km;N = calculatenormal(P);}
UPenn - STAT - 111
Day 17: Comparing Two MeansLast Time: We relaxed the assumption that we know the population standard deviation and looked at hypothesis tests and confidence intervals for the (unknown) mean of a population with unknown standard deviation. We saw th
UPenn - STAT - 111
1. In each situation below, is it reasonable to use a binomial distribution for the random variable X? Give reasons for your answer in each case. If X does have a binomial distribution, identify the parameters n and p if you can do so. (a) Roulette i
SCAD - VSFX - 319
Option "searchpath" "shader" "@:H:/vsfx319/shaders"Option "searchpath" "texture" "H:/vsfx319/textures"Display "untitled" "it" "rgb"Format 954 480 1#Format 427 240 1DepthOfField 5 1 7 #camera1,2##DepthOfField 11 .5 11 #camera3##DepthOfField 1
SCAD - VSFX - 319
Option "searchpath" "shader" "@:H:/vsfx319/shaders"Option "searchpath" "texture" "H:/vsfx319/textures"Display "Quadrics" "framebuffer" "rgb"Projection "perspective" "fov" 60Format 954 480 1DepthOfField 2.4 1 12# f-stop, constant 1, focal dista
Rutgers - CS - 107
CS107 Page 1Practice Questions for Final name _CS 107 Computing for Math and SciencePractice Questions for Final - Answers1 Sorting2 Suppose we are in the middle of doing a selection sort and the situation is as pictured below: | ==> ignore
Rutgers - CS - 107
CS107 Page 1Exam 2 name _CS 107 Computing for Math and Science Spring, 2007Practice Exam 2 Do not sit near anyone you studied with. Do not start until everyone has an exam and the instructor tells you to begin. There are 4 pages in this e
Rutgers - CS - 107
CS107 Page 1Exam 2 name _CS 107 Computing for Math and Science Spring, 2007Practice Exam 2 with Answers Do not sit near anyone you studied with. Do not start until everyone has an exam and the instructor tells you to begin. There are 4 pa
Rutgers - CS - 107
CS107 Page 1Exam 2 name _CS 107 Computing for Math and Science Spring, 2007More Practice for Exam 21 The following code checks to see if any number in a vector is 0. If there is a 0, it sets the variable found0 to 1 (true), otherwise false. f
Rutgers - CS - 107
CS107 Page 1Exam 2 name _CS 107 Computing for Math and Science Spring, 2007More Practice for Exam 21 The following code checks to see if any number in a vector is 0. If there is a 0, it sets the variable found0 to 1 (true), otherwise false. f
Rutgers - CS - 107
CS107 Page 1Practice Exam 1 name _CS 107 Computing for Math and Science Spring 2007Practice Exam 1 Do not start until everyone has an exam and the instructor tells you to begin. There are 5 pages in this exam, including this one. Make sure
Rutgers - CS - 107
CS107 Page 1Practice Exam 1 name _CS 107 Computing for Math and Science Spring, 2007Practice Exam 1 with answersDo not start until everyone has an exam and the instructor tells you to begin. There are 5 pages in this exam, including this one.
SCAD - VSFX - 319
/* Shader description goes here */surfacemaya_pattern(floatKfb = 1,inv_circle_size = .03,black_circle_size = .01,repeats = 7,left_right = .5,up_down = .5;color stripe = color(0,0,1),background_color = color
Rutgers - CS - 107
CS107: Computing for Math and ScienceInstructor:Prof. Louis Steinberg office: Hill 401 email: lou@cs.rutgers.edu Office hours: by appointmentTAs: Tzvi Chumash Lu HanCS107, Prof. Steinberg, f06Lecture 011CS107: Computing for Math
Rutgers - CS - 107
CS107: Computing for Math and ScienceLecture 04: Strings, indexing Means-endsCS107, Prof. Steinberg, S07 Lecture 041Assignment 1 Due Thursday Don't leave it for the last minuteCS107, Prof. Steinberg, S07Lecture 042FunctionsFunctio
Rutgers - CS - 107
CS107: Computing for Math and ScienceLecture 05: booleans ifsCS107, Prof. Steinberg, S07 Lecture 051Assig. 2PostedCS107, Prof. Steinberg, S07Lecture 052Vectors of Numbers Sequence is called a "vector" [22+3 1 32] Square brackets,
Rutgers - CS - 107
CS107: Computing for Math and ScienceLecture 06: IF and Nested IFCS107, Prof. Steinberg, S07Lecture 061Exam in one week First exam one week from tonight Normal class time NOT this classroom - room to be announced Topic list, practice
Rutgers - CS - 107
CS107: Computing for Math and ScienceLecture 07: Boolean vectors Matrices LoopsCS107, Prof. Steinberg, f06 Lecture 071Exam I100 80 60 40 20 01 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39CS107, Prof. Steinberg, f06Lecture 0721
Rutgers - CS - 107
CS107: Computing for Math and ScienceLecture 08: LoopsCS107, Prof. Steinberg, S07Lecture 081LoopsTo repeat the same lines of code over and over, use a for statementfor j = [1:5] disp(j) endCS107, Prof. Steinberg, S07Lecture 082Lo
Rutgers - CS - 107
CS107: Computing for Math and ScienceLecture 09: Loops Proving programs correctCS107, Prof. Steinberg, s07 Lecture 0911+2+3+.+n1 4 5 2 3 5 3 2 5 4 1 5= n*(n+1)1 + 2 + . + n =n*(n+1)/2CS107, Prof. Steinberg, s07Lecture 092While Loop
Rutgers - CS - 107
CS107: Computing for Math and ScienceLecture 10: Proving programs correctCS107, Prof. Steinberg, s07Lecture 101ExampleFind first character in line that is a vowel place = 1; while (place <= length(line) & line(place) ~=`a' & line(place) ~=`