Use a pseudo programming language to find the largest number (Maximum element) among a1, a2,........,an StartLoop(Using a pseudo programming language)Nameprocedure max(a₁, ..., an: integers)max = a₁ {max has the largest number found so far}for i:= 2 to nif max ≤ a, then max := a₁endfor{max is the largest element}Comment

Pseudo Programming Language or Pseudo code can be defined as a method that helps the programmer in…

Answered: Use a pseudo programming language to…

Engineering

Computer Science

Use a pseudo programming language to find the largest number (Maximum element) among a1, a2,........,an

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 11RQ

See similar textbooks

Similar questions

python Geography Grades 3Make a copy of your program for the problem Geography Grades 2 and change thecode in such a way that your program can process multiple groups.These groups are on the input separated by ’=\n’. Every group starts with a first line that contains the name of thegroup and the lines after contain the information about the students in the same way as is specified for the problem Geography Grades 1.With the input1bErik Eriksen__________4.3 4.9 6.7Frans Franssen________5.8 6.9 8.0=2bAnne Adema____________6.5 5.5 4.5Bea de Bruin__________6.7 7.2 7.7Chris Cohen___________6.8 7.8 7.3Dirk Dirksen__________1.0 5.0 7.7The output should be:Report for group 1bErik Eriksen has a final grade of 6.0Frans Franssen has a final grade of 7.0End of reportReport for group 2bAnne Adema has a final grade of 6.0Bea de Bruin has a final grade of 7.0Chris Cohen has a final grade of 7.5Dirk Dirksen has a final grade of 4.5End of report"""import sysgroups = sys.stdin.read().split("=\n")for…
Computer Science This is a codingbat problem. Please answer in Java and do not change the starter code. You have been asked to write the game of tic tac toe. In the first version of the game, we will only be comparing horizontally for a win. A win is determine by all of the elements in a row either being an X or an O. You need to return a String with the winner or TIE if there is no winner. ticTacToe(["X", "O", "O"], ["X", "O", "O"], ["X", "X", "X"]) → "X"ticTacToe(["X", "O", "X"], ["X", "X", "O"], ["O", "O", "O"]) → "O"ticTacToe(["X", "O", "X"], ["X", "X", "O"], ["O", "X", "O"]) → "TIE" public String ticTacToe(String[] top, String[] middle, String[] bottom) { }
def small_index(items: list[int]) -> int:"""Return the index of the first integer in items that is less than its index,or -1 if no such integer exists in items.>>> small_index([2, 5, 7, 99, 6])-1>>> small_index([-5, 8, 9, 16])0>>> small_index([5, 8, 9, 0, 1, 3])3"""
Count the number of elements in a that have values between 10 and 20 inclusive. int count=0; for(int i=0;i<10,i++) { if(a[i]>=10 && a[i]<=20) { count=count+1; } System.out.println(“count… = “+ count); }
DNA Max Write code to find which of the strands representing DNA in an array String[] strands representing strands of DNA has the most occurrences of the nucleotide represented by parameter nuc. Complete the definition of the class DnaMax and method definition maxStrand shown below. If more than one strand has the same maximal number of the specified nucleotide you should return the longest strand with the maximal number. All DNA strands have different lengths in this problem so the maximal strand will be unique when length is accounted for. Return this uniquely maximal strand. Each String representing a DNA strand will contain only cytosine, guanine, thymine, and adenine, represented by the characters 'c', 'g', 't', and 'a', respectively. If no strand in the array contains the specified nucleotide return the empty string "". public class DnaMax { public String maxStrand(String[] strands, String nuc) { // fill in code here } } Constraints strands will contain no more than 50 elements,…
Transcribed Image Text JAVA Programming Problem: In the game of "Assassin's Creed", you control a ship with a cannon which is attacking a large enemy Assassin's Creed, armed with many guns. Your goal is to destroy as many of the guns as possible. The battle field is a 2D Cartesian grid, where your cannon is located at the origin. The enemy Assassin's Creed is a horizontal line segment located from the coordinates (X1, Y) to (X2, Y). There are exactly (X2 - X1 + 1) guns on the ship, located at the integer points (X1, Y), (X1+1, Y), ..., (X2, Y). However, the problem is, you cannot always fire at a gun. There are supernatural rocks located at all points of the battlefield whose X and Y coordinates are both integers. In order to fire successfully at an enemy's gun, the line connecting your cannon and that gun must not go through any rocks. Develop a JAVA code to output the number of the enemy battleship's guns that your cannon can destroy. Test Case Result 1 2 2 -2
Perform the following. 1) Conver the infix expression a/b-c+d*e-a*c into postfix expression and trace that postfix expression for given data a=6, b=3, c=1, d=2 , e=4 .2) A student is asked to develop an application as part of mini project which reverses the order of numbers, such that the number that is placed last in the list will be removed first. The list can hold any number of elements. Implement the following menu based C++program for the same.
Using JavaScriptDefine a function getMonth which accepts number from 1 to 12 as an argument and return the descriptive name of the month. For example: getMonth(1) should return January while getMonth(12) returns December, finally getMonth(-1) returns null. Use array or object to define a list of names for the month and refrain from using if statement to check the argument if it's 1, 2, etc.
5.20 LAB: Two smallest numbers (JAVA) Write a program in java that reads a list of integers, and outputs the two smallest integers in the list, in ascending order. The input begins with an integer indicating the number of integers that follow. You can assume that the list will have at least 2 integers and fewer than 20 integers. Ex: If the input is: 5 10 5 3 21 2 the output is: 2 and 3 To achieve the above, first read the integers into an array. Hint: Make sure to initialize the second smallest and smallest integers properly. Code starts here: import java.util.Scanner; public class LabProgram { public static void main(String[] args) { /* Type your code here. */ }}
please code in python Forbidden concepts: arrays/lists (data structures), recursion, custom classes You have been asked to take a small icon that appears on the screen of a smart telephone and scale it up so it looks bigger on a regular computer screen.The icon will be encoded as characters (x and *) in a 3 x 3 grid as follows: (refer image1 ) Write a program that accepts a positive integer scaling factor and outputs the scaled icon. A scaling factor of k means that each character is replaced by a k X k grid consisting only of that character. Input Specification:The input will be an integer such that 0 < k ≤ 10. Output Specification:The output will be 3k lines, which represent each individual line scaled by a factor of k and repeated k times. A line is scaled by a factor of k by replacing each character in the line with k copies of the character. [refer image2]
ONLY IF STATEMENTS ALLOWED!!!! NO RANGE FUNCTION, NO SETS, NO LISTS, NO LOOPS, ETC Angela loves reading books. She recently started reading an AI generated series called “Harry Trotter”. Angela is collecting books from the series at her nearest bookstore. Since the series is AI generated, the publishers have produced an infinite collection of the books where each book is identified by a unique integer. The bookstore has exactly one copy of each book. Angela wants to buy the books in the range [l,r], where l ≤ r. As an example, the range [−3,3] means that Angela wants to buy the books − 3, − 2, − 1, 0, 1, 2, and 3. Dan also loves the series (or maybe annoying Angela – who knows, really), and he manages to sneak into the bookstore very early to buy all of the books in the range [d,u], where d ≤ u. When Angela later visits, sadly she will not find those books there anymore. For example, if Angela tries to buy books [−2,3] and Dan has bought books [0,2], Angela would only receive books…
THERE'S A SAME PERSON WHO ANSWERS INCORRECTLY PLEASE IF YOU SEE THIS DON'T JUST COPY PASTE YOUR ANSWER FROM MY PREVIOUS QUESTION COZ ITS NOT CORRECT. THIS IS MY 3RD TIME ASKING THE SAME QUESTION. PLEASE READ THE INSTRUCTIONS CAREFULLY C++ PROGRAMMING Please implement these 2 methods for the node where: int get_depth(): - Returns the depth of the node. int get_height():- Returns the height of the node. Note: Do not add new member variables for the depth and height. Initial code to be completed: node.h struct node { node* parent; node* right; node* left; int element; int get_depth() { //Note: Do not add new member variables for the depth and height return 0; } int get_height() { //Note: Do not add new member variables for the depth and height. return 0; }};