The son of a colleague's friend is taking computer science resit exams in
two week's time and would like some help with revision on the topics below,
including some more theoretical aspects of computer science over the next
few weeks. Can anyone help or do you know someone who would like to help?
This would be (reasonably well) paid tuition and could take place in UK or
Brussels, or remotely. Let me know if you are interested ASAP or do feel
free to pass this one if you know a computer science PhD student or academic
with a reasonable theoretical background who might be interested. Please
email me in the first instance. Please note this is an urgent request, so a
quick response is needed if interested.
Otherwise, I hope you are enjoying your summer break!
Jonathan Bowen
--
Prof Jonathan Bowen, Professor of Computing
Institute for Computing Research, London South Bank University
Faculty of BCIM, Borough Road, London SE1 0AA, UK
Email: [log in to unmask] URL: www.jpbowen.com
---------------------------------------------------------
> 1. Computer Systems, Software Engineering and Language Processing.
> Comp Systems mainly fine except some issues with sequential and
> combinational logic circuits.
> Language Processing needs a little work with DFA, NFA and languages which
> can work on the finite automata. And more on the following: The pumping
> lemma for determining language regularity. Kleene's theorem. grammars for
> regular language. Top-Down and Bottom-up parsing, parsers.
>
> 2. Advanced Programming in Java, Current Technologies and
> Algorithms and Data structures.
> Algorithms and Data Structures need some guidance with analysing
> algorithms and determining their relative runtimes (with regards to big-O
> sigma and omega)
> asymptotic analysis. Arrays, Stacks, queues and lists are alright as
> data structures but not so good at analysing runtime of say a stack or
> other structure. A little help on hash tables and hashing. Tree structures
> are alright again a little guidance on analysing them. Sorting algorithms
are
> alright again some help required analysing them (merge, divide and
> conquer, Heapsort, quicksort). A little on topological graphs possibly.
|