Product Description
Answers the question, "What can I do with a major in . . . ?"

Students can explore their career options within their field of study using the Great Jobs series as their guide. From assessing individual talents and skills to taking the necessary steps to land a job, every aspect of identifying and getting started in a career choice is covered. Readers learn to explore their options, target an ideal career, present a major as an asset to a job, perfect a job search, and follow through and get results. ... Read more

Customer Reviews (4)

Found a better way to search for jobs
This book is all right but if you want a really good resource for finding a job right out of college I would go to [...] and take a look around. They are the best at getting plugged into the job market quickly. Swing by the website and take a look around, I bet you will find at least one job that will sound interesting to you. Good luck looking for a job, and be sure to look at all your resources not just books.

Useful and informative.
I read this book and "The Secret Path to Contract Programming Riches." Together, they helped me basically skip normal employment and get a computer programming job almost immediately after finishing school. This book helped me see what options I had - I never knew there were so many!

I was very interested in programming/consulting and this book helped direct my focus to achieve my goal. Although it doesn't tell you exaclty how to become a programmer/consultant, expecially right out of school, which is very hard, it helped me search for more knowledge and that's how I came upon "The Secret Path to Contract Programming Riches...,"which showed me exactly what to do to become a contract programmer as quickely as I can.

If you are like me, "Great Jobs for Computer Science Majors" will be but one of many great books in your life that helps shape your destiny and career fulfillment.

Great Jobs for Computer Science Majors
I'll make it short and sweet. If you buy this book and follow it step bystep, not only will you have a great paying job, but you will have fun,too.

I got a great paying job at a large corporation and I have not evengraduated yet. That is how good this book is!!!!!!!!!

Great book
As a computer scince major I found this book very useful. It go tme think about what I really wanted to do and what my options where. the great books is very well done I have a few of there books, they are a must read for college students ... Read more

Product Description
The Concise Encyclopedia of Computer Science has been adapted from the full Fourth Edition to meet the needs of students, teachers and professional computer users in science and industry.  As an ideal desktop reference, it contains shorter versions of 60% of the articles found in the Fourth Edition, putting computer knowledge at your fingertips. 

Organised to work for you, it has several features that make it an invaluable and accessible reference.  These include:

• Cross references to closely related articles to ensure that you don’t miss relevant information
• Appendices covering abbreviations and acronyms, notation and units, and a timeline of significant milestones in computing have been included to ensure that you get the most from the book.
• A comprehensive index containing article titles, names of persons cited, references to sub-categories and important words in general usage, guarantees that you can easily find the information you need. 

 Classification of articles around the following nine main themes allows you to follow a self study regime in a particular area: 

Product Description

Here is an accessible, algorithmically oriented guide to some of the most interesting techniques of complexity theory. The book shows that simple algorithms are at the heart of complexity theory. The book is organized by technique rather than by topic. Each chapter focuses on one technique: what it is, and what results and applications it yields.

Customer Reviews (1)

