香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 1 Introduction to the course

60:sysis of Algorithms Week 1:Introduction Instructor:Shengyu Zhang
Instructor: Shengyu Zhang

First week Part l:About the course Part ll:About algorithms ▣Vhat are algorithms? Why are they important to study? Part Ill:About complexity What is the complexity of an algorithm a problem Growth of functions
First week ◼ Part I: About the course ◼ Part II: About algorithms ❑ What are algorithms? ❑ Why are they important to study? ◼ Part III: About complexity ❑ What is the complexity of an algorithm / a problem ❑ Growth of functions

Part I:About the course
Part I: About the course

Tutorials Tutorials:Let's set the time now. Tuesday:5:30pm-6:15pm Webpage: http://www.cse.cuhk.edu.hk/~syzhang/course/Alg15 Information (time and venue,TA,textbook,etc.) Lecture slides oTutorials Homework Announcements
Tutorials ◼ Tutorials: Let’s set the time now. ❑ Tuesday: 5:30pm-6:15pm ◼ Webpage: http://www.cse.cuhk.edu.hk/~syzhang/course/Alg15 ❑ Information (time and venue, TA, textbook, etc.) ❑ Lecture slides ❑ Tutorials ❑ Homework ❑ Announcements

About the flavor of the course It's more of a math flavor than a programming one. You will need to write pseudo-code,but never C/Java/... You will design and analyze,think and prove (rather than code)
About the flavor of the course ◼ It’s more of a math flavor than a programming one. ◼ You will need to write pseudo-code, but never C/Java/… ◼ You will design and analyze, think and prove (rather than code)

Prerequisites Officially: CSC2110 DISCRETE MATHEMATICS 口CSC2100/ESTR2102 DATA STRUCTURES Effectively:Basic mathematical maturity functions,polynomial,exponential; a proof by induction; basic data structure operations (stack,queue,...) basic math manipulations... Note:As long as you'd like to learn it
Prerequisites ◼ Officially: ❑ CSC2110 DISCRETE MATHEMATICS ❑ CSC2100/ESTR2102 DATA STRUCTURES ◼ Effectively: Basic mathematical maturity ❑ functions, polynomial, exponential; ❑ proof by induction; ❑ basic data structure operations (stack, queue, …); ❑ basic math manipulations… ◼ Note: As long as you’d like to learn it

Homework,Exam Homework assignments (20%). ▣About4 assignments. ·Mid-term exam(30%). Final (50%)
Homework, Exam ◼ Homework assignments (20%). ❑ About 4 assignments. ◼ Mid-term exam (30%). ◼ Final (50%)

Homework Policy Discussions and googling on web are allowed in general But you have to write down the solution yourself And you fully understand what you write
Homework Policy ◼ Discussions and googling on web are allowed in general ◼ But you have to write down the solution yourself ◼ And you fully understand what you write

Zero tolerance for cheating/plagiarism Worse than a 0 score for this course;you may be out of dept/school/university. "The Chinese University of Hong Kong places very high importance on honesty in academic work submitted by students,and adopts a policy of zero tolerance on cheating and plagiarism.Any related offence will lead to disciplinary action including termination of studies at the University. ----Honesty in Academic Work (http://www.cuhk.edu.hk/policy/academichonesty)
Zero tolerance for cheating/plagiarism ◼ Worse than a 0 score for this course; you may be out of dept/school/university. ◼ “The Chinese University of Hong Kong places very high importance on honesty in academic work submitted by students, and adopts a policy of zero tolerance on cheating and plagiarism. Any related offence will lead to disciplinary action including termination of studies at the University.” ---- Honesty in Academic Work (http://www.cuhk.edu.hk/policy/academichonesty)

textbook ■Algorithms S.Dasgupta, C.H.Papadimitriou, Cbkjorithma U.V.Vazirani. McGraw-Hill Higher Education,2007. -Draft available at http://www.cs.berkel Sanjoy Dasgupta Christos Papadimitriou ey.edu/~vazirani/alg Umesh Vazirani orithms.html
textbook ◼ Algorithms S. Dasgupta, C.H. Papadimitriou, U.V. Vazirani, McGraw-Hill Higher Education, 2007. ◼ Draft available at http://www.cs.berkel ey.edu/~vazirani/alg orithms.html
按次数下载不扣除下载券;
注册用户24小时内重复下载只扣除一次;
顺序:VIP每日次数-->可用次数-->下载券;
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 12 Quantum information theory 4.pdf
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 11 Quantum information theory 3.pdf
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 10 Quantum information theory 2.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 9 Quantum information theory 1.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 8 Quantum communication complexity 2.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 7 Quantum communication complexity 1.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 6 Quantum query complexity.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 5 Searching algorithm and quantum adversary method.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 4 Hidden Subgroup Problems 2.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 3 Hidden Subgroup Problems 1.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 2 Shor's algorithm.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 1 Basics.docx
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 12 Quantum computing. Quantum algorithms, BQP, quantum non-locality, quantum games.pptx
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 11 Influence maximization on social network.pptx
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 10 Online learning. Expert problem.pptx
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 9 Online algorithm.pptx
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 8 Mechanism design.pptx
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 6 Algorithms for resource allocation.pptx
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 5 NP-Complete problems.pptx
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 4 Approximation algorithms.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 2 Single Source Shortest Paths.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 3 Greedy Algorithms.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 4 Randomized Algorithms.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 5 Dynamic Programming.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 10 NP-completeness.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 11 Approximation Algorithms.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 12 Online Algorithms.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 6 Linear Programming.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 7 Divide and Conquer.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 8 Maximum Network Flow.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 10 Stable Matching and Secretary Problem.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(辅导课件)tutorial 01.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(辅导课件)tutorial 10.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(辅导课件)tutorial 11.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(辅导课件)tutorial 12.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(辅导课件)tutorial 02.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(辅导课件)tutorial 03.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(辅导课件)tutorial 04.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(辅导课件)tutorial 05.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(辅导课件)tutorial 06.pptx