DOCSLIB.ORG

Teach Yourself Data Structures and Algorithms in 24 Hours

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Teach Yourself Data Structures and Algorithms in 24 Hours TeamLRN 00 72316331 FM 10/31/02 6:54 AM Page i Robert Lafore Teach Yourself Data Structures and Algorithms in24 Hours 201 West 103rd St., Indianapolis, Indiana, 46290 USA 00 72316331 FM 10/31/02 6:54 AM Page ii Sams Teach Yourself Data Structures and EXECUTIVE EDITOR Algorithms in 24 Hours Brian Gill DEVELOPMENT EDITOR Copyright © 1999 by Sams Publishing Jeff Durham All rights reserved. No part of this book shall be reproduced, stored in a MANAGING EDITOR retrieval system, or transmitted by any means, electronic, mechanical, photo- Jodi Jensen copying, recording, or otherwise, without written permission from the pub- lisher. No patent liability is assumed with respect to the use of the information PROJECT EDITOR contained herein. Although every precaution has been taken in the preparation Tonya Simpson of this book, the publisher and author assume no responsibility for errors or omissions. Neither is any liability assumed for damages resulting from the use COPY EDITOR of the information contained herein. Mike Henry International Standard Book Number: 0-672-31633-1 INDEXER Larry Sweazy Library of Congress Catalog Card Number: 98-83221 PROOFREADERS Printed in the United States of America Mona Brown Jill Mazurczyk First Printing: May 1999 TECHNICAL EDITOR 01 00 99 4 3 2 1 Richard Wright Trademarks SOFTWARE DEVELOPMENT All terms mentioned in this book that are known to be trademarks or service SPECIALIST marks have been appropriately capitalized. Sams Publishing cannot attest to Dan Scherf the accuracy of this information. Use of a term in this book should not be INTERIOR DESIGN regarded as affecting the validity of any trademark or service mark. Gary Adair Warning and Disclaimer COVER DESIGN Every effort has been made to make this book as complete and as accurate as Aren Howell possible, but no warranty or fitness is implied. The information provided is on COPY WRITER an “as is” basis. The authors and the publisher shall have neither liability or Eric Borgert responsibility to any person or entity with respect to any loss or damages aris- ing from the information contained in this book or from the use of the CD- LAYOUT TECHNICIANS ROM or programs accompanying it. Brian Borders Susan Geiselman TeamLRN 00 72316331 FM 10/31/02 6:54 AM Page iii Contents at a Glance Introduction 1 PART IINTRODUCING DATA STRUCTURES AND ALGORITHMS 9 Hour 1 Overview of Data Structures and Algorithms 11 2Arrays 31 3Ordered Arrays 51 4The Bubble Sort 75 5The Insertion Sort 89 PART II ABSTRACT DATA TYPES 105 Hour 6 Stacks 107 7 Queues and Priority Queues 125 8 Linked Lists 145 9 Abstract Data Types 165 10 Specialized Lists 183 PART III RECURSION AND QUICKSORT 205 Hour 11 Recursion 207 12 Applied Recursion 233 13 Quicksort 257 14 Improving Quicksort 279 PART IV TREES 295 Hour 15 Binary Trees 297 16 Traversing Binary Trees 317 17 Red-Black Trees 337 18 Red-Black Tree Insertions 359 19 2-3-4 Trees 379 20 Implementing 2-3-4 Trees 395 00 72316331 FM 10/31/02 6:54 AM Page iv PART VHASH TABLES 415 Hour 21 Hash Tables 417 22 Quadratic Probing 441 23 Separate Chaining 457 24 When to Use What 475 PART VI APPENDIXES 487 Appendix A Quiz Answers 489 BHow to Run the Workshop Applets and Sample Programs 505 C Further Reading 509 Index 513 TeamLRN 00 72316331 FM 10/31/02 6:54 AM Page v Table of Contents INTRODUCTION 1 What This Book Is About ........................................................................................1 What’s Different About This Book..........................................................................2 Easy to Understand ............................................................................................2 Workshop Applets ..............................................................................................2 C++ Sample Code ..............................................................................................3 Who This Book Is For ............................................................................................3 What You Need to Know Before You Read This Book ..........................................4 The Software You Need to Use This Book..............................................................4 How This Book Is Organized ..................................................................................4 Enjoy Yourself! ........................................................................................................6 Conventions Used in This Book ..............................................................................6 PART IINTRODUCING DATA STRUCTURES AND ALGORITHMS 9 HOUR 1OVERVIEW OF DATA STRUCTURES AND ALGORITHMS 11 Some Uses for Data Structures and Algorithms....................................................12 Real-World Data Storage..................................................................................12 Programmer’s Tools..........................................................................................14 Real-World Modeling ......................................................................................14 Overview of Data Structures ................................................................................14 Overview of Algorithms ........................................................................................15 Some Initial Definitions ........................................................................................16 Datafile ............................................................................................................16 Record ..............................................................................................................16 Field..................................................................................................................16 Key....................................................................................................................16 Search Key........................................................................................................17 A Quick Introduction to Object-Oriented Programming ......................................18 Problems with Procedural Languages..............................................................18 Objects in a Nutshell ........................................................................................19 A Runnable Object-Oriented Program ............................................................21 Inheritance and Polymorphism ........................................................................24 New C++ Features ................................................................................................25 The string Class..............................................................................................25 The vector Class..............................................................................................26 Software Engineering ............................................................................................26 Summary................................................................................................................27 00 72316331 FM 10/31/02 6:54 AM Page vi vi Sams Teach Yourself Data Structures and Algorithms in 24 Hours Q&A ......................................................................................................................28 Workshop ..............................................................................................................28 Quiz ..................................................................................................................28 Exercise ............................................................................................................29 HOUR 2ARRAYS 31 The Array Workshop Applet..................................................................................31 Deletion ............................................................................................................34 The Duplicates Problem ..................................................................................35 Slow Array Algorithms ....................................................................................37 An Array Example ................................................................................................37 Inserting a New Item ........................................................................................39 Searching for an Item ......................................................................................39 Deleting an Item ..............................................................................................39 Displaying the Array Contents ........................................................................40 Program Organization ......................................................................................40 Dividing a Program into Classes ..........................................................................40 The LowArray Class and main() ......................................................................42 Class Interfaces......................................................................................................43 Making main()’s Job Easier ............................................................................43 Who’s Responsible for What?..........................................................................44 The highArray.cpp Example ..........................................................................44 The User’s Life Made Easier............................................................................48 Abstraction........................................................................................................48
Load more

