Topics for the final examination include, but are not necessarily limited to, the following list of topics:
Questions on the final examination will be similar to questions on the previous examinations. You will be asked to write several code segments, will be asked to read and interpret code, and will be asked several general knowledge questions. Some questions will be things you have seen, some will be things related to things you have seen, and some will be abstractions that you have never seen before.
In Detail: Topics: 1. Arrays and Dynamic memory malloc new free delete sizeof int **pt; pt = (int **)malloc(rows*sizeof(int *)); for(i=0;i<rows;i++) pt[i] = (int *)malloc(cols*sizeof(int)); free(pt); row major order matrix addition matrix transpose character arrays 2. Sorting max (selection) sort bubble sort insertion sort 3. Searching sequential search binary search Theory, implementation recursive, iterative applications lists and list management 4. recursion recursion implemented recursion compared to iteration 5. Strings strcmp strcpy strlen #include <string.h> arrays of strings strings and pointers strings and dynamic memory 6. Overview questions What does a person "graduating" from CSCI 1320 have as a part of his/her background? Nature of the questions: 1. some fill in the blanks 2. true and false 3. discussion (essay) 4. Programming (you provide appropriate code) 5. Programming (you have to read and explain given code) Implicitly: 1. Pointers dynamic memory call by reference call by value etc. 2. Functions functions and structure functions and arrays automatic storage dynamic storage Return values parameters call by value call by reference good structured programming and problem solving top down design 3. input/output functions cin cout scanf fscanf printf fprintf gets fgets getchar fopen fclose