DOC PREVIEW
TRINITY CSCI 1320 - Lecture Notes

This preview shows page 1-2-3 out of 8 pages.

Save
View full document
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Closing it all up 12 5 2006 1 Opening Discussion What did we talk about last class Do you have any questions about the assignment 2 Linked Lists Let s start off by finishing off the code we started last time for a linked list 3 Other ADTs Your text discusses two other ADTs that are actually simpler than the list These are the stack and the queue Both of these can be implemented with either arrays or linked lists as well They are incredibly simple and don t give you control over how things are added or removed All you can do is say you want to add or remove something Beyond those the next most common type of ADT is what is called a map A map keeps track of two pieces of data a key and an element With a map ADT you look up data using the specified key Maps can be implemented in many ways Array or linked list implementations would be slow 4 Other Linked Structures It turns out that a lot of computer science is done with linked data structures Like linked lists these are data structures that have pointers connecting various pieces of data The styles can vary dramatically though Maps are often implemented with data structures called trees that have links that follow certain rules A large amount of theory in both CS and math goes into the study of graphs These are linked structures that have no limitations on how things can be linked together 5 Course Recap The material covered in this class primarily focused on the C programming language along with forcing you to use the Linux command line and a text editor C was used because it has simple constructs for basic programming Variables Functions Conditionals Loops Arrays Pointers Recursion We also covered some specific libraries for strings 6 and files Primary Objectives Developing problem solving skills Problem decomposition Approaching problems logically and thinking them out Making you think Giving you the ability to think about things in new ways When you see a series in math or a repetitive activity you should think loop When you use a household appliance I want you to be picturing boolean logic of how data might be formatted in a binary file 7 Minute Essay Course evals These are important and I pay close attention to feedback Use them to help me improve the class They are not returned until after grades are turned in When would you like to have a review session for the final Mainly does Sunday afternoon work for you The final is a week from yesterday in this room at 2pm 8


View Full Document

TRINITY CSCI 1320 - Lecture Notes

Documents in this Course
Functions

Functions

10 pages

Functions

Functions

10 pages

Graphics

Graphics

10 pages

Graphics

Graphics

11 pages

Loops

Loops

4 pages

Loops

Loops

3 pages

Strings

Strings

9 pages

Functions

Functions

10 pages

Loops

Loops

11 pages

Graphics

Graphics

11 pages

Graphics

Graphics

12 pages

Sorting

Sorting

11 pages

Sorting

Sorting

10 pages

Arrays

Arrays

10 pages

Loops

Loops

18 pages

Load more
Download Lecture Notes
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Lecture Notes and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Lecture Notes and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?