Scribd
Upload
51 views2 pages

CSCI 104L: Lecture 5: Abstract Data Types

The document discusses abstract data types (ADTs) and encapsulation through classes. It provides examples of common ADTs like lists, sets, and maps and their basic operations. It then shows how to define a class called IntLinkedList that encapsulates a linked list implementation. The class defines public and private member functions for operations like prepend, remove, and printing the list forward and backward. It also includes a destructor to prevent memory leaks when deleting the linked list object.

Uploaded by

Sepwinda Hanifa Astuti
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
51 views2 pages

CSCI 104L: Lecture 5: Abstract Data Types

The document discusses abstract data types (ADTs) and encapsulation through classes. It provides examples of common ADTs like lists, sets, and maps and their basic operations. It then shows how to define a class called IntLinkedList that encapsulates a linked list implementation. The class defines public and private member functions for operations like prepend, remove, and printing the list forward and backward. It also includes a destructor to prevent memory leaks when deleting the linked list object.

Uploaded by

Sepwinda Hanifa Astuti
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CSCI 104L: Lecture 5

Abstract Data Types


• If we are precise about what we want to do (the operations we want to implement), then we have
specified an Abstract Data Type or ADT.
• A List is defined by the following operations, where T denotes any one type (such as int, string, etc).
1. void insert (int position, T value): inserts value at the specified position, moving all later elements
one position to the right.
2. void remove(int position): removes the value at the specified position, moving all later elements
one position to the left.
3. void set(int position, T value): overwrites the specified position with the given value.
4. T get (int position): returns the value at the specified position.
• A Set (called a Bag in the textbook) supports the following:
1. void add (T item): adds item to the set.
2. void remove (T item): removes item from the set.
3. bool contains (T item): determines whether the set contains item.
• A Map (sometimes referred to as a Dictionary) associates values with keys. keyType can be any
individual data type, as can valueType.
1. void add (keyType key, valueType value): adds a mapping from key to value.
2. void remove (keyType key): removes the mapping for key.
3. valueType get (keyType key): returns the value that key maps to.
• All of the ADTs support storing and accessing data. It would be kind of pointless to make an ADT
which did not support this.
• A List cares about order, whereas the others do not.

Encapsulation and Classes

We will group together all data and functions that interact with that data into a common element, or class.
This idea is called encapsulation. Here is an example class signature for a linked list of integers:
class IntLinkedList {
public :
IntLinkedList ( ) ;
I n t L i n k e d L i s t ( int n ) ;
˜ IntLinkedList ( ) ;
void prepend ( int n ) ;
void remove ( int toRemove ) ;
void p r i n t L i s t ( ) ;
void p r i n t R e v e r s e ( ) ;
private :
void p r i n t R e v e r s e H e l p e r ( Item ∗p ) ;
Item ∗ head ;
};
Here is how we will implement printReverse().
void I n t L i n k e d L i s t : : p r i n t R e v e r s e ( ) {
i f ( head != NULL) p r i n t R e v e r s e H e l p e r ( head ) ;
}
void I n t L i n k e d L i s t : : p r i n t R e v e r s e H e l p e r ( Item ∗p ) {
i f ( p−>next != NULL) p r i n t R e v e r s e H e l p e r ( p−>next ) ;
c o u t << p−>v a l u e ;
}

Here is a possible usage of our IntLinkedList:


int main ( ) {
I n t L i n k e d L i s t ∗ myList = new I n t L i n k e d L i s t ;
myList−>p r i n t L i s t ( ) ;
delete myList ;
return 0 ;
}

A destructor is necessary to prevent memory leaks:


IntLinkedList : : ˜ IntLinkedList () {
Item ∗p = head , ∗q ;
while ( p != NULL) {
q = p−>next ;
delete p ;
p = q;
}
}

You can have multiple constructors. You could allow a user to start a Linked List with a single node with
value n. Both constructors can be used, one constructor does not replace the other.

You might also like