CMPT 120- Midterm Exam Guide - Comprehensive Notes for the exam ( 31 pages long!)

• School: Simon Fraser University
• Department: Computing Science
• Course: CMPT 120
• Professor: Kevin Mc Quiggin

Document Summary

Assignment 1- bills, coins and a secret code. Introduction to programming in c and algorithm analysis: the data model and pointer operations. But in c, there is an extra step: running program machine gedit algorithm program. c gcc compiler assembly code (a. out) An assembly language is a higher- level language compared to machine languages, but lower- level compared to c. Abstract operation codes as mnemonics. labels (variable names). An assembler translates mnemonics and labels into machine language. cfi_def_cfa_register %rbp subq leaq movl movb callq movl movl. A machine language can be processed directly by a computer. A program is a sequence of instructions. Each instruction code (opcode) is represented by a number. No variable names or subroutine names in machine language! Machine languages are very hard for humans to write and understand. 53 83 ec 08 e8 97 00 00. 8b 83 fc ff ff ff 85 c0. C4 08 5b c3 ff 35 04 a0.