Final Format最终的格式VIP

1、Instructor: Alexander Stoytchev/alexs/classes/2009_Fall_185/CprE 185: Intro to Problem Solving(using C)Review for the Final ExamCprE 185: Intro to Problem SolvingIowa State University, Ames, IACopyright Alexander StoytchevFinal Exam Final Exam: Thursday Dec 17: 2:15- 4:15 pm

2、 Location: This room. The final is worth 25% of your grade. The best way to fail this class is to not show up.Final Format True/False(10 x 1p each = 10p) Fun Stuff( 3 x 5p each = 15p) Short answers( 5 x 3p each = 15p) Code Snippets( 4 x 5p each = 20p) What is the output( 3 x 5p each = 15p) Program 1

3、(15p) Program 2(20p) Program 3(20p) TOTAL (130p)Final Format You dont need to get all 130 points to get an A 100 is a 100 You must get at least 65 points in order to pass this examGeneral Topics for the Final Everything since midterm2 Recursion Stuctures Strings Files PointersGeneral Topics for the

4、Final Everything since midterm2 Recursion Stuctures Strihngs Files Pointers And everything before midterm2. No topic is off limits!How to Study for the Final Form a study group. (this will help you overcome your fear) Go back and look at my slides for this class. Go back and look at the sample progr

5、ams that were demonstrated during the lectures. Programs you wrote during the labs. Homework problems (solve them again). Exercise. And get some sleep. 2004 Pearson Addison-Wesley. All rights reservedRecursive Programming/ This function returns the sum of 1 to numint sum (int num) int result; if (nu

6、m = 1) result = 1; else result = num + sum (n-1); return result;sum(1);sum(1)sum(2) Recursive Control Flow In Recursive calls methods can call themselves, but typically with different arguments each timereturn 1;Recursive Control Flow In Recursive calls methods can call themselves, but typically wit

7、h different arguments each timesum(2) sum(1)sum(1); sum(2);sum(3) main()return 1;sum(3); 2004 Pearson Addison-Wesley. All rights reservedRecursive Programmingmainsumsumsumsum(3)sum(1)sum(2)result = 1result = 3result = 6Recursion: Fibonacci NumbersThe sequence: 0,1,1,2,3,5,8,13,. Fibonacci Sequence#i

8、nclude#includeint fib(int n) int ret; if (n 2) ret = 1; else ret= fib(n-1) + fib(n-2); return ret;int main() int i; for(i=0;i10;i+) printf(%d , fib(i); system(pause);Mathematical notation v.s. C codeint fib(int n) if(n = 1) return n; /base case else return fib(n-1) + fib(n-2); Execution TraceMystery

9、 Recursionvoid mystery1(int a, int b) if (a print 2(a=0, b=5)(a=0, b=1)(a=3, b=5)(a=0, b=-1)(a=1, b=1)(a=3, b=3)(a=5, b=5)(a=1, b=0)(a=2, b=1)(a=3, b=2) (a=4, b=3)(a=6, b=5)(a=5, b=4)201354(a=0, b=5)(a=0, b=1)(a=3, b=5)(a=0, b=-1)(a=1, b=1)(a=3, b=3)(a=5, b=5)(a=1, b=0)(a=2, b=1)(a=3, b=2) (a=4, b=3

10、)(a=6, b=5)(a=5, b=4)201354Traversal OrderDeclaring Stringschar c10 = “EE/CprE”; /only 7 charsWhat about the uninitialized characters in the string?Array contents Contents of the c arraycEE/CprE0?NULL character automatically assignedArray ContentsProgram:/ character arraychar c10 = “EE/CprE”; printf

11、(“%s”, c); /output 1c8 = a;printf(“%s”, c); /output 2_Output 1: EE/CprEOutput 2: EE/CprEcEE/CprE0a?#include char c7;strcpy(c, “Wednesday”); Assign value to a String Watch out for overflow (bad)cWednesda0yoverfloway#include char c7;strncpy(c, “Wednesday”, 7); Assign value to a String Better to use st

12、rncpy copies up to n characters from the sourcecWednesdneed NULL#include char c7;strncpy(c, “Wednesday”, 6); c6 = 0;/ORc6 = NULL; /NULL and 0 are the sameAssign value to a String Better to use strncpy assign NULL to the end afterwordcWednes0Basic pointer operationsint i = 5; Int* ip = &i; printf

13、(%dn, *ip); http:/ pointer operations*ip = 7;http:/ pointer operationsint j = 3; ip = &j; http:/ pointer operationsint *ip2; ip2 = ip; http:/ pointer operationsip = &i; http:/ and arrays Array indexing: a0, a1, a2, int *ip = &a0; Pointer indexing: *ip, *(ip+1), *(ip+2), In general ai is

14、“equivalent” to *(ip+i) Pointer Arithmetic ip2 = ip1 + 3; ip2 - ip1 = 3 (true or false?)int *ip; int a10; ip = &a3; ip2 = ip + 1; http:/ is the meaning of this?typedef struct nodeint value;struct node *next; node_t;valuenext?Inserting a node into a Linked ListBeforeAfter/wi

15、ki/Linked_listDeleting a node from a linked listBefore:After:/wiki/Linked_listThe road ahead This class is only the beginning. It taught you only the very basics of programming. It taught you very little about many other things. Continue to write programs (even small ones to help you with your other classes or just for fun). Otherwise youll forget it all in 1-2 years!Recommended B