review2 - COP 3502H Exam#2 Review Notes Day 22 Functions...

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

View Full Document Right Arrow Icon
Functions and Modularity – Day 10 notes More details on Pass by Value. More details on Pass by Reference. Pointers in C. How to declare them and use them. Searching and Sorting – Day 13 notes This set of notes begins with some code tracing examples. Be sure you practice tracing through the execution of code. Introduction to Big-Oh notation. Know Big-Oh bounds for sequential and binary searches. Be familiar with how the binary search algorithm works. Given the binary search algorithm, be sure that you can identify the elements of an array that would be examined when searching for some specific value in the array. Know how the selection sort works. Know how the bubble sort works. (Algorithm) Know how the insertion sort works. Know how the mergesort works. (recursive) (Algorithm) Know how the quicksort works. (recursive) Recursion – Day 14 notes Be able to trace the execution of a recursive function. Be able to write, in C, a simple recursive function. Be able to identify the stopping case (base case) for a recursive function. Be able to produce an induction proof for some conjecture involving the set of integers. See practice problem set on induction proofs. Data Structures – Days 15, 16, 17, 18, 19, and 20 notes Linked lists: single-link, double-link, circular-link variations. Advanced list structures: skip lists and self-organizing lists. Exam #2 Review Notes - 1 COP 3502H - Exam #2 Review Notes – Day 22
Background image of page 1

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

View Full Document Right Arrow Icon
Stacks and queues. Know the trade-offs of static versus dynamic implementations. Know access policies. Be familiar with the basic operations on these data structures. Binary tress. Know basic terminology. Be able to follow recursive algorithms that manipulate and/or traverse a binary tree. Know the ordering properties for a binary search tree. Be able to correctly insert and delete nodes from a BST. Additional Material Tracing function and loop execution, both iterative and recursive algorithms. Introduction to recursive functions. Introduction to order analysis. (from test #1)
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 10

review2 - COP 3502H Exam#2 Review Notes Day 22 Functions...

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

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