Abstract Data Types and Generics

$\newcommand{\R}{\mathbb R} \newcommand{\lt}{<} \newcommand{\gt}{>} \newcommand{\amp}{&} \definecolor{fillinmathshade}{gray}{0.9} \newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}} $

Section 3.3 Abstract Data Types and Generics

Subsection 3.3.1 Algorithms

At the heart of computer program design are two (sometimes conflicting) goals:

To design an algorithm that is easy to understand, code, and debug.
To design an algorithm that makes efficient use of the computer’s resources.
The method for evaluating the efficiency of an algorithm or computer program is called asymptotic analysis.

Subsection 3.3.2 Guideline of Data Structure Selection

Here is a link to a Powerpoint on the guidlines to data structures: Powerpoint ¹

Subsection 3.3.3 Learn more about ADT

Here is a link to the OpenDSA textbook that talks more about ADT and shows examples: Read me ²

You have attempted of activities on this page.

uncc.instructure.com/courses/16965/files/21470913/download?download_frd=1

opendsa-server.cs.vt.edu/OpenDSA/Books/Everything/html/ListADT.html#list-adt-programming-exercise

Data Structures and Algorithms: BRIDGES

Search Results:

Section 3.3 Abstract Data Types and Generics

Subsection 3.3.1 Algorithms

Subsection 3.3.2 Guideline of Data Structure Selection

Subsection 3.3.3 Learn more about ADT