Write a method evensum that returns the sum of the values in even indices in a list of integers. Assume we are using a zero-based indexing where the first value in the list has index a, the second value has index 1, and so on. The values in which we are interested in are the ones with even indices (the value at index e, the value at index 2, the value at index 4, and so on). For example, if a variable list stores the following sequence of values: [1, 18, 2, 7, 39, 8, 48, 7] Then the call of 1list.evensum(); should return the value 82 (1 + 2 + 39 - 48 ). Notice that what is important is the position of the numbers (index e, index 2, index 4, etc.), not whether the numbers themselves are even. If the list is empty, your method should return a sum of a. Assume that we are adding this method to the LinkedIntList class as shown below. You may not call any other methods of the class to solve this problem and your method cannot change the contents of the list. public class LinkedIntlist { private ListNode front; public class ListNode { public int data; public ListNode next;
Write a method evensum that returns the sum of the values in even indices in a list of integers. Assume we are using a zero-based indexing where the first value in the list has index a, the second value has index 1, and so on. The values in which we are interested in are the ones with even indices (the value at index e, the value at index 2, the value at index 4, and so on). For example, if a variable list stores the following sequence of values: [1, 18, 2, 7, 39, 8, 48, 7] Then the call of 1list.evensum(); should return the value 82 (1 + 2 + 39 - 48 ). Notice that what is important is the position of the numbers (index e, index 2, index 4, etc.), not whether the numbers themselves are even. If the list is empty, your method should return a sum of a. Assume that we are adding this method to the LinkedIntList class as shown below. You may not call any other methods of the class to solve this problem and your method cannot change the contents of the list. public class LinkedIntlist { private ListNode front; public class ListNode { public int data; public ListNode next;
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Java
![Write a method evensum that returns the sum of the values in even indices in a list of integers.
Assume we are using a zero-based indexing where the first value in the list has index e, the second
value has index 1, and so on. The values in which we are interested in are the ones with even
indices (the value at index e, the value at index 2, the value at index 4, and so on). For example, if
a variable list stores the following sequence of values:
[1, 18, 2, 7, 39, 8, 48, 7]
Then the call of list.evensum(); should return the value 82 (1 + 2 + 39 + 40 ). Notice that what is
important is the position of the numbers (index a, index 2, index 4, etc.), not whether the
numbers themselves are even. If the list is empty, your method should return a sum of e.
Assume that we are adding this method to the LinkedIntList class as shown below. You may not call
any other methods of the class to solve this problem and your method cannot change the contents
of the list.
public class LinkedIntlist {
private ListNode front;
public class ListNode {
public int data;
public ListNode next;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F26e509f6-d35a-44c9-95ba-d273bdf29c4f%2Fe0a1b9d7-b6cc-4121-84be-f31d0e4aad52%2F3x06pfs_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Write a method evensum that returns the sum of the values in even indices in a list of integers.
Assume we are using a zero-based indexing where the first value in the list has index e, the second
value has index 1, and so on. The values in which we are interested in are the ones with even
indices (the value at index e, the value at index 2, the value at index 4, and so on). For example, if
a variable list stores the following sequence of values:
[1, 18, 2, 7, 39, 8, 48, 7]
Then the call of list.evensum(); should return the value 82 (1 + 2 + 39 + 40 ). Notice that what is
important is the position of the numbers (index a, index 2, index 4, etc.), not whether the
numbers themselves are even. If the list is empty, your method should return a sum of e.
Assume that we are adding this method to the LinkedIntList class as shown below. You may not call
any other methods of the class to solve this problem and your method cannot change the contents
of the list.
public class LinkedIntlist {
private ListNode front;
public class ListNode {
public int data;
public ListNode next;
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education