Data Structures And Algorithm Analysis In C By Mark Allen Weiss

[Filomeno Robles]

DataStructures and Algorithm Analysis in Java is an "advanced algorithms" book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math.

As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java.

Weiss clearly explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text's coverage.

As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs using the C++ programming language.

This book explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm.

This course covers more advanced data structures, well-known algorithms, algorithm design techniques, algorithm analysis, and mathematics related to selected algorithms. The goal is to help students learn to write and analyze efficient programs that solve common and difficult problems. Data structures covered include representations of graphs, binary search trees, balanced binary search trees, AVL trees, heaps, and hash tables. Well-known algorithms covered include several sorting algorithms (such as insertion sort, merge sort, and Shell sort), binary search, and a sampling from other areas such as graph algorithms and NP-hard problems. Mathematics related to advanced algorithms and data structures will also be investigated. Mathematics covered may include, but are not limited to, probability and its application to Bayesian networks, Markov chains and decision processes, and Monte Carlo simulations; introduction to machine learning; and applications of linear algebra. Algorithm design techniques the students will practice include dynamic programming, divide-and-conquer, and greedy techniques.

Making efficient use of computational resources is one of the important tasks of any computer scientists. In this course we will explore different ways of organizing data to facilitate such sufficient use. This course covers the following topics:

The objective of the course is to teach students how to design, write, and analyze the performance of C/C++ programs that handle structured data and perform more complex tasks, typical of larger software projects. Students should acquire skills in using generic principles for data representation and manipulation with a view for efficiency, maintainability, and code-reuse. Successful students will, at the end of the course, be able to demonstrate analytical comprehension of concepts such as abstract data types (vectors, lists, deques, trees, etc.), generic programming techniques (containers, adaptors, accessing data through interface, iterators, etc.), algorithms (sorting, using stacks and queues, tree exploration algorithms, etc.), and efficiency analysis (which data structures allow efficient interfaces to particular forms of data access, such as random vs. sequential data access or insertion). The students should be able to demonstrate similar skills in related implementation tasks in the C/C++ language, including extensive use of templates to allow for modularity and re-usability of code.

NOTE: The programming assignments are substantially harder than those in the previous programming courses, and will require substantially more time and effort to complete. You need to immediately start working on a programming assignment as soon as it is announced.

Compiling programming assignments -- Programs that do not compile successfully on linprog will receive at most 10% of the total grade for the program. Any program that compiles without any compilation error on linprog will receive at least 15% of the total grade for the program. Make sure your code compiles before you submit it! You also need to make sure that you include a proper makefile for the TAs to compile your program on linprog.

In this second edition of his best-selling book, Data Structures and Algorithm Analysis in C, Mark Allen Weiss, continues to refine and enhance his innovative approach to algorithms and data structures. Using a C implementation, he highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. Dr. Weiss also distinguishes Data Structures and Algorithm Analysis in C with the extensive use of figures and examples showing the successive stages of an algorithm, his engaging writing style, and a logical organization of topics.

ACM, the world's largest educational and scientific computing society, delivers resources that advance computing as a science and a profession. ACM provides the computing field's premier Digital Library and serves its members and the computing profession with leading-edge publications, conferences, and career resources.

ACM offers the resources, access and tools to invent the future. No one has a larger global network of professional peers. No one has more exclusive content. No one presents more forward-looking events. Or confers more prestigious awards. Or provides a more comprehensive learning center.

For more than 60 years, the best and brightest minds in computing have come to ACM to meet, share ideas, publish their work and change the world. ACM's publications are among the most respected and highly cited in the field because of their longstanding focus on quality and their ability to attract pioneering thought leaders from both academia and industry.

ACM's Special Interest Groups (SIGs) represent major areas of computing, addressing the interests of technical communities that drive innovation. SIGs offer a wealth of conferences, publications and activities focused on specific computing sub-disciplines. They enable members to share expertise, discovery and best practices.

The ACM Learning Center offers ACM members access to lifelong learning tools and resources. Our E-Learning collections offer complimentary access to more than 80,000 online books, courses, and videos from top content publishers. The ACM TechTalk series brings leading computing luminaries and visionaries to your screen. Members enjoy exclusive offers and discounts on IT industry certifications and vendor-specific training.

ACM provides independent, nonpartisan, and technology-neutral research and resources to policy leaders, stakeholders, and the public about public policy issues, drawn from the deep technical expertise of the computing community.

Anyone, from any background, should feel encouraged to participate and contribute to ACM. ACM is committed to creating an environment that welcomes new ideas and perspectives, and where hostility or other antisocial behaviors are not tolerated.

When you chaired the Advanced Placement (AP) CS Development Committee in the early 2000s, the exam design was changing from C++ to Java and the underlying curriculum was putting greater emphasis on object-oriented design and abstraction principles. What prompted these changes?

The principal investigator (PI)/lead on the project is Adrienne Decker from the University of Buffalo, and I am the co-PI. The idea was to bring leaders in computing education together in a forum to discuss and workshop the ideas of what the research themes in computing education will be (or should be) for the next 15 years, and to suggest concrete pathways for addressing the research challenges identified, in part to help the NSF set some funding priorities. We were able to convince about 40 leading CS education researchers to work with us. Ideally this would have been an in-person meeting, but we have been doing everything via Zoom so far. We are at the point of refining materials on a website and writing a coherent report, which we hope to release by the end of the year.

In your efforts to diversify the computer science student body at Florida International University, what have been some effective approaches in increasing the four- and six-year graduation rates for students from traditionally underrepresented groups?

Mark Allen Weiss is a Professor and Associate Dean of Undergraduate Education at Florida International University. His research interests include data structures, algorithms, and computer science education. He is most well-known for his sole-authored Data Structures textbooks, which are among the most-widely used in computer science. His books include C++ for Java Programmers, Data Structures and Problem Solving (two programming languages in six editions), Data Structures and Algorithm Analysis (five programming languages in twelve editions), and Efficient C Programming: A Practical Approach.

Beginning in the late 1990s, Weiss was part of the Advanced Placement (AP) CS Development Committee that designed the AP curriculum and wrote the AP exams taken by US high school students. Presently, he is co-leading a project to help the US National Science Foundation set priorities for CS education research. Weiss received the ACM Karl V. Karlstrom Outstanding Educator Award for advancing the art and science of computer science (CS) education through his textbooks, research, and curriculum design which have affected thousands of instructors and students worldwide.

3a8082e126