Course Code045100122
CourseTitleThe Design and Analysis ofComputer Algorithms
CourseCategorySpecialtyBasic Course
CourseNatureCompulsoryCourse
Class Hours64
Credits3.5
SemesterForth
InstituteSchool ofComputer Science & Engineering
ProgramOrientedInnovationClass
TeachingLanguageEnglish
PrerequisitesAdvancedMathematics, Data Structure, High-level Language Programming
StudentOutcomes (Special Training Ability)Studentsare required to solve the problems by using the suitable conceptsand algorithms learnt in the discrete mathematics course. Theyshould have good programming skill and also understand the course.
1.Tounderstand some kinds of common algorithms, such as sortingalgorithm, greedy algorithm, tree search algorithm, dynamicprogramming algorithm, etc.
2.To master the flexible application of these common algorithms tobe used to solve related problems;
3.Apply these methods to analyze and design other relatedalgorithms.
TeachingObjectivesThroughstudying this course, the students will understand variouscommonly famous algorithms and have the abilities to apply thesealgorithms to solve different problems with high efficiency onabstract thinking, strict logical reasoning and so on. On thebasis of relevant basic analysis, practice and application ofthese kinds of algorithms, the students will be able to know howto implement the system development with high performance.
CourseDescriptionSomewell-known common algorithms and their application for thesolution of some practical problems are introduced in this course.
Instrumentsand EquipmentsDesktopComputer for each student
- C++ environment
- AMC Platform client software
ACM Platform Server
ExperimentReportFillthe uniform report template by Compute Science School.
AssessmentReport
TeachingMaterials and Reference BooksR.C. T. Lee, S. S. Tseng, R. C. Chang , Y. T. Tsai,Introductionto the Design and Analysis of Algorithms, 2 ed, McGraw/Hill
TheDesign and Analysis of Computer Algorithms, Alfred Aho, John E.Hopcroft, Jeffrey D. Ullman, 2003.Introductionto Algorithms, 2nd Ed. by Cormen, Leiserson, Rivest, & Stein(CLRS), McGraw Hill, 2002.
Preparedby Whom and WhenXiaoyangYan, July 10,2017