CMPT 120 Study Guide - Quiz Guide: Pseudocode

• School: Simon Fraser University
• Department: Computing Science
• Course: CMPT 120
• Professor: diana cukierman

Document Summary

Using built in operations, functions and methods, strings immutability. Built in functions, importing math and random modules. Representing characters (ascii) - copy down ascii table. Unsigned binary n bits: 0 < x < Ranges of values representable with n bits. Explanation of errors in your own words. True/false basic concepts (understanding, but no memorization) Create some brief piece of code - on paper. An algorithm is a finite sequence of unambiguous instructions for solving a. Problem for any legitimate input in a finite amount of time. You can describe algorithms using natural language, flowcharts or pseudocode. Programmer v user views editor & shell has control to what the user sees. Variables - name of an area in memory containing some value. X = x + 1, first expression is evaluated then the old x is destroyed. String concatenation: can add together strings to make words expressions ice + cream = icecream. Can also multiply ha *3 = hahaha .