|
|
|
|
LEADER |
00000cam a2200000 a 4500 |
001 |
KNOVEL_ocn894784921 |
003 |
OCoLC |
005 |
20231027140348.0 |
006 |
m o d |
007 |
cr bn||||||abp |
007 |
cr bn||||||ada |
008 |
141107s1994 nyua ob 001 0 eng d |
040 |
|
|
|a OCLCE
|b eng
|e pn
|c OCLCE
|d KNOVL
|d OCLCQ
|d UX1
|d INARC
|d OCLCQ
|d OCLCO
|d OCL
|d OCLCQ
|d OCLCO
|
019 |
|
|
|a 1096986745
|a 1151934182
|a 1357277024
|
020 |
|
|
|a 9781680152722
|q (electronic bk.)
|
020 |
|
|
|a 1680152726
|q (electronic bk.)
|
020 |
|
|
|z 0195114434
|
020 |
|
|
|z 9780195114430
|
020 |
|
|
|z 0195174801
|
020 |
|
|
|z 9780195174809
|
029 |
1 |
|
|a GBVCP
|b 830199578
|
035 |
|
|
|a (OCoLC)894784921
|z (OCoLC)1096986745
|z (OCoLC)1151934182
|z (OCoLC)1357277024
|
042 |
|
|
|a dlr
|
050 |
|
4 |
|a QA76.73.C15
|b B68 1994b
|
082 |
0 |
4 |
|a 005.13/3
|2 20
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a Bowman, Charles F.
|
245 |
1 |
0 |
|a Algorithms and data structures :
|b an approach in C /
|c Charles F. Bowman.
|
260 |
|
|
|a New York ;
|a Oxford :
|b Oxford University Press,
|c ©1994.
|
300 |
|
|
|a 1 online resource (xii, 333 pages) :
|b illustrations
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
504 |
|
|
|a Includes bibliographical references (pages 317-327) and index.
|
505 |
1 |
|
|a 1. Introduction --- 2. Algorithm Design --- 3. Static Data Structures --- 4. Recursion --- 5. Dynamic Data Structures --- 6. Trees --- 7. Graphs and Digraphs --- 8. Searching --- 9. Sorting Techniques ---- Appendix A. Acrostic Puzzle --- Appendix B.C for Programmers.
|
520 |
|
|
|a With numerous practical, real-world algorithms presented in the C programming language, Bowman's Algorithms and Data Structures: An Approach in C is the algorithms text for courses that take a modern approach. For the one- or two-semester undergraduate course in data structures, it instructs students on the science of developing and analyzing algorithms. Bowman focuses on both the theoretical and practical aspects of algorithm development. He discusses problem-solving techniques and introduces the concepts of data abstraction and algorithm efficiency. More importantly, the text does not present algorithms in a "shopping-list" format. Rather it provides actual insight into the design process itself
|
588 |
0 |
|
|a Print version record.
|
506 |
|
|
|3 Use copy
|f Restrictions unspecified
|2 star
|5 MiAaHDL
|
533 |
|
|
|a Electronic reproduction.
|b [Place of publication not identified] :
|c HathiTrust Digital Library,
|d 2014.
|5 MiAaHDL
|
538 |
|
|
|a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
|u http://purl.oclc.org/DLF/benchrepro0212
|5 MiAaHDL
|
583 |
1 |
|
|a digitized
|c 2014
|h HathiTrust Digital Library
|l committed to preserve
|2 pda
|5 MiAaHDL
|
590 |
|
|
|a Knovel
|b ACADEMIC - Software Engineering
|
650 |
|
0 |
|a C (Computer program language)
|
650 |
|
0 |
|a Computer algorithms.
|
650 |
|
0 |
|a Data structures (Computer science)
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
6 |
|a C (Langage de programmation)
|
650 |
|
6 |
|a Algorithmes.
|
650 |
|
6 |
|a Structures de données (Informatique)
|
650 |
|
7 |
|a algorithms.
|2 aat
|
650 |
|
7 |
|a Algorithms
|2 fast
|
650 |
|
7 |
|a C (Computer program language)
|2 fast
|
650 |
|
7 |
|a Computer algorithms
|2 fast
|
650 |
|
7 |
|a Data structures (Computer science)
|2 fast
|
650 |
|
7 |
|a Algoritmos e estruturas de dados.
|2 larpcal
|
650 |
|
7 |
|a Linguagem de programação.
|2 larpcal
|
776 |
0 |
8 |
|i Print version:
|w (OCoLC)35324009
|
856 |
4 |
0 |
|u https://appknovel.uam.elogim.com/kn/resources/kpADSAAC0A/toc
|z Texto completo
|
938 |
|
|
|a Internet Archive
|b INAR
|n algorithmsdatast0000bowm
|
994 |
|
|
|a 92
|b IZTAP
|