Algorithm Design by Éva Tardos and Jon Kleinberg Slides by Kevin Wayne Copyright © 2004 Addison Wesley COS 423: Theory of Algorithms Kevin Wayne Princeton.

Slides:



Advertisements
Similar presentations
Lecture 0: Course Overview
Advertisements

COEN 352 Data structures and Algorithms R. Dssouli.
Design and Analysis of Algorithms Maria-Florina (Nina) Balcan Lecture 1, Jan. 14 th 2011.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Data Structures & Algorithms Richard Newman Clip Art Sources s s s s
1 Course Information Parallel Computing Fall 2008.
1 Course Information Parallel Computing Spring 2010.
Welcome to Introduction to Java Programming At J.D.O’Bryant Science & Mathematics Chonho Lee Department of Computer Science University of Massachusetts.
About the Course Lecture 0: Sep 2 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
COMS W1004 Introduction to Computer Science June 25, 2008.
COMS W1004 Introduction to Computer Science May 28, 2008.
Welcome to MAT 142. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday 10:30 am – 12 noon Thursday 10:30 am – 12 noon.
CSC 171 – FALL 2004 COMPUTER PROGRAMMING LECTURE 0 ADMINISTRATION.
EE 220 (Data Structures and Analysis of Algorithms) Instructor: Saswati Sarkar T.A. Prasanna Chaporkar, Programming.
NRS 122 Concepts of Mental Health Nursing Orientation for Spring 2015 Semester.
Piyush Kumar (Lecture 1: Introduction)
Spring 2008 Mark Fontenot CSE Honors Principles of Computer Science I Note Set 1 1.
Computer Network Fundamentals CNT4007C
Numerical Computation Lecture 0: Course Introduction Dr. Weifeng SU United International College Autumn 2010.
Math 125 Statistics. About me  Nedjla Ougouag, PhD  Office: Room 702H  Ph: (312)   Homepage:
CSCI-256 Data Structures & Algorithm Analysis Lecture Note: Some slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved. 1.
Computer Networks CEN 5501C Spring, 2008 Ye Xia (Pronounced as “Yeh Siah”)
SE-308 Software Engineering-II 7th Term SE University of Engineering & Technology Taxila, Pakistan Software Engineering Department.
Analysis of algorithms Richard Kelley. welcome!  You’re in SEM 261.  This is analysis of algorithms  Please make sure you’re in the right place.
CPS120: Introduction to Computer Science Fall: 2002 Instructor: Paul J. Millis.
About Me Jesse Hartloff, PhD Office: 203 Davis (may change) Office hours: TBD.
Complex Systems Engineering CSE - SWE 488 Prof. Mohamed Batouche
CSCI-256 Data Structures & Algorithm Analysis Lecture Note: Some slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved. 4.
MTH 201 Discrete Mathematics Fall Term MTH 201 Discrete Mathematics Fall Term INTERNATIONAL BURCH UNIVERSITY DEPARTMENT of INFORMATION.
CS 312: Algorithm Analysis Lecture #1: Algorithms and Efficiency This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.Creative.
CSE 3802 / ECE 3431 Numerical Methods in Scientific Computation
Lecture Section 001 Spring 2008 Mike O’Dell CSE 1301 Computer Literacy.
CS 456 Advanced Algorithms Where: Engineering Bldg When: Monday & Wednesday 12:00 – 1:15 p.m. Texts: Algorithm Design, Jon Kleinberg & Eva Tardos.
CPS120: Introduction to Computer Science Winter 2002 Instructor: Paul J. Millis.
Algorithm Design by Éva Tardos and Jon Kleinberg Copyright © 2005 Addison Wesley Slides by Kevin Wayne 7. Edmonds-karp Demo.
Introduction Fall 2001 Foundations of Computer Systems Prerequisite:91.166* or * Section A Instructor: Dr. David Hutchinson Office:
CSE 421 Algorithms Richard Anderson Winter 2009 Lecture 1.
COT 5405: Design and Analysis of Algorithms Cliff Zou Spring 2015.
CEN 111 Introduction to Algorithms and Programming INTERNATIONAL BURCH UNIVERSITY DEPARTMENT of INFORMATION TECHNOLOGIES Dr. Günay Karlı
1 CAP 4063 Web Application Design Summer 2012 TR 9:30 – 11:40 PM CHE 102 Instructor:Dr. Rollins Turner Dept. of Computer Science and Engineering ENB 336.
Nonlinear Control Systems ECSE 6420 Spring 2009 Lecture 1: 12 January 2009.
Introduction to Computing BBA-I/BSCS-I Instructor: M. Mateen Yaqoob.
CSCI 256 Data Structures and Algorithm Analysis lecture 1 Some slides by Kevin Wayne copyright 2005, Pearson Addison Wesley all rights reserved, and some.
CS 123 Computational Lab IIl Spring 2008 Department of Computer Science Drexel University Copyright by the authors. Permission is given for students and.
1 CS 381 Introduction to Discrete Structures Lecture #1 Syllabus Week 1.
EE 372: Engineering Electromagnetics II Spring 2016.
Computer Networks CNT5106C
Analysis of Algorithms: Math Review Richard Kelley, Lecture 2.
Welcome to PHY2170/2175 G. Bonvicini, Wayne State University –The purpose of the course –Web sites connected to course –Labs, old text books, etc. –How.
Physics 211 College Physics I. Introduction  Instructor:Larry Watson  Office:105 Witmer  Phone:   web:und.nodak.edu/instruct/lwatson/211.
1.  A step by step process to solve any problem is called algorithm.  Algorithm is a process which take some values as input and provide us output.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Spring 2008 Mark Fontenot CSE 1341 – Honors Principles of Computer Science I Note Set 1 1.
Design and Analysis of Algorithms Peng ZHANG ( 张鹏 ) School of Computer Science and Technology, Shandong University.
Course Overview 1 MAT 279 Data Communication and the Internet Prof. Shamik Sengupta Office 4210 N
CSCI 1730: C++ and System Programming
Formal Languages and Automata Theory
Syllabus Introduction to Computer Science
Piyush Kumar (Lecture 1: Introduction)
Piyush Kumar (Lecture 1: Introduction)
Chapter 2 Basics of Algorithm Analysis
Data Structures and Algorithms CSE 465
Algorithms Algorithm. [webster.com] A procedure for solving a mathematical problem (as of finding the greatest common divisor) in a finite number of steps.
Piyush Kumar (Lecture 1: Introduction)
Chapter 2 Basics of Algorithm Analysis
Algorithm: Word comes from Arabic Author Abū ‘Abdallāh Muḥammad ibn Mūsā al-Khwārizmī Algorism Algebra: Kitab al-Mukhtasar fi Hisab al-Jabr wal-Muqabala.
Piyush Kumar (Lecture 1: Introduction)
Design and Analysis of Algorithms
Digital Signal Processing Spring, 2019
Welcome to the most Amazing course there is 
Presentation transcript:

