2008/11/24: Lecture 19 CMSC 104, Section 0101 John Y. Park

Slides:



Advertisements
Similar presentations
BBS514 Structured Programming (Yapısal Programlama)1 Functions and Structured Programming.
Advertisements

C++ Programming: From Problem Analysis to Program Design, Third Edition Chapter 7: User-Defined Functions II.
Chapter 7: User-Defined Functions II
CMSC 104, Version 8/061L22Arrays1.ppt Arrays, Part 1 of 2 Topics Definition of a Data Structure Definition of an Array Array Declaration, Initialization,
C++ Programming: From Problem Analysis to Program Design, Fifth Edition, Fifth Edition Chapter 7: User-Defined Functions II.
Array Cs212: DataStructures Lab 2. Array Group of contiguous memory locations Each memory location has same name Each memory location has same type a.
CS161 Topic #16 1 Today in CS161 Lecture #16 Prepare for the Final Reviewing all Topics this term Variables If Statements Loops (do while, while, for)
Functions: Part 2 of /11/10: Lecture 16 CMSC 104, Section 0101 John Y. Park 1.
Copyright © 2002 W. A. Tucker1 Chapter 9 Lecture Notes Bill Tucker Austin Community College COSC 1315.
CMSC 104, Version 8/061L09VariablesInC.ppt Variables in C Topics Naming Variables Declaring Variables Using Variables The Assignment Statement Reading.
CMSC 104, Section 301, Fall Lecture 18, 11/11/02 Functions, Part 1 of 3 Topics Using Predefined Functions Programmer-Defined Functions Using Input.
1 CSC 211 Data Structures Lecture 4 Dr. Iftikhar Azim Niaz 1.
User-Written Functions
UMBC CMSC 104 – Section 01, Fall 2016
Chapter 7: User-Defined Functions II
Computer Science 210 Computer Organization
2008/11/19: Lecture 18 CMSC 104, Section 0101 John Y. Park
Functions, Part 2 of 2 Topics Functions That Return a Value
Arrays in C.
2008/10/22: Lecture 12 CMSC 104, Section 0101 John Y. Park
User-Defined Functions
2008/11/10: Lecture 16 CMSC 104, Section 0101 John Y. Park
2011/11/20: Lecture 15 CMSC 104, Section 4 Richard Chang
CS 1430: Programming in C++.
Computer Science 210 Computer Organization
The C “switch” Statement
2008/11/05: Lecture 15 CMSC 104, Section 0101 John Y. Park
FUNCTIONS WITH ARGUMENTS
Arrays, Part 1 of 2 Topics Definition of a Data Structure
2008/11/24: Lecture 19 CMSC 104, Section 0101 John Y. Park
The while Looping Structure
The C “switch” Statement
CSI-121 Structured Programming Language Lecture 14 Functions (Part 2)
Final Exam Final Exam: Thursday Dec 13th, 2001 at 8:30 pm in SS-111, the regular classroom.
2008/10/22: Lecture 12 CMSC 104, Section 0101 John Y. Park
EKT150 : Computer Programming
Lecture 18 Arrays and Pointer Arithmetic
Functions, Part 2 of 3 Topics Functions That Return a Value
Arrays, Part 2 of 2 Topics Array Names Hold Address How Indexing Works
The while Looping Structure
Arrays, Part 2 of 2 Topics Array Names Hold Address How Indexing Works
Arrays, Part 2 of 2 Topics Array Names Hold Address How Indexing Works
Arrays, Part 1 of 2 Topics Definition of a Data Structure
Functions with arrays.
Topics discussed in this section:
Arrays, Part 2 of 2 Topics Array Names Hold Address How Indexing Works
Arrays, Part 1 of 2 Topics Definition of a Data Structure
Arrays, Part 1 of 2 Topics Definition of a Data Structure
Arrays Topics Definition of a Data Structure Definition of an Array
Chapter 7: User-Defined Functions II
Arrays, Part 1 of 2 Topics Definition of a Data Structure
Arrays I Handling lists of data.
Arrays, Part 2 of 2 Topics Array Names Hold Address How Indexing Works
Variables in C Topics Naming Variables Declaring Variables
The while Looping Structure
2008/11/05: Lecture 15 CMSC 104, Section 0101 John Y. Park
2008/11/19: Lecture 18 CMSC 104, Section 0101 John Y. Park
Arrays, Part 1 of 2 Topics Definition of a Data Structure
ICS103 Programming in C Lecture 12: Arrays I
Arrays, Part 1 of 2 Topics Definition of a Data Structure
Arrays, Part 2 of 2 Topics Array Names Hold Address How Indexing Works
Arrays Topics Definition of a Data Structure Definition of an Array
Functions, Part 2 of 3 Topics Functions That Return a Value
The while Looping Structure
Arrays, Part 2 of 2 Topics Array Names Hold Address How Indexing Works
Functions, Part 2 of 3 Topics Functions That Return a Value
More Loops Topics Counter-Controlled (Definite) Repetition
Arrays, Part 2 of 2 Topics Array Names Hold Address How Indexing Works
Arrays, Part 2 of 2 Topics Array Names Hold Address How Indexing Works
Presentation transcript:

