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

Slides:



Advertisements
Similar presentations
IS 101: Introduction to Information Technology Guide Ms. Noura A. Alhakbani Website: Prince Sultan University, College for.
Advertisements

Introduction to Pre-calculus Math.  Confidently solve problems  Communicate and reason mathematically  Increase mathematical literacy  Make connections.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Midterm Review Fri. Oct 26.
Jan Welcome to the Course of Advanced Algorithm Design (ACS-7101/3)
CS 46101–600/CS Design and Analysis of Algorithms Dr. Angela Guercio Spring 2010.
1 SWE Software Testing and Quality Assurance Fall Semester (081) King Fahd University of Petroleum & Minerals Information & Computer.
COMP 122 – Design and Analysis of Algorithms Spring 2004 MW 11:00-12:15, SN 014 Instructor:Jack Snoeyink TA: Nathan Fisher SN.
CS 331 / CMPE 334 – Intro to AI CS 531 / CMPE AI Course Outline.
Administrative Issues ICS 151 Fall 2007 Instructor: Eli Bozorgzadeh.
[CS-251: Introduction to Computer organization and assembly Programming ] Course Guide Salma Idris Prince Sultan University, College for Women.
CS 103 Discrete Structures Lecture 01 Introduction to the Course
DEPT. OF COMPUTER & INFORMATION SCIENCES IS 426. COURSE OUTLINE Lecturer: Aisha AlArfaj Office :
Syllabus and Class Policies MATH 130: Summer 2014.
DR. ABEER ALNUAIM COURSE GUIDE CT OUTLINE Course Description Course Objectives List of Resources Course Calendar Course Location & office hours.
SE-308 Software Engineering-II 7th Term SE University of Engineering & Technology Taxila, Pakistan Software Engineering Department.
Quantitative Foundations for Telecommunications TCOM 575 Syllabus for Fall 2008.
COMPE 574 Fundamentals of Algorithms Spring Murat KARAKAYA Department of Computer Engineering.
Course Guide CS 285 Discrete Mathematics Dr. Eng. Manal Farrag Prince Sultan University, College for Women
Course Guide IS325 Systems Analysis & Design II Ms Fatima Khan Prince Sultan University, College for Women.
IS 101: Introduction to Information Technology Guide Ms. Amany AlSaleh Prince Sultan University, College for Women.
New Advanced Higher Subject Implementation Events Engineering Science Advanced Higher Course Assessment.
CS 140 Computer Programming (I) Second semester (3 credits) Imam Mohammad bin Saud Islamic University College of Computer Science and Information.
CS210: Data Structures and Algorithms Course Guide Sarab Al Muhaideb Prince Sultan University, College for Women.
Course Guide Lines CS210: Data Structures and Algorithms Course Guide Layal Kazma Prince Sultan University, College for Women.
Welcome CSCI 1100/1202 Intro to Computer Science Winter 2002.
Operations Fall 2015 Bruce Duggan Providence University College.
[CS-225: Software Engineering] Course Guide Fatima Khan Prince Sultan University, College for Women.
1 [CMP001 Computer Orientation I] Course Guide Ms. Wesal Abdalfattah office#: 357 Ext#: 8612 Prince Sultan University,
CSE 2320 Algorithms and Data Structures Dimitrios Kosmopoulos Introduction.
1Computer Sciences Department. Book: Introduction to Algorithms, by: Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein Electronic:
CPSC 121: Models of Computation Unit 0 Introduction George Tsiknis Based on slides by Patrice Belleville and Steve Wolfman.
CS330: Introduction to Operating Systems Course Guide Fatima Khan Prince Sultan University, College for Women.
CS151: Digital Design Course Guide Sarab Al Muhaideb Prince Sultan University, College for Women.
[CS-370: Artificial Intelligence ] Course Guide Ms.Raghad Altikriti Prince Sultan University, College for Women.
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
Course overview Course title: Design and Analysis of Algorithms Instructors: Dr. Abdelouahid Derhab Credit hours:
Design and Analysis of Algorithms (09 Credits / 5 hours per week) Sixth Semester: Computer Science & Engineering M.B.Chandak
CS151 Introduction to Digital Design Noura Alhakbani Prince Sultan University, College for Women.
Lecture # 1 Introduction Analysis of Algorithm by Qamar Abbas Analysis of Algorithms.
CS 102: Computer Programming II Course Guide Ms. Noura A. Alhakbani Website: Prince Sultan University, College for Women.
Design and Analysis of Algorithms Introduction Instructors:1. B V Kiran Mayee, 2. A Madhavi
Algorithms Design and Analysis CS Course description / Algorithms Design and Analysis Course name and Number: Algorithms designs and analysis –
Design and Analysis of Algorithms CS st Term Course Syllabus Cairo University Faculty of Computers and Information.
CS 331: Data Communications and Networking Course Guide Salma Idris Course web site:
Course Overview Stephen M. Thebaut, Ph.D. University of Florida Software Engineering.
Syllabus and Class Policies MATH 130: Summer 2016.
Operating Systems (CS 340 D) Dr. Abeer Mahmoud Princess Nora University Faculty of Computer & Information Systems Computer science Department.
CS140 – Computer Programming 1 Course Overview First Semester – Fall /1438 – 2016/2017 CS140 - Computer Programming 11.
RAIK 283 Data Structures and Algorithms
Design and Analysis of Algorithms
Welcome to the Course of Advanced Algorithm Design
Design and Analysis of Algorithms (09 Credits / 5 hours per week)
CS101 Computer Programming I
ICE 245: Algorithms Instructor: Dr. Mohammad Arifuzzaman
Course Guide CT 1501.
TERM 181 IMPORTANT INFORMATION
CMPT 438 Algorithms Instructor: Tina Tian.
System Analysis and Design 2
Course Guide CT 1501.
Administrative Issues
Analysis of Algorithms
Orientation CSC 111.
Course Guide CSC1201 Computer programming 2.
Administrative Issues
System Analysis and Design 2
Design and Analysis of Algorithms
Introduction CSE 2320 – Algorithms and Data Structures
COMP 122 – Design and Analysis of Algorithms
Advanced Analysis of Algorithms
Introduction to the Java Language ​
Presentation transcript:

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

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

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.

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.

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.

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.

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.

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%

Course Location & Office Hours zMrs. Layal Kazma yOffice: W338 y  Course Home Page: lkazma.synthasite.comlkazma.synthasite.com zOffice Hours: yWed. yOther hours by appointment

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).

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

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

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

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

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%.

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.