cs246-s11-001-june9

cs246-s11-001-june9 - CS 246(Spring 2011 Section 1 Thursday...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 246 (Spring 2011) – Section 1 Thursday 9 June Dynamic Storage Management, Overloading, and Routine Pointers
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS 246 (Spring 2011) - Section 001 - Thursday 9 June 2 Today's Agenda 2.15 Dynamic Storage Management 2.16 Overloading 2.17 Routine Pointers
Background image of page 2
CS 246 (Spring 2011) - Section 001 - Thursday 9 June 3 2.15 Dynamic Storage Management Dynamically-allocated storage is requested at runtime in a location called the heap Managed languages automatically free dynamically-allocated storage e.g. Java, Scheme Known as garbage collection Unmanaged languages do not e.g. C, C++ We must do this ourselves
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS 246 (Spring 2011) - Section 001 - Thursday 9 June 4 C syntax Let's say we have the following definition struct Node { int value; struct Node *next; }; To allocate and free space on the heap struct Node *n = malloc(sizeof(struct Node)); n->value = 12; n->next = NULL; // . . . free(n);
Background image of page 4
CS 246 (Spring 2011) - Section 001 - Thursday 9 June 5 C++ syntax Let's say we have the following definition
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/08/2011 for the course CS 246 taught by Professor Wormer during the Spring '08 term at Waterloo.

Page1 / 14

cs246-s11-001-june9 - CS 246(Spring 2011 Section 1 Thursday...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online