Colleges data structures course textbook series: data structure tutorial (4) on experimental guidance(Chinese Edition)
Ein Angebot gefunden
Bester Preis: € 54,25 (vom 03.02.2021)Aus dem Archiv:
1
Colleges data structures course textbook series: data structure tutorial (4) on experimental guidance(Chinese Edition) (2013)
~EN PB NWISBN: 9787302250180 bzw. 7302250189, vermutlich in Englisch, 4. Ausgabe, Taschenbuch, neu.
Lieferung aus: China, Volksrepublik, Versandkosten nach: CHE.
Von Händler/Antiquariat, BookerStudy.
paperback. New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Paperback. Pub Date: 2013 Pages: 285 Language: Chinese in Publisher: Tsinghua University Press' Higher Education data structures course textbook series: data structure tutorial (4th edition) experiment on the computer guidance is data structure tutorial ( 4) supporting the experimental guide books. Chapter of the two books-one correspondence. including Introduction. linear tables. stacks and queues. strings. arrays with sparse matrices. recursion. tree structure. find. within sort external sort. file and comprehensive experiment of the resolution. Appendix after the book gives the basic knowledge needed to write a C program in VC + + 6.0 environment and the students submitted the lab report format. The book lists the full-on experimental subject. self-contained. separately from the main textbook. University data structures course textbook series: data structure tutorial (4) experiment on the computer guidance for the the universities computer and related professional undergraduate and graduate students to use. Contents: Chapter 1 Introduction 1.2 - the on machine experiments title parsing experiment title 1.1 seeking primes experiment questions seeking a positive integer you figures and experimental questions 1.3 seeking linear form of a string is palindrome Chapter 2 - the experiment questions parse experimental title-on experiments title 2.1 algorithm to achieve a variety of basic arithmetic sequence table experiment of the 2.2 the basic operation of the single linked list algorithm experiment questions the basic operation of the double-linked list algorithm 2.3 2.4 to achieve circular single linked list kinds of basic operations the algorithm experiments title 2.5 cycle doubly linked list of basic computing algorithm experiment of the 2.6 seeking collection (single linked list) and the experiment of the intersection. and difference operations 2.7 seeking the addition of two polynomial arithmetic first The basic operations of the basic operations of the order of the stack Chapter 3 stack and queue --on experiments title 3 parsing experiment of the 3.1 the algorithm experiments title 3.2 to achieve chain stack algorithm experiment of the 3.3 circular queue of basic computing algorithm experimental questions 3.4 chain team various basic operations the algorithm experiments title 3.5 to solve the maze problem all paths and shortest path program experiment of the 3.6 stack solving experiment of the queens problem 3.7 with a patient simulation program the experiments title 3.8 parking management procedures in Chapter 4 string basic operations - the on machine experiments title parse experimental title 4.1 the basic operation of the order of string of various the algorithm experimental questions 4.2 to achieve Strand various the algorithm experiments title 4.3 sequence string pattern matching operator experiment of the the 4.4 text string encryption and the decryption process experiment of the 4.5 seeking the analytical experiments title of the experiment of the longest repeated substring Chapter 5 the recursion - on machine first appeared in a string 5.1 solving n queens problem experiment questions 5.2 knapsack problem Chapter 6 arrays and generalized 5X5 order spiral square experiment of the experiment of the table - on the machine parsing experiment of the 6.1 seeking 6.2 seek a matrix experiment of the saddle point 6.3 the sum of two symmetric matrix and the product of experimental questions 6.4 sparse matrix (triples The basic operation said) the basic computing experiment of the 6.5 Chapter 7. the tree structure of the basic operations of the generalized table - on the machine experiments title parsing experiments title 7.1 of binary tree algorithm experimental Question 7.2 binary tree traversal algorithm the experiment of the 7.3 requirements binary tree leaf nodes of the path from the root to the experiment of the 7.4 by traversing the sequence constructed binary tree experiments title 7.5 inorder threaded binary tree experiment of the 7.6 construct Huffman tree experiment of the 7.7 first with a binary tree to represent algebraic expressions Chapter 8 Figure - computer experiment questions parsing experiment of the 8.1 to achieve the adjacency matrix and adjacency table storage experiment of the 8.2 graph traversal algorithm experimental questions 8.3 seeking all depth-first traversal sequence experimental questions 8.4 graph search method for solving the maze problem The experiment of the 8.5 Solving the simple path experiment of the 8.6 requirements undirected graph depth-first spanning tree and breadth priority spanning tree experiment of the 8.7 Primm algorithms to find the minimum spanning tree experiment of the 8.8 Kruskal algorithm for the minimum Spanning Tree experiment of the 8.9 the Connecticut Stratford algorithms to find a shortest path experiment to a weighted graph title 8.10 by Freud algorithm requirements of Chapter 9 search of the shortest path to a weighted graph - computer experiment title 9 10 parsing of the experiment of the sort - on the machine parse Chapter 10 Chapter 11 external sort - computer experiment title 11 parse Chapter 12 documents - computer experiment Title 12 parse parse comprehensive experiment Chapter 13 Appendix A Using VC + + 6.0 Appendix B experiment report format Satisfaction guaranteed,or money back.
Von Händler/Antiquariat, BookerStudy.
paperback. New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Paperback. Pub Date: 2013 Pages: 285 Language: Chinese in Publisher: Tsinghua University Press' Higher Education data structures course textbook series: data structure tutorial (4th edition) experiment on the computer guidance is data structure tutorial ( 4) supporting the experimental guide books. Chapter of the two books-one correspondence. including Introduction. linear tables. stacks and queues. strings. arrays with sparse matrices. recursion. tree structure. find. within sort external sort. file and comprehensive experiment of the resolution. Appendix after the book gives the basic knowledge needed to write a C program in VC + + 6.0 environment and the students submitted the lab report format. The book lists the full-on experimental subject. self-contained. separately from the main textbook. University data structures course textbook series: data structure tutorial (4) experiment on the computer guidance for the the universities computer and related professional undergraduate and graduate students to use. Contents: Chapter 1 Introduction 1.2 - the on machine experiments title parsing experiment title 1.1 seeking primes experiment questions seeking a positive integer you figures and experimental questions 1.3 seeking linear form of a string is palindrome Chapter 2 - the experiment questions parse experimental title-on experiments title 2.1 algorithm to achieve a variety of basic arithmetic sequence table experiment of the 2.2 the basic operation of the single linked list algorithm experiment questions the basic operation of the double-linked list algorithm 2.3 2.4 to achieve circular single linked list kinds of basic operations the algorithm experiments title 2.5 cycle doubly linked list of basic computing algorithm experiment of the 2.6 seeking collection (single linked list) and the experiment of the intersection. and difference operations 2.7 seeking the addition of two polynomial arithmetic first The basic operations of the basic operations of the order of the stack Chapter 3 stack and queue --on experiments title 3 parsing experiment of the 3.1 the algorithm experiments title 3.2 to achieve chain stack algorithm experiment of the 3.3 circular queue of basic computing algorithm experimental questions 3.4 chain team various basic operations the algorithm experiments title 3.5 to solve the maze problem all paths and shortest path program experiment of the 3.6 stack solving experiment of the queens problem 3.7 with a patient simulation program the experiments title 3.8 parking management procedures in Chapter 4 string basic operations - the on machine experiments title parse experimental title 4.1 the basic operation of the order of string of various the algorithm experimental questions 4.2 to achieve Strand various the algorithm experiments title 4.3 sequence string pattern matching operator experiment of the the 4.4 text string encryption and the decryption process experiment of the 4.5 seeking the analytical experiments title of the experiment of the longest repeated substring Chapter 5 the recursion - on machine first appeared in a string 5.1 solving n queens problem experiment questions 5.2 knapsack problem Chapter 6 arrays and generalized 5X5 order spiral square experiment of the experiment of the table - on the machine parsing experiment of the 6.1 seeking 6.2 seek a matrix experiment of the saddle point 6.3 the sum of two symmetric matrix and the product of experimental questions 6.4 sparse matrix (triples The basic operation said) the basic computing experiment of the 6.5 Chapter 7. the tree structure of the basic operations of the generalized table - on the machine experiments title parsing experiments title 7.1 of binary tree algorithm experimental Question 7.2 binary tree traversal algorithm the experiment of the 7.3 requirements binary tree leaf nodes of the path from the root to the experiment of the 7.4 by traversing the sequence constructed binary tree experiments title 7.5 inorder threaded binary tree experiment of the 7.6 construct Huffman tree experiment of the 7.7 first with a binary tree to represent algebraic expressions Chapter 8 Figure - computer experiment questions parsing experiment of the 8.1 to achieve the adjacency matrix and adjacency table storage experiment of the 8.2 graph traversal algorithm experimental questions 8.3 seeking all depth-first traversal sequence experimental questions 8.4 graph search method for solving the maze problem The experiment of the 8.5 Solving the simple path experiment of the 8.6 requirements undirected graph depth-first spanning tree and breadth priority spanning tree experiment of the 8.7 Primm algorithms to find the minimum spanning tree experiment of the 8.8 Kruskal algorithm for the minimum Spanning Tree experiment of the 8.9 the Connecticut Stratford algorithms to find a shortest path experiment to a weighted graph title 8.10 by Freud algorithm requirements of Chapter 9 search of the shortest path to a weighted graph - computer experiment title 9 10 parsing of the experiment of the sort - on the machine parse Chapter 10 Chapter 11 external sort - computer experiment title 11 parse Chapter 12 documents - computer experiment Title 12 parse parse comprehensive experiment Chapter 13 Appendix A Using VC + + 6.0 Appendix B experiment report format Satisfaction guaranteed,or money back.
Daten vom 03.02.2021 13:44h
ISBN (andere Schreibweisen): 7-302-25018-9, 978-7-302-25018-0
ISBN (andere Schreibweisen): 7-302-25018-9, 978-7-302-25018-0
Zuerst gefunden: 03.02.2021 13:44:31
Zuletzt gefunden: 03.02.2021 13:44:31
Kleinster Preis: € 54,25 (vom 03.02.2021 13:44:31)
Höchster Preis: € 54,25 (vom 03.02.2021 13:44:31)
Fundstellen insgesamt: 1
Zuletzt gefunden: 03.02.2021 13:44:31
Kleinster Preis: € 54,25 (vom 03.02.2021 13:44:31)
Höchster Preis: € 54,25 (vom 03.02.2021 13:44:31)
Fundstellen insgesamt: 1
Momentan keine Suchergebnisse - vielleicht bald lieferbar
Ihre Suche nach ist bei mehr als 100 angebundenen Webshops momentan nicht lieferbar. Wir finden dieses Buch aber trotzdem innerhalb weniger Wochen.
Sie Suchen nach diesem Buch:
LI CHUN BAO: Colleges data structures course textbook series: data structure tutorial (4) on experimental guidance(Chinese Edition)
ISBN: 9787302250180
Speichern Sie diese Suche kostenlos in ab, dann werden Sie automatisch benachrichtigt, sobald dieses Buch verfügbar ist. Meistens finden wir dieses Buch innerhalb weniger Wochen und verständigen Sie dann per E-Mail. Sie können dann frei entscheiden, ob Sie das Buch kaufen wollen oder nicht.
Unsere Suchtipps für Ihre Suche:
- Alle Bücher des Autors.: Suche nach "Autor: chun" liefert mehr Ergebnisse
- Suchen nach Suchbegriffen wie Autor oder Titel des Buches sind erfolgreicher als solche nach der ISBN.: Suche nach "experimental structures structure chun" liefert mehr Ergebnisse
Sie haben jetzt folgende Möglichkeiten:
- Speichern Sie diese Seite in Ihren Lesezeichen oder Favoriten ab, dann können Sie jederzeit die Suche erneut ausführen.
- Das Buch ist tatsächlich derzeit vergriffen bzw. nicht lieferbar. Es ist z.B. eine Rarität. Möglicherweise ist es aber in einiger Zeit lieferbar. Speichern Sie dazu diese Suche kostenlos ab oder lassen Sie sich kostenlos auf dieses Gerät benachrichten und Sie werden automatisch per E-Mail oder Nachricht informiert, sobald dieses Buch wieder lieferbar wird. Wir sind zuversichtlich, dass wir jedes Buch auf diese Weise innerhalb relativ kurzer Zeit finden. Probieren Sie es einfach aus!
Mich bei neuen Ergebnissen benachrichtigenSuche jetzt kostenlos SpeichernIn 50 Millionen auch bereits vergriffenen Büchern recherchieren!
Anmeldung mit Google:
ODER
Anmeldung mit Facebook:
Lade…