Good idea, but badly executed
The aim of this book is to introduce complexity theory using a more technique-oriented approach, which is not seen in other complexity theory textbooks. Techniques covered are:
- self-reducibility
- one-way function
- tournament divide and conquer
- isolation technique (aka. isolation lemma)
- witness reduction
- polynomial interpolation
- nonsolvable group (used in Barrington's theorem to show that width-five branching program can simulate any Boolean formula and thus the complexity class NC1)
- random restriction technique
- polynomial technique
This seems like an awesome approach and I can't agree with the authors more about the organization of techniques. This was the reason why I bought the book.

Unfortunately, the results are badly presented in a lot of places. Proofs are extremely tedious with unnecessary details and notations. This overly formal approach prevents readers from seeing the big strategy or ideas behind the proofs. For example, Barrington's theorem has a very elegant and readable 1-page proof (cf. Boppana-Sipser survey "The Complexity of Finite Functions", 1989). But in this book they decided to include an ugly 6 page proof!

The students will learn more from "Computational Complexity" by Arora and Barak, where only the most elegant and readable versions of proofs are selected. Papadimitriou does not cover recent results, but is also a solid textbook with full of excellent exercises. ... Read more

Product Description
The Invocation Model of Process Expression argues that mathematics does not provide the most appropriate conceptual foundations for computer science, but, rather, that these foundations are a primary source of unnecessary complexity and confusion.  It supports that there is a more appropriate conceptual model that unifies forms of expression considered quite disparate and simplifies issues considered complex and intractable.  This book presents that this model of process expression is alternative theory of computer science that is both valid and practical. ... Read more

Customer Reviews (1)

Karl Fant's Remarkable Book
I've known the author of "Computer Science Reconsidered" for almost thirty years, so while I'll try to be objective, expect some personal bias as well as some disagreements with Karl. Traditional computer science places the sequential algorithm and Boolean logic at the heart of computer science. Karl takes a much wider view. He sees computer science as the theory of "process expression" - for instance, given the process of adding a million numbers, how is this process physically accomplished(physically expressed) and symbolically represented(symbolically expressed)? In general, this will be done most efficiently concurrently, and not necessarily by specifying an algorithm, but perhaps by using some clockless physical system that is smart enough to 'resolve' the problem in some partially specified, automatic manner. Karl's book takes clockless concurrent process to be fundamental(as it is in nature). He describes very primitive processes in a new and idiosyncratic language that may be off-putting to some readers, but in truly concurrent processes, notions like 'state' and 'register' are far too narrow and completely inappropriate, so much traditional process language must be abandoned. It seems obvious to me that Karl is on the right track - his approach seems radical until one starts to be embarrased at the primitive, unnatural state of today's computer science, where timing circuits must still be designed (yet nature doesn't do this), and all process details must still be specified (nature doesn't do this). Besides, the foundation of today's c.s. is about Turing Machines and the question, "Is a given process possible," when pragmatically c.s almost always instead asks, "How is a given process best done?" Every revolution takes place in a context. I have found that Karl's ideas intersect in bits and pieces with Carver Mead's ideas on making computers more like Fruit Fly brains (low power - millions of times more efficient than those clunky silicon things), and Judea Pearl's causality flow diagrams (where, as in Boolean Logic, equations by themselves are incomplete symbolic process expressions), the Relational Quantum Mechanics of Carlo Rovelli (where there are no objective, universal system states), and my recent work on human psycology and religion, where moral rule following (like an algorithm) is treated as an immature, autistic form of ethical behavior, compared to the spontaneous ethical behavior of famous religious figures. Karl's book is a new foundation. Don't expect to read a handbook with complete hardware and software languages spelled out. Those are being worked on, or in his previous book. Read Karl's new book like you're reading a mix of Copernicus and Tesla - lots of wild new ideas, ocassionally stunning insights and many sparks!
... Read more

Product Description

Stein/Drysdale/Bogart's Discrete Mathematics for Computer Scientists is ideal for computer science students taking the discrete math course.

Written specifically for computer science students, this unique textbook directly addresses their needs by providing a foundation in discrete math while using motivating, relevant CS applications. This text takes an active-learning approach where activities are presented as exercises and the material is then fleshed out through explanations and extensions of the exercises.

Customer Reviews (1)

I did not find it suitable for my discrete math course
I evaluated this book for possible adoption in a course in introductory discrete mathematics. My decision was that I would not use it in the course. One primary reason is that there are no sections devoted to set theory and functions. Most of the introductory material in these areas is included in the book, but only in conjunction with other topics, such as counting, solving recurrences and computing probabilities. In my experience, students need to be exposed to the material as a point of emphasis, rather than embedded inside other topics.
The first chapter introduces the basic principles of counting, permutations, combinations, binomial coefficients and a section on equivalence relations that is considered optional. This is because it is not used again in later chapters, something I don't agree with. Chapter two deals with cryptography and number theory. While I have no objection to this material in a discrete mathematics course, I prefer that it be put off to the latter part of the course. In chapter three, the logic of propositions and predicates as well as the laws of inference are examined. I generally prefer more coverage of these areas. Chapter four is 84 pages and covers induction, recursion and recurrence relations. Taking up approximately one fourth of the book, the coverage is complete. Probability is covered in chapter 5 and graph theory in chapter 6. The coverage in both is fairly typical, so I have no positive or negative comments on either one. Relations are covered in depth in an appendix. Solutions to the odd exercises are included in an appendix.
Since I prefer to start my discrete mathematics course by covering set theory, functions and logic, I have removed this book for adoption consideration.
... Read more

Product Description
Programming is a fascinating and challenging subject. Unfortunately, it is rarely presented as such. Most often it is taught by "induction": features of some famous programming languages are given operational meaning (e.g. a loop "goes round and round"), a number of examples are shown, and by induction, we are asked to develop other programs, often radically different from the ones we've seen. Basically we are taught to guess our programs, and then to patch up our guesses. Our errors are given the cute name of "bugs". Fixing them becomes puzzle-solving, as does finding tricks that exploit or avoid poorly designed features of the programming language. The entire process is time-consuming and expensive. And even so, we are never quite sure if our programs really work in all cases. When approached in this way, programming is indeed a dull activity. There is, however, another approach to programming, an approach in which programs can be developed reliably, with attention to the real issues. It is a practical approach based on methodically developing programs from their specifications. Besides being practical, it is exciting. Many programs can be developed with relative ease. Problems which once were difficult can now be solved by beginners. Elegant solutions bring great satisfaction. This is our subject. We are interested in making programming an exciting topic! ... Read more

Product Description
Four full-length practice exams reflect the latest AP Computer Science exams in subject matter, length, and degree of difficulty. All come with answers explained. Two are level A exams and the remaining two are level AB exams. This manual also presents a subject review with more than 500 multiple-choice questions. It covers all AP computer science topics, including the new Java 5.0 language features; classes and objects; inheritance and polymorphism; program design and analysis; one- and two-dimensional arrays; recursion; linked lists; stacks, queues, and priority queues; trees; collections; and sorting and searching. Aseparate chapter reviews the Marine Biology Simulation Case Study. ... Read more

Customer Reviews (6)

Very good CS AP review book
Great practice problems.Also contains extra AP tests on CD.Recommended as a supplement to any CS AP textbook.

Awesome Review Guide
This review book is a great way to study for the AP Computer Science test. There are good practice test and material review sections. It really helped me achieve a better grade on the AP Computer Science test.

Best AP CP review book
It's really good! There are tons of sample questions and the explanations are easy to understand.

Don't buy -- wait until it's the real deal
This product is mislabeled.The 2007-08 edition would contain both material from Java 1.5, and also the GridWorld Case Study.What I recieved contains the former, but not the latter.You are better off waiting until mid to late summer when the real deal will be available.

Great
This book is a great learning tool.It teaches the advanced data-structures for the ap test, and tests you to know all the things the test would ever require you to know.It is also great for studing very precise algorithms, which will save your [...] on the test, and will help you catch your simple mistakes.The way it is formated is in large chapter chunks.If your going to use this book prepare to sit down and study hard.If your lazy this book isn't for you, and perhaps the test isn't either.

The questions are much harder than the ap test's, espesialy the multiple choise, but so is almost any resource outside of college board.The biggest difference between the test and studying resources is ambiguity presenting the problems.This book has some but for the most part it's very precise.

If you are a programmer this book will continualy reinforce very usefull data structures, and the very simple very powerfull algorithms that are just so applicable.Kick [...] at the office. ... Read more

Product Description
These practice workbooks and guides contain essential information for those preparing for GRE subject tests, including practice questions, full-length practice tests that were actually administered at international GRE subject test administrations, answer sheets, correct answers, score conversion tables, and performance data for students who took the tests. ... Read more

Customer Reviews (10)

lousy
This book has numerous omissions. Do not rely entirely on this book, but supplement it with others that you can easily find by searching Google for CS GRE practice (including free practice materials from ETS).

By the way, For the general test, I found Powerprep Software: Test Preparation for the Gre General Test to be a worthwhile buy.

Save Your Money
Textbooks and notes from past classes would be far more helpful than this book. The only valuable pieces of information are the section describing the content of the test and the practice test. Both of these are available in the free booklet you can download at the GRE site. (The practice test is exactly the same.)

looking for CS GRE books? this might help
This books gives you general idea of test and let's you know what are the things you might not be prepared for. I don't have much else to say about this.

Well, I searched for CS GRE books everywhere, couldn't find any; but finally found few books which might be of help if you are giving CS GRE.

You mainly need books for

Introductory programming (Pascal and C)
Logic Design
Data Structures
Theory of Computation
Computer Architecture
Mathematics

some operating system and compiler

So get 5 solid books for these and you will be all set. And here are good books I found for preparing these topics. Finally :-( ( I have only a week left to prepare when I found these books)

Schaum's outline in digital logic
Schaum's outline essential computer mathematics

these two (above) are excellent

and
schaum's outline Data Structures in C++
schaum's outline Operating Systems
schaum's outline theory and problems

are good

All of these books have required theory in them, followed by problems and solutions. Very well explained, easy to follow and just the right amount of info needed for CS GRE.

Hope this helps. Good Luck ~ sameer

Other sources for help
My intention with this review is actually not to evaluate this book, but insteado to suggest to other graduate applicants some very interesting sources of information for the GRE/Computer Science test.

The first book I would like to recommend is Fundamentals of Data Structures, by Ellis Horowitz and Sartaj Sahni. It helped me to review subjects like binary trees, hashing, sorting, searching, and graphs.

The second recommendation is Compilers: Principles, Techniques and Tools, by Aho, A., R. Sethi, and D. Ullman. There are many questions related to context-free grammars in the exam, and this book helped me to solve many of sample questions in the GRE:Practicing to Take the Computer Science Test book.

There are some questions related to digital logic and binary arithmetics. One book very well written that could help on practicing binary operations is An Introduction to Computer Logic, by H. T. Nagle.

In addition, the test generally features some questions with a small algorithm or piece of program, written in C, Pascal or structured english. A very good book, which has helped me not only to practice for this questions, is The C Programming Language, by B. Kernighan and D. Ritchie.

Moreover, there are some questions related to computer architecture. A good source in this field is Computer Organization and Architecture, by W. Stallings.

Finally, a good book that covers almost all the subjects is Computer Science, an Overview, by J. Gleen Brookshear. It is a nice material for a final review, and also comes with questions/answers of binary arithmetics.

I hope this essay be helpful for you as a guide to find material to complement the practicing tests.

Useful, but only just
This book contains some sample questions on each topic of the GRE Computer Science Subject Test. After practicing these questions, one can try out the Full-length test which looks and feels exactly like the actual test.

Thisbook will be useful as a last minute review for the test. One can try to dothe sample test and measure oneself before the actual test. However, thedetails of the test and steps to prepare, etc are exactly the same as thoseon the Bulletin, which is availible for free download at gre.org oravailible when you apply for the test.

A more detailed specification ofthe syllabus and some more sample question will be worthy additions. ... Read more

Product Description

Distributed processing has a strong theoretical foundation, but many day-to-day practitioners make limited use of the advantages this theory can give them. The result includes unreliable systems with obscure and intermittent failures that can cost time, money and in extreme cases, lives. Reliable construction of distributed and concurrent systems must incorporate theory in practice.

This book provides a concise presentation of the theory closely linked to the practical realisation of these concepts. This easy-to-follow textbook focuses on practical issues of building working distributed systems and gives an overview of the basic theory, principles and techniques, whilst illustrating how these fit together, via the process of building interesting, non-trivial systems.

Topics and features:

• Provides all the elements needed for a complete development of a distributed system, from theory to practice

• Offers an integrated approach to the field of distributed processing, and presents a coherent view of the field as a practical subject

• Links theoretical models of concurrency with practical realisation of systems

• Contains many examples from C, Java Ada and Eiffel, as well as case studies

• Considers important aspects of the engineering process, including models that can be used to assess and analyse parts of distributed systems, implementation techniques, as well as protocols and security concerns

• Many pedagogical tools: chapter summaries, exercises (with sketch solutions and hints), comprehensive glossary, Internet support for students and instructors, accessible at http://www.scm.tees.ac.uk/p.j.brooke/dpb/.

• Ideal for use by lecturers as a coherent one-term course or module on distributed systems

Written with undergraduates in mind, especially relevant for intermediate-level students, this user-friendly textbook will prove a clear and comprehensive guide to the topic and the foundations for a methodological approach to building these systems.

Dr Phil Brooke is a lecturer in computer science at the University of Teesside, and Dr Richard Paige is a lecturer in computer science at the University of York. Both have extensive teaching experience, from which this textbook has grown.

Product Description
Explore 100 careers focused on computer and other technologies, assess which ones match your skills, and get the job you want quickly with this authoritative resource. In one time-saving volume, job seekers and students find everything they need to research careers; learn about pay, outlook, education, and skills for the 100 jobs; match their personal skills to the jobs; and take seven steps to land a good job in less time. ... Read more

Product Description
Theoretical computer science provides the foundations for understanding and exploiting the concepts and mechanisms in computing and information processing. This handbook will provide professionals and students with a comprehensive overview of the main results and developments in this rapidly evolving field. It consists of thirty-seven chapters in two volumes, all addressing core areas of theoretical computer science as it is practiced today. The material is written by leading American and European researchers, and each volume may be used independently.Volume A covers models of computation, complexity theory, data structures, and efficient computation in many recognized subdisciplines of theoretical computer science. Volume B presents a choice of material on the theory of automata and rewriting systems, the foundations of modem programming languages, logics for program specification and verification, and several chapters on the theoretic modeling of advanced information processing. The organization of each volume reflects the development of theoretical computer science from its classical roots to the modem theoretical approaches in parallel and distributed computing. Extensive bibliographies, a subject index, and list of contributors are included in each volume. ... Read more

Product Description
This new test preparation manual has an extensive review of all the AP Computer Science exam topics, including C++ language features, classes and objects, sorting and searching, programming methodology, algorithm analysis, recursion, and advanced data structures.

The book includes:
* 450 multiple-choice questions
* Four model AP Computer Science exams, two level A and two level AB
* Answers and explanations for all questions in the book
* Pointer implementation of stacks and queues for level AB

The book also includes the Marine Biology Case Study—a detailed review plus practice exam questions and explanations. There are 35 multiple-choice questions on the Case Study. ... Read more

Customer Reviews (12)

Helpful resource for my class
I wanted to try C++ and my school has an AP Computer Science course with C++ and introductory Java. I got this book and it was more helpful than the normal textbook my teacher gave us. I think all AP Computer Science students should take a look at this book.

Okay
This book is okay, but as another reviewer said there is a new Java edition, and plus there is no test taking tips.I don't know about you, but all test-prep books need study tips.

Good book, reusable, but not worth to buy
I have read this book, and this seem like a very good book for Advanced Placement computer Science.It probably reviews everything, and has good practice tests.I would advise you to buy this book, but there is one big problem with this book.
This book uses C++ instead of Java, the new language.If you have bought this book, and are waiting for this book to come to prepare, you are one of the most stupidest people in the world.But, if you have, not to worry.I read this book, and this book talks about "stuff"that you can use for learning Java.
There is a chapter on sorting, which is very helpful because it does not use C++ to fully explain it.It shows diagrams that make sense.You can also learn about programming analysis, and how to write programs, and stuff like that.Other than that, there is no reason to buy this book, unless you want to study for some college test in C++, but they will not use AP classes, unless they are stupid.
There are only three reasons to buy this book.

If you are rich and want to waste money
If you are stupid, and have bought this book already
Or if your C++ class uses AP like tests, for which they must be stupid

If you have not been listed above, then buy the new version of this book.

HEAPS RULE

From a students perspective
At my school we have a year round course of AP computer science, this class has a lot of resources for C++ and the AP exam.None of these, which include, Gary and Maria Litvin's books, to Dr. Owen Astrachan books.This books includes teaching, review, and multiple choice questions. It will be all you need for the exam whether your taking the A or AB.

The only book you'll need!
This is the ONLY book you'll ever need to prepare for the AP Computer Science A Exam.I don't know about the AB Exam, but for the A Exam, this is ALL you'll need.I took the A Exam this past May and attribute my score of 5 to this book.

The book provides a detailed and descriptive review of all the A Exam topics that you'll need to know.The Book is strong in all topics including the Case Study except for the chapter on Sorting and Searching.That topic will require further study to master, as it is the hardest topic on the exam (at least for most people.)However, all other topics are covered very well and in great detail.You'll know all the details for the A Exam.The practice questions and practice exams are also great.I studied them over and over until I could answer every question correctly.The questions are harder than the actual exam, so when you get to exam day, the test will feel so easy to you.

This book, plenty of hard work in April, and detailed study of the Case Study PDF file and source code will bring you an easy 5 on the A Exam! ... Read more

Product Description

* The first exposition on super-recursive algorithms, systematizing all main classes and providing an accessible, focused examination of the theory and its ramifications

* Demonstrates how these algorithms are more appropriate as mathematical models for modern computers and how they present a better framework for computing methods

* Develops a new practically-oriented perspective on the theory of algorithms, computation, and automata, as a whole

Product Description
Covers computer science fundamentals using C++ and is appropriate for a variety of C++ courses.Thistextbook is designed to help students prepare for the Advanced Placement Test for C++ (A and AB). ... Read more

Customer Reviews (7)

teacher uses in High School Classroom
This is a good book, I teach and use it in a high school classroom.
Good explinations for beginner programmer, (minor changes needed to code since book has been out a long time... i.e. 'using namespace std').Code examples download_able from the internet.

Good If You Have No Computer Programming Experience
I used this book at the University level in an Introduction to Computer Science class. Having never taken any sort of computer programming before, I found it easy to read and follow. Loved the step by step programs with each section.

Good learning
Both as a reference and an introduction to various subjects, this book has served well as out C++ class's primary textbook. It has projects at the end that you have to learn from even if you couldn't quite get the rest of it. Excellent stuff.

This is a great book.
Introduction to Computer Science Using C++ is a great textbook.I am currently a Junior at Fairfield High School and this is my textbook for my Computer Science II class.We're preparing to take the AP test and this text has done an astounding job.While books such as Sam's Teach Yourself C++ in 21 Days Third Edition may be a better choice, this is still a great source for learning C++.It covers a wide range of topics, from file I/O to matrices, vectors, and more.If you're looking for a book that's easy to understand, this book is definitely a great buy for you.

Not adequate for AP Computer Science
We use this book in our AP Computer Science class, and although it is easy to read, it lacks a lot of detail.I do not recommend this book to anyonestudying for the AP Computer Science AB exam. ... Read more

Product Description
"Of all the books I have covered in the Forum to date, this set is themost unique and possibly the most useful to the SIGACT community, insupport both of teaching and research.... The books can be used byanyone wanting simply to gain an understanding of one of these areas, orby someone desiring to be in research in a topic, or by instructorswishing to find timely information on a subject they are teachingoutside their major areas of expertise." -- Rocky Ross, SIGACT News"This is a reference which has a place in every computer sciencelibrary." -- Raymond Lauzzana, Languages of Design

The Handbook of Theoretical Computer Science provides professionals andstudents with a comprehensive overview of the main results anddevelopments in this rapidly evolving field. Volume A covers models ofcomputation, complexity theory, data structures, and efficientcomputation in many recognized subdisciplines of theoretical computerscience. Volume B takes up the theory of automata and rewriting systems,the foundations of modern programming languages, and logics for programspecification and verification, and presents several studies on thetheoretic modeling of advanced information processing. The two volumescontain thirty-seven chapters, with extensive chapter references andindividual tables of contents for each chapter. There are 5,387 entrysubject indexes that include notational symbols, and a list ofcontributors and affiliations in each volume. ... Read more

Customer Reviews (2)

Just what you expect from a handbook
This is probably the best or may be the only handbook on theeretical computer science.If one wants to get a good idea on any topic in this field, just open the book and you do not have to run around looking into different books.

On the other hand, this is a huge field, and no handbook can put all of this in one book.I found that many topics that I was looking in were not in good detail at all.For instance I was looking in Fortune's voronoi construction, the terse way of explaining things does not give the reader enough insight.

A book well worth putting on your shelf.
This book is a collection of articles on complexity theory written by a number of very competent authors. The article by Li/Vitanyi on Kolmogorov complexity and the article by Aho on pattern matching in strings stand outin particular. All articles however are very well written and packed fullof useful information, even for readers who are mainly interested inapplications. Extensive references are found at the end of each article,lightening the burden of doing further reading on the topics. ... Read more

Product Description
Category theory is a branch of pure mathematics that is becoming an increasingly important tool in theoretical computer science, especially in programming language semantics, domain theory, and concurrency, where it is already a standard language of discourse. Assuming a minimum of mathematical preparation, Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Four case studies illustrate applications of category theory to programming language design, semantics, and the solution of recursive domain equations. A brief literature survey offers suggestions for further study in more advanced texts.

Contents: Tutorial. Applications. Further Reading. ... Read more

Customer Reviews (8)

nice and slim (the text is only ~70 pages)!
I'm still a beginner at category theory, but I'd like to say this is a nice textbook.The examples are easy to follow (mainly basic set theory), for people with a com sci background.

A later section explains CCCs (Cartesian closed categories) and its isomorphism to typed lambda calculus.I don't fully grasp the details but this is a very important result in higher-order logic, particularly because the substitution mechanism of lambda calculus can be modeled by category theory.

A Good Read
This book is not exactly what I would call easy going. I've managed to get through half of it in 7 months. However, I can say, with absolute confidence, that if you do the problems you will learn.

Most everything I've seen on category theory is a confusing mixture of different notations with seemingly identical meanings (but in fact the meanings are totally different). This book is no exception. Often, I have resorted to IRC to sort things out when some notation is simply impenetrable to me. My mathematical training stopped at complex calculus, so this may not apply to you if you've had abstract algebra or something a little more 'meta'.

There seems to be one typographical error, but I am not sure. In the example on the adjunction between products and exponentiation, the right adjoint is listed as "(_)^A x A" but in the diagrams it ends up as "(_)^A". This may be a sensible ellision, but it is not explained anywhere in the text and of it's not easy to find these things on the internet.

Good Introduction
I have been reading several different category theory texts recently, and this one was very succinct and accessible.Particularly useful for understanding functional programming.

Basic crib sheet for category theory
Anyone coming to this book from Pierce's "Types and Programming Languages" will be disappointed. While his "Types ..." book is a model of clear exposition, this book reads like a set of notes jotted down on the back on an envelope. The extensive bibliographic sections are more than fifteen years out of date. Much of the material referenced is no longer in print, and recent developments are, of course, not mentioned. Those seeking a very gentle introduction to category theory would do better with the book by Lawvere and Schanuel, who cover more of category theory than Pierce. Mathematically mature computer science readers will find everything they need to know about the subject in Mac Lane's book.

Really expensive for a set of notes...
You can find better introductions to category theory available on the net for free.Try searching for Lambert Meertens, Marten Fokkinga, and Jaap Van Oosten, for example.Or Barr and Wells, Triples, Toposes, and Theories.Or Asperti and Longo.Or watch Eugenia Cheng's videos on YouTube, which are fantastic.

But if you want to buy a book, get Barr and Wells, Category Theory for Computing Science.Unfortunately, you have to order it directly from the University of Montreal.It's a great book, by far the best intro to category theory available, *way* better than this!Then, after that, you can read MacLane... ... Read more

Product Description
"A Computer Science Tapestry" is designed for use in a first course in computer science (CS1) that uses C++ as its programming language. This book covers basic concepts in programming, program design and computer science along with giving students a good introduction to the C++ language. In the new edition, Astrachan has put more emphasis on object-oriented programming by introducing a graphics library and including a new chapter on object-oriented techniques. He has also added new case studies and "design tips". ... Read more

Customer Reviews (17)

This is what distinguishes learners from procrastinators
I have taught programming for almost 10 years now. I have used many books which aim to teach students the basics of many programming languages - take the Deitel 'How to Program' series for example. The author's approach in explaining the basics of programming using an object oriented approach is fully-fledged (please read its preface before making any unnecessary comments). Students learn to read and understand class descriptions and implementations. After exposure to many classes in the first couple of chapters, students learn to design their own simple classes and work with them from scratch. The author's discussion of recursion, inheritance and polymorphism is also classical. After teaching an introductory class with this book, my students have always found the move to Java much easier.

Outraged
Having received this book as a gift I really did not lose anything of value except for my time. No other book has fueled my outrage over its production than this one. I thought I was going to cherish a "Tapestry", especially a free one... When I first got the book, I came here and read the reviews.. and gave the author the benefit of the doubt and said eh, everyone's got an opinion. Let me tell you straight out EVERY negative review here is right on. I have no reason to bash this book other than the facts, as I said before I didn't pay for it. Thank goodness. I felt so ill toward it I wrote to Owen himself. Among the things stated already by past reviews, my most major gripe is that code is scattered about with no real order whatsoever. He gives you a website to download more code.. has a How to G appendix which supposedly has even more code.. yet I guarantee you, you are going to find #include's that are not found anywhere listed above. Not in the appendix, the book content or his site. So what gives? Was this an attempt to influence the budding programmer to develop his/her own classes and header files? I have a strong C background and if he wanted me to dream up these missing files, there's no way I could without advanced knowledge of C++. This is a beginner's book.. so I feel this author meant for the code to not actually be typed by a programmer and run.. but to be looked at and studied by theory. Garbage. Don't waste your time.

His Editor Should Be Hanged
The book " CS Tapestry" often highlights terminology which isn't defined and then uses these terms for explanations in the text. It should have a glossary of terms and definitions and its editor should be hanged.The book should be written for a beginner's point of view. It's marketed as an introduction to the whole field -but gives little attention to the wider tapestry.
I spent close to 100 dollars for this book and must invest extra money in supplemental books just to pass the course. He has written a book for beginner computer scientists that can only be understood by computer scientists. This takes no skill at all.

This is the worst book ever
this is the worst book I have ever read. this book is definitely not for beginners. the author introduced classes at the biginning of the book.the university i am attending is using this book, I have never find anystudent who likes this book. even my intructor said this book is not book. I do not recomment this book. i give this book 1 over 100. take my advice if you are a novice

Great Practice Book, but
You wouldn't want to go read a hundred page worth of reading, and yet you only learned a mere something. The chapters have programs that you WILL NEVER use if you are planning to do a lot of C++ hardwork. For a 655-page book, it's not worth the time. Some books cover the very basic in chapter 2 and/or chapter 3, and you get a firm foundation on the basic concepts. ... Read more