Exam 1 Review
1) The winning powerball numbers consist of a set of 5 numbers chosen from [69] and a special 6th
number (the powerball) chosen from a separate collection of [26]. To win the grand prize, you
must match all 5 numbers (not necessarily in orde
Math 314: Discrete Mathematics
Homework 7
Submission instructions:
a) This assignment is due Wednesday, April 19th at 8:00 AM.
b) The rules for submissions given on the website still apply (you still need to
copy the problems down, etc.). You do not need
Math 314: Discrete Mathematics
Homework 3
Submission instructions:
a) This assignment is due Friday, February 17th at 8:00 AM.
b) The rules for submissions given on the website still apply (you still need to
copy the problems down, etc.). You do not need
Math 314: Discrete Mathematics
Homework 4
Submission instructions:
a) This assignment is due Wednesday, February 22nd at 8:00 AM.
b) The rules for submissions given on the website still apply (you still need to
copy the problems down, etc.). You do not ne
Quiz 6
April 20th, 2016
1) We describe a certain construction on a labeled graph. For a (simple) graph G with vertices v1 , . . . , vn ,
create a new graph G0 as follows: add vertices w1 , . . . , wn drawing an edge between wi and every
vertex in N (vi )
Math 314: Discrete Mathematics
Homework 6
Submission instructions:
a) This assignment is due Friday, March 31st at 8:00 AM.
b) The rules for submissions given on the website still apply (you still need to
copy the problems down, etc.). You do not need to
Quiz 5
April 13th, 2016
1) SHORT ANSWER: Briefly explain AND draw an example or a counterexample.
a) If G is planar, and e E(G), G e is planar.
b) If G is planar, and v V (G), G v is planar.
c) Every subgraph of a planar graph is planar.
d) Not every subg
Quiz 7
May 2nd, 2016
4
2
7
6
1
3
5
1) Write down the blocks corresponding to the (7, 3, 1)-design given by the above labeling of the Fano
plane.
2) Let D be a design on [v]. The Complimentary Design of D is formed by taking the complements of
all the bloc
Math 314: Discrete Mathematics
Homework 5
Submission instructions:
a) This assignment is due Friday, March 17th at 8:00 AM.
b) The rules for submissions given on the website still apply (you still need to
copy the problems down, etc.). You do not need to
Quiz 4
March 25th, 2016
1) Let G be the edge-weighted graph below:
6
8
7
1
5
2
1
2
3
4
3
4
a) Find a minimum-weight spanning tree of G, and give its weight.
b) How many Hamilton cycles does G have?
c) Find a minimum-weight Hamilton cycle of G, and give it
Quiz 1
February 12th, 2016
Name:
, Name:
, Name:
, Name:
Score:
/20
1) True or False?: Briefly explain, and draw an example or a counterexample (if applicable).
a) The number of ways for 10 people to finish first, second, and third in a race is 10
.
3
b)
Math 314: Discrete Mathematics
Homework 2
Submission instructions:
a) Choose 5 of the first 9 problems according to the guidelines below. You may
also do #10 and/or #11 if you wish. Do not turn in more than 5 of the first
9 problems!
b) Staple this page o
lg. r
WL= ZIQHL
LULUQLDL £5121;
my 14513131911153 mm. + lxliiuim
i Mammnm
l 4511
In I. ll 13 H I5
Iéinrm ._ _
[Herat 43mm 5m. £054.59. ..
EMAIL;st _. __ _. __ ._
Math 314: Discrete Mathematics
Homework 1 Solutions
Exercise: You live at the southwest corner of a 10 7 block grid. Your school is
at the northeast corner. How many ways are there to walk to school, provided that
every block walked is either north or eas
Math 314: Discrete Mathematics
Homework 2 Solutions
1.
a) Prove that if x
/ Q, then x
/ Q.
Proof: We prove the contrapositive: that x Q = x Q. If
x Q, we can write it as ab , with a, b Z and b 6= 0. But if t Z,
2
t2 Z, and if t 6= 0, t2 6= 0, so x = ab2
Math 314: Discrete Mathematics
Homework 5 Solutions
1. Problem 7.1.4.:
(a) Draw a graph with nodes representing the numbers 1, 2, . . . , 10 in which
two nodes are connected by an edge if and only if one is a divisor of the
other.
Solution:
1
6
9
5
2
3
8
Name:
CMSC 433
Spring 2016
Final Exam
Directions: Exam is open book, open notes, open electronics (but electronics
must be in airplane mode). Answer every question; write solutions in spaces
provided. Use backs of pages if necessary, but clearly indicate
ENEE 645 Spring 2013
Midterm Examination
Pages: 8 printed sides + 1 info sheet
Name: _
Time alloted:
1 hour 15 min
Answer key
Student ID: _
Maximum score: 66 points
University rules dictate strict penalties for any form of academic dishonesty. Looking sid
Name:
CMSC 433
Fall 2016
Final Exam
Directions: Exam is open book, open notes, closed electronics. Answer every
question; write solutions in spaces provided. Use backs of pages if necessary,
but clearly indicate when you do so. By writing your name above,
Name:
CMSC 433 Section 0101
Spring 2016
Midterm Exam
Directions: Test is open book, open notes, open electronics; however, all electronic devices must have all wireless capability disabled (airplane mode). Answer every question; write solutions in spaces
Name:
CMSC 433 Section 0101
Fall 2016
Midterm Exam
Directions: Test is open book, open notes, closed electronics. Answer every
question; write solutions in spaces provided. Use backs of pages for scratch
work. Good luck!
Honor Pledge: I pledge on my honor
16. Log-Based Recovery
Keep a log that stores all database update activities in the order they
occur
6 types of transaction log records:
T-ID: transaction identifier
D-ID: data item identifier
Vold: old value of D-ID
Vnew: new value of D-ID
<T,start>
Upda
16. Log-Based Recovery
log stores all database update activities in the order they occur
update log record is a tuple <T-ID, D-ID,V-old,V-new> where
T-ID: transaction identifier
transaction log records:
<T,start>
D-ID: data item identifier
<T-ID, D-ID,V
Chapter 11: Indexing and Hashing
Basic Concepts
Ordered Indices
B+-Tree Index Files
B-Tree Index Files
Static Hashing
Dynamic Hashing
Comparison of Ordered Indexing and Hashing
Index Definition in SQL
Multiple-Key Access
233
Nick Roussopoulos
Basic Conce
Chapter 10: Storage and File Structure
Overview of Physical Storage Media
Magnetic Disks
RAID
Tertiary Storage
Storage Access
File Organization
Organization of Records in Files
184
Nick Roussopoulos
DataBytes
Magnitude
Name
280
270
260
250
240
230
220
21
SQL (Structured Query Language)
[Astrahan, Gray, Lindsay, Selinger, ]
IBM Sequel language developed as part of System R project at the IBM
San Jose Research Laboratory
Renamed Structured Query Language (SQL)
ANSI and ISO standard SQL:
SQL-86
SQL-89
SQL-92