| 000 | 00891namuu2200265 a 4500 | |
| 001 | 000045274879 | |
| 005 | 20130802202104 | |
| 008 | 060627s2006 maua b 001 0 eng d | |
| 020 | ▼a 0321397339 (Pearson international ed.) | |
| 040 | ▼a 211009 ▼c 211009 ▼d 211009 | |
| 082 | 0 4 | ▼a 005.73 ▼a 005.133 ▼2 23 |
| 084 | ▼a 005.73 ▼2 DDCK | |
| 090 | ▼a 005.133 ▼b W431da3 | |
| 100 | 1 | ▼a Weiss, Mark A., ▼d 1945-. |
| 245 | 1 0 | ▼a Data structures and algorithm analysis in C++ / ▼c Mark Allen Weiss. |
| 250 | ▼a 3rd ed. | |
| 260 | ▼a Boston : ▼b Pearson/Addison Wesley, ▼c c2006. | |
| 300 | ▼a 586 p. : ▼b ill. ; ▼c 24 cm. | |
| 500 | ▼a Previous ed.: 1999. | |
| 504 | ▼a Includes bibliographical references and index. | |
| 650 | 0 | ▼a Data structures (Computer science) |
| 650 | 0 | ▼a Computer algorithms. |
| 650 | 0 | ▼a C++ (Computer program language) |
| 945 | ▼a KINS |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 과학도서관/Sci-Info(2층서고)/ | 청구기호 005.133 W431da3 | 등록번호 121128867 (12회 대출) | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
| No. 2 | 소장처 과학도서관/Sci-Info(2층서고)/ | 청구기호 005.133 W431da3 | 등록번호 121226150 (4회 대출) | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
| No. 3 | 소장처 과학도서관/보존서고1(서양서)/ | 청구기호 005.133 W431da3 | 등록번호 121152879 (6회 대출) | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
| No. 4 | 소장처 과학도서관/보존서고1(서양서)/ | 청구기호 005.133 W431da3 | 등록번호 121152880 (7회 대출) | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
책소개
Mark Allen Weiss’ innovative approach to algorithms and data structures teaches the simultaneous development of sound analytical and programming skills for the advanced data structures course. Readers learn how to reduce time constraints and develop programs efficiently by analyzing the feasibility of an algorithm before it is coded.
The C++ language is brought up-to-date and simplified, and the Standard Template Library is now fully incorporated throughout the text. This Third Edition also features significantly revised coverage of lists, stacks, queues, and trees and an entire chapter dedicated to amortized analysis and advanced data structures such as the Fibonacci heap.
Known for its clear and friendly writing style, Data Structures and Algorithm Analysis in C++ is logically organized to cover advanced data structures topics from binary heaps to sorting to NP-completeness. Figures and examples illustrating successive stages of algorithms contribute to Weiss’ careful, rigorous and in-depth analysis of each type of algorithm.
정보제공 :
