{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

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

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. 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. 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 . Final Exam Review Notes - 1 COP 3502H – Final Exam Review Notes – Spring 2003

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

View Full Document
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.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern