Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Related questions
Concept explainers
Question
thumb_up100%
![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).](https://content.bartleby.com/qna-images/question/06c2bab3-0d6a-4d21-bfb5-e9ecf7feaa67/3cdc8ff2-bd04-49e1-876d-2b4a17434d4b/1van9qd_processed.png)
Transcribed Image Text: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
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps
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; }…arrow_forwardIn 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 positionsarrow_forwardLanguage 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…arrow_forward
- C++arrow_forwardin 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.arrow_forwardint [] 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]);arrow_forward
- ### 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…arrow_forward. 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…arrow_forwardWrite 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/3arrow_forward
- 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 }arrow_forwardHow 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);arrow_forwardIn 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"};arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON 
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education