Data and algorithms. An introductory course. With 1 CD-ROM (Q2701794)

This is a textbook on data structures and algorithms intended for first year computer science students, as well as students of other fields, and professionals who are interested in this important subject of computer science. It asks for some basic knowledge in programming, and in ``third level mathematics,'' which, after many unsuccessful efforts of seeking clarification, I would presume means pre-calculus.NEWLINENEWLINENEWLINEAfter two chapters on such related topics as data, information, and data storage devices, and an overview chapter (Chapter 3), the book covers some of the traditional subjects of this field. In Chapter 4 (Efficiency measures of algorithms), it scratches the surface of algorithm analysis, by explaining the need for formal notations, and then defining the ``Big-O'' notation, and wrapping it up with a few general application rules. A chapter on internal sorting follows, in which most of the often used \(O(n^2)\) sorting algorithms such as Insertion sort, Selection sort, and Bubble sort, are presented, and are indeed analyzed to some degree. A few \(O(n\log n)\) algorithms such as Quick sort, Tree sort, and Heap sort, are also discussed, and analyzed. The book then proceeds to a unit on the list structures. It starts with an introduction of the list type, and its array and linked list implementation, in Chapter 6, and continues with some list-based search algorithms (sequential and binary search) in Chapter 7, and ends up with a discussion of relevant issues, particularly, management of list structures in external storage devices. The final chapter is on graphs and trees. It does discuss some of the tree based topics, such as the representation and traversal of, and the search operation in, binary trees. It also explores the practical side of both AVL and B-trees in some detail. It merely gets started with the rich field of the graph structure and the associated algorithms. It only shows a few examples, and asks a few motivating questions.NEWLINENEWLINENEWLINEThe book comes with a CD, which has three components: a glossary of all the terms used in the book, a collection of some advanced exercises, and an abridged e-version of the book. The latter contains animations of many algorithms discussed in the book. The CD is intended for Microsoft Internet Explorer, but I could not make it work. I then switched to Netscape Navigator, and everything worked smoothly. I found the animations run rather slowly, but they would definitely help students.NEWLINENEWLINENEWLINEI personally will not adopt this book for our data structure and algorithm analysis course, which our students usually take in the second semester of their sophomore year. It is just too terse, with about 150 pages, and does not contain enough material as it should be covered in such a course.