The solution must be unique and not copied , And that it be implemented on the netbooks and not on the editor online

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899604
Joined: Mon Aug 02, 2021 8:13 am

The solution must be unique and not copied , And that it be implemented on the netbooks and not on the editor online

Post by answerhappygod »

The solution must be unique and not copied , And that it
be implemented on the netbooks and not on the editor
online
The Solution Must Be Unique And Not Copied And That It Be Implemented On The Netbooks And Not On The Editor Online 1
The Solution Must Be Unique And Not Copied And That It Be Implemented On The Netbooks And Not On The Editor Online 1 (98.62 KiB) Viewed 31 times
I want a clear solution to this project in Java language, I want you to explain everything through the comments inside the code, attach the text code, attach the output screenshots and screenshots of the code, explaining everything, because the professor will discuss with us, so make the solution very clear and explained through the comments. The solution must be new and unique to me, not repeated by any student. PLEASE NOTE THAT THIS HOMEWORK WORTH A TOTAL OF 15 POINTS. Q1: You are required to implement a static generic method called deleteStackOddPositions that removes the elements in odd positions in a Stack s. The method deleteStack OddPositions receives a generic Stacks of integer elements as a parameter and delete odd positions elements. The original Stacks should be unchanged except for the deleted odd positions elements. public static <T> void delete StackOddPositions (Array Stack<T> s) { I'Your code should be here } As an example: if the method receives s={10, 20, 30, 40, 50, 60) Then after calling the method Stack & becomes: s={10, 30, 50) Q2: You are required to implement a static method called nextSum that calculates the sum of each two adjacent elements in a queue. The nextSum method must take a bounded queue q as a parameter and the result should be a new bounded queue q1 with the sum of each two adjacent elements in q. The original bounded queue q should be unchanged. public static ArrayBndQueue nextSum (ArrayBndQueue <Integer>q, ArrayBndQueue <Integer> q1) { //Your code should be here { Example 1: if the method receives q={10, 20, 30, 40, 50, 60), q1 ={ } then after calling the method q and q1 become: q={10, 20, 30, 40, 50, 60), q1 ={30, 70, 110}) Example2: if the method receives q={10, 20, 30, 40, 50), 91 = {} then after calling the method q and q1 become : q={10, 20, 30, 40, 50), 91=(30, 70, 50)
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Post Reply