Previous: Appendix I  Main page  Next: Appendix III

Appendix II Activity descriptions PRAC1, introduction to Windows NT, files, folders; WWW, mail, FTP; working with .ZIP files PRAC2, using Borland C++ PRAC3, C programs, numeric types, operator precedence, variables PRAC4, selection, testing PRAC5, I/O and iteration PRAC6, functions, pointers PRAC7, arrays of pointers, debugging PRAC8, strings, files PRAC9, arrays, structs PRAC10, design component of three-week assignment PRAC11, implementation of three-week assignment PRAC12, final assignment writeup; searching, sorting, recursion MCQ1-10, ten pages of multiple choice questions, three or four to a page SA1-4, four pages of short-answer questions, six to a page DL, digital logic, truth table REC, fill in blanks in function to calculate reciprocal, parameter passed by reference LISTS, fill in blanks in linked list code CODE1, two small functions (modulus, arrays) CODE2, main() to call the code in CODE1 TEST, design test data DEBUG, find bugs in a program SQR, smallest square less than or equal to the parameter SEARCH, fill in blanks for binary search algorithm (in pseudocode) PALIN, detect whether an input string is a palindrome SSORT, follow selection sort algorithm BSORT, follow bubblesort algorithm DS, design data structures for use in CODE3 CODE3, file I/O and arrays

Concept mapping for introductory programming Thesis main page Introduction and background     Background: education     Assessment     Background: concept maps   Aims     Competency mapping     Benefits   Method and results     Data sets     Method     Results     Random data   Analysis and conclusions     Factor analysis     Cluster analysis     Methodological problems     A better test     Conclusion   Appendix I: Datasets Appendix II: Activities Appendix III: MDS coordinates Appendix IV: Data generation scripts   Bibliography

Previous: Appendix I  Main page  Next: Appendix III