Notes 1:
Addendum to Essentials of Data Structures, Cpt 1

Math 61 -- D. C. Smolarski, S.J.
Santa Clara University, Department of Mathematics and Computer Science

[Return to Math 61 Homepage | Return to Notes Listing Page]

Contents


Introduction to Data Structures

Handy quote to put course into context:
If carpenters built houses
the way some programmers write code,
the first termite to come along
would wipe out all civilization!

This course concentrates on the foundational materials with which programs are written: Data Structures. It will look at questions such as: ``What is the best way to store information/data?'' ``What algorithms can be used to manipulate, retrieve, updata data?'' ``Which algorithms are best for which problems?''

It is not uncommon to find newspaper, journal articles, or web pages devoted to issues regarding "computer glitches" or "software reliability." (Try a web search via some search engine on the words "computer glitches" or "software reliability" (sample link) to see horror stories of near-disasters due to programming errors.)

Planning for Programs

When developing programs, there are three major types of errors that may occur: All three types of errors must be dealt with and eliminating any type of error can be very time-consuming.

Suggested advance planning for completing programs on time.

Writing Longer Programs

When writing longer programs, i.e., programs with several functions / procedures / subprograms, try the following:


This page is maintained by Dennis C. Smolarski, S.J.
© Copyright 1998, 1999 Dennis C. Smolarski, SJ, All rights reserved.
Last changed: 26 March 1999.