Lecture 3

Question 1

Which items go into .h files?

Answer 1

Constant defintions
Type definitions
Function prototypes

Question 2

What are the five steps in the compilation process?

Answer 2

Pre-process, Compile, Assemble, Link, Load

Question 3

Where does the heap exist?

Answer 3

Outside the call stack

Question 4

If a function has a pointer to the heap, it has access to what?

Answer 4

Any memory from the heap

Question 5

What must be done when working with heaps?

Answer 5

Return the memory to the operating system if finished with it

Question 6

What library must be included to use heap in c?

Answer 6

stdlib.h

Question 7

How do we create space?

Answer 7

malloc (memory allocate)

Question 8

From c’s perspective, a 1D array is what>

Answer 8

Just a pointer

Question 9

We use stack destroy to do what??

Answer 9

Free the space

Question 10

If we want dynamic arrays, what do we need?

Answer 10

Malloc or calloc and to use realloc to grow the array size when the array gets full

Question 11

What are the three types of linked lists?

Answer 11

Singly linked
Doubly linked
Circularly linked