Data Structures:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
De Gruyter
2018
|
| Schriftenreihe: | De Gruyter Textbook
Information and Computer Engineering |
| Schlagworte: | |
| Online-Zugang: | http://www.degruyter.com/search?f_0=isbnissn&q_0=9783110595574&searchTitles=true https://www.degruyter.com/doc/cover/9783110595574.jpg Inhaltsverzeichnis |
| Beschreibung: | X, 370 Seiten 200 Illustrationen 24 cm x 17 cm |
| ISBN: | 9783110595574 3110595575 |
Internformat
MARC
| LEADER | 00000nam a22000008c 4500 | ||
|---|---|---|---|
| 001 | BV044918584 | ||
| 003 | DE-604 | ||
| 005 | 20181029 | ||
| 007 | t | ||
| 008 | 180424s2018 gw a||| |||| 00||| eng d | ||
| 015 | |a 18,N08 |2 dnb | ||
| 016 | 7 | |a 1152828762 |2 DE-101 | |
| 020 | |a 9783110595574 |c : EUR 64.95 (DE) (freier Preis), EUR 64.95 (DE) (freier Preis), EUR 64.95 (AT) (freier Preis), EUR 64.95 (AT) (freier Preis) |9 978-3-11-059557-4 | ||
| 020 | |a 3110595575 |9 3-11-059557-5 | ||
| 024 | 3 | |a 9783110595574 | |
| 035 | |a (DE-599)DNB1152828762 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 084 | |a ST 265 |0 (DE-625)143634: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 084 | |a DAT 455f |2 stub | ||
| 100 | 1 | |a Zhou, Xingni |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Data Structures |c Xingni Zhou |
| 263 | |a 201809 | ||
| 264 | 1 | |a Berlin |b De Gruyter |c 2018 | |
| 300 | |a X, 370 Seiten |b 200 Illustrationen |c 24 cm x 17 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a De Gruyter Textbook | |
| 490 | 0 | |a Information and Computer Engineering | |
| 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 |
| 653 | |a Fachhochschul-/Hochschulausbildung | ||
| 653 | |a Fachhochschul-/Hochschulausbildung | ||
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Datenstruktur |0 (DE-588)4011146-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 710 | 2 | |a Walter de Gruyter GmbH & Co. KG |0 (DE-588)10095502-2 |4 pbl | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 9783110595581 |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 9783110593181 |
| 856 | 4 | 2 | |m X:MVB |u http://www.degruyter.com/search?f_0=isbnissn&q_0=9783110595574&searchTitles=true |
| 856 | 4 | 2 | |m X:MVB |u https://www.degruyter.com/doc/cover/9783110595574.jpg |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030311944&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030311944 | ||
Datensatz im Suchindex
| _version_ | 1804178486065102848 |
|---|---|
| adam_text | CONTENTS
PREFACE
*
XI
1
INTRODUCTION
*
1
1.1
LET
*
S
BEGIN
WITH
PROGRAMMING
*
1
1.2
THE
DATA
TO
BE
PROCESSED
BY
THE
PROGRAM
*
7
1.3
THE
INTRODUCTION
OF
DATA
STRUCTURES
*
17
1.4
BASIC
CONCEPTS
OF
DATA
STRUCTURES
*
18
1.4.1
BASIC
TERMINOLOGIES
OF
DATA
STRUCTURES
*
18
1.4.1.1
DATA
*
18
1.4.1.2
DATA
ELEMENT
-----
18
1.4.1.3
DATA
ITEM
-----
18
1.4.1.4
DATA
STRUCTURE
-----
18
1.4.2
THE
THREE
KEY
ELEMENTS
OF
DATA
STRUCTURES
*
19
1.4.2.1
LOGICAL
STRUCTURE
-----
19
1.4.2.2
THE
STORAGE
STRUCTURE
OF
DATA
*
20
1.4.2.3
OPERATION
ON
DATA
*
23
1.5
HOW
TO
DESIGN
ALGORITHMS
------
24
1.5.1
THE
DEFINITION
OF
ALGORITHM
AND
REPRESENTATION
METHODS
*
24
1.5.1.1
ALGORITHM
-----24
1.5.1.2
FEATURES
OF
ALGORITHMS
*
24
1.5.1.3
REPRESENTATION
OF
ALGORITHM
*
25
1.5.1.4
KEY
ELEMENTS
TO
DESCRIBING
ALGORITHMS
*
25
1.5.2
THE
RELATION
BETWEEN
ALGORITHM
DESIGN
AND
FUNCTION
DESIGN
*
25
1.5.2.1
CONCEPTS
RELATED
TO
FUNCTION
*
25
1.5.2.2
THE
RELATION
BETWEEN
ALGORITHM
DESIGN
AND
FUNCTION
DESIGN
*
26
1.5.3
SOFTWARE
DESIGN
METHOD
*
27
1.5.3.1
TEST
CASE
DESIGN
*
27
1.5.3.2
DESCRIPTION
OF
DATA
STRUCTURE
*
27
1.5.3.3
FUNCTION
INTERFACE
AND
FUNCTION
STRUCTURE
DESIGN
*
27
1.5.3.4
PSEUDOCODE
DESCRIPTION
OF
THE
ALGORITHM
*
27
1.5.3.5
PROGRAM
IMPLEMENTATION
*
28
1.5.3.6
ALGORITHM
EFFICIENCY
ANALYSIS
*
28
1.5.4
GENERAL
STEPS
OF
ALGORITHM
DESIGN
*
28
1.6
HOW
TO
EVALUATE
ALGORITHMS
*
31
1.6.1
THE
DESIGN
REQUIREMENTS
OF
ALGORITHMS
*
31
1.6.1.1
CORRECTNESS
*
31
1.6.1.2
READABILITY
*
31
1.6.1.3
ROBUSTNESS
-----
32
1.6.1.4
EFFICIENCY
-----
32
1.6.2
MEASUREMENT
METHODS
OF
ALGORITHM
EFFICIENCY
*
32
VI
CONTENTS
1.6.2.1
THE
AFTER-EXECUTION
ANALYSIS
OF
ALGORITHM
PERFORMANCE
*
32
1.6.2.2
THE
PRE-EXECUTION
ANALYSIS
OF
ALGORITHM
EFFICIENCY
*
34
1.7
THE
PRE-EXECUTION
ANALYSIS
METHODS
OF
ALGORITHM
EFFICIENCY
*
34
1.7.1
THE
SIZE
OF
THE
PROBLEM
AND
THE
STRATEGY
OF
THE
ALGORITHM
*
35
1.7.2
THE
UPPER
AND
LOWER
BOUNDS
OF
ALGORITHM
EFFICIENCY
*
37
1.7.2.1
BEST
CASE
*
37
1.7.2.2
WORST
CASE
*
37
1.7.2.3
AVERAGE
CASE
*
37
1.7.3
THE
ASYMPTOTIC
UPPER
BOUND
-
THE
TIME
COMPLEXITY
OF
THE
ALGORITHM
*
41
1.7.4
THE
COMPREHENSIVE
DISCUSSION
ON
THE
TIME
COMPLEXITY
OF
ALGORITHMS
*
43
1.7.4.1
THE
PRACTICAL
IMPLICATIONS
OF
THE
TIME
COMPLEXITY
OF
ALGORITHMS
*
43
1.7.4.2 FUNCTION
VALUES
WITH
SIGNIFICANT
MEANINGS
TO
ALGORITHM
ANALYSIS
*
45
1.7.4.3
COMPUTATION
RULES
FOR
TIME
COMPLEXITY
*
47
1.7.4.4
GENERAL
METHODS
FOR
ALGORITHM
EFFICIENCY
ANALYSIS
*
48
1.7.5
THE
ANALYSIS
METHODS
ON
THE
SPACE
EFFICIENCY
OF
THE
ALGORITHM
*
49
1.8
COMPREHENSIVE
EVALUATION
OF
ALGORITHM
PERFORMANCE
*
55
1.9
CHAPTER
SUMMARY
*
57
1.10
EXERCISES
*
58
1.10.1
MULTIPLE-CHOICE
QUESTIONS
*
58
1.10.2
PRACTICAL
PROBLEMS
*
59
2
THE
DATA
STRUCTURE
WHOSE
NODES
SHARE
A
LINEAR
LOGICAL
RELATION
-
LINEAR
LIST
*
61
2.1
VIEWING
THE
LINEAR
LIST
FROM
THE
PERSPECTIVE
OF
LOGICAL
STRUCTURE
*
61
2.1.1
THE
SEQUENTIAL
RELATIONS
THAT
EXIST
IN
PRACTICAL
PROBLEMS
*
61
2.1.1.1
THE
ONE-TO-ONE
CORRESPONDENCE
RELATION
THAT
EXISTS
IN
QUEUING
*
61
2.1.1.2
THE
REPRESENTATION
METHOD
OF
ALPHABETICAL
TABLE
*
61
2.1.1.3
THE
STRUCTURE
OF
PHONE
NUMBER
TABLES
*
62
2.1.2
THE
LOGICAL
STRUCTURE
OF
LINEAR
LISTS
*
63
2.1.2.1
THE
DEFINITION
OF
LINEAR
LIST
*
63
2.1.2.2
THE
LOGICAL
FEATURES
OF
THE
LINEAR
LIST
*
63
2.1.2.3
MAJOR
OPERATIONS
ON
THE
LINEAR
LIST
*
63
2.2
ONE
OF
THE
STORAGE
STRUCTURES
OF
LINEAR
LISTS
-
SEQUENTIAL
LIST
*
64
2.2.1
THE
DESIGN
OF
STORAGE
STRUCTURE
OF
A
SEQUENTIAL
LIST
*
64
2.2.1.1
THE
DEFINITION
OF
SEQUENTIAL
LIST
*
64
CONTENTS
*
VII
2.2.1.2
THE
STORAGE
CHARACTERISTICS
OF
SEQUENTIAL
LIST
*
65
2.2.1.3
THE
DESIGN
OF
THE
SEQUENTIAL
LIST
STORAGE
STRUCTURE
*
65
2.2.1.4
THINK
AND
DISCUSS
ON
THE
APPLICATION
OF
*
STRUCT
*
-----
67
2.2.2
THE
OPERATIONS
ON
SEQUENTIAL
LIST
*
69
2.2.2.1
THE
INSERTION
OPERATION
OF
ORDERED
LIST
*
69
2.2.2.2
DELETION
OPERATION
ON
SEQUENTIAL
LIST
*
73
2.2.23
LOOKUP
OPERATION
OF
ELEMENTS
IN
SEQUENTIAL
LIST
*
77
2.2.2.4
ACCESSING
DATA
ELEMENT
FROM
SEQUENTIAL
LIST
*
78
2.2.3
DISCUSSION
ON
THE
SEQUENTIAL
STORAGE
STRUCTURE
*
79
2.3
THE
SECOND
STORAGE
METHOD
FOR
LINEAR
LIST
-
LINKED
LIST
*
80
2.3.1
INTRODUCTION
1
-
THE
STORY
OF
WORD
*
80
2.3.2
INTRODUCTION
2
-
LINKED
LISTS
IN
MOBILE
PHONES
*
82
2.3.3
THE
STORAGE
OF
SINGLY
LINKED
LISTS
-----
84
2.3.3.1
THE
STRUCTURAL
DESIGN
OF
NODES
OF
LINKED
LISTS
*
84
2.3.3
2
HOW
ARE
THE
NODES
IN
THE
LINKED
LIST
LINKED
TOGETHER
IN
THE
STORAGE
SPACE?
*
84
2.3.4
OPERATIONS
ON
THE
SINGLY
LINKED
LIST
*
90
2.3.4.1
INITIALIZATION
OF
SINGLY
LINKED
LISTS
*
91
2.3
4.2
CONSTRUCTION
OF
SINGLY
LINKED
LISTS
------
94
2.3.4.3
LOOKUP
OPERATION
ON
SINGLY
LINKED
LIST
------
101
23.4.4
THE
INSERTION
OPERATION
ON
SINGLY
LINKED
LISTS
*
106
23.4.5
DELETION
OPERATION
ON
SINGLY
LINKED
LISTS
*
111
2.3.5
DISCUSSION
OF
SINGLY
LINKED
LISTS
*
115
2.3.6
CIRCULAR
LINKED
LISTS
*
115
23.6.1
STRUCTURAL
DESIGN
OF
CIRCULAR
LINKED
LISTS
*
115
23.6.2
OPERATIONS
ON
CIRCULAR
LINKED
LISTS
*
116
2.3.7
DOUBLY
LINKED
LIST
*
119
23.7.1
STRUCTURAL
DESIGN
OF
DOUBLY
LINKED
LISTS
*
119
23.7.2
OPERATIONS
ON
DOUBLY
LINKED
LISTS
*
121
2.3.8
SUMMARY
ON
LINKED
LISTS
*
121
2.4
EXAMPLES
OF
THE
APPLICATION
OF
LINEAR
LISTS
*
122
2.4.1
ALGORITHM
DESIGN
-----
122
2.4.2
PROGRAM
IMPLEMENTATION
*
122
2.5
COMPARISONS
BETWEEN
SEQUENTIAL
LIST
AND
LINKED
LIST
*
123
2.5.1
CONSIDERATIONS
BASED
ON
STORAGE
*
124
2.5.2
CONSIDERATIONS
BASED
ON
OPERATIONS
*
125
2.5.3
CONSIDERATIONS
BASED
ON
THE
ENVIRONMENT
*
125
2.6
SUMMARY
OF
THE
CHAPTER
*
125
2.7
EXERCISES
*
126
2.7.1
MULTIPLE-CHOICE
QUESTIONS
-----
126
2.7.2
ALGORITHM
DESIGN
EXERCISES
*
129
VIII
*
CONTENTS
3
LINEAR
LIST
WITH
RESTRICTED
OPERATIONS
-
STACK
AND
QUEUE
*
133
3.1
STACK
-
A
LINEAR
LIST
MANAGED
IN
A
FIRST-IN-LAST-OUT
MANNER
*
133
3.1.1
INTRODUCTION
TO
THE
OPERATION
PATTERN
OF
STACK
*
133
3.1.1.1
INTRODUCTION
TO
STACK
1
-
ERRONEOUS
OPERATION
IN
WORD
*
133
3.1.1.2
INTRODUCTION
TO
STACK
EXAMPLE
2
-
BRACKET
MATCHING
*
134
3.1.1.3
INTRODUCTION
TO
STACK
EXAMPLE
3
-
THE
RECURSIVE
INVOCATION
OF
FUNCTIONS
*
135
3.1.1.4
INTRODUCTION
TO
STACK
EXAMPLE
4
-
THE
EMBEDDED
INVOCATION
OF
FUNCTIONS
*
136
3.1.2
THE
LOGIC
STRUCTURE
OF
STACK
*
138
3.1.2.1
THE
DEFINITION
OF
STACK
*
138
3.1.2.2
THE
DIFFERENCES
AND
CONNECTIONS
BETWEEN
STACK
AND
LINEAR
LIST
*
140
3.1.2.3
OPERATIONS
ON
STACK
*
140
3.1.3
THE
DESIGN
OF
THE
STORAGE
STRUCTURE
OF
STACKS
*
140
3.1.3.1
SEQUENTIAL
STACK
-
USE
A
PIECE
OF
CONTINUOUS
SPACE
TO
STORE
STACK
ELEMENTS
*
140
3.1.3.2
LINKED
STACK
-
STORING
STACK
ELEMENTS
IN
NONCONTINUOUS
SPACE
*
141
3.1.4
OPERATIONS
ON
STACK
*
142
3.1.4.1
BASIC
OPERATIONS
ON
SEQUENTIAL
STACK
*
142
3.1.4.2
BASIC
OPERATIONS
ON
LINKED
STACK
*
157
3.1.5
COMPARISON
OF
VARIOUS
STACK
STRUCTURES
*
164
3.1.6
EXAMPLES
OF
THE
APPLICATION
OF
STACK
*
164
3.1.6.1
BASE
CONVERSION
*
164
3.1.6.2
IMPLEMENT
RECURSIVE
FUNCTIONS
WITH
STACK
*
166
3.1.6.3
EVALUATING
EXPRESSIONS
*
171
3.1.7
RECURSION
-
A
*
FIRST-IN-LAST-OUT
*
PROCESS
*
172
3.1.7.1
THE
CONCEPT
OF
RECURSION
AND
ITS
KEY
ELEMENTS
*
172
3.1.7.2
ANALYSIS
OF
FEATURES
OF
RECURSION
*
174
3.1.7.3
SUMMARY
OF
RECURSION
*
176
3.2
QUEUE
-
LINEAR
LIST
MANAGED
IN
A
*
FIFO
*
MANNER
*
177
3.2.1
INTRODUCTION
TO
THE
QUEUE
PROCESSING
MODEL
*
177
3.2.1.1
INTRODUCTORY
EXAMPLE
TO
QUEUE
1
-
ASYNCHRONOUS
PROCESSING
OF
DATA
IN
COMPUTER
*
177
3.2.1.1.1
BUFFERED
QUEUES
IN
E-COMMERCE
SYSTEMS
*
177
3.2.1.1.2
MAIL
QUEUES
IN
MAIL
SERVERS
*
178
3.2.1.2
INTRODUCTORY
EXAMPLE
TO
QUEUE
2
-
SOLUTION
TO
PASCAL
*
S
TRIANGLE
USING
QUEUE
*
179
3.2.2
THE
LOGICAL
STRUCTURE
OF
QUEUE
*
181
3.2.3
THE
SEQUENTIAL
STORAGE
STRUCTURE
OF
QUEUE
*
182
3.2.3.1
SEQUENTIAL
QUEUE
*
182
CONTENTS
IX
3.2.4
BASIC
OPERATIONS
ON
SEQUENTIAL
QUEUE
*
192
3.2.4.1
BASIC
OPERATION
ON
SEQUENTIAL
QUEUE
-
SET
QUEUE
AS
EMPTY
*
192
3.2.4.2
BASIC
OPERATION
ON
SEQUENTIAL
QUEUE
-
CHECK
EMPTINESS
OF
QUEUE
*
193
3.2.4.3
BASIC
OPERATION
ON
SEQUENTIAL
QUEUE
-
GET
THE
HEAD
ELEMENT
*
194
3.2.4.4
BASIC
OPERATION
ON
SEQUENTIAL
QUEUE
-
INSERT
ELEMENT
*
195
3.2.4.5
BASIC
OPERATION
ON
SEQUENTIAL
QUEUE
-
DELETE
ELEMENT
*
196
3.2.5
LINKED
STORAGE
STRUCTURE
OF
QUEUE
*
197
3.2.6
BASIC
OPERATIONS
ON
LINKED
QUEUE
*
199
3.2.6.1
BASIC
OPERATIONS
ON
LINKED
QUEUE
-
INITIALIZE
AND
SET
THE
QUEUE
AS
EMPTY
*
199
3.2.6.2
BASIC
OPERATION
ON
LINKED
QUEUE
-
CHECKING
EMPTINESS
OF
QUEUE
-----
200
3.2.6.3
BASIC
OPERATION
ON
LINKED
QUEUE
-
RETRIEVE
THE
HEAD
NODE
*
201
3.2.6.4
BASIC
OPERATION
ON
LINKED
QUEUE
-
ENQUEUING
------
202
3.2.6.5
BASIC
OPERATION
ON
LINKED
QUEUE
-
DEQUEUING
*
204
3.2.6.6
DESTROYING
THE
LINKED
QUEUE
------
206
3.2.7
COMPARISON
OF
DIFFERENT
QUEUE
STRUCTURES
*
208
3.2.8
EXAMPLES
OF
THE
APPLICATION
OF
QUEUE
-----
209
3.2.8.1
APPLICATION
OF
QUEUE
1
-
RADIX
SORT
------
209
3.2.8.2
APPLICATION
OF
QUEUE
2
-
CARD
GAME
----
213
3.3
CHAPTER
SUMMARY
----
215
3.4
EXERCISES
-----
217
3.4.1
MULTIPLE
CHOICE
QUESTIONS
*
217
3.4.2
PRACTICAL
QUESTIONS
-----
219
3.4.3
ALGORITHM
DESIGN
-----
219
4
SEQUENTIAL
LIST
WITH
SPECIAL
CONTENTS
-
MULTIDIMENSIONAL
ARRAYS
AND
STRINGS
------
221
4.1
MULTIDIMENSIONAL
ARRAYS
*
221
4.1.1
THE
CONCEPT
OF
ARRAYS
*
222
4.1.2
THE
STORAGE
STRUCTURE
OF
ARRAYS
-----
223
4.2
THE
COMPRESSIONS
STORAGE
OF
MATRICES
-----
226
4.2.1
THE
COMPRESSIONS
STORAGE
OF
SYMMETRIC
MATRIX
----
228
4.2.2
THE
COMPRESSIONS
STORAGE
OF
TRIANGULAR
MATRIX
-----
230
4.2.3
THE
COMPRESSIONS
STORAGE
OF
DIAGONAL
MATRIX
-----
231
4.2.4
COMPRESSIONS
STORAGE
OF
SPARSE
MATRIX
*
232
4.2.4.1
DEFINITION
OF
SPARSE
MATRIX
-----
232
4.2.4.2
THE
COMPRESSIONS
STORAGE
OF
SPARSE
MATRIX
*
235
4.2.4.2.1
TRIPLE
LIST
-----
236
4.2.4.2.2
THE
LINKED
LIST
STORAGE
METHOD
OF
SPARSE
MATRIX
-----
236
4.3
STRING
-----
238
X
CONTENTS
4.3.1
THE
DEFINITION
OF
STRING
------
240
4.3.1.1
SUBSTRING
-----
240
4.3.1.2
THE
POSITION
OF
THE
SUBSTRING
-----
241
4.3.1.3 EQUIVALENCE
OF
STRING
------
241
4.3.2
THE
STORAGE
STRUCTURE
OF
STRING
*
241
4.3.2.1
THE
SEQUENTIAL
STORAGE
OF
STRING
*
241
4.3.2.2
THE
BLOCK
LINK
STORAGE
STRUCTURE
OF
STRING
*
243
4.3.2.3
THE
INDEXED
STORAGE
METHOD
OF
STRING
*
245
4.3.3
SEARCH
ON
STRINGS
-
PATTERN
MATCHING
*
248
4.3.3.1
BF
ALGORITHM
-----
249
4.3.3.2
KMP
ALGORITHM
------
258
4.4
CHAPTER
SUMMARY
*
268
4.5
EXERCISES
-----
271
4.5.1
MULTIPLE-CHOICE
QUESTIONS
*
271
4.5.2
APPLIED
PROBLEMS
-----
273
4.5.3
ALGORITHM
DESIGN
-----
273
APPENDIX
A
RELATION
GRAPH
OF
DATA
*
275
APPENDIX
B
HOW
TO
ADD
CUSTOM
HEADER
FILES
*
277
APPENDIX
C
FORMAT
OF
SOFTWARE
DESIGN
MANUAL
*
279
APPENDIX
D
ANSWERS
TO
SELECTED
EXERCISES
*
283
REFERENCES
*
285
INDEX
*
287
|
| any_adam_object | 1 |
| author | Zhou, Xingni |
| author_facet | Zhou, Xingni |
| author_role | aut |
| author_sort | Zhou, Xingni |
| author_variant | x z xz |
| building | Verbundindex |
| bvnumber | BV044918584 |
| classification_rvk | ST 265 |
| classification_tum | DAT 455f |
| ctrlnum | (DE-599)DNB1152828762 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02133nam a22005178c 4500</leader><controlfield tag="001">BV044918584</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20181029 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">180424s2018 gw a||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">18,N08</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1152828762</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783110595574</subfield><subfield code="c">: EUR 64.95 (DE) (freier Preis), EUR 64.95 (DE) (freier Preis), EUR 64.95 (AT) (freier Preis), EUR 64.95 (AT) (freier Preis)</subfield><subfield code="9">978-3-11-059557-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3110595575</subfield><subfield code="9">3-11-059557-5</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783110595574</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1152828762</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 265</subfield><subfield code="0">(DE-625)143634:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 455f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhou, Xingni</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Data Structures</subfield><subfield code="c">Xingni Zhou</subfield></datafield><datafield tag="263" ind1=" " ind2=" "><subfield code="a">201809</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">De Gruyter</subfield><subfield code="c">2018</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 370 Seiten</subfield><subfield code="b">200 Illustrationen</subfield><subfield code="c">24 cm x 17 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="490" ind1="0" ind2=" "><subfield code="a">De Gruyter Textbook</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Information and Computer Engineering</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="653" ind1=" " ind2=" "><subfield code="a">Fachhochschul-/Hochschulausbildung</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Fachhochschul-/Hochschulausbildung</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><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="1"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Walter de Gruyter GmbH & Co. KG</subfield><subfield code="0">(DE-588)10095502-2</subfield><subfield code="4">pbl</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">9783110595581</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">9783110593181</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="u">http://www.degruyter.com/search?f_0=isbnissn&q_0=9783110595574&searchTitles=true</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="u">https://www.degruyter.com/doc/cover/9783110595574.jpg</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</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=030311944&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030311944</subfield></datafield></record></collection> |
| id | DE-604.BV044918584 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T08:04:44Z |
| institution | BVB |
| institution_GND | (DE-588)10095502-2 |
| isbn | 9783110595574 3110595575 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030311944 |
| open_access_boolean | |
| physical | X, 370 Seiten 200 Illustrationen 24 cm x 17 cm |
| publishDate | 2018 |
| publishDateSearch | 2018 |
| publishDateSort | 2018 |
| publisher | De Gruyter |
| record_format | marc |
| series2 | De Gruyter Textbook Information and Computer Engineering |
| spelling | Zhou, Xingni Verfasser aut Data Structures Xingni Zhou 201809 Berlin De Gruyter 2018 X, 370 Seiten 200 Illustrationen 24 cm x 17 cm txt rdacontent n rdamedia nc rdacarrier De Gruyter Textbook Information and Computer Engineering Datenstruktur (DE-588)4011146-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Fachhochschul-/Hochschulausbildung Algorithmus (DE-588)4001183-5 s Datenstruktur (DE-588)4011146-5 s DE-604 Walter de Gruyter GmbH & Co. KG (DE-588)10095502-2 pbl Erscheint auch als Online-Ausgabe 9783110595581 Erscheint auch als Online-Ausgabe 9783110593181 X:MVB http://www.degruyter.com/search?f_0=isbnissn&q_0=9783110595574&searchTitles=true X:MVB https://www.degruyter.com/doc/cover/9783110595574.jpg DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030311944&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Zhou, Xingni Data Structures Datenstruktur (DE-588)4011146-5 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4011146-5 (DE-588)4001183-5 |
| title | Data Structures |
| title_auth | Data Structures |
| title_exact_search | Data Structures |
| title_full | Data Structures Xingni Zhou |
| title_fullStr | Data Structures Xingni Zhou |
| title_full_unstemmed | Data Structures Xingni Zhou |
| title_short | Data Structures |
| title_sort | data structures |
| topic | Datenstruktur (DE-588)4011146-5 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Datenstruktur Algorithmus |
| url | http://www.degruyter.com/search?f_0=isbnissn&q_0=9783110595574&searchTitles=true https://www.degruyter.com/doc/cover/9783110595574.jpg http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030311944&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT zhouxingni datastructures AT walterdegruytergmbhcokg datastructures |