Best of Ruby Quiz, Volume 1 (2006).Pdf

Total Page:16

File Type:pdf, Size:1020Kb

Best of Ruby Quiz, Volume 1 (2006).Pdf Best of Ruby Quiz Volume One James Edward Gray II The Pragmatic Bookshelf Raleigh, North Carolina Dallas, Texas P r a g m a t i c B o o k s h e l f Many of the designations used by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in this book, and The Pragmatic Programmers, LLC was aware of a trademark claim, the designations have been printed in initial capital letters or in all capitals. The Pragmatic Starter Kit, The Pragmatic Programmer, Pragmatic Programming, Pragmatic Bookshelf and the linking g device are trademarks of The Pragmatic Programmers, LLC. Every precaution was taken in the preparation of this book. However, the publisher assumes no responsibility for errors or omissions, or for damages that may result from the use of information (including program listings) contained herein. Our Pragmatic courses, workshops, and other products can help you and your team create better software and have more fun. For more information, as well as the latest Pragmatic titles, please visit us at http://www.pragmaticprogrammer.com Copyright © 2006 The Pragmatic Programmers LLC. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmit- ted, in any form, or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior consent of the publisher. Printed in the United States of America. ISBN 0-9766940-7-7 Printed on acid-free paper with 85% recycled, 30% post-consumer content. First printing, February 2006 Version: 2006-3-14 Contents 1 Introduction 1 I The Quizzes 5 1. Mad Libs ............................ 6 2. LCD Numbers ......................... 8 3. GEDCOM Parser ....................... 9 4. Animal Quiz .......................... 11 5. Scrabble Stems ........................ 13 6. Regexp.build() ......................... 14 7. HighLine ............................ 16 8. Roman Numerals ....................... 18 9. Rock Paper Scissors ..................... 20 10. Knight’s Travails ....................... 25 11. Sokoban ............................ 27 12. Crosswords .......................... 29 13. 1-800-THE-QUIZ ....................... 31 14. Texas Hold’em ........................ 33 15. Solitaire Cipher ........................ 36 16. English Numerals ...................... 41 17. Code Cleaning ........................ 42 18. Banned Words ........................ 44 19. Secret Santas ......................... 46 20. Barrel of Monkeys ...................... 48 21. Amazing Mazes ........................ 50 22. Learning Tic-Tac-Toe .................... 52 23. Countdown .......................... 53 24. Solving Tactics ........................ 55 25. Cryptograms ......................... 57 CONTENTS v II Answers and Discussion 60 1. Mad Libs ............................ 61 Custom Templating ..................... 62 Mini Libs .......................... 66 Additional Exercises .................... 67 2. LCD Numbers ......................... 68 Using Templates ...................... 68 On and Off Bits ....................... 70 Using a State Machine ................... 72 Additional Exercises .................... 75 3. GEDCOM Parser ....................... 76 Optimizing the Read and Write Cycles ........... 77 Additional Exercises .................... 80 4. Animal Quiz .......................... 81 Arrays Instead of Custom Objects ............. 84 Leaving the Trees ...................... 87 Additional Exercises .................... 88 5. Scrabble Stems ........................ 89 Eating Less RAM ...................... 90 Additional Exercises .................... 92 6. Regexp.build() ......................... 93 Shrinking a Regexp ..................... 94 Speeding Up the Build ................... 97 Timing the Solutions .................... 99 Additional Exercises .................... 100 7. HighLine ............................ 101 A Class-Based Solution ................... 101 Testing I/O ......................... 104 The Official HighLine .................... 106 Additional Exercises .................... 111 8. Roman Numerals ....................... 112 Saving Some Memory .................... 113 Romanizing Ruby ...................... 115 Additional Exercises .................... 120 9. Rock Paper Scissors ..................... 121 Outthinking a Random Player ............... 122 Cheat to Win ........................ 124 Psychic Players ....................... 125 Thinking Outside the Box ................. 126 Additional Exercises .................... 126 Report erratum CONTENTS vi 10. Knight’s Travails ....................... 127 Or with Less Abstraction .................. 131 Additional Exercises .................... 132 11. Sokoban ............................ 134 Objectified Sokoban .................... 136 Saving Your Fingers .................... 142 Additional Exercises .................... 143 12. Crosswords .......................... 145 Passive Building ...................... 148 Additional Exercises .................... 152 13. 1-800-THE-QUIZ ....................... 153 Word Signatures ...................... 153 The Search ......................... 155 Cleaning Up and Showing Results ............. 157 Additional Exercises .................... 159 14. Texas Hold’em ........................ 160 Ruby’s Sorting Tricks .................... 160 Sorting Cards ........................ 161 Name the Hand ....................... 162 Additional Exercises .................... 165 15. Solitaire Cipher ........................ 166 Testing a Cipher ...................... 166 A Deck of Letters ...................... 170 A Test Suite and Solution ................. 173 Additional Exercises .................... 175 16. English Numerals ...................... 176 Grouping Numbers ..................... 176 Coding an Idea ....................... 177 Proper Grammar ...................... 179 Additional Exercises .................... 182 17. Code Cleaning ........................ 183 Instant Web Serving .................... 183 Finding the Hidden Wiki .................. 184 The Other Program ..................... 188 Additional Exercises .................... 190 18. Banned Words ........................ 191 Doing Even Fewer Checks ................. 193 Additional Exercises .................... 194 Report erratum CONTENTS vii 19. Secret Santas ......................... 195 Using a Random Sort .................... 197 A Ring of Players ...................... 197 Grouping .......................... 198 Climbing a Hill ....................... 200 Additional Exercises .................... 201 20. Barrel of Monkeys ...................... 203 Fancy Searching ...................... 207 Additional Exercises .................... 213 21. Amazing Mazes ........................ 214 The Internal Bits ...................... 214 Making a Maze ....................... 219 Solving a Maze ....................... 220 Interface .......................... 222 Additional Exercises .................... 223 22. Learning Tic-Tac-Toe .................... 225 The History of MENACE .................. 232 Filling a Matchbox Brain .................. 232 Ruby’s MENACE ...................... 236 Additional Exercises .................... 238 23. Countdown .......................... 239 Pruning Code ........................ 240 Coding Different Strategies ................. 244 Additional Exercises .................... 247 24. Solving Tactics ........................ 249 From Playing to Solving .................. 252 Proof through Unit Testing ................. 255 Additional Exercises .................... 258 25. Cryptograms ......................... 259 Using Word Signatures ................... 259 Building the Map ...................... 261 Assembling a Solution ................... 264 A Look at Limitations .................... 269 Additional Exercises .................... 269 A Resources 270 A.1 Bibliography ......................... 270 Report erratum Chapter 1 Introduction If you stop and think about it, programming knowledge is nearly use- less by itself. What exactly are you going to create with all that expert programming skill, if it’s all you have? The world needs only so many text editors. What makes the craft interesting is how we apply it. Combine program- ming prowess with accounting practices or even just a need to reunite hurricane victims with their scattered family members, and you have the makings of a real, and potentially useful, application. Practical programming experience can be surprisingly hard to come by. There are classes and books to give us theory and syntax. If you’ve been a programmer for any amount of time, you will have read plenty of those books. Then what? I think most of us inherently know that the next step is to write something, but many of us struggle to find a topic. I love games. I’m always playing something, and struggling to put together a winning strategy never quite feels like work to me. I use that to make myself a better programmer. I play games with my code. I assign myself a task I’ve never tried before, perhaps to get more famil- iar with an algorithm or a library. Or sometimes I’ll give myself a com- pletely routine task but add an unusual twist: implement this full- featured trivial program in one hour or less. This is my form of practice for the big game. I find what works and even what doesn’t.1 I memorize idioms I like, just in case I run into a 1True story: I’m still struggling with one programming problem I’ve been playing with for about ten years now. I’ve never found a solution
Recommended publications
  • Effectiveness of Essential Oils from Citrus Sinensis and Calendula Officinalis and Organic
    Cantaurus, Vol. 28, 20-24, May 2020 © McPherson College Department of Natural Science Effectiveness of essential oils from Citrus sinensis and Calendula officinalis and organic extract from fruits of Maclura pomifera as repellants against the wolf spider Rabidosa punctulata Garrett Owen ABSTRACT The essential oils (EO’s) of Citrus sinensis, Calendual officinalis, and Maclura pomifera were extracted via either steam distillation or organic extraction and tested for their repellency effect on the wolf spider, Rabidosa punculata. Essential oil repellency was tested in a Y-maze fumigation test and a filter paper contact test. The data collected was subjected to statistical analysis; the results from the binomial test of the fumigation trials data suggest no significant repellant activity of the fumes of any of the EO’s extracted. Although, Citrus sinensis EO’s presented hope for further studies. Results from the Wilcoxon rank sum test of the contact trials data showed Calendula officinalis as an effective deterrent against Rabidosa punctulata while the other two EO’s showed no significant effects. The isolated EOs from each plant were analyzed using GC/MS to identify the major compounds present. Results from the GC/MS showed d-Limonene to be the major component of Citrus sinensis at 92.56% while major components of Maclura pomifera were (1S)-2,6,6-Trimethylbicyclo[3.1.1]hept-2-ene at 18.96%, 3-Carene at 17.05%, Cedrol at 16.81%, and a-Terpinyl acetate at 5.52%. It was concluded that d- Limonene is a common ingredient in many insect repellants, but exists as a component of a mixture of several chemicals.
    [Show full text]
  • The Bulletin of the American Society of Papyrologists 44 (2007)
    THE BULLETIN OF THE AMERICAN SOCIETY OF PapYROLOGIsts Volume 44 2007 ISSN 0003-1186 The current editorial address for the Bulletin of the American Society of Papyrologists is: Peter van Minnen Department of Classics University of Cincinnati 410 Blegen Library Cincinnati, OH 45221-0226 USA [email protected] The editors invite submissions not only fromN orth-American and other members of the Society but also from non-members throughout the world; contributions may be written in English, French, German, or Italian. Manu- scripts submitted for publication should be sent to the editor at the address above. Submissions can be sent as an e-mail attachment (.doc and .pdf) with little or no formatting. A double-spaced paper version should also be sent to make sure “we see what you see.” We also ask contributors to provide a brief abstract of their article for inclusion in L’ Année philologique, and to secure permission for any illustration they submit for publication. The editors ask contributors to observe the following guidelines: • Abbreviations for editions of papyri, ostraca, and tablets should follow the Checklist of Editions of Greek, Latin, Demotic and Coptic Papyri, Ostraca and Tablets (http://scriptorium.lib.duke.edu/papyrus/texts/clist.html). The volume number of the edition should be included in Arabic numerals: e.g., P.Oxy. 41.2943.1-3; 2968.5; P.Lond. 2.293.9-10 (p.187). • Other abbreviations should follow those of the American Journal of Ar- chaeology and the Transactions of the American Philological Association. • For ancient and Byzantine authors, contributors should consult the third edition of the Oxford Classical Dictionary, xxix-liv, and A Patristic Greek Lexi- con, xi-xiv.
    [Show full text]
  • Bash Guide for Beginners
    Bash Guide for Beginners Machtelt Garrels Garrels BVBA <tille wants no spam _at_ garrels dot be> Version 1.11 Last updated 20081227 Edition Bash Guide for Beginners Table of Contents Introduction.........................................................................................................................................................1 1. Why this guide?...................................................................................................................................1 2. Who should read this book?.................................................................................................................1 3. New versions, translations and availability.........................................................................................2 4. Revision History..................................................................................................................................2 5. Contributions.......................................................................................................................................3 6. Feedback..............................................................................................................................................3 7. Copyright information.........................................................................................................................3 8. What do you need?...............................................................................................................................4 9. Conventions used in this
    [Show full text]
  • Dungeon Solitaire LABYRINTH of SOULS
    Dungeon Solitaire LABYRINTH OF SOULS Designer’s Notebook by Matthew Lowes Illustrated with Original Notes Including a History and Commentary on the Design and Aesthetics of the Game. ML matthewlowes.com 2016 Copyright © 2016 Matthew Lowes All rights reserved, including the right to reproduce this book, or portions thereof, in any form. Interior design and illustrations by Matthew Lowes. Typeset in Minion Pro by Robert Slimbach and IM FELL English Pro by Igino Marini. The Fell Types are digitally reproduced by Igino Marini, www.iginomarini.com. Visit matthewlowes.com/games to download print-ready game materials, follow future developments, and explore more fiction & games. TABLE OF CONTENTS Introduction . 5 Origins . 5 Tomb of Four Kings . 7 Into the Labyrinth . 10 At the Limit . 13 Playing a Role . 15 The Ticking Clock . 16 Encountering the World . 17 Monsters of the Id . 18 Traps of the Mind . 18 Doors of Perception . 19 Mazes of the Intellect . 19 Illusions of the Psyche . 21 Alternate Rules . 22 Tag-Team Delving . 22 On Dragon Slaying . 23 Scourge of the Undead . 24 The Tenth Level . 25 A Life of Adventuring . 26 It’s in the Cards . 28 Extra Stuff . 30 The House Rules . 31 B/X & A . 31 Game Balance . 32 Chance vs Choice . 33 Play-Testing . 34 Writing Rules . 35 Final Remarks . 37 4 INTRODUCTION In the following pages I’ll be discussing candidly my thoughts on the creation of the Dungeon Solitaire game, including its origins, my rationale for the aesthetics and structure of the game, and for its various mechanics. Along the way I’ll be talking about some of my ideas about game design, and what I find fun and engaging about different types of games.
    [Show full text]
  • L#07: PHP Date & Time
    L#07: PHP Date & Time Using Date & Time in PHP Lecture 7 March 21, 2007 ©2007, I.Sarah Al-Shareef 1 Table of Content Overview Date and Time Functions Definitions Displaying Date and Time Getting Date as Timestamp Displaying Readable Date Building Formatting String Special Formatting Characters for date() Convert from Readable to Timestamp Getting Files Dates Displaying Dates in other languages Formatting Characters for strftime() March 21, 2007 ©2007, I.Sarah Al-Shareef 2 1 L#07: PHP Date & Time Overview Date & Time Functions Function Description checkdate() Validates set of Gregorian year, month, and day values (for example, 2005, 3, 17). date_sunrise() Returns time of sunrise for a given day and location (new in PHP 5). date_sunset() Returns time of sunset for a given day and location (new in PHP 5). date() Formats a local date/time, given a Unix timestamp (for example, 1111035030000 from the introduction to this chapter) and a formatting string. getdate() Given a Unix timestamp, returns an associative array containing date and time information (defaults to current time). gettimeofday() Returns an associative array containing information about the current system time. In PHP 5.1, it is possible for this function to return a float as well. March 21, 2007 ©2007, I.Sarah Al-Shareef 3 Overview Date & Time Fun cont. Function Description gmdate() Formats a GMT/UTC date/time. Uses the same formatting characters as the date() function. gmmktime() Converts a set of GMT date/time values into a Unix timestamp (analogous to mktime()). gmstrftime() Formats a GMT/UTC date/time according to locale settings (similar to strftime() except the time used is GMT/UTC).
    [Show full text]
  • Mazes and Labyrinths
    Mazes and Labyrinths Author: W. H. Matthews The Project Gutenberg EBook of Mazes and Labyrinths, by W. H. Matthews This eBook is for the use of anyone anywhere at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this eBook or online at www.gutenberg.org Title: Mazes and Labyrinths A General Account of their History and Development Author: W. H. Matthews Release Date: July 9, 2014 [EBook #46238] Language: English Character set encoding: UTF-8 *** START OF THIS PROJECT GUTENBERG EBOOK MAZES AND LABYRINTHS *** Produced by Chris Curnow, Charlie Howard, and the Online Distributed Proofreading Team at http://www.pgdp.net MAZES AND LABYRINTHS [Illustration: [_Photo: G. F. Green_ Fig. 86. Maze at Hatfield House, Herts. (_see page 115_)] MAZES AND LABYRINTHS A GENERAL ACCOUNT OF THEIR HISTORY AND DEVELOPMENTS BY W. H. MATTHEWS, B.Sc. _WITH ILLUSTRATIONS_ LONGMANS, GREEN AND CO. 39 PATERNOSTER ROW, LONDON, E.C. 4 NEW YORK, TORONTO BOMBAY, CALCUTTA AND MADRAS 1922 _All rights reserved_ _Made in Great Britain_ To ZETA whose innocent prattlings on the summer sands of Sussex inspired its conception this book is most affectionately dedicated PREFACE Advantages out of all proportion to the importance of the immediate aim in view are apt to accrue whenever an honest endeavour is made to find an answer to one of those awkward questions which are constantly arising from the natural working of a child's mind. It was an endeavour of this kind which formed the nucleus of the inquiries resulting in the following little essay.
    [Show full text]
  • A Novel High Speed Leading Zero Counter for Floating Point Units
    Satish Paidi, Rohit Sreerama, K.Neelima / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue 2,Mar-Apr 2012, pp.1103-1105 A Novel High Speed Leading Zero Counter For Floating Point Units Satish Paidi*, Rohit Sreerama*, K.Neelima** *(M.Tech VLSI, Sree Vidyanikethan Engineering College, Tirupathi,) ** (Assistant Professor, Sree Vidyanikethan Engineering College, Tirupathi,) ABSTRACT: - This paper mainly focuses on leading derived Boolean relations that describes the proposed zero counting. In this paper a novel leading zero counter leading zero counter. In section 4 the implementation is proposed. New Boolean expressions are derived for results and the comparison with the existing method are the new leading zero counter. We can explore various discussed and section 5 concludes the paper follows by designs of leading zero counting unit by using the the references. proposed approach. When compared with the known architectures the new circuits can be implemented II. FUNCTIONALITY OF EXISTING effectively in both static and dynamic logic and also LEADING ZERO COUNTING METHOD requires less energy per operation. The proposed leading This section discusses the method which is used in zero counter can also be integrated with a leading zero leading zero counting, their implementation and anticipation logic for better and fast results. Finally, a functionality. A leading zero is any zero bit that leads a simple and effective Leading Zero Counter was proposed number string in positional notation. In binary and the occupancy rate and the delay characteristics are representation consider the number of consecutive zeros investigated. that appear in a word before the first more significant bit Keywords - Floating Point Unit, Normalization, Leading that equal to one.
    [Show full text]
  • Freecell and Other Stories
    University of New Orleans ScholarWorks@UNO University of New Orleans Theses and Dissertations Dissertations and Theses Summer 8-4-2011 FreeCell and Other Stories Susan Louvier University of New Orleans, [email protected] Follow this and additional works at: https://scholarworks.uno.edu/td Part of the Other Arts and Humanities Commons Recommended Citation Louvier, Susan, "FreeCell and Other Stories" (2011). University of New Orleans Theses and Dissertations. 452. https://scholarworks.uno.edu/td/452 This Thesis-Restricted is protected by copyright and/or related rights. It has been brought to you by ScholarWorks@UNO with permission from the rights-holder(s). You are free to use this Thesis-Restricted in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s) directly, unless additional rights are indicated by a Creative Commons license in the record and/or on the work itself. This Thesis-Restricted has been accepted for inclusion in University of New Orleans Theses and Dissertations by an authorized administrator of ScholarWorks@UNO. For more information, please contact [email protected]. FreeCell and Other Stories A Thesis Submitted to the Graduate Faculty of the University of New Orleans in partial fulfillment of the requirements for the degree of Master of Fine Arts in Film, Theatre and Communication Arts Creative Writing by Susan J. Louvier B.G.S. University of New Orleans 1992 August 2011 Table of Contents FreeCell .......................................................................................................................... 1 All of the Trimmings ..................................................................................................... 11 Me and Baby Sister ....................................................................................................... 29 Ivory Jupiter .................................................................................................................
    [Show full text]
  • Leading One Prediction - Implementation, Generalization, and Application
    LEADING ONE PREDICTION - IMPLEMENTATION, GENERALIZATION, AND APPLICATION Nhon Quach Michael J. Flynn Technical Report: CSL-TR-91-463 March 1991 This work was supported by NSF contract No. MlP88-22961. Leading One Prediction - Implementation, Generalization, and Application bY Nhon Quach and Michael Flynn Technical Report: CSL-TR-91-463 Masch 1991 Computer Systems Laboratory Departments of Electrical Engineering and Computer Science St anford University St anford, California 94305 Abstract This paper presents the concept of leading-one prediction (LOP) used in most high-speed floating-point adders in greater detail and describes two existing implementations. The first one is similar to that used in the TBM RS /GO00 processor. The second is a distributed version of the first, con- suming less hardware when multiple patterns need to be detected. We show how to modify these circuits for sign-magnitude numbers as dictated by the IEEE standard. We then point out that (1) LOP and carry lookahead in parallel addition belong to the same class of problem, that of bit pattern detection. Such a recognition allows techniques developed for parallel addition to be borrowed for bit pattern detection. And (2) LOP can be applied to compute the sticky bit needed for binary multipliers to perform IEEE rounding. Key Words and Phrases: Lea,ding one prediction, high-speed floating- point adders, parallel addition, IEEE rounding, sticky bit computation, par- allel implementation. Copyright @ 1991 bY Nhon Quach and Michael Flynn Contents 1 Introduction 1 2 Leading One Prediction 2 2.1 Theory. ...................................... 2 2.2 Implementations ................................. 3 2.3 Modification for Sign-Magnitude Numbers ..................
    [Show full text]
  • Botting Fred Wilson Scott Eds
    The Bataille Reader Edited by Fred Botting and Scott Wilson • � Blackwell t..b Publishing Copyright © Blackwell Publishers Ltd, 1997 Introduction, apparatus, selection and arrangement copyright © Fred Botting and Scott Wilson 1997 First published 1997 2 4 6 8 10 9 7 5 3 Blackwell Publishers Ltd 108 Cowley Road Oxford OX4 IJF UK Blackwell Publishers Inc. 350 Main Street Malden, MA 02 148 USA All rights reserved. Except for the quotation of short passages for the purposes of criticism and review, no part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form Or by any means, electronic, mechanical, photocopying, recording or otherwise, without the prior permission of the publisher. Except in the United States of America, this book is sold subject to the condition that it shall not, by way of trade or otherwise, be lent, resold, hired out, or otherwise circulated without the publisher's prior consent in any fo rm of binding or cover other than that in which it is published and without a similar condition including this condition being imposed on the subsequent purchaser. British Library Cataloguing in Publication Data A CIP catalogue record for this book is available from the British Ubrary. Library of Congress Cataloging in Publication Data Bataille, Georges, 1897-1962. [Selections. English. 19971 The Bataille reader I edited by Fred Botting and Scott Wilson. p. cm. -(Blackwell readers) Includes bibliographical references and index. ISBN 0-631-19958-6 (hc : alk. paper). -ISBN 0-631-19959-4 (pbk. : alk. paper) 1. Philosophy. 2. Criticism. I. Botting, Fred.
    [Show full text]
  • The C Programming Language
    The C programming Language The C programming Language By Brian W. Kernighan and Dennis M. Ritchie. Published by Prentice-Hall in 1988 ISBN 0-13-110362-8 (paperback) ISBN 0-13-110370-9 Contents ● Preface ● Preface to the first edition ● Introduction 1. Chapter 1: A Tutorial Introduction 1. Getting Started 2. Variables and Arithmetic Expressions 3. The for statement 4. Symbolic Constants 5. Character Input and Output 1. File Copying 2. Character Counting 3. Line Counting 4. Word Counting 6. Arrays 7. Functions 8. Arguments - Call by Value 9. Character Arrays 10. External Variables and Scope 2. Chapter 2: Types, Operators and Expressions 1. Variable Names 2. Data Types and Sizes 3. Constants 4. Declarations http://freebooks.by.ru/view/CProgrammingLanguage/kandr.html (1 of 5) [5/15/2002 10:12:59 PM] The C programming Language 5. Arithmetic Operators 6. Relational and Logical Operators 7. Type Conversions 8. Increment and Decrement Operators 9. Bitwise Operators 10. Assignment Operators and Expressions 11. Conditional Expressions 12. Precedence and Order of Evaluation 3. Chapter 3: Control Flow 1. Statements and Blocks 2. If-Else 3. Else-If 4. Switch 5. Loops - While and For 6. Loops - Do-While 7. Break and Continue 8. Goto and labels 4. Chapter 4: Functions and Program Structure 1. Basics of Functions 2. Functions Returning Non-integers 3. External Variables 4. Scope Rules 5. Header Files 6. Static Variables 7. Register Variables 8. Block Structure 9. Initialization 10. Recursion 11. The C Preprocessor 1. File Inclusion 2. Macro Substitution 3. Conditional Inclusion 5. Chapter 5: Pointers and Arrays 1.
    [Show full text]
  • Interview with Edward W. Kelley Former Member, Board of Governors of the Federal Reserve System
    Federal Reserve Board Oral History Project Interview with Edward W. Kelley Former Member, Board of Governors of the Federal Reserve System Date: September 22, 2010 Location: Washington, D.C. Interviewers: Lynn Fox, Winthrop P. Hambley, and David H. Small Federal Reserve Board Oral History Project In connection with the centennial anniversary of the Federal Reserve in 2013, the Board undertook an oral history project to collect personal recollections of a range of former Governors and senior staff members, including their background and education before working at the Board; important economic, monetary policy, and regulatory developments during their careers; and impressions of the institution’s culture. Following the interview, each participant was given the opportunity to edit and revise the transcript. In some cases, the Board staff also removed confidential FOMC and Board material in accordance with records retention and disposition schedules covering FOMC and Board records that were approved by the National Archives and Records Administration. Note that the views of the participants and interviewers are their own and are not in any way approved or endorsed by the Board of Governors of the Federal Reserve System. Because the conversations are based on personal recollections, they may include misstatements and errors. ii Contents Background ..................................................................................................................................... 1 Nomination to the Board ................................................................................................................
    [Show full text]