+ All Categories
Home > Documents > Data Structures & Algorithms Richard Newman Clip Art Sources s s s s .

Data Structures & Algorithms Richard Newman Clip Art Sources s s s s .

Date post: 19-Dec-2015
Category:
Upload: marilyn-washington
View: 214 times
Download: 1 times
Share this document with a friend
Popular Tags:
21
Data Structures & Algorithms Richard Newman
Transcript

Data Structures & Algorithms

Richard Newman

Clip Art Sources

www.barrysclipart.com www.livinggraphics.com www.rad.kumc.edu www.graphicmaps.com

Initial design from Sahni’s course, modified greatly by Newman for Sedgewick’s book

What The Course Is About

Data structure: representation and storage of data.

Algorithm: method for solving a problem Programs represent data Programs use algorithms to manipulate

those data

What The Course Is About

• Algorithm design methods needed to develop programs that do the data manipulation.

• The study of data structures and algorithms is fundamental to Computer Science.

Prerequisites

Asymptotic Complexity

Big Oh, Theta, and Omega notations

C++ Discrete Structures, Calculus

Web Site

www.cise.ufl.edu/~nemo/cop3530/ www.cise.ufl.edu/cop3530sp15/

Handouts, syllabus, text, source codes, exercise solutions, lectures, assignments, past exams, past exam solutions, TAs, etc.

Check twice weekly (48 hr apart)

Instructor

Dr. Richard “Dr. Nemo” Newman (nemo) www.cise.ufl.edu/~nemo/

Office hours: MWF 10:30-11:30 Office: CSE-E346

Teaching Assistants TA location: CSE-E309

Md Mahmudul Hasan (mmhasan) Office hours: M 10th, T 9th & 10th

Rahul Prabhu (rprabhu) Office hours: TBD

AssignmentsAssignment guidelinesSubmission procedures

Discussion Sections

Required to attend your section TA may present a small problem that

you are to do during discussion TA may go through exercises from the

book TA will answer your questions

Goals Devise and analyze algorithms and

data structures to solve moderately hard problems

Correctly develop, document, and test programs to implement those algorithms and data structures

Roadmap Fundamentals Data Structures Sorting Searching Graph Algorithms Odds and Ends

Grades

15% for quizzes 5% for homeworks 35% for projects 15% for each exam (3 exams)

Grades (Rough Cutoffs)

A >= 80% B+ >= 75% B >= 70% C+ >= 65% C >= 60% D+ >= 55% D >= 50%

Why Study Algorithms? We are in the information age! Information = data with interpretation Algorithms allow us to manipulate the data to

obtain desired information Effect of algorithm is huge – on time, on

space, on power; and on information! Impact of algorithms in all facets of science,

medicine, law, engineering, art, music, business, and life

Why Study Algorithms? Study of algorithms at least as old as Euclid ca.

300 BC The name derives from a ca. AD 825 Arabic

mathematician, Muhammed ibn al-Khwarizmi Formalized by Church and Turing in 1930’s Some important algorithms were discovered by

undergraduates in a class just like this!

Why Study Algorithms? Intellectual stimulation: “For me, great

algorithms are the poetry of computation. Just like verse, they can be terse, allusive, dense, and even mysterious. But once unlocked, they cast a brilliant new light on some aspect of computing.” – Francis Sullivan

Why Study Algorithms? Improve programming skills: “I will, in fact, claim

that the difference between a bad programmer and a good one is whether he considers his code or his data structures more important. Bad programmers worry about code. Good programmers worry about data structures and their relationships.” – Linus Torvalds

“Algorithms + Data Structures = Programs” – Niklaus Wirth

Why Study Algorithms? Unlock secrets of the universe: “Computer

models mirroring real life have become crucial for most advances in chemistry today… Today the computer is just as important a tool for chemists as the test tube.” – Royal Swedish Academy of Sciences (Nobel Prize in Chemistry 2013)

Why Study Algorithms? Everyone else is doing it! For fun and for profit!

Next – Lecture 2

Read Chapters 1 & 2 Union-Find Empirical analysis Asymptotic analysis of algorithms Basic recurrences


Recommended