Fluent Essays

I expect at least 90 points.\Lab 10 RubricLab 10 RubricCriteriaRatingsPtsThis criterion is linked to a learning outcomeProgram must use a stack6.0PtsA stack is used4.0 PtsSome other data structure used2.0 PtsSyntax or other major problems with code0.0 PtsNot submitted6.0ptsThis criterion is linked to a learning outcomeProgram must use a method to calculate if a number is prime6.0PtsFull Marks4.0 PtsPrime calculated with inline code.3.0 PtsSyntax or other major problems0.0 PtsNot submitted6.0ptsThis criterion is linked to a learning outcomeProgram produces correct output5.0 PtsOutput is correct4.0 Pts1 minor logic error3.0 PtsRuntime or other major errors0.0 PtsNot submitted5.0ptsThis criterion is linked to a learning outcomeJava code3.0 PtsCode is clean, easy to read2.0 PtsCode is hard to read0.0 PtsNot submitted3.0ptsTotal points: 20.0Module 11 LabModule 11 LabCriteriaRatingsPtsThis criterion is linked to a learning outcomeheight() method8.0 PtsCoded, produces correct output given the inputs6.0 PtsCoded but has logical errors4.0 PtsCoded but has runtime, syntax or other serious errors.0.0 PtsNot submitted8.0 ptsThis criterion is linked to a learning outcomebreadthFirstTraversal() method9.0 PtsCoded, produces correct output given the inputs7.0 PtsCoded but has logical errors5.0 PtsCoded but has runtime, syntax or other serious errors.0.0 PtsNot submitted9.0 ptsThis criterion is linked to a learning outcomeJava code3.0 PtsIn general, your code is clear, your logic is easy to follow, appropriate variable names, constants, use of comments2.0 PtsYour code is a bit hard to follow, some cryptic variable names, etc.0.0 PtsNo Marks3.0 ptsTotal points: 20.0 cs282lab10.pdf cs282lab11.pdf pseudocode_2.txt Unformatted Attachment Preview Cuyamaca College CS-282 Intermediate Java Programming John Gerstenberg, Instructor Lab # 10 Student Learning Outcomes   .Experience with Stacks and queues Working with generics Overview This exercise is based on exercise 24.4 on page 949. In this lab, you will work with a stack. Exercise 1: Develop an application that displays the first 50 prime numbers in descending order. You may use any of the stack classes presented with this chapter. You may implement this as a console application or with JavaFX. Sample code to determine if a number is prime can be found in the textbook. Your program output must produce the following display of values: Grading Criteria: Deliverable Program uses a stack Program calculates if a number is prime Points 6 6 Breakdown Program uses a stack class Program uses a method to calculate if a number is prime Program produces correct output Java code 5 Output is correct 3 In general, your code is clear, your logic is easy to follow, appropriate variable names, constants, use of comments Total 20 1 Cuyamaca College CS-282 Intermediate Java Programming John Gerstenberg, Instructor Lab # 11 Student Learning Outcomes    Experience Binary Search Trees (BST) Working with generics Enhancing an existing project. Overview This exercise is based on exercise 25.1 on page 984. In this lab, you will work with a BST and add some functionality. It is pretty rare you will ever have to implement a BST completely from scratch and there are loads of working BST samples in textbooks and online. However, in real world software development, it’s not unusual to add missing functionality or otherwise modify a “classic” data structure such as a BST to fit a particular project need. Exercise 1: Be sure to download the Module 11 zip file as this will give you the Tree interface and BST class from the textbook along with a main() method. You will implement the missing height() method and breadthFirstTraversal() methods. 1 You are also given a working main method to test everything out. When testing the height() method, you will have to enter 6 string words. Grading Criteria: Deliverable Height() method breadthFirstTraversal() method Points 8 9 Breakdown Coded, produces correct output given the inputs Coded, produces correct output given the inputs Java code 3 In general, your code is clear, your logic is easy to follow, appropriate variable names, constants, use of comments Total 20 2 // height() method is overloaded height() return height(root) height(root) if root is null return - 1 else return 1 + max(height(root.left), height(root.right)) // breadth first traversal create queue of tree nodes if root is not null then add root node to queue while queue is not empty node = first item in queue display node value if left node is not null then add left node to queue if right node is not null add right node to queue end while end if ... Purchase answer to see full attachment