STAFFORDSHIRE UNIVERSITY MODULE DESCRIPTOR

Code : Title : CE00333-3 ALGORITHMICS Version : 2 Approval Status : Valid Current

16/6/2006

Section :

Computing, Engineering & Technology Email J.F.PRATT@STAFFS.AC.UK

Field :

CSSE

Level : VLE Blackboard

3

Contact FRED PRATT

Pattern Of Delivery Credits 15 Contact Hours 36 Independent Total Learning Study Hours Hours 114 150 Pattern 1 Year Span 1 Period 1 Study % 100 Initial Grid Y

Contributing Faculty Computing, Engineering & Technology

Contributing Percent 100% Hesa Subj %

Site STAFFORD

Cost Cost Centre Description Centre Information Technology and 25 Systems Sciences

Subj

Subject Description

Subj %

G900 Others in Mathematical and Computing 100 Sciences 100

Registration Conditions

Module Version Condition Text CE62021-2

Date Approved 20/9/2005

Date Implemented 1/8/2005

. 1. EXPLAIN THE FUNDAMENTAL CONCEPTS OF COMPLEXITY INCLUDING THE P V NP . 0 0 . Knowledge & 0 Understanding 0 . COMPARE AND CONTRAST THE OPERATION AND COMPLEXITY OF VARIOUS Enquiry 00 ALGORITHMS AND DATA STRUCTURES. 3. Knowledge & 0 Understanding 1 0 . Problem Solving 0 4 04 4. EXPLAIN THE USE OF AND CRITICALLY EVALUATE PARADIGMS THAT TEND TO YIELD Knowledge & 0 Understanding 30 EFFICIENT ALGORITHMS. CONJECTURE AND DISCUSS AND CRITICALLY EVALUATE THE DIFFERENT CRITERIA USEDEnquiry 00 IN THE EVALUATION OF ALGORITHMS. USE GRAPH THEORY IN THE ANALYSIS OF ALGORITHMS AND DATA STRUCTURES. Knowledge & 2. . . Learning 02 2 0 .STAFFORDSHIRE UNIVERSITY MODULE DESCRIPTOR Code : Title : CE00333-3 ALGORITHMICS Version : 2 Approval Status : Valid Current 16/6/2006 Section : Computing.. Engineering & Technology Field : CSSE Level : 3 Learning Learning Learning Outcome Outcome Outcome Sort Break 11 . 1 00 . 0 40 . 00 Understanding 3 03 0 .

Special #### Admissions Requirements Prior study of Mathematics and Algorithmics. Characterisation of good algorithmics. Pre-coded algorithms to illustrate concepts and notions. E-notes + E-exercises to read ahead the pedagogic material. ISBN: 0-13-335068-1 Introduction to Graph Theory 2nd Edition. hashing techniques. greedy algorithms. Easy versus Hard NP properties. P Bratley.designing and building good Algorithms. Content Complexity Classes P and NP. PEARSON HIGHER EDUCATION 2000. Matching. M T Goodrich. One 50% comparative essay. graph algorithms. ADDISON. Engineering & Technology Field : Admin Module Tab Details Text Sort Text plus assessed by Pseudo-Code standard.STAFFORDSHIRE UNIVERSITY MODULE DESCRIPTOR Code : Title : CE00333-3 ALGORITHMICS Version : 2 Approval Status : Valid Current 16/6/2006 CSSE Section : Computing. ISBN: 0-13-0144400-2 #### Accessing Resources E-Notes /E-Formative exercises. heaps. A V Gelder. Recommended text *** web site. Indicative #### Measures of performance. (Learning outcomes 1-4) One 50% examination (2 hours) (Learning outcomes 1-4) Level : 3 #### Assessment Details #### Learning Strategies Each week. (1:n)2 (1:20)1 #### Prospectus Information A structured approach to understanding. Formative Exercises used to highlight concepts and notions. An EXAM length 2 HOURS weighted at 50%. B-trees. . An ASSIGMT weighted at 50%.to sufficiently understand the underpinning mathematical material. WESLEY #### Referring to Texts2000. Data Structures and Algorithms in Java 3rd Edition. Matroids. ISBN: 0201612445 Fundamentals of Algorithmics. WILEY 2004. ISBN: 0471-46983-1 Computer Algorithms Introduction to Design & Analysis. D B West. big-Oh notation. there will be. PRENTICE-HALL 1996.2 lectures and 1 tutorial . S Baase. R Tamassia. G Brassard.

Sign up to vote on this title
UsefulNot useful