B: Count evens Write a function count_evens() that has four integer parameters, and returns the count of parameters where the value is an even number (i.e. evenly divisible by 2). Ex: If the four parameters are: 1 22 11

B: Count evens Write a function count_evens() that has four integer parameters, and returns the count of parameters where the value is an even number (i.e. evenly divisible by 2). Ex: If the four parameters are: 1 22 11

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 6PE

See similar textbooks

20.1 LAB: Count evens

Write a function count_evens() that has four integer parameters, and returns the count of parameters where the value is an even number (i.e. evenly divisible by 2).

Ex: If the four parameters are:

then the returned count will be:

Hint: Use the modulo operator % to determine if each number is even or odd.

Your program must define the function:
count_evens(num1, num2, num3, num4)

Use Python to help me with this.

LAB
20.1.1: LAB: Count evens
0/10
АCTIVITY
main.py
Load default template...
1 # Define your function here
2
3 if
_main_':
name
num1 = int(input())
num2 = int(input ())
num3 = int(input ())
num4 = int (input())
4
5
6
7
8
9
result = count evens (num1, num2, num3, num4)
print('Total evens:', result)
10

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!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions

Implement a __setitem__ function that also supports negative indices. For example: W = L2(Node(10, Node(20, Node(30))))print W[ 10, 20, 30 ] W[1]=25print W[ 10, 25, 30 ] W[-1]=35print W[ 10, 25, 35 ] Complete the code: def L2(*args,**kwargs): class L2_class(L): def __getitem__(self, idx): <... YOUR CODE HERE ...> def __setitem__(self, idx, value): <... YOUR CODE HERE ...> return L2_class(*args,**kwargs) W = L2(Node(10, Node(20, Node(30))))print(W)W[1]=25print(W)W[-1]=35print(W)
Implement a class representing a circular sorted linked list. The class must have the following requirements: The linked list and the nodes must be implemented as C++ templates First must point to the largest value in the list It must include a constructor, a destructor, a copy constructor and an operator= It must include functions to insert a given item, delete a given item, search for a given item, check if the list is empty, return the length of the list and print the list (from smallest to largest) Hint: Use the menu-driven program of the linked list to test all the functions in your class. Screenshot the output and make comments on each area on the program.
Write a C++ class implementing DOUBLE THREADED BINARY SEARCH TREE that supports the following operations: kthElement(k) -- finds the k-th largest element in the BST and prints the key value. Your code should run in O(h) time. Note: It has be done using double threaded binary search tree. Please comment your code and share the screenshot of the output
Write c++ code Implement a class (template) SortedSet which is actually a singly linked list with head and tail pointers. It will store data in ascending order while disallowing duplicate data. Implement the following member functions for this class.1. Default Constructor. SortedSet();2. An insert function that will insert the data such that resultant set is in ascending order. Duplicate data will not be allowed. void insert(T const data);3. A delete function that will delete the element at the given index. void delete(int const index);4. A print function that will print the contents of the sorted set. void print() const;5. A union function that will be passed another sorted set. This function will take union of two setsand store the result in the first set. void union(SortedSet<T>const &otherSet);For example:SortedSet a; (suppose it has 1, 2, 3, 4, 10, 50)SortedSet b; (suppose it has 6, 10, 11)a.union(b); (a will now contain 1, 2, 3, 4, 6, 10, 11, 50)6. An intersection…
Question 5 Computer Science IN Erlang please Implement function replicate/2 that takes an object O and a positive integer number N and returns a list of O's replicated N times. For example, replicate(atom,5) shall return [atom,atom,atom,atom,atom].
6.Need ri Write a JAVA program that will maintain a phone directory using a Linked-List. The program should be able to perform the following operations: Add persons details (first name, last name, phone number, city, address, sex and email) to the phone directory, where phone numbers in the directory have to be unique. (Note: each person record will store in one node in the linked-list and insert each person to the last) Delete any person details by a given phone number. Update telephone number by providing person first name. Display all details of persons from a phone directory. Search telephone number based on person first name. (Note: use sequential search to find all telephones for the given first name) Sort all persons in the phone directory ascending based on person first name. (Note: use bubble or selection sort to arrange the entire phone directory.
PP 12.7 Implement an postfix-to-infix translator using stacks. The applicationshould repeatedly read a postfix expression and print the equivalentinfix expression until the user quits. Throw an exception if the postfixexpression entered is invalid.PP 12.8 Implement a class called ReverseWords that uses a stack to output a set of elements input by the user in reverse order.
9.5.1: Use the addChoice method to add any needed instance variables. Provide a different implementation of ChoiceQuestion. Instead of storing the choices in an array list, the addChoice method should add the choice to the question text. For this purpose, an addLine method has been added to the Question class. ChoiceQuestion.java: /** A question with multiple choices.*/public class ChoiceQuestion extends Question{ // Add any needed instance variables, but don't store the choices // The choices should be added to the text of the superclass /* Your code goes here */ /** Constructs a choice question with a given text and no choices. @param questionText the text of this question */ public ChoiceQuestion(String questionText) { /* Your code goes here */ } /** Adds an answer choice to this question. @param choice the choice to add @param correct true if this is the correct choice, false otherwise */ public void…
Question 1:Convert a decimal to binary and binary to decimal using recursionTest your implementation with following examples:● (1947)10 = (11110011011)2● (1992)10 = (11111001000)2● (2021)10 = (11111100101)2Question 2:Implement a member function that prints a singly linked list in reverse order without creating acopy or changing the original List.void printBackwards() constQuestion 3:Implement a recursive member function “isSorted” which recursively checks whether the linked listis sorted (ascendingly).bool isSorted() constQuestion 4:You will implement a function bool Equalize_Occurrences (char key, int maxcount) of theclass list, that will take a character key and maximum count for the consecutive occurrences of thekey inparameters. It will then traverse the list, verify and update the consecutive occurrences of the keyaccordingto maximum count and returns true. It returns false if no occurrence of key is found.Note: You can traverse the list only once for this task.
bubblesort.h is in second picture This is bublesort.c int compare(Entry a, Entry b) {// IMPLEMENT}/*TEST: ./mergesort < test.inOUTPUT:1 lsdfjl2 ghijk3 ksdljf5 abc6 def*/int main(void) {// IMPLEMENT} this is test.in 55 abc6 def2 ghijk3 ksdljf1 lsdfjl
Write a C++ program that: (1) defines and implements a hash class that constructs a 15 element vector, storing strings, using the following hash function: ((first_letter) + (last_letter) - (second_letter))% 15 So, for example, the word "rocky" would be ('r') = 114 + ('y') = 121 - ('o') = 111 = 124%15 = 4 In this example, an attempt would be made to store "rocky" in position 4. In the event of a collision, the word would be stored in the first available location, so if there is a collision in location 4, an attempt would be made to store the word in location 5. If an attempt to store a word in position 14 fails because the location is full circle back to location 0 because there is no location 15. If there is a collision in location 0, try location 1, and so on. I will not try your program with words that are shorter than three letters, so you do not need to consider shorter words. (2) the driver program should: a. query the user for ten words and store them…
You are required to demonstrate the running time difference between a linked listand a binary search tree while searching the data. Read the following instructionsand then implement a C++ program that can address the above requirement.1- choose byself a .csv file containing the data named Dataset.csv The dataset file contains a record of 100000 sales records of astore. By using the text file reading method in C++, read the data of the file in alinked list and a binary search tree. (In a single program) After reading the data validate the data reading by implementing a print() method. Take a sales id as an input from the user and search that ID in the linked listand binary search tree. Display the running time difference of both data structures during the searchoperation.