
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
Concept explainers
Question
![Write a for loop to print all elements in courseGrades, following each element with a space (including the last). Print forwards, then
backwards. End each loop with a newline. Ex: If courseGrades = {7, 9, 11, 10), print:
7 9 11 10
10 11 9 7
Hint: Use two for loops. Second loop starts with i = NUM_VALS - 1.
Note: These activities may test code with different test values. This activity will perform two tests, both with a 4-element array (int
courseGrades[4]).
Also note: If the submitted code tries to access an invalid array element, such as courseGrades[9] for a 4-element array, the test
may generate strange results. Or the test may crash and report "Program end never reached", in which case the system doesn't
print the test case that caused the reported message.
1 #include <stdio.h>
HNm in 10 m DO G
2
3 int main(void) {
4
5
6
const int NUM_VALS = 4;
int courseGrades [NUM_VALS];
int i;
7
8 for (i = 0; i < NUM_VALS; ++i) {
scanf("%d", &(courseGrades[i]));
9
}
10
11
12
13
14
15 }
/*Your solution goes here */
return 0;](https://content.bartleby.com/qna-images/question/1f88de0d-cdb6-4ad3-b649-34d4011e29a7/9ffd02ca-89fd-4edc-950c-b5a2c881ba1f/cy20uz3j_thumbnail.png)
Transcribed Image Text:Write a for loop to print all elements in courseGrades, following each element with a space (including the last). Print forwards, then
backwards. End each loop with a newline. Ex: If courseGrades = {7, 9, 11, 10), print:
7 9 11 10
10 11 9 7
Hint: Use two for loops. Second loop starts with i = NUM_VALS - 1.
Note: These activities may test code with different test values. This activity will perform two tests, both with a 4-element array (int
courseGrades[4]).
Also note: If the submitted code tries to access an invalid array element, such as courseGrades[9] for a 4-element array, the test
may generate strange results. Or the test may crash and report "Program end never reached", in which case the system doesn't
print the test case that caused the reported message.
1 #include <stdio.h>
HNm in 10 m DO G
2
3 int main(void) {
4
5
6
const int NUM_VALS = 4;
int courseGrades [NUM_VALS];
int i;
7
8 for (i = 0; i < NUM_VALS; ++i) {
scanf("%d", &(courseGrades[i]));
9
}
10
11
12
13
14
15 }
/*Your solution goes here */
return 0;
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 3 steps with 1 images

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
- 1-24 Complete the following code. Ignore any highlighted answers, those are all not correct. thank youarrow_forwardAssign numMatches with the number of elements in userValues that equal matchValue. userValues has NUM_VALS elements. Ex: If userValues is {2, 1, 2, 2} and matchValue is 2 , then numMatches should be 3. Your code will be tested with the following values:matchValue: 2, userValues: {2, 1, 2, 2} (as in the example program above)matchValue: 0, userValues: {0, 0, 0, 0}matchValue: 10, userValues: {20, 50, 70, 100} In Javaarrow_forwardIn Python, grades_dict = {'Wally': [87, 96, 70], 'Eva': [100, 87, 90], 'Sam': [94, 77, 90], 'Katie': [100, 81, 82], 'Bob': [83, 65, 85]} plot 5 box plots one for each student within a single graph. Note: Rename the x-axis data to students’ names using: plt.xticks([1, 2, 3, 4 ,5], [’Student Name 1’, ’Student Name 2’, ’Student Name 3’, ’Student Name 4’, ’Student Name 5’]), see Figure in the next page. The values in these two arguments should be retrieved automatically and should work for any number of students not just 5'''arrow_forward
- Assign numMatches with the number of elements in userValues that equal mato If userValues is (2, 1, 2, 2) and matchValue is 2, then numMatches should be 3. Your code will be tested with the following values matchValue: 2, userValues (2, 1,2, 2) (as in the example program above) matchValue: 0, userValues (0, 0, 0, 0) matchValue: 10, userValues: (20, 50, 70, 100) (Notes)arrow_forwardPlease add comments! thanks!arrow_forwarddef rectangle_overlap(rect1_bl_x,rect1_bl_y, rect1_tr_x,rect1_tr_y, rect2_bl_x,rect2_bl_y, rect2_tr_x,rect2_tr_y): """ (int,int,int,int,int,int,int,int) -> str Function determines whether two rectangles overlap. When rectangles overlap, the function checks for the following scenarios 1. The two rectangles share the same coordinates 2. The first rectangle is contained within the second 3. The second rectangle is contained within the first 4. The rectangles have overlapping area, but neither is completely contained within the other Function inputs represent x and y coordinates of bottom left and top right corners of rectangles (see lab document) The function return one of the following strings corresponding to the scenario "no overlap" "identical coordinates" "rectangle 1 is contained within rectangle 2" "rectangle…arrow_forward
- Assign numMatches with the number of elements in userValues that equal matchValue. userValues has NUM_VALS elements. Ex: If userValues is {2, 1, 2, 2} and matchValue is 2 , then numMatches should be 3.Your code will be tested with the following values:matchValue: 2, userValues: {2, 1, 2, 2} (as in the example program above)matchValue: 0, userValues: {0, 0, 0, 0}matchValue: 10, userValues: {20, 50, 70, 100} CODE: import java.util.Scanner; public class FindMatchValue {public static void main (String [] args) {Scanner scnr = new Scanner(System.in); final int NUM_VALS = 4;int[] userValues = new int[NUM_VALS];int i;int matchValue;int numMatches = -99; // Assign numMatches with 0 before your for loop matchValue = scnr.nextInt();for (i = 0; i < userValues.length; ++i) {userValues[i] = scnr.nextInt();} /* Your solution goes here */ System.out.println("matchValue: " + matchValue + ", numMatches: " + numMatches);}}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_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_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_forwardAssign numMatches with the number of elements in userValues that equal matchValue. userValues has NUM_VALS elements. Ex: If userValues is {2, 1, 2, 2} and matchValue is 2, then numMatches should be 3. Your code will be tested with the following values: matchValue: 2, userValues: {2, 1, 2, 2} (as in the example program above) matchValue: 0, userValues: {0, 0, 0, 0} matchValue: 10, userValues: {20, 50, 70, 100} (Notes) 324758.2040686.qx3zgy7 3 int main(void) { const int NUM VALS = 4; int userValues[NUM_VALS]; int i; int matchvalue; int numMatches = -99; // Assign numMatches with e before your for loop 4 1 test 5 passed 6 7 All tests 8 passed 9 scanf ("%d", &matchValue); 10 11 for (i = 0; i < NUM_VALS; ++i) { scanf("%d", &(userValues[i])); } 12 13 14 15 16 * Your solution goes here */ 17 18 printf("matchvalue: %d, numMatches: %d\n", matchValue, numMatches); 19 20 return 0;arrow_forwardWhat value does a Random object use in the absence of a seed value?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 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

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