review1 - Exam#1 Review Notes Algorithms What is an...

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

View Full Document Right Arrow Icon
Algorithms 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. Algorithmic Complexity Asymptotic notation. What’s considered and what isn’t. Big-Oh notation. Omega notation. Theta notation. Little-Oh notation. Exam #1 Review Notes - 1 Exam #1 Review Notes
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
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.
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 / 8

review1 - Exam#1 Review Notes Algorithms What is an...

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