L1 Supplementary Notes Page 1 Selection Sort Comparison Counting.

Slides:



Advertisements
Similar presentations
Counting. Counting in Algorithms How many comparisons are needed to sort n numbers? How many steps to compute the GCD of two numbers ? How many steps.
Advertisements

Identity and Inverse Matrices
1 EE5900 Advanced Embedded System For Smart Infrastructure Advanced Theory.
Math 3121 Abstract Algebra I
1 Basic Counting Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
COMP 170 L2 Page 1 L03: Binomial Coefficients l Purpose n Properties of binomial coefficients n Related issues: the Binomial Theorem and labeling.
Chapter 5 Section 1 Sets Basics Set –Definition: Collection of objects –Specified by listing the elements of the set inside a pair of braces. –Denoted.
Selection Sort
COMP 170 L2 L15: Probability of Unions of Events l Objective: n The inclusion-exclusion principle for probability Page 1.
L2 Supplementary Notes Page : Recap l Sum Principle n Applied to selection sort l Product Principle n Applied to matrix multiplication and.
Special Sum The First N Integers. 9/9/2013 Sum of 1st N Integers 2 Sum of the First n Natural Numbers Consider Summation Notation ∑ k=1 n k =
Operations on Sets – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Operations on Sets Reading: Kolman, Section 1.2.
9.2 Arithmetic Sequence and Partial Sum Common Difference Finite Sum.
2.1 – Sets. Examples: Set-Builder Notation Using Set-Builder Notation to Make Domains Explicit Examples.
Sequences & Summations CS 1050 Rosen 3.2. Sequence A sequence is a discrete structure used to represent an ordered list. A sequence is a function from.
Arithmetic Sequences and Series
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7.1 Solving Systems of Two Equations.
9.3 Addition Rule. The basic rule underlying the calculation of the number of elements in a union or difference or intersection is the addition rule.
Geometry Section 1.5 Describe Angle Pair Relationships.
COMP 170 L2 Page 1 Review for Midterm 1 l Part I: Counting n L01-L03 l Part II: Number Theory and Cryptography n L04, L05.
3. Counting Permutations Combinations Pigeonhole principle Elements of Probability Recurrence Relations.
Section 4-2 Adding and Subtracting Matrices. I. Matrices can be added or subtracted if they are the same size Both matrices are 2x2 + To add them just.
Chapter 5: Permutation Groups  Definitions and Notations  Cycle Notation  Properties of Permutations.
2.2 Set Operations. The Union DEFINITION 1 Let A and B be sets. The union of the sets A and B, denoted by A U B, is the set that contains those elements.
Selection Sort
Probability Basics Section Starter Roll two dice and record the sum shown. Repeat until you have done 20 rolls. Write a list of all the possible.
Finite Mathematics Dr. Saeid Moloudzadeh Sets and Set Operations 1 Contents Algebra Review Functions and Linear Models Systems of Linear.
Graphs Basic properties.
9.1 Sequences and Series. Definition of Sequence  An ordered list of numbers  An infinite sequence is a function whose domain is the set of positive.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 2.6 Infinite Sets.
Source Page US:official&tbm=isch&tbnid=Mli6kxZ3HfiCRM:&imgrefurl=
MAT 2720 Discrete Mathematics Section 3.3 Relations
Section 7.3: Representing Relations In this section, we will cover two ways to represent a relation over a finite set other than simply listing the relation.
1 Chapter 2 Program Performance. 2 Concepts Memory and time complexity of a program Measuring the time complexity using the operation count and step count.
Pigeonhole Principle. If n pigeons fly into m pigeonholes and n > m, then at least one hole must contain two or more pigeons A function from one finite.
Mathematical Induction 1. 2 Suppose we have a sequence of propositions which we would like to prove: P (0), P (1), P (2), P (3), P (4), … P (n), … We.
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
Section 2.4. Section Summary  Sequences. o Examples: Geometric Progression, Arithmetic Progression  Recurrence Relations o Example: Fibonacci Sequence.
Venn Diagrams.
ПЕЧЕНЬ 9. Закладка печени в период эмбрионального развития.
Путешествуй со мной и узнаешь, где я сегодня побывал.
Презентацию подготовила Хайруллина Ч.А. Муслюмовская гимназия Подготовка к части С ЕГЭ.
Principle of Inclusion and Exclusion
Sets Finite 7-1.
12-1 Organizing Data Using Matrices
Introduction to Combinatorics
SUBSETS How can I send VALENTINES? --- Let me count the ways.
9. Counting and Probability 1 Summary
ALGEBRA II H/G - SETS : UNION and INTERSECTION
Counting and Probability Section 12.1: Sets and Counting IBTWW…
CSE 2353 – September 22nd 2003 Sets.
Chapter 5 Integrals.
Page 1. Page 2 Page 3 Page 4 Page 5 Page 6 Page 7.
2.6 Applications Of Induction & other ideas Important Theorems
Probability Models Section 6.2.
[ ] [ ] [ ] [ ] EXAMPLE 3 Scalar multiplication Simplify the product:
Series and Summation Notation
Бази от данни и СУБД Основни понятия инж. Ангел Ст. Ангелов.
ALGEBRA I - SETS : UNION and INTERSECTION
Lecture 18 Section 4.1 Thu, Feb 10, 2005
ALGEBRA II H/G - SETS : UNION and INTERSECTION
Factoring Trinomials of the Type x2 + bx + c
Lial/Hungerford/Holcomb: Mathematics with Applications 10e Finite Mathematics with Applications 10e Copyright ©2011 Pearson Education, Inc. All right.
Special Pairs of Angles
Section 2.6 Infinite Sets.
Basic Matrix Operations
Set – collection of objects
CMPS 2433 Chapter 8 Counting Techniques
Sets, Unions, Intersections, and Complements
3-5 Working with Sets.
Presentation transcript:

L1 Supplementary Notes Page 1 Selection Sort Comparison Counting

L1 Supplementary Notes Page 2 Sum Principle

L1 Supplementary Notes Page 3 Sum Principle in Abstract Another notation for finite set: set of men in this section = {p|p is a male student in COMP 170 L2}

L1 Supplementary Notes Page 4 Matrix Multiplication

L1 Supplementary Notes Page 5 Product Principle Si and Sj are disjoint, |Si| = n S = S1 U S2 U … U Sm |S| = m |Si| = mn

L1 Supplementary Notes Page 6 2-element subsets and ordered pairs l Ordered pairs: (1, 2) and (2, 1) are different l {1, 2}  (1, 2), (2, 1) l {1, 3}  (1, 3), (3, 1) l …. l # of 2-subsets * 2 = number of ordered pairs

L1 Supplementary Notes Page 7 Number of Ordered Pairs l S1: pairs with first element =1 l S2: pairs with first element = 2 l.. l Sn: pairs with first element = n l Si and Sj are disjoint, |Si| = n-1 l S = total # of ordered pairs l S= S1 U S2 U … U Sn |S| = n|Si| = n(n-1)