2008/11/24: Lecture 19 CMSC 104, Section 0101 John Y. Park Arrays: Part 2 of 2 2008/11/24: Lecture 19 CMSC 104, Section 0101 John Y. Park [Based on dblock spr’06lecture, slightly modified]

Arrays, Part 2 of 2 Topics Array Names Hold Address How Indexing Works Call by Value Call by Reference Grades Program Revised Reading Section 5.8 Sections 6.1 - 6.5

Array Declarations Revisited int numbers[5] ; This declaration sets aside a chunk of memory that is big enough to hold 5 integers. Besides the space needed for the array, there is also a variable allocated that has the name of the array. This variable holds the address of the beginning (address of the first element) of the array. FE00 numbers FE00 -- -- -- -- -- 0 1 2 3 4

Array Name Holds an Address #include <stdio.h> int main( ) { int numbers[5] = {97, 68, 55, 73, 84} ; printf (“numbers[0] = %d\n”, numbers[0]) ; printf (“numbers = %X\n”, numbers) ; printf (“&numbers[0] = %X\n”, &numbers[0]) ; return 0 ; } numbers[0] = 97 numbers = FE00 &numbers[0] = FE00 output

How Indexing Works numbers[2] = 7 ; The element assigned the value 7 is stored in a memory location that is calculated using the following formula: Location = (beginning address) + (index * sizeof( array type )) Assuming a 4-byte integer, Location = FE00 + (2 * 4) FE00 FE04 FE08 FE0C FE10 numbers FE00 97 68 7 73 84 0 1 2 3 4

Indexing Arrays As long as we know the beginning location of an array, the data type being held in the array, and the size of the array (so that we don’t go out of range), then we can access or modify any of its elements using indexing. The array name alone (without [ ] ) is just a variable that contains the starting address of the block of memory where the array is held.

Call (Pass) by Value So far, we have passed only values to functions. The function has a local variable (a formal parameter) to hold its own copy of the value passed in. When we make changes to this copy, the original (the corresponding actual parameter) remains unchanged. This is known as calling (passing) by value.

Passing Arrays to Functions The function prototype: void FillArray (int ages[ ], int numElements); The function definition header: void FillArray (int ages[ ], int numElements) The function call: FillArray (ages, SIZE); Notice that we are passing only the name of the array (the address) and that we aren’t returning anything (the function is void) because we will be modifying the original array from within the function.

Call (Pass) by Reference As demonstrated with arrays, we can pass addresses to functions. This is known as calling (passing) by reference. When the function is passed an address, it can make changes to the original (the corresponding actual parameter). There is no copy made. This is great for arrays, because arrays are usually very large. We really don’t want to make a copy of an array. It would use too much memory.

Passing an Array to a Function #include <stdio.h> #define SIZE 4 void FillArray (int intArray[ ], int size) ; int main ( ) { int someArray [SIZE] ; FillArray (someArray, SIZE) ; /* Print the elements of the array */ for ( i = 0; i < SIZE; i++ ) printf (someArray[%d] = %d\n”, i, someArray[ i ] ) ; } return 0 ; /******************************************* FillArray is a function that will fill each element of any integer array passed to it with a value that is the same as that element’s subscript. *******************************************/ void FillArray (int anArray[ ], int numElements) { int i ; for ( i = 0; i < numElements; i++ ) anArray [i] = i ; } someArray[0] = 0 someArray[1] = 1 someArray[2] = 2 someArray[3] = 3 output

Grades Program Using Pass by Reference Problem: Find the average test score and the number of A’s, B’s, C’s, D’s, and F’s for a particular class. New Design: Main Print User Instructions Initialize Grade Counts To Zero Read Grades Process the Grades Print the Results Calculate Average Score

