CS 282 GCCCD 50 Prime Numbers in Descending Order Application Project I expect at least 90 points. Lab 10 Rubric Lab 10 Rubric Criteria Ratings Pts T

CS 282 GCCCD 50 Prime Numbers in Descending Order Application Project I expect at least 90 points.

Lab 10 Rubric

Lab 10 Rubric

Criteria Ratings Pts

This criterion is linked to a learning outcomeProgram must use a stack

6.0Pts

A stack is used

4.0 Pts

Some other data structure used

2.0 Pts

Syntax or other major problems with code

0.0 Pts

Not submitted

6.0pts

This criterion is linked to a learning outcomeProgram must use a method to calculate if a number is prime

6.0Pts

Full Marks

4.0 Pts

Prime calculated with inline code.

3.0 Pts

Syntax or other major problems

0.0 Pts

Not submitted

6.0pts

This criterion is linked to a learning outcomeProgram produces correct output

5.0 Pts

Output is correct

4.0 Pts

1 minor logic error

3.0 Pts

Runtime or other major errors

0.0 Pts

Not submitted

5.0pts

This criterion is linked to a learning outcomeJava code

3.0 Pts

Code is clean, easy to read

2.0 Pts

Code is hard to read

0.0 Pts

Not submitted

3.0pts

Total points: 20.0

Module 11 Lab

Module 11 Lab

Criteria Ratings Pts

This criterion is linked to a learning outcomeheight() method

8.0 Pts

Coded, produces correct output given the inputs

6.0 Pts

Coded but has logical errors

4.0 Pts

Coded but has runtime, syntax or other serious errors.

0.0 Pts

Not submitted

8.0 pts

This criterion is linked to a learning outcomebreadthFirstTraversal() method

9.0 Pts

Coded, produces correct output given the inputs

7.0 Pts

Coded but has logical errors

5.0 Pts

Coded but has runtime, syntax or other serious errors.

0.0 Pts

Not submitted

9.0 pts

This criterion is linked to a learning outcomeJava code

3.0 Pts

In general, your code is clear, your logic is easy to follow, appropriate variable names, constants, use of comments

2.0 Pts

Your code is a bit hard to follow, some cryptic variable names, etc.

0.0 Pts

No Marks

3.0 pts

Total points: 20.0 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