Write an algorithm based on Pattern 2.3 Note that you will need to modify step 4ai 23:24Pattern 2.3 List filtering (B2 P2,p. 80)1(Filters an existing list and generates a new list that onlyincludes those values of the input list that satisfy somecondition.)2344a5learn2.open.ac.uk4aiNO 95%|||initialise the input_list with the given valuesinitialise other inputs of the probleminitialise the output_list to the empty listfor each input_value of the input_list:if the input_value satisfies the condition:append the input_value to the output_listprint the output_listNote that step 1 leaves open how the list is initialised.It could have been generated as in the pattern: listgeneration.74

Answered: Pattern 2.3 List filtering (B2 P2,…

Engineering

Computer Science

Pattern 2.3 List filtering (B2 P2, 5.80) □

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

See similar textbooks

Similar questions

Answer the given question with a proper explanation and step-by-step solution. Part 1: Implement the quickselect median algorithm Implement the median algorithm from test 1, which is called the "quickselect" algorithm (due to it's relationship to quicksort). Note, it can be used to find the i-th smallest element for any value of i, but we'll just use it to find the median (i = length/2) The algorithm uses the partition helper method (provided) to find the median. The partition method moves small elements, to the left side, and big elements to the right side. Finding the median requires moving all elements smaller than the median to the left half, and all elements greater to the right half. We can call repeatedly partition in a binary-search-like manner to quickly put the median in the right place. Implement the driver method public static int median(int[] arr) which returns the median value, and modifies the input array so all small elements are in the left half, and all big elements…
solve with python language please
Modify the code to generate the Fibonacci sequence in the following ways, and complete each ofthe tasks using both the for- and while-loop.(a) Change the first two elements to 2 and 2.(b) Change the first two elements to 3 and 2.(c) Change the update rule from summing successive elements to taking differences of successiveelements. For example, the third element is defined as the second element minus the first element, andso on.(d) Change the update rule so that each element is defined as the sum of the three precedingelements. Set the third element as 1 in order to start the process.
I need the code from start to end with no errors and the explanation for the code ObjectivesJava refresher (including file I/O)Use recursionDescriptionFor this project, you get to write a maze solver. A maze is a two dimensional array of chars. Walls are represented as '#'s and ' ' are empty squares. The maze entrance is always in the first row, second column (and will always be an empty square). There will be zero or more exits along the outside perimeter. To be considered an exit, it must be reachable from the entrance. The entrance is not an exit.Here are some example mazes:mazeA7 9# # ###### # # ## # # #### # ## ##### ## ########## RequirementsWrite a MazeSolver class in Java. This program needs to prompt the user for a maze filename and then explore the maze. Display how many exits were found and the positions (not indices) of the valid exits. Your program can display the valid exits found in any order. See the examples below for exact output requirements. Also, record…
Answer the given question with a proper explanation and step-by-step solution. Need help with this problem. All help is appreciated thank you!
) Implement a quicksort with a 2k-sample-size-based sample. The sample should be sorted first, after which you should set up the recursive procedure to split the sample based on its median and to shift the two halves of the remaining sample to each subarray so they can be utilised in the subarrays without needing to be sorted again. The name of this algorithm is samplesort.
I have a MIPS program I'm working on and I need to make it so that the following print loop I have here prints in reverse order. Currently this piece of code will print out in the order of what was entered first (so if the word "apple" was entered first, it would be the first to output). I need to reverse that so that "apple" would be the last word to print from the list. Anyone got any ideas? L1: #### here i want to print the array #### add $t0, $zero, $zero # index of array addi $t1, $zero, 1 # counter=1 la $a0, text li $v0, 4 syscall jal new_line while: bgt $t1, $s0, done lw $t2, array($t0) li $v0, 4 move $a0, $t2 syscall jal new_line addi $t0, $t0, 4 addi $t1, $t1, 1 j while
Write the non-restoring division algorithm and perform the division of 9 divided by 4, showing all the steps involved in the process.
I need the answer quickly
A memory hierarchy contains a single cache with a miss rate of 2% that holds both instructions and data. The miss penalty to access main memory is 100 cycles. 15% of the instructions are jumps, 20% are stores, 20% are loads (30% have values used in the next instruction), 10% are branches (taken 20% of the time), and 35% are ALU instructions. Jumps and branches are determined in the ID stage. What is the base CPI, and what is the effective CPI?
USE PYTHON LANGUAGE. READ INPUT FROM FILE (NAME THE FILE "input.txt') The problem needs to be solved using Greedy Algorithm Strategy. Problem: Suppose, you have N number of assignments with their time intervals- i.e. starting and ending times. As you are a student, you need to find out how you can finish the maximum number of assignments. Now, Implement a greedy algorithm to find the maximum number of assignments that can be completed by you. The following conditions must be met when writing the code: A student can only work on a single assignment at a time. The input will contain N assignments, and then N lines with the starting time and ending time in the format given below: N S₁ E₁ S₂ E₂ ……. Sn En You have to read input from a file. The output will contain the maximum number of assignments that can be completed followed by the intervals of the selected assignment. Sample input and output is given below "input.txt”. Make sure to try out different input examples to ensure that…
You are going to write a MIPS program that does the following (there is C++ sample code below to explain the logic): • Create an array of 23 INTEGERS, you can put whatever you want in it, but they shouldn’t be sorted. Without using recursion: • Create a procedure to find the largest called findLargest • Create a procedure to find the smallest called findSmallest. • Create procedure called range, which is the difference between largest and smallest (range should call findLargest and findSmallest) • Create a recursive procedure to find the largest (call it findLargestRecursive)