{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

outline - Detailed Course Outline Introduction(ch 1 Class...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Detailed Course Outline Introduction (ch 1) Class Objectives Object oriented programming Data structures Algorithms Software engineering Problem Solving Approaches Abstraction and information hiding Object oriented design Top down design Software development models Programming Issues Modularity Modifiability Ease of use Error recovery Style Debugging Data Abstraction (ch 3) Motivation Information hiding Software modularity Abstract Data Types Specifying ADTs Designing ADTs Implementing ADTs Using ADTs Application example Polynomials Linked Lists (ch 4) Preliminaries
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Motivation Pointers in C++ Dynamic size arrays Linked list nodes Connecting nodes Linked list operations Printing a list Creating a list Inserting data into list Multiple insertions Insert at end Sorted insert Sorted insert code Checking for empty list Checking for full list Searching a list
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}