# Study Guides for Computer Science at University of British Columbia (UBC)

- 44 Result
- About UBC

## Premium Notes

Courses with the best lecture notes and study guides taken by top Note Takers.

## CPSC 121- Final Exam Guide - Comprehensive Notes for the exam ( 86 pages long!)

OC232820486 Page

0

## CPSC 259- Final Exam Guide - Comprehensive Notes for the exam ( 40 pages long!)

OC108867340 Page

0

## CPSC 320 Final: CPSC 320 Final Exam 2017

OC254029418 Page

0

Each examination candidate must be prepared to produce, upon the request of the invigilator or examiner, his or her ubccard for identification. Examina

View Document## CPSC 320 Final: cpsc-320-2014W2-final-practice1

OC25402948 Page

0

R x 0 y=1 y = x(x+1) R x 0 y=0 2y = 2x+1 1 r x 0 . ) + f (n) r a 1 b > 1 t st r r st t s t r . F (n) o(nc) r c < logb a t t (n) (nlogb a) . R s st t k

View Document## CPSC 121 Study Guide - Final Guide: Children'S Book Council Of Australia, Prime Number, Memory Address

OC254029419 Page

0

Read these instructions now: you have 150 minutes to write the ?? questions on this exam, a total of ?? marks are available. You may want to complete w

View Document## CPSC 121 Study Guide - Final Guide: Boolean Function, Sequential Logic, Regular Expression

OC25402947 Page

0

{ medium-easy } consider the following two columns containing logical expres- sions, set expressions, and circuits. Each element of the rst column is e

View Document## CPSC 121 Study Guide - Final Guide: Regular Expression, Vivarium Inc., Sorting Algorithm

OC254029411 Page

0

This exam is open-book, and you may use any written or printed materials to assist you. You may not use any electronic devies, though (e. g. , calculat

View Document## CPSC 121 Study Guide - Final Guide: Surjective Function, Brie, Perfect Number

OC25402946 Page

0

Explain brie y the di erence between the purpose of a half-adder and that of a full- adder. Solution : a half-adder computes the sum of two bits. A ful

View Document## CPSC 121 Study Guide - Final Guide: Binary Logarithm, Binary Search Algorithm, Mathematical Induction

OC5506273 Page

26

Prove that every positive integer n greater than 1 can be written as a product of primes. Proof: we prove the result by induction on n. We can write n

View Document## CPSC 313 Study Guide - Final Guide: Memory Management Unit, Hlah, Beaufort Scale

OC3430092 Page

20

Decode: dste ra or rb if concerned with write-back, else f, dstm ra or rb if reading from mem (valm ) else f. Execute vale what the alu computes (! 0 +

View DocumentShowing 1 — 12 of 44 result