# Essential Algorithms

## Course Description

• ### Course Name

Essential Algorithms

• ### Area of Study

Computer Science

• ### Language Level

Taught In English

• ### Prerequisites

Pre-requisites: SE1PR11 Programming and SE1FC11 Fundamentals of Computing
Non-modular pre-requisites:

• ### Course Level Recommendations

Upper

ISA offers course level recommendations in an effort to facilitate the determination of course levels by credential evaluators.We advice each institution to have their own credentials evaluator make the final decision regrading course levels.

### Hours & Credits

• ECTS Credits

5
• Recommended U.S. Semester Credits
3
• Recommended U.S. Quarter Units
4
• ### Overview

Summary module description:

Aims:
The refinement of the concept called 'Algorithms' is one of the cornerstones of computer science and the aim of this module is to provide an appreciation of the concepts involved in the design and analysis of algorithms. The module gives an introduction to fundamental algorithm design strategies that are common to many concrete applications. A secondary aim is to consolidate the notion of mechanization of abstraction that is introduced in previous modules with more general principles of design.

Assessable learning outcomes:
Fundamental algorithm design principles such as Divide and Conquer, Greedy Algorithms and Dynamic Programming are introduced and explored through case studies to demonstrate the design of efficient solutions to computational problems. On completion of the module a student should be able to:

- Identify the fundamental strategies in algorithmic design
- Distinguish which strategy is appropriate to solve a given problem
- Classify different algorithmic strategies
- Analyze a given algorithm and assess its efficiency
- Apply techniques of proof by induction to verify certain properties of algorithms.

Students will have seen a number of useful case studies illustrating the techniques which can be transported to other areas of the course. Students will also be introduced, through group studies, to recent developments in applications of the design strategies by reviewing current literature. Coursework will enhance a student's algorithm design and program implementation skills.

Outline content:
Divide and Conquer (General method, Analysis, examples - Sorting, Convex Hull, Matrix Multiplication);
The Greedy method (General method, Analysis, examples - Shortest Paths, Spanning Trees);
Dynamic Programming (General method, Analysis, examples - O/1 Knapsack, Travelling salesperson, Transitive Closure);
Consolidation (revisit examples using alternative methods).

Brief description of teaching and learning methods:
Lectures and guided group study based learning.

Summative Assessment Methods:
Written exam 100%
Set exercise 0%

Other information on summative assessment:

Formative assessment methods:

Penalties for late submission:
Penalties for late submission on this module are in accordance with the University policy.
The following penalties will be applied to coursework which is submitted after the deadline for submission:
? where the piece of work is submitted up to one calendar week after the original deadline (or any formally agreed extension to the deadline): 10% of the total marks available for the piece of work will be deducted from the mark;
? where the piece of work is submitted more than one calendar week after the original deadline (or any formally agreed extension to the deadline): a mark of zero will be recorded.
You are strongly advised to ensure that coursework is submitted by the relevant deadline. You should note that it is advisable to submit work in an unfinished state rather than to fail to submit any work.

The Module Convener will apply the following penalties for work submitted late, in accordance with the University policy.
where the piece of work is submitted up to one calendar week after the original deadline (or any formally agreed extension to the deadline): 10% of the total marks available for the piece of work will be deducted from the mark for each working day (or part thereof) following the deadline up to a total of five working days;
where the piece of work is submitted more than five working days after the original deadline (or any formally agreed extension to the deadline): a mark of zero will be recorded.

The University policy statement on penalties for late submission can be found at: http://www.reading.ac.uk/web/FILES/qualitysupport/penaltiesforlatesubmission.pdf
You are strongly advised to ensure that coursework is submitted by the relevant deadline. You should note that it is advisable to submit work in an unfinished state rather than to fail to submit any work.

Length of examination:
One 2-hour examination paper in May/June.

Requirements for a pass:
40%

### Course Disclaimer

Courses and course hours of instruction are subject to change.

Some courses may require additional fees.

Credits earned vary according to the policies of the students' home institutions. According to ISA policy and possible visa requirements, students must maintain full-time enrollment status, as determined by their home institutions, for the duration of the program.

ECTS (European Credit Transfer and Accumulation System) credits are converted to semester credits/quarter units differently among U.S. universities. Students should confirm the conversion scale used at their home university when determining credit transfer.

Please reference fall and spring course lists as not all courses are taught during both semesters.

Please note that some courses with locals have recommended prerequisite courses. It is the student's responsibility to consult any recommended prerequisites prior to enrolling in their course.

This site uses cookies to store information on your computer. Some are essential to make our site work; others help us improve the user experience. By using the site, you consent to the placement of these cookies.