Algorithms and pseudocodes Part 1 Choose 2 sorting algorithms and 2 searching algorithms, and describe them in detail, including the type of data structures they work well with. Complete the following: • For 1 of the selected search algorithms, write pseudocode, and create a flowchart to show how the algorithm could be implemented to search data in the data structure. • For 1 of the selected sort algorithms, write pseudocode, and create a flowchart to show how the algorithm could be implemented to sort data in the data structure. • Give the pseudocode and flowchart that would show how one of the additional data structures could be implemented to search data. • In addition, create a flowchart to show how to sort using one of the additional algorithms. o Give the pseudocode for the flowchart as well. Please submit the following for your assignment in a single MS Word document: • 2 flowcharts (1 for a searching algorithm and 1 for a sorting algorithm) • 2 pseudocode examples (1 for a searching algorithm and 1 for a sorting algorithm) Note: Diagrams created in separate programs should be copied and pasted into your document for submission. Part 2 Complete the following: • Describe how arrays are implemented in Java. • Provide Java code to illustrate how to create an array, reference an array, and address an element of an array. • Create a flowchart and provide the corresponding pseudocode to show how to sort an array using the bubble sort. • Create a flowchart and provide the corresponding pseudocode to show how to search an array for a specified value using the sequential search algorithm. Part 3 Complete the following: • Create a flowchart to represent the Push and Pop operations for a Stack based on a linked list data structure. • Create a flowchart to represent the Enqueue and Dequeue operations for a Queue based on a linked list data structure. • Write the required Java code to implement either a Stack or a Queue data structure based on a linked list. The code should include the class constructors, the necessary properties, and methods to add and remove elements from the data structure. Do not use the built-in Java Stack class or the built-in Java Queue interface or the built-in Java linked list (you should create your own code for these classes).
Do you need a similar assignment done for you from scratch? We have qualified writers to help you. We assure you an A+ quality paper that is free from plagiarism. Order now for an Amazing Discount! Use Discount Code “Newclient” for a 15% Discount!NB: We do not resell papers. Upon ordering, we do an original paper exclusively for you.
The post algorithms-flowcharts-and-pseudocode appeared first on Essay Fount.
What Students Are Saying About Us
.......... Customer ID: 12*** | Rating: ⭐⭐⭐⭐⭐"Honestly, I was afraid to send my paper to you, but you proved you are a trustworthy service. My essay was done in less than a day, and I received a brilliant piece. I didn’t even believe it was my essay at first 🙂 Great job, thank you!"
.......... Customer ID: 11***| Rating: ⭐⭐⭐⭐⭐
"This company is the best there is. They saved me so many times, I cannot even keep count. Now I recommend it to all my friends, and none of them have complained about it. The writers here are excellent."
"Order a custom Paper on Similar Assignment at essayfount.com! No Plagiarism! Enjoy 20% Discount!"
