This course provides an gradual but in-depth introduction to imperative programming using the C programming language. It is intended for students who are not taking Computer Science/Artificial Intelligence as part of their degree. Our lectures (2 a week) are backed up with a scripted (and supervised) two-hour Lab and a one-hour tutorial, every week. The assessment will be based on a 3-hour online programming exam in December (worth 90%) and one coursework due in week 9 (10%).
Our Class Reps for 2014 are Kristiyan Kirilov (s1442858) from the school of Maths (Thursday lab), and Ming Yang (s1439477) from the School of Economics (Tuesday lab).
CP/CPMT is taught in semester 1. It is taught as a combination of two Lectures:
We will keep a log of our lectures, and the collection of log entries will be maintained here. Individual log entries (once written) will be available as direct links from the lecture titles in the schedule below. Details (especially of later lectures) are likely to change a bit.
|Meeting||Day||Date||Who||Where||Title||Slides & Handouts||Code|
|1.||Monday||15 Sept||Mary/Julian||50GS LT G.03||Introduction to CP||sl1, sl1x4||hello.c|
|2.||Tuesday||16 Sept||Mary||AT LT1||Imperative programming, operations, errors||sl2, sl2x4|
|Lab 1||Thur18/Mon22/Tues23||M+/J+/J||AT4.12/AT5.05||Intro to the DICE Environment||lab1.pdf, unix.pdf, emacs.pdf|
|3.||Monday||22 Sept||Mary||50GS LT G.03||Variables and ints||sl3, sl3x4||square.c, max.c|
|4.||Tuesday||23 Sept||Mary||AT LT1||Arithmetic operations, int, float, double||sl4, sl4x4||floats.c, quadratic.c|
|Lab 2||Thur25/Mon29/Tues30||M+/J+/J||AT4.12/AT5.05||Simple arithmetic problems||lab2.pdf|
|Tutorial||Tutor||week 3 sheet||tutwk3.pdf|
|5.||Monday||29 Sept||Mary||50GS LT G.03||arithmetic, if-statement(cont.)||sl5, sl5x4||quadratic1.c, quadratic2.c|
|6.||Tuesday||30 Sept||Mary||AT LT1||iteration: for and while||sl6, sl6x4||table.c, fib.c|
|Lab 3||Thur2/Mon6/Tues7||M+/J+/J||AT4.12/AT5.05||Programming, with some iteration||lab3.pdf|
|Tutorial||Tutor||week 4 sheet||tutwk4.pdf|
|7.||Monday||6 Oct||Mary||50GS LT G.03||Functions||sl7, sl7x4|
|8.||Tuesday||7 Oct||Mary||AT LT1||Functions 2||sl8, sl8x4|
|Lab 4||Thur9/Mon13/Tues14||M+/J+/M||AT4.12/AT5.05||Simple Graphics with descartes||lab4.pdf, lab4sl.pdf||lab4.tar|
|Tutorial||Tutor||week 5 sheet||tutwk5.pdf|
|9.||Monday||13 Oct||Julian||50GS LT G.03||Arrays||sl9, sl9x4||fib-arr.c, whatday3.c|
|10.||Tuesday||14 Oct||Julian||AT LT1||Practical Programming||sl10, sl10x4, Extra video lecture (85 MB)||base-with-array.c, base-without-array.c|
|Lab 5||Thur16/Mon20/Tues21||M+/J+/M||AT4.12/AT5.05||Functions, some pointers, some arrays||lab5.pdf|
|Tutorial||Tutor||week 6 sheet||tutwk6.pdf||base.c|
|11.||Monday||20 Oct||Julian||50GS LT G.03||scanf in more detail; char||sl11, sl11x4||roman.c|
|12.||Tuesday||21 Oct||Julian||AT LT1||Strings||sl12, sl12x4|
|Lab 6||Thur23/Mon27/Tues28||M+/J+/M||AT4.12/AT5.05||Arrays and some strings||lab6.pdf|
|Tutorial||Tutor||week 7 sheet||tutwk7.pdf|
|13.||Monday||27 Oct||Julian||50GS LT G.03||Structured Data||sl13, sl13x4|
|14.||Tuesday||28 Oct||Julian||AT LT1||Structured Data, cont.; enums; switch|
|Lab 7||Thur30/Mon3/Tues4||M+/J+/J||AT4.12/AT5.05||Structured data types||lab7.pdf||running.c|
|Tutorial||Tutor||week 8 sheet||tutwk8.pdf||bubblesort.c, mergerec.c|
|15.||Monday||3 Nov||Mary||50GS LT G.03||Searching and sorting||sl15, sl15x4||search.c, bubblesort.c|
|16.||Tuesday||4 Nov||Mary||AT LT1||Recursion (including mergesort)||sl16, sl16x4|
|Tutorial||Tutor||week 9 sheet||tutwk9.pdf|
|17.||Monday||10 Nov||Julian||50GS LT G.03||Libraries and Separate Compilation||- sl17, sl17x4|
|18.||Tuesday||11 Nov||Julian||AT LT1||Files in C||sl18, sl18x4|
|Lab 8||Thur13/Mon17/Tues18||M+/J+/J||AT4.12/AT5.08||Recursion and some File work||lab8.pdf|
|Tutorial||Tutor||Mock exam Qs; Files and Arguments||see prev sheet|
|19.||Monday||17 Nov||Julian||50GS LT G.03||Program Arguments, More C; Mock exam feedback||sl19, sl19x4, slM, slMx4||arg.c|
|20.||Tuesday||18 Nov||Mary||AT LT1||Some past exam Questions||Aug12 paper||files|
|Lab 9||Thur20/Mon24/Tues25||M+/J+/J||AT4.12/AT5.05||past exam papers||Dec 2011, Dec 2012|
Your grade for CP will depend on two components. The first part will be a single electronically-submitted piece of coursework, due by 4pm, Friday 14th November (end week 9). This work is worth 10% of your overall grade. The second is the final exam, carried out as a computer-based programming test held in the computer labs, taking place at the the end of semester 1. This final exam is worth 90% of your overall grade.
The (due end week 9) coursework must also be completed by CMPT students and is worth 10% of their grade also. However, the weighting of the exam is slightly different - it is worth only 70%, with the remaining 20% depending on the extra piece of practical work for CPMT students, done with the Music department in week 11.
"A Book on C: Programming in C", 4th edition; by Al Kelley and Ira Pohl.
Informatics Forum, 10 Crichton Street, Edinburgh, EH8 9AB, Scotland, UK
Tel: +44 131 651 5661, Fax: +44 131 651 1426, E-mail: email@example.com
Please contact our webadmin with any comments or corrections. Logging and Cookies
Unless explicitly stated otherwise, all material is copyright © The University of Edinburgh