EKT120: Computer Programming

Slides:



Advertisements
Similar presentations
Chapter 7: User-Defined Functions II Instructor: Mohammad Mojaddam.
Advertisements

Functions a group of declarations and statements that is assigned a name effectively, a named statement block usually has a value a sub-program when we.
© Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. Chapter 5 - Functions Outline 5.1Introduction 5.2Program.
 2003 Prentice Hall, Inc. All rights reserved. 1 Chapter 3 - Functions Outline 3.12Recursion 3.13Example Using Recursion: The Fibonacci Series 3.14Recursion.
C Lecture Notes Functions (Cont...). C Lecture Notes 5.8Calling Functions: Call by Value and Call by Reference Used when invoking functions Call by value.
 2000 Prentice Hall, Inc. All rights reserved. Chapter 5 – Recursive Funtions From Deitel’s “C” Book 5.13Recursion 5.14Example Using Recursion: The Fibonacci.
Chapter 4:Functions| SCP1103 Programming Technique C | Jumail, FSKSM, UTM, 2005 | Last Updated: September 2005 Slide 1 Functions Lecture 4 by Jumail Bin.
 2003 Prentice Hall, Inc. All rights reserved. 1 Functions and Recursion Outline Function Templates Recursion Example Using Recursion: The Fibonacci Series.
© Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. C How To Program - 4th edition Deitels Class 05 University.
Lecture 6 – Functions (2). Outline Recall - sample application functions that return no value functions that return a value Recall – global variable vs.
1. Function prototype Function prototype is a declaration; indicates the function exists Should have function name, return type and parameter Placed before.
© Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. Functions (Recursion) Outline 5.13Recursion 5.14Example.
Principles of Programming - NI Simple Recursion Recursion is where a function calls itself. Concept of recursive function: A recursive function is.
 2007 Pearson Education, Inc. All rights reserved C Functions -Continue…-
UniMAP Sem2-10/11 DKT121: Fundamental of Computer Programming1 Functions (1)
Dale Roberts CSCI N305 Functions Recursion Department of Computer and Information Science, School of Science, IUPUI.
Chapter 5 - Functions Outline 5.1Introduction 5.2Program Modules in C 5.3Math Library Functions 5.4Functions 5.5Function Definitions 5.6Function Prototypes.
UniMAP SemII-09/10EKT120: Computer Programming1 Week 6 – Functions (2)
Chapter 5 – Functions II Outline Recursion Examples Using Recursion: The Fibonacci Series.
1 MT258 Computer Programming and Problem Solving Unit 4.
UniMAP SemI-09/10EKT120: Computer Programming1 Week 5 – Functions (1)
KIC/Computer Programming & Problem Solving 1.  Header Files  Storage Classes  Scope Rules  Recursion Outline KIC/Computer Programming & Problem Solving.
Principles of Programming - NI Simple Recursion Recursion is where a function calls itself. Concept of recursive function: A recursive function is.
UniMAP Sem2-09/10 DKT121:Fundamental of Computer Programming1 Functions (2)
1 MORE ON MODULAR DESIGN: MODULE COMMUNICATIONS. 2 WHEN A FUNCTION IS INVOKED, MEMORY IS ALLOCATED LOCALLY FOR THE FORMAL PARAMETERS AND THE VALUE OF.
CGS 3460 Function – I n What is a function lOne named program module that does one primary task lConsists of a set of statements n Why we need functions?
A Brief Introduction to Recursion. Recursion Recursive methods … –methods that call themselves! –They can only solve a base case –So, you divide a problem.
C++ Programming Lecture 12 Functions – Part IV
CHAPTER 4 FUNCTIONS Dr. Shady Yehia Elmashad. Outline 1.Introduction 2.Program Components in C++ 3.Math Library Functions 4.Functions 5.Function Definitions.
 2000 Prentice Hall, Inc. All rights reserved Program Components in C++ Function definitions –Only written once –These statements are hidden from.
