This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 4/4/10 1 CMPSC 24: Lecture 3 Pointers & Linked Lists Divyakant Agrawal Department of Computer Science UC Santa Barbara Announcements • Make sure each of you join the Google Group created for CMPSC 24 (both Lecture Sec¡ons): – hNp://groups.google.com/group/cs‐24‐spring‐2010 Lecture outline • Discussion of pointers • Recursive Data Structures: – Linked Lists 4/4/10 2 DefniLons • An address is a locaLon in memory: – All data (variables) in a program have addresses • A pointer is a variable that stores “address” oF other data/variables. 100000 POINTER INTEGER DefniLons • Dynamic Data is memory that is allocated within your program while the program is execuLng, i.e., at run‐Lme: – Does not have name – Run‐Lme system dynamically assigns an address based on the allocaLon – Access needs to managed via pointer variable that stores the address – The pointer has a name but the memory locaLon it points to does not have a name – Program must de‐allocate the data when no longer...
View Full Document
This note was uploaded on 12/27/2011 for the course CMPSC 24 taught by Professor Agrawal during the Fall '09 term at UCSB.
- Fall '09