Edsger W. Dijkstra. ● Born May 11, 1930 in Rotterdam ● Graduated from Leiden in 1956 in Mathematics and Physics ● First employed by Mathematisch Centrum,

Slides:



Advertisements
Similar presentations
The President’s Lecture Series: Excellence in Academia Re-defining the Teaching-Research Nexus: Building the CityU Discovery-enriched Curriculum Arthur.
Advertisements

Assessment of Undergraduate Programs Neeraj Mittal Department of Computer Science The University of Texas at Dallas.
Michael Ghoorchian. Edsger W. Dijkstra ( ) Dutch Computer Scientist Received Turing Award for contribution to developing programming languages.
Dijkstra’s Algorithm MARLEY CANTRELL. About Dijkstra Dutch computer scientist Father was a Chemist, mother was a mathematician Received Turing Award for.
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet.
Copyright © 2006 The McGraw-Hill Companies, Inc. Programming Languages 2nd edition Tucker and Noonan Chapter 1 Overview A good programming language is.
1 Dijkstra's Shortest Path Algorithm Find shortest path from s to t. s 3 t
D IJKSTRA ' S ALGORITHM By Laksman Veeravagu and Luis Barrera.
1 Shortest Path Calculations in Graphs Prof. S. M. Lee Department of Computer Science.
1 Programming Languages Marjan Sirjani 2 1- The Study of Programming Languages The purpose of language is simply that it must convey meaning. (Confucius)
28 August 2015T Kari Laitinen1 T Seminar on Wireless Future 3 ECTS cr Dr. Kari Laitinen Principal Lecturer Oulu University of Applied Sciences.
 2003 Prentice Hall, Inc. All rights reserved. 1 Dijkstra Letter Quotes...the quality of programmers is a decreasing function of the density of go to.
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
Relevance of Maths for CS John Barnden School of Computer Science University of Birmingham Intro to Maths for CS 2013/14.
Introduction CS 3358 Data Structures. What is Computer Science? Computer Science is the study of algorithms, including their  Formal and mathematical.
1 Programming Languages Introduction. 2 Overview Motivation Why study programming languages? Some key concepts.
1 Programming Languages Marjan Sirjani Course web site:
By: Kateris $cott Submitted To: Mr. Timothy Holston $eymour Ginsburg.
CSC 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Efficient.
Introduction CS 3358 Data Structures. What is Computer Science? Computer Science is the study of algorithms, including their  Formal and mathematical.
Center for Reliable Engineering Computing (REC) We handle computations with care Founded 2000.
© Calvin College, For a number of years I have been familiar with the observation that the quality of programmers is a decreasing function of the.
General Education at Oakland University. General Education  Broad-based knowledge  Skills  Preparation for citizenship, further study, and careers.
Spring 2012 CS 214 Programming Languages. Details Moodle! REQUIRED text: Sebesta, Programming Language Concepts, 9ed. Important dates: February 17: Project.
Liskeard Launceston Callington St Austell Bodmin Starter Find the quickest route from St Austell to Launceston.
Engr. Isabelo Jun D. Paat, ME-CoE Lecturer 1 Programming Languages.
1 Introduction to Algorithms L ECTURE 17 (Chap. 24) Shortest paths I 24.2 Single-source shortest paths 24.3 Dijkstra’s algorithm Edsger Wybe Dijkstra
Ole-Johan Dahl ACM Turing Award (2001) Presentation by Carsten Hood CSCE | Spring 2014.
C H A P T E R E L E V E N Concurrent Programming Programming Languages – Principles and Paradigms by Allen Tucker, Robert Noonan.
Decision Maths 1 Shortest path algorithm Dijkstra’s Algorithm A V Ali :
CSC3315 (Spring 2009)1 CSC 3315 Languages & Compilers Hamid Harroud School of Science and Engineering, Akhawayn University
Kelsie Pederson.  Born July 24, 1972  Arizona University  B.S. Mathematics (1994 Honors)  M.Sc. Applied Mathematics (1996)  University of Washington.
© 2015 D JAGHE Walter Shewhart & the Philosophy of Software David Alan Grier Center for International Science & Technology Policy George Washington University.
CS 2130 Computational Structures (Discrete Mathematics for Computing)
Shortest Path Dr. Yasir. Weighted Graphs In many applications, each edge of a graph has an associated numerical value, called a weight. Usually, the edge.
Industry Advisory Board
ثبت و شناسايي درآمدها در دانشگاه علوم پزشکي تهيه و تنظيم : حسن اسحقي
Lab Safety Scientific Measurement Scientific Method
By Laksman Veeravagu and Luis Barrera
Chapter 4 (Part 1): Induction & Recursion
Royal University of Phnom Penh Master of Education
Programming Languages
Randy Pausch The Last Lecture With Jeffrey Zaslow
The energy-balance approach
Shortest Path Algorithm
CS 1104 INTRODUCTION TO COMPUTER SCIENCE
Five Mathematical Algorithms That Help Us Get There
Artificial Intelligence (Lecture 1)
Autumn 2016 Lecture 9 Dijkstra’s algorithm
Autumn 2015 Lecture 9 Dijkstra’s algorithm
The science of appetite
Efficient computation
Richard Anderson Lecture 9 Dijkstra’s algorithm
Programming Languages 2nd edition Tucker and Noonan
Communication Networks
MSc in Statistical Science Graduate Open Day – 31 October 2018
NordSecMob Master’s Programme in Security and Mobile Computing
Computer Science Section
Structured Programming
Communication Networks
Winter 2019 Lecture 9 Dijkstra’s algorithm
Shortest path problem and its application to optical network
Basic Concepts of Algorithm
Beyond the Formula, August 2004
3 Lecture in math Sets theory.
The Shortest Path Algorithm
Shortest Route Problems
OSPF Protocol.
Autumn 2019 Lecture 9 Dijkstra’s algorithm
Presentation transcript:

Edsger W. Dijkstra

● Born May 11, 1930 in Rotterdam ● Graduated from Leiden in 1956 in Mathematics and Physics ● First employed by Mathematisch Centrum, Amsterdam ● Moved to a professorship at Eindhoven University of Technology ● Worked as a research fellow at Burroughs Corp. ● Moved to Austin, TX in 1984 to become a professor at the UoT ● Retired in 2000 ● Died of Cancer August 6, 2002 ● Owned only 1 computer in his lifetime (Mac) ● Produced all his famous EWD papers in his own hand or on typewriter Life

Scientific Contributions ● Djikstra's Algorithm (Shortest Path) ● Semaphore's and Multiprogramming ● Self-Stabilization ● Contributed to the development of ALGOL 60 ● 1972 Turning Award for contributions to prog. languages ● Formal verification by program derivation ● EWD series of papers (1318) ● GOTO statement considered harmful ● Effects on computer science education

Relevance to Modern Computing ● S hortest-path algorithm is used in modern network routing (OSPF) ● Laid the foundation for multiprocessing ● Self-stabilization work makes modern networks possible ● EWDs influenced program verification, defined many topics

EWD 498: How do we tell truths that might hurt? ● “Programming is one of the most difficult branches of applied mathematics; the poorer mathematicians had better remain pure mathematicians.” ● “The tools we use have a profound (and devious!) influence on our thinking habits, and, therefore, on our thinking abilities.” ● “It is practically impossible to teach good programming to students that have had a prior exposure to BASIC: as potential programmers they are mentally mutilated beyond hope of regeneration.” ● “Simplicity is prerequisite for reliability.” ● “Projects promoting programming in 'natural language' are intrinsically doomed to fail.”