Get 2 days of premium access
Study Guides (380,000)
US (220,000)
UMD (10,000)
CMSC (1,000)
CMSC 132 (200)
Study Guide

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


Department
Computer Science
Course Code
CMSC 132
Professor
Laurence Herman
Study Guide
Final

This preview shows pages 1-3. to view the full 44 pages of the document.
UMD
CMSC 132
FINAL EXAM
STUDY GUIDE

Only pages 1-3 are available for preview. Some parts have been intentionally blurred.

Only pages 1-3 are available for preview. Some parts have been intentionally blurred.

Algorithms
What is an algorithm?
An algorithm is a set of instructions that are self contained and meant to be performed.
One of my favorite algorithms
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.
find more resources at oneclass.com
find more resources at oneclass.com
You're Reading a Preview

Unlock to view full version

Only pages 1-3 are available for preview. Some parts have been intentionally blurred.

An example of a natural language algorithm
More common is the use of pseudocode
Pseudocode is notation representing a simple programming language.
Or this…
find more resources at oneclass.com
find more resources at oneclass.com
You're Reading a Preview

Unlock to view full version