1 / 21

Data Structures, Algorithms, & Applications

Data Structures, Algorithms, & Applications. Dr. Manuel E. Bermudez Alter ego to Dr. Sartaj Sahni. Clip Art Sources. www.barrysclipart.com www.livinggraphics.com www.rad.kumc.edu www.graphicmaps.com. What The Course Is About.

dextra
Télécharger la présentation

Data Structures, Algorithms, & Applications

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. Data Structures, Algorithms, & Applications Dr. Manuel E. Bermudez Alter ego to Dr. Sartaj Sahni

  2. Clip Art Sources • www.barrysclipart.com • www.livinggraphics.com • www.rad.kumc.edu • www.graphicmaps.com

  3. What The Course Is About • Data structures is concerned with the representation and manipulation of data. • All programs manipulate data. • So, all programs represent data in some way. • Data manipulation requires an algorithm.

  4. The study of data structures and algorithms is fundamental to Computer Science. What The Course Is About • Algorithm design methods needed to develop programs that do the data manipulation.

  5. Prerequisites • Java • Asymptotic Complexity • Big Oh, Theta, and Omega notations

  6. Syllabus, text, source codes, exercise solutions, lectures, assignments, past exams, past exam solutions, TAs, etc. • READ ALL OF IT. Web Site • www.cise.ufl.edu/~manuel Follow link to COP-3530.

  7. Do Assignment 1 by THIS FRIDAY . Assignments • Assignment guidelines. • Submission procedures.

  8. Source Codes • Read download and use instructions. • Must have Java 1.2 or higher. • See ProgramIndex.htm, AllNames.html and other html files produced by Javadoc for Java codes.

  9. Discussion Sections • Go to any one. • TA will answer your questions. • TA will go through a few exercises from the book. • TA will also cover topics relevant to your assignment.

  10. Organization of Text • Three parts. • Part I … Chapters 1-4, Background. • Part 2 … Chapters 5-17, Data Structures. • Part 3 … Chapters 18-22, Algorithms. • Each chapter … concepts + applications.

  11. Grades • 40% for assignments (about 12 of them). • 20% midterm 1. • 20% midterm 2. • 20% final exam.

  12. Grades (Rough Cutoffs) NOTE: These differ from those in Dr. Sahni’s course ! • A >= 90% • B+ >= 85% • B >= 80% • C+ >= 75% • C >= 70% • D+ >= 65% • D >= 60% • E < 60%

  13. Sorting • Rearrange a[0], a[1], …, a[n-1] into ascending order. When done, a[0] <= a[1] <= … <= a[n-1] • 8, 6, 9, 4, 3 => 3, 4, 6, 8, 9

  14. Sort Methods • Insertion Sort • Bubble Sort • Selection Sort • Count Sort • Shaker Sort • Shell Sort • Heap Sort • Merge Sort • Quick Sort

  15. Insert An Element • Given a sorted list/sequence, insert a new element. • Given 3, 6, 9, 14. • Insert 5. • Result 3, 5, 6, 9, 14.

  16. Insert an Element • 3, 6, 9, 14 insert 5 • Compare new element (5) and last one (14) • Shift 14 right to get 3, 6, 9, , 14 • Shift 9 right to get 3, 6, , 9, 14 • Shift 6 right to get 3, , 6, 9, 14 • Insert 5 to get 3, 5, 6, 9, 14

  17. Insert An Element // insert t into a[0:i-1] int j; for (j = i - 1; j >= 0 && t < a[j]; j--) a[j + 1] = a[j]; a[j + 1] = t;

  18. Insertion Sort • Start with a sequence of size 1 • Repeatedly insert remaining elements

  19. Insertion Sort • Sort 7, 3, 5, 6, 1 • Start with 7 and insert 3 => 3, 7 • Insert 5 => 3, 5, 7 • Insert 6 => 3, 5, 6, 7 • Insert 1 => 1, 3, 5, 6, 7

  20. Insertion Sort for (int i = 1; i < a.length; i++) {// insert a[i] into a[0:i-1] // code to insert comes here }

  21. Insertion Sort for (int i = 1; i < a.length; i++) {// insert a[i] into a[0:i-1] int t = a[i]; int j; for (j = i - 1; j >= 0 && t < a[j]; j--) a[j + 1] = a[j]; a[j + 1] = t; }

More Related