Discrete Math 37110 - Class 17 (2016-11-22)
Instructor: Laszlo Babai
Notes taken by Jacob Burroughs
Revised by instructor
17.1
Determinant, trace
DO 17.1. det(AB) = det(A) det(B)
P
Define trace(A) = aii = the sum of diagonal elements
DO 17.2. trace(A + B)
Discrete Math 37110 - Class 1 (2016-09-27)
Instructor: Laszlo Babai
Notes taken by Jacob Burroughs
Proofread by instructor
Administrative Matters
EX 1:
Send email with subject questionnaire answering questions from website
Exercise types:
DO exercises to
CMSC 23700
Autumn 2015
Introduction to Computer Graphics
Homework 3
Due November 10
1. Note: This question is based on material in the reading that we did not cover in class.
The term Z-fighting is used to describe the situation when two primitives are ma
CMSC 23700
Autumn 2015
Introduction to Computer Graphics
Homework 5
Due December 3
For this homework, please read Handout 2.
1. Consider a height-field mesh H with (n + 1) (n + 1) posts that are distance w apart (i.e.,
the size of the height field in worl
CMSC 23700
Autumn 2015
Introduction to Computer Graphics
Homework 2
Due October 22
1. Consider a cylinder with radius 1 and height 2 that is centered at the origin with its axis being
the Z axis.
(a) Give an implicit representation of the cylinder.
(b) Gi
CMSC 23700
Autumn 2015
1. Prove that
Introduction to Computer Graphics
Homework 1
Due October 8
u u = kuk for any vector u.
2. Let B = cfw_b1 , . . . , bn be an orthonormal basis and let B = [bi ] be the matrix whose
columns are the basis vectors.
Prove
CMSC 23700
Autumn 2015
Introduction to Computer Graphics
Homework 4
Due November 19
For this homework, please read Handout 2.
1. Consider the winged-edge representation of meshes described in Handout 2. Lets assume
that the polygons n the mesh are all tri
UV
Fig. 3.5. Choosing a cut edge in Fleurys Algorithm
'he validity of Fleurys Algorithm provides the following characterization of
ian graphs.
3er 3.5 A connected graph is eulerian if and only if it is even.
et now x and y be two distinct vertices
II
34 1 Graphs
For instance, the sum of the indegrees of the vertices of a digraph is equal to
the total number of arcs (Exercise 1.5.2). Applying the Principle of Directional
Duality, we immediately deduce that the sum of the outdegrees is also equal to
Getting Your Files Onto the Internet using SFTP
Table of Contents
1. First Things First
2. SFTP Applications
Fugu - Mac OS X
WinSCP - Windows
FileZilla - Linux
3. Permissions
4. Troubleshooting
First Things First
Welcome to CMSC 101 Spring 2014 - Introduc
Key PHP Concepts sm
Key PHP Concepts: http:/www.w3schools.com/php/default.asp
PHP 5 Introduction
Previous
Next Chapter
PHP scripts are executed on the server.
What You Should Already Know
Before you continue you should have a basic understanding of the
HTML XHTML Entities
4/4/14, 4:29 PM
html, xhtml, and css: 6th edition
news | about | examples | extras | errata | opinions | help | home
extras
resources
colors
(x)html
css
Character Entity References
in HTML 4 and XHTML 1.0
Here is a set of tables contai
Another way to say this:
A variable is created the
moment you first assign
a value to it.
You do not need to assign a value
because one was assigned already
outside of the function.
That is, standard JavaScript syntax.
Versus the + concatenation operator
Turing Machine: A Finite Number of Steps on a Potentially
Infinite Tape to reach a Necessary Result
1
A Simple Turing Machine to Add II & III in Unary
We talk about a turing machine as a tuple: (S, s0, A, T), where:
S is a finite list of possible states t
Markup core: Five Key Concepts
Elements = a markup container in which a portion of a page is placed.
eg. heading element = <h1></h1> gives the heading of the content.
Tags = the demarcations of elements - two enclosing tags or single
empty or void t
AFFORDANCES
An affordance is a property of an
object, or an environment, which
allows an individual to perform an
action. For example, a knob affords
twisting, and perhaps pushing, while a
cord affords pulling. A cup handle
affords lifting and tilting. A
The Document Object Model
The Document Object Model (DOM)
is an application programming interface
(API) for valid HTML and well-formed
XML documents. It defines the logical
structure of documents and the way a
document is accessed and manipulated.
1
The D
HW1 Theory Write-up
1) The internet would still work if the DNS service stopped working. As long as every
website has its own IP address, we could access those websites by remembering those
addresses instead of using their domain names like www.googl
RUBY
block (ruby): It is just some code that has scope that is enclosed by either
cfw_ or a do and end statement. Returns value of last line
class constant (ruby): They are constants, usually starting with a capital
letter, that are defined inside a clas
Mario Aksiyote
Spring 2016
CIS 262
Automata, Computability and Complexity
Jean Gallier
Homework 1
January 13, 2016; Due January 25, 2016, beginning of class
Problem B1 (20 pts).
(1)
We will do induction on |v|.
IH: Assume that for |v| = k and for any arbi
agile methodology New development model that embraces
change. Work with customer constantly. Short iterations guided by
customer feedback. Allows for changes to the plan and design.
Emphasizes TDD to reduce mistakes. Not finished until customer is
satisfi
Types:
Int one interger
Double/Float more precise, decimals
Boolean True/False (x>5)
String word in double quotes
Char letter in one quotation mark
Casting:
Int a = (int)2.8 is equal to 2
You cant cast Strings
Ascii: Every number on a keyboard is a
Machine-Level Programming:
Functions and the call stack
cs154 Introduction to Computer Systems
Lecture 7
Section 3.7
cs154
Announcements
HW2 due tonight 11:59pm
!
HW3 assigned today / tomorrow morning
!
Project 2 out
You will use gdb to step through exec
Machine-Level Programming I: Basics
or
Introduction to Computer Architecture
CMSC 15400: Introduction to Computer Systems
3rd Lecture
Reading: Sections 3.1-3.3
Instructors:
Haryadi Gunawi
Henry Hoffmann
Matthew Wachs
CMSC 15400
1
Announcements
Get started
CS154, Spring 2016
Project 1: Bit Manipulation in C (p1bitmanip)
Due: Thursday April 7, 11:59pm
1
Introduction
The purpose of this assignment is to become more familiar with bit-level representations of integers. Youll
do this by solving a series of progr