Suppose you have a 2D array of string values initialized with the following nested for loop: string chessboard[8][8]; for (int row = 0; row <= 7; row++) { for (int column = 0; column <= 7; column++) { if (row == 0 or row == 1) { } else if (row = = 6 or row == 7) { } chessboard[row][column] = "white piece"; { chessboard[row][column] = "black piece"; else chessboard[row][column] = "unoccupied"; } }//end inner for loop }//end outer for loop How many occurrences of the string "unoccupied" are stored in this 2D array? (If clarification is required/helpful, this question is effectively asking how many empty spots there are on a starting chessboard).

Suppose you have a 2D array of string values initialized with the following nested for loop: string chessboard[8][8]; for (int row = 0; row <= 7; row++) { for (int column = 0; column <= 7; column++) { if (row == 0 or row == 1) { } else if (row = = 6 or row == 7) { } chessboard[row][column] = "white piece"; { chessboard[row][column] = "black piece"; else chessboard[row][column] = "unoccupied"; } }//end inner for loop }//end outer for loop How many occurrences of the string "unoccupied" are stored in this 2D array? (If clarification is required/helpful, this question is effectively asking how many empty spots there are on a starting chessboard).

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

Related questions

Q: Java: Yellow highlighted columns are outer ‘for’ loop Blue highlighted columns are inner ‘for’…

A: Insertion Sort: i<list.length CE=list[i] k=i-1 (list[k] > CE && (k>=0)…

Q: please can this code be converted to c++ or Java. Thank you Code is as follows: location = []…

A: I am converting this python code to c++. In step 2, you will get C++ code.

Q: void showValues(int a[4]), int cols = 5) { for (int roW = 1; row <= 4; row++) for (int col = 1; col…

A: Task :- Identify the errors in given piece of code.

Q: # TODO 1.2 x_values = display(x_values) todo_check([ (x_values.shap

A: Dear Student, The required line of code is given below -

Q: Look at the following array definition: String[ ] sArray = new String[3]; a. What will be…

A: length attribute in array is user to determing the length or number of elements in that array.…

Q: Counting the number of 1 bits in a bit string s can be accomplished in Java by first initializing an…

A: The answer is given below.

Q: java getDup accepts an array and returns an int. If there is any element is duplicated, the method…

A: Proceeding with the hint, two loops nested should be used to count the duplicate element. Algorithm…

Q: nt array[] = {1. 2, 3}:

A: Here array "array" is an array of integer.

Q: Arrays: create an array of a given type and populate its values. Use of for loop to traverse through…

A: NOTE: According to the guidelines, only the first question is answered 1. The complete C code is…

Q: int main () int small[1 (5, 10, 15, 20, 25); int large[] - (50, 40, 30, 20, 10); vectorcint> v(10);…

A: Note: Answering the first question as per the guidelines. 6. Here, we have given the vector code to…

Q: elements are there in arrays x, y, and z? int x[27]; const int base = 10; int y[base + 5];…

A: int x[27] There are 27 elements that can be stored into int x[27] .if the size of single…

Q: the following lab by one dimensional array(not vector) define two lists of numbers (arrays) and ask…

A: Question1: Do the following lab by one dimensional array(not vector) define two lists of numbers…

Q: #include using namespace std; const int ROWS = 10; const int COLS = 10; int…

A: To swap the elements of odd rows between arrays A and B, you can modify the swap function as…

Q: Return the centered average of an array, which is the mean average of the values, ignoring the…

A: Required:

Q: In this lab, you use what you have learned about searching an array to find an exact match to…

A: #include <iostream>#include <string>using namespace std; int main() { string…

Q: void mystery2(int list[], int length) { for (int i = 0; i < length - 1; i++) { if (i % 2 == 0) {…

A: Dear learner, hope you are doing well, I will try my best to answer this question. Thank You!!

Q: Fill an array of strings with the twenty-six strings "a" ... "z".

A: Step 1: Declare a string alpha that contains the alphabets from 'a' to 'z' as a string. Step 2:…

Q: Write a program named Search.java that uses a function called search_string to check whether a…

A: <<<<<<<<<<<<<<<<<<<<<<<<<…

Q: The grid contains the numbers 1 – 9 exactly The sum of each row, each column and each diagonal all…

A: Dear Student, The source code, implementation and expected output of your program is given below -

Q: Suppose you are given an array of integers. You want to insert a number x to the array and rearrange…

A: Basically, an input array is taken and an element has to be inserted into it, in such a way that all…

Q: // MichiganCities.cpp - This program prints a message for invalid cities in Michigan. // Input:…

A: You need to check with each and every element in the array of strings and if it equals the input…

Concept explainers

Array

The simplest way to start thinking about an array is as a collection, or a set of elements. In programming, these elements may be constants, variables, functions and pointers.

Question

100%

Suppose you have a 2D array of string values initialized with the following
nested for loop:
string chessboard[8][8];
for (int row = 0; row <= 7; row++)
{
for (int column = 0; column <= 7; column++)
{
if (row == 0 or row == 1)
{
chessboard[row][column] = "white piece";
}
else if (row == 6 or row == 7)
{
chessboard[row][column] = "black piece";
}
else
{
chessboard[row][column] = "unoccupied";
}
}//end inner for loop
}//end outer for loop
How many occurrences of the string "unoccupied" are stored in this 2D array?
(If clarification is required/helpful, this question is effectively asking how many
empty spots there are on a starting chessboard).

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

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

Can you fix the code please on the first picture shows the error output. // Corrected code #define _CRT_SECURE_NO_WARNINGS #include "LibraryManagement.h" #include "Books.h" #include "DigitalMedia.h" #include "LibraryConfig.h" #include #include #include #include // Include the necessary header for boolean data type // Comparison function for qsort to sort Digital Media by ID int compareDigitalMedia(const void* a, const void* b) { return ((struct DigitalMedia*)a)->id - ((struct DigitalMedia*)b)->id; } // initializing library struct Library initializeLibrary() { struct Library lib; lib.bookCount = 0; lib.ebookCount = 0; lib.digitalMediaCount = 0; // Initialize book array for (int i = 0; i < MAX_BOOK_COUNT; i++) { lib.books[i].commonAttributes.id = -1; // Set an invalid ID to mark empty slot } // Initialize ebook array for (int i = 0; i < MAX_EBOOK_COUNT; i++) { lib.ebooks[i].commonAttributes.id = -1; }…
In C++ whats the answer from below ? int size = 10; for ( int i = -1; i < size ; i++) { arr[size - i] = i; } This array: has 12 positions is out of bounds has 10 positions has 11 positions
Language is C++ Lab10B: Binary Bubbles. Binary search is a very fast searching algorithm, however it requires a set of numbers to be sorted first. For this lab, create an array full of 11 integers which the user will generate. Like in the previous lab, assume that the values will be between -100 and +100. Then, using the sorting algorithm called BubbleSort, put the array in the correct order (from lowest to highest number). After this, please printthe array to the screen. Finally, search the array for the target value using Binary Search.The BinarySearch code will implement the algorithm described in the lecture slides. During this, you should print out a few key values which help Binary Search function. For example, this algorithm focuses on a low, mid, and high which correspond to the indices in the array the algorithm is currently considering and searching. Printing these values during the search process will help with debugging and fixing any issues. • BubbleSort sorts the array…
C++
in C programming Write a main function that declares an array of 100 doubles.In a for loop, assign each of the doubles a random number between 0.50 and 50.00. Here’s how.array[i] = (double) (rand() % 100 + 1) / 2.0;Output the elements of the array in 10 columns that are each 6 spaces wide. Each row in the output will have 10 values. The doubles will be printed with 2 places of accuracy past the decimal.The output of this one-dimensional array requires a single loop with an if statement inside. Even though the 100 numbers are going to be presented as a table of numbers, they are still just a list in memory.
int [] arrayInt={3,54,90,22,32}; To print the last element in the arrayInt you will write: a. System.out.println(arrayInt[5]); b. System.out.println(arrayInt[0]); c. System.out.println(arrayInt[length]); d. System.out.println(arrayInt[4]);
### Import section# 3 necessary statements for numerical plotting in Jupyterimport numpy as npimport matplotlib.pyplot as plt %matplotlib inline# Factorial comes from 'math' packagefrom math import factorial ### Initialization section#array of derivatives at 0 compute by handderiv = np.array([1, 0, -1, 0, 1, 0, -1, 0])# degree of Taylor polynomialN=len(deriv)-1 # Max abs. value of N+1 deriv on interval (Compute using calculus)# (used in the remainder formula)# @@@ The N+1 derivative will be proportional to cosine, and |cos| is always # @@@ less than 1maxAbsNplus1deriv=1 #array with h valuesh = np.arange(-3,3.005,0.01) # Give the expansion point for the Taylor seriesexpansion=0 # Create an array to contain Taylor seriestaylor = np.zeros(len(h)) ### Calculation section#calculate Taylor series for all h at once using a loopfor n in range(N+1): taylor = taylor + (h**n)/factorial(n)*deriv[n] #actual function values actualFn = np.cos(expansion+h) #error actual and taylor…
. Given the following parallel arrays: int[] arrProdNumber = new int[] { 100, 115, 125, 142, 163, 199, 205, 388 }; string[] arrProdDesc = new string[] { "Kitten", "Cat", "Bird", "Chicken", "Dog", "Puppy", "Aardvark", "Zebra" }; Write a C# program that includes these arrays. Your program should then read a product number from the user and search the product number array for that number. If it is found, then your program should report the product number they entered and the corresponding product description. If the product number they enter is not in the first array, then your program should indicate that item number was not found. Here’s a sample run: //first runEnter product number: 115Item #115's product description is Cat//second runEnter product number: 1963Item #1963 does not exist in your inventory Some Random Number Generation HintsRandom rndNumber = new Random();Console.WriteLine(rndNumber.Next()); //random integerConsole.WriteLine(rndNumber.Next(101)); //random integer…
Write a loop that counts how many elements in an array are equal to zero. arrays.cpp 1 #include // sizet 2 int countZeros (const int values[], size_t size) { int count = 0; 3 4 for (int i; i using namespace std; 3 2 4 int countZeros(const int values[], size_t size); 5 int main() { int a[] = {1, 2, 0, 3}; cout <« countZeros (a, 4) <« endl; cout « "Expected: 1" « endl; 6 7 8 9 10 11 int b[] = {0, 2, 0, 3}; cout <« countZeros (b, 4) <« endl; cout « "Expected: 2" « endl; 12 13 14 15 int cl] -{1, 0, θ, 0, 0 ; cout <« countZeros (c, 5) <« endl; cout « "Expected: 4" « endl; 16 17 18 19 } CodeCheck Reset Testers Running Tester.cpp pass fail fail 1 Expected: 1 Expected: 2 Expected: 4 Score 1/3
For 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 }
How do you initialize an array in C?a) int arr[3] = (1,2,3);b) int arr(3) = {1,2,3};c) int arr[3] = {1,2,3};d) int arr(3) = (1,2,3);
In C++ language, write a program to print "Junior" if the given array element starts with 'J' and print "Senior" if the array element starts with 's'. Print the name of the player and the message Junior" or "Senior" accordingly. string names [5] = {"J-Liam", "S-Naoh", "S-Elijah", "J-James", "S-Henry"};