Interview
Well I had my interview today to decide if I could teach on the foundation year. I discovered that I had a few things going for me, namely that the foundation year isn't actually computer science, it's engineering, I would be teaching budding engineers how to code, which I like the sound of!
I'm sorry to say to those who advised me, that I abandoned OOP as a topic, as I couldn't think of anything that was complex, and could be explained well in under 10mins, but not so trivial that people would think I couldn't handle complex ideas. I decided to go with "Searching and Sorting" explaining why one performs these actions and explaining the Quicksort, Binary Search and Iterative Search algorithms.
One of the panel commented that I was a really good teacher, and that even as the non-technical member of the panel, they had understood all of the algorithms clearly. Another said that he had been very impressed with my decision to explain the entire thing with diagrams and pictures alone, saving maths and pseudocode to my handout. One lecturer even said that when he heard me say that I would cover the algorithm for Quicksort that I was going too high-level, but when he saw my explanation he felt that anyone could grasp it, the way I taught it.
Informally I've been told that I was either the best or second best candidate that they had seen, and that the other person that impressed them, wants to teach a different module to me. This means that I could well end up teaching the programming course - which makes me very happy.
Sadly this discussion isn't the end of it. This was apparently merlely an assessment that there was enough interest, and that the interested parties were capable of lecturing. The "formal" interviews are to be held later, if the decision is made to carry on, (though apparently on the strength of the presentations given today, they are almost definately going to.)
So - watch this space!
I'm sorry to say to those who advised me, that I abandoned OOP as a topic, as I couldn't think of anything that was complex, and could be explained well in under 10mins, but not so trivial that people would think I couldn't handle complex ideas. I decided to go with "Searching and Sorting" explaining why one performs these actions and explaining the Quicksort, Binary Search and Iterative Search algorithms.
One of the panel commented that I was a really good teacher, and that even as the non-technical member of the panel, they had understood all of the algorithms clearly. Another said that he had been very impressed with my decision to explain the entire thing with diagrams and pictures alone, saving maths and pseudocode to my handout. One lecturer even said that when he heard me say that I would cover the algorithm for Quicksort that I was going too high-level, but when he saw my explanation he felt that anyone could grasp it, the way I taught it.
Informally I've been told that I was either the best or second best candidate that they had seen, and that the other person that impressed them, wants to teach a different module to me. This means that I could well end up teaching the programming course - which makes me very happy.
Sadly this discussion isn't the end of it. This was apparently merlely an assessment that there was enough interest, and that the interested parties were capable of lecturing. The "formal" interviews are to be held later, if the decision is made to carry on, (though apparently on the strength of the presentations given today, they are almost definately going to.)
So - watch this space!
