Domain Specific Development with Visual Studio DSL Tools or Algorithms in C Parts 1 4

Domain Specific Development with Visual Studio DSL Tools

Author: Steve Cook

Domain-Specific Languages (DSLs)--languages geared to specific vertical or horizontal areas of interest--are attracting growing excitement from software engineers and architects. DSLs bring new agility to the creation and evolution of system requirements and simplify their translation into code, significantly reducing development costs in large-scale projects. In this breakthrough book, four leading experts reveal exactly how DSLs work, and how you can make the most of them in your environment.

You'll begin by mastering DSL concepts and techniques that apply to all platforms. Next, discover how to create and use DSLs with the powerful new Microsoft DSL Tools--a toolset designed by this book's authors. Learn how the Microsoft DSL Tools integrate into Visual Studio 2005--and how to define DSLs and generate Visual Designers using Visual Studio's built-in modeling technology. In-depth coverage includes

• Determining whether DSLs will work for you
• Comparing DSLs with other approaches to model-driven development
• Defining, tuning, and evolving DSLs: models, presentation, creation, updates, serialization, constraints, validation, and more
• Creating Visual Designers for new DSLs with little or no coding
• Multiplying productivity by generating application code from your models with easy-to-use text templates
• Automatically generating configuration files, resources, and other artifacts
• Deploying Visual Designers across the organization, quickly and easily
• Customizing Visual Designers for specialized process needs

The book's companion Web site (domainspecificdevelopment.com) includescode samples, plus additional resources and information.

Look this: The Magic of Digital Printing or Data Mining for Business Intelligence

Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching

Author: Robert Sedgewick

Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.

Booknews

Covers data structure, sorting, and searching algorithms using the C computer language. Combining theory and practice, the volume uses many examples to discuss fundamentals, abstract data types, recursion, trees, quicksort, mergesort, heapsort, priority queues, radix sort and search, special-purpose sorts, symbol tables, balanced and binary search trees, hashing, and external searching. Annotation c. by Book News, Inc., Portland, Or.

Table of Contents:

Ch. 1	Introduction	3
Ch. 2	Principles of Algorithm Analysis	27
Ch. 3	Elementary Data Structures	69
Ch. 4	Abstract Data Types	127
Ch. 5	Recursion and Trees	187
Ch. 6	Elementary Sorting Methods	253
Ch. 7	Quicksort	303
Ch. 8	Mergesort	335
Ch. 9	Priority Queues and Heapsort	361
Ch. 10	Radix Sorting	403
Ch. 11	Special-Purpose Sorts	439
Ch. 12	Symbol Tables and BSTs	477
Ch. 13	Balanced Trees	529
Ch. 14	Hashing	573
Ch. 15	Radix Search	609
Ch. 16	External Searching	655
	Index	693