Total Credits: 10
Level: Level 4
Target Students: Students on MSc courses in the School of Computer Science and the School of Mathematics. Also available to students from other Schools with the agreement of the module convenor. Available to JYA/Erasmus students.
|Autumn||Assessed by end of Autumn Semester|
Prerequisites: Significant prior knowledge of discrete mathematics and programming (equivalent to entry requirements for the Masters degrees in Scientific Computation or Advanced Computing Science)
Summary of Content:
This module is part of the Programming theme in the School of Computer Science.
This module introduces the principles of constructing efficient and reliable computer algorithms. Basic methodologies and theoretical foundations in the design and analysis of algorithms are covered and applied to a variety of problems.Topics:
Method and Frequency of Class:
|Activity||Number Of Weeks||Number of sessions||Duration of a session|
|Lecture||11 weeks||1 per week||2 hours|
Method of Assessment:
|Exam 1||50||2 hour written examination|
|Coursework 1||50||Proof, algorithm design and algorithm analysis problems|
Dr E Ozcan
Education Aims: The aim of this module is to provide a foundation in mathematical methods and develop the skills needed to design efficient and reliable algorithms.
Learning Outcomes: Knowledge and Understanding:
the basic principles of algorithm design and analysis.
the ability to understand and apply algorithmic design concepts, analyse a given algorithm.
the ability to design a variety of algorithms based on different (or same) paradigm(s),
compare the efficiency of algorithms designed for solving a given problem.
the ability to solve problems using efficient algorithms.
Offering School: Computer Science
Use the Back facility of your browser to return to the previous page.
Search for another module
Return to The University of Nottingham Welcome Page