Data Structures and Algorithms with Python
Kent D. Lee, Steve Hubbard

Informasi Umum

Kode

20.21.324

Klasifikasi

004 - Data processing, Computer science

Jenis

Buku - Elektronik (E-Book)

Subjek

Data Processing

No. Rak

Tel-U Gedung Manterawu Lantai 5 : Rak 1
Tel-U Purwokerto : Rak 1

Dilihat

162 kali

Informasi Lainnya

Abstraksi

Thanks for choosing Data Structures and Algorithms with Python. This text was written based on classroom notes for two courses, an introductory data structures and algorithms course and an advanced data structures and algorithms course. The material contained in this text can be taught in two semesters. The early chapters in this text are intended as an introductory text for data structures and algorithms, while the later chapters cover advanced topics that are suitable for the second course in data structures and algorithms. The Python language is used throughout the text and some familiarity with Python or some other object-oriented language is assumed. However, the ?rst chapter contains a Python primer for those coming from a different language background. This text serves well as a follow-on text to Python Programming Fundamentals by Kent D. Lee and published by Springer, but does not require you to have read that text. In this text the next steps are taken to teach you how to handle large amounts of data ef?ciently. A number of algorithms are introduced and the need for them is motivated through examples that bring meaning to the problems we face as computer programmers. An algorithm is a well-de?ned procedure for accom- plishing a task. Algorithms are an important part of Computer Science and this text explores many algorithms to give you the background you need when writing programs of your own. The goal is that having seen some of the sorts of algorithms presented in this text, you will be able to apply these techniques to other programs you write in the future. Another goal of this text is to introduce you to the idea of computational complexity. While there are many unique and interesting algorithms that we could explore, it is important to understand that some algorithms are more ef?cient than others. While computers are very good at doing calculations quickly, an inef?cient algorithm can make the fastest computer seem very slow or even make it appear to come to a halt. This text will show you what can and cannot be computed ef?ciently. The text builds this idea of ef?ciency from the most basic of facts giving you the tools you will need to determine just how ef?cient any algorithm is so you can make informed judgements about the programs you write.

• CII2C2 - ANALISIS KOMPLEKSITAS ALGORITMA
• TUI1E3 - ALGORITMA DAN PEMROGRAMAN
• TKI2D3 - PEMROGRAMAN BERORIENTASI OBYEK
• TUI1E3 - ALGORITMA DAN PEMROGRAMAN
• VII1E4 - IMPLEMENTASI STRUKTUR DATA
• CII2B4 - STRUKTUR DATA
• CII2B4 - STRUKTUR DATA
• CII2B4 - STRUKTUR DATA
• CPI2B4 - STRUKTUR DATA
• CII-2B4 - STRUKTUR DATA
• CII2B4 - STRUKTUR DATA
• ISI2C4 - STRUKTUR DATA DAN ALGORITMA
• CCK2AAB4 - Struktur Data
• CDK2BAB2 - Analisis Kompleksitas Algoritma
• CDK2AAB4 - Struktur Data
• CAK2EAB4 - Struktur Data
• CAK2EAB4 - Struktur Data
• CBK2BAB4 - Struktur Data
• ACK2AAB3 - Struktur Data
• CBK3CAB4 - Pemrograman Berorientasi Obyek
• GCK1MAB4 - Pemrograman Berorientasi Obyek
• AZK1DAB3 - Algoritma dan Pemrograman
• GCK1AAB4 - Algoritma dan Pemrograman
• GIK1AAB4 - Algoritma dan Pemrograman
• GHK1FAB4 - Algoritma Dan Pemrograman
• AZK1DAB3 - Algoritma Dan Pemrograman

Koleksi & Sirkulasi

Tersedia 1 dari total 1 Koleksi

Pengarang

Nama	Kent D. Lee, Steve Hubbard
Jenis	Perorangan
Penyunting
Penerjemah

Penerbit

Nama	Springer
Kota	New york
Tahun	2015

Sirkulasi

Harga sewa	IDR 0,00
Denda harian	IDR 0,00
Jenis	Non-Sirkulasi

Download / Flippingbook