1. Algorithms and their Applications CS2004 (2012-2013) Dr Stephen Swift 1.1 Introduction to the Module

2. Introduction to Module CS2004Slide 2 Introduction This topic will cover an introduction to the whole of the CS2004 Algorithms and their Applications 2 nd year module This module will be taught by: Dr Stephen Swift Professor Jasna Kuljis Dr Stanislao Lauria Some material (a very little) may be familiar, and other material has been “borrowed” FoIT Jorum (JISC funded lecture notes repository) Rong Yang, University of West England Dr Jim Smith, University of the West of England

3. Introduction to Module CS2004Slide 3 What are the Aims of this Module? “This module provides an understanding of a set of useful data abstractions and algorithms. It aims to stimulate students' critical thinking and develop their ability to choose appropriate algorithms in solving practical problems and implementing them in software.”

4. Introduction to Module CS2004Slide 4 What Does This Mean? You will learn: The concepts of data structures The concepts of algorithms How to design and implement algorithms in a programming language (we will be using Java) We will look at some example problems

5. Introduction to Module CS2004Slide 5 What is to be Taught? – Part 1 The analysis of algorithms What is a computer? What is an algorithm? What is a program? What is software? Input and Output What is the analysis of algorithms?

6. Introduction to Module CS2004Slide 6 What is to be Taught? – Part 2 A number of different data structures Notation Lists Queues Trees Graphs Hash tables Etc...

7. Introduction to Module CS2004Slide 7 What is to be Taught? – Part 3 A number of different algorithms Sorting Searching Graph traversal Heuristic search Evolutionary Computation Data Clustering Bin Packing Optimisation

8. Introduction to Module CS2004Slide 8 What is to be Taught? – Part 4 A number of different applications Examples of searching Graph based problems Bin packing problems Data clustering gene expression data Parameter optimisation The Travelling Salesman Problem

9. Introduction to Module CS2004Slide 9 What is NOT going to be Taught? Java Java This module assumes and requires that you can program in Java not We are going to teach you how to implement algorithms in Java, not how to program Java There will be plenty of opportunity to practice Most laboratory sessions will require you to program in Java If you are rusty in Java then you should start revising now! Java resources will be made available (e.g. for Mathematics students)

10. Introduction to Module CS2004Slide 10 Structure – Part 1 This module spans two terms There may not be a lecture or laboratory session every week There is most weeks however... Check on Blackboard Lectures Tuesdays 10am-11am Eastern Gateway building LEC EGA, from next week onwards, this is in the new Eastern Gateway building Under one hour Will cover one or more topics

11. Introduction to Module CS2004Slide 11 Structure – Part 2 Laboratories You will attend one of two laboratory sessions Starts week 2 (although there is a worksheet for this week) Laboratory One Thursday 2pm-4pm, HB223 (Halsbury Building) Laboratory Two Friday 2pm-4pm, HB223 Check on Blackboard for what session you are Only attend your session These will consist of worksheets on the subject of the weeks lecture 2 hours supervised – there will always be a GTA present The lecturing staff will try and attend as many as we can – but we may have timetabling conflicts…

12. Introduction to Module CS2004Slide 12 Assessment Laboratory worksheets (60% weight) A number of the laboratory worksheets will be assessed Exam (40% weight) Theory based This will test the concepts of algorithms and data structures There will be no programming needed in the exam

13. Introduction to Module CS2004Slide 13 Laboratory Sheets – Part 1 These will be made available after the appropriate lecture A number of the laboratory sheets will be assessed during the laboratories Threshold based marking will be used This means that a number of worksheets need to be completed to attain a given grade E.g. E, D, C, B, A, etc...

14. Introduction to Module CS2004Slide 14 Laboratory Sheets – Part 2 Week Number Who? Lecture Tuesday, 10am-11am Laboratory Assessed? 1SSW1. Introduction to ModuleNo 2SSW2. Foundations of Algorithm AnalysisNo 3SSW3. Mathematical FoundationE 4SSW4. Time Complexity and Asymptotic NotationD 5JKU5. Data Structures and their ApplicationsNo - useful! 6JKU6. Classic Algorithms - SortingD 7ASK - 8SLA7. Classic Algorithms - Graph TraversalD 9SSW8. Search and FitnessD 10SSW9. Hill Climbing and Simulated AnnealingC 11JKU10. Tabu Search and Iterated Local Search- 12N/ANo Lecture - no laboratory- Christmas13-14 15SLA11. Applications, introduction and parameter optimisationC 16SSW12. An Introduction to Genetic AlgorithmsB 17SLA13. Further Evolutionary ComputationB 18SSW14. Ant Colony Optimisation, Particle Swarm OptimisationNo - useful! 19SLA15. Bin Packing and Data ClusteringB 20SSW16. The Travelling Salesman ProblemA 21ASK - 22N/ANo Lecture - laboratory on- 23N/ANo Lecture - laboratory on- 24N/ANo Lecture - laboratory on- 25N/ANo Lecture - laboratory on- Easter26-28 29SSW17. Exam Revision - laboratory onN/A

15. Introduction to Module CS2004Slide 15 Laboratory Sheets – Part 3 When you have completed a worksheet, you will ask a GTA to assess it If you have completed most of the questions and demonstrate that you understand it, it will be marked as completed Otherwise the GTA will provide you with verbal feedback You should make a written note of this in a log book You may try again another time…

16. Introduction to Module CS2004Slide 16 Laboratory Sheets – Part 4 Only one worksheet assessment per student per laboratory session will be permitted Hence do not let them “pile” up They must be completed in numerical order It is advised that you do not leave a laboratory worksheet for more than four week

17. Introduction to Module CS2004Slide 17 Laboratory Sheets – Part 5 Last year a number of students had done the worksheets but ran out of time to have them all assessed... Correlation NLabs CW0.85 Exam0.73 Final0.77

18. Introduction to Module CS2004Slide 18 Exam A three hour exam The exact time and date is not available yet This will consist of: A multiple choice part A 20 questions of 2 marks An essay-type question part B 4 questions of 15 marks Past papers will be made available

19. Introduction to Module CS2004Slide 19 Resources This module does not follow any set text VERY The text books listed on Blackboard (in the study guide) are a VERY useful reference Eclipse and Java have a very well documented help system

20. Introduction to Module CS2004Slide 20 Next Topic The next topic we will look into is the key concepts of algorithms