Back CSE 240 Module 6 - Memory Management & Object-Oriented Programming Programming
Download Open
Show description 2,055 chars · Programming

CSE 240 Module 6 - Memory Management & Object-Oriented Programming

CSE 240 Module 6 - Memory Management & Object-Oriented Programming




CSE 240 Module 6

Memory Management & Object-Oriented Programming Cheat Sheet





Table of Contents


1. Memory Management & Garbage Collection

2. Constructors & Destructors

3. Memory Types (Stack, Heap, Static)

4. Object-Oriented Programming Concepts

5. Class Definition & Implementation

6. Access Control & Information Hiding

7. Practical Examples






1. Memory Management & Garbage Collection



Garbage Collection in C/C++


Critical Rules:


C/C++ programmers must correctly decide when to free unused memory created with malloc()/new

Memory leakage happens if programmer forgets to free()/delete unused memory

For each malloc()/new, one must use corresponding free()/delete

Number of free()/delete used should equal number of malloc()/new used








Garbage Collection Comparison




Language

Garbage Collection

Advantages

Disadvantages






Java

Automatic (reference counter)

No manual memory management needed

May not run often enough, bad for real-time systems




C++

Manual (programmer controlled)

Complete control over timing

Memory leaks, dangling references possible









Binary Tree Deletion Example

void dTree(TreeNode *p) {
if (p == 0) return;
if (p->left != 0) // size-m problem
dTree(p->left);
if (p->right != 0) // size-m problem
dTree(p->right);
delete p; // What traversing order is used?
return;
}

Answer: This uses postorder traversal - deletes children first, then parent.





Deleting Collection of Objects


Best Practices:

Linked List: Use loop with temporal pointer, delete forwards or backwards

Tree: Use pre-order, in-order, or post-order traversing to delete each node

Array/Array of Arrays: Delete array, then each pointer, then each structure





// Deleting Linked List Step by Step (While-Loop)
temp = head;
while (temp != NULL) {
temp = temp->next;
delete head; // C uses free(head);
head = temp;
}







2.…