Recommended publications
  • Fast Parallel Machine Learning Algorithms for Large Datasets Using Graphic Processing Unit Qi Li Virginia Commonwealth University
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by VCU Scholars Compass Virginia Commonwealth University VCU Scholars Compass Theses and Dissertations Graduate School 2011 Fast Parallel Machine Learning Algorithms for Large Datasets Using Graphic Processing Unit Qi Li Virginia Commonwealth University Follow this and additional works at: http://scholarscompass.vcu.edu/etd Part of the Computer Sciences Commons © The Author Downloaded from http://scholarscompass.vcu.edu/etd/2625 This Dissertation is brought to you for free and open access by the Graduate School at VCU Scholars Compass. It has been accepted for inclusion in Theses and Dissertations by an authorized administrator of VCU Scholars Compass. For more information, please contact [email protected]. © Qi Li 2011 All Rights Reserved FAST PARALLEL MACHINE LEARNING ALGORITHMS FOR LARGE DATASETS USING GRAPHIC PROCESSING UNIT A Dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy at Virginia Commonwealth University. by QI LI M.S., Virginia Commonwealth University, 2008 B.S., Beijing University of Posts and Telecommunications (P.R. China), 2007 Director: VOJISLAV KECMAN ASSOCIATE PROFESSOR, DEPARTMENT OF COMPUTER SCIENCE Virginia Commonwealth University Richmond, Virginia December, 2011 ii Table of Contents List of Tables vi List of Figures viii Abstract ii 1 Introduction 1 2 Background, Related Work and Contributions 4 2.1TheHistoryofSequentialSVM..................... 5 2.2TheDevelopmentofParallelSVM.................... 6 2.3 K-Nearest Neighbors Search and Local Model Based Classifiers . 7 2.4 Parallel Computing Framework ..................... 8 2.5 Contributions of This Dissertation .................... 10 3 Graphic Processing Units 12 3.1 Computing Unified Device Architecture (CUDA) ..........
    [Show full text]
  • Title Author Contract Publisher Pub Year BISAC/LC Subject Heading Southern Illinois "Speech Acts" and the First Amendment Haiman, Franklyn Saul
    Title Author Contract Publisher Pub Year BISAC/LC Subject Heading Southern Illinois "Speech Acts" and the First Amendment Haiman, Franklyn Saul. University Press 1993 LAW / Constitutional $$Cha-ching!$$ : A Girl's Guide to Spending and Rosen Publishing Saving Weeldreyer, Laura. Group 1999 JUVENILE NONFICTION / General [Green Barley Essence : The Ideal "fast Food" Hagiwara, Yoshihide NTC Contemporary 1985 MEDICAL / Nursing / Nutrition 1,001 Ways to Get Promoted Rye, David E. Career Press 2000 BUSINESS & ECONOMICS / Careers / General 1,001 Ways to Save, Grow, and Invest Your BUSINESS & ECONOMICS / Personal Finance Money Rye, David E. Career Press 1999 / Budgeting 100 Great Jobs and How to Get Them Fein, Richard Impact Publications 1999 BUSINESS & ECONOMICS / Labor LANGUAGE ARTS & DISCIPLINES / Library & 100 Library Lifesavers : A Survival Guide for Information Science / Archives & Special School Library Media Specialists Bacon, Pamela S. ABC-CLIO 2000 Libraries 100 Top Internet Job Sites : Get Wired, Get LANGUAGE ARTS & DISCIPLINES / Library & Hired in Today's New Job Market Ackley, Kristina M. Impact Publications 2000 Information Science / General BUSINESS & ECONOMICS / Investments & 100 Ways to Beat the Market Walden, Gene. Kaplan Publishing 1998 Securities / General Inlander, Charles B.-Kelly, People's Medical 100 Ways to Live to 100 Christine Kuehn. Society 1999 MEDICAL / Preventive Medicine 100 Winning Resumes for $100,000+ Jobs : LANGUAGE ARTS & DISCIPLINES / Resumes That Can Change Your Life Enelow, Wendy S. Impact Publications 1997 Composition & Creative Writing 1001 Basketball Trivia Questions Ratermann, Dale-Brosi, Brian. Perseus Books, LLC 1999 SPORTS & RECREATION / Basketball 101 + Answers to the Most Frequently Asked John Wiley & Sons, Questions From Entrepreneurs Price, Courtney H. Inc.
    [Show full text]
  • Teach Yourself Data Structures and Algorithms In24 Hours
    00 72316331 FM 10/31/02 6:54 AM Page i Robert Lafore Teach Yourself Data Structures and Algorithms in24 Hours 201 West 103rd St., Indianapolis, Indiana, 46290 USA 00 72316331 FM 10/31/02 6:54 AM Page ii Sams Teach Yourself Data Structures and EXECUTIVE EDITOR Algorithms in 24 Hours Brian Gill DEVELOPMENT EDITOR Copyright © 1999 by Sams Publishing Jeff Durham All rights reserved. No part of this book shall be reproduced, stored in a MANAGING EDITOR retrieval system, or transmitted by any means, electronic, mechanical, photo- Jodi Jensen copying, recording, or otherwise, without written permission from the pub- lisher. No patent liability is assumed with respect to the use of the information PROJECT EDITOR contained herein. Although every precaution has been taken in the preparation Tonya Simpson of this book, the publisher and author assume no responsibility for errors or omissions. Neither is any liability assumed for damages resulting from the use COPY EDITOR of the information contained herein. Mike Henry International Standard Book Number: 0-672-31633-1 INDEXER Larry Sweazy Library of Congress Catalog Card Number: 98-83221 PROOFREADERS Printed in the United States of America Mona Brown Jill Mazurczyk First Printing: May 1999 TECHNICAL EDITOR 01 00 99 4 3 2 1 Richard Wright Trademarks SOFTWARE DEVELOPMENT All terms mentioned in this book that are known to be trademarks or service SPECIALIST marks have been appropriately capitalized. Sams Publishing cannot attest to Dan Scherf the accuracy of this information. Use of a term in this book should not be INTERIOR DESIGN regarded as affecting the validity of any trademark or service mark.
    [Show full text]
  • Introduction Letter General (2012)
    Welcome to the office of Pearson and Radar Education in Tanzania. We hope you enjoy reading this overview of our business, and look forward to working with you to help Tanzanians make progress in their lives through education and information – to help them to ‘live and learn. Pearson Pearson is the world’s leading education company, providing learning materials, technologies, assessments and services to teachers and students in over 70 countries across the world. With an established presence in more than 20 other countries in Sub Saharan Africa alone, Pearson has long been supporting the delivery of primary, secondary and university education across the continent. Pearson’s expertise in educational development has been built on its long-standing partnership with some of the best brands in the business. Pearson imprints such as Longman, the Financial Times, Penguin, Ladybird and Heinemann offer specialised publishing and learning solutions for an extensive range of age levels and subject areas, supporting students from their first steps in early childhood right up to their entry into the professional world. Radar Education In August 2005, Pearson appointed Radar Education Ltd as its sole partner in Tanzania and Zanzibar, with exclusive rights for the delivery of all Pearson resources and learning solutions within the country. Over the past 7 years, Radar Education has gained great respect from schools, institutions and bookshops across the country for delivery speed, procedural efficiency and sensitive customer service. Please see below a list of the main Pearson imprints and logos that circulate amongst students, teachers and advisers in Tanzania. This list is not exhaustive, so should you require any further information about our products or our operation, then please do not hesitate to contact us or visit us at our offices in Mikocheni B, Dar es Salaam.
    [Show full text]
  • Lecture 7: Heapsort / Priority Queues Steven Skiena Department of Computer Science State University of New York Stony Brook, NY
    Lecture 7: Heapsort / Priority Queues Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794–4400 http://www.cs.stonybrook.edu/˜skiena Problem of the Day Take as input a sequence of 2n real numbers. Design an O(n log n) algorithm that partitions the numbers into n pairs, with the property that the partition minimizes the maximum sum of a pair. For example, say we are given the numbers (1,3,5,9). The possible partitions are ((1,3),(5,9)), ((1,5),(3,9)), and ((1,9),(3,5)). The pair sums for these partitions are (4,14), (6,12), and (10,8). Thus the third partition has 10 as its maximum sum, which is the minimum over the three partitions. Importance of Sorting Why don’t CS profs ever stop talking about sorting? • Computers spend a lot of time sorting, historically 25% on mainframes. • Sorting is the best studied problem in computer science, with many different algorithms known. • Most of the interesting ideas we will encounter in the course can be taught in the context of sorting, such as divide-and-conquer, randomized algorithms, and lower bounds. You should have seen most of the algorithms, so we will concentrate on the analysis. Efficiency of Sorting Sorting is important because that once a set of items is sorted, many other problems become easy. Further, using O(n log n) sorting algorithms leads naturally to sub-quadratic algorithms for all these problems. n n2=4 n lg n 10 25 33 100 2,500 664 1,000 250,000 9,965 10,000 25,000,000 132,877 100,000 2,500,000,000 1,660,960 1,000,000 250,000,000,000 13,815,551 Large-scale data processing is impossible with Ω(n2) sorting.
    [Show full text]
  • Download Files
    The Object-Oriented Thought Process Third Edition Developer’s Library ESSENTIAL REFERENCES FOR PROGRAMMING PROFESSIONALS Developer’s Library books are designed to provide practicing programmers with unique, high-quality references and tutorials on the programming languages and technologies they use in their daily work. All books in the Developer’s Library are written by expert technology practitioners who are especially skilled at organizing and presenting information in a way that’s useful for other programmers. Key titles include some of the best, most widely acclaimed books within their topic areas: PHP & MySQL Web Development Python Essential Reference Luke Welling & Laura Thomson David Beazley ISBN 978-0-672-32916-6 ISBN-13: 978-0-672-32862-6 MySQL Programming in Objective-C Paul DuBois Stephen G. Kochan ISBN-13: 978-0-672-32938-8 ISBN-13: 978-0-321-56615-7 Linux Kernel Development PostgreSQL Robert Love Korry Douglas ISBN-13: 978-0-672-32946-3 ISBN-13: 978-0-672-33015-5 Developer’s Library books are available at most retail and online bookstores, as well as by subscription from Safari Books Online at safari.informit.com Developer’s Library informit.com/devlibrary The Object-Oriented Thought Process Third Edition Matt Weisfeld Upper Saddle River, NJ • Boston • Indianapolis • San Francisco New York • Toronto • Montreal • London • Munich • Paris • Madrid Cape Town • Sydney • Tokyo • Singapore • Mexico City The Object-Oriented Thought Process, Third Edition Acquisitions Editor Copyright © 2009 by Pearson Education Mark Taber All rights reserved. No part of this book shall be reproduced, stored in a retrieval system, or Development transmitted by any means, electronic, mechanical, photocopying, recording, or otherwise, Editor without written permission from the publisher.
    [Show full text]
  • Dynamic Algorithms for Partially-Sorted Lists Kostya Kamalah Ross
    Dynamic Algorithms for Partially-Sorted Lists Kostya Kamalah Ross School of Computer and Mathematical Sciences November 3, 2015 A thesis submitted to Auckland University of Technology in fulfilment of the requirements for the degree of Master of Philosophy. 1 Abstract The dynamic partial sorting problem asks for an algorithm that maintains lists of numbers under the link, cut and change value operations, and queries the sorted sequence of the k least numbers in one of the lists. We examine naive solutions to the problem and demonstrate why they are not adequate. Then, we solve the problem in O(k · log(n)) time for queries and O(log(n)) time for updates using the tournament tree data structure, where n is the number of elements in the lists. We then introduce a layered tournament tree ∗ data structure and solve the same problem in O(log'(n) · k · log(k)) time for 2 ∗ queries and O(log (n)) for updates, where ' is the golden ratio and log'(n) is the iterated logarithmic function with base '. We then perform experiments to test the performance of both structures, and discover that the tournament tree has better practical performance than the layered tournament tree. We discuss the probable causes of this. Lastly, we suggest further work that can be undertaken in this area. Contents List of Figures 4 1 Introduction 7 1.1 Problem setup . 8 1.2 Contribution . 8 1.3 Related work . 9 1.4 Organization . 10 1.5 Preliminaries . 11 1.5.1 Trees . 11 1.5.2 Asymptotic and Amortized Complexity .
    [Show full text]
  • Online Instruction Collaboration Project
    University of Montana ScholarWorks at University of Montana Graduate Student Theses, Dissertations, & Professional Papers Graduate School 2003 Online Instruction Collaboration Project Michael David Cassens The University of Montana Follow this and additional works at: https://scholarworks.umt.edu/etd Let us know how access to this document benefits ou.y Recommended Citation Cassens, Michael David, "Online Instruction Collaboration Project" (2003). Graduate Student Theses, Dissertations, & Professional Papers. 8945. https://scholarworks.umt.edu/etd/8945 This Thesis is brought to you for free and open access by the Graduate School at ScholarWorks at University of Montana. It has been accepted for inclusion in Graduate Student Theses, Dissertations, & Professional Papers by an authorized administrator of ScholarWorks at University of Montana. For more information, please contact [email protected]. Maureen and Mike MANSFIELD LIBRARY The University of Montana Permission is granted by the author to reproduce this material in its entirety, provided that this material is used for scholarly purposes and is properly cited in published works and reports. **Please check "Yes" or "No" and provide signature** Yes, I grant permission No, I do not grant permission Author's Signature. V'"— ----- Date: ^-00 J>________ Any copying for commercial purposes or fmancial gam may be undertaken only with the author’s explicit consent. 8 /98 Reproduced with permission of the copyright owner. Further reproduction prohibited without permission. Reproduced with permission of the copyright owner. Further reproduction prohibited without permission. Online Instruction Collaboration Project by Michael David Cassens B.A. The University of Montana 1996 presented in partial fulfillment of the requirements for the degree of Master o f Science The University of Montana 2003 Approved by; Dean, Graduate School Date Reproduced with permission of the copyright owner.
    [Show full text]
  • Pearson Technology Group Information to the Trade
    PEARSON TECHNOLOGY GROUP INFORMATION TO THE TRADE IMPRINTS OF PEARSON DISCOUNTS COOPERATIVE EDUCATION : ADVERTISING PLAN For information on retail and wholesale PEARSON ADDISON WESLEY discounts please contact your Pearson PTG For information, contracts, and limitations, ADDISON-WESLEY PROFESSIONAL Retail Sales Representative, or contact our sales office at (317) 428-3243. please contact your local sales representa- ADOBE PRESS tive. All reimbursable activities must be pre- approved. PEARSON ALLYN & BACON PEARSON BENJAMIN CUMMINGS TRADE & RETAILER BIG NERD RANCH RETURNS POLICY INTERNATIONAL BRADY EMT ORDERS PEARSON CERTIFICATION ACTIVE TITLES: CISCO PRESS Product in condition to be resold as new INTERNATIONAL ORDERS & INQUIRIES FT PRESS may be returned for credit without prior PEARSON EDUCATION authorization. Product may not be returned IBM PRESS INTERNATIONAL DIVISION sooner than 120 days after the publication date 200 Old Tappan Road PEARSON LONGMAN or 90 days after being declared out-of-print. Old Tappan, NJ 07675 PEARSON MERRILL PRENTICE HALL Email: [email protected] SUPERSEDED EDITIONS: NEW RIDERS Superseded editions must be returned by CANADIAN CUSTOMERS PEACHPIT PRESS April 30 of the year of publication of the new For discount schedule and ordering PEARSON PRENTICE HALL edition or within 90 days of the new edition’s information, write: publication date, whichever is later. PRENTICE HALL HEALTH PEARSON TECHNOLOGY GROUP PRENTICE HALL PTR DAMAGED TITLES: CANADA QUE Titles damaged in transit by the carrier 26 Prince Andrew Place SAMS PUBLISHING must be reported immediately to Pearson Don Mills, Ontario Customer Service. M3C 2T8 ORDERS & INQUIRIES ELIGIBLE TITLES: All returns must be in condition to be resold as OASIS: new.
    [Show full text]
  • 'Quicksort' and 'Quickselect'
    Algorithms Seminar 2002–2004, Available online at the URL F. Chyzak (ed.), INRIA, (2005), pp. 101–104. http://algo.inria.fr/seminars/. Forty Years of ‘Quicksort’ and ‘Quickselect’: a Personal View Conrado Mart´ınez Universitat Polit`ecnica de Cataluny (Spain) October 6, 2003 Summary by Marianne Durand Abstract The algorithms ‘quicksort’ [3] and ‘quickselect’ [2], invented by Hoare, are simple and elegant solutions to two basic problems: sorting and selection. They are widely studied, and we focus here on the average cost of these algorithms, depending on the choice of the sample. We also present a partial sorting algorithm named ‘partial quicksort’. 1. ‘Quicksort’ and ‘Quickselect’ The sorting algorithm ‘quicksort’ is based on the divide-and-conquer principle. The algorithm proceeds as follows. First a pivot is chosen, with a specified strategy. Then all the elements of the array but the pivot are compared to the pivot. The elements smaller than the pivot are stored before the pivot, and the elements larger after the pivot. These two sub-arrays are then recursively sorted. We denote by Cn the average number of comparisons done to sort an array of size n, and πn,k the probability that the kth element is the chosen pivot in an array of size n. The recursive design of the algorithm is translated into a recurrence satisfied by the cost Cn: n X (1) Cn = n − 1 + tn + πn,k(Ck−1 + Cn−k). k=1 The value tn denote the cost, in terms of comparisons, of the choice of the pivot, that may depend on n.
    [Show full text]
  • Bibliography of Adult Teaching Methods
    Bibliography of Adult Teaching Methods Older Beginner/Adult Piano Methods: Aaron, Michael. Adult Piano Course. New York, NY: Mills Music, 1947. Agay, Denes. The Joy of First-Year Piano. New York: Yorktown Music Press, Inc., 1972. Bastien, James W.. Beginning Piano for Adults. Park Ridge, IL: General Words & Music Co., 1968. Bastien, James. Musicianship for the Older Beginner, Levels 1 and 2. San Diego: Kjos West, 1977. Bastien, James. The Older Beginner Piano Course, Levels 1 and 2. San Diego: Kjos West, 1977. Bastien, Jane Smisor, Lisa Bastien, and Lori Bastien. Piano for Adults. A Beginning Course: Lessons. Theory. Technic. Sight Reading. Books 1 & 2. San Diego, CA: Neil A Kjos Company, 1999. Bergenfeld, Nathan. The Adult Beginner. New York, NY: Acorn Music Press, 1970. Bilbro, Mathilde. Melodic and technical Studies for the Adult Beginner on the Piano. New York, NY: G Schirmer, Inc., 1922. Bradley, Richard. Bradley’s How to Play Piano. Methods Books (Adult Books 1 to 3), Classical Books (Adult Books 1 to 3), Hymn Books (Adult Books 1 to 3), and Popular Books (Adult Books 1 to 3). New York, NY: Bradley Publications, 1989. Clark, Frances, Louise Goss, and Roger Grove. Keyboard Musician. Rev. edition. Secaucus, NJ: Summy-Birchard/Warner Brothers. 1980. Eckstein, Maxwell. Adult Piano Book. New York, NY: Carl Fischer Music, 1953. Emonts, Fritz. The European Piano Method. 3 Progressive Levels. (Trilingual: Text in English, French, and German). Mainz, Germany: Schott,Musik, 1992. Faber, Randall and Nancy Faber. Accelerated Piano Adventures Book 1, Performance Book 1 & Christamas Book 1 (1998). Lesson Book 2 (2000).
    [Show full text]
  • Graduate & Inservice.[SITE 2001 Section]
    DOCUMENT RESUME ED 457 828 IR 020 898 AUTHOR Crawford, Caroline M., Ed. TITLE Graduate & Inservice.[SITE 2001 Section]. PUB DATE 2001-03-00 NOTE 252p.; In: Proceedings of Society for Information Technology & Teacher Education International Conference (12th, Orlando, Florida, March 5-10, 2001); see IR 020 890. Figures may contain very small and illegible font. PUB TYPE collected works General (020) Speeches/Meeting Papers (150) EDRS PRICE MF01/PC11 Plus Postage. DESCRIPTORS *Computer Uses in Education; *Educational Technology; *Faculty Development; Graduate Study; Higher Education; *Inservice Teacher Education; Standards; *Technology Integration IDENTIFIERS Technology Utilization; Web Based Instruction ABSTRACT This document contains the papers on graduate and inservice teacher education from the SITE (Society for Information Technology & Teacher Education) 2001 conference. Topics covered include: media literacy across the curriculum; contextual learning about information technology (IT); IT in teacher education; reform in a graduate school technology program; the Brazilian national computer forum for education; integrating standards into educational technology masters programs; developing professional development schools; a teacher development model for scaffolding technology integration; teaching electronic information research skills to teachers; overcoming barriers to technology integration through mentoring; ensuring technology leaders; aligning graduate credit courses with standards; subject-specific technology integration training;
    [Show full text]