“Clean” Grades Program (con’t) #include <stdio.h> #define SIZE 39 #define GRADES 5 #define A 4 #define B 3 #define C 2 #define D 1 #define F 0 #define MAX 100 #define MIN 0 void PrintInstructions ( ) ; void InitArray (int anArray[ ], int size) ; void FillArray (int anArray[ ], int size) ; double ProcessGrades (int score[ ], int size, int gradeCount[ ] ) ; double FindAverage (double sum, int num) ; void PrintResults (double average, int gradeCount[ ] ) ;

“Clean” Grades Program (con’t) int main ( ) { int score [SIZE]; /* student scores */ int gradeCount [GRADES] ; /* count of A’s, B’s, C’s, D’s, F’s */ double average; /* average score */ PrintInstructions ( ) ; InitArray (gradeCount, GRADES) ; FillArray (score, SIZE) ; average = ProcessGrades (score, SIZE, gradeCount ) ; PrintResults (average, gradeCount) ; return 0 ; }

“Clean” Grades Program (con’t) /***************************************************************** ** PrintInstructions - prints the user instructions ** Inputs: None ** Outputs: None void PrintInstructions ( ) { printf (“This program calculates the average score\n”) ; printf (“for a class of 39 students. It also reports the\n”) ; printf (“number of A’s, B’s, C’s, D’s, and F’s. You will\n”) ; printf (“be asked to enter the individual scores.\n”) ; }

“Clean” Grades Program (con’t) /******************************************************************* /* InitArray - initializes an integer array to all zeros /* Inputs: anArray - array to be initialized /* size - size of the array /* Outputs: None /******************************************************************/ void InitArray (int anArray [ ], int size) { for ( i = 0; i < size; i++ ) anArray [ i ] = 0 ; }

“Clean” Grades Program (con’t) /**************************************************************************************** ** FillArray - fills an integer array with valid values that are entered by the user. ** Assures the values are between MIN and MAX. ** Inputs: anArray - array to fill ** Outputs: size - size of the array ** Side Effect - MIN and MAX must be #defined in this file ****************************************************************************************/ void FillArray (int anArray [ ], int size) { int i ; /* loop counter */ for ( i = 0; i < size; i++ ) { printf (“Enter next value : ”) ; scanf (“%d “, &anArray [ i ] ) ; while ( (anArray [ i ] < MIN) || (anArray [ i ] > MAX) ) { printf (“Values must be between %d and %d\n ”, MIN, MAX) ; scanf (“%d “, &anArray[ i ] ) ; }

“Clean” Grades Program (con’t) /******************************************************************************** ** ProcessGrades - counts the number of A’s, B’s, C’s, D’s, and F’s, and ** computes the average score ** Inputs: score - array of student scores size - size of the array gradeCount - grade counts all initialized to zero ** Outputs: gradeCount - number of A’s, B’s, C’s, D’s, and F’s ** Side Effect: A, B, C, D, and F must be #defined in this file *********************************************************************************/ double ProcessGrades (int score [ ], int size, int gradeCount [ ] ) { int total = 0; /* total of all scores */ double average; /* average score */ for ( i = 0 ; i < size ; i++) { total += score [ i ] ; switch ( score [ i ] / 10 ) case 10 : case 9 : gradeCount [A]++ ; break ;

“Clean” Grades Program (con’t) case 8 : gradeCount [B]++ ; break ; case 7 : gradeCount [C]++ ; case 6 : gradeCount [D]++ ; case 5 : case 4 : case 3 : case 2 : case 1 : case 0 :gradeCount [F]++ ; default : printf (“Error in score.\n”) ; } average = findAverage (total, size) ; return average ;

“Clean” Grades Program (con’t) /*************************************************************** ** FindAverage - calculates an average ** Inputs: sum - the sum of all values ** num - the number of values ** Outputs: the computed average ****************************************************************/ double FindAverage (double sum, int num) { double average ; /* computed average */ if ( num != 0 ) { average = sum / num ; } else { average = 0 ; return average ;

“Clean” Grades Program (con’t) /*********************************************************************************** ** PrintResults - prints the class average and the grade distribution for ** the class. ** Inputs: average - class average ** gradeCount - number of A’s, B’s, C’s, D’s, and F’s ** Outputs: None ** Side Effect: A, B, C, D, and F must be #defined in this file /***********************************************************************************/ void PrintResults (double average, int gradeCount [ ] ) { printf (“The class average is %.2f\n”, average ) ; printf (“There were %2d As\n”, gradeCount [A] ) ; printf (“ %2d Bs\n”, gradeCount [B] ) ; printf (“ %2d Cs\n”, gradeCount [C] ) ; printf (“ %2d Ds\n”, gradeCount [D] ) ; printf (“ %2d Fs\n”, gradeCount [F] ) ; }