Online study resources available anywhere, at any time
High-quality Study Documents, expert Tutors and Flashcards
Everything you need to learn more effectively and succeed
We are not endorsed by this school |
We are sorry, there are no listings for the current search parameters.
School: University Of Texas
CS 341 Automata Theory Elaine Rich Homework 1 Due Tuesday, January 22 This assignment covers the background material in Appendix A. 1) Which of the following wffs are satisfiable? Prove your answers. (Hint: Use truth tables.) a) (A B) A b) (A B) A 2) Prov
School: University Of Texas
Course: ELEMENTS OF COMPUTERS AND PROGRAMMING
CS 303E Fall 2011 Exam 1 Solutions and Criteria Name: EID: Section Number: Friday discussion time (circle one): 9-10 10-11 11-12 12-1 2-3 Friday discussion TA(circle one): Wei Ashley Answer all questions. Please give clear answers. If you give more than
School: University Of Texas
Course: ELEMENTS OF COMPUTERS AND PROGRAMMING
CS 303E Fall 2011 Exam 2 Solutions and Criteria November 2, 2011 Name: EID: Section Number: Friday discussion time (circle one): 9-10 10-11 11-12 12-1 2-3 Friday discussion TA(circle one): Wei Ashley Answer all questions. Please give clear answers. If yo
School: University Of Texas
Course: Computer Organization
Fundamentals of Digital Logic andhficrocomputer Design. M. Rafiquzzaman Copyright 02005 John Wiley & Sons, Inc. 5 SEQUENTIAL LOGIC DESIGN This chapter describes analysis and design of synchronous sequential circuits. Topics include flip-flops, Mealy and M
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Points off 1 2 3 4 5 Total off Net Score CS 314 Midterm 2 Spring 2013 Your Name_ Your UTEID _ Circle yours TAs name: Donghyuk Lixun Padmini Zihao Instructions: 1. There are 5 questions on this test. The test is worth 70 points. Scores will be scaled to 17
School: University Of Texas
CS310 Fall 2010 Boral Test 2 75 Minutes/50 Points Name: UTEID: Section Time: Directions: Work only on these sheets. Use the back, if needed. Show your work for partial credit. Manage your time well. Dont be shy about asking for clarifications. The back of
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Automata Theory Elaine Rich Homework 6 Due: Thursday, February 22, 2007 This assignment covers Sections 5.10-5.13 and a review of regular languages. 1) Consider the problem of counting the number of words in a text file that may contain letters plu
School: University Of Texas
Getting Started with Python 1/14/14, 2:08 PM Getting Started with Python Programming for Windows Users Installation of Python Download the current production version of Python (3.3.2) from the Python Download site. Double click on the icon of the le that
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Automata Theory Elaine Rich Homework 1 Due Thursday, September 7 at 11:00 a. m. 1) Write each of the following explicitly: a) P(cfw_a, b) P(cfw_a, c) b) cfw_a, b cfw_1, 2, 3 c) cfw_x : (x 7 x 7 d) cfw_x : y (y < 10 (y + 2 = x) (where is the set of
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Homework 1 Answers 1) Prove each of the following: a) (A B) C) (A B C). (A B) C) (A B C) (A B) C) (A B C) (A B) C) (A B C) (A B C) (A B C) True Definition of de Morgans Law Associativity of Definition of b) (A B C) (A (B C). (A B C) (A (B C) (A B
School: University Of Texas
Course: CS439
#ifndef _LIB_STDLIB_H #define _LIB_STDLIB_H #include <stddef.h> /* Standard functions. */ int atoi (const char *); void qsort (void *array, size_t cnt, size_t size, int (*compare) (const void *, const void *); void *bsearch (const void *key, const void *a
School: University Of Texas
Course: Mobile Computin
Due:Oct14 Adescriptionofthissprintiswritteninmarkdownandpostedin: /docs/sprint2.md intherepository.IamgoingtofinishmakingsomeeditsandgiveafulllistingoftheAPItomorrow (Wednesday).Staytunedforupdates. Youcanworkingroups!
School: University Of Texas
Why Undergraduates Should Learn the Principles of Programming Languages ACM SIGPLAN Education Board Stephen N. Freund (Williams College), Kim Bruce, Chair (Pomona College), Kathi Fisler (WPI), Dan Grossman (University of Washington), Matthew Hertz (Canisi
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Lecture 17 Disjoint Sets Data Structure A disjoint-sets data structure maintains a collection of S = {S1 , S2 , , Sk }
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Lecture 16 Amortized Analysis 1 Amortized Analysis Given a data structure that supports certain operations, amortized a
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 NP-completeness Lectures 24-26 1 Feasible Computation So far, we have been looking at designing algorithms that are as
School: University Of Texas
Course: Computer Organization And Architecture
FLOATING POINT COMPUTER ARCHITECTURE AND ORGANIZATION University of Texas at Austin Today: Floating Point Background: Fractional binary numbers IEEE floating point standard: Definition Example and properties Rounding, addition, multiplication Floating poi
School: University Of Texas
Course: Computer Organization And Architecture
COURSE OVERVIEW COMPUTER ARCHITECTURE AND ORGANIZATION Instructor: Professor Emmett Witchel University of Texas at Austin Overview Course theme Five realities Logistics 2 University of Texas at Austin Course Theme: Abstraction Is Good But Dont Forget R
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics Third homework is out due next Tuesday (Sept 30) Sets, Russells Paradox, and Halting Problem First homework scores posted on Canvas check your score! Il Dillig s Il Dillig, s CS311H: Discrete Mathematics Sets, Ru
School: University Of Texas
Course: ELEMENTS OF COMPUTERS AND PROGRAMMING
CS 303E Fall 2011 Exam 1 Solutions and Criteria Name: EID: Section Number: Friday discussion time (circle one): 9-10 10-11 11-12 12-1 2-3 Friday discussion TA(circle one): Wei Ashley Answer all questions. Please give clear answers. If you give more than
School: University Of Texas
Course: ELEMENTS OF COMPUTERS AND PROGRAMMING
CS 303E Fall 2011 Exam 2 Solutions and Criteria November 2, 2011 Name: EID: Section Number: Friday discussion time (circle one): 9-10 10-11 11-12 12-1 2-3 Friday discussion TA(circle one): Wei Ashley Answer all questions. Please give clear answers. If yo
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Points off 1 2 3 4 5 Total off Net Score CS 314 Midterm 2 Spring 2013 Your Name_ Your UTEID _ Circle yours TAs name: Donghyuk Lixun Padmini Zihao Instructions: 1. There are 5 questions on this test. The test is worth 70 points. Scores will be scaled to 17
School: University Of Texas
CS310 Fall 2010 Boral Test 2 75 Minutes/50 Points Name: UTEID: Section Time: Directions: Work only on these sheets. Use the back, if needed. Show your work for partial credit. Manage your time well. Dont be shy about asking for clarifications. The back of
School: University Of Texas
Course: ANALYSIS OF PROGRAMS
Name_ Sample Exam 1 CS 336 General Instructions: Do all of your work on these pages. If you need more space, use the backs (to ensure the grader sees it, make a note of it on the front). Make sure your name appears on every page. Please write large a
School: University Of Texas
CS303E (Mitra) Test 1 Fall 2005 Ques 1 ( 10 pt ) a) Convert 113 in decimal to hexadecimal, octal, and binary. b) Convert DEF in hexadecimal to binary, octal, and decimal. Ques 2 ( 10 pt ) Define variables from the following descriptions. The var
School: University Of Texas
Course: Discrete Mathematics
Lecture Notes for CS 311, Part 5 Triangular Numbers and Their Relatives In the denitions below, n is a nonnegative integer. The triangular number Tn is the sum of all integers from 1 to n: n Tn = i = 1 + 2 + + n. i=1 For instance, T4 = 1 + 2 + 3 + 4 = 10.
School: University Of Texas
Course: Discrete Mathematics
CS311: Discrete Math for Computer Science, Spring 2014 Answers to Selected Exercises 1. For each of the following assertions, determine if it is true. If it is then present its proof as an annotated program. It not, give a counterexample. (a) cfw_n > 3 n
School: University Of Texas
Course: Discrete Mathematics
CS311: Discrete Math for Computer Science, Spring 2014 Additional Exercises, with Solutions We use i, j, k, l, m, n as variables for integers (positive, negative, and 0), and x, y, z as variables for real numbers. 1. For each of these formulas determine w
School: University Of Texas
Course: Discrete Mathematics
CS311: Discrete Math for Computer Science, Spring 2014 Homework Assignment 1, with Solutions In the following problems, x is a variable for real numbers. 1. Simplify each of these formulas. (a) x < 5 x 0. Answer: 0 x < 5. (b) x 5 x = 5. Answer: x > 5. (c)
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 311 Fall 2013 Midterm 1 1) Pigeon Hole Principle: Let m be a non-negative integer and n be a positive integer. Prove by contradiction that in any distribution of m pigeons into n holes there exist a hole that has at least m/n pigeo
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 311 Fall 2013 Homework 3 1) Show that the complete bipartite graph K2,6 is planar. Sol: This graph can be drawn on a plane, without any two edges being crossed, as follows: a. Draw vertex 1 at the top of the plane, draw vertex 8 at
School: University Of Texas
Ethereal Lab 2, Part 2: DNS and Content Distribution The goal of this lab is to analyze how a Content Distribution Network (Push caching) interacts with DNS authoritative name servers. You can work individually or with a partner. For the next activit
School: University Of Texas
Course: CS439
#define _GNU_SOURCE 1 #include <errno.h> #include <fcntl.h> #include <signal.h> #include <stdarg.h> #include <stdbool.h> #include <stddef.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #include <stropts.h> #include <sys/ioctl.h> #include <s
School: University Of Texas
Course: CS439
#define _GNU_SOURCE 1 #include <errno.h> #include <fcntl.h> #include <signal.h> #include <stdarg.h> #include <stdbool.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #include <stropts.h> #include <sys/ioctl.h> #include <sys/stat.h> #include
School: University Of Texas
Course: CS439
#! /usr/bin/perl use strict; use warnings; use POSIX; use Getopt:Long qw(:config bundling); use Fcntl 'SEEK_SET'; # Read Pintos.pm from the same directory as this program. BEGIN cfw_ my $self = $0; $self =~ s%/+[^/]*$%; require "$self/Pintos.pm"; our ($d
School: University Of Texas
Course: CS439
# Pintos helper subroutines. # Number of bytes available for the loader at the beginning of the MBR. # Kernel command-line arguments follow the loader. our $LOADER_SIZE = 314; # Partition types. my (%role2type) = (KERNEL => 0x20, FILESYS => 0x21, SCRA
School: University Of Texas
Course: CS439
# -*- makefile -*- include $(patsubst %,$(SRCDIR)/%/Make.tests,$(TEST_SUBDIRS) PROGS = $(foreach subdir,$(TEST_SUBDIRS),$($(subdir)_PROGS) TESTS = $(foreach subdir,$(TEST_SUBDIRS),$($(subdir)_TESTS) EXTRA_GRADES = $(foreach subdir,$(TEST_SUBDIRS),$($(subd
School: University Of Texas
Course: ELEMENTS OF COMPUTERS AND PROGRAMMING
CS313E: Fall, 2012 Elements of Software Design Instructor: Dr. Bill Young Unique number: 52765 Class time: MWF 9-10am; Location: RLM 5.104 Office: MAIN 2012 Office Hours: MW 10-noon and by appointment Office Phone: 471-9782; Email: byoung@cs.utexas.edu TA
School: University Of Texas
Course: ELEMENTS OF COMPUTERS AND PROGRAMMING
Syllabus - Computer Science 303E - Elements of Computers and Programming The University of Texas at Austin Spring 2012 Course Overview: Welcome! CS303E is an introduction to computer science and programming for students who have no programming experience.
School: University Of Texas
Computer Science 302: Computer Fluency - Syllabus for Spring 2015 Teaching Staff Who Location Office Hours Email Nathan Clement, Instructor GDC 1.302 Monday, 5-6pm; Thursday 10-noon Other times by appointment nathanlclement@g GDC 1.302 M W 1-2 pm By appoi
School: University Of Texas
Course: Mobile Computin
ElementsofMobileComputing CS329E EssentialInformation Instructor:RobertF.Dickerson Contact:rfd@cs.utexas.edu,yichao0319@gmail.com LectureClassroom:ART1.110 LectureTime:5:006:30PM,TuesdaysandThursdays Prof.DickersonOfficehours(GDB5.318): MondaysandWednesda
School: University Of Texas
Course: Introduction To Computing
Department of Computer Science University of Texas at Austin CS 312 - Introduction to Computing (Fall 2011) Lecture I, MW 10:00 AM - 11:00 AM, SAC 1.402; F 10:00 AM - 11:00 AM, WEL 1.308 Lecture II, MWF 1:00 PM - 2:00 PM, JES A 121A Discussion Section (sa
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
' 3 u ! ' % t % s % ! 3 1 v " ) " $ $ # 4 4 4 1 % q 3 & & % ! q 3 & ! % s % ! 1 $ # " $ $ ) % r ' q % ' ! % % ! % & ! % s % ! 1 $ ( 5 h ) g b V j & ' 3 q ' r ! 3 & ! % r q % ! 3 1 " ) 5 ( R a V C B p 8 i 8 Q @ P @ P e b V % ! ' 2 % & 1 3 3 $ # " ( ( " 5
School: University Of Texas
CS 341 Automata Theory Elaine Rich Homework 1 Due Tuesday, January 22 This assignment covers the background material in Appendix A. 1) Which of the following wffs are satisfiable? Prove your answers. (Hint: Use truth tables.) a) (A B) A b) (A B) A 2) Prov
School: University Of Texas
Course: ELEMENTS OF COMPUTERS AND PROGRAMMING
CS 303E Fall 2011 Exam 1 Solutions and Criteria Name: EID: Section Number: Friday discussion time (circle one): 9-10 10-11 11-12 12-1 2-3 Friday discussion TA(circle one): Wei Ashley Answer all questions. Please give clear answers. If you give more than
School: University Of Texas
Course: ELEMENTS OF COMPUTERS AND PROGRAMMING
CS 303E Fall 2011 Exam 2 Solutions and Criteria November 2, 2011 Name: EID: Section Number: Friday discussion time (circle one): 9-10 10-11 11-12 12-1 2-3 Friday discussion TA(circle one): Wei Ashley Answer all questions. Please give clear answers. If yo
School: University Of Texas
Course: Computer Organization
Fundamentals of Digital Logic andhficrocomputer Design. M. Rafiquzzaman Copyright 02005 John Wiley & Sons, Inc. 5 SEQUENTIAL LOGIC DESIGN This chapter describes analysis and design of synchronous sequential circuits. Topics include flip-flops, Mealy and M
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Points off 1 2 3 4 5 Total off Net Score CS 314 Midterm 2 Spring 2013 Your Name_ Your UTEID _ Circle yours TAs name: Donghyuk Lixun Padmini Zihao Instructions: 1. There are 5 questions on this test. The test is worth 70 points. Scores will be scaled to 17
School: University Of Texas
CS310 Fall 2010 Boral Test 2 75 Minutes/50 Points Name: UTEID: Section Time: Directions: Work only on these sheets. Use the back, if needed. Show your work for partial credit. Manage your time well. Dont be shy about asking for clarifications. The back of
School: University Of Texas
Course: ELEMENTS OF COMPUTERS AND PROGRAMMING
CS313E: Fall, 2012 Elements of Software Design Instructor: Dr. Bill Young Unique number: 52765 Class time: MWF 9-10am; Location: RLM 5.104 Office: MAIN 2012 Office Hours: MW 10-noon and by appointment Office Phone: 471-9782; Email: byoung@cs.utexas.edu TA
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Automata Theory Elaine Rich Homework 6 Due: Thursday, February 22, 2007 This assignment covers Sections 5.10-5.13 and a review of regular languages. 1) Consider the problem of counting the number of words in a text file that may contain letters plu
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Automata Theory Elaine Rich Homework 8 Due: Thursday, March 8, 2007 This assignment covers Sections 11.7 - 11.8. 1) Let G be the ambiguous expression grammar of Example 11.14. Show at least three different parse trees that can be generated from G f
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Automata Theory Elaine Rich Homework 14 Due Friday, Dec.8 at 11:59 pm 1) Construct unrestricted grammars that generate each of the following languages L: a) cfw_wwRw : w cfw_a, b*. b) cfw_anbmcn+m : n, m > 0. c) cfw_anbmcnm : n, m > 0. 2) Construct
School: University Of Texas
Getting Started with Python 1/14/14, 2:08 PM Getting Started with Python Programming for Windows Users Installation of Python Download the current production version of Python (3.3.2) from the Python Download site. Double click on the icon of the le that
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Automata Theory Elaine Rich Homework 1 Due Thursday, September 7 at 11:00 a. m. 1) Write each of the following explicitly: a) P(cfw_a, b) P(cfw_a, c) b) cfw_a, b cfw_1, 2, 3 c) cfw_x : (x 7 x 7 d) cfw_x : y (y < 10 (y + 2 = x) (where is the set of
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Automata Theory Elaine Rich Homework 15 Due Friday, Dec. 8 at 11:55 pm 1) Let M be an arbitrary Turing machine. a) Suppose that timereq(M) = 3n3(n+5)(n-4). Circle all of the following statements that are true: i) timereq(M) O(n). ii) iii) timereq(M
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Homework 2 Answers Chapter 2 1) Consider the language L = cfw_1n2n : n > 0. Is the string 122 in L? No. Every string in L must have the same number of 1s as 2s. 2) Let L1 = cfw_anbn : n > 0. Let L2 = cfw_cn : n > 0. For each of the following string
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Homework 1 Answers 1) Prove each of the following: a) (A B) C) (A B C). (A B) C) (A B C) (A B) C) (A B C) (A B) C) (A B C) (A B C) (A B C) True Definition of de Morgans Law Associativity of Definition of b) (A B C) (A (B C). (A B C) (A (B C) (A B
School: University Of Texas
Course: ANALYSIS OF PROGRAMS
Name_ Sample Exam 1 CS 336 General Instructions: Do all of your work on these pages. If you need more space, use the backs (to ensure the grader sees it, make a note of it on the front). Make sure your name appears on every page. Please write large a
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Homework 3 Answers Chapter 5 2) Show a DFSM to accept each of the following languages: b) cfw_w cfw_a, b* : w does not end in ba. a 2 a 1 b 4 b c) cfw_w cfw_0, 1* : w corresponds to the binary encoding, without leading 0s, of natural numbers that a
School: University Of Texas
Course: ELEMENTS OF COMPUTERS AND PROGRAMMING
Syllabus - Computer Science 303E - Elements of Computers and Programming The University of Texas at Austin Spring 2012 Course Overview: Welcome! CS303E is an introduction to computer science and programming for students who have no programming experience.
School: University Of Texas
CS303E (Mitra) Test 1 Fall 2005 Ques 1 ( 10 pt ) a) Convert 113 in decimal to hexadecimal, octal, and binary. b) Convert DEF in hexadecimal to binary, octal, and decimal. Ques 2 ( 10 pt ) Define variables from the following descriptions. The var
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Automata Theory Elaine Rich Homework 7 Due: Thursday, March 1, 2007 This assignment covers Sections 11.1 - 11.6. 1) Let = cfw_a, b. For the languages that are defined by each of the following grammars, do each of the following: i. List five strings
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Automata Theory Elaine Rich Homework 4 Due: Thursday, February 8, 2007 1) Consider the following FSM M: a a 1 a) b b 2 a 3 b 4 a,b Show a regular expression for L(M). (a bb*aa)* ( bb*(a ). b) Describe L(M) in English. All strings in cfw_a, b* that
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Automata Theory Elaine Rich Homework 2 Due Thursday, September 14 at 11:00 1) 2) 3) 4) 5) 6) 7) 8) For each of the following languages L, give a simple English description of L. Show two strings that are in L and two that are not (unless there are
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Automata Theory Elaine Rich Homework 10 Due Thursday, Nov. 9 at 11:00 1) Determine, for each of the following languages, whether it is (I) Regular, (II) Context free but not regular, or (III) not context free. Prove your answer. a) L = cfw_wwRw : w
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Lecture 17 Disjoint Sets Data Structure A disjoint-sets data structure maintains a collection of S = {S1 , S2 , , Sk }
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Lecture 16 Amortized Analysis 1 Amortized Analysis Given a data structure that supports certain operations, amortized a
School: University Of Texas
Course: Logic, Sets, And Functions
Axiom of Extensionality Let A and B denote any sets. If A and B denote the same set, we write A = B, and A = B iff for every x, (x A iff x B) Axiom of Separation Let D be a set and let (x) be a predicate in the one variable x. Assume that this predic
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 NP-completeness Lectures 24-26 1 Feasible Computation So far, we have been looking at designing algorithms that are as
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Depth-first Search 1 Depth-first Search Let G = (V, E) be a directed or undirected graph. Given a vertex a V , depth-f
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Depth-first Search Lectures 23-24 1 Depth-first Search Let G = (V, E) be a directed or undirected graph. Given a vertex
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Breadth-first search Lecture 22 1 Breadth-first search and unweighted shortest paths We consider here the single-source
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Binary Search Trees Lectures 18-19 1 Dictionaries A dictionary is a data structure that supports the operations of Sear
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Hashing Lecture 20 1 Hashing Hashing is a widely-used class of data structures that support the operations of insert, d
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Comparison & Integer Sorting Lecture 21 Lower bound on comparison-based sorting There are several algorithms that sort n
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Lecture 15 Priority Queue; Heapsort 1 Data Structures Sets manipulated by algorithms often grow, shrink or change over
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Lectures 11-14 Greedy, MST 1 The Greedy Framework Rcall that an optimization problem is one for which an input has a co
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Lecture 11 Greedy, MST 1 The Greedy Framework Rcall that an optimization problem is one for which an input has a collec
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Lectures 9 & 10 Graphs; shortest paths 1 Graph-theoretic Definitions An undirected graph G = (V, E) consists of a finit
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Lecture 8 Dynamic Programming 1 Dynamic Programming In this lecture we will study an algorithmic technique called `dyna
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Lecture 5 Randomized algorithms; random permutation Randomized algorithms Definition: A randomized algorithm is an algori
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Lecture 2 Growth of functions; asymptotic analysis; summations Growth of Functions A function f (n) is asymptotically non
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Lecture 6 Randomized Quicksort Randomized Partition and Randomized Quicksort Randomized-Partition is a simple modificatio
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Lecture 3 Department of Computer Sciences Professor Vijaya Ramachandran Divide & conquer; recurrence relations; master theorem CS357: ALGORITHMS, Spring 2006 Analyzing divide-and-conquer algorithms A divide-and-conq
School: University Of Texas
Course: Algorithms
CS357: ALGORITHMS The University of Texas at Austin Department of Computer Sciences January 18, 2006 COURSE DESCRIPTION Time/Location/Unique number. MW 11:00-12:30, WEL 2.256, #54045 Professor. Vijaya Ramachandran (vlr"at"cs, TAY 3.152, 471-9554). O
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Lecture 7 Randomized Select Randomized Selection The selection problem (Chapter 9) is the following. Input. An array A[1.
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Lecture 4 Quicksort; basic probability Quicksort Quicksort(A, p, r) Input. An array A[1.n] of elements from a totally ord
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Lecture 1 Merge-sort; algorithm analysis; divide & conquer Algorithms An algorithm is a computational procedure that take
School: University Of Texas
Course: ANALYSIS OF PROGRAMS
Chapter 1 Counting In order to count, there are a few basic strategies that you may want to employ. We will continuously try to point out what you might want to think as you solve these problems. 1.1 Basic Strategies The most important strategy
School: University Of Texas
Course: ANALYSIS OF PROGRAMS
The Science of Programming, Revisited Lecture 7 February 5, 2008 Maggie Myers and Robert van de Geijn 3 Goal-Oriented Programming So far, we have discussed how to prove program segments correct. What we show next is that the proof of correctness c
School: University Of Texas
Course: ANALYSIS OF PROGRAMS
Notes on Proving Correctness Lecture 5 January 30, 2008 Maggie Myers and Robert van de Geijn 2 The DO Command do [] . . . B1 S1 B2 S2 . . . . . . . . . In the programming languages used in our class, the DO command has the following syntax: [] Bn
School: University Of Texas
Course: ANALYSIS OF PROGRAMS
Notes on Proving Correctness Lecture 4 January 24, 2008 Maggie Myers and Robert van de Geijn January 28, 2008 1 The IF Command We discuss how to establish the correctness of the IF command. 1.1 Syntax In the programming languages used in our cl
School: University Of Texas
Course: ANALYSIS OF PROGRAMS
CS336 HW2F08 Due January 31 1. Find the weakest precondition for the following: a. wp("j,s:=0,0", s=(k| 0k<j:b[k]) b. wp("j,s:=j+1, s+b[j]", s=(k| 0k<j:b[k]) 2. Formalize the following English specifications a. Set z to |x|. b. Determine if an intege
School: University Of Texas
Course: ANALYSIS OF PROGRAMS
Homework 3 Solutions CS 336 Spring 2008 1. The following program computes the quotient q and remainder r of the division of x by y. {0 x 0 < y} q, r := 0, x; do r y r, q := r - y, q + 1 od {0 r < y q y + r = x} What would you have to prove to
School: University Of Texas
Course: ANALYSIS OF PROGRAMS
HW5F07 CS336 1. Define recursively functions height, number of nodes, number of leaves and number of internal (interior) nodes for extended binary trees. Solution: For the height function h : T N , we have h.0 h(d, , ) = 0 h.1 h(d, l, r) = 1 + max(h
School: University Of Texas
Course: ANALYSIS OF PROGRAMS
CS336 S08 HW Suggested solutions 1. Suppose f1=O(g1) and f2=O(g2). Prove f1 + f2 = O(max (|g1| , |g2|)
School: University Of Texas
Course: ANALYSIS OF PROGRAMS
HW1S07 CS 336 1. Determine the truth value of the following statements a. (x| x: (y| y: x2<y)=T b. (y| y: (x| x: x2<y)= F c. What you notice from parts a. and b.? The answers are different. What are the implications? Order is important for nested qua
School: University Of Texas
Course: Computer Organization
Chapter 2 2.1: Bits and Data Types o 2.1.1: The Bit as the Unit of Information We represent the presence of voltage as "1", and the absence as "0". Each 0 and 1 is a bit, which is a shortened form of binary digit. The electronic circuits in the co
School: University Of Texas
Course: Computer Organization
Chapter 4 4.1: Basic Components To get a task done by a computer, we need two things o A computer program that specifies what the computer must do to complete the task o The computer itself to execute the task A program consists of a set of instructi
School: University Of Texas
Course: Computer Organization
Chapter 5: The LC-3 The ISA: Overview o The ISA specifies all the info about the computer that the software has to be aware of. o 5.1.1: Memory Organization The LC-3 memory has an address space of 2^16 locations, and an addressability of 16 bits. No
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Automata Theory Elaine Rich Homework 6 Due: Thursday, February 22, 2007 This assignment covers Sections 5.10-5.13 and a review of regular languages. 1) Consider the problem of counting the number of words in a text file that may contain letters plu
School: University Of Texas
Getting Started with Python 1/14/14, 2:08 PM Getting Started with Python Programming for Windows Users Installation of Python Download the current production version of Python (3.3.2) from the Python Download site. Double click on the icon of the le that
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Automata Theory Elaine Rich Homework 1 Due Thursday, September 7 at 11:00 a. m. 1) Write each of the following explicitly: a) P(cfw_a, b) P(cfw_a, c) b) cfw_a, b cfw_1, 2, 3 c) cfw_x : (x 7 x 7 d) cfw_x : y (y < 10 (y + 2 = x) (where is the set of
School: University Of Texas
Course: AUTOMATA THEORY
CS 341 Homework 1 Answers 1) Prove each of the following: a) (A B) C) (A B C). (A B) C) (A B C) (A B) C) (A B C) (A B) C) (A B C) (A B C) (A B C) True Definition of de Morgans Law Associativity of Definition of b) (A B C) (A (B C). (A B C) (A (B C) (A B
School: University Of Texas
Course: CS439
#ifndef _LIB_STDLIB_H #define _LIB_STDLIB_H #include <stddef.h> /* Standard functions. */ int atoi (const char *); void qsort (void *array, size_t cnt, size_t size, int (*compare) (const void *, const void *); void *bsearch (const void *key, const void *a
School: University Of Texas
Course: Mobile Computin
Due:Oct14 Adescriptionofthissprintiswritteninmarkdownandpostedin: /docs/sprint2.md intherepository.IamgoingtofinishmakingsomeeditsandgiveafulllistingoftheAPItomorrow (Wednesday).Staytunedforupdates. Youcanworkingroups!
School: University Of Texas
Course: Mobile Computin
Introduction Inourdiscussionofdatabases,italmostseemslikeacrimenottoatleastmentionORMs,objectrelational models.ObjectrelationalmodelsallowustoabstractawaythecomplexitiesofworkingwithSQLtables,and insteadinterfacewiththerecordsinthetabledirectlyasobjects(P
School: University Of Texas
Course: Mobile Computin
Amajorcomponentofthiscourseisthefinalteamproject.Beforewebreakintoteams,everyonewillsubmita gradedprojectproposal.Therewillberoughly60proposals.Wewillselectthetopproposals(N/3),soroughly 20projectswillbeselected.Thewriteroftheproposalwillbecomethe'project
School: University Of Texas
Course: Mobile Computin
ASuccessfulBranchingModel: http:/nvie.com/posts/asuccessfulgitbranchingmodel/(Linkstoanexternalsite.) HerearealistofgitcommandsIusedinclasstodayinnoparticularorder: gitcheckoutbdevelop Createanewbranchcalleddevelop gitcheckoutmaster gitmergenoffdevelop Sw
School: University Of Texas
Course: Mobile Computin
importrequestsimportjsonhostname="http:/localhost:5000"#user= 'rfdickerson'#password='awesome'game_id=0rest_prefix="/v1"' Importantfunctionscreateagameleaveagameupdategamestatewithlocation castavote'defcreate_user(username,password,firstname,lastname): pa
School: University Of Texas
Course: Mobile Computin
DatabaseNotes DatabaseParadigms: 1)Relational(SQL) 2)Documentbased(NOSQL) 3)Keyvalue BasicDatatypes: 1)NULL 2)REAL 3)INTEGER 4)TEXT 5)BLOB Setupsqlitetoprintthingsbetter: .modecolumn .headerson Createtables CREATETABLEpatient_info( reading_idINTEGERPRIMAR
School: University Of Texas
Course: Mobile Computin
Sprint1DataLayer Due:Thursday,Sept.18,11:59pm WorkingingroupsisOK! IhavepostedastartforyourdatalayerforthegameonBitbucket.Theresponsibilityofthedataaccessobjectis topresentalayerofabstractionontopofthedatabasesothattheuserofthedatadoesnothavetoworryabout
School: University Of Texas
Course: Mobile Computin
Sprint 2 - Service layer Due Oct 14. 5:00 PM You can work in groups (must report to me your group members) Description# In this sprint, you will create a web service API so that our distributed clients can join and play in games. You can include your own
School: University Of Texas
Course: Mobile Computin
schemafortheWherewolfgameCREATEEXTENSIONcube;CREATEEXTENSION earthdistance;DROPTABLEIFEXISTSplayercascade;CREATETABLEplayer( player_id serialprimarykey, is_dead INTEGERNOT NULL, lat DECIMAL(11,8) NOTNULL, lng DECIMAL(11,8) NOTNULL, is_werewolf INTEGERNOTN
School: University Of Texas
Course: Mobile Computin
fromflaskimportFlask,requestimportpsycopg2app=Flask(_name_)def get_db(databasename='tasklist',username='postgres', password='furry'):returnpsycopg2.connect(database=databasename, user=username,password=password)@app.route("/")defhello():return "HelloWorld
School: University Of Texas
Course: Mobile Computin
WerewolfGameBasicRules 1. ThegamestatescyclebetweenDayandNight 2. Thegameendswhennumberofwerewolvesexceedstownspeople,orwhenallwerewolvesare imprisoned. 3. Everyonecanvotetoconvictandjailonesuspectedwerewolfatnightfall 4. Inthemorning,everyoneisnotifiedof
School: University Of Texas
Course: Mobile Computin
Amajorcomponentofthiscourseisthefinalteamproject.Beforewebreakintoteams,everyonewillsubmita gradedprojectproposal.Therewillberoughly60proposals.Wewillselectthetopproposals(N/3),soroughly 20projectswillbeselected.Thewriteroftheproposalwillbecomethe'project
School: University Of Texas
Course: Mobile Computin
#WherewolfgameDAO#AbstractionfortheSQLdatabaseaccess.importpsycopg2 importmd5classUserAlreadyExistsException(Exception):def _init_(self,err):self.err=errdef_str_(self): return'Exception:'+self.errclass NoUserExistsException(Exception):def_init_(self,err):
School: University Of Texas
Course: Intro To Java
import java.io.*; import java.util.Scanner; /* File: DNA.java Description: This program prints the longest common subsequence in the txt file Student Name: Julio Maldonado Student UT EID: jam7686 Course Name: CS 312 Unique Number: 90125 Date Creat
School: University Of Texas
Course: Foundations Of Logical Thought
Propositional Logic Denition: A proposition or statement is a sentence which is either true or false. Denition:If a proposition is true, then we say its truth value is true, and if a proposition is false, we say its truth value is false. Are these proposi
School: University Of Texas
Course: Mobile Computin
FAQ IwishtherewasatextbookinthisclassthatIcouldfollowalongto Idon'tthinkthatmobile/webapplicationshasadefinitivecollegetextbookyet.Ilooked.Ithinkitmightbe becausethelandscapeandtechnologiesarechangingtooquickly.Also,thechoiceoftechnologiesarequite broad.I
School: University Of Texas
Course: Mobile Computin
Produceatleasta2minutevideoshowingoffthefunctionalityofyourapp. https:/www.youtube.com/watch?v=xClmhYXkV08(Linkstoanexternalsite.) MinimizeVideo https:/www.youtube.com/watch?v=qhUcWN5b7Kg(Linkstoanexternalsite.)
School: University Of Texas
Course: CS439
/* tar.c Creates a tar archive. */ #include <ustar.h> #include <syscall.h> #include <stdio.h> #include <string.h> static void usage (void); static bool make_tar_archive (const char *archive_name, char *files[], size_t file_cnt); int main (int argc, char
School: University Of Texas
Course: CS439
#ifndef _LIB_USTAR_H #define _LIB_USTAR_H /* Support for the standard Posix "ustar" format. See the documentation of the "pax" utility in [SUSv3] for the the "ustar" format specification. */ #include <stdbool.h> /* Type of a file entry in an archive. The
School: University Of Texas
Course: CS439
#ifndef _LIB_STRING_H #define _LIB_STRING_H #include <stddef.h> /* Standard. */ void *memcpy (void *, const void *, size_t); void *memmove (void *, const void *, size_t); char *strncat (char *, const char *, size_t); int memcmp (const void *, const void *
School: University Of Texas
Course: CS439
#ifndef _LIB_USER_STDIO_H #define _LIB_USER_STDIO_H int hprintf (int, const char *, .) PRINTF_FORMAT (2, 3); int vhprintf (int, const char *, va_list) PRINTF_FORMAT (2, 0); #endif /* lib/user/stdio.h */
School: University Of Texas
Course: CS439
OUTPUT_FORMAT("elf32-i386") OUTPUT_ARCH(i386) ENTRY(_start) SECTIONS cfw_ /* Read-only sections, merged into text segment: */ _executable_start = 0x08048000 + SIZEOF_HEADERS; . = 0x08048000 + SIZEOF_HEADERS; .text : cfw_ *(.text) = 0x90 .rodata : cfw_ *(
School: University Of Texas
Course: CS439
#ifndef _LIB_USER_SYSCALL_H #define _LIB_USER_SYSCALL_H #include <stdbool.h> #include <debug.h> /* Process identifier. */ typedef int pid_t; #define PID_ERROR (pid_t) -1) /* Map region identifier. */ typedef int mapid_t; #define MAP_FAILED (mapid_t) -1) /
School: University Of Texas
Course: CS439
#ifndef _LIB_KERNEL_CONSOLE_H #define _LIB_KERNEL_CONSOLE_H void console_init (void); void console_panic (void); void console_print_stats (void); #endif /* lib/kernel/console.h */
School: University Of Texas
Course: CS439
#ifndef _LIB_KERNEL_BITMAP_H #define _LIB_KERNEL_BITMAP_H #include <stdbool.h> #include <stddef.h> #include <inttypes.h> /* Bitmap abstract data type. */ /* Creation and destruction. */ struct bitmap *bitmap_create (size_t bit_cnt); struct bitmap *bitmap_
School: University Of Texas
Course: CS439
#ifndef _LIB_KERNEL_STDIO_H #define _LIB_KERNEL_STDIO_H void putbuf (const char *, size_t); #endif /* lib/kernel/stdio.h */
School: University Of Texas
Course: CS439
#ifndef _LIB_KERNEL_LIST_H #define _LIB_KERNEL_LIST_H /* Doubly linked list. This implementation of a doubly linked list does not require use of dynamically allocated memory. Instead, each structure that is a potential list element must embed a struct lis
School: University Of Texas
Course: CS439
#ifndef _LIB_KERNEL_HASH_H #define _LIB_KERNEL_HASH_H /* Hash table. This data structure is thoroughly documented in the Tour of Pintos for Project 3. This is a standard hash table with chaining. To locate an element in the table, we compute a hash functi
School: University Of Texas
Course: CS439
/* crctab[] and cksum() are from the `cksum' entry in SUSv3. */ #include <stdint.h> #include "tests/cksum.h" static unsigned long crctab[] = cfw_ 0x00000000, 0x04c11db7, 0x09823b6e, 0x0d4326d9, 0x130476dc, 0x17c56b6b, 0x1a864db2, 0x1e475005, 0x2608edb8
School: University Of Texas
Course: CS439
# From the `cksum' entry in SUSv3. use strict; use warnings; my (@crctab) = (0x00000000, 0x04c11db7, 0x09823b6e, 0x0d4326d9, 0x130476dc, 0x17c56b6b, 0x1a864db2, 0x1e475005, 0x2608edb8, 0x22c9f00f, 0x2f8ad6d6, 0x2b4bcb61, 0x350c9b64, 0x31cd86d3, 0x3c8e
School: University Of Texas
Course: CS439
#include "tests/lib.h" #include <random.h> #include <stdarg.h> #include <stdio.h> #include <string.h> #include <syscall.h> const char *test_name; bool quiet = false; static void vmsg (const char *format, va_list args, const char *suffix) cfw_ /* We go t
School: University Of Texas
Course: CS439
/* Test program for sorting and searching in lib/stdlib.c. Attempts to test the sorting and searching functionality that is not sufficiently tested elsewhere in Pintos. This is not a test we will run on your submitted projects. It is here for complete
School: University Of Texas
Course: CS439
#! /usr/bin/perl -w use strict; # Check command line. if (grep ($_ eq '-h' | $_ eq '-help', @ARGV) cfw_ print <'EOF'; backtrace, for converting raw addresses into symbolic backtraces usage: backtrace [BINARY]. ADDRESS. where BINARY is the binary file or
School: University Of Texas
Course: CS439
#! /usr/bin/perl -w use strict; use POSIX; use Fcntl; use File:Temp 'tempfile'; use Getopt:Long qw(:config bundling); use Fcntl qw(SEEK_SET SEEK_CUR); # Read Pintos.pm from the same directory as this program. BEGIN cfw_ my $self = $0; $self =~ s%/+[^/]*$%
School: University Of Texas
Course: Intro To Java
Review Questions for Exam 1 This review sheet is intended to give you some practice questions to use in preparing for our first midterm. It is not necessarily complete. The first exam covers the reading assignments, programming projects and class/discussi
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Points off 1 2 3 4 5 Total off Net Score CS 314 Midterm 1 Spring 2013 Your Name_ Your UTEID _ CircleyoursTAsname: Donghyuk Lixun Padmini Zihao Instructions: 1. There are 5 questions on this test. The test is worth 70 points. Scores will be scaled to 175
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Encapsulation One of the features of object oriented languages Hide the data of an object (variable) Group operations and data together into a new data type Usually easier to use something than understand exactly how it works microwave, car, computer, sof
School: University Of Texas
Course: Computer Organization And Architecture
CS 429 Chapter 3 Notes Machine-Level Representation When programming in a high-level language such as C, and even more so in Java, we are shielded from the detailed, machine-level implementation of our program. When writing programs in assembly code (as w
School: University Of Texas
Course: Discrete Mathematics
G53KRR: unication, resolution with equality A unier of two literals 1 and 2 is a substitution such that 1 = 2 . There are many possible uniers, and some of them are too specic. For example, P (x, y) and P (a, z) can be unied by 1 = x/a, y/z and by 2 = x/a
School: University Of Texas
Course: Discrete Mathematics
G53KRR: Forward chaining, production systems Forward chaining (for propositional Horn clauses): input: a nite list of atomic sentences, q1 , . . . , qn output: YES if KB entails all of qi , NO otherwise 1. if all goals qi are marked as solved, return YES
School: University Of Texas
ComputerFluencyCheatSheet Variables:variablesarea(name,value)pair.WhenIsaySetnumto3,thecomputer willnotethatnumhasvalue3,andeverytimeyousaynumitwilllookupthecurrent valueassociatedtothatname.Youusevariablestoremembervaluesthatyoumightneed later.Hereishowv
School: University Of Texas
OnHomework3,exercises2and3requirethatyouwriteanalgorithmthatusesablackbox module.Pleasedonotgetboggeddownanddistractedtryingtocreateprettypicturesof themodulesitcanbefrustrating!Itwouldbeperfectlyfinetouseadifferentnotation formodulesinyourhomeworksubmiss
School: University Of Texas
1. Set _ to _ 2. Increment _ by _ 3. Foe each element _ 3. While _ 5. Print/Output 6. Use module iterate - repeat initialize increment - add to For vs. While while requires i < 100 For each name in the list Print UTSi OSi Set i to 1 While i < 100 Print U
School: University Of Texas
Course: Intro To Java
Review Questions for Exam 1 This review sheet is intended to give you some practice questions to use in preparing for our first midterm. It is not necessarily complete. The first exam covers the reading assignments, programming projects and class/discussi
School: University Of Texas
Course: Intro To Java
12/9/12 Final Exam Rev iew Review for Final Exam 1. Answer all the questions on the review sheets for the midterms, and answer all questions on the sample midterms. 2. We have discussed in detail three methods which all classes inherit from the Object cla
School: University Of Texas
Course: Intro To Java
12/8/12 Midterm 1 Rev iew Sheet Review Questions for Exam 1 Solutions This review sheet is intended to give you some practice questions to use in preparing for our first midterm. It is not necessarily complete. The first exam covers the reading assignment
School: University Of Texas
Course: Intro To Java
12/8/12 CS 312 - Midterm 2 Rev iew CS 312 - Midterm 2 Review Sheet Here are some review questions. There will definitely be questions on the exam that are not similar to the ones below. Re-work examples and exercises from class and discussion to test your
School: University Of Texas
Course: Intro To Java
12/8/12 CS 312 - Midterm 2 Review Sheet This exam covers all topics that we have discussed in class through Monday, November 12. The online class notes, up to but not including the command line arguments notes, will be covered. On the exam, you will not b
School: University Of Texas
Course: Discrete Math For Computer Science
Lecture Notes: Discrete Mathematics for Computer Science Vladimir Lifschitz University of Texas at Austin Part 3. Triangular Numbers and Their Relatives Denitions In the denitions below, n is a nonnegative integer. The triangular number Tn is the sum of a
School: University Of Texas
Course: Discrete Math For Computer Science
Lecture Notes: Discrete Mathematics for Computer Science Vladimir Lifschitz University of Texas at Austin Part 4. Induction and Recursion Proofs by Induction Induction is a useful proof method in mathematics and computer science. When we want to prove by
School: University Of Texas
Course: Discrete Math For Computer Science
Lecture Notes: Discrete Mathematics for Computer Science Vladimir Lifschitz University of Texas at Austin Part 2. Denitions and Proofs by Cases Dening a Function by Cases Functions in algebra are usually dened by formulas, for instance: f (x) = x2 + x + 1
School: University Of Texas
Course: Discrete Math For Computer Science
Lecture Notes: Discrete Mathematics for Computer Science Vladimir Lifschitz University of Texas at Austin Part 1. Logical Notation Propositional Connectives and Quantiers Logical notation uses symbols of two kinds: propositional connectives, such as (and
School: University Of Texas
Course: Discrete Math For Computer Science
Lecture Notes: Discrete Mathematics for Computer Science Vladimir Lifschitz University of Texas at Austin Part 5. Fibonacci Numbers and Their Relatives Denition of Fibonacci Numbers The sequence of Fibonacci numbers F0 , F1 , F2 , . . . is dened by the eq
School: University Of Texas
Course: Computer Organization And Architecture
CS 429 Chapter 4 Notes Introduction The instruction-set architecture (ISA) is the instructions supported by a particular processor and its byte-level encodings. o ISA provides a conceptual layer of abstraction between compiler writers, and processor desi
School: University Of Texas
Course: Computer Organization And Architecture
CS 429 Chapter 2 Notes Representing and Manipulating Information The three most important representations of numbers are: 1. Unsigned based on traditional binary notation, representing numbers greater than or equal to 0. 2. Twos-Compliment the most common
School: University Of Texas
Why Undergraduates Should Learn the Principles of Programming Languages ACM SIGPLAN Education Board Stephen N. Freund (Williams College), Kim Bruce, Chair (Pomona College), Kathi Fisler (WPI), Dan Grossman (University of Washington), Matthew Hertz (Canisi
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Lecture 17 Disjoint Sets Data Structure A disjoint-sets data structure maintains a collection of S = {S1 , S2 , , Sk }
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 Lecture 16 Amortized Analysis 1 Amortized Analysis Given a data structure that supports certain operations, amortized a
School: University Of Texas
Course: Algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006 NP-completeness Lectures 24-26 1 Feasible Computation So far, we have been looking at designing algorithms that are as
School: University Of Texas
Course: Computer Organization And Architecture
FLOATING POINT COMPUTER ARCHITECTURE AND ORGANIZATION University of Texas at Austin Today: Floating Point Background: Fractional binary numbers IEEE floating point standard: Definition Example and properties Rounding, addition, multiplication Floating poi
School: University Of Texas
Course: Computer Organization And Architecture
COURSE OVERVIEW COMPUTER ARCHITECTURE AND ORGANIZATION Instructor: Professor Emmett Witchel University of Texas at Austin Overview Course theme Five realities Logistics 2 University of Texas at Austin Course Theme: Abstraction Is Good But Dont Forget R
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics Third homework is out due next Tuesday (Sept 30) Sets, Russells Paradox, and Halting Problem First homework scores posted on Canvas check your score! Il Dillig s Il Dillig, s CS311H: Discrete Mathematics Sets, Ru
School: University Of Texas
Course: Discrete Mathematics
Divide-and-Conquer Algorithms CS311H: Discrete Mathematics Divide-and-Conquer Algorithms and The Master Theorem Divide-and-conquer algorithms are recursive algorithms that: Instructor: Il Dillig s 1. Divide problem into k smaller subproblems of the same f
School: University Of Texas
Course: Discrete Mathematics
Recall: Recursively Dened Sequences In previous lectures, we looked at recursively-dened sequences CS311H: Discrete Mathematics Example: What sequence is this? Recurrence Relations a0 an Instructor: Il Dillig s = 1 = an1 + 1 Another example: Fibonacci num
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics Midterm next Tuesday in class dont be late! Number Theory Closed book, closed notes, but can bring up to 3cheat sheets Covers logic, sets, functions, and countable/uncountable innities Il Dillig s Practice questi
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics More Number Theory and Applications in Cryptography Homework due next lecture Dont solve problem 5 on homework we will not cover Chinese remainder theorem in class Instructor: Il Dillig s Instructor: Il Dillig, s
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics Homework 3 due now Cardinality of Innite Sets and Introduction to Number Theory Midterm next Tuesday; covers everything up to and including this lecture Recall: Midterm closed-book, closed-notes, but can bring 3-
School: University Of Texas
PHP & MYSQL Now it gets fun! 3 What Internet php HTML PHP Library SQL Three APIs: mysqli- Object-Oriented Interface Use Th is mysql- Standard Library One PHP Data Objects (PDO)- Driverbased Library Initiating A Connection $db_server = new mysqli($db_hostn
School: University Of Texas
Course: Computer Organization And Architecture
MACHINE-LEVEL PROGRAMMING I: BASICS COMPUTER ARCHITECTURE AND ORGANIZATION University of Texas at Austin Today: Machine Programming I: Basics History of Intel processors and architectures C, assembly, machine code Assembly Basics: Registers, operands,
School: University Of Texas
Course: Computer Organization And Architecture
Carnegie Mellon Machine-Level Programming V: Advanced Topics 15-213: Introduc0on to Computer Systems 8th Lecture, Sep. 16, 2010 Instructors: Randy Bryant & Dave OHallaron 1 Carnegie Mellon Today Structures Alignment Un
School: University Of Texas
Introduction to PHP Carrying on the dialogue At its heart, PHP is a scripting language for HTML perl c+ python php HTML PHP PHP e oa r mg s ee o n tools a l Created by Rasmus Lerdorf in 1995 Howdy World <!DOCTYPE html PUBLIC "-/W3C/DTD XHTML 1.0 Strict/EN
School: University Of Texas
JOINS IN MYSQL User Name Email Password Bob bob@gmail.com pass1 Alice alice@yahoo.com pass2 Merida brave@pixar.com pass3 Owns Dog UserName DogName Name Bob Linus Linus Merida Mo Bob Mo Mo JOINING Tables SELECT something FROM tablename1 [INNER| LEFT| RIGH
School: University Of Texas
Course: Discrete Mathematics
Knowledge representation and reasoning Lecture 1: Introduction Natasha Alechina nza@cs.nott.ac.uk G53KRR 2013-14 lecture 1 1 / 21 Plan of the lecture Plan of the lecture 1 Admin 2 What is this module about 3 Famous knowledge-based systems 4 Plan of the mo
School: University Of Texas
Course: Computer Organization And Architecture
MACHINE-LEVEL PROGRAMMING II: ARITHMETIC & CONTROL Instructor: - University of Texas at Austin Today Complete addressing mode, address computation (leal) Arithmetic operations Control: Condition codes Conditional branches While loops 2 University of
School: University Of Texas
Course: Computer Organization And Architecture
MACHINE-LEVEL PROGRAMMING III: SWITCH STATEMENTS AND IA32 PROCEDURES University of Texas at Austin Today Switch statements IA 32 Procedures Stack Structure Calling Conventions Illustrations of Recursion & Pointers 2 University of Texas at Austin long
School: University Of Texas
Course: Computer Organization And Architecture
Cache Memories 1 Today Cache memory organization and operation Performance impact of caches The memory mountain Rearranging loops to improve spatial locality Using blocking to improve temporal locality 2 Cache Memories Cache memories are small, fast SR
School: University Of Texas
Course: Computer Organization And Architecture
The Memory Hierarchy 1 Today Storage technologies and trends Let it wash over you Locality of reference Caching in the memory hierarchy 2 Main Memory = DRAM 3 Random-Access Memory (RAM) Key features RAM is traditionally packaged as a chip. Basic storag
School: University Of Texas
Course: Computer Organization And Architecture
Machine-Level Programming IV: x86-64 Procedures, Data 1 Today Procedures (x86-64) Arrays One-dimensional Multi-dimensional (nested) Multi-level Structures Allocation Access 2 x86-64 Integer Registers: Usage Conventions %rax Return value %r8 Argument
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics Homework 4 out today due on Thursday, Oct 16 More Number Theory Midterm 1 graded: solutions on Piazza, grades on Canvas Il Dillig s Il Dillig, s CS311H: Discrete Mathematics More Number Theory Mean: 49 out of 65
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics Homework 6 due now! Introduction to Graph Theory Midterm next lecture in class: number theory, crypto, induction, recursion, combinatorics Instructor: Il Dillig s Allowed to bring 3 cheat sheets Instructor: Il Di
School: University Of Texas
Course: Discrete Mathematics
Recursively Dened Sets and Structures CS311H: Discrete Mathematics We saw how to dene functions and sequences recursively We can also dene sets and other data structures recursively Structural Induction Example: Consider the set S dened as: Il Dillig s 3S
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics First Order Logic, Rules of Inference Homework 1 is due now! Homework 2 is handed out today Homework 2 is due next Tuesday Instructor: Il Dillig s Instructor: Il Dillig, s CS311H: Discrete Mathematics First Order
School: University Of Texas
Course: Discrete Mathematics
Course Sta Instructor: Prof. Il Dillig s CS311H: Discrete Mathematics TA: Ruohan Zhang Propositional Logic Proctor: Julian Michael Class meets every Tuesday, Thursday 2:00 pm - 3:30 pm Instructor: Il Dillig s Course webpage: http:/www.cs.utexas.edu/isil/c
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics Introduction to First-Order Logic Homework due at the beginning of next lecture Please bring a hard copy of solutions to class! Instructor: Il Dillig s Instructor: Il Dillig, s CS311H: Discrete Mathematics Introd
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics First homework assignment out today! Propositional Logic II Due in one week, i.e., before lecture next Tuesday 09/09 Instructor: Il Dillig s Instructor: Il Dillig, s CS311H: Discrete Mathematics Propositional Log
School: University Of Texas
Course: Discrete Mathematics
CS311H: Discrete Mathematics Graph Theory IV Instructor: Il Dillig s Instructor: Il Dillig, s CS311H: Discrete Mathematics Graph Theory IV 1/25 A Non-planar Graph Regions of a Planar Graph The planar representation of a graph splits the plane into regions
School: University Of Texas
Course: Foundations Of Logical Thought
ARGUMENTS AND PROOFS Definition: An argument is a sequence of statements called premises, plus a statement called the conclusion. A valid argument is an argument such that the conclusion is true whenever the premises are all true. Note: An argument has th
School: University Of Texas
Course: Discrete Mathematics
Functions CS311H: Discrete Mathematics A function f from a set A to a set B assigns each element of A to exactly one element of B . Functions A is called domain of f , and B is called codomain of f . If f maps element a A to element b B , we write f (a) =
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics First Order Logic, Rules of Inference Oce hours today moved to 5:45-6:45 pm Homework 2 due next lecture Instructor: Il Dillig s Instructor: Il Dillig, s CS311H: Discrete Mathematics First Order Logic, Rules of In
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics Homework 2 due now! Mathematical Proof Techniques Class cancelled on Thursday due to career fair Instructor: Il Dillig s Instructor: Il Dillig, s CS311H: Discrete Mathematics Mathematical Proof Techniques Great o
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics Mathematical Induction Homework 5 out today Due next Thursday (Oct 30) Il Dillig s Il Dillig, s CS311H: Discrete Mathematics Mathematical Induction Il Dillig, s 1/26 Review: Strong Induction CS311H: Discrete Math
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics Mathematical Induction Homework 4 due now Good luck on your CS314 midterm! Il Dillig s Il Dillig, s CS311H: Discrete Mathematics Mathematical Induction Il Dillig, s 1/28 Introduction to Mathematical Induction CS3
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics Graph Theory III Homework on graphs out today, due next Tuesday Start early on this homework! Instructor: Il Dillig s Instructor: Il Dillig, s CS311H: Discrete Mathematics Graph Theory III Instructor: Il Dillig,
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics Homework 5 is due today Permutations and Combinations Homework 6 is out today Due next Thursday (Nov 6) Il Dillig s Can leave answer in the form 232 dont have to calculate exact answer Il Dillig, s CS311H: Discre
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics Homework 6 due on Thursday Permutations and Combinations II Midterm 2 next Tuesday: covers number theory, induction, recursive defs, and combinatorics Instructor: Il Dillig s Practice questions on Piazza Instruct
School: University Of Texas
Course: Discrete Mathematics
Graph Coloring A coloring of a graph is the assignment of a color to each vertex so that no two adjacent vertices are assigned the same color. CS311H: Discrete Mathematics Graph Theory II A graph is k -colorable if it is possible to color it using k color
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics Homework 7 due now Asymptotic Analysis Homework 8 out today, due next Tuesday Instructor: Il Dillig s Instructor: Il Dillig, s CS311H: Discrete Mathematics Asymptotic Analysis This will be the last graded homewor
School: University Of Texas
Course: Discrete Mathematics
Announcements CS311H: Discrete Mathematics Combinatorics Homework due next lecture Midterm in two weeks from today Il Dillig s Il Dillig, s CS311H: Discrete Mathematics Combinatorics Il Dillig, s 1/30 Introduction CS311H: Discrete Mathematics Combinatoric
School: University Of Texas
Introduction to MYSQL Computers Are Dumb 1.Compute Fast 2.Manipulate Data Well Data Managers SQL MySQL ORACLE DataBase Managment Systems NoSQL Flat Files Relational Data Model User Name Owns Password Email Dog Name User Name Email Password Bob bob@gmail.c
School: University Of Texas
Object Oriented PHP 1 UnKnown knowns class declarations property + method visibility Inheritance object creation interface implementation 2 Lets Explore The Unknown Knowns 3 Known Unknowns magic methods Iterators Paamayim Nekudotayim traits 4 magic method
School: University Of Texas
Outline CS345: Programming Languages We will write type systems for multiple languages Lecture 10: Basic Type Checking We will formally see how to dene soundness Thomas Dillig Thomas Dillig, CS345: Programming Languages We will learn how to prove soundnes
School: University Of Texas
Introduction Last time we saw that we can build a static type system that prevents many run-time errors CS345: Programming Languages Examples: Adding ints and strings, applying a non-lambda term, . Lecture 11: Polymorphism We also discussed the two key pr
School: University Of Texas
Course: Computer Organization And Architecture
CS429: Computer Organization and Architecture Introduction Warren Hunt, Jr. and Bill Young Department of Computer Sciences University of Texas at Austin Last updated: August 27, 2014 at 18:25 CS429 Slideset 1: 1 Intro to Computer Systems Acknowledgement T
School: University Of Texas
Course: Computer Organization And Architecture
CS429: Computer Organization and Architecture Instruction Set Architecture II Warren Hunt, Jr. and Bill Young Department of Computer Sciences University of Texas at Austin Last updated: October 1, 2014 at 08:36 CS429 Slideset 7: 1 Instruction Set Architec
School: University Of Texas
Course: Computer Organization And Architecture
CS429: Computer Organization and Architecture Instruction Set Architecture III Warren Hunt, Jr. and Bill Young Department of Computer Sciences University of Texas at Austin Last updated: September 19, 2014 at 09:52 CS429 Slideset 8: 1 Instruction Set Arch
School: University Of Texas
Course: Computer Organization And Architecture
CS429: Computer Organization and Architecture Instruction Set Architecture V Warren Hunt, Jr. and Bill Young Department of Computer Sciences University of Texas at Austin Last updated: October 16, 2014 at 15:19 CS429 Slideset 10: 1 Instruction Set Archite
School: University Of Texas
Course: Computer Organization And Architecture
CS429: Computer Organization and Architecture Instruction Set Architecture Warren Hunt, Jr. and Bill Young Department of Computer Sciences University of Texas at Austin Last updated: October 1, 2014 at 12:03 CS429 Slideset 6: 1 Instruction Set Architectur
School: University Of Texas
Course: Computer Organization And Architecture
CS429: Computer Organization and Architecture Intro to C Warren Hunt, Jr. and Bill Young Department of Computer Sciences University of Texas at Austin Last updated: September 3, 2014 at 08:38 CS429 Slideset C: 1 Intro to C Topics Simple C programs: basic
School: University Of Texas
Introduction CS345: Programming Languages So far when we studied typing, we always assumed that the programmer annotated some types Lecture 12: Type Inference Example: We gave types to let bindings and lambda variables in class Thomas Dillig But annotatin
School: University Of Texas
Outline CS345: Programming Languages Next Topic: Semantics Lecture 7: Operational Semantics I How to specify meaning of syntax Thomas Dillig Thomas Dillig, CS345: Programming Languages Lecture 7: Operational Semantics I Will look at one formalism for this
School: University Of Texas
Introduction CS345: Programming Languages Recall for last time: We are inferring types Lecture 13: Type Inference II Big idea: Replace all concrete type assumptions with type variables Thomas Dillig Collect constraints on these type variables Find most ge
School: University Of Texas
Administrativa CS345: Programming Languages Forgot to mention last time: No Textbook Lecture 2: Lambda Calculus II and Introduction to L Today thee handouts: L Reference Manual, Written Assignment 1 and Programming Assignment 0. Canvas course site is set
School: University Of Texas
Announcements CS345: Programming Languages WA1 and PA0 are due Today Lecture 4: Implementation of Lexical Analysis WA2 and PA1 out today :-) Thomas Dillig Thomas Dillig, CS345: Programming Languages Lecture 4: Implementation of Lexical Analysis If you are
School: University Of Texas
Course: ELEMENTS OF COMPUTERS AND PROGRAMMING
CS 303E Fall 2011 Exam 1 Solutions and Criteria Name: EID: Section Number: Friday discussion time (circle one): 9-10 10-11 11-12 12-1 2-3 Friday discussion TA(circle one): Wei Ashley Answer all questions. Please give clear answers. If you give more than
School: University Of Texas
Course: ELEMENTS OF COMPUTERS AND PROGRAMMING
CS 303E Fall 2011 Exam 2 Solutions and Criteria November 2, 2011 Name: EID: Section Number: Friday discussion time (circle one): 9-10 10-11 11-12 12-1 2-3 Friday discussion TA(circle one): Wei Ashley Answer all questions. Please give clear answers. If yo
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Points off 1 2 3 4 5 Total off Net Score CS 314 Midterm 2 Spring 2013 Your Name_ Your UTEID _ Circle yours TAs name: Donghyuk Lixun Padmini Zihao Instructions: 1. There are 5 questions on this test. The test is worth 70 points. Scores will be scaled to 17
School: University Of Texas
CS310 Fall 2010 Boral Test 2 75 Minutes/50 Points Name: UTEID: Section Time: Directions: Work only on these sheets. Use the back, if needed. Show your work for partial credit. Manage your time well. Dont be shy about asking for clarifications. The back of
School: University Of Texas
Course: ANALYSIS OF PROGRAMS
Name_ Sample Exam 1 CS 336 General Instructions: Do all of your work on these pages. If you need more space, use the backs (to ensure the grader sees it, make a note of it on the front). Make sure your name appears on every page. Please write large a
School: University Of Texas
CS303E (Mitra) Test 1 Fall 2005 Ques 1 ( 10 pt ) a) Convert 113 in decimal to hexadecimal, octal, and binary. b) Convert DEF in hexadecimal to binary, octal, and decimal. Ques 2 ( 10 pt ) Define variables from the following descriptions. The var
School: University Of Texas
Course: Introduction To Programming
CS 312 Final 2013 Your Name SOLUTION SOLUTION SOLUTION Your UTEID _ Problem Points Points Number Topic Possible Off 1 short answer 1 10 2 ASN 15 3 short answer 2 10 4 arrays 1 12 5 strings 14 6 critters 19 7 arrays 2 17 8 methods 13 9 2d arrays 20 TOTAL P
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
CS314 Fall 2012 Midterm 1 Solution and Grading Criteria. Grading acronyms: AIOBE - Array Index out of Bounds Exception may occur BOD - Benefit of the Doubt. Not certain code works, but, can't prove otherwise ECF - Error carried forward. Gacky or Gack - Co
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
CS314 Spring 2013 Midterm 1 Solution and Grading Criteria. Grading acronyms: AIOBE - Array Index out of Bounds Exception may occur BOD - Benefit of the Doubt. Not certain code works, but, can't prove otherwise Gacky or Gack - Code very hard to understand
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Points off 1 2 3 4A 4B Total off Net Score CS 307 Midterm 1 Fall 2010 Your Name_ Your UTEID _ Circle yours TAs name: Harsh Yi-Chao Instructions: 1. There are 4 questions on this test. 2. You have 2 hours to complete the test. 3. You may not use a calculat
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Points off 1 2 3 4 5 Total off Net Score CS 314 Midterm 1 Fall 2011 Your Name_ Your UTEID _ Circle yours TAs name: Swati Yuanzhong Instructions: 1. There are 5 questions on this test. 2. You have 2 hours to complete the test. 3. You may not use a calculat
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
CS314 Fall 2011 Midterm 1 Solution and Grading Criteria. Grading acronyms: AIOBE - Array Index out of Bounds Exception may occur BOD - Benefit of the Doubt. Not certain code works, but, can't prove otherwise ECF - Error carried forward. Gacky or Gack - Co
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Points off 1 2 3 4 5 Total off Net Score CS 314 Midterm 2 Fall 2012 Your Name_ Your UTEID _ Circle yours TAs name: John Zihao Instructions: 1. There are 5 questions on this test. 2. You have 2 hours to complete the test. 3. You may not use a calculator or
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Points off 1 2 3 4 5 Total off Net Score CS 314 Midterm 2 Fall 2011 Your Name_ Your UTEID _ Circle yours TAs name: Swati Yuanzhong Instructions: 1. There are 5 questions on this test. 2. You have 2 hours to complete the test. 3. You may not use a calculat
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Exam Number: Points off 1 2 3 4 5 Total off Net Score CS 307 Midterm 2 Spring 2011 Name_ UTEID login name _ TA's Name: Dan Muhibur Oliver (Circle One) Instructions: 1. Please turn off your cell phones and other electronic devices. 2. There are 5 questions
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Exam Number: Points off 1 2 3 4 Total off Net Score CS 307 Midterm 2 Fall 2010 Name_ UTEID login name _ TA's Name: Harsh Yi-Chao (Circle One) Instructions: 1. Please turn off your cell phones and other electronic devices. 2. There are 4 questions on this
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
CS314 Spring 2013 Midterm 2 Solution and Grading Criteria. Grading acronyms: AIOBE - Array Index out of Bounds Exception may occur BOD - Benefit of the Doubt. Not certain code works, but, can't prove otherwise Gacky or Gack - Code very hard to understand
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
CS314 Fall 2012 Midterm 2 Solution and Grading Criteria. Grading acronyms: AIOBE - Array Index out of Bounds Exception may occur BOD - Benefit of the Doubt. Not certain code works, but, can't prove otherwise ECF - Error carried forward. Gacky or Gack - Co
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
CS314 Fall 2011 Midterm 2 Solution and Grading Criteria. Grading acronyms: AIOBE - Array Index out of Bounds Exception may occur BOD - Benefit of the Doubt. Not certain code works, but, can't prove otherwise ECF - Error carried forward. Gacky or Gack - Co
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Points off 1 2 3 4 5 Total off Net Score CS 314 Midterm 1 Fall 2012 Your Name_ Your UTEID _ Circle yours TAs name: John Zihao Instructions: 1. There are 5 questions on this test. 2. You have 2 hours to complete the test. 3. You may not use a calculator or
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Points off 1 2 3 4A 4B Total off Net Score CS 307 Midterm 1 Spring 2011 Your Name_ Your UTEID _ Circle yours TAs name: Dan Muhibur Oliver Instructions: 1. There are 4 questions on this test. 2. You have 2 hours to complete the test. 3. You may not use a c
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Points off 1 2 3 4 5 Total off Net Score CS 314 Midterm 1 Spring 2013 Your Name_ Your UTEID _ Circle yours TAs name: Donghyuk Lixun Padmini Zihao Instructions: 1. There are 5 questions on this test. The test is worth 70 points. Scores will be scaled to 17
School: University Of Texas
CS305J Spring 2010 Final Key, Suggested Solutions, and Grading Criteria Abbreviations: NAP - no answer provided ECF - error carried forward OBOE - off by one error BOD - benefit of the doubt GCE - misunderstood question. Answer is way off base. 1. Answer
School: University Of Texas
Exam Number: Points off 1 2 3 4 5 6 7 8 Total off Net Score CS 305j Final Spring 2010 Your Name_ Your UTEID _ Instructions: 1. Please turn off your cell phones. 2. There are 8 questions on this test. 3. You have 3 hours to complete the test. 4. You may no
School: University Of Texas
Exam Number: Points off 1 2 3 4 5 6 7 8 Total off Net Score CS 305j Final Fall 2008 Your Name_ Your UTEID _ Circle you TA's name: Ann Alex Instructions: 1. Please turn off your cell phones. 2. There are 8 questions on this test. 3. You have 3 hours to com
School: University Of Texas
CS305J Fall 2007 Final Key, Suggested Solutions, and Grading Criteria Abbreviations: NAP - no answer provided ECF - error carried forward OBOE - off by one error BOD - benefit of the doubt GCE - misunderstood question. Answer is way off base. 1. Answer as
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Points off 1 2 3 4 5 6 Total off Net Score CS 314 Final Spring 2013 Your Name_ Your UTEID _ Instructions: 1. 2. 3. 4. 5. 6. 7. 8. There are 6 questions on this test. The test is worth 80 points. Scores will be scaled to 300 for grade center. You have 3 ho
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Points off 1 2 3 4 5 6 Total off Net Score CS 314 Final Spring 2013 SOLUTION - SOLUTION - SOLUTION - SOLUTION - SOLUTION - SOLUTION - SOLUTION Your UTEID _ Instructions: 1. 2. 3. 4. 5. 6. 7. 8. There are 6 questions on this test. The test is worth 80 poin
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Points off 1 2A 2B 2C 3 4A 4B 5 Total off Net Score CS 314 Final Fall 2012 Your Name_ Your UTEID _ Instructions: 1. There are 5 questions on this exam. The raw point total on the exam is 110. 2. You have 3 hours to complete the exam. 3. You may not use a
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
CS314 Fall 2012 Final Exam Solution and Grading Criteria. Grading acronyms: AIOBE - Array Index out of Bounds Exception may occur BOD - Benefit of the Doubt. Not certain code works, but, can't prove otherwise ECF - Error carried forward. Gacky or Gack - C
School: University Of Texas
CS314 Fall 2011 Final Solution and Grading Criteria. Grading acronyms ABA - Answer by Accident AIOBE - Array Index out of Bounds Exception may occur BOD - Benefit of the Doubt. Not certain code works, but, can't prove otherwise ECF - Error carried forward
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
Points off 1 2A 2B 2C 3 4 5 Total off Net Score CS 314 Final Fall 2011 Your Name_ Your UTEID _ Instructions: 1. There are 5 questions on this test. 2. You have 3 hours to complete the test. 3. You may not use a calculator or any other electronic devices w
School: University Of Texas
Points off 1 2 3 4A 4B 4C 5A 5B Total Off Net CS 307 Final Spring 2011 Name_ UTEID login name _ Instructions: 1. 2. 3. 4. 5. 6. Please turn off your cell phones and all other electronic devices. There are 5 questions on this test. You have 3 hours to comp
School: University Of Texas
Points off 1 2 3A 3B 4 5 Total off Net Score CS 307 Final Fall 2010 Name_ UTEID login name _ Instructions: 1. 2. 3. 4. 5. 6. Please turn off your cell phones and all other electronic devices. There are 5 questions on this test. You have 3 hours to complet
School: University Of Texas
CS307 Fall 2010 Final Solution and Grading Criteria. Grading acronyms ABA Answer by Accident AIOBE Array Index out of Bounds Exception may occur BOD Benefit of the Doubt. Not certain code works, but, can't prove otherwise ECF Error carried forward. Gacky
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
CS307 fall 2009 Midterm 2 Solution and Grading Criteria. Grading acronyms: ABA - Answer by Accident, right answer, wrong approach AIOBE - Array Index out of Bounds Exception may occur BOD - Benefit of the Doubt. Not certain code works, but can't prove oth
School: University Of Texas
Course: Foundations Of Logical Thought
CS301K Fall 2010 Midterm 1 September 29, 2010 Name: EID: Thursday Discussion Time: Answer all questions. Please give clear and rigorous answers. The logic you use in drawing conclusions and completing your answers is most important. Use extra paper to d
School: University Of Texas
Course: Discrete Mathematics
CS 336 Analysis of Programs - Fall 2012 Exam #1 Solutions 1. Let T(n) be a function defined for n = 1, 2, , by T(1) = 7 T(n) = 3 T(n-1) + 1 Prove that T (n) 3 n for all integers n 1 , using induction. Solution. We will prove that T (n) 3 n for all integer
School: University Of Texas
Course: Introduction To Operating Systems: Honors
Name: 1 CS372H: Spring 2008 Final Exam Instructions This nal is closed book and notes. If a question is unclear, write down the point you nd ambiguous, make a reasonable interpretation, write down that interpretation, and proceed. State your assumption
School: University Of Texas
Course: Introduction To Operating Systems: Honors
Name: 1 CS372H: Spring 2009 Final Exam Instructions This exam is closed book and notes with one exception: you may bring and refer to a 1-sided 8.5x11inch piece of paper printed with a 10-point or larger font. If you hand-write your review sheet, the tex
School: University Of Texas
Course: Introduction To Operating Systems: Honors
Name: 1 CS372H: Spring 2008 Final Exam Instructions This nal is closed book and notes. If a question is unclear, write down the point you nd ambiguous, make a reasonable interpretation, write down that interpretation, and proceed. State your assumption
School: University Of Texas
Course: Introduction To Operating Systems: Honors
Name: 1 CS372H: Spring 2009 Final Exam Instructions This exam is closed book and notes with one exception: you may bring and refer to a 1-sided 8.5x11inch piece of paper printed with a 10-point or larger font. If you hand-write your review sheet, the tex
School: University Of Texas
Course: Introduction To Operating Systems: Honors
Name: 1 CS372H: Spring 2008 Midterm 1 Instructions This midterm is closed book and notes. If a question is unclear, write down the point you nd ambiguous, make a reasonable interpretation, write down that interpretation, and proceed. State your assumpt
School: University Of Texas
Course: Introduction To Operating Systems: Honors
Name: 1 CS372H: Spring 2009 Midterm 1 Instructions This midterm is closed book and notes with one exception: you may bring and refer to a 1-sided 8.5x11-inch piece of paper printed with a 10-point or larger font. If you hand-write your review sheet, the
School: University Of Texas
Course: Introduction To Operating Systems: Honors
Name: 1 CS372H: Spring 2008 Midterm 1 Instructions This midterm is closed book and notes. If a question is unclear, write down the point you nd ambiguous, make a reasonable interpretation, write down that interpretation, and proceed. State your assumpt
School: University Of Texas
Course: Introduction To Operating Systems: Honors
Name: CS372H: Spring 2009 Midterm 1 Instructions 1 This midterm is closed book and notes with one exception: you may bring and refer to a 1-sided 8.5x11-inch piece of paper printed with a 10-point or larger font. If you hand-write your review sheet, the
School: University Of Texas
Course: Principles Of Computer Systems
The University of Texas at Austin CS 372H Introduction to Operating Systems: Honors: Spring 2011 FINAL EXAM This exam is 3 hours. Stop writing when time is called. You must turn in your exam; we will not collect it. Do not get up or pack up in the nal te
School: University Of Texas
Course: Principles Of Computer Systems
The University of Texas at Austin CS 372H Introduction to Operating Systems: Honors: Spring 2010 FINAL EXAM This exam is 3 hours. Stop writing when "time" is called. You must turn in your exam; we will not collect them. Do not get up or pack up in the fi
School: University Of Texas
Course: Principles Of Computer Systems
The University of Texas at Austin CS 372H Introduction to Operating Systems: Honors: Spring 2012 Final Exam This exam is 3 hours. Stop writing when "time" is called. You must turn in your exam; we will not collect it. Do not get up or pack up in the fina
School: University Of Texas
Course: Principles Of Computer Systems
The University of Texas at Austin CS 372H Introduction to Operating Systems: Honors: Spring 2010 FINAL EXAM This exam is 3 hours. Stop writing when time is called. You must turn in your exam; we will not collect them. Do not get up or pack up in the nal
School: University Of Texas
Course: Discrete Mathematics
Exam #2 Put your name on every page you hand in, and show all your work. Note: all graphs are nite without self-loops and without parallel edges. 1. For the graphs given on the board, let V denote the vertex set, let E denote the edge set, and so the grap
School: University Of Texas
Course: Discrete Mathematics
Exam 3, CS 336 April 16, 2012 Solutions by Tandy Warnow 1. Give the formula for n choose k, written as C (n, k ). Solution: n! (nk)!k! 2. Evaluate C (10, 8). Solution: 10! 8!2! = 90/2 = 45 3. Let P (n, k ) denote the number of ways you can select k people
School: University Of Texas
Course: Discrete Mathematics
Exam 3, CS 336 April 16, 2012 NOTE: For problems 5-7, provide at least some English explanation of how you obtain your answers to each question. all graphs are nite and simple (no self-loops or multiple edges). G = (V, E ) denotes a graph with vertex se
School: University Of Texas
Course: Theory In Programming Practice
CS 337 Open book and notes. Max points = 75 Test 3 5/15/09 Time = 75 min Do all questions. 1. (Relational Databases; 15 points) You are given relations SL (denoting Stores and Locations), IT (Items and Types) and SIP (Stores, Items and Prices) in Table 1,
School: University Of Texas
Course: Theory In Programming Practice
CS 337 Open book and notes. Max points = 75 Test 2 Time = 75 min 4/6/09 Do all questions. 1. (Finite State Machine Design; 15 points) (a) (7 points) Design a nite state machine to accept a binary string which does not contain three consecutive identical s
School: University Of Texas
Course: Theory In Programming Practice
CS 337 Open book and notes. Max points = 75 Test 1 2/23/09 Time = 75 min Do all questions. 1. (Compression; 30 points) (a) (8 points) Given below is a Human tree over a set of symbols. Assign probabilities to the symbols. Note that the answer is not uniqu
School: University Of Texas
Course: Theory In Programming Practice
CS 337 Open book and notes. Pop Quiz 4 4/20/09 Problem Let t be the string abba. What is the largest i such that ci (t20 ) = ? Justify. Solution First, let us solve the problem for any n instead of 20. Observe c(tn ) = tn1 , for n > 1. Hence, cn1 (tn ) =
School: University Of Texas
Course: Theory In Programming Practice
CS 337 Open book and notes. Pop Quiz 3 3/30/09 Problem Write a Haskell program that takes a list of booleans as inputs and outputs the same list retaining only its True entries. Solution trueretain [] = [] trueretain (x:xs) |x = x : (trueretain xs) | othe
School: University Of Texas
Course: Theory In Programming Practice
CS 337 Open book and notes. Pop Quiz 2 3/11/09 Problem Draw a nite state machine that accepts a string of digits s where either (1) s is empty, or (2) s is a single digit at most 3, or (3) sum of every pair of adjacent digits in s is at most 3. So, 2, 103
School: University Of Texas
Course: Theory In Programming Practice
CS 337 Open book and notes. Pop Quiz 1 2/4/09 Problem Variables x and y are 4-bit long words in the following two equations. Solve for x and y . Recall that x is the complement of x. x y = 1, y = x y, 1
School: University Of Texas
Course: Discrete Mathematics
Lecture Notes for CS 311, Part 5 Triangular Numbers and Their Relatives In the denitions below, n is a nonnegative integer. The triangular number Tn is the sum of all integers from 1 to n: n Tn = i = 1 + 2 + + n. i=1 For instance, T4 = 1 + 2 + 3 + 4 = 10.
School: University Of Texas
Course: Discrete Mathematics
CS311: Discrete Math for Computer Science, Spring 2014 Answers to Selected Exercises 1. For each of the following assertions, determine if it is true. If it is then present its proof as an annotated program. It not, give a counterexample. (a) cfw_n > 3 n
School: University Of Texas
Course: Discrete Mathematics
CS311: Discrete Math for Computer Science, Spring 2014 Additional Exercises, with Solutions We use i, j, k, l, m, n as variables for integers (positive, negative, and 0), and x, y, z as variables for real numbers. 1. For each of these formulas determine w
School: University Of Texas
Course: Discrete Mathematics
CS311: Discrete Math for Computer Science, Spring 2014 Homework Assignment 1, with Solutions In the following problems, x is a variable for real numbers. 1. Simplify each of these formulas. (a) x < 5 x 0. Answer: 0 x < 5. (b) x 5 x = 5. Answer: x > 5. (c)
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 311 Fall 2013 Midterm 1 1) Pigeon Hole Principle: Let m be a non-negative integer and n be a positive integer. Prove by contradiction that in any distribution of m pigeons into n holes there exist a hole that has at least m/n pigeo
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 311 Fall 2013 Homework 3 1) Show that the complete bipartite graph K2,6 is planar. Sol: This graph can be drawn on a plane, without any two edges being crossed, as follows: a. Draw vertex 1 at the top of the plane, draw vertex 8 at
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 311 Fall 2013 Homework 1 1) Show that formula f(x,y) below is equivalent to formula T. f(x,y) = (x and y) -> (x or y) Sol. f(x,y) = cfw_definition of -> not (x and y) or (x or y) = cfw_De Morgan's (not x or not y) or (x or y) = c
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2013 Homework 2 1) Use induction to prove that any graph G can be colored using (max-deg(G) + 1) colors. Sol. Restate what needs to be proven as follows: (All n, n >= 1, P(n) where P(n) is the predicate: any graph G with
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 311 Fall 2013 Midterm 3 1) Let f:A->B be a function. a) Prove by direct inference that (f(A) sub B) b) Prove by direct inference that (f is surjective) => (B sub f(A) Sol.: a) y in f(A) => cfw_definition of f(A) (y in B) and (
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 311 Fall 2013 Midterm 2 1) Let G be any 2-colorable graph. Show by contradiction that every cycle in G is of even length. Sol: not (every cycle of G is of even length) =>cfw_De-Morgan's (G has a cycle C of odd length) =>cfw_cycle C
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Homework 3 1. A connected planar graph G has 20 vertices. What is the maximum number of edges that G can have? What is the maximum number of regions that G can have? Sol: Let n be the number of vertices in G, e be th
School: University Of Texas
Course: Discrete Mathematics
CS311: Discrete Math for Computer Science, Spring 2014 Additional Exercises, Part 3 1. In Homework Assignment 6, the numbers Y0 , Y1 , Y2 , . . . are dened recursively, as follows: Y0 = 0, Yn+1 = 2Yn + n + 1. (a) Rewrite this denition in the case format.
School: University Of Texas
Course: Discrete Mathematics
CS311: Discrete Math for Computer Science, Spring 2014 Additional Exercises, Part 2, with Solutions 1. Function f is dened by the formulas 2x, if x 0, 3x, otherwise. f (x) = Find numbers a, b such that for all values of x f (x) = ax + b|x|. Prove that you
School: University Of Texas
Course: Discrete Mathematics
Lecture Notes for CS 311, Part 4 Method of Undetermined Coecients In Part 3 of these lecture notes we considered the sequence An dened by cases: An = 2, if n is odd, 5, otherwise. We noticed that this sequence can be dened also by a single formula: An = 7
School: University Of Texas
Course: Discrete Mathematics
Lecture Notes for CS 311, Part 1 Propositional Connectives and Quantiers Logical notation uses symbols of two kinds: propositional connectives, such as (and), (or), (not), and quantiers (for all), (there exists). Examples: (x > 5) (x < 6) (2x > 1) (2
School: University Of Texas
Course: Discrete Mathematics
Name: Time of your discussion section: CS311: Discrete Math for Computer Science, Spring 2014 Homework Assignment 9, Due April 11 1. Without a calculator, determine which of the numbers 1030 , 1050 , 1070 gives the best approximation to the value of the f
School: University Of Texas
Course: Discrete Mathematics
CS311: Discrete Math for Computer Science, Spring 2014 Homework Assignment 5, with Solutions The rst two problems are about the formula for the sum Sn of the squares of numbers from 1 to n: n 3 n2 n Sn = + + . (1) 3 2 6 It can be written also as (2n + 1)(
School: University Of Texas
Course: Discrete Mathematics
CS311: Discrete Math for Computer Science, Spring 2014 Homework Assignment 8, with Solutions 1. In the previous homework assignment, the sequence Y0 , Y1 , Y2 , . . . is dened by the equations Y0 = 0, Y1 = 6, Yn+2 = 2Yn + 2Yn+1 . Determine whether this se
School: University Of Texas
Course: Discrete Mathematics
CS311: Discrete Math for Computer Science, Spring 2014 Homework Assignment 6, with Solutions 1. Rewrite the recursive denition of the factorial function in the case format. Answer: n! = 1, n (n 1)!, if n = 0, otherwise. 2. Calculate 4! using (a) eager eva
School: University Of Texas
Course: Discrete Mathematics
CS311: Discrete Math for Computer Science, Spring 2014 Homework Assignment 7, with Solutions 2 1. Calculate the value of the expression Fn+1 Fn1 Fn for several positive integers n and guess what the general formula for its value can be. Using your conject
School: University Of Texas
Course: Discrete Mathematics
CS311: Discrete Math for Computer Science, Spring 2014 Homework Assignment 4, with Solutions In Problems 13, you are expected to come up with reasonable conjectures, but you dont need to prove anything. The notation used in these problems is dened in Part
School: University Of Texas
Course: Discrete Mathematics
CS311: Discrete Math for Computer Science, Spring 2014 Homework Assignment 3, with Solutions 1. Translate into logical notation: (a) For any two real numbers x, y such that x < y there exists a real number that is greater than x but less than y. Answer: x
School: University Of Texas
Course: Discrete Mathematics
CS311: Discrete Math for Computer Science, Spring 2014 Homework Assignment 2, with Solutions We use i, j, k, l, m, n as variables for integers (positive, negative, and 0), and x, y, z as variables for real numbers. 1. Translate each sentence into logical
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Homework 4 1. Let A be any set. Which of the following six statements is true? can be true? or is false? (a) cfw_ in A (b) cfw_ sub A (c) cfw_ sub A (d) cfw_ in PS(A) (e) cfw_ sub PS(A) (f) cfw_ sub PS(A) Note th
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Homework 5 1. Consider the recurrence equation: T(1) = 2 T(2) = 9 T(n+2) = 2*T(n+1) + 3*T(n) for n >= 1 Show, by induction, that T(n) =< 3^n for n >= 1 Sol: Let P(n) be the predicate T(n) =< 3^n. Base Case: n=1 an
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Homework 2 1. Let G be a graph with 5 vertices of degree 3 each, 4 vertices of degree 2 each, 3 vertices of degree 1 each, 2 vertices of degree 4 each, and x vertices of degree 6 each. Compute x if G has 35 edge
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Exercise 3 1. Show that the following quantified predicate R is equivalent to another predicate that has no "not". R = not (All x (P(x) -> (Exist y not Q(x,y) Sol: R = cfw_Predicate R not (All x (P(x) -> (Exist y n
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Exercise 1 1)Simplify the following formulas: (T and F) or (F and T) or (T and T) = F or F or T = T (not T or F) and (not F or T) and not (F or F) = F and T and T = F not (F or not (T and not(not T or not (F and T)
School: University Of Texas
CSE332 Week 2 Section Worksheet 1. Prove f(n) is O(g(n) where a. f(n)=7n2+3n g(n)=n4 b. f(n)=n+2nlogn g(n)=nlogn c. f(n)=1000 g(n)=3n3 d. f(n)=7n g(n)=n/10 2. True or false, & explain a. f(n) is (g(n) implies g(n) is (f(n) b. f(n) is (g(n) implies f(n) is
School: University Of Texas
Course: Computer Organization And Architecture
CS 429 Homework 1 Name: Section #: Instructions: Work these problems on your own paper, and then write your answers on this page. These problems are quite similar to practice problems in the book. You may collaborate with your class mates and ask for assi
School: University Of Texas
Course: Algorithms And Complexity
CS 331: Solutions to Homework 6 October 23, 2013 Question1 (10 points) Problem 1, page 188 Solution: We provide two dierent proofs for this problem. Proof 1: (Proof by contradiction) If e is not included in the MST T, then add e to the MST and consider th
School: University Of Texas
Course: Algorithms And Complexity
CS 331: Solutions to Homework 2 September 11, 2013 Question1 (5 points) Draw the trees represented by the following Newick strings: (a,(b,(c,d),(e,f) (a,b),(c,(d,(e,f) Solution: a b c a e d f c b d e 1 f Question2 (3 points) Draw a non-binary rooted tre
School: University Of Texas
Course: Algorithms And Complexity
CS 331: Solutions to Homework 3 September 26, 2013 There are two ways to write DP algorithms: either write the pseudo code for it (you need to be very careful while writing it); or write the step-by-step algorithm as described in the lecture slides. For t
School: University Of Texas
Course: Algorithms And Complexity
CS 331: Solutions to Homework 2 September 11, 2013 Question1 (5 points) Suppose you have algorithms with the ve running times listed below.How much slower do each of these algorithms get when you (a) double the input size, or (b) increase the input size b
School: University Of Texas
Course: Algorithms And Complexity
CS 331: Solutions to Homework 1 September 4, 2013 Question1 (5 points) Prove that the square root of 5 is not rational. Solution: Suppose 5 is rational. Then, 5 = p/q , for two integers p and q that are relatively prime. Hence, p2 /q 2 = 5. p2 = 5q 2 .
School: University Of Texas
Course: Discrete Mathematics
Homework #15 April 30, 2012 Problem 1 We will prove that F (n) F (n 1), n 2 by strong induction on n. Basis Step. By denition, F (2) = 3 F (1) F (0), so, by arithmetic, F (2) = 3 1 1 = 2 > 1 = F (1). Inductive Step. Assume that for some n 2, F (k ) F (k
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Exercise 4 1. Give a direct inference proof to prove the predicate: (n is odd) => (Exist k,l n = k^2 - l^2) where the domains of n, k, and l are the set of all positive integers. Sol: n is odd => cfw_definition of od
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Exercise 2 1. Use equivalence laws to show that the following two formulas are equivalent. f = (x and y) g = (x and y) and (not x or not z) or (y and x) Sol: g = cfw_second formula (x and y) and (not x or not z) or
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Homework 1 1. Give a direct inference proof to prove m+n and n+p are even => m+p is even where the domains of m, n, and p are the set of all integers. Sol: m+n and n+p are even <=> cfw_Definition of even m+n = 2k a
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Exercise 13 1. Show, by direct inference, that the function f(x) = 10 is Theta(g(x) where g(x) = 1. Sol: Proving f(x) is O(g(x): |f(x)| = |10| = 10 = 10*1 = C*|1| for C=10 =< C*|g(x)| for K is any value and C=10
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Exercise 11 1. Consider the recurrence equation, T(0) = 7 T(n+1) = 2*T(n) for n >= 0 Prove, by induction, that the closed equation for this recurrence is T(n) = 7*(2)^n for n >= 0 Sol: Let P(n) be the predicat
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Exercise 12 1. Use the Characteristic Polynomial method to compute the closed equation for the following recurrence equation: T(0) = 4 (1) T(1) = 3 (2) T(n+2) = 3*T(n+1) + 4*T(n) for n >= 0 (3) Sol: The Characteri
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Exercise 10 1. Let f:A->B and g:B->C be two functions. Show, by direct inference, that (f is injective) and (g is injective) => (g.f is injective) Sol: g.f(x1) = g.f(x2) => cfw_Definition of "." g(f(x1) = g(f(x2)
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Exercise 7 1. Let G=(V,E) be a connected graph. Show, by contradiction, that (|V|=n and |E|=n-1 and n > 1) => (G has at least one leaf) Sol: (|V|=n and |E|=n-1 and n > 1) and (G has no leaves) => cfw_G is connected
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Exercise 8 1. A connected planar graph G has 6 vertices of degree 4 each. How many regions does G have? Explain. Sol: Let n be the number of vertices in G, e be the number of edges in G, and r be the number of regi
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Exercise 9 1. Let A, B, and C be three sets and let * denote the Cartesian product operator. Also, let (A sub B) denote the fact that A is a subset of B. Prove, by direct inference, that (A sub B) => (A*C sub B*
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Exercise 5 1. Let G=(V,E) be a graph where V=cfw_1,2,3,4,5, E=cfw_(1,4),(1,5),(2,3),(2,4),(2,5),(4,5) Which of the following vertex lists is a path, a simple path, a circuit, a simple circuit, or a cycle? (a) (1,5,2,
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Fall 2012 Exercise 6 1. How to prove that a graph G=(V,E) is bipartite? And how to prove that it is not bipartite? Sol: To prove that G=(V,E) is bipartite, exhibit a partitioning V1 and V2 of V such that for every edge (u1,u2)
School: University Of Texas
Course: Discrete Mathematics
Homework #14, Solutions by Andrei Margea April 27, 2012 Problem 4, Page 432 In the rst day, the student can pick a sandwich of any of the 6 types, i.e. the student has 6 options. For each option he picks in his/her rst day, the student has 6 options in th
School: University Of Texas
Course: Discrete Mathematics
Lecture Notes for CS 311, Part 2 Implication The binary propositional connective is called implication. It represents the combination if . . . then. For instance, the logical formula n(4|n 2|n) (1) says: for all n, if n is a multiple of 4 then n is even.
School: University Of Texas
Course: Discrete Structures
CS 173 Discrete Structures Fall 2014: Homework 10 1. Induction [20 points] We are going to prove a slightly harder induction problem. However, we will guide you through the various steps so that you can solve it fairly easily. The problem will give you an
School: University Of Texas
Course: Logic, Sets, And Functions
Name: Discussion section: CS313K: Logic, Sets and Functions, Spring 2013 Homework Assignment 8, Due February 19 1. Use induction to prove the formula n i=1 1 n = . i(i + 1) n+1 2. The sequence V1 , V2 , . . . is dened by the formula n Vn = i ! i. i=1 (i)
School: University Of Texas
Course: Logic, Sets, And Functions
Name: Discussion section: CS313K: Logic, Sets and Functions, Spring 2013 Homework Assignment 10, Due February 26 1. Prove that for all integers n 10, 2n > n + 1000. 2. Prove that for all nonnegative integers n, 4n 1 is a multiple of 3.
School: University Of Texas
Course: Logic, Sets, And Functions
Name: Discussion section: CS313K: Logic, Sets and Functions, Spring 2013 Homework Assignment 6, Due February 5 1. In Homework Assignment 5 we dened the sequence C1 , C2 , . . . by the formulas 3n, if n is even, Cn = 2n, otherwise. Prove that for all n Cn
School: University Of Texas
Course: Logic, Sets, And Functions
Name: Discussion section: CS313K: Logic, Sets and Functions, Spring 2013 Homework Assignment 11, Due March 1 1. For any nonnegative integer n, let f (n) be the product of all odd numbers from 1 to 2n + 1: f (n) = 1 3 5 (2n + 1). Give a recursive denition
School: University Of Texas
Course: Logic, Sets, And Functions
Name: Discussion section: CS313K: Logic, Sets and Functions, Spring 2013 Homework Assignment 9, Due February 22 1. Use induction to prove the formula n i3 = i=1 n2 (n + 1)2 4 for all nonnegative integers n. 2. Find all nonnegative integers n such that 3n
School: University Of Texas
Course: Logic, Sets, And Functions
Name: Discussion section: CS313K: Logic, Sets and Functions, Spring 2013 Homework Assignment 7, Due February 15 The sequence S1 , S2 , S3 , . . . is dened by the formula n i2 . Sn = i=1 1. Rewrite the denition of Sn as a recursive denition. 2. The numbers
School: University Of Texas
Course: Logic, Sets, And Functions
Name: Discussion section: CS313K: Logic, Sets and Functions, Spring 2013 Homework Assignment 2, Due January 22 In the following problems i, j, k are variables for nonnegative integers. 1. Represent the property i is a power of 2 (that is to say, i is one
School: University Of Texas
Course: Logic, Sets, And Functions
Name: Discussion section: CS313K: Logic, Sets and Functions, Spring 2013 Homework Assignment 3, Due January 25 1. Recall that harmonic numbers are dened by the formula k Hk = i=1 1 . i Calculate H101 H99 . 2. The sequence of numbers X1 , X2 , . . . is den
School: University Of Texas
Course: Logic, Sets, And Functions
Name: Discussion section: CS313K: Logic, Sets and Functions, Spring 2013 Homework Assignment 4, Due January 29 We use n as a variable for nonnegative integers, and x as a variable for real numbers. 1. For each formula, either prove it by exhaustion or nd
School: University Of Texas
Ethereal Lab 2, Part 2: DNS and Content Distribution The goal of this lab is to analyze how a Content Distribution Network (Push caching) interacts with DNS authoritative name servers. You can work individually or with a partner. For the next activit
School: University Of Texas
Course: CS439
#define _GNU_SOURCE 1 #include <errno.h> #include <fcntl.h> #include <signal.h> #include <stdarg.h> #include <stdbool.h> #include <stddef.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #include <stropts.h> #include <sys/ioctl.h> #include <s
School: University Of Texas
Course: CS439
#define _GNU_SOURCE 1 #include <errno.h> #include <fcntl.h> #include <signal.h> #include <stdarg.h> #include <stdbool.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #include <stropts.h> #include <sys/ioctl.h> #include <sys/stat.h> #include
School: University Of Texas
Course: CS439
#! /usr/bin/perl use strict; use warnings; use POSIX; use Getopt:Long qw(:config bundling); use Fcntl 'SEEK_SET'; # Read Pintos.pm from the same directory as this program. BEGIN cfw_ my $self = $0; $self =~ s%/+[^/]*$%; require "$self/Pintos.pm"; our ($d
School: University Of Texas
Course: CS439
# Pintos helper subroutines. # Number of bytes available for the loader at the beginning of the MBR. # Kernel command-line arguments follow the loader. our $LOADER_SIZE = 314; # Partition types. my (%role2type) = (KERNEL => 0x20, FILESYS => 0x21, SCRA
School: University Of Texas
Course: CS439
# -*- makefile -*- include $(patsubst %,$(SRCDIR)/%/Make.tests,$(TEST_SUBDIRS) PROGS = $(foreach subdir,$(TEST_SUBDIRS),$($(subdir)_PROGS) TESTS = $(foreach subdir,$(TEST_SUBDIRS),$($(subdir)_TESTS) EXTRA_GRADES = $(foreach subdir,$(TEST_SUBDIRS),$($(subd
School: University Of Texas
Course: CS439
# # A set of useful macros that can help debug Pintos. # # Include with "source" cmd in gdb. # Use "help user-defined" for help. # # Author: Godmar Back <gback@cs.vt.edu>, Feb 2006 # # $Id: gdb-macros,v 1.1 2006-04-07 18:29:34 blp Exp $ # # for internal u
School: University Of Texas
Course: CS439
Index: bochs-2.2.6/cpu/exception.cc diff -u bochs-2.2.6/cpu/exception.cc\~ bochs-2.2.6/cpu/exception.cc - bochs-2.2.6/cpu/exception.cc~ 2006-09-28 15:51:39.000000000 -0700 + bochs-2.2.6/cpu/exception.cc 2006-12-08 11:14:33.000000000 -0800 @ -1033,6 +1033,
School: University Of Texas
Course: CS439
#ifndef _LIB_SYSCALL_NR_H #define _LIB_SYSCALL_NR_H /* System call numbers. */ enum cfw_ /* Projects 2 and later. */ SYS_HALT, /* Halt the operating system. */ SYS_EXIT, /* Terminate this process. */ SYS_EXEC, /* Start another process. */ SYS_WAIT, /* Wai
School: University Of Texas
Course: Operating Systems
The Dining Philosophers Due: March 8 4:59:59 PM Overview In this lab you will implement several variations of the classic "dining philosophers problem" in order to practice your multi-threaded programming skills. As in the classic problem, there are N pla
School: University Of Texas
Course: CS439
/* Create a very deep "vine" of directories: /dir0/dir1/dir2/. and an ordinary file in each of them, until we fill up the disk. Then delete most of them, for two reasons. First, "tar" limits file names to 100 characters (which could be extended to
School: University Of Texas
Course: ELEMENTS OF COMPUTERS AND PROGRAMMING
CS313E: Fall, 2012 Elements of Software Design Instructor: Dr. Bill Young Unique number: 52765 Class time: MWF 9-10am; Location: RLM 5.104 Office: MAIN 2012 Office Hours: MW 10-noon and by appointment Office Phone: 471-9782; Email: byoung@cs.utexas.edu TA
School: University Of Texas
Course: ELEMENTS OF COMPUTERS AND PROGRAMMING
Syllabus - Computer Science 303E - Elements of Computers and Programming The University of Texas at Austin Spring 2012 Course Overview: Welcome! CS303E is an introduction to computer science and programming for students who have no programming experience.
School: University Of Texas
Computer Science 302: Computer Fluency - Syllabus for Spring 2015 Teaching Staff Who Location Office Hours Email Nathan Clement, Instructor GDC 1.302 Monday, 5-6pm; Thursday 10-noon Other times by appointment nathanlclement@g GDC 1.302 M W 1-2 pm By appoi
School: University Of Texas
Course: Mobile Computin
ElementsofMobileComputing CS329E EssentialInformation Instructor:RobertF.Dickerson Contact:rfd@cs.utexas.edu,yichao0319@gmail.com LectureClassroom:ART1.110 LectureTime:5:006:30PM,TuesdaysandThursdays Prof.DickersonOfficehours(GDB5.318): MondaysandWednesda
School: University Of Texas
Course: Introduction To Computing
Department of Computer Science University of Texas at Austin CS 312 - Introduction to Computing (Fall 2011) Lecture I, MW 10:00 AM - 11:00 AM, SAC 1.402; F 10:00 AM - 11:00 AM, WEL 1.308 Lecture II, MWF 1:00 PM - 2:00 PM, JES A 121A Discussion Section (sa
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
' 3 u ! ' % t % s % ! 3 1 v " ) " $ $ # 4 4 4 1 % q 3 & & % ! q 3 & ! % s % ! 1 $ # " $ $ ) % r ' q % ' ! % % ! % & ! % s % ! 1 $ ( 5 h ) g b V j & ' 3 q ' r ! 3 & ! % r q % ! 3 1 " ) 5 ( R a V C B p 8 i 8 Q @ P @ P e b V % ! ' 2 % & 1 3 3 $ # " ( ( " 5
School: University Of Texas
Course: ELEMENTS OF COMPUTERS AND PROGRAMMING
Jan 3, 2013 Reading List Eco 350K Applied Macroeconomics Spring 2013 David Kendrick David Kendrick: Office Hours: MWF 11 http:/www.utexas.edu/cola/depts/economics/faculty/dak2 TA: George Shoukry, Office Hours:, tba gshoukry@utexas.edu BRB 3.134E The focus
School: University Of Texas
Course: Introduction To Programming
GEO 401 Physical Geology (Fall 2009) Unique Numbers 26630, 26635, 26640, 26645, 26650, 26655, 26660, 26670, 26675 Lecture: JGB 2.324; TTh 2:00-3:30 Laboratory Sections: JGB 2.310; time according to your unique number Professor: Dan Breecker, JGB 4.124, 47
School: University Of Texas
CS357: ALGORITHMS The University of Texas at Austin Department of Computer Sciences January 18, 2006 COURSE DESCRIPTION Time/Location/Unique number. MW 11:00-12:30, WEL 2.256, #54045 Professor. Vijaya Ramachandran (vlr"at"cs, TAY 3.152, 471-9554). Office
School: University Of Texas
-Mohamed G. Gouda CS 337 Fall 2007 Course Overview -The major theme of this course is the applications of theory in practical programming. We draw upon material -both theoretical and practical-which have been taught in prior courses: functions, relat
School: University Of Texas
Course: Algorithms
CS357: ALGORITHMS The University of Texas at Austin Department of Computer Sciences January 18, 2006 COURSE DESCRIPTION Time/Location/Unique number. MW 11:00-12:30, WEL 2.256, #54045 Professor. Vijaya Ramachandran (vlr"at"cs, TAY 3.152, 471-9554). O