CS 46101–600/CS56101-002 Design and Analysis of Algorithms Dr. Angela Guercio Spring 2010.

Slides:



Advertisements
Similar presentations
Today’s Agenda  Syllabus CS2336: Computer Science II.
Advertisements

Data Structures and Algorithms (AT70.02) Comp. Sc. and Inf. Mgmt. Asian Institute of Technology.
Jan Welcome to the Course of Data Structures and Algorithms.
Jan Welcome to the Course of Advanced Algorithm Design (ACS-7101/3)
Math 115b Section 1 (Summer 07)  Instructor: Kerima Ratnayaka   Phone :  Office.
ST-CS19995: Introduction to Web Interface Design Prof. Angela Guercio Spring 2008.
Welcome to MAT 170. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Wednesday and Friday 10:40 am – 11:30 am and by appointment.
CSIS-385: Analysis of Algorithms Dr. Eric Breimer.
CSIS-385: Analysis of Algorithms Dr. Eric Breimer.
CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University.
CS Computer Science I – Programming and Problem Solving Prof. Angela Guercio Spring 2008.
Welcome to MAT 170. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday and Thursday 8 am – 8:30 am Tuesday and Thursday.
CS – 600 Discrete Structures for Computer Science Prof. Angela Guercio Spring 2008.
CS10051 Section 601 Introduction to Computer Science Fall 08 Dr. Angela Guercio Dr. C. David Hunter.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Lecture 1 Introduction/Overview Wed. 9/5/01.
Quantitative Methods II Instructor: Michael Moore.
CS – 600 Introduction to Computer Science Prof. Angela Guercio Spring 2008.
Math 115b Section 5(Spring 06)  Instructor: Kerima Ratnayaka   Phone :  Office.
Math 115b Section 1H(Spring 07)  Instructor: Kerima Ratnayaka   Phone :  Office.
Math 115a– Section 4  Instructor: Kerima Ratnayaka   Phone :  Office : MTL 124B.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2001 Lecture 1 Introduction/Overview Wed. 1/31/01.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2000 Lecture 1 Introduction/Overview Wed. 9/6/00.
BA 378: Accounting Information Systems Instructor: Dr. James R. Coakley.
IS 320: Data Structures Spring Quarter DESCRIPTION This class is an introduction to data structures. The primary data structures—list, stack, queue,
A Brief Calculus Course
COP4020/CGS5426 Programming languages Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: T, H 10:00am – 11:30am Class website:
CS 450: COMPUTER GRAPHICS COURSE AND SYLLABUS OVERVIEW SPRING 2015 DR. MICHAEL J. REALE.
© 2004 Goodrich, Tamassia CS2210 Data Structures and Algorithms Lecture 1: Course Overview Instructor: Olga Veksler.
CLASS ORIENTATION MGMT 464 Project Management Spring 2014.
Introduction to MA Day 1. Name: Charlotte Bailey Office: MATH 802 Office Phone: (765)
Introduction to MA Introduction to Calculus
CS223 Algorithms D-Term 2013 Instructor: Mohamed Eltabakh WPI, CS Introduction Slide 1.
ST-CS Introduction to Web Interface Design Fall 2010 Dr. Angela Guercio ( Course Web.
Creating Your Class Syllabus. The Syllabus is a Contract! It is a contract between you and your students. It should include ALL information the students.
Course name : computer essentials. Instructor: Basma Alabdullatif Office: computer department instructors office, 1st floor Office hours: Saturday (11:00-01:00)
(Course Introduction) Level 2 Nouf Aljaffan 1 st Term Nouf Aljaffan (C) CSC 1201 Course at KSU 1202 CSC Introduction to Communications.
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
1 Object Oriented Design COP 3331 Spring 2011 MWF 11:50 AM – 12:40 PM CHE 103 Instructor:Dr. Rollins Turner Dept. of Computer Science and Engineering ENB.
CS1201: Programming Language 2 C++(Course Introduction) Level 2 Nouf Aljaffan 1 st Term Nouf Aljaffan (C) CSC 1201 Course at KSU.
1 Software Systems Development CEN Spring 2011 TR 12:30 PM – 1:45 PM ENB 116 Instructor:Dr. Rollins Turner Dept. of Computer Science and Engineering.
CS 23021–600 Computer Science I Dr. Angela Guercio Spring 2010.
Data Structures (Second Part) Lecture 1 Bong-Soo Sohn Assistant Professor School of Computer Science and Engineering Chung-Ang University.
Introduction to Data Structures
Course Introduction Andy Wang COP 4530 / CGS 5425 Fall 2003, Section 4.
CS 456 Advanced Algorithms Where: Engineering Bldg When: Monday & Wednesday 12:00 – 1:15 p.m. Texts: Algorithm Design, Jon Kleinberg & Eva Tardos.
Introduction to ECE 2401 Data Structure Fall 2005 Chapter 0 Chen, Chang-Sheng
Instructor: Basma Alabdullatif Office: Preparatory Year instructors office, 1st floor Office hours: sat(11-1), sun(11-1)
Welcome Back Physical Science Faculty Spring 2011.
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
ACIS 3504 Accounting Systems and Controls. 2 Dr. Linda Wallace  Office: Pamplin 3092  
COP4610/CGS5765 Operating Systems Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: W M F 9:10am – 10:00am, or by appointments.
CS Introduction to Computer Science Spring 2011 Dr. Angela Guercio (
1 Data Structures COP 4530 Spring 2010 MW 4:35 PM – 5:50 PM CHE 101 Instructor:Dr. Rollins Turner Dept. of Computer Science and Engineering ENB
Introduction to MA Introduction to Calculus A Brief Calculus Course Spring 2016 Semester.
CS151 Introduction to Digital Design Noura Alhakbani Prince Sultan University, College for Women.
CST 223 Concepts of Programming Languages Dr. Sherry Yang PV 171
Course Info Instructor U.T. Nguyen Office: CSEB Office hours: Tuesday, 14:30-15:30 Thursday, 12:00-12:45 By.
Welcome to Cpt S 350 Design and Analysis of Algorithms Syllabus and Introduction.
Math 115a Section 2(Summer 05)  Instructor: Kerima Ratnayaka   Phone :  Office.
CS Computer Architecture Fall 2010 Dr. Angela Guercio ( Course Web Page
Design and Analysis of Algorithms CS st Term Course Syllabus Cairo University Faculty of Computers and Information.
Networking CS 3470, Section 1 Sarah Diesburg
CS5040: Data Structures and Algorithms
Introduction to MA Day 1.
Introduction to MA Day 1.
Definition In simple terms, an algorithm is a series of instructions to solve a problem (complete a task) We focus on Deterministic Algorithms Under the.
CS Computer Science II: Data Structures and Abstraction Fall 2009
COMP 122 – Design and Analysis of Algorithms
CS 232 Geometric Algorithms: Lecture 1
CS 474/674 – Image Processing Fall Prof. Bebis.
Presentation transcript:

CS 46101–600/CS Design and Analysis of Algorithms Dr. Angela Guercio Spring 2010

Instructor Angela Guercio Office: 424, Main Hall Phone: (KSU ext 53424) Best way to contact me: Office Hours: MW 11:00am - 12:00pm 4:00pm – 6:00pm other times are available by appointment

The Syllabus: the Webpage Class web page o 0/CS46101Sp10.html 0/CS46101Sp10.html o or simply reach and select your course Check the page regularly! Assignments, Deadlines, Communications about the class are there!

The Syllabus: The Textbook Introduction to Algorithms, 3/E, Cormen, Leiserson, Rivest and Stein, The MIT Press, 2009, ISBN: Other reading material will be given or suggested in class

The Syllabus: Grading Assignments (3 - 5) 40% Midterm Exams (2) 40% Final Exam20%

The Syllabus: Grading Total percentage earned GradeTotal percentage earned Grade %A %B %A-70 – 79%C %B+66 – 69%D %B65% and below F

Assignments and Exams 3-5 Homework and Pop Quizzes 2 Exams (100 points each) Final Exam (100 points) No Make-up exams Except in extreme case and only if I have been notified prior the exam has been issued

Homework Late Penalty: 10% per day No late assignment accepted after the assignment is graded and returned. You may discuss the interpretation of the assignment with your classmates, however you may not discuss possible solutions. Copied solution of an individual assignment will receive a zero grade NO HAND WRITTEN HW ACCEPTED. HW accepted WITH printed copy for grading.

The Syllabus: Requirements Class attendance is required. If you miss a class, let me know ahead of time if you miss more than 4 classes without a documented reason or without making prior arrangements with me, your final grade will be dropped one grade (A to B, B+ to C+ and so on). You are responsible for bringing yourself up-to- date on class material and assignments Reading material before class is required

The Syllabus: Important Dates Last day to drop the class: without W grade: Jan 31 with W grade: April 4 Exam 1: Mon., Feb 22 Exam 2: Mon., March 22 Final Exam: Wed., May 12 (6pm-8pm) Spring Recess: March 29 - April 4 Classes End: May 8, 2010

The Syllabus: Other Information Academic Honesty Policy Cheating or plagiarism is considered a serious academic offense and will result in receiving a failing grade for the work of the course. Repeated offenses result in dismissal from the University. Code of Conduct As indicated in The Digest of Rules and Regulations that you can find in the University Telephone directory.

Students with Disabilities for accommodations contact the disability coordinator on campus, Kelly Kulick in Student Accessibility Services, located in the Student Success Center, lower level of the Campus Center, phone (330) , or Emergency In case of an emergency please contact the security on campus. Security phone on campus: #53123 Security cell phone (330) or, of course, 911. I recommend that you program into your cell phone the previous numbers.

Overview of the course Introduction to algorithmic concepts design and complexity analysis of algorithms searching sorting graphs geometric, algebraic and parallel algorithms. Key concepts: divide-and-conquer, sorting, dynamic programming, greedy algorithms, graph algorithms, NP-completeness.

Expected outcomes: By the end of the course you should be able to design appropriate algorithms for complex problems and analyze the complexity of algorithms.

Tentative Outline of the Course WeekTopic Week 1Introduction - Growth of Functions Week 2Divide-and-Conquer Week 3Heapsort - Quicksort Week 4Linear Time Sorting Week 5Review of Data Structures - Hash Tables Week 6Binary Search Trees - Red-Black Trees Week 7Dynamic Programming Week 8Greedy Algorithms Week 9B-Trees Week 10Graph Algorithms Week 11Minimum Spanning Trees Week 12Matrix Operations Week 13String Matching Week 14NP-Completeness Week 15Approximation Algorithms