Java: An Introduction to Problem Solving and Programming (7th Edition)
Java: An Introduction to Problem Solving and Programming (7th Edition)
7th Edition
ISBN: 9780133766264
Author: Walter Savitch
Publisher: PEARSON
Question
Book Icon
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”.

Blurred answer
Students have asked these similar questions
not sure how to do this problem output doesnt matter
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

Chapter 12 Solutions

Java: An Introduction to Problem Solving and Programming (7th Edition)

Ch. 12.1 - Prob. 12STQCh. 12.2 - Prob. 13STQCh. 12.2 - Prob. 14STQCh. 12.2 - Prob. 15STQCh. 12.2 - Prob. 16STQCh. 12.3 - Prob. 17STQCh. 12.3 - Prob. 18STQCh. 12.3 - Prob. 19STQCh. 12.3 - Write a definition of a method isEmpty for the...Ch. 12.3 - Prob. 21STQCh. 12.3 - Prob. 22STQCh. 12.3 - Prob. 23STQCh. 12.3 - Prob. 24STQCh. 12.3 - Redefine the method getDataAtCurrent in...Ch. 12.3 - Repeat Question 25 for the method...Ch. 12.3 - Repeat Question 25 for the method...Ch. 12.3 - Repeat Question 25 for the method...Ch. 12.4 - Revise the definition of the class ListNode in...Ch. 12.4 - Prob. 30STQCh. 12 - Repeat Exercise 2 in Chapter 7, but use an...Ch. 12 - Prob. 2ECh. 12 - Prob. 3ECh. 12 - Repeat Exercises 6 and 7 in Chapter 7, but use an...Ch. 12 - Write a static method removeDuplicates...Ch. 12 - Write a static method...Ch. 12 - Write a program that will read sentences from a...Ch. 12 - Repeat Exercise 12 in Chapter 7, but use an...Ch. 12 - Write a program that will read a text file that...Ch. 12 - Revise the class StringLinkedList in Listing 12.5...Ch. 12 - Prob. 12ECh. 12 - Write some code that will use an iterator to...Ch. 12 - Prob. 14ECh. 12 - Write some code that will use an iterator to...Ch. 12 - Prob. 17ECh. 12 - Revise the method selectionSort within the class...Ch. 12 - Repeat the previous practice program, but instead...Ch. 12 - Repeat Practice Program 1, but instead write a...Ch. 12 - Write a program that allows the user to enter an...Ch. 12 - Write a program that uses a HashMap to compute a...Ch. 12 - Write a program that creates Pet objects from data...Ch. 12 - Repeat the previous programming project, but sort...Ch. 12 - Repeat the previous programming project, but read...Ch. 12 - Prob. 9PPCh. 12 - Prob. 10PPCh. 12 - Prob. 11PPCh. 12 - Prob. 12PPCh. 12 - Prob. 13PPCh. 12 - Prob. 14PPCh. 12 - Prob. 15PP
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning