1 / 7

CS312 Algorithms

CS312 Algorithms. Sami Rollins srollins@mtholyoke.edu Spring 2006. Introduction. What is an algorithm? Why study algorithms? How do you evaluate an algorithm?. Administrative Information. Course Website Syllabus Academic Dishonesty Calendar

ida
Download Presentation

CS312 Algorithms

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CS312Algorithms Sami Rollins srollins@mtholyoke.edu Spring 2006

  2. Introduction • What is an algorithm? • Why study algorithms? • How do you evaluate an algorithm?

  3. Administrative Information • Course Website • Syllabus • Academic Dishonesty • Calendar http://www.mtholyoke.edu/courses/srollins/cs312/

  4. Data Structures • What is a data structure? • “a scheme for organizing related pieces of information.“ -http://www.webopedia.com/TERM/D/data_structure.html • Typically describes the operations which can be performed on the data and/or how data are organized to support those operations • Example data structures? • Array? • Linked list?

  5. Common Data Structures • Stacks – Last In First Out (LIFO) • Insert on top • Remove top element • Queues – First In First Out (FIFO) • Insert at end • Remove from beginning • Trees - Hierarchy • Root • Parent • Children

  6. Choosing a Data Structure • When would you use a… • Stack? • Queue? • Tree?

  7. Implementing Data Structures • How would you implement a… • Stack? • Queue? • Tree?

More Related