Exams are coming!
Get ready with premium notes and study guides!

Study Guides for Computing Science at Simon Fraser University (SFU)

  • 129 Result
  • About SFU

Premium Notes

Courses with the best lecture notes and study guides taken by top Note Takers.
SFUCMPT 225David MitchellSummer

CMPT 225 Study Guide - Summer 2019, Comprehensive Final Exam Notes - Binary Tree, Total Order, Selection Sort

OC167116746 Page
0
View Document
SFUCMPT 166Steven PearceFall

CMPT 166 Study Guide - Comprehensive Final Exam Guide - Computer Mouse, Ellipse, Java Virtual Machine

OC750369171 Page
0
In these notes you will learn: what this course is about, the pre-requisites for taking this course, the basic components of a computer, the definition
View Document
SFUCMPT 165Ying TangFall

CMPT 165 Study Guide - Comprehensive Final Exam Guide - Cascading Style Sheets, Uniform Resource Locator, String Instrument

OC257050855 Page
0
Involves understanding what was coded: takes digital signals from a computer and codes it into electronic signals >encoding, decoding is the opposite >
View Document
SFUCMPT 128Ghassan HamarnehFall

CMPT 128 Study Guide - Comprehensive Final Exam Guide -

OC250938628 Page
0
View Document
SFUCMPT 120Angelica LimSpring

CMPT 120- Final Exam Guide - Comprehensive Notes for the exam ( 38 pages long!)

OC231455538 Page
0
Computer science is problem solving using 2 components: a way of thinking algorithms, a way of communicating programming languages. Algorithms: list of
View Document
SFUCMPT 127Richard VaughanSpring

CMPT 127- Final Exam Guide - Comprehensive Notes for the exam ( 161 pages long!)

OC1671167161 Page
0
Log in, lab work flow, version control, command shell links. This assignment is a primer for the work flow you will follow in all of your labs. Follow
View Document
SFUCMPT 120Kevin Mc QuigginFall

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

OC167116731 Page
0
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,
View Document
SFUCMPT 125Igor ShinkarFall

CMPT 125 Final: Review Part 6

OC23009632 Page
0
View Document
SFUCMPT 125Igor ShinkarFall

CMPT 125 Study Guide - Final Guide: Regular Expression

OC23009632 Page
0
Draw a dfa that accepts all strings that contain aab , and rejects all other strings. Draw a dfa that rejects all strings that contain aab , and accept
View Document
SFUCMPT 125Igor ShinkarFall

CMPT 125 Study Guide - Final Guide: Binary Search Tree, Binary Tree

OC23009632 Page
0
View Document
SFUCMPT 125Igor ShinkarFall

CMPT 125 Study Guide - Final Guide: Maximal And Minimal Elements, Binary Tree

OC23009632 Page
0
Review part 2 struct btnode { int data; // struct btnode* left; // left child struct btnode* right; // right child struct btnode* parent; typedef struc
View Document
SFUCMPT 125Igor ShinkarFall

CMPT 125 Study Guide - Final Guide: Time Complexity, Sorting Algorithm

OC23009632 Page
0
Write a function that gets a binary search tree and prints all items in the tree in an increasing order. Use big-o notation to express the running time
View Document
Showing 1 — 12 of 129 result
View all courses (100+)
View all professors (30+)

Study Guides (380,000)
CA (150,000)
SFU (4,000)
CMPT (100)