Filter By
Filter Reset
Semester
Class Notes (1,044,171)
CA (598,528)
UTSC (35,254)
Computer Science (386)

Class Notes for Computer Science at University of Toronto Scarborough

Computer Science
CSCA67H3
Anna Bretscher, Richard Pancer
Computer Science
CSCA67H3
Anna Bretscher, Richard Pancer
CSCA67H3 Lecture 4: Friday 29th, quantifiers and direct proofs
24HR
Premium

Quantifiers and Direct proofs 1)Translate this into English statements 3. x D, y D, S(x, y) Everyone scares everyone 4. y D, x D, S(x, y) Everyone scares everyone 5. x D, y D, S(x, y) Everyone scares someone, example: e...

Computer Science
CSCA67H3
Anna Bretscher, Richard Pancer
CSCA67H3 Lecture 3: Friday 21st, Propositional equivalence
24HR
Premium

Propositional equivalence

Computer Science
CSCA67H3
Anna Bretscher, Richard Pancer
CSCA67H3 Lecture 2: Friday 14th, Implications and predicates
24HR
Premium

Implication and Predicates Sept 14, 2018 S S T S T S T T F T T T T F F F F F T T T T F T F T T

Computer Science
CSCA67H3
Anna Bretscher, Richard Pancer
CSCA67H3 Lecture 1: Friday 7th, Introduction to proofs
24HR
Premium

Introduction to Proofs Mathematical Languages that are used in this course and future related course o Propositions o Compound Propositions AND OR IMPLIES IFF o Notation o Predicates o Quantifiers Propositions A propo...

Computer Science
CSCA67H3
Anna Bretscher, Richard Pancer
CSCA48H3 Lecture Notes - Lecture 14: If And Only If, Tree Traversal, Branching Factor
24HR
Premium

CSCA48 LECTURE 13 Recursion Trees Visited Recursively A tree consists of zero or more nodes each of which has zero or more pointers to (smaller) trees. An empty tree has no nodes. If 1 ,..n,T are trees, and R is a node,...

Computer Science
CSCA48H3
Marzieh Ahmadzadeh
CSCA48H3 Lecture 16: Big Oh
24HR
Premium

CSCA48 LECTURE 16 BigOh Important Concepts Within a constant factor When defining running times we sometimes disagree by as much as a constant factor. We want to get the same result independent of such possible differenc...

Computer Science
CSCA48H3
Marzieh Ahmadzadeh
CSCA48H3 Lecture Notes - Lecture 17: Self-Balancing Binary Search Tree, Avl Tree, Hash Table
24HR
Premium

CSCA48 LECTURE 17 Searching Searching A search operation is as important as insertion and removal operations in most data structures Searching Methods Linear Time Complexity, O(n), is not satisfactory if n is large Binar...

Computer Science
CSCA48H3
Marzieh Ahmadzadeh
CSCA48H3 Lecture Notes - Lecture 20: Heapsort, Quicksort, Merge Sort
24HR
Premium

CSCA48 LECTURE 20 Sorting (Part 2) Merge Sort Uses divide and conquer Split the list into two sublists (L1 and L2) Sort L1 and L2 Merge L1 and L2 Running Time (O(n(logn)) > log(n) for the splits and n for the merge def m...

Computer Science
CSCA48H3
Marzieh Ahmadzadeh
CSCA48H3 Lecture Notes - Lecture 15: Pseudocode
24HR
Premium

CSCA48 LECTURE 15 Algorithm Analysis Algorithm Definition Solving a problem stepbystep in a finite amount of time Analysis How much computer resources does an algorithm use? Memory Space We are not interested in this for...

Computer Science
CSCA48H3
Marzieh Ahmadzadeh
CSCA48H3 Lecture Notes - Lecture 18: Init, Hash Table, Hash Function
24HR
Premium

CSCA48 LECTURE 18 Hashing Code + Explanation Important Concepts Hashing would provide an O(1), constant time search technique Hash table: collection of items, where each position of the table is called a slot (numbered f...

Computer Science
CSCA48H3
Marzieh Ahmadzadeh
CSCA48H3 Lecture Notes - Lecture 19: Hash Table, Insertion Sort, Selection Sort
24HR
Premium

CSCA48 LECTURE 19 Sorting (Part 1) Sorting The process of reordering items such that every item is placed in its right place Application: Information presentation A requirement for other algorithms (ex: in place binary s...

Computer Science
CSCA48H3
Marzieh Ahmadzadeh
CSCA48H3 Lecture Notes - Lecture 12: Binary Heap, Binary Tree, Data Structure
24HR
Premium

CSCA48 LECTURE 12 Compact Binary Trees + Recursion Heaps: Data structure commonly used to implement priority queues A heap is a (binary) treebased data structure where each node contains a key, and the tree satisfies the...

Computer Science
CSCA48H3
Marzieh Ahmadzadeh
CSCA48H3 Lecture Notes - Lecture 7: Linked List, Init, Empty String
24HR
Premium

CSCA48 - LECTURE 07 - Nodes + Single Linked Lists Linked Lists A linked list is a set of nodes, where each node has two (or sometimes more) attributes The first attribute a node has is its data: the contents of...

Computer Science
CSCA48H3
Marzieh Ahmadzadeh

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