![The University of Western Ontario Department of Computer Science London, Canada Software Tools and Systems Programming (Computer Science 2211A) LAB7 The week of October 22 - October 28, 2023 This lab is an exercise with pointer arithmetic. Question 2 of the lab exercise is taken from exercise 17 in Chapter 12 of our textbook: C Programming Language: A Modern Approach (Second Edition), by K. N. King. 1. Rewrite the following function to use pointer arithmetic instead of array subscripting. (In other words, eliminate the variables i and all of the [] operators.) Note that for any array a, the expression a[i] is equivalent to *(a+i). int sum_array(const int a[], int n) { int i, sum = 0; for (i = 0; i < n; i++) sum += a[i]; return sum; }](https://gotit-pro.com/wp-content/uploads/2023/10/c80fe157-523d-4b22-a16d-64c419fa011c.png)
THE UNIVERSITY OF WESTERN ONTARIO DEPARTMENT OF COMPUTER SCIENCE LONDON CANADA Software Tools and
Original price was: $10.00.$5.00Current price is: $5.00.
Download button will appear immediately after successful payment.
Full support will be provided with necessary files installation.
Get impeccable customized solution within 24 hours, hassle-free.
All Study Co-Pilots are evaluated by Gotit Pro as an expert in their subject area.
Description
The University of Western Ontario
Department of Computer Science
London, Canada
Software Tools and Systems Programming (Computer Science 2211A)
LAB7
The week of October 22 – October 28, 2023
This lab is an exercise with pointer arithmetic. Question 2 of the lab exercise is taken from exercise 17 in Chapter 12 of our textbook: C Programming Language: A Modern Approach (Second Edition), by K. N. King.
1. Rewrite the following function to use pointer arithmetic instead of array subscripting. (In other words, eliminate the variables i and all of the [] operators.) Note that for any array a, the expression a[i] is equivalent to *(a+i).
int sum_array(const int a[], int n)
{
int i, sum = 0;
for (i = 0; i < n; i++)
sum += a[i];
return sum;
}
You may also like…
-
![Perform the following tasks on your lab machine: 1. Create a list with the following numbers (100, 300, 500, 2300, 2500) using the range function and answer the following: a. Print the length of the list b. Print the elements in the list such that each element appears in a separate line c. Print the average of all the items in the list d. Replace the maximum element of the list with the average value of the list e. Insert a new element at index 7. The value of the new element is the nth root of the value that is located in the middle of the list. Take n from the user. f. Write a for loop to print the last 3 elements in the list in reverse order g. Divide the list into two new lists where the first 3 elements will be in list X and the remaining elements will be in list Y. Print both lists. 2. Create two empty dictionaries dict1 and dict2: a. Create dict1. dict1 has two keys: 'car type' and 'size'. The value of each field is obtained from the user. b. Create dict2. dict2 has three keys: 'engine', 'origin', and 'date of release'. The value of each field is obtained from the user. The value of "date of release" is a dictionary {'day': value, 'month': value, 'year': value]. c. Add another field 'color' to dict1 and initialize it with your favorite color. d. Using the values stored in dict1 and dict2, print the following statement: "The car type is considered a size car. It has an engine CC engine. It is released on day/month/year". e. Merge both dictionaries into one dictionary called dict. f. Use the keys() method to print the following sentence: "The keys of dict2 are: engine, origin, and date of release".](https://gotit-pro.com/wp-content/uploads/2023/10/60a12885-bc90-4a0c-aacb-ca765f70006e.jpg)
Perform the following tasks on your lab machine 1 Create a list with the following numbers
Waived! Original price was: $10.00.$5.00Current price is: $5.00. Add to cart -
Product
Waived! Original price was: $15.00.$10.00Current price is: $10.00. Add to cart -
As part of the second lab assignment we have now started on expansions on our calendar program
Waived! Original price was: $10.00.$5.00Current price is: $5.00. Add to cart -
square Root Approximation Calculations Find square root approximation of what number 55 ERROR
Waived! Original price was: $10.00.$5.00Current price is: $5.00. Add to cart -
![Your task is to implement in Python the following adversarial search algorithms (refer to lecture slides and/or your textbook for details | pseudocode provided below): MiniMax (as specified by the MINIMAX-SEARCH pseudocode below) When the game is complete, your program should display a corresponding message: X WON or O WON TIE X LOST or O LOST MiniMax with alpha-beta pruning (as specified by the ALPHA-BETA-SEARCH pseudocode below), and apply them to play the game of Tic-Tac-Toe (computer). Using any other approach is not going to be accepted. Problem input/command line interface: Your program should: Accept three (3) command line arguments, so your code could be executed with python cs480_P01_AXXXXXXXX.py ALGO FIRST MODE where: - cs480_P01_AXXXXXXXX.py is your python code file name, - ALGO specifies which algorithm the computer player will use: 1 - MiniMax, 2 - MiniMax with alpha-beta pruning, - FIRST specifies who begins the game: X When it is human player's turn, your program should display the following prompt: X's move. What is your move (possible moves at the moment are: | enter 0 to exit the game)? where: is a sorted list of all available moves at the moment, for example, if the board arrangement is: and it is X's move, the prompt should be: What is your move (possible moves at the moment are: 2, 3, 7, 9) | enter 0 to exit the game)? If the user enters anything other than 0/ valid move number (0 should terminate the game) your program should repeat the prompt above. Once the user enters a valid move, display the updated game board on screen. When it is the computer's turn (regardless of the game mode), your program should display (it could be an 'X' or 'O' move): X's selected move: Z. Number of search tree nodes generated: A.A.A where: - Z is the move/action number (a positive integer from the {1, 2, 3, 4, 5, 6, 7, 8, 9} set) selected by computer - A.A.A is the number of search tree nodes generated (the number of MiniMax nodes computer explored before making the decision [including "root"]) to select it. Follow it with the updated game board on screen. - NOTE!!! Computer's search tree move exploration order should be in a sorted fashion (1, 2, 3, 4, 5, 6, 7, 8, 9 | assuming HERE that ALL moves are available). 2 - computer (X) versus computer (O), Example: python cs480_P01_A11111111.py 2 X 1 If the number of arguments provided is NOT three (none, one, two or more than three) or arguments are invalid (incorrect ALGO, FIRST or MODE) your program should display the following error message: ERROR: Not enough/too many/illegal input arguments. and exit. Program details: Specific program details: The Tic-Tac-Toe game board is represented by 3x3 grid with cells numbered as follows - Possible moves/actions for both players match cell numbers (if a player wants to place an 'X' in the middle of the board, the move/action is '5'), Your program should begin by displaying the following information: Last Name, First Name, Axxxxxxxx solution: Algorithm: MiniMax with alpha-beta pruning First: X Mode: human versus computer where: - Axxxxxxxx is your IIT A number, - Algorithm is the algorithm specified by a command line argument, - First is the information who makes the first move as specified by a command line argument, - Mode is the game mode as specified by a command line argument, If the game mode is human versus computer display an empty board first and prompt the user to pick the move (see below)](https://gotit-pro.com/wp-content/uploads/2023/10/9a1b7061-c5a7-48b6-a744-6dc4634c6532.png)
Your task is to implement in Python the following adversarial search algorithms refer to lecture
Waived! Original price was: $15.00.$10.00Current price is: $10.00. Add to cart -
![3. Tuple Comprehension: a. Create a tuple with numbers from 1 to 10. b. Create a new tuple that contains the squares of each number in the original tuple using tuple comprehension. c. Print the original and new tuple. 4. Dictionary and List: a. Create a dictionary of items and their prices. b. Create a shopping list as a list of tuples, where each tuple contains an item and the quantity you want to buy. c. Calculate the total cost of your shopping list. d. Print out the items and quantities in your shopping list along with their total cost. 5. Given the following two lists, print the elements from the color list whose index is listed in the favorite list: color = [Red, Green, White, Black, Pink, Yellow] favorite = [1, 4, 3]](https://gotit-pro.com/wp-content/uploads/2023/10/2634da87-0fcd-41b2-93dd-54928f2e0de3.jpg)
3 Tuple Comprehension a Create a tuple with numbers from 1 to 10 b Create a new tuple that
Waived! Original price was: $10.00.$5.00Current price is: $5.00. Add to cart
Related products
-
use Python In Minecraft, potions can be made and drank. When drank, they apply the corresponding…
Waived! Original price was: $30.00.$20.00Current price is: $20.00. Add to cart -
![Large Integers Part #1 Largelnteger Class An array can be used to store large integers, one digit at a time. For example, the integer 1234 could be stored in the array num by setting num[0] to 1, num[1] to 2, num[2] to 3, num[3] to 4. However, for this class implementation, you might find it more useful to store the digits backward; that is, place 4 in num[0], 3 in num[1], 2 in num[2], and 1 in num[3]. For the sake of simplicity, we will be storing and manipulating only with positive large integers. Implement a class named Largelnteger that stores a large integer as an array of its digits. Class must extend HasState class (provided). This is needed to make sure clone() method is written correctly. Class must have the following: - Fields - Constant arraySize must be set to 23 - Partially filled array of integers of length 23 - int digitCount keeps the number of digits in large integer, e.t. how many elements of the partially filled array are used to store the number - No-argument constructor that stores number 0 in the array. Sets digitCount to 1 - Constructor that takes a string as a parameter. The constructor parses the given string and converts it into Large Integer by storing digits in the partially filled array. - Create a new custom Exception class called LargelntegerNumberFormatException. The constructor throws exceptions of this type when - string is too long to be stored as a 23-digit number or - when string is empty or - when the string contains non-digits and thus cannot be converted into a number. - Constructor that takes a number of type long as a parameter and builds an object from it by storing digits in an array. - This constructor also throws a custom LargelntegerNumberFormatException when a parameter passed to the constructor is a negative number. - getDigitCount() accessor to the digit count variable. - toString() method that converts an array into a string of numbers in the correct order. Number 12345 is converted into a string "12345" - add(Largelnteger) method that returns the sum of this integer and the one passed as a parameter. The method adds two large integers by implementing the usual "paper and pencil" addition algorithm. This is when the backward storage arrangement of those numbers in arrays will pay off. Carry-over will be easier to do when the integer is stored backward. - Create another custom Exception class called LargelntegerOverflowException. If the resulting number is more than 23 digits long, the add() method throws a LargelntegerOverflowException type exception. - Implement clone() method. - Make your class implement Relatable interface. Code of the interface is provided. Implement all three methods of the Relatable interface. Part #2 Polymorphic Class This class exists only to house one static method called isSorted(). The method must take an array of objects of type Relatable and check if the array is sorted with the help of methods of Relatable interface. The method returns true if the array is sorted and false if it is not. The whole purpose of this exercise is to illustrate the concept of polymorphism. The purpose of this class is to house three static methods. 1. Method void writeLargelntegerArray(Largelnteger[], String) takes an array of Large Integers and a name of a file as parameters. The method writes the contents of the given array into the given binary file (in binary mode). The method throws IOExceptions. The IOExceptions may originate in the methods but must not be handled. Instead, they must be propagated to the calling code. - Make sure to add implements Serializable to the Largelnteger class header. Binary IO will fail to work without that. 2. Method Largelnteger[] readLargelntegerArray(String) method reads the contents of a binary file with the given name as an array of objects of type Largelnteger. Assume you do not know the amount of data in the file. Read data one Largelnteger object at a time and store the objects in ArrayList first. After the end of the file has been reached, convert the ArrayList into a regular array of objects that can be returned from the method. - Please study EOFDemo.java code example to learn how to use exceptions when checking for the end of the file while reading from a binary file. - This method also throws IOExceptions. The IOExceptions may originate in the methods but must not be handled. Instead, they must be propagated to the calling code. 3. Method Largelnteger addLargelntegersFromFile(String) takes a text file name as a parameter. It reads an arbitrary number of strings of text from the file, converting them into Largelntegers as it reads. The Large Integers are added one by one to the running total with the help of add() method. The sum of all the Large Integers stored in the file as strings is then returned from the method. - The structure of the file may be imperfect. Some strings may contain corrupted data and will fail to be converted into Largelnteger. This must not interrupt the process of reading from the file. The corrupted string must be skipped over, and the next string must be read and converted. Use a try/catch block to catch and ignore LargelntegerNumberFormatException. - The sum of all numbers stored in the file may become too big to be stored in a Large Integer. In that case, a LargeIntegerOverflowException exception will be thrown by the add() method. If this happens, catch the exception and return a null value from the method. - This method also throws IOExceptions. The IOExceptions may originate in the methods but must not be handled. Instead, they must be propagated to the calling code.](https://gotit-pro.com/wp-content/uploads/2023/10/a2443259-5cf9-45ff-9909-fdcfa036711f.png)
Large Integers Part #1 Largelnteger Class An array can be used to store large integers, one digit…
Waived! Original price was: $30.00.$20.00Current price is: $20.00. Add to cart -
Develop a Windows Forms application that will generate a random key used to shift a string from one character to another.
Waived! Original price was: $60.00.$50.00Current price is: $50.00. Add to cart
Kirsten Gorby –
great work as usual thanks
Diana Sands –
The assignment was excellent and I have scored 100 percent. I am very proud and happy with you.
Melanie Villard –
great and amazing work, highly recommend. God bless you in all your days
Bill Thomas –
I am glad I got assistance, I’m am very happy with the service.
Frank Cory –
It was amazing work and in a very short time.