click here

Final exam

theory and practical

three hours

morning or afternoon session

(preferences form coming out soon)

Final exam

understanding and application of course topics

control flow (loops, branching)

abstraction (through functions, ADTs)

data structures (including structs, ADTs, arrays, linked lists)

memory and allocation (including the use of pointers, calloc, and free)

linked lists (to implement a List, Stack, or Queue ADT)

understanding of programming style

Final exam

read, write, understand code

Final exam: Theory

both short response and long response questions

no compiler

demonstrate an understanding of course concepts

(i.e. not rote learning)

Final exam: Prac

compiler

write actual code that works

another chance to pass array / linked list questions

additional questions

How do I study for the final exam?

cram the night before

if you’ve:

… been to tutes

… done the labs

… worked on the assignments

… practiced consistently throughout the semester

you should be fine.

How do I study for the final exam?

however, if you’ve

… skipped all of the tutes and labs

… not seriously attempted the assignments

… not put consistent work in across the semester

…

you can’t learn programming overnight

Previously on COMP1511…

printf(“Hello, world!\n”);

conditionals (if/else), functions, loops

memory, arrays, strings, pointers

structs, typedef, dynamic memory allocation

testing, problem solving & abstraction, ADTs

linked lists, stacks & queues, Final Card-Down

… the end?

Previously on COMP1511…

printf(“Hello, world!\n”);

conditionals (if/else), functions, loops

memory, arrays, strings, pointers

structs, typedef, dynamic memory allocation

testing, problem solving & abstraction, ADTs

linked lists, stacks & queues, Final Card-Down

… the end?

Previously on COMP1511…

printf(“Hello, world!\n”);

conditionals (if/else), functions, loops

memory, arrays, strings, pointers

structs, typedef, dynamic memory allocation

testing, problem solving & abstraction, ADTs

linked lists, stacks & queues, Final Card-Down

… the end?

Previously on COMP1511…

printf(“Hello, world!\n”);

conditionals (if/else), functions, loops

memory, arrays, strings, pointers

structs, typedef, dynamic memory allocation

testing, problem solving & abstraction, ADTs

linked lists, stacks & queues, Final Card-Down

… the end?

Previously on COMP1511…

printf(“Hello, world!\n”);

conditionals (if/else), functions, loops

memory, arrays, strings, pointers

structs, typedef, dynamic memory allocation

testing, problem solving & abstraction, ADTs

linked lists, stacks & queues, Final Card-Down

… the end?

Previously on COMP1511…

printf(“Hello, world!\n”);

conditionals (if/else), functions, loops

memory, arrays, strings, pointers

structs, typedef, dynamic memory allocation

testing, problem solving & abstraction, ADTs

linked lists, stacks & queues, Final Card-Down

… the end?

Previously on COMP1511…

printf(“Hello, world!\n”);

conditionals (if/else), functions, loops

memory, arrays, strings, pointers

structs, typedef, dynamic memory allocation

testing, problem solving & abstraction, ADTs

linked lists, stacks & queues, Final Card-Down

… the end?

Previously on COMP1511…

printf(“Hello, world!\n”);

conditionals (if/else), functions, loops

memory, arrays, strings, pointers

structs, typedef, dynamic memory allocation

testing, problem solving & abstraction, ADTs

linked lists, stacks & queues, Final Card-Down

… the end?

Previously on COMP1511…

printf(“Hello, world!\n”);

conditionals (if/else), functions, loops

memory, arrays, strings, pointers

structs, typedef, dynamic memory allocation

testing, problem solving & abstraction, ADTs

linked lists, stacks & queues, Final Card-Down

… the end?

Previously on COMP1511…

printf(“Hello, world!\n”);

conditionals (if/else), functions, loops

memory, arrays, strings, pointers

structs, typedef, dynamic memory allocation

testing, problem solving & abstraction, ADTs

linked lists, stacks & queues, Final Card-Down

… the end?