Filter By
Filter Reset
Semester
Class Notes (1,047,109)
CA (600,095)
U of C (7,736)
CPSC (122)

Class Notes for Computer Science at University of Calgary (page 8)

24HR Notes

The notes and past exams you need. Available 24 hours after each lecture.

Computer Science
CPSC 413
Peter Hoyer
CPSC 355 Lecture Notes - Lecture 3: Gnu Debugger, Ibm Basic Assembly Language And Successors, Elementary Arithmetic

Computing Machinery IAssignment 1Basic Assembly Language Programming32Create a SPARC assembly language program that finds the minimum of y = 2x 18x + 10x + 39 in the range 2 x 11, by stepping through the range one by one ...

Computer Science
CPSC 355
Leonard Manzara
CPSC355 Lecture 1: CPSC 355 notes.docx

LECTURE 1COURSE OBJECTIVES Learn how a typical modern computer is structuredo Its architectureo Will concentrate on CPU architecture Learn how a computer operates as it executes instructions Learn how data and instructions...

Computer Science
CPSC 355
Leonard Manzara
CPSC 355 Lecture Notes - .Bss, Readwrite, Machine Code

External Variables • Are non-local variables stored in special regions of memory • Two types: • Those initialized to zero • Those initializes to user-defined values • Programs divide memory into three sections • text ...

Computer Science
CPSC 355
Leonard Manzara
CPSC 481 Lecture Notes - Closed Set, Extrapolation

Lecture 1: LOOK Lecture 2: ASK Creating questionnaires ● Be clear on the goal of each individual question. ● Open vs. Closed questions ○ Open have a general answer - Opinion, thought, etc. ...

Computer Science
CPSC 481
Tony Tang
CPSC 481 Lecture Notes - High Fidelity

Continued from notebook Hi vs. Lo FIdelity Distinction: Is the choice of medium close to or far from that of the final design. e.g. ● high fidelity = Software ● low fidelity = paper prototype Pros and Cons ...

Computer Science
CPSC 481
Tony Tang
CPSC 481 Lecture Notes - Usability Engineering, Eval

Heuristic Evaluation Systematic inspection of an interface design to see if an interface complies with a set of usability heuristics or usability guidelines. Generally ● 3-5 inspectors ● Inspect interfa...

Computer Science
CPSC 481
Tony Tang
CPSC 313 Lecture Notes - Regular Language, January 30, Joule

January 30th, 2012 Identifying Nonregular Languages We can use something called a Pumping Lemma to help us prove that certain languages are nonregular. When considering DFAs, we see that they ha...

Computer Science
CPSC 313
Philipp Woelfel
CPSC 313 Lecture Notes - Regular Expression

January 27th, 2012 Regular Expressions Any language L that accepts a regular expression r is regular. GNFA - General Nondeterministic Finite Expression A GNFA N accepts a ...

Computer Science
CPSC 313
Philipp Woelfel
Algorithms for Regular Languages

January 27th, 2012 Algorithms for Regular Languages Theorem 3.1 - Given L in standard representation and w 2 ▯ , there is an algorithm for determining whether w 2 L. Proof. Assume w:l:o:g: that L...

Computer Science
CPSC 313
Philipp Woelfel
CPSC 313 Lecture Notes - Dependency Graph, Context-Free Grammar

February 27, 2012 Unit Productions Unit production is a production A ! B where both sides are symbols. However, we don’t like unit productions. We should be able to produce a grammar t...

Computer Science
CPSC 313
Philipp Woelfel

Log In


OR

Don't have an account?

Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Sign up

Join to view


OR

By registering, I agree to the Terms and Privacy Policies
Already have an account?
Just a few more details

So we can recommend you notes for your school.

Reset Password

Please enter below the email address you registered with and we will send you a link to reset your password.

Add your courses

Get notes from the top students in your class.


Submit