//]]>

Algorithms and Programming (Record no. 22821)

000 -LEADER
fixed length control field 03540nam a22004815i 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140310151444.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 100803s2010 xxu| s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781441917485
978-1-4419-1748-5
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.A43
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 518.1
Edition number 23
264 #1 -
-- New York, NY :
-- Springer New York :
-- Imprint: Springer,
-- 2010.
912 ## -
-- ZDB-2-SMA
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Shen, Alexander.
Relator term author.
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE
Title Algorithms and Programming
Medium [electronic resource] :
Remainder of title Problems and Solutions /
Statement of responsibility, etc by Alexander Shen.
250 ## - EDITION STATEMENT
Edition statement 2.
300 ## - PHYSICAL DESCRIPTION
Extent XII, 272 p.
Other physical details online resource.
440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE
Title Springer Undergraduate Texts in Mathematics and Technology,
International Standard Serial Number 1867-5506
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Variables, expressions, assignments -- Generation of combinatorial objects -- Tree traversal (backtracking) -- Sorting -- Finite-state algorithms in text processing -- Data types -- Recursion -- Recursive and non-recursive programs -- Graph algorithms -- Pattern matching -- Games analysis -- Optimal coding -- Set representation. Hashing -- Sets, trees, and balanced trees -- Context-free grammars -- Left-to-right parsing (LR).
520 ## - SUMMARY, ETC.
Summary, etc "Algorithms and Programming" is primarily intended for a first year undergraduate course in programming. Structured in a problem-solution format, the text motivates the student to think through the programming process, thus developing a firm understanding of the underlying theory. Although a moderate familiarity with programming is assumed, the book is easily utilized by students new to computer science. The more advanced chapters make the book useful for a graduate course in the analysis of algorithms and/or compiler construction. New to the second edition are added chapters on suffix trees, games and strategies, and Huffman coding as well as an appendix illustrating the ease of conversion from Pascal to C. The material covers such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms, and much more. Reviews of the 1st Edition: "The book is addressed both to ambitious students and instructors looking for interesting problems [and] fulfills this task perfectly, especially if the reader has a good mathematical background." — Zentralblatt MATH "This book is intended for students, engineers, and other people who want to improve their computer skills.... The chapters can be read independently. Throughout the book, useful exercises give readers a feeling for how to apply the theory." — Computing Reviews "Overall...the book is well done. I recommend it to teachers and those wishing to sharpen their data structure and compiler skills." — SIGACT News
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematics.
Topical term or geographic name as entry element Computer science.
Topical term or geographic name as entry element Computer software.
Topical term or geographic name as entry element Computer science
General subdivision Mathematics.
Topical term or geographic name as entry element Algorithms.
Topical term or geographic name as entry element Mathematics.
Topical term or geographic name as entry element Algorithms.
Topical term or geographic name as entry element Programming Techniques.
Topical term or geographic name as entry element Computational Mathematics and Numerical Analysis.
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9781441917478
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-1-4419-1748-5
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type E-Book
Copies
Price effective from Permanent location Date last seen Not for loan Date acquired Source of classification or shelving scheme Koha item type Damaged status Lost status Withdrawn status Current location Full call number
2014-04-09AUM Main Library2014-04-09 2014-04-09 E-Book   AUM Main Library518.1

Languages: 
English |
العربية