Algorithm Design by Éva Tardos and Jon Kleinberg Slides by Kevin Wayne Copyright © 2004 Addison Wesley COS 423: Theory of Algorithms Kevin Wayne Princeton University Spring 2005

2 Administrative Stuff Lectures. Kevin Wayne n MW :50, Friend 109. n Attendance is expected. Precept. Amit Agarwal, Joshua Podolak n Monday 8pm, room TBA. n Preceptor works out problems. Prereq. COS 226 and COS 341, or instructor's permission. Textbook. Algorithm Design by Éva Tardos and Jon Kleinberg. n Available at Triangle Copy, 150 Nassau Street. Course web site. see me after class

3 Grades Grading. n "Weekly" problem sets, due Wednesday 11am in class. n Class participation, staff discretion for borderline cases. n No exams. n See handout on writing solutions. Course grades. n Undergrads: determined without considering grad students. n Grads: determined using undergrad scale. you are here subject to change at instructor's whim

4 Collaboration Collaboration policy. (see handout; ask if unsure) n Course materials are always permitted. n You are encouraged to attend office hours as needed. n No external resources, e.g., Google, Tarjan. "Collaboration permitted" problem sets. n Can form study group of up to 3 students. n Study group must work on each problem jointly. n You must write up solutions individually. "No collaboration" problem sets. n Can always consult course staff.

5 Algorithm. n [webster.com] A procedure for solving a mathematical problem (as of finding the greatest common divisor) in a finite number of steps that frequently involves repetition of an operation. n [Knuth, TAOCP] An algorithm is a finite, definite, effective procedure, with some input and some output. Algorithms Great algorithms are the poetry of computation. Just like verse, they can be terse, allusive, dense, and even mysterious. But once unlocked, they cast a brilliant new light on some aspect of computing. - Francis Sullivan

6 Etymology. [Knuth, TAOCP] n Algorism = process of doing arithmetic using Arabic numerals. n A misperception: algiros [painful] + arithmos [number]. n True origin: Abu 'Abd Allah Muhammad ibn Musa al-Khwarizm was a famous 9th century Persian textbook author who wrote Kitab al- jabr wa'l-muqabala, which evolved into today's high school algebra text. Etymology

7 Theory of Algorithms "As soon as an Analytic Engine exists, it will necessarily guide the future course of the science. Whenever any result is sought by its aid, the question will arise - By what course of calculation can these results be arrived at by the machine in the shortest time? - Charles Babbage

8 Algorithmic Paradigms Design and analysis of computer algorithms. n Greed. n Divide-and-conquer. n Dynamic programming. n Network flow. n Randomized algorithms. n Intractability. n Coping with intractability. Critical thinking and problem-solving.

9 Applications Wide range of applications. n Caching. n Compilers. n Databases. n Scheduling. n Networking. n Data analysis. n Signal processing. n Computer graphics. n Scientific computing. n Operations research. n Artificial intelligence. n Computational biology. n... We focus on algorithms and techniques that are useful in practice.