1 / 8

Introduction

Introduction. Data Structures and Algorithms. Overview. Intermediate-level course Programming and problem solving Algorithms: method for solving a problem. Data structures: method to store information. Why Study Algorithms. Using a computer? Want it to go faster? Process more data?

gianna
Download Presentation

Introduction

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. Introduction Data Structures and Algorithms

  2. Overview • Intermediate-level course • Programming and problem solving • Algorithms: method for solving a problem. • Data structures: method to store information Introduction

  3. Why Study Algorithms • Using a computer? • Want it to go faster? Process more data? • Want it to do something that would otherwise be impossible? • Technology improves things by a constant factor • but might be costly • good algorithmic design can do much better and might be cheaper • supercomputers cannot rescue a bad algorithm Introduction

  4. Areas of application • Multimedia. CD player, DVD, MP3, JPG, DivX... • Internet. Packet routing, Google,.. • Communication. Cell phones, e-commerce • Computer. Circuit layout, file system • Computer graphics. Movies, video games • Science. Human genome, protein folding • Transportation. Airline crew scheduling, UPS deliveries Introduction

  5. People • Lecturer: Trần Thị Minh Châu • 309 E3, chauttmATvnu.edu.vn • Teaching Assistant: Nguyễn Quốc Đại • Lab exercises, homeworks • 303 E3, nquocdaiATgmail.com Introduction

  6. Coursework and Grading • Weekly exercises: 20% • Lab exercises, written homework. • Exams (closed book) • Midterm: 20% • Final: 60% • Penalty • Plagiarism: immediate FAIL Introduction

  7. Course Material • http://coltech.vnu.edu.vn/~chauttm/dsa2012w • Announcement, syllabus, homework, exercises, lecture notes... • [AIC] Robert Sedgewick, Algorithms in C++, 3rd edition • Đinh Mạnh Tường, Cấu trúc dữ liệu và giải thuật. • [DSAJ] Michael T. Goodrich and Roberto Tamassia. Data structures and Algorithms in Java (4th edition). Introduction

  8. Final Notes • Not a course on programming • Self-study is a MUST • Code of conduct: • Respect other people. • Be self-responsible. • No question is stupid. Introduction

More Related