Birds Survey Program Plan: Import required package. Define “BirdSurvey” class. Create object “headNode” from “ListNode”. Create constructor for “BirdSurvey” class. Define the method “getReport()”. Compute position of node. Check condition using “while” loop. Display bird name and count. Define the method “computeLength()”. Set count to “0”. Set “position” to “headNode”. Check condition using “while” loop. Increment count Finally returns count value. Define the method “addANodeToStart” which is used to add bird name at start of list by using “ListNode” class. Define the method “add” with the argument of “bird”. If head node is null, then add bird to the front of list. Otherwise Compute given bird name by calling the method “find” and then store result to “n”. If “n” is null, then increment count value. Otherwise, find the last node in the list. Add in the node by using “ListNode” class. Define the method “getCount” with the argument of “bird”. Declare required variable. Create list for nodelist. If the bird is not on the list, then assign result of count to “0”. Otherwise, compute the result associated with bird species. Finally returns the value of result. Define the method “onList” with the argument of “t”. This method is used to check whether target “t” is on the list or not Define the method “find” with the argument of “t”. Assign required variables. Check condition using “while” loop. Define inner node class “ListNode”. Declare required variables. Create parameterized constructor for “ListNode” class. Assign values to required variables. Define main function. Create object “bs” from “BirdSurvey” class. Create object for scanner class. Display statement. Assign “moreValue” to “true”. Check condition using “while” loop. Read bird name from user. If the bird name is “done”, then set “moreValue” to “false”. Otherwise, add the bird name to “bs”. Display the birds report by calling the method “getReport”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 12, Problem 13PP

Program Plan Intro

Birds Survey

Program Plan:

Import required package.

Define “BirdSurvey” class.

Create object “headNode” from “ListNode”.

Create constructor for “BirdSurvey” class.

Define the method “getReport()”.

Compute position of node.

Check condition using “while” loop.

Display bird name and count.

Define the method “computeLength()”.

Set count to “0”.

Set “position” to “headNode”.

Check condition using “while” loop.

Increment count

Finally returns count value.

Define the method “addANodeToStart” which is used to add bird name at start of list by using “ListNode” class.

Define the method “add” with the argument of “bird”.

If head node is null, then add bird to the front of list.

Otherwise

Compute given bird name by calling the method “find” and then store result to “n”.

If “n” is null, then increment count value.

Otherwise, find the last node in the list.

Add in the node by using “ListNode” class.

Define the method “getCount” with the argument of “bird”.

Declare required variable.

Create list for nodelist.

If the bird is not on the list, then assign result of count to “0”.

Otherwise, compute the result associated with bird species.

Finally returns the value of result.

Define the method “onList” with the argument of “t”.

This method is used to check whether target “t” is on the list or not

Define the method “find” with the argument of “t”.

Assign required variables.

Check condition using “while” loop.

Define inner node class “ListNode”.

Declare required variables.

Create parameterized constructor for “ListNode” class.

Assign values to required variables.

Define main function.

Create object “bs” from “BirdSurvey” class.

Create object for scanner class.

Display statement.

Assign “moreValue” to “true”.

Check condition using “while” loop.

Read bird name from user.

If the bird name is “done”, then set “moreValue” to “false”.

Otherwise, add the bird name to “bs”.

Display the birds report by calling the method “getReport”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

You may find a doubly-linked list implementation below. Our first class is Node which we can make a new node with a given element. Its constructor also includes previous node reference prev and next node reference next. We have another class called DoublyLinkedList which has start_node attribute in its constructor as well as the methods such as: 1. insert_to_empty_list() 2. insert_to_end() 3. insert_at_index() Hints: Make a node object for the new element. Check if the index >= 0.If index is 0, make new node as head; else, make a temp node and iterate to the node previous to the index.If the previous node is not null, adjust the prev and next references. Print a message when the previous node is null. 4. delete_at_start() 5. delete_at_end() . 6. display() the task is to implement these 3 methods: insert_at_index(), delete_at_end(), display(). hint on how to start thee code # Initialize the Node class Node: def __init__(self, data): self.item = data…

Implement class “LinkedList” which has two private data members head: A pointer to the Node class length: length of the linked listImplement the following private method:1. Node* GetNode(int index) const;A private function which is only accessible to the class methods. . For example, index 0 corresponds to the head and index length-1 corresponds to end node of the linked list. The function returns NULL if the index is out of bound.Implement the following public methods:2. LinkedList();Constructor that sets head to NULL and length equal to zero.3. bool InsertAt(int data, int index);Insert a new node at the index. Return true if successful, otherwise,return false. The new node should be at the position “index” in the linked list after inserting it. You might have to use GetNode private function. these 3 parts

LAB: Inserting an integer in descending order (doubly-linked list) Given main() and an IntNode class, complete the IntList class (a linked list of IntNodes) by writing the insertInDescendingOrder() method to insert new IntNodes into the IntList in descending order. Ex. If the input is: 3 4 2 5 1 6 7 9 8 -1 the output is: 9 8 7 6 5 4 3 2 1 ______________________________ import java.util.Scanner; public class SortedList { public static void main (String[] args) {Scanner scnr = new Scanner(System.in);IntList intList = new IntList();IntNode curNode;int num; num = scnr.nextInt(); while (num != -1) {// Insert into linked list in descending order curNode = new IntNode(num);intList.insertInDescendingOrder(curNode);num = scnr.nextInt();}intList.printIntList();}} __________________________________ public class IntList {// Linked list nodespublic IntNode headNode;public IntNode tailNode; public IntList() {// Front of nodes listheadNode = null;tailNode = null;} // appendpublic void…