02_GreedyAlgorithms_1.ppt

# 02_GreedyAlgorithms_1.ppt - CSC 30155 Wednesday Dr Daniel...

This preview shows pages 1–11. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CSC 30155 Wednesday 08/09/10 Dr. Daniel Hughes [email protected] This Lecture l Information on Timetable Problems (10 mins) l Re-Introduction to CS30155 (20 mins) l Greedy Algorithms Part 1 (30 mins) l Simulation Exercise (20 mins) l Home Work: The Friendship Algorithm (10 mins) l Free Study Time (30 mins) Timetable Problems l Confusion over the time-table occurred due updates in made by the CSSE department that were not implemented by registry. l The correct code for this module is: CS30155: Efficient Sequential Algorithms . l The book may have been recommended for a different module. I suggest you check each of your computing modules and if none of them need the book, let me know. l The book is also useful for CS30325: Advanced Web Technologies , which I will take you for next semester. Course Prerequisites l Previously, this course was offered only to ICS students. The module specification states that you should already have taken CS10115: Algorithmic Foundations and Problem Solving . l This means that I expected you to be able to do the following: 1. Be able to carry out asymptotic analysis of algorithms. 2. Be able to apply standard methods to determine the asymptotic run-time of simple Divide-and-Conquer procedures. 3. Be familiar with key paradigms for algorithm development. 4. Have a basic appreciation of the concept of complexity classes and their role in categorizing decision problems. Back to the Problem l IMS students have not completed CS10115 and so do not have the usual prerequisites for this module. l But Don’t Panic! l I will instead go over all of the material that you need for this course. l We will not cover some of the advanced topics that were planned for this course. l As the module is changing, you should throw away the module plan that was distributed last lecture . How to Address Problems l Some students complained to Prof. Guan that they lacked the necessary prerequisites for this course. l It is very good to raise issues quickly so that we can fix them. I encourage you to do this . l However, in most cases it is more efficient to tell the lecturer about your problems directly, so it is best to enquire with me first. Any Questions? CSC 30155 (Re-) Introduction to Efficient Sequential Algorithms Dr. Daniel Hughes [email protected] Why are Efficient Algorithms Important? l Raw computational power is not enough! Badly written code may execute many orders of magnitude slower than good algorithms. l Learning good algorithm design principles will help you in many other areas (e.g. designing good business processes). l Moore’s Law works in two directions: Can anyone tell me what Moore’s Law is? Moore’s Law Moore’s Law states that the number of transistors that can be placed on an integrated circuit will double every two years....
View Full Document

## This note was uploaded on 05/22/2011 for the course CSC 30155 taught by Professor Garyli during the Spring '11 term at University of Liverpool.

### Page1 / 67

02_GreedyAlgorithms_1.ppt - CSC 30155 Wednesday Dr Daniel...

This preview shows document pages 1 - 11. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online