1. CS311 Design & Analysis of Algorithms Course Guide Layal Kazma Prince Sultan University, College for Women

2. Outline zCourse Description zCourse Objectives zCourse Resources zCourse Calendar zCourse Location & Office Hours zAttendance Policies zOther Policies (e.g., Plagiarism) zClass Participation zHomework Sample zQuizzes zMajor Exams & Final Exam zOverall Assessment zHow to Study for Course

3. Course Description zThis course introduces students to the techniques for designing and analyzing algorithms. The algorithm design paradigms include the divide-and-conquer approach, dynamic programming design method, greedy approach and backtracking algorithms. Also time complexity classes are introduced.

4. Course Objectives z Knowledge yAnalyse worst-case running times of algorithms using asymptotic analysis. Compare the asymptotic behaviours of functions obtained by elementary composition of polynomials, exponentials, and logarithmic functions. Describe the relative merits of worst-, average-, and best-case analysis. yAnalyse average-case running times of algorithms whose running time is probabilistic. Employ indicator random variables and linearity of expectation to perform the analyses. Recite analyses of algorithms that employ this method of analysis. yDescribe the divide-and-conquer paradigm and explain when an algorithmic design situation calls for it. Recite algorithms that employ this paradigm. Synthesize divide- and-conquer algorithms. Derive and solve recurrences describing the performance of divide-and-conquer algorithms.

5. Course Objectives zKnowledge yDescribe the dynamic-programming paradigm and explain when an algorithmic design situation calls for it. Recite algorithms that employ this paradigm. Synthesize dynamic-programming algorithms, and analyse them. yDescribe the greedy paradigm and explain when an algorithmic design situation calls for it. Recite algorithms that employ this paradigm. Synthesize greedy algorithms, and analyse them. yDescribe the backtracking technique and explain when an algorithmic design situation calls for it. Recite algorithms that employ this paradigm. Synthesize backtracking algorithms, and analyse them. yIntroduce and illustrate the computational complexity of algorithms.

6. Course Objectives z Cognitive Skills yCompare different algorithms in terms of efficiency and underlying strategy. yAnalyse and investigate complex problems and find a best suitable algorithm to solve the problem. zInterpersonal Skills and Responsibility yLearn, analyze, understand and evaluate any algorithm yCreating new Algorithms z Numerical and Communication Skills yAnalysis of algorithm involves a lot of mathematical computation to get a solution. yGroup work is highly recommended and applied in solving.

7. Course Resources zMain source yNeapolitan R. and Naimipour K. Foundations of Algorithms using C++ Pseudocode 3rd ed.  Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. 2nd ed Other resourceIntroduction to Algorithms ylecture room with projector.

8. Course Calendar AssessmentAssessment taskWeek dueProportion of Final Assessment 1Major Exam 1Week 515% 2Major Exam IIWeek 1120% 3Pop QuizzesThrough out semester 5% 43 AssignmentsThrough out semester 15 % 5Class ParticipationThrough out semester 5% 6Final ExamWeek 1740%

9. Course Location & Office Hours zMrs. Layal Kazma yOffice: W338 yEmail: lkazma@pscw.psc.edu.salkazma@pscw.psc.edu.sa  Course Home Page: lkazma.synthasite.comlkazma.synthasite.com zOffice Hours: yWed. yOther hours by appointment

10. Attendance Policies zStudents who always come 15 minutes late for the class will be marked absent zStudents who are regularly absent will be given DN warnings. (See DN Warning Flyer).

11. Other Policies zStudents who find difficulty in any topic are encouraged to meet lecturer in person in her office hours. zGuidance will be given for assignments but not the answer. zLate assignments will not be accepted or will be awarded with minimum marks. zThere will be no Make up exam or quiz. zPlagiarism xIf found,whole group will be given zero for their assignments

12. Class Participation (5%) z Students are encouraged to participate in class activities and discussions to come out with their own suggestions.

13. Assignments (15%) Analysis oriented algorithms will be given for assignments,students are expected to apply the concepts that they learned from chapters.

14. Pop Quizzes (5%) zStudents will have the opportunity to take several pop quizzes during the term. zThere will be no makeup quizzes.

15. Major Exams (35%)/Final Exam(40%) zNo makeup major exams will be conducted unless for genial reasons like sick but still have to produce Medical certificate. zFinal exam is worth 40%.

16. How to Study for this Course zPractice by solving as much exercises as possible. zStudy the chapters after each & every lecture. zGet familiar with the previous chapter before the next lecture starts. zPractice similar questions that are done as class works. zAttempt the Assignments properly.