# As you begin to look at data structures using java, this first | IT265 Data Structures for Problem Solving | Colorado Technical University

As you begin to look at data structures using Java, this first assignment will have you look at the implementation of a queue and a stack. These two algorithms will be implemented using linked lists. You will complete 2 given program shells: one for a queue and the other for a stack.

In addition, you will establish your Key Assignment template that you will build in Week 1, and each week, you will add material to the appropriate section of the document.

Your Data Structures Using Java template document should be in the following format:

• Data Structures Using Java document shell
• Use MS Word
• Title Page
• Course number and name
• Project name
• Student name
• Date
• Table of Contents
• Use auto-generated TOC
• Separate page for each section
• Maximum of 3 levels deep
• Be sure to update fields of TOC so it is up-to-date before submitting your project
• Abstract
• Paper Topic Background
• Section Headings (Create each heading on a new page with TBD as the content except for the sections you are currently working on.)
• Section 1: Lists, Stacks, and Queues
• Section 2: Heaps and Trees
• Section 3: Sorting Algorithms
• Section 4: Searching
• Section 5: Recursion
• Conclusion
• References

Each week, you will add to this document and submit for grading. As a preview, each section will contain the following:

• Section 1: Lists, Stacks, and Queues
• Implement 2 programs for the following:
• Section 2: Heaps and Trees
• Implement pseudo code for a hash table and resolve collisions with a linked list.
• Section 3: Sorting Algorithms
• Compare sort algorithms.
• Section 4: Searching
• Implement pseudo code to search for values in a linked list or array.
• Section 5: Recursion
• Implement pseudo code to create a factorial of a number using recursion.

Week 1: Assignment Details

The task this week is to complete the following 2 structures using a linked list:

Assume the occurrence of a linked list node is represented by the object “Node” and its “Data” and “NextRef” attributes.

Part 1: Assume a “Head” node exists with the NextRef attribute pointing to the first node in the stack or being null if the stack is empty. Create pseudo code for the following 3 stack methods, showing the logic tied to the inverted list. Include a summary of these actions.

push( item )
pop( )
display( )

Part 2: Assume “Front” and “Rear” nodes exist with the “NextRef” attributes pointing to the first and last nodes of the queue or being null if the queue is empty. Create pseudo code for the following 3 queue methods, showing the logic tied to the inverted list. Include a summary of these actions.

enqueue( item )
dequeue( )
display( )

Week 1 Deliverables:

• Pseudo code implemented for both the stack and queue methods
• Documented pseudo code
• Add the completed pseudo code and discussion to the Key Assignment template Section 1: Lists, Stacks, and Queues.
• Name the document “IT265__IP1.doc.”
Calculate your paper price
Pages (550 words)
Approximate price: -

Why Work with Us

Top Quality and Well-Researched Papers

We always make sure that writers follow all your instructions precisely. You can choose your academic level: high school, college/university or professional, and we will assign a writer who has a respective degree.

Professional and Experienced Academic Writers

We have a team of professional writers with experience in academic and business writing. Many are native speakers and able to perform any task for which you need help.

Free Unlimited Revisions

If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.

Prompt Delivery and 100% Money-Back-Guarantee

All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.

Original & Confidential

We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.

24/7 Customer Support

Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.

Try it now!

## Calculate the price of your order

Total price:
\$0.00

How it works?

Follow these simple steps to get your paper done

Place your order

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Receive the final file

Once your paper is ready, we will email it to you.

Our Services

No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.

## Essay Writing Service

No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.

Admission Essays & Business Writing Help

An admission essay is an essay or other written statement by a candidate, often a potential student enrolling in a college, university, or graduate school. You can be rest assurred that through our service we will write the best admission essay for you.

Editing Support

Our academic writers and editors make the necessary changes to your paper so that it is polished. We also format your document by correctly quoting the sources and creating reference lists in the formats APA, Harvard, MLA, Chicago / Turabian.

Revision Support

If you think your paper could be improved, you can request a review. In this case, your paper will be checked by the writer or assigned to an editor. You can use this option as many times as you see fit. This is free because we want you to be completely satisfied with the service offered.