{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# finalrv - COP 3502 Final Exam Review Notes Summer 2002...

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

Algorithms Part 1 What is an algorithm? How does an everyday algorithm differ from a computer algorithm? How are they similar? How do you describe an algorithm? What makes a “good” algorithm? Levels of abstraction, modularization. Steps in the development of algorithms. Algorithmic components: data structures, data manipulation instructions, conditional expressions, control structures, modules. Binary numbers. Algorithms Part 2 Basic tools for building algorithms: data and operators. Rules for identifiers in C. Declaration of constants. Know how to declare integers, doubles, and characters as well as the standard operations used to manipulate these data types. The assignment statement in C. Know how it works and how to use it. Basic input and output in C: scanf and printf . Algorithmic decisions. The if and if-else statements in C. Relational operators: <, >=, ==, <=, <, != Boolean operators: && (and), || (or), as well as ! (not). Know their truth tables. Be able to evaluate arithmetic and Boolean expressions using the precedence of the operators. Algorithms Part 3 Nested conditional statements. Nested if statements. Nested if-else statements. Be able to trace through code using these types of statements as well as being able to write code using them. Final Exam Review Notes - 1 COP 3502 – Final Exam Review Notes – Summer 2002

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

View Full Document
Control Structures Sequence structures. Built into the C languages, execution is by default sequential. Selection structures: if and if-else statements (we haven’t covered switch statements yet). Repetition structures: while , for, and do-while statements in C. Know which are top-tested loops and which are bottom-tested loops and what the difference is. The for loop is a counted loop, know its structure which is somewhat different that either the while or the do-while loops. Nested control structures, i.e., nested loops. Functions and Modularity Part 1 Know what modularity is and why it is a “good” thing from an algorithmic point of view.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 8

finalrv - COP 3502 Final Exam Review Notes Summer 2002...

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

View Full Document
Ask a homework question - tutors are online