# Class Notes for Computer Sci. at Concordia University

CONCORDIACOMP 352T B AWinter

## COMP 352 Lecture Notes - Lecture 10: Empty Set, Xu

OC7633822 Page
39
1 call --> 3 call --> 22 calls --> (cid:1007)n-1 calls; therefore o(3n) Input: a set t of n elements a1, a2,an. Output: all the subsets of t stored in
View Document
CONCORDIACOMP 352Dhrubajyoti GoswamiWinter

## COMP 352 Lecture 2: Chapter4_4

OC23884301 Page
0
View Document
CONCORDIACOMP 228David ProbstWinter

## COMP 228 Lecture Notes - Lecture 12: Pilot Error, Exponential Distribution, Poisson Distribution

OC9256938 Page
134
Engr371 probability and statistics final exam fall 2010 question 1: in the computer market, the price of a computer normally depends on the speed that
View Document
CONCORDIACOMP 228David K ProbstWinter

## COMP 228 Lecture Notes - Lecture 1: Working Set, Complex Instruction Set Computing, Datapath

OC144351210 Page
3
Uniprocessor (circa 2003):a uniprocessor system is defined as a computer system that has a single central processing unit that is used to execute compu
View Document
CONCORDIACOMP 352Dhrubajyoti GoswamiSpring

## COMP 352 Lecture 2: Programming Part

OC14435122 Page
0
View Document
CONCORDIACOMP 352T B AWinter

## COMP 352 Lecture 19: Heap, Bottom-Up Heap, Adaptable Priority Queue, Merge Sort, and Divide and Conquer Paradigm

OC7633822 Page
9
If you are given two heaps, you can merge it by creating a new heap with a root. Down heap is performed to restore heap order property. Is faster than
View Document
CONCORDIACOMP 352T B AWinter

## COMP 352 Lecture 18: Priority Queue (Continued)

OC7633824 Page
19
Transfer the input from an input list to a pq. Remove the minimum or maximum (depending on whether it is max/min pq) from the pq. Insert to the list (r
View Document
CONCORDIACOMP 228David K ProbstWinter

## COMP 228 Lecture Notes - Lecture 2: Negative Number, Combinational Logic, Natural Number

OC144351212 Page
4
________________________________ inside the processor. i"ll redraw block diagram of the whole uniprocessor, this time slightly differently. | | | regis
View Document
CONCORDIACOMP 335Lata NarayananFall

## COMP 335 Lecture Notes - Lecture 1: Partial Function, Set Notation, Codomain

OC7633822 Page
13
Every tuesday there is a quiz before class via clicker. Best 9 out of 10 quizzes will be graded. Set: unordered collection of objects, elements are not
View Document
CONCORDIACOMP 352Volker HaarslevFall

## COMP 352 Lecture Notes - Lecture 3: Auxiliary Memory

OC7694303 Page
9
View Document
CONCORDIACOMP 352T B AWinter

## COMP 352 Lecture 17: Priority Queue

OC7633823 Page
38
Depending on the implementation used it affects the time complexity. The ones we have so far were proper binary tree. A heap complete binary tree store
View Document
CONCORDIACOMP 228Andrew Mc AuslandWinter

## COMP 228 Lecture Notes - Lecture 11: Dialog Box, Reticle, Mediacorp

OC7216044 Page
27
Formula basics: perform mathematical operations & arrive at calculated result combination of constants, cell references and arithmetic. Type = (start f
View Document
Showing 1 — 12 of 188 result

## Popular Courses

View all courses (50+)

## Popular Professors

View all professors (20+)

Class Notes (1,000,000)
CA (610,000)
Concordia (5,000)
COMP (100)