ce00333-3 - algorithmics.pdf
TRANSCRIPT
-
7/27/2019 CE00333-3 - Algorithmics.pdf
1/3
STAFFORDSHIRE UNIVERSITY MODULE DESCRIPTOR 16/6/2006
CE00333-3 2 Valid CurrentCode : Version : A roval Status :
ALGORITHMICSTitle :
Computing, Engineering & Technology CSSE 3Section : Field : Level :
VLE
Blackboard
Credits
15
Pattern Of Delivery
Contact Email
FRED PRATT [email protected]
Contact HourIndependentStudy Hours
Total LearningHours
36 114 150
PatternYearSpan Period Study % Initial Grid
1 1 1 100 Y
SiteCostCentre
Cost Centre Description Subj Subject Description SubjHesaSub %
STAFFORD 25Information Technology andSystems Sciences
G900 Others in Mathematical and Compu 100 100
Contributing Faculty Contrib
Computing, Engineering & Technology 100%
Registration Conditions Module Version Condition Text
CE62021-2
Date Approved Date Implemented
20/9/2005 1/8/2005
mailto:[email protected] -
7/27/2019 CE00333-3 - Algorithmics.pdf
2/3
STAFFORDSHIRE UNIVERSITY MODULE DESCRIPTOR 16/6/2006
CE00333-3 2 Valid CurrentCode : Version : A roval Status :
ALGORITHMICSTitle :
Computing, Engineering & Technology CSSE 3Section : Field : Level :
Learning Outcome
1. COMPARE AND CONTRAST THE OPERATION AND COMPLEXITY OF VARIOUSALGORITHMS AND DATA STRUCTURES.
Enquiry
Knowledge &Understanding
Learning
2. USE GRAPH THEORY IN THE ANALYSIS OF ALGORITHMS AND DATA STRUCTURES.Knowledge &Understanding
3. EXPLAIN THE USE OF AND CRITICALLY EVALUATE PARADIGMS THAT TEND TO YIELDEFFICIENT ALGORITHMS.
Knowledge &Understanding
Problem Solving
4. EXPLAIN THE FUNDAMENTAL CONCEPTS OF COMPLEXITY INCLUDING THE P V NPCONJECTURE AND DISCUSS AND CRITICALLY EVALUATE THE DIFFERENT CRITERIA USEIN THE EVALUATION OF ALGORITHMS.
Enquiry
Knowledge &Understanding
-
7/27/2019 CE00333-3 - Algorithmics.pdf
3/3
STAFFORDSHIRE UNIVERSITY MODULE DESCRIPTOR 16/6/2006
CE00333-3 2 Valid CurrentCode : Version : A roval Status :
ALGORITHMICSTitle :
Computing, Engineering & Technology CSSE 3Section : Field : Level :
Module Details Text lus assessed b
IndicativeContent
Pseudo-Code standard. B-trees, hashing techniques, heaps, graph algorithms,greedy algorithms,Matroids. Matching.Measures of performance, big-Oh notation.Complexity Classes P and NP.Easy versus Hard NP properties.Characterisation of good algorithmics.
AssessmentDetails
An ASSIGMT weighted at 50%. An EXAM length 2 HOURS weighted at 50%.One 50% comparative essay. (Learning outcomes 1-4)One 50% examination (2 hours) (Learning outcomes 1-4)
LearningStrategies
Each week, there will be,2 lectures and 1 tutorial - to sufficiently understand the underpinningmathematical material.Formative Exercises used to highlight concepts and notions.Pre-coded algorithms to illustrate concepts and notions.E-notes + E-exercises to read ahead the pedagogic material.(1:n)2 (1:20)1
ProspectusInformation
A structured approach to understanding,designing and building good Algorithms.
Referring to Text
Data Structures and Algorithms in Java 3rd Edition, M T Goodrich, R Tamassia, WILEY 2004, ISBN:0471-46983-1Computer Algorithms Introduction to Design & Analysis, S Baase, A V Gelder, ADDISON, WESLEY2000, ISBN: 0201612445Fundamentals of Algorithmics, G Brassard, P Bratley, PRENTICE-HALL 1996, ISBN: 0-13-335068-1Introduction to Graph Theory 2nd Edition, D B West, PEARSON HIGHER EDUCATION 2000, ISBN:0-13-0144400-2
Accessing
Resources
E-Notes /E-Formative exercises.
Recommended text *** web site.
SpecialAdmissionsRequirements
Prior study of Mathematics and Algorithmics.