SOCIOLOGY 132 ONLINE Marriage and the Family
Spring 2017 Course Syllabus - Print for your records
Professor Porsche VanBrockin-Fischer, Ph.D.
Please call me Dr. V.
PLEASE NOTE This is a class that covers the adult topics of marriage, family,
human sexual
Last Lecture 350 W 2015
(soon you will be free)
Announcements/Questi
ons
Final exam April 23 1400 SSB
th
3:00pm 6:00pm
Bring a 2 sided 8.5 x 11 cheat sheet with ANYTHING
on it (or equivalent)
Bring 2 sharp pencils or equivalent
Bring a working calculat
CIS 350
Graphs
1/16/17 01:41:14 PM
Winter 2015
Announcements/questions
Today
is the Chinese New Year of the Zang
Last chance to see a Candidate on Friday
You can get started on program 3
No Class next week
Graphs
A graph G= (V,E) is a set of vertices
CIS 350
Another Tree Use and
Heaps
7 June 2011
Announcements/Questions
2
math talks on Friday
(almost pi day (free pizza and pie from
the math department usually)
Compuware comes on Tuesday March
17th (wear Green)
Review
Priority queues
Support the ope
Review for Quiz 4
ANNOUNCEMENTS/QUESTIONS
SHOW THE RESULTS OF ADDING 45 IN
THE FOLLOWING AVL TREE.
2
g 2
50
30
40
25
35
single
rotation
1p
-1
40
80
55
48 c
50
30
25
48 55
35
4
5
80
SHOW the RESULT OF ADDING 45 IN
THE FOLLOWING AVL TREE.
1
50
25
35
15
10
3
Review for Quiz 10
ANNOUNCEMENTS/QUESTIONS
Program 3 due date postponed until Tuesday March 24 th
SHOW THE RESULT OF DOING A DELETEMIN
FROM THE FOLLOWING BINOMIAL QUEUE
1
1
2
5
5
1
7
1
7
1
5
1
2
6
2
1
1
2
2
2
8
1
9
6
2
2
1
9
1
1
1
7
8
2
4
2
4
2
5
1
7
1
5
Review for Quiz 1
ANNOUNCEMENTS
Quiz today
ACM game night Jan 23
PROFESSORS PROGRAMMING PET
PEEVES
A main that basically only calls another
function
Everything in the main
Nothing in the main but 1 function call
Functions called input that do more tha
Quiz 10
CIS 350
2015
Review
Winter
THE FINAL EXAM IS IN
ROOM 1400 SSB
3:00 on Thursday
Review is Wednesday
3 to 5 in CIS 121
DIVIDE AND CONQUER
Supposed you are given a sorted sequence of unique integers cfw_a1, a2, ,
an give a O(lg n) algorithm to determ
CIS 350
Winter 12
Branch and Bound
01/16/17
1
Announcements / Questions
Branch and Bound
The branch-and-bound design strategy is very similar to
backtracking in that a state space tree is used to solve a
problem.
The differences are that the branch-and-bo
Intro to Algorithm Design
CIS 350
01/16/17
Winter 2014
1
Announcements/Questions
Last day to drop yesterday
Postpone Prog 3 to Tuesday.
St Patricks day
Today at 5:30 Compuware IAVS
building goes to 6:30
01/16/17
2
Announcements/Questions
Greedy
Divide and
Randomized Algorithms
And
Amortization Analysis
Weiss 10.4
Fall 2011
Announcements/
Today new material
Thursday is quiz 11
Thursday is the final at 3:00 in room TBA
Random Number
Generators
Computers dont generate random numbers only
pseudorandom number
CIS 350
Binominal Queues
Questions Announcements
6.8 Binomial Queues
Although leftists heaps support merging ,
insertion and deletemin all in O(lg(n)(on
average) we can do better
Binomial queues support all of the operations
in O(lg(n) worst-case time and
CIS 350 review 4 test
1
Week 6 leture
Announcements
Test on Thursday in 1400 SSB (be
on time)
Hashing techniques
Quadratic probing
Double Hashing
Rehashing
Extendible hashing
Quadratic probing
Hash to home bucket.
If collision, then try probing (from
t
Review for Quiz 8
ANNOUNCEMENTS/QUESTION
S
Review for Test 2
March 31st 2:00 (2 3:30)
139 CIS
Test on April 2th
Find the best big Oh, for the following.
T(n) = 10T(n /3) + 11n3
a = 10 , b = 3, k = 3 a < bk T(n) = O(n3)
T(n) = 128 T(n /2) + log3(n)
a = 128
CIS 350/3501
Data Structures &
Algorithm Analysis
Trees. Binary Trees.
Reading: Chap.4 (4.1-4.2) Weiss
Questions/Announcements
More Trees Examples
Unix / Windows file structure
Definition of Tree
A tree is a finite set of one or more nodes
such that:
Ther
B+ trees`
W 2013
1
Questions/Announcements
Link to binary tree code
http:/codepad.org/dTPLPWQ8
01/16/17
2
Outline
01/16/17
3
Motivation
01/16/17
4
Motivation (cont.)
01/16/17
5
Hard drive
6
Multiway Search Trees (of order m)
01/16/17
7
Definition of a B
CIS 350
Data Structures &
Algorithm Analysis
AVL Trees
Reading: Chap. 4, Weiss
Announcements
ACM game night on Friday
Binary Search Trees
A binary search tree is a binary tree
where the data to the left of any node is
less than the data in the node and th
CIS 350/3501
Data Structures &
Algorithm Analysis
Trees. Binary Trees.
Reading: Chap.4 (4.1-4.2) Weiss
Questions/Announcements
More Trees Examples
Unix / Windows file structure
Definition of Tree
A tree is a finite set of one or more nodes
such that:
Ther
CIS 350
Hashing
Announcements/Questions
Hashing
Hashing is a method for storing and accessing data. (often
used in dictionaries where few deletions and few noninitial insertions and lots of finds)
Used in static databases.
Use in compilers for storage of
Review for Quiz 6
CIS 350
Winter 15
ANNOUNCEMENTS/QUESTIONS
1 Compuware is coming on Tuesday
2. math talks tomorrow
3. Steve Drews is the now the president of ACM
4. Quiz today
5. Program 3 has been updated.
. SHOW THE RESULT OF DELETE-MAX TO THE FOLL
Dynamic Programming
01/16/17 13:40
1
Schedule of Events
14
Tuesday Program 4 is due
16 Thursday Quiz / review 4 final
23 Thursday Final 3 6:00 in room TBA
2
Dynamic Programming
Is
a bottom up approach.
Again we break the problem up but we start at the
Sets
CIS 350
Fall
2012
01/16/17
1
Announcements/questions
01/16/17
2
Sets, Union/Find
Output Union, Intersection
or Find
Input Description: A universe of objects U = cfw_ u1,.,un , and
a collection of subsets S1,.,Sm, Si a subset U .
Input (sets)
Problem:
Intro to Algorithm Design
CIS 350
Fall
2010
1/16/17
1
Schedule
Quiz this Thursday April 9th
Program 4 is due next next Tuesday
April 14th
Quiz April 16th
Final Exam April 23th 3:00 in room TBD
Divide and Conquer
Has 2 parts Divide (break the problem into
Review for Quiz 8
ANNOUNCEMENTS/QUESTIONS
est II in SSB 1600 On Thursday
GIVEN A LOWER BOUND ON THE TIME
TO FIND THE MAX OF A SET OF N
INTEGERS
there are N possible values for the max
lower bound (lg(N)
FIND AN DECISION TREE LOWER
BOUND ON COLORING A GRA
Backtracking
01/16/17 13:40
1
Announcements/Questions
2
Intro to Backtracking
The
last design technique
Clever implementation of exhaustive
search
3
BackTracking
Is a systematic way to go through all the possible configurations
of a space.
These may be
CIS 350
MaxFlow
1/16/17 01:41:07 PM
Fall 2012
Announcements/questions
Tech
Girl scout planning tonight,
Socrative (might try Kahoots)
Program due 3 weeks
Test 2 in 5 weeks
Network Flow Picture
s
3
1
a
s
2
3
b
4
c
d
2
3
0
a
2
3
2
b
2
2
1
c
d
2
t
No edg
Intro to Algorithm Design
CIS 350
Fall
2010
01/16/17
1
Schedule
March 19th Today Quiz 7 Lecture
March 24th Tuesday Prog 3 due
March 26th Thursday Quiz 8
March 31st Tuesday (mini quiz if
needed)
April 2nd Thursday Test 2
Algorithm Design
In chapter 10, we
Sorting
01/16/17 13:40
1
Announcements
Calender
Insertion Sort
Pretend
to start with an empty list
As each element is accessed, place it in
the correct position in the list
Original data 34, 8, 64, 51, 32, 21 (the 0 element is sorted)
After p =1 8, 34,