COMP116  Analytic Techniques for Computer Science
PLEASE NOTE THIS PAGE IS STILL IN DEVELOPMENT & ITS CONTENTS SUBJECT TO CHANGE
Module Information and Resources
Published Module Specification (201718)
(Description, Aims, Learning Outcomes, Syllabus, & Assessment)
Lecture Schedule
(accurate as advertised on Orbit (8/1/2018)
MONDAY  14.00 (2.00 pm)  in South Campus Teaching Hub  Moot Room (Room 102); (SCTHMR, Building 120 
The location formerly known as The Law Building)
TUESDAY  09.00 (9.00 am) in Rendall Building Lecture Theatre 7; (RENLT7, Building 432)
THURSDAY  11.00 (11.00 am) in Rendall Building Lecture Theatre 7; (RENLT7, Building 432)
Tutorial Schedule
[NB You will be allocated (at some point) to one of the Tutorial sessions, currently at the times and locations given below
(information culled from Orbit and accurate as of 8/1/2018).]
A total of seven slots have been set aside
These are:
WEDNESDAY 09.00  Life Sciences  Seminar Room 118 (LIFSSR1, Building 215)
(coordinator: James Butterworth)
WEDNESDAY 10.00  Brodie Tower  Lecture Room 107 (BROD107, Building 233)
(coordinator: Paul E. Dunne)
WEDNESDAY 11.00  George Holt  Seminar Room H2.23 (GHOLTH223, Building 231)
(coordinator: James Butterworth)
WEDNESDAY 12.00  Brodie Tower  Room 702 (BROD702, Building 233)
(coordinator: Paul E. Dunne)
THURSDAY 10.00  Electrical Engineering  Room 201 (ELEC201/E1, Building 235)
(coordinator: James Butterworth)
THURSDAY 14.00  Math. Sciences, Teaching Room 105 (MATH105, Building 206)
(coordinator: Paul E. Dunne)
FRIDAY 09.00  Muspratt Building, Seminer Room 7 (JSMSR7, Building 232)
(coordinator: James Butterworth)
The tutorial classes will begin in WEEK 3 of the semester. That is from MONDAY 12th FEBRUARY 2018
ASSESSMENT
There will be two class tests. Each will take the form of a ten (10) question MCQ Paper and
each will contribute 10% to the overall module mark.
The final assessment will be a two (2) hour MCQ Exam consisting of forty (40) questions and
contribute 80% of the overall module mark.
The Class Tests are (provisionally) scheduled to take place in Week 4 and Week 10 of the teaching period. The specific
dates intended are:
 Class Test 1 Thursday 22nd February 11.00 am in Rendall Building Lecture Theatre 7 (duration thirty (30) minutes)
 Class Test 2 Thursday 26th April 11.00 am in Rendall Building Lecture Theatre 7 (duration thirty (30) minutes)

Class Test 1 will consist of ten (10) multiplechoice questions dealing with the topics of Numbers, Polynomial Properties,
and basic Matrix & Vector manipulation.

Class Test 2 will, also, consist of ten (10) multiplechoice questions covering basic Calculus applications,
Complex number manipulation, Statistical settings, and more advanced Matrix properties
Notes
(These are single pdf slide per page. In total 293 pages. Note that the introduction as presented in the first lecture will use 15 slides.
The reasons for the two slide lacuna will, one hopes, become clear.)
 Introduction (13 pages)
 Numbers & Vectors (43 pages)
 A Very Basic Introduction to Calculus (69 pages)
 The Imaginary World of Complex Numbers (31 pages)
 A Quick Review of Statistics in CS (38 pages)
 Computation with Richer Structures: Linear Algebra & Matrix Theory (69 pages)
 A few bits of Information Theory (30 pages)
 Review of First Sections of the Module
 What, where, why and when: highlevel overview of module content and related Learning Incomes
 Review of Second Section of the Module
Revision Material
Sample Question Paper for Part 2
Revision Questions (No answers)
Revision Questions (with answers)
Resources available online
Calculators and other software
These largely refer to methods discussed in Part 6 of the module, however, useful tools for symbolic differentiation & integration (Part 3)
and determination of polynomial roots (Part 2) are also provided on some sites.
For Java implementations a powerful and useful package is JAMA available at
 Sources and Documentation for the Java Matrix Package (JAMA)
Python resources include NumPy. Information about using and obtaining this is
provided here.
Tutorials on programming in Python using matrix features
are also available.
Algorithmic Composition (relating to Part 4)
There is a huge collection of resources relating to Chaos, Fractal, Iterative techniques for
algorithmic composition and other aspects of Computer Creativity as mentioned as an active application of Complex Number theory in AI
a summary of these has been compiled here
Material Relating to Worksheet 5

JAVA (compiled) code for Image Compression by SVD

JAVA (source) code for Image Compression by SVD

The JAMA package (Needed to compile/run the first two)
 Collection of source images to work with:
 Example gif (20+ year old picture of a current member of staff)
 Another example from same conference (also a 20+ year old picture of a current member of staff)
 The Aurora (Neva River, St. Petersburg) (colour)
 The Aurora (Neva River, St. Petersburg) (greyscale)
 Still life by Sergei Vakulenko (private collection) (colour, gif)
 Still life by Sergei Vakulenko (private collection) (colour, jpg)
 Still life by Sergei Vakulenko (private collection) (greyscale, gif)
 Still life by Sergei Vakulenko (private collection) (greyscale, jpg)
 Three stills from Eisentein's Battleship Potemkin (The Lion Statue post Odessa Steps sequence I)
 Three stills from Eisentein's Battleship Potemkin (The Lion Statue post Odessa Steps sequence II)
 Three stills from Eisentein's Battleship Potemkin (The Lion Statue post Odessa Steps sequence III)
Technical and Research Articles mentioned in module
If you are feeling adventurous and wish to look at some of the papers mentioned during the lectures most of
these are available on line (in several cases as a result of University online journal access agreements: these require
you to login via your University Student Account in order to view such items).
[Warning The number of *s following each reference is an (extremely) subjective "difficulty" rating and not a comment
on technical quality (all are of high technical quality as is evidenced by the publication venues involved):
the more *s the less accessible you may find the content to be. You should not, however, feel intimidated
or remotely worried should you find even (*) articles to be incomprehensible.]
The ordering follows that used in the lecture notes: (1) from Part 4; (2) & (3)
from Part 5; (4)(8) in Part 6; (9) is the basis of
ideas discussed in Part 7.

P. Flajolet and A. Odlyzko.
The average height of binary trees and other simple trees.
Journal of Computer and System Sciences, 25(2):171213, 1982 (******)

P.E. Dunne, A. Gibbons and M. Zito.
Complexitytheoretic models of phasetransitions in search problems.
Theoretical Computer Science, 294(2):243263, 2000. (**)

P.E. Dunne and P.H. Leng.
The Average Case Performance of an Algorithm for Demanddriven Evaluation of Boolean Formulae.
Journal of Universal Computer Science, 5(5):288306, 1999 (***)

K. Bryan and T. Leise.
The $25,000,000,000 Eigenvector: The Linear Algebra behind Google.
SIAM Review, 48(3):569â€“581, 2006 (*/**)

J.P. Keener.
The Perronâ€“Frobenius theorem and the ranking of football teams.
SIAM Review, 35(1):8093, 1993 (**/***)

T.J.M. BenchCapon and P. E. Dunne.
Argumentation in Artificial Intelligence. Artificial Intelligence, 171, JulyOctober 2007, 619641 (*)

J. Butterworth and P. E. Dunne.
Spectral Techniques in Argumentation Framework Analysis.
Proc. 6th COMMA, Potsdam, Germany, FAIA 287, 1416 September, 2016, pages 167178 (*)

P. E. Dunne.
I heard you the first time: debate in cacophonous surroundings.
Proc. 6th COMMA, Potsdam, Germany, FAIA 287, 1416 September, 2016, pages 287298 (*/**)

C.E. Shannon.
A Mathematical Theory of Communication.
Bell System Tech. Jnl., 27:379423,623656, 1948 (*/***)
[Note The discursive and motivating commentary in Shannon's paper are presented very lucidly and in a highly
readable style. The more advanced technical development of Information Theory within the article may be found a little
bit more challenging. It is well worth focusing on the nontechnical parts and skimming the more formal aspects of this
watershed research paper.]
To whom it may concern  retention of ownership in respect of performance rights