
-
Make an array called array with three elements in it, a hashmap /dict / associative array called hash with three elements in it, and a string variable called str with at least 15 characters where one of those characters is duplicated twice (i.e., in the string at least 3 times).
hint: declare -a array #creates an index array & declare -A hash #creates an associative array
-
Use echo to print both your arrays (both ‘array’ and ‘hash’) as strings on a single line. (Use loops)
-
Save just a portion of your indexed array to a new array variable.
-
Write a loop to print out each item of the new array on a line by itself.
-
Remove the last element from your indexed array.
-
Remove the first element from your index array.
-
Use echo to print out your indexed array on a single line.
-
Use an if statement to do this: If your array contains 2, print “true” otherwise print “false”
-
Create a read-only string variable and demonstrate that it cannot be changed.
-
Echo a substring of str which does not contain the first or last characters of str.
-
Echo the last bit of str that does not contain the thrice-repeated character from step 1.
-
Echo every part of str after the first instance of the thrice-repeated character.
-
Write an expression that echoes the value of an unset variable, but have the parameter expansion replace the unset variable’s value with any value you want and assign the variable to this value.
-
Echo the now-set variable from 13.

Trending nowThis is a popular solution!
Step by stepSolved in 4 steps with 3 images

- Please create a Java class that has the following data attributes and methods: private int count - number of customers in the array private customer Record[] data - array of customerRecord objects public customer List() constructor that should initialize memory for data array and count value public void getCustomerList(String fileName) - reads a file call fileName which is a text file containing lines (records) of customer data. This method fills the data array with the records from the file. The file will not have more than 100 records and will have the following format (where customer Number is an integer, firstName and lastName are Strings, and balance is a float: customerNumber firstName lastName balance public customerRecord getCustomer(int customerNumber) - returns the object corresponding to the customer with customerNumber. If the customer number is not in the array, return null. public void enter CustomerRecord(customerRecord new_record)…arrow_forwardFor any element in keysList with a value greater than 50, print the corresponding value in itemsList, followed by a comma (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20,30, 1 #include 2 3 int main(void) { const int SIZE_LIST = 4; int keysList[SIZE_LIST]; int itemsList[SIZE_LIST]; int i; 4 6 7 8 scanf("%d", &keysList[0]); scanf ("%d", &keysList[1]); scanf("%d", &keysList[2]); scanf("%d", &keysList[3]); 10 11 12 13 scanf ("%d", &itemsList[0]); scanf ("%d", &itemsList[1]); scanf("%d", &itemsList[2]); scanf ("%d", &itemsList[3]); 14 15 16 17 18 19 /* Your code goes here */ 20 21 printf("\n"); 22 23 return 0; 24 }arrow_forward1Code a JavaScript callback function for the Array.map method to ('Yu Yamaguchi') evaluate an array of integersidentify the integers that are Prime numbersreturn the Prime numbers in the new array 2 Code a JavaScript callback function for the Array.reduce method to evaluate an array of integersdetermine the smalles integerreturn the smalles integer Note: if there are identical integers, the function is to return the last one.arrow_forward
- text file 80 1 2 3 100 100 100 1001 0 2 100 3 4 100 1002 2 0 4 4 100 5 1003 100 4 0 100 100 4 100100 3 4 100 0 3 3 3100 4 100 100 3 0 100 1100 100 5 4 3 100 0 2100 100 100 100 3 1 2 0 My code below. I am getting an error when trying to create my adjacency matrix. i dont know what i am doing wrong def readMatrix(inputfilename): ''' Returns a two-dimentional array created from the data in the given file. Pre: 'inputfilename' is the name of a text file whose first row contains the number of vertices in a graph and whose subsequent rows contain the rows of the adjacency matrix of the graph. ''' # Open the file f = open(inputfilename, 'r') # Read the number of vertices from the first line of the file n = int(f.readline().strip()) # Read the rest of the file stripping off the newline characters and splitting it into # a list of intger values rest = f.read().strip().split() # Create the adjacency matrix adjMat = []…arrow_forwardint[] numList = new int [50]: for (int i = 0; i < 50; i++) numList[i] 2 * i: num[10] = -20; num(30] = 8; 40. What is the value of numList.length in the array above? b. 30 d. 50 41. Which ofthe following statements creates alpha, an anray of 5 components of the type int, and initializes each component to 10? (i) int [] alpha = {10, 10, 10, 10, 10); (ii) int (5] alpha = (10, 10, 10, 10, 10} a. Only (i) b. Only (ii) c. Both (i) and (ii) d. None of these 42. Consider the following declaration. int[] list = (2, 5, 7, 8, 12, 13, 15, 18, 22, 25}; %3D Which of the following correctly finds the sum of the clements of list? () for (int j = 0; j < 10; j++) sum = sum list[j]; for (int j = 1; j <= 10; j++) %3D sum + list [j); uns a. Only (i) b. Only (ii) c. Both (i) and (ii) d. None of these 43. What is the function of the reserved word class? It defines a data type and allocates memory. b. It defines only a data type; it does not allocate memory. It acts as a modifier. a. c. d. It has no function.…arrow_forwardThe running time for the ____ method is O(1) for Array implementation. Question 12 options: __str__ __getitem__(index) pop(index) insert(index, item)arrow_forward
- int [] myArray = {2,3,4,5}: What is the length of myArray? type your answer.arrow_forwardIn this assignment, you will compare the performance of ArrayList and LinkedList. More specifically, your program should measure the time to “get” and “insert” an element in an ArrayList and a LinkedList.You program should 1. Initializei. create an ArrayList of Integers and populate it with 100,000 random numbersii. create a LinkedList of Integers and populate it with 100,000 random numbers2. Measure and print the total time it takes to i. get 100,000 numbers at random positions from the ArrayList 3. Measure and print the total time it takes to i. get 100,000 numbers at random positions from the LinkedList 4. Measure and print the total time it takes to i. insert 100,000 numbers in the beginning of the ArrayList 5. Measure and print the total time it takes to i. insert 100,000 numbers in the beginning of the LinkedList 6. You must print the time in milliseconds (1 millisecond is 1/1000000 second).A sample run will be like this:Time for get in ArrayList(ms): 1Time for get in…arrow_forwardJava coding Can you create a remove method that removes and returns an element from an index in an array? Thanks.arrow_forward
- please write in javaarrow_forward3- Determine the output of the following code JavaScript Array Methods pop() The pop() method removes the last element from an array. The return value of the pop() method is the removed item. var fruits = ["Banana", "Orange", "Apple", "Mango"]; document.getElementById("demo1").innerHTML document.getElementById("demo2").innerHTML document.getElementById("demo3").innerHTML = fruits; = fruits.pop(); = fruits.shift();arrow_forwardPlease do not use string methods except to find methodarrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education





