Average customer rating:
- My choice for textbook in my computation theory class
- well-organized, progressive, and understandable
- Great book on the subject
- Very readable, diverse, and a little sparse
- Most appropriate for CS students
|
Introduction to the Theory of Computation, Second Edition
Michael Sipser
Manufacturer: Course Technology
ProductGroup: Book
Binding: Hardcover
 General
| Business & Investing
| Subjects
| Books
High-Tech
| Industries & Professions
| Business & Investing
| Subjects
| Books
General
| Computers & Internet
| Subjects
| Books
General
| Arts & Photography
| Subjects
| Books
All Titles
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Arts & Photography
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Business & Investing
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Computers & Internet
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Similar Items:
-
Introduction to Algorithms
-
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
-
Compilers: Principles, Techniques, and Tools (2nd Edition)
-
Operating System Concepts
-
Computer Organization and Design, Revised Printing, Third Edition, Third Edition: The Hardware/Software Interface (The Morgan Kaufmann Series in Computer ... Series in Computer Architecture and Design)
ASIN: 0534950973 |
Amazon.com
"Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation. The presentation is remarkably clear; for example, the "proof idea," which offers the reader an intuitive feel for how the proof was constructed, accompanies many of the theorems and a proof. Introduction to the Theory of Computation covers the usual topics for this type of text plus it features a solid section on complexity theory--including an entire chapter on space complexity. The final chapter introduces more advanced topics, such as the discussion of complexity classes associated with probabilistic algorithms.
Book Description
This highly anticipated revision builds upon the strengths of the previous edition. Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections explain profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years, and offers updated, classroom-tested problem sets at the end of each chapter.
Customer Reviews:
My choice for textbook in my computation theory class.......2007-10-01
I recently encountered this book at a publisher's booth at a computer conference and read it on the ride back home. This morning I made a trip to the college bookstore and notified them that it is the textbook that I will be using in my computation theory class this spring.
The chapter titles are:
0) Introduction - this chapter contains the fundamental mathematical background of sets, functions, graphs and proofs. For most students, it could be skipped or skimmed.
1) Regular languages - this chapter is an introduction to deterministic and nondeterministic finite automata and regular expressions.
2) Context-free languages - an introduction to context-free grammars and pushdown automata.
3) The Church-Turing theses - an introduction to Turing machines and the variants, such as multiple tapes and nondeterministic Turing machines.
4) Decidability - the definition of decidability and how Turing machines and finite automata are used to prove or disprove if a language is decidable.
5) Reducibility - the definition of reducible and how Turing machines can be used to execute reductions.
6) The recursion theorem - an introduction to the recursion theorem and some applications to formal theories.
7) Time complexity - the first chapter in the coverage of algorithmic complexity, in this case execution time.
8) Space complexity - an examination of the complexity of algorithms from the perspective of the amount of memory required.
9) Intractability - an examination of the problems that can be solved in principle but not in practice.
10) Advanced topics in complexity theory - approximation algorithms, probabilistic algorithms, alternation, interactive proof systems, parallel computation and cryptography.
There is less coverage of grammars than most books, which is replaced by more in the area of algorithmic analysis. In my opinion, that is an appropriate tradeoff, the analysis of algorithms gives the students some understanding of how automata are applied in computer science.
Another excellent feature of this book is the solutions to selected exercises that appear at the end of the chapters. My estimate is that reasonably detailed solutions to approximately one-third of the problems are included. This allows the students to work extra problems by themselves, and helps the instructor if they are asked to do another example in class that they have not already worked through.
The exposition is very good; I am convinced that the students will be able to read the material on their own, which is one more reason why I adopted this book for my course.
well-organized, progressive, and understandable.......2007-01-06
As an intro to the theoretical background to computer science goes, this book is about as readable and approachable as you can get.
It gives a very thorough treatment of the whole theoretical basis, from regular languages and pumping lemmas out through Turing machines and related issues, and on to some interesting language classes (like NP and PSpace-complete).
If there's a single sticking point with the book, it's that it insists on a very strict formalism (ie: everything is proof-based) -- something necessary for the topic, but it sometimes renders the material a bit hard to digest.
Great book on the subject.......2006-12-27
If you are interested in or for other reasons must read a book on this subject, this is the book. I took a class last semester which used Hopcroft as the text and I found myself often turning to this book for better understanding. This book is more intuitive and thus a bit less formal than Hopcroft but when trying to learn, understanding is better than mathematical formalism. If you are new to the subject, Sipser is the book to begin with.
Very readable, diverse, and a little sparse.......2006-11-25
This is a wonderful little gem of a book that presents the theory of computation in a fascinating way. It is targeted at advanced undergraduates in computer science, but assumes remarkably little prior knowledge, making it accessible to nearly anyone. The book covers a lot of ground, including the standard fare of automata, computability, and complexity results, plus some bonus material such as probablistic and parallel complexity, information theory, decidable logical theories, and other topics that are normally left out of introductory books. On top of this, the book is remarkably thin!
The best attribute of Sipser's book, though, is the engaging style. This is an easy book to read. You will not feel like you're running into a brick wall, as is sometimes the case with books on abstract topics. It's not so much that the book is slow or gentle (it's really not) as that it is interesting, engaging, and has a knack for stopping short of getting too caught up in details. A number of small things -- the occasional amusing exercise, the "proof idea" sections, or helpful pictures -- add up to an enjoyable reading experience.
Two cautions are appropriate to students considering this book. First, there are variations between authors in the definitions of various automata (especially PDAs). The differences are trivial, and more a matter of taste than of any real importance; but it could come up if you use Sipser as a supplement to a course that follows a different textbook. Second, the coverage of many topics in Sipser's book is brief and concise, sometimes more than you might like. Some important concepts (for example, pairwise distinguishability of strings) are only mentioned in exercises, not in the main chapter, so at least skim all the exercises even if you don't do them. The sketchy coverage is especially pronounced in advanced topics, so (as always) expect to do some filling in of concepts if you go on into further study of this area.
Most appropriate for CS students.......2006-06-01
As a teacher of the subject, I have had the chance to evaluate numerous books on the theory of computation. Of all the available texts, I think this one is the most appropriate for CS students. In the past I taught out of Dexter Kozen's book, which is incredibly elegant, but had some resistance from the students. Thinking it over I decided that Kozen's text, although beautiful, may be better suited to students pursuing a degree in pure math. Sipser's book, on the other hand, is more gentle. I find that Sipser demands far less mathematical maturity from his readers, and thus allows the difficulty to be shifted from excessive formalism to the inherent challenges present in the material. In addition, following Sipser's treatment, I was able to cover finite state machines and pushdown automata in far less time, thus allowing me to concentrate on computability and beyond. The book really shines in its treatment of computability theory, eloquently directing attention to some of the most beautiful aspects.
Another benefit of Sipser's book is the exercises, of which there are many more in this edition. Someone studying on their own should find the initial group of exercises in each section quite approachable. Even the more challenging problems are not incredibly hard, and typically draw their difficulty from the deeper themes of the chapter instead of obscure details.
If you are looking for an enjoyable, well-paced book with an introduction to computability and complexity that is truly inspiring, this is the one for you. A mathematician looking for a bit more rigor may do better with Kozen.
Book Description
Live IT!
Information technology lives all around us--in how we communicate, how we do business, how we shop, how we learn, even how we register for classes. Smart phones, iPods, PDAs, and wireless devices dominate our lives, and yet it's all too easy to take information technology for granted.
Now, Rainer, Turban, and Potter's Introduction to Information Systems helps make information technology come alive in the classroom. This text takes students where IT lives--in today's businesses and in our daily lives--and helps them understand how valuable information technology is to their future careers. Throughout, the text connects IT to accounting, finance, marketing, human resources, and operations, so students can discover how critical IT is to each functional area and every business.
Technology to help students reach their full potential
WileyPLUS provides everything needed to create an environment where students can reach their full potential and experience the exhilaration of academic success.
With WileyPLUS, students can:
* Interact with engaging activities for each chapter, including simulations and animations that help them visualize IT processes.
* Develop IT solutions for a simulated music venue called Club IT.
* Come to class better prepared for lectures.
* Get immediate feedback and context-sensitive help on assignments and quizzes.
* Access a suite of learning resources, including a complete online version of the text.
800f students surveyed said it improved their understanding of the material.
760f students surveyed said it made them better prepared for tests.
690f students surveyed said it helped them get a better grade.
Visit www.wiley.com/college/wileyplus or contact your Wiley representative for more information.
Customer Reviews:
This is a book for MIS...!!!.......2005-12-21
This book is intended for a read on topics of MIS (Management Information Systems), a predominantly Management subject, that analyses solutions for Business challenges through the effective usage of Information Technology. Though it is titled differently, its coverage of the MIS topics is reasonably sufficient.
Excellent .......2005-10-24
The book was shipped really fast. This was a great buy for me.
Excellent service.......2003-05-27
It was incredible. I ordered it on wednesday night, it was shipped on friday and I got it during the weekend. Besides the book was new in perfect conditions! Thank you.
A textbook for college business majors (only?).......2000-11-09
If you want a general IT book then don't even think about buying this one, despite its title. This is a textbook for college business majors, and looks at things from the business angle.
The book is less suitable for non-student readers. It is geared for use by a lecturer who can draw attention to the important concepts underlying the field of IT, and can steer students to useful supplementary material.
The book races across the surface of the whole field of IT. The authors have packed in a lot of material, but at a cost. The explanations may be good enough for students to answer a quiz about the various buzzwords, but there is not enough space here to cover anything in depth. The students, and you, may be left without a clear idea of what the words really mean.
At the other end of the scale, the book struggles to make plain the broad sweep of IT concepts. Although the authors try hard, ideas tend to get lost amidst the large number of factoids.
One book is never going to be enough to cover all of IT. Your choices are to be more selective about which area you want to learn about, to pick a book which is more clearly aimed at being a simple overview, or to buy this book and work really hard at following up its leads to other material to fill in the gaps.
Book Description
Written from a manufacturing perspective, this book takes readers step-by-step through the theory and application techniques of designing and building a robot-driven automated work cell—from selection of hardware through programming of the devices to economic justification of the project. All-inclusive in approach, it covers not only robot automation, but all the other technology needed in the automated work cell to integrate the robot with the work environment and with the enterprise data base. Robot and other required automation hardware and software are introduced in the order in which they would be selected in an actual industrial automation design. Includes system troubleshooting guides, case studies problems, and worked example problems. Robot Classification. Automated Work Cells and CIM Systems. End-of-Arm Tooling. Automation Sensors. Work-Cell Support Systems. Robot and System Integration. Work-Cell Programming. Justification and Applications of Work Cells. Safety. Human Interface: Operator Training, Acceptance, and Problems. For those interested in Robotics and Manufacturing Automation or Production Design.
Book Description
New from best-selling author Kathy Schwalbe, Introduction to Project Management offers a general yet concise introduction to project management. This book provides up-to-date information on how good project, program, and portfolio management can help you achieve organizational success. It includes over 50 samples of tools and techniques applied to one large project, and is suitable for all majors, including business, engineering, healthcare, and more.
Customer Reviews:
Excellent examples, great for PMP exam.......2006-02-26
This book is much shorter than my best-selling Information Technology Project Management text, now in its 4th edition, but it's still packed with great information. It follows the processes used in the new PMBOK Guide, so it will definitely help you study for the PMP exam. The best thing about this book is that instead of just talking about a lot of the documents and tools you can use when managing a project, it shows you realistic examples of them as applied to a project that is described throughout the book. There are also lots of examples of what went right and wrong based on real projects in various industries and countries, media snapshots to show how PM is used in so many aspects of our lives, cartoons, quick quizzes at the end of each chapter, discussion questions, exercises, and team projects. The companion Web site also provides templates, lots of interactive quizzes, a detailed guide to using Project 2003 or 2003, and lots of other info. Great text for an individual and especially for a general course in project management at the undergrad or graduate level.
Book Description
A complete, but less complex approach to SA&D. Introduction to Systems Analysis & Design is organized like Whitten’s best-selling Systems Analysis & Design Methods, but without the information systems architecture framework theme that overwhelms some students. Each chapter covers the same topics, but stops short of advanced details that are unnecessary to the typical first course.
Average customer rating:
- good book for a graduate course
- Excellent buy
- Confusing to say the least
- Fantastic algorithms book
- Good Reference, Poor Textbook
|
Introduction to Algorithms, Second Edition
Thomas H Cormen ,
Charles E Leiserson ,
Ronald L Rivest , and
Clifford Stein
Manufacturer: McGraw-Hill Science/Engineering/Math
ProductGroup: Book
Binding: Hardcover
Science
| Subjects
| Books
| Agricultural Sciences
| Archaeology
| Astronomy
| Behavioral Sciences
| Biological Sciences
| Chemistry
| Earth Sciences
| Education
| Essays & Commentary
| Evolution
| Experiments, Instruments & Measurement
| General
| History & Philosophy
| Mathematics
| Medicine
| Nature & Ecology
| Physics
| Reference
| Technology
General
| Algorithms
| Programming
| Computers & Internet
| Subjects
| Books
Information Systems
| Software Engineering
| Computer Science
| Computers & Internet
| Subjects
| Books
General
| Computers & Internet
| Subjects
| Books
jp-unknown1
| Specialty Stores
| Books
All Titles
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Computers & Internet
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Similar Items:
-
Artificial Intelligence: A Modern Approach (2nd Edition)
-
Introduction to the Theory of Computation, Second Edition
-
Operating System Concepts
-
Computer Organization and Design, Revised Printing, Third Edition, Third Edition: The Hardware/Software Interface (The Morgan Kaufmann Series in Computer ... Series in Computer Architecture and Design)
-
Compilers: Principles, Techniques, and Tools (2nd Edition)
ASIN: 0070131511 |
Amazon.com
Aimed at any serious programmer or computer science student, the new second edition of Introduction to Algorithms builds on the tradition of the original with a truly magisterial guide to the world of algorithms. Clearly presented, mathematically rigorous, and yet approachable even for the math-averse, this title sets a high standard for a textbook and reference to the best algorithms for solving a wide range of computing problems.
With sample problems and mathematical proofs demonstrating the correctness of each algorithm, this book is ideal as a textbook for classroom study, but its reach doesn't end there. The authors do a fine job of explaining each algorithm. (Reference sections on basic mathematical notation will help readers bridge the gap, but it will help to have some math background to appreciate the full achievement of this handsome hardcover volume.) Every algorithm is presented in pseudo-code, which can be implemented in any computer language, including C/C++ and Java. This ecumenical approach is one of the book's strengths. When it comes to sorting and common data structures, from basic linked lists to trees (including binary trees, red-black, and B-trees), this title really shines, with clear diagrams that show algorithms in operation. Even if you just glance over the mathematical notation here, you can definitely benefit from this text in other ways.
The book moves forward with more advanced algorithms that implement strategies for solving more complicated problems (including dynamic programming techniques, greedy algorithms, and amortized analysis). Algorithms for graphing problems (used in such real-world business problems as optimizing flight schedules or flow through pipelines) come next. In each case, the authors provide the best from current research in each topic, along with sample solutions.
This text closes with a grab bag of useful algorithms including matrix operations and linear programming, evaluating polynomials, and the well-known Fast Fourier Transformation (FFT) (useful in signal processing and engineering). Final sections on "NP-complete" problems, like the well-known traveling salesman problem, show off that while not all problems have a demonstrably final and best answer, algorithms that generate acceptable approximate solutions can still be used to generate useful, real-world answers.
Throughout this text, the authors anchor their discussion of algorithms with current examples drawn from molecular biology (like the Human Genome Project), business, and engineering. Each section ends with short discussions of related historical material, often discussing original research in each area of algorithms. On the whole, they argue successfully that algorithms are a "technology" just like hardware and software that can be used to write better software that does more, with better performance. Along with classic books on algorithms (like Donald Knuth's three-volume set, The Art of Computer Programming), this title sets a new standard for compiling the best research in algorithms. For any experienced developer, regardless of their chosen language, this text deserves a close look for extending the range and performance of real-world software. --Richard Dragan
Topics covered: Overview of algorithms (including algorithms as a technology); designing and analyzing algorithms; asymptotic notation; recurrences and recursion; probabilistic analysis and randomized algorithms; heapsort algorithms; priority queues; quicksort algorithms; linear time sorting (including radix and bucket sort); medians and order statistics (including minimum and maximum); introduction to data structures (stacks, queues, linked lists, and rooted trees); hash tables (including hash functions); binary search trees; red-black trees; augmenting data structures for custom applications; dynamic programming explained (including assembly-line scheduling, matrix-chain multiplication, and optimal binary search trees); greedy algorithms (including Huffman codes and task-scheduling problems); amortized analysis (the accounting and potential methods); advanced data structures (including B-trees, binomial and Fibonacci heaps, representing disjoint sets in data structures); graph algorithms (representing graphs, minimum spanning trees, single-source shortest paths, all-pairs shortest paths, and maximum flow algorithms); sorting networks; matrix operations; linear programming (standard and slack forms); polynomials and the Fast Fourier Transformation (FFT); number theoretic algorithms (including greatest common divisor, modular arithmetic, the Chinese remainder theorem, RSA public-key encryption, primality testing, integer factorization); string matching; computational geometry (including finding the convex hull); NP-completeness (including sample real-world NP-complete problems and their insolvability); approximation algorithms for NP-complete problems (including the traveling salesman problem); reference sections for summations and other mathematical notation, sets, relations, functions, graphs and trees, as well as counting and probability backgrounder (plus geometric and binomial distributions).
Book Description
The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects.
In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage.
As in the classic first edition, this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further, the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds.
Each chapter presents an algorithm, a design technique, an application area, or a related topic. The chapters are not dependent on one another, so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally, the new edition offers a 25% increase over the first edition in the number of problems, giving the book 155 problems and over 900 exercises that reinforce the concepts the students are learning.
Customer Reviews:
good book for a graduate course.......2007-10-13
The aspect I like the most of CLRS book on algorithm is that, the style of the book is lucid, the authors have made a sincere effort in putting forth the complicated aspects in analyzing the algorithm in way that could be understood by a wider audience taking some course in computer science in under-graduate or graduate level. The mathematical rigor makes s me wonder computer science algorithm analysis is nothing more than applied discrete mathematics for specific problems.
Excellent buy.......2007-09-24
I bought a new copy of the book, and was happy to receive it the way I expected. Got free shipping with this one.
Confusing to say the least.......2007-09-14
This book does not provide enough examples to really get the ideas across. It is a thick read that provides little help to the subject matter unless the reader already has a wealth of knowledge on mathematical proofs and algorithms to begin with.
If the book had a solution manual, or at least explained many of the things that occur in the problem sections that never show up in the actual reading, then it would be a much easier to understand textbook.
Fantastic algorithms book.......2007-06-03
This is one of the few books that I've kept from my undergrad days as a computer science major. Although I haven't been doing software development in a while, I still use it for reference once in a while. It's easy to understand and timeless reference book. I work for a large DoD company and quite a few of my co-workers have this book on their shelves as well. (We all went to different colleges.)
Good Reference, Poor Textbook.......2007-04-19
This is a good reference for researchers, but it is not suitable for beginners. For anyone who try to study algorithms in the beginning, he just needs the big picture of this course, but this book contains too many mathematical proofs. In other words, the beginners just want a cup of milk, but the authors of this book give them a whole cow.
Although this book is quite huge, it does not contain some important topics, like online algorithms, randomized algorithms ... etc. In fact, this book should try to 'lose its weight' in order to get more useful knowledge.
The book contains a lot of interesting exercises, but does not indicate any hints or solutions. In fact, some of those exercises are too hard for students, and the authors should try to announce all sloutions in the website.
Book Description
A unique title which covers all the component parts of the core ITIL set, and by complementing more complex publications, acts as an efficient entry level to the ITIL literature.
Customer Reviews:
It's an excellent reference.......2007-09-06
"If you are not familiar with ITIL this truly is a must have. I purchased the book because I wanted to learn more about ITIL and I was amazed at how much useful information I found within a 242 page book. If you are a seasoned ITIL person this may be a little too basic but if you are new to the subject matter you should grab this. It's an excellent reference."
[...]
This *is* the book.......2007-02-24
The Service Support and Service Delivery books on ITIL offers an extensive and very detailed guide about each process. This introductory book about ALL ITIL, not just only Service Support and Delivery, offers an exact balance of knowledge for each ITIL discipline. It covers also (in a condensed way) ICT IM, Security, Application Management, Planning to Implement and The Business Perspective. The added value is that you have a better picture of all the ITIL processes. For instance, it explains the relationship between Change and Configuration Management with Application Management. It also explains how Security is related to Service Level Management, ICT IM related to Release,etc. Just to talk about a few examples.
Without the knowledge exposed in this book, some people could just think about ITIL as a methodology that only improves technical support or help desk. If you are beginner with ITIL I strongly suggest to consider this title instead of buying the two ITIL core books. It gives you the right information and what is better it provides you with valuable and concise information about the other disciplines. Of course, if you are considering implementing the methodology, the two ITIL core books (support and delivery) offer a very, very detailed approach.
Average customer rating:
- CD Not usable
- Brilliant
- Comprehensive ABAP reference
- Clarification about the editions
- OOP
|
ABAP Objects: Introduction to Programming SAP Applications
Horst Keller , and
Sascha Kruger
Manufacturer: Addison-Wesley Professional
ProductGroup: Book
Binding: Hardcover
Client-Server Systems
| Data in the Enterprise
| Networking
| Computers & Internet
| Subjects
| Books
SAP R3
| Data in the Enterprise
| Networking
| Computers & Internet
| Subjects
| Books
General
| Introductory & Beginning
| Programming
| Computers & Internet
| Subjects
| Books
Object-Oriented Design
| Software Design, Testing & Engineering
| Programming
| Computers & Internet
| Subjects
| Books
General
| Programming
| Computers & Internet
| Subjects
| Books
General
| Languages & Tools
| Programming
| Computers & Internet
| Subjects
| Books
General
| Business
| Software
| Computers & Internet
| Subjects
| Books
General
| Software
| Computers & Internet
| Subjects
| Books
Information Systems
| Software Engineering
| Computer Science
| Computers & Internet
| Subjects
| Books
General
| Computers & Internet
| Subjects
| Books
Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
| Applied
| Chaos & Systems
| Geometry & Topology
| Mathematical Analysis
| Mathematical Physics
| Number Systems
| Pure Mathematics
| Transformations
| Trigonometry
All Titles
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Computers & Internet
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Professional
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Similar Items:
-
SAP Smart Forms
-
Implementing SAP R/3 Sales and Distribution
-
Sams Teach Yourself SAP in 24 Hours (2nd Edition) (Sams Teach Yourself)
-
SAP Query Reporting
-
Configuring SAP R/3 FI/CO: The Essential Resource for Configuring the Financial and Controlling Modules
ASIN: 0201750805 |
Product Description
Completely new, 3rd edition of the benchmark ABAP resource New chapters on Web Dynpro, Shared Objects, ABAP & XML, regular expressions, dynamic programming, and more Up-tp-date for SAP NetWeaver 2004s (ABAP release 7.0) Includes DVD for SAP NetWeaver 2004s ABAP Trial Version This completely revised third edition introduces you to ABAP programming with SAP NetWeaver. All concepts of modern ABAP (up to release 7.0) are covered in detail. New topics include ABAP and Unicode, Shared Objects, exception handling, Web Dynpro for ABAP, Object Services, and of course ABAP and XML. Bonus: All readers will also receive a complimentary copy of the newest Mini SAP System.
Customer Reviews:
CD Not usable.......2007-10-03
If you're planning on making use of the NetWeaver trial system, be aware that it will not install on Windows Vista. On Windows XP, the instructions on the SAP site do NOT work...the system is simply not usable...After two hours of attempting to figure out how to fix the installation, I just removed it...
In my opinion, the examples in the book are nice, but without a working system to review HOW the examples work, the book is of limited value to an SAP programmer....
Brilliant.......2007-09-07
By far the best ABAP book available. It covers the essentials of good coding using the object-oriented paradigm. If you want to be coding at a high level fast, read - no study - this book.
Comprehensive ABAP reference.......2007-08-30
I got this book last week from SAP press.i read first 5 chapters and i can say this book clearly explains all the concepts. The writers explained the differences between procedural ABAP and object oriented ABAP where ever neceessary. Also the usage of obsolete statements are marked for the reader. this will be a good book for those who have previous ABAP experience and wanted to learn the Object oriented concepts from scratch. My only problem is i cant install the software that comes with the book. its like you cant install ABAP server on Vista.Be patient and read it its a 1000+ pages book.
Clarification about the editions.......2007-07-06
The book "ABAP Objects - ABAP Programming in SAP NetWeaver" (grey Cover, 950 pages, published by SAP PRESS, March 15, 2007, ISBN-10: 1592290795 ISBN-13: 978-1592290796) is the new edition of the book "ABAP Objects: Introduction to Programming SAP Applications" (black Cover, 576 pages, published by Addison-Wesley, June 14, 2002, ISBN-10: 0201750805, ISBN-13: 978-0201750805).
The new book replaces the old book. The new book covers release 7.0 of the ABAP Application Server (former SAP Basis). The old book covers release 4.6. The software of the new book is a Trial Version of the ABAP Application Server 7.0 that is supported in the SAP Developers Network (SDN). The software of the old book is a Mini Basis 4.6 and is not supported any more.
The contents of the old book is partly out of date. The software of the old book should not be installed any more. The programming examples of the old book are still valid and can also be carried out with the software of the new book. If you have the old book and want to install the software of the new book, you can download it from the SDN.
OOP.......2007-05-15
Beware the concepts are changed clights between C++ and Java so it becomes somewhat confusing. I recommend to get the later edition from SAP PRESS.
Book Description
This book presents a thorough introduction to the Microchip PIC® microcontroller family, including all of the PIC programming and interfacing for all the peripheral functions. A step-by-step approach to PIC assembly language programming is presented, with tutorials that demonstrate how to use such inherent development tools such as the Integrated Development Environment MPLAB, PIC18 C compiler, the ICD2 in-circuit debugger, and several demo boards. Comprehensive coverage spans the topics of interrupts, timer functions, parallel I/O ports, various serial communications such as USART, SPI, I2C, CAN, A/D converters, and external memory expansion.
Customer Reviews:
A very thorough overview of the PIC microcontroller.......2007-03-12
Having a background in software development (C/C++), having written a lot of assembly language in the distant past, and being familiar with processor architecture, I found the book to be straightforward and useful to me. I was able to make rapid progress through the text, sometimes skipping ahead to sections to find just what I needed. Plenty of useful source code in both asm and C as well. The professor who wrote this put together what seems like a very clean, easy to understand text (where "easy" may depend on your background - I found it easy). It is true that you can probably find much of the information in the processor specification PDF file available from Microchip or in other online sources, yet I found it very convenient to have it all available in one organized textbook. I do recommend the book for others wishing to learn more about the PIC18.
A bit difficult to read, but very detailed........2005-09-26
This book goes from basics to advanced topics, and includes sections on both assembly and C programming. It contains everything I needed to know except how to control stepper motors. This is strange because in his companion book on the MC68HC12 16 bit microcontroller he gives a very good section on stepper motors.
If you use the Allegro 3967 you don't need to use the microcontroller to drive them, just to provide on/off, speed and direction information. The 3967 does all the difficult work.
The style is a bit academic, as though it is being submitted for peer review, so he tends to overwrite things. It does not make for easy reading. I found I had to read some parts 3 times over.
I suppose any fact-filled book is not going to be an easy read.
It is worth sticking at it. He really knows his stuff, John Kirby
The best PIC18 book available........2005-09-02
I have virtually all of the major PIC books available and this
one is, by far, the best PIC18 book on the market. That may be
because it is written as a textbook by an obviously experienced
academic as well a microprocessor engineer. Each chapter follows
a natural progression from the basics of instruction set, tool
use such as MPLAB, assembly, C programming, and
on to the details of the PIC18 architecture.
Its clear organization makes it equally useful as a reference
and may be dipped into for solutions to many PIC issues such as
I2C, timer and A/D use and interfacing details for many applications.
For the earlier PIC16, the best reference is "The Quintessential PIC Microcontroller"
by Sid Katzen for many of the same reasons.
Buy these two books and you have both the PIC16 and PIC18 covered.
it's not an introduction in fact it's advanced Software & Hardware Interfacing.......2005-07-20
the name of this book is not matching with it's contents unfortunatley i found it very complecated and confusing and very hard to understand,it seems to me the only way to understand it is to read some other books related to the PIC microcontroller
the name of this book is missleading
Book Description
This carefully written, balanced book teaches the most important concepts in computing and computer science while providing enough programming depth to enable understanding about how people work with computers. Taking advantage of today's interest in and familiarity with the Web, the book contains experimental problems using Web-based tools; enabling readers to learn the fundamentals of programming by developing their own interactive Web pages. Beginning with an introduction, overview, and the basics of computers, the book proceeds with comprehensive chapters on HTML and Web pages, the Internet, JavaScript and Web page creation, the history of computers, abstraction and user-defined functions, algorithms and programming languages, event-driven programming, conditional execution, data representation, conditional repetition, JavaScript strings, and transistors and integrated circuits. This book can serve as an excellent reference resource for those entering the computer job market: programmers, Web site and Web page designers, and technical support staff.
Customer Reviews:
many mistakes, poor formatting.......2005-03-06
I was asked to grade students' homework based on Chapter 10 of this book. I found that this book contains a lot of mistakes and complicates the subject greatly. Moreover, some side-notes miss the right-most part of the text, i.e. you cannot read those side-notes without guessing what letters are missing.
For example, in the aforementioned Chapter 10, there is a diagram, which shows that public-key encryption involves the following: the sender first encrypts the message with private key, then with public key; the recipient first decrypts the message with private key, then with public key. This sounds quite complicated, and looks like they have tried to present encryption and signature-verification at the same time, but call it "public key encryption". Clearly, it should not have been this complicated, or at least it should have been called appropriately.
As one more example from Chapter 10: they say that for LANs Ethernet technology is used. They claim that this technology uses Ethernet bus, and when one computer sends a message to another computer, all computers receive the message and check the intended recipient of the message, and discard the messages that they are not intended to receive. (Clearly, this describes how Ethernet Hubs work, which can be found rarely these days as opposed to Fast Ethernet Switches.) However, later on they say that the speed of the aforementioned Ethernet is 10, 100, or 1000 Mbits per second. This is where the problem begins -- I have never saw a Gigabit Ethernet Hub (as opposed to Switch), and I don't think that Fast Ethernet Hubs were popular either. Clearly, this is one more instance of confusing the reader and presenting false information.
I would never recommend this book to anyone. If the author wanted to keep the subject simple, he should have avoided the technical details all together. If he wanted to present some technical detail, then he should have made sure that they don't contradict each other and are not missing important points and updates.
Suitable for an introduction to computer science course.......2005-03-01
There are generally two courses for beginners in computing. "Introduction to Computers" is usually designed for people who know very little about computers and are interested in using them in their daily life. While "Introduction to Computer Science" covers some of the same material, it is designed for those who want to know how computers work, and perhaps even take some courses in computer science. This book is written for the second type of course.
Programming is introduced via HTML, which is in complete agreement with what I tell everyone who expresses an interest in learning to program. HTML is easy to understand, demonstrates some of the ideas of advanced programming and the feedback is immediate. Furthermore, initial programs can be small and since the student will most certainly be familiar with surfing the web, the results will make sense to them.
What most people consider to be true programming, writing code with variables, functions, if constructs, loops and user interaction, are introduced with JavaScript. This is also a sound decision, JavaScript is powerful enough to introduce the basics of programming, builds on the previous HTML coding and is freely available. Other chapters cover a brief history of computing, how data is represented in computers, the fundamentals of digital logic and the impact computers are having on society. A large number of images are used to reinforce the text, and exercises are embedded inside the chapters with another set at the end of the chapter.
If you are in the queue to teach an introduction to computer science course, then you should examine this book. It is well written and the level of presentation is appropriate for the typical student taking such a course. It could also be used for self-study.
Books:
- IT Manager's Handbook, Second Edition: Getting your new job done
- IT Manager's Handbook, Second Edition: Getting your new job done
- Land Development Handbook (Handbook)
- Land Development Handbook (Handbook)
- Leaving Microsoft to Change the World: An Entrepreneur's Odyssey to Educate the World's Children
- Leveraging the Semantics of Topic Maps: Second International Conference on Topic Maps Research and Applications, TMRA 2006, Leipzig, Germany, October 11-12, ... papers (Lecture Notes in Computer Science)
- Management Information Systems: Managing the Digital Firm (9th Edition)
- Managing Enterprise Content: A Unified Content Strategy
- Managing Enterprise Content: A Unified Content Strategy
- Managing the Information Technology Resource: Leadership in the Information Age
Books Index
Books Home
Recommended Books
- Secrets of the Millionaire Mind: Mastering the Inner Game of Wealth
- Five Frogs on a Log: A CEO's Field Guide to Accelerating the Transition in Mergers, Acquisitions An
- Writing Effective Letters, Memos, and E-mail
- A Raft of Sea Otters
- Civilizing Rituals: Inside Public Art Museums
- History: Fiction or Science
- Cns Neurotransmitters And Neuromodulators: GLUTAMATE
- The Night Before Christmas Pop-up
- A Practice Problem for use in principles of Accounting: Billy's Video
- Chicano Sketches
