Data structures and algorithms using Python and C++:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Wilsonville, Or.
Franklin, Beedle & Associates
2009
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis Klappentext |
| Beschreibung: | Includes index. -- "Builds on knowledge from a first course in computer programming using Python. Makes a transition from programming in Python to a data structures course and programming in C++"--Provided by publisher. |
| Beschreibung: | xiii, 568 p. 24 cm |
| ISBN: | 9781590282335 1590282337 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV042219977 | ||
| 003 | DE-604 | ||
| 005 | 20150428 | ||
| 007 | t | ||
| 008 | 141202s2009 xxu |||| 00||| eng d | ||
| 010 | |a 2008053540 | ||
| 020 | |a 9781590282335 |c alk. paper |9 978-1-590-28233-5 | ||
| 020 | |a 1590282337 |c alk. paper |9 1-590-28233-7 | ||
| 035 | |a (OCoLC)837035223 | ||
| 035 | |a (DE-599)BVBBV042219977 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-739 | ||
| 050 | 0 | |a QA76.73.P98 | |
| 082 | 0 | |a 005.1 | |
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 100 | 1 | |a Reed, David M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Data structures and algorithms using Python and C++ |c David M. Reed, John Zelle |
| 264 | 1 | |a Wilsonville, Or. |b Franklin, Beedle & Associates |c 2009 | |
| 300 | |a xiii, 568 p. |c 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Includes index. -- "Builds on knowledge from a first course in computer programming using Python. Makes a transition from programming in Python to a data structures course and programming in C++"--Provided by publisher. | ||
| 650 | 4 | |a Python (Computer program language) | |
| 650 | 4 | |a C++ (Computer program language) | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 0 | 7 | |a Datenstruktur |0 (DE-588)4011146-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Python |g Programmiersprache |0 (DE-588)4434275-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a C |g Programmiersprache |0 (DE-588)4113195-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Datenstruktur |0 (DE-588)4011146-5 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 2 | |a Python |g Programmiersprache |0 (DE-588)4434275-5 |D s |
| 689 | 0 | 3 | |a C |g Programmiersprache |0 (DE-588)4113195-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Zelle, John M. |e Verfasser |4 aut | |
| 856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027658500&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027658500&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |3 Klappentext |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027658500 | ||
Datensatz im Suchindex
| _version_ | 1804152747082121216 |
|---|---|
| adam_text | Contents
Preface
..................................... xi
Chapter
1
Abstraction and Analysis
і
1.1
Introduction
................................. !
1.1.1
Programming in the Large
.................... 2
1.1.2
The Road Ahead
........................ . 3
1.2
Functional Abstraction
......................... . 5
1.2.1
Design by Contract
........................ 5
1.2.2
Testing Preconditions
...................... 9
1.2.3
Top-Down Design
........................ 13
1.2.4
Documenting Side Effects
.................... 16
1.3
Algorithm Analysis
............................ 17
1.3.1
Linear Search
........................... 17
1.3.2
Binary Search
.......................... 21
1.3.3
Informal Algorithm Comparison
................ 22
1.3.4
Formal Analysis
......................... 24
1.3.5
Big
О
Notation vs. Theta Notation
.............. 30
1.4
Chapter Summary
............................ 32
1.5
Exercises
.................,..........,,.,, 33
Chapter
2
Data Abstraction
39
2.1
Overview
................................. 39
2.2
Abstract Data Types
........................... 40
2.2.1
From Data Type to
AD T
.................... 40
2.2.2
Defining an ADT
......................... 41
2.2.3
Implementing an ADT
..,,,........,....,.,. 43
2.3
ADTs and Objects
............................ 46
III
iv Contents
2.3.1
Specification
........................... 46
2.3.2 Implementation.......................... 48
2.3.3
Changing the Representation
.................. 50
2.3.4
Object-Oriented Design and Programming
........... 51
2.4
An Example ADT:
Dataset
....................... 55
2.4.1
The Process of OOD
....................... 55
2.4.2
Identifying an ADT
....................... 56
2.4.3
Implementing the ADT
..................... 58
2.5
An Example ADT: Rational
....................... 60
2.5.1
Operator Overloading
...................... 60
2.5.2
The Rational Class
........................ 61
2.6
Incremental Development and Unit Testing
.............. 63
2.7
Chapter Summary
............................ 67
2.8
Exercises
................................. 68
Chapter
3
Container Classes
75
3.1
Overview
................................ . 75
3.2
Python Lists
............................... 76
3.3
A Sequential Collection: A Deck of Cards
............... 77
3.4
A Sorted Collection: Hand
........................ 80
3.4.1
Creating a Bridge Hand
..................... 81
3.4.2
Comparing Cards
......................... 83
3.4.3
Sorting Cards
........................... 85
3.5
Python List Implementation
...................... 87
3.5.1
Array-based Lists
......................... 87
3.5.2
Efficiency Analysis
........................ 89
3.6
Python Dictionaries (Optional)
..................... 89
3.6.1
A Dictionary ADT
........................ 90
3.6.2
Python Dictionaries
....................... 90
3.6.3
Dictionary Implementation
................... 93
3.6.4
An Extended Example: A. Markov Chain
........... . 95
3.7
Chapter Summary
............................ 99
3.8
Exercises
................................, 100
Chapter
4
Linked Structures and Iterators
107
4.1
Overview
................................. 107
4.2
The Python Memory Model
....................... 108
4.2.1
Passing Parameters
........................ 114
4.3
A Linked Implementation of Lists
.................... 117
Contents
4.4
Linked
Implementation
of a List ADT
................. 122
4.5
Iterators
.................................. 135
4.5.1
Iterators in Python
........................ 136
4.5.2
Adding an Iterator to LList
................... 137
4.5.3
Iterating with a Python Generator
............... 138
4.6
A Cursor-based List API (Optional)
.................. 140
4.6.1
A Cursor API
........................... 141
4.6.2
A Python CursorList
...................... 142
4.6.3
A Linked CursorList
..................... 144
4.7
Links vs. Arrays
............................. 147
4.8
Chapter Summary
............................ 148
4.9
Exercises
................................. 148
Chapter
5
Stacks and Queues
155
5.
J
Overview
................................. 155
5.2
Stacks
..... ......... .,.,........,.,,,.,,. 155
5.2.1
The Stack ADT
....,.,.,................ 156
5.2.2
Simple Stack Applications
............,......, 157
5.2.3
Implementing Stacks
....................... 159
5.2.4
An Application: Expression Manipulation
........... 160
5.2.5
An Application: Grammar Processing (Optional)
...... . 163
5.3
Queues
................................... 169
5.3.1
A Queue ADT
.......................... 169
5.3.2
Simple Queue Applications
............. ;..... 170
5.4
Queue Implementations
......................... 172
5.5
An Example Application: Queueing Simulations (Optional)
..... 174
5.6
Chapter Summary
............................ 180
5.7
Exercises
................................. 181
Chapter
6
Recursion
189
6.1
Introduction
..........................,...,. 189
6.2
Recursive Definitions
........................... 191
6.3
Simple Recursive Examples
....................... 193
6.3.1
Example: String Reversal
.....,,..,....,..... 193
6.3..2 Example: Anagrams
.,..,...,.......,,,,,,, 195
6.3.3
Example; Fast Exponentiation
..,..,..,..,.,... 197
6.3.4
Example: Binary Search
....,,,...,......,,,. 198
6.4
Analyzing Recursion
........................... 199
6.5
Sorting.
................... , ,.............202
vi
Contents
6.5.1
Recursive
Design:
Mergesort
.................. 202
6.5.2
Analyzing Mergesort
....................... 205
6.6
A Hard Problem: The Tower of Hanoi
................ 207
6.7
Chapter Summary
............................ 212
6.8
Exercises
................................. 212
Chapter
7
Trees
223
7.1
Overview
................................. 223
7.2
Tree Terminology
............................. 224
7.3
An Example Application: Expression Trees
.............. 226
7.4
Tree Representations
........................... 228
7.5
An Application: A Binary Search Tree
................. 230
7.5.1
The Binary Search Property
................... 230
7.5.2
Implementing A Binary Search Tree
.............. 230
7.5.3
Traversing a BST
......................... 238
7.5.4
A Run-time Analysis of BST Algorithms
. ........... 241
7.6
Implementing a Mapping with BST (Optional)
............ 242
7.7
Chapter Summary
............................ 245
7.8
Exercises
................................. 245
Chapter
8 C++
Introduction for Python Programmers
255
8.1
Introduction
................................ 255
8.2 C++
History and Background
..................... 256
8.3
Comments, Blocks of Code, Identifiers, and Keywords
........ 262
8.4
Data Types and Variable Declarations
................. 263
8.5
Include Statements, Namespaces, and Input/Output
......... 267
8.6
Compiling
................................. 271
8.7
Expressions and Operator Precedence
................ . 274
8.8
Decision Statements
........................... 277
8.9
Type Conversions
............................. 281
8.10
Looping Statements
.......................... . 282
8.11
Arrays
................................... 285
8.11.1
Single-Dimension Arrays
..................... 285
8.11.2
Multi-Dimensional Arrays
.................... 287
8.11.3
Arrays of Characters
....................... 287
8.12
Function Details
............................. 288
8.12.1
Declarations, Definitions, and Prototypes
........... 289
8.12.2
Pass by Value
........................... 292
8.12.3
Pass bv Reference
........................ 293
Contents
vii
8.12.4
Passing Arrays as Parameters
.................. 294
8.12.5
const Parameters
........................ 296
8.12.6
Default Parameters
........................ 297
8.13
Header Files and Inline Functions
.................... 298
8.14
Assert Statements and Testing
..................... 303
8.15
The Scope and Lifetime of Variables
.................. 305
8.16
Common
C++
Mistakes by Python Programmers
........... 306
8.17
Additional
C++
Topics (Optional)
................... 307
8.17.1
The
C++
Switch Statement
................... 307
8.17.2
Creating
C++
Namespaces
................... 310
8.17.3
Global Variables
......................... 310
8.18
Chapter Summary
............................ 312
8.19
Exercises
................................. 313
Chapter
9 C++
Classes
319
9.1
Basic Syntax and Semantics
...,,..,...........,.., 319
9.2
Strings
................................... 330
9.3
File Input and Output
.......................... 333
9.4
Operator Overloading
.......................... 335
9.5
Class /rariables and Methods
..................... . 343
9.6
Chapter Summary
............................. 347
9.7
Exercises
................................. 348
Chapter
10 C++
Dynamic Memory
353
10.1
Introduction
................................ 353
10.2 C++
Pointers
.............................. . 360
10.3
Dynamic Arrays
............................. 366
10.4
Dynamic Memory Classes
........................ 371
10.4.1
Destructor
............................. 371
10.4.2
Copy Constructor
........................ 373
10.4.3
Assignment Operator
.....,...,.....,,..,.. 378
10.4.4
A Complete Dynamic Array Class
............... 381
10.4.5
Reference Return Types
..................... 386
10.5
Dynamic Memory Errors
......................... 388
10.5.1
Memory Leaks
.......................... 388
10,5,
Я
Accessing Invalid Memory
,....,,...........,. 390
10.5.3
Memory Error Summary
,.,.,,............... 393
10.6
Chapter Summary
.....,,,.,..,...,......,..., 395
10.7
Exercises
.................,............... 395
viii Contents
Chapter
11 C++
Linked Structures
403
11.1
Introduction
................................ 403
11.2
A
C++
Linked Structure Class
..................... 404
11.3
A
C++
Linked List
........................... 407
11.4 C++
Linked Dynamic Memory Errors
................. 421
11.5
Chapter Summary
............................ 422
11.6
Exercises
................................. 422
Chapter
12 C++
Templates
427
12.1
Introduction
................................ 427
12.2
Template Functions
........................... 429
12.3
Template Classes
............................. 431
12.3.1
The Standard Template Library vector Class
......... 431
12.3.2
User-defined Template Classes
................. 435
12.4
Chapter Summary
............................ 440
12.5
Exercises
................................. 440
Chapter
13
Heaps, Balanced Trees, and Hash Tables
443
13.1
Introduction
................................ 443
13.2
Priority Queues and Heaps
.................„..... 444
13.2.1
Heapsort
............................. 451
13.2.2
Notes on Heap and Priority Queue Implementations
..... 452
13.3
Balanced Trees
.............................. 453
13.4
Other Tree Structures
.......................... 465
13.5
Hash Tables
................................ 465
13.6
Chapter Summary
............................ 478
13.7
Exercises
................................. 478
Chapter
14
Graphs
485
14.1
Introduction
................................ 485
14.2
Graph Data Structures
.......................... 487
14.3
Shortest Path Algorithms
........................ 491
14.3.1
The Unweighted Shortest Path
................. 492
14.3.2
The Weighted Shortest Path
.................. 496
14.4
Depth First Algorithms
......................... 501
14.5
Minimum Spanning Trees
........................ 507
14.5.1
Kruskaľs
Algorithm
....................... 50?
14.5.2
The Disjoint Set Data Structure
................ 509
14.5.3
Prim s Algorithm
......................... 511
Contents ix
14.6
Chapter Summary
............................ 512
14.7
Exercises
................................. 513
Chapter
15
Algorithm Techniques
517
15.1
Introduction
................................ 517
15.2
Divide and Conquer
........................... 518
15.2.1
Analyzing Recursive Functions
................. 518
15.2.2
Quicksort
............................ . 521
15.3
Greedy Algorithms
............................ 527
15.4
Dynamic Programming
......................... 536
15.4.1
Longest Common Subsequence
................. 537
15.4.2
Memoization
........................... 541
15.4.3
Matrix Chain Multiplication
.................. 541
15.5
NP-Complete Problems
.,..,....,,,........,.... 543
] 5.6
Chapter Summary
............................ 545
15.7
Exercises
.........,......,...,....,.,.,...
Appendix Glossary S49
THIS BOOK is intended for use in a traditional college-
level data structures course (commonly known as
CS2). This book assumes that students have learned
the basic syntax of Python and been exposed to the
use of existing classes. Most traditional CS1 courses
that use Python will have covered all the necessary
topics, and some may have covered a few of the
topics covered in this book. We have found that most
students successfully completing a CSi course know
how to use classes, but many of them need more
experience to learn how to design and write their own
classes. We address this issue by including a number of
examples of class design in the first few chapters of
this book.
Python s object-oriented features make it an
elegant language for starting a data structures course,
but one potential drawback of Python for a data
structures course is that it hides the complexity of
memory management. This is a benefit in a first
course, but we think that in a second course it is
important that students begin to understand some of
these low-level details that the Python interpreter
hides from them. Since we can cover the basic data
structures in less time using Python, there is time to
learn a second language, even in a single-semester CS2
course. After the students have continued to improve
their Python programming skills while covering the
first few chapters of the book, it is relatively easy for
them to learn a second object-oriented language. By
using C-H+ as the second language, the students are
exposed to a lower-level, compiled language. The
syntax of
C+-Í-
is more complicated than Python, but
that is a relatively small hurdle once students have
mastered fundamental programming concepts using
Python. For example, now that they understand the
basic concepts of programming and the semantics of
statements such as
condiţionai
statements and
looping statements, they can focus on learning the
C+-+- syntax for these statements.
|
| any_adam_object | 1 |
| author | Reed, David M. Zelle, John M. |
| author_facet | Reed, David M. Zelle, John M. |
| author_role | aut aut |
| author_sort | Reed, David M. |
| author_variant | d m r dm dmr j m z jm jmz |
| building | Verbundindex |
| bvnumber | BV042219977 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.73.P98 |
| callnumber-search | QA76.73.P98 |
| callnumber-sort | QA 276.73 P98 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 230 |
| ctrlnum | (OCoLC)837035223 (DE-599)BVBBV042219977 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02514nam a2200529zc 4500</leader><controlfield tag="001">BV042219977</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150428 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">141202s2009 xxu |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2008053540</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781590282335</subfield><subfield code="c">alk. paper</subfield><subfield code="9">978-1-590-28233-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1590282337</subfield><subfield code="c">alk. paper</subfield><subfield code="9">1-590-28233-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)837035223</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042219977</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.73.P98</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Reed, David M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Data structures and algorithms using Python and C++</subfield><subfield code="c">David M. Reed, John Zelle</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Wilsonville, Or.</subfield><subfield code="b">Franklin, Beedle & Associates</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xiii, 568 p.</subfield><subfield code="c">24 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes index. -- "Builds on knowledge from a first course in computer programming using Python. Makes a transition from programming in Python to a data structures course and programming in C++"--Provided by publisher.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Python (Computer program language)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">C++ (Computer program language)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Python</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4434275-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">C</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4113195-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Python</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4434275-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">C</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4113195-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zelle, John M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027658500&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027658500&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Klappentext</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027658500</subfield></datafield></record></collection> |
| id | DE-604.BV042219977 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:15:37Z |
| institution | BVB |
| isbn | 9781590282335 1590282337 |
| language | English |
| lccn | 2008053540 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027658500 |
| oclc_num | 837035223 |
| open_access_boolean | |
| owner | DE-739 |
| owner_facet | DE-739 |
| physical | xiii, 568 p. 24 cm |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Franklin, Beedle & Associates |
| record_format | marc |
| spelling | Reed, David M. Verfasser aut Data structures and algorithms using Python and C++ David M. Reed, John Zelle Wilsonville, Or. Franklin, Beedle & Associates 2009 xiii, 568 p. 24 cm txt rdacontent n rdamedia nc rdacarrier Includes index. -- "Builds on knowledge from a first course in computer programming using Python. Makes a transition from programming in Python to a data structures course and programming in C++"--Provided by publisher. Python (Computer program language) C++ (Computer program language) Data structures (Computer science) Computer algorithms Datenstruktur (DE-588)4011146-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Python Programmiersprache (DE-588)4434275-5 gnd rswk-swf C Programmiersprache (DE-588)4113195-2 gnd rswk-swf Datenstruktur (DE-588)4011146-5 s Algorithmus (DE-588)4001183-5 s Python Programmiersprache (DE-588)4434275-5 s C Programmiersprache (DE-588)4113195-2 s DE-604 Zelle, John M. Verfasser aut Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027658500&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027658500&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA Klappentext |
| spellingShingle | Reed, David M. Zelle, John M. Data structures and algorithms using Python and C++ Python (Computer program language) C++ (Computer program language) Data structures (Computer science) Computer algorithms Datenstruktur (DE-588)4011146-5 gnd Algorithmus (DE-588)4001183-5 gnd Python Programmiersprache (DE-588)4434275-5 gnd C Programmiersprache (DE-588)4113195-2 gnd |
| subject_GND | (DE-588)4011146-5 (DE-588)4001183-5 (DE-588)4434275-5 (DE-588)4113195-2 |
| title | Data structures and algorithms using Python and C++ |
| title_auth | Data structures and algorithms using Python and C++ |
| title_exact_search | Data structures and algorithms using Python and C++ |
| title_full | Data structures and algorithms using Python and C++ David M. Reed, John Zelle |
| title_fullStr | Data structures and algorithms using Python and C++ David M. Reed, John Zelle |
| title_full_unstemmed | Data structures and algorithms using Python and C++ David M. Reed, John Zelle |
| title_short | Data structures and algorithms using Python and C++ |
| title_sort | data structures and algorithms using python and c |
| topic | Python (Computer program language) C++ (Computer program language) Data structures (Computer science) Computer algorithms Datenstruktur (DE-588)4011146-5 gnd Algorithmus (DE-588)4001183-5 gnd Python Programmiersprache (DE-588)4434275-5 gnd C Programmiersprache (DE-588)4113195-2 gnd |
| topic_facet | Python (Computer program language) C++ (Computer program language) Data structures (Computer science) Computer algorithms Datenstruktur Algorithmus Python Programmiersprache C Programmiersprache |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027658500&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027658500&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT reeddavidm datastructuresandalgorithmsusingpythonandc AT zellejohnm datastructuresandalgorithmsusingpythonandc |