FinalExamReview

FinalExamReview - Final Exam Review Computer Science...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
Computer Science Department University of Central Florida Final Exam Review COP 3502 – Computer Science I
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Final Exam Review page 2 Final Exam Review Outline of Material Covered: I. Arrays, Pointers, Strings, Files, Structs Manipulation of array elements Manipulation of struct components Use of ‘.’ vs ‘->’ Use of strings strcmp, strlen, strcpy Use of files (fopen, fscanf) Dynamic memory allocation for arrays and for structs malloc, calloc, and realloc
Background image of page 2
Final Exam Review page 3 Final Exam Review Outline of Material Covered: I. Linked Lists Traversing a linked lists Printing a list Modifying list contents How to allocate a node dynamically Inserting elements anywhere in the list Deleting elements anywhere in the list Everything is fair game including insert/delete. Know the code!
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Final Exam Review page 4 Final Exam Review Outline of Material Covered: I. Recursion Fibonacci, Factorial, Binary Search Writing recursive functions Tracing through recursive functions Towers of Hanoi Permutation Reversing a string Base conversion Convert from some other base to base 10 Convert from base 10 to some other base ***Convert from ANY base to ANY other base***
Background image of page 4
Final Exam Review page 5 Final Exam Review Outline of Material Covered: I. Algorithm Analysis Big-O definition and finding the c value as shown in class Understanding the various orders and what they mean Practical” Problems such as those on the slides and also during the lab Analyzing code fragments and determining Big-O Solving summations Putting summations in their closed form (in terms of n) Analyzing code fragments and using summations to determine the Big-O
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Final Exam Review page 6 Final Exam Review Outline of Material Covered: I. Recurrence Relations You will have at LEAST one full recurrence relation to work out This will be a 15 point question We have done SEVERAL of these in class No excuse at all to miss this question
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 22

FinalExamReview - Final Exam Review Computer Science...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online