Alpha Geek

(8)

$10/per page/Negotiable

About Alpha Geek

Levels Tought:
University

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Environmental science,Essay writing,Programming,Social Science,Statistics Hide all
Teaching Since: Apr 2017
Last Sign in: 438 Weeks Ago, 3 Days Ago
Questions Answered: 9562
Tutorials Posted: 9559

Education

  • bachelor in business administration
    Polytechnic State University Sanluis
    Jan-2006 - Nov-2010

  • CPA
    Polytechnic State University
    Jan-2012 - Nov-2016

Experience

  • Professor
    Harvard Square Academy (HS2)
    Mar-2012 - Present

Category > Programming Posted 01 May 2017 My Price 8.00

Design a class named Queue for storing integers

Design a class named Queue for storing integers. Like a stack, a queue holds elements. In a stack, the elements are retrieved in a last-in first-out fashion. In a queue, the elements are retrieved in a first-in first-out fashion. The class contains: ¦ An int[] data field named elements that stores the int values in the queue. ¦ A data field named size that stores the number of elements in the queue. ¦ A constructor that creates a Queue object with default capacity 8. ¦ The method enqueue(int v) that adds v into the queue. ¦ The method dequeue() that removes and returns the element from the queue. ¦ The method empty() that returns true if the queue is empty. ¦ The method getSize() that returns the size of the queue.

Oct 26 2016 03:04 AM

 

 

Answers

Alpha Geek
(8)
Status NEW Posted 01 May 2017 09:05 AM My Price 8.00

-----------

Attachments

file 1493630888-answer1.docx preview (255 words )
D-----------esi-----------gn -----------a c-----------las-----------s n-----------ame-----------d Q-----------ueu-----------e f-----------or -----------sto-----------rin-----------g i-----------nte-----------ger-----------s. -----------Lik-----------e a----------- st-----------ack-----------, a----------- qu-----------eue----------- ho-----------lds----------- el-----------eme-----------nts-----------. I-----------n a----------- st-----------ack-----------, t-----------he -----------ele-----------men-----------ts -----------are----------- re-----------tri-----------eve-----------d i-----------n a----------- la-----------st------------in -----------fir-----------st------------out----------- fa-----------shi-----------on.----------- In----------- a -----------que-----------ue,----------- th-----------e e-----------lem-----------ent-----------s a-----------re -----------ret-----------rie-----------ved----------- in----------- a -----------fir-----------st------------in -----------fir-----------st------------out----------- fa-----------shi-----------on.----------- Th-----------e c-----------las-----------s c-----------ont-----------ain-----------s: -----------¦ -----------An -----------int-----------[] -----------dat-----------a f-----------iel-----------d n-----------ame-----------d e-----------lem-----------ent-----------s t-----------hat----------- st-----------ore-----------s t-----------he -----------int----------- va-----------lue-----------s i-----------n t-----------he -----------que-----------ue.----------- ¦----------- A -----------dat-----------a f-----------iel-----------d n-----------ame-----------d s-----------ize----------- th-----------at -----------sto-----------res----------- th-----------e n-----------umb-----------er -----------of -----------ele-----------men-----------ts -----------in -----------the----------- qu-----------eue-----------. Â-----------¦ A----------- co-----------nst-----------ruc-----------tor----------- th-----------at -----------cre-----------ate-----------s
Not Rated(0)