Program Development and Design Using C++, Third Edition
Lecture 9 - Pointers 1. Outline Introduction Pointer Variable Definitions and Initialization Pointer Operators Calling Functions by Reference Pointer.
Chapter 9 Recursion. Copyright ©2004 Pearson Addison-Wesley. All rights reserved.10-2 Recursive Function recursive functionThe recursive function is –a.
Function – I What is a function Why we need functions?
EKT120: Computer Programming
Functions Course conducted by: Md.Raihan ul Masood
User-Written Functions
Topic 6 Recursion.
EKT150 INTRODUCTION TO COMPUTER PROGRAMMING
5.13 Recursion Recursive functions Functions that call themselves
Week 9 - Pointers.
POINTERS.
C Functions -Continue…-.
Lesson #6 Modular Programming and Functions.
Lesson #6 Modular Programming and Functions.
Week 6 – Functions (2) PGT C Programming.
POINTERS.
CSC113: Computer Programming (Theory = 03, Lab = 01)
Week 4 – Repetition Structures / Loops
Module 4 Functions – function definition and function prototype.
Week 5 – Functions (1) EKT120: Computer Programming.
EKT120: Computer Programming
CSC113: Computer Programming (Theory = 03, Lab = 01)
EKT120: Computer Programming
DKT121:Fundamental of Computer Programming
Chapter 5 - Functions Outline 5.1 Introduction
Functions.
Formatted and Unformatted Input/Output Functions
Chapter 5 - Functions Outline 5.1 Introduction
Chapter 6 - Functions Outline 5.1 Introduction
Functions Recursion CSCI 230
A function with one argument
Functions Pass By Value Pass by Reference
Module 1-10: Recursion.
Introduction to Problem Solving and Programming
POINTERS.
Introduction to Problem Solving and Programming
Recursive Algorithms 1 Building a Ruler: drawRuler()
ICS103 Programming in C Lecture 11: Recursive Functions
Presentation transcript:

EKT120: Computer Programming Week 6 – Functions (2) KUKUM Sem1-07/08 EKT120: Computer Programming

EKT120: Computer Programming Outline Recall - sample application functions that return no value functions that return a value Recall – global variable vs. local variable Pass by value Functions that “return” more than one value Sample application-functions that “return” more than one value Pass by reference Sample application Recursive function KUKUM Sem1-07/08 EKT120: Computer Programming

EKT120: Computer Programming Sample application Write a C program that reads item code and quantity, then calculate the payment.Use functions: menu – print item code menu determine_price – determine price based on item code calc - calculate payment print_result – print payment Think!! Which function return no value and which function return a value. What argument name do I want to feed in as parameters and what to return?? KUKUM Sem1-07/08 EKT120: Computer Programming

Sample application-cont #include <stdio.h> void menu(); float determine_price(int); float calc(float,int); void print_result(float); int main() { int code,qty;float price,pay; menu(); printf("Enter item code and quantity:"); scanf("%d %d", &code,&qty); price= determine_price(code); pay=calc(price,qty); print_result(pay); return 0; } KUKUM Sem1-07/08 EKT120: Computer Programming

Sample application-cont void menu( ) { printf("Code\tItem\tPrice\n"); printf("1\tPapaya\t1.00\n"); printf("2\tMelon\t2.00\n"); printf("3\tDurian\t3.00\n"); printf("\tOthers\t4.00\n"); } float determine_price(int item_code) { float pricing; switch(item_code) case 1:pricing=1.00;break; case 2:pricing=2.00;break; case 3:pricing=3.00;break; default:pricing=4.00; return(pricing); float calc(float item_price,int quantity) { float answer; answer=item_price*quantity; return(answer); void print_result(float payment) { printf("Payment is %.2f\n", payment); [yasmin@localhost week5]$ gcc testing.c [yasmin@localhost week5]$ ./a.out Code Item Price 1 Papaya 1.00 2 Melon 2.00 3 Durian 3.00 Others 4.00 Enter item code and quantity:1 3 Payment is 3.00 Enter item code and quantity:9 3 Payment is 12.00 KUKUM Sem1-07/08 EKT120: Computer Programming

Global variable vs. local variable modification [yasmin@localhost yasmin]$ gcc testing2.c [yasmin@localhost yasmin]$ ./a.out Code Item Price 1 Papaya 1.00 2 Melon 2.00 3 Durian 3.00 Others 4.00 Enter item code and quantity:1 4 Payment is 16.00 Enter item code and quantity:3 1 Payment is 2.00 #include <stdio.h> void menu(); float determine_price(int); float calc(float,int); void print_result(float); int code,qty;float price,pay; int main() { menu(); printf("Enter item code and quantity:"); scanf("%d %d", &code,&qty); price= determine_price(code); pay=calc(price,qty); print_result(pay); return 0; } void menu( ) printf("Code\tItem\tPrice\n"); printf("1\tPapaya\t1.00\n"); printf("2\tMelon\t2.00\n"); printf("3\tDurian\t3.00\n"); printf("\tOthers\t4.00\n"); float determine_price(int code) { code--; switch(code) case 1:price=1.00;break; case 2:price=2.00;break; case 3:price=3.00;break; default:price=4.00; } return(price); float calc(float price,int quantity) pay=pay+1; pay=price*quantity; return(pay); void print_result(float pay) { printf("Payment is %.2f\n", pay); However, sometimes we need to do some modification from inside a function, using global variable will make things worse!!! KUKUM Sem1-07/08 EKT120: Computer Programming

EKT120: Computer Programming Pass by Value If a parameter is passed by value, then the value of the original data is copied into the function’s parameter (scope: local variable(s)) In other words, it (i.e. local variable) has its own copy of the data changes to copy do not change original data During program execution, it (i.e. local variable) will manipulate the data stored in its own memory space KUKUM Sem1-07/08 EKT120: Computer Programming

Pass by Value (Example) #include <stdio.h> void fun1(int, int); //function prototype int main(void) { int a=5, b=10; printf("Before fun 1\n“); printf(" a = %d b = %d\n”, a, b); fun1(a, b); //function call printf("\nAfter fun 1\n“); return 0; } void fun1(int aa, int bb) //function definition aa++; bb--; printf("\n\nInside fun 1\n)"; printf("aa = %d bb = %d\n”, aa, bb); Output Before fun 1 a = 5 b = 10 Inside fun 1 aa = 6 bb = 9 After fun 1 KUKUM Sem1-07/08 EKT120: Computer Programming

Functions that “return” more than one value When we talk about functions that “return” more than one value it also means that we want to pass arguments by reference pass addresses (references), NOT value/data allows direct manipulation changes will affect original data KUKUM Sem1-07/08 EKT120: Computer Programming

Functions that “return” more than one value There are cases where you need to manipulate the value of an external variable from inside a function, thus we pass the values by reference KUKUM Sem1-07/08 EKT120: Computer Programming

EKT120: Computer Programming Sample application Write a C program that calculates and print average of 2 test marks. Your program should have function: read – read 2 test marks calc_avg –calculate average of two test marks print-print average KUKUM Sem1-07/08 EKT120: Computer Programming

EKT120: Computer Programming Sample application Functions that “return” more than one value i.e. arguments are pass by reference void read_marks(float *m1, float *m2) { printf("Enter marks for test1 and test2 : "); scanf("%f %f", m1,m2); //notice no & } float calc_avg(float m1, float m2) return((m1 + m2)/2); void print(float average) printf("\nAverage marks are :%.2f\n",average); #include <stdio.h> void read_marks(float*, float*); float calc_avg(float, float); void print(float); int main(void) { float marks1, marks2, avg; read_marks(&marks1, &marks2); avg = calc_avg(marks1, marks2); print(avg); return 0; } Output Enter marks for test1 and test2 : 70 80 Average marks are : 75.00 KUKUM Sem1-07/08 EKT120: Computer Programming

EKT120: Computer Programming Pass by Reference A function’s parameter that receives the location (memory address) of the corresponding actual variables When we attach * (star) after the arg_type in the parameter list of a function, then the variable following that arg_type is passed by reference It stores the address of the actual variable, NOT the value During program execution to manipulate the data, the address stored will direct control to the memory space of the actual variable Syntax In function protoype and function definition, put the * (star) after the data type In function call, put the &(ampersand) before the argument name to be passed by reference KUKUM Sem1-07/08 EKT120: Computer Programming

Pass by Reference (cont.) Pass by Reference are useful in two situations: when you want to return more than one value from a function when the value of the actual parameter needs to be changed KUKUM Sem1-07/08 EKT120: Computer Programming

EKT120: Computer Programming Sample application Write a C program that reads character and calculates numbers of vowel and consonant Your program should have function: read – read character find_count_vc –determine and calculate number of vowel or consonant print-print number of vowel or consonant KUKUM Sem1-07/08 EKT120: Computer Programming

EKT120: Computer Programming Enter character : f Do you want to continue?y Enter character : I Enter character : k Do you want to continue?n Number of vowel : 1 Number of consonant : 2 Sample application #include <stdio.h> #include <string.h> char read(); void find_count_vc(char, int*, int*); void print(int,int); int main() { char ch, choice; int count_v=0,count_c=0; do { ch = read(); find_count_vc(ch, &count_v, &count_c); printf("Do you want to continue?"); scanf("%c", &choice); getchar(); }while((choice == 'y') ||(choice =='Y')); print(count_v,count_c); return 0; } char read() { char ch1; printf("Enter character : "); scanf("%c", &ch1); return(ch1); void find_count_vc(char ch1, int *vowel, int *consonant) { switch(ch1) { case 'A': case 'a': case 'E': case 'e': case 'I': case 'i': case 'O': case 'o': case 'U': case 'u': *vowel = *vowel +1;break; default: *consonant = *consonant + 1; } void print(int vowel, int consonant) printf("Number of vowel : %d\n", vowel); printf("Number of consonant : %d\n", consonant); Functions that “return” more than one value i.e. arguments are passed by ref KUKUM Sem1-07/08 EKT120: Computer Programming

Pass by Reference (Example) #include <stdio.h> void fun1(int, int*); //function prototype int main(void) { int a=5, b=10; printf("Before fun 1\n“); printf(" a = %d b = %d“,a, b); fun1(a, &b); //function call printf(“\n\nAfter fun 1\n“); printf("a = %d b = %d\n“,a,b); return 0; } void fun1(int aa, int * bb) //function definition aa++; *bb--; printf("\n\nInside fun 1\n“); printf("aa = %d bb = %d“,aa,bb); Output Before fun 1 a=5 b = 10 Inside fun 1 aa = 6 bb = 9 After fun 1 a = 5 b = 9 KUKUM Sem1-07/08 EKT120: Computer Programming

EKT120: Computer Programming Recursive Functions Recursion is a term describing functions which are called by themselves (functions that calls themselves) Recursive function has two parts i.e. base case and not base case If not base case, the function breaks the problem into a slightly smaller, slightly simpler, problem that resembles the original problem and Launches a new copy of itself to work on the smaller problem, slowly converging towards the base case Makes a call to itself inside the return statement Eventually the base case gets solved and then that value works its way back up to solve the whole problem Recursion is very useful in mathematical calculations and in sorting of lists KUKUM Sem1-07/08 EKT120: Computer Programming

Recursive Functions (cont.) Example: factorial n! = n * ( n – 1 ) * ( n – 2 ) * … * 1 Recursive relationship: ( n! = n * ( n – 1 )! ) 5! = 5 * 4! 4! = 4 * 3!… Base case (1! = 0! = 1) KUKUM Sem1-07/08 EKT120: Computer Programming

Recursive Functions(Example) Factorial 4 * 6 = 24 is returned Factorial(4) 3 * 2 = 6 is returned 4 * Factorial(3) 3 * Factorial(2) 2 * 1 = 2 is returned 2 * Factorial(1) Value 1 is returned 1 KUKUM Sem1-07/08 EKT120: Computer Programming

Recursive Functions(Example) #include <stdio.h> int Factorial(int n) { if(n <= 1) return 1; else return ( n * Factorial(n-1)); } void main() { int n=4; printf(“Factorial %d is %d“,n, Factorial(n)); KUKUM Sem1-07/08 EKT120: Computer Programming

Recursive Functions (Example) Fibonacci series: 0, 1, 1, 2, 3, 5, 8... Each number sum of two previous ones Example of a recursive formula: fib(n) = fib(n-1) + fib(n-2) KUKUM Sem1-07/08 EKT120: Computer Programming

Recursive Functions (Example) Diagram of Fibonacci function: f( 3 ) f( 1 ) f( 2 ) f( 0 ) return 1 return 0 return + KUKUM Sem1-07/08 EKT120: Computer Programming

Recursive Functions (Example) Sample code for fibonacci function long fibonacci( long n ) { if ( n == 0 || n == 1 ) //base case return n; else return fibonacci( n - 1 ) + fibonacci( n – 2 ); } KUKUM Sem1-07/08 EKT120: Computer Programming

EKT120: Computer Programming End Week 5 – Functions (2) Q & A! KUKUM Sem1-07/08 EKT120: Computer Programming