review3 - COP 3502H Final Exam Review Notes Spring 2003...

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

View Full Document Right Arrow Icon
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. 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. 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. Algorithms Part 2 Basic tools for building algorithms: data and operators. Rules for identifiers in C. Declaration of constants. 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 . Final Exam Review Notes - 1 COP 3502H – Final Exam Review Notes – Spring 2003
Background image of page 1

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

View Full DocumentRight Arrow Icon
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. Algorithmic Complexity Asymptotic notation. What’s considered and what isn’t. Big-Oh notation. Omega notation. Theta notation. Little-Oh notation. Run-time approximations. (See Practice Problems #1 & Solutions.) Summations. Know the following: = = = = + = = + = + = n 1 i n 0 i n 1 i n 0 i 1 n 1 n 1 2 ) 1 n ( n i 2 ) 1 n ( n i Number Systems Know number systems, binary, octal, decimal, and hexadecimal. Know conversions between any of these number systems. Practice Problems #2 & Solutions. 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. 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).
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.

This document was uploaded on 06/12/2011.

Page1 / 15

review3 - COP 3502H Final Exam Review Notes Spring 2003...

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