assignment/.DS_Store __MACOSX/assignment/._.DS_Store assignment/ArrayQueue.cpp #include template ArrayQueue ::ArrayQueue() { front = 0; back = DEFAULT_CAPACITY - 1; numItems = 0; } template bool...

FOllow the instructions to complete the assignment. NOTE: YOU CAN't copy online code!!!!! You must prove that you write this by your own


assignment/.DS_Store __MACOSX/assignment/._.DS_Store assignment/ArrayQueue.cpp #include template ArrayQueue::ArrayQueue() { front = 0; back = DEFAULT_CAPACITY - 1; numItems = 0; } template bool ArrayQueue::isEmpty() const { return numItems == 0; } template bool ArrayQueue::enqueue(const ItemType& newEntry) { bool result = false; if (numItems < default_capacity)="" {="" back="(back" +="" 1)="" %="" default_capacity;="" items[back]="newEntry;" numitems++;="" result="true;" }="" return="" result;="" }=""> bool ArrayQueue::dequeue() { bool result = false; if (!isEmpty()) { front = (front + 1) % DEFAULT_CAPACITY; numItems--; result = true; } return result; } template ItemType ArrayQueue::peekFront() const { if (isEmpty()) { throw PrecondViolatedExcep("peekFront() called with empty queue"); } return items[front]; } template void ArrayQueue::print() const { std::cout < "here="" is="" the="" queue:="" ";="" if="" (isempty())="" {="" std::cout="">< "empty";="" }="" else="" {="" for="" (int="" i="front;" i="" !="back;" i="(i" +="" 1)="" %="" default_capacity)="" {="" std::cout="">< items[i]="">< "="" ";="" }="" std::cout="">< items[back];="" }="" }="" __macosx/assignment/._arrayqueue.cpp="" assignment/data-abstraction-and-prolem-soving_6_th_edition的副本.pdf="" c++="" reserved="" keywords="" c++="" reserves="" and="" gives="" predefi="" ned="" meanings="" to="" the="" following="" keywords.="" you="" may="" not="" redefi="" ne="" key-="" words="" or="" use="" them="" for="" other="" purposes.="" keywords="" that="" appear="" in="" color="" are="" new="" since="" c++11.="" alignas="" decitype="" namespace="" struct="" alignof="" default="" new="" switch="" and="" delete="" noexcept="" template="" and_eq="" do="" not="" this="" asm="" double="" not_eq="" thread_local="" auto="" dynamic_cast="" nullptr="" throw="" bitand="" else="" operator="" true="" bitor="" enum="" or="" try="" bool="" explicit="" or_eq="" typedef="" break="" export="" private="" typeid="" case="" extern="" protected="" typename="" catch="" false="" public="" union="" char="" fl="" oat="" register="" unsigned="" char16_t="" for="" reinterpret_cast="" using="" char32_t="" friend="" return="" virtual="" class="" goto="" short="" void="" compl="" if="" signed="" volatile="" const="" inline="" sizeof="" wchar_t="" const_cast="" int="" static="" while="" constexpr="" long="" static_assert="" xor="" continue="" mutable="" static_cast="" xor_eq="" operator="" meaning="" associativity="" usage="" *="" multiply="" left="" expr="" *="" expr="" divide="" left="" expr="" expr="" %="" modulo="" left="" expr="" %="" expr="" +="" add="" left="" expr="" +="" expr="" -="" subtract="" left="" expr="" -="" expr="">< bitwise="" shift="" left‡="" left="" expr="">< expr="">> bitwise shift right‡ left expr >> expr< less="" than="" left="" expr="">< expr=""><= less="" than="" or="" equal="" to="" left="" expr=""><= expr=""> greater than left expr > expr >= greater than or equal to left expr >= expr == equal left expr == expr != not equal left expr != expr & bitwise AND left expr & expr ̂ bitwise EXCLUSIVE OR left expr ̂ expr | bitwise OR left expr | expr && logical AND left expr && expr || logical OR left expr || expr ? : conditional left expr ? expr : expr = assign left lvalue = expr *= multiply and assign left lvalue *= expr /= divide and assign left lvalue /= expr %= modulo and assign left lvalue %= expr += add and assign left lvalue += expr -= subtract and assign left lvalue -= expr<= shift="" left="" and="" assign="" left="" lvalue=""><= expr="">>= shift right and assign left lvalue >>= expr &= AND and assign left lvalue &= expr |= OR and assign left lvalue |= expr ̂ = EXCLUSIVE OR and assign left lvalue ̂ = expr , comma left expr , expr ‡ Typically overloaded for I/O Data Abstraction & Problem Solving with C++ WALLS AND MIRRORS SIXTH EDITION Frank M. Carrano University of Rhode Island Timothy Henry University of Rhode Island ISBN 10: 0-13-292372-6 ISBN 13: 978-0-13-292372-9 Credits and acknowledgments borrowed from other sources and reproduced, with permission, in this textbook appear on the appropriate page within text. Copyright © 2013, 2007, 2005 Pearson Education, Inc., publishing as Addison-Wesley. All rights reserved. Printed in the United States of America. This publication is protected by Copyright, and permission should be obtained from the publisher prior to any prohibited reproduction, storage in a retrieval system, or transmission in any form or by any means, electronic, mechanical, photocopying, recording, or likewise. To obtain permission(s) to use material from this work, please submit a written request to Pearson Education, Inc., Permissions Department, One Lake Street, Upper Saddle River, New Jersey 07458, or you may fax your request to 201-236-3290. Many of the designations by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in this book, and the publisher was aware of a trademark claim, the designations have been printed in initial caps or all caps. Library of Congress Cataloging-in-Publication Data on fi le. 10 9 8 7 6 5 4 3 2 1 Vice President and Editorial Director, ECS: Marcia J. Horton Executive Editor: Tracy Johnson Associate Editor: Carole Snyder Director of Marketing: Christy Lesko Marketing Manager: Yez Alayan Marketing Assistant: Jon Bryant Director of Production: Erin Gregg Managing Editor: Jeff Holcomb Associate Managing Editor: Robert Engelhardt Manufacturing Buyer: Lisa McDowell Art Director: Anthony Gemmellaro Cover Designer: Liz Harasymczuk Permissions Supervisor: Michael Joyce Permissions Administrator: Jenell Forschler Director, Image Asset Services: Annie Atherton Manager, Visual Research: Karen Sanatar Cover Art: Shutterstock/SVLuma Media Project Manager: Renata Butera Full-Service Project Management: Rose Kernan Composition: Cenveo Publisher Services / Nesbitt Printer/Binder: Edwards Brothers Cover Printer: Lehigh-Phoenix Color/Hagerstown iiiiii W el co m eWelcome to the sixth edition of Data Abstraction &