Abstract Data Types Vocabulary

A set of vocabulary flashcards defining Abstract Data Types (ADTs) and operations for List, Stack, and Queue ADTs.

Abstract Data Type

A type (or class) for objects whose behavior is defined by a set of value and a set of operations.

LIST ADT

A structure containing elements of the same type arranged in sequential order.

get()

List ADT operation that returns an element from the list at any given position.

insert()

List ADT operation that inserts an element at any position of the list.

remove()

List ADT operation that removes the first occurrence of any element from a non-empty list.

removeAt()

List ADT operation that removes the element at a specified location from a non-empty list.

replace()

List ADT operation that replaces an element at any position by another element.

STACK ADT

A structure containing elements of the same type arranged in sequential order, where all operations take place at a single end called the top of the stack.

push()

Stack ADT operation that inserts an element at one end of the stack called top.

pop()

Stack ADT operation that removes and returns the element at the top of the stack, if it is not empty.

Top

The place in a stack where all insertion and deletion takes place.

QUEUE ADT

A structure containing elements of the same type arranged in sequential order, where operations take place at both ends: insertion at the end and deletion at the front.

enqueue()

Queue ADT operation that inserts an element at the end of the queue.

dequeue()

Queue ADT operation that removes and returns the first element of the queue, if the queue is not empty.

Front

The place in a queue where deletion takes effect.

Rear

The place in a queue where insertion takes effect.

peek()

An operation that returns the element at the top of a stack or front of a queue without removing it, provided the structure is not empty.

size()

An operation that returns the number of elements in a list, stack, or queue.

isEmpty()

An operation that returns true if the structure is empty, otherwise returns false.

isFull()

An operation that returns true if the structure is full, otherwise returns false.