• Corpus ID: 12098456

Data structures, algorithms, and software principles in C

@inproceedings{Standish1995DataSA,
  title={Data structures, algorithms, and software principles in C},
  author={Thomas A. Standish},
  year={1995}
}
Using C, this book develops the concepts and theory of data structures and algorithm analysis step by step, proceeding from concrete examples to abstract principles. The material is unified by the use of recurring themes such as efficiency, recursion, representation and trade-offs. Important software engineering concepts are also covered, including modularity, abstract data types and information hiding, as well as new developments such as risk-based software, life cycle models and object… 

Memory as a Programming Concept in C and C

TLDR
From source file to executable file, dynamic allocation and deallocation of memory, and programs in execution - processes and threads.

Private Detectives In A Data Warehouse : Key-Indexing , Bitmapping , And Hashing

TLDR
SAS arrays are viewed as a DATA step structure ideally suited for quick data lookup based on the idea of direct addressing, and three such techniques key-indexing, bitmapping, and hashing are considered in their logical sequence using a real-life example of matching data files by a common key.

Crafting Your Own Index: Why, When, How

TLDR
This is a how-to paper about “external” indexing, which means being no longer tied to a particular search algorithm or storage medium, you can let your programming fancy fly, the power of the SAS language being at your disposal.

Need a Speedy Index? RAM It!

TLDR
This is a how-to paper about “external” indexing, where the disk-resident index file yields to a memory-based look-up returning a file pointer.

Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering

TLDR
It turns out that small design decisions in how deletions are implemented have dramatic effects on the asymptotic performance of insertions, and a new variant of linear probing is presented, which is called graveyard hashing, that completely eliminates primary clustering on any sequence of operations.

DIRECT ADDRESSING TECHNIQUES OF TABLE LOOK-UP PART 1 . KEY-INDEXING-BITMAPPING PART 2 . HASHING

TLDR
This paper shows how arrays can be used to organize the fastest class of in-memory table look-up -direct-address searching, and shows that home-cooked direct addressing methods beat even the quickest readyto-go tools like the "large formats" by a wide margin.

Overview of Design, Lifecycle, and Safety for Computer-Based Systems

This document describes the need and justification for the development of a design guide for safety-relevant computer-based systems. This document also makes a contribution toward the design guide by

Sequential testing policies for complex systems under precedence constraints

  • Wenchao WeiK. CoolenR. Leus
  • Computer Science, Mathematics
    2012 IEEE International Conference on Industrial Engineering and Engineering Management
  • 2012

Project Scheduling with Modular Project Completion on a Bottleneck Resource

TLDR
This paper describes various policy classes, establishes the relationship between the classes, develops exact algorithms to optimize over two different classes (one dynamic program and one branch-and-bound algorithm), and examines the computational performance of the algorithms on two randomly generated instance sets.

QUICK DISK TABLE LOOKUP VIA HYBRID INDEXING INTO A DIRECTLY ADDRESSED SAS DATA SET

TLDR
This paper proposes to structure the lookup file for rapid direct addressing via a hash index, which is ‘good’ regardless of the search key distribution: Each discrete index value points to about the same number of search keys.