ECS 30 Lecture 27: Lecture 27

25 views2 pages

5 Jun 2018

School

Department

Course

Professor

For unlimited access to Class Notes, a Class+ subscription is required.

Lecture 27

The case for a dynamic ADT

- Extensible collection of data

o But extensibility actually very limited

- Inserting an item

- Removing an item

- Needs a contiguous space in memory

- This enables more room for memory storage and the function can fully be complete

Basic structure

- The most famous ADT in C

- Each item is linked to the next in the series

- Its possible to insert and delete code in the middle

- Possible to rearrange based on needs and rules

Now we will see various ways to insert and delete in different circumstances:

Insertion - front and back

- See diagram:

find more resources at oneclass.com

Unlock document

This preview shows half of the first page of the document.
Unlock all 2 pages and 3 million more documents.

Already have an account? Log in

Get access