Filter By
Filter Reset
Semester
Class Notes (1,044,363)
CA (598,594)
U of C (7,725)
CPSC (122)

Class Notes for Computer Science at University of Calgary

24HR Notes

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

CPSC 203 Lecture Notes - Lecture 33: Wingdings
24HR
Premium

Lecture 33 The active document Application. Windows. Count Object: Application Accessing the windows property of word ( the application) Info about windows currently opened Property of Window: Number Attributes of Ac...

Computer Science
CPSC 203
James Roger Tam
CPSC 203 Lecture Notes - Lecture 6: Current Contents
24HR
Premium

October 30 Creating a message box Functioning Arguments As you type in the name of the VB functions you will see visual hints about the arguments for the function Sub exercise20Output () Exercise 20output Macro M...

Computer Science
CPSC 203
James Roger Tam
CPSC 203 Lecture 1: September 1st- October 6th
24HR
Premium

Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner

Computer Science
CPSC 203
James Roger Tam
CPSC 203 Lecture 25: Lectures 22-23-25
24HR
Premium

OCTOBER 22 W8- Lecture 26 VBA: Visual basic for applications We need a language that allows us to write a computer program Seldom used Not the same as VB, but similar Macro language: allows a computer to...

Computer Science
CPSC 203
James Roger Tam
CPSC 203 Lecture Notes - Lecture 5: Lookup Table
24HR
Premium

October 16, 2018 1- Lookup Functions 2- Counting Functions Lookup Functions: Excel How does it work? 1- Look up for the values that exceeds it and it returns to the previous one. It doesnt have to be in ascending order REL...

Computer Science
CPSC 203
James Roger Tam
CPSC 231 Lecture Notes - Lecture 6: Pygame, Sublime Text, Source Code Editor

CPSC 231 - Test and Run Python Codes There are many ways to run your code for testing, each with its own benefits and downfalls. Here is a list of the multiple ways you can do this, along with how to set- up each one: IDLE...

Computer Science
CPSC 231
Sohaib Bajwa
CPSC 319 Lecture 6: CPSC 231 - Type Conversion

CPSC 231 - Data Types (Python) Types Boolean: a boolean is either True or False. Used to compare values or statements. Integer: a simple number, no decimal places. Float: s...

Computer Science
CPSC 319
Sohaib Bajwa
CPSC 457 Lecture Notes - Lecture 1: The Repository, Iterative And Incremental Development, Software Maintenance

th September.13 /2016 Refactoring Basic Concepts - Refactoring: is the disciplined process of changing the internal structure of software to make it easier to understand and maintain, without changing it...

Computer Science
CPSC 457
kawash
CPSC 319 Lecture Notes - Lecture 9: Khnum, Linked List, Directed Acyclic Graph

Graphs Classification - Data structures where each node may have many predecessors and many successors - Are a generalization of tree structures, which are a generalization of linear structures Definitions ...

Computer Science
CPSC 319
Leonard Manzara
CPSC 319 Lecture Notes - Lecture 11: Priority Queue, The Algorithm, Kinship Terminology

Heaps and Heapsort Heaps - A max heap is a binary tree where: o The value of each node is ≥ the values of its children o The tr...

Computer Science
CPSC 319
Leonard Manzara
CPSC 319 Lecture Notes - Lecture 12: Cengage Learning, Binary Search Tree, Rudolf Bayer

\ \ (b) one such node also reside in secondary storage,each key access would require two sec- ondary s...

Computer Science
CPSC 319
Leonard Manzara
CPSC 319 Lecture Notes - Lecture 10: Linked List, Binary Search Algorithm, Quadratic Probing

Hash Tables Introduction - Hash tables are classified as set structures o Nodes have no predecessors or successors - Are good for implementing dictionaries, where we only need the operations: ...

Computer Science
CPSC 319
Leonard Manzara
CPSC 319 Lecture Notes - Lecture 5: Cengage Learning, Linked List, Geoffrey Chaucer

Arrays and Linked Lists Lists - Are classified as linear data structures - May be one-dimensional, or multi-dimensional - Each element of a list might consist of: o A single data item, or ...

Computer Science
CPSC 319
Leonard Manzara
CPSC 319 Lecture Notes - Lecture 8: Binary Search Tree, Binary Tree, Crazy Eights

The Need for Balanced Trees - Searches and insertions are most efficient when a binary tree is well-balanced - Binary trees may become unbalanced after insertions and deletions o In the worst c...

Computer Science
CPSC 319
Leonard Manzara

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