CMSC 132- Final Exam Guide - Comprehensive Notes for the exam ( 44 pages long!)

• School: University of Maryland
• Department: Computer Science
• Course: CMSC 132
• Professor: Laurence Herman

Document Summary

An algorithm is a set of instructions that are self contained and meant to be performed. Algorithms are essential to the way computers process data. Many computer programs contain algorithms that detail the specific instructions a computer should perform (in a specific order) to carry out a specified task, such as calculating employees" paychecks or printing students" report cards. For some such computational process, the algorithm must be rigorously defined: specified in the way it applies in all possible circumstances that could arise. That is, any conditional steps must be systematically dealt with, case-by-case; the criteria for each case must be clear (and computable). Algorithms can be expressed in a variety of ways such as natural language or pseudocode. Natural language is verbose however so is hardly ever used. More common is the use of pseudocode. Pseudocode is notation representing a simple programming language. New type of variable with a set of fixed values.