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 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
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: 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: 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: 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
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 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
School: University Of Texas
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
Lecture 14 10/1/10 Announcements Come see me if you are not doing well in the class! Last Week (P&P 4-5) Von-Neumann Model LC-3 Computational & Memory Instructions This Week (P&P 5, 9.1-2) Test #1 LC-3 Control Instructions TRAP and JSR instructions
School: University Of Texas
Course: Computer Organization
CS310: Computer Organization & Programming Spring 2011 Haran Boral CS310 Spring 2011 - Boral Why Are You Taking This Class? Goals Acquire a basic knowledge of computing platforms Understand principal components of computer systems Learn to program at
School: University Of Texas
Course: Computer Organization
Lecture 2 1/21/11 Announcements Let me know if you have not received Blackboard email notification Last Lecture Grand tour of course Todays Lecture (P&P 1) Moores Law Digital vs. analog Realization Next lecture (P&P 3.1) Transistor basics CS310
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
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
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
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: 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: 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: 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 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 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 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
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: 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: 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
-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
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
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
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
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
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 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
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: 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: 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: 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
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 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
Name: CS 354 Midterm 2 November 17, 2010 DIRECTIONS: Please answer all questions. There are three questions, each with subquestions. The points associated with each question are given in square brackets. There are 80 total possible points. Work on these s
School: University Of Texas
CS 354 Review Midterm 2 Fall 2010 DIRECTIONS: Please answer all questions. The points associated with each question are given in square brackets. Work on these sheets (both sides, if needed) only. There is plenty of room for your answers. Put your name on
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 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
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 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: 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: 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: 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 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: 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: 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
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
School: University Of Texas
School: University Of Texas
School: University Of Texas
Course: Algorithmic Analysis And Data Structures
CS5343: Algorithm Analysis and Data Structures Prof. Sergey Bereg Deletion in Red-Black Trees delete(k) Delete as in BST: nd node v with key k and (i) delete it if it has an external child, or (ii) nd its successor u, move entry of u to v , delete u. If
School: University Of Texas
Course: Algorithmic Analysis And Data Structures
Minimum Spanning Trees 2704 BOS 867 849 PVD ORD 740 621 1846 1391 1464 1258 BWI 1090 DFW LAX 144 JFK 184 802 SFO 337 187 946 1235 1121 MIA 2342 2010 Goodrich, Tamassia Minimum Spanning Trees 1 Minimum Spanning Trees Spanning subgraph ORD Subgraph of a gr
School: University Of Texas
Course: Algorithmic Analysis And Data Structures
Breadth-First Search L0 L1 B L2 2010 Goodrich, Tamassia A Breadth-First Search C E D F 1 Breadth-First Search Breadth-first search (BFS) is a general technique for traversing a graph A BFS traversal of a graph G Visits all the vertices and edges of G Det
School: University Of Texas
Course: Algorithmic Analysis And Data Structures
h m m h u y h xdwd apq eq q 1 q v u d 0 3 v g D 1$23 2 #k"k#$ 5 h iT&f y v q v q v u v xdpq ey m 9y h ey 3 $ w ~ g eu cfw_ ~ x ` x g s` x Qx u cfw_ x Qx |u x Qx ~ rh u ` h m x B w f x erx Q h r 9C r u ` x cfw_ xeu u x Qx u f xB Qx c x Qx u o x x x x e
School: University Of Texas
Course: Algorithmic Analysis And Data Structures
Arithmetic Expressions Infix form operand operator operand 2+3 or a+b Need precedence rules May use parentheses 4*(3+5) or a*(b+c) Arithmetic Expressions Postfix form Operator appears after the operands (4+3)*5 : 4 3 + 5 * 4+(3*5) : 4 3 5 * +
School: University Of Texas
History of Computing 1/14/14, 3:25 PM History of Computing 1. Earliest Traditions Man need to keep track of things - whether it was the number of things, the measure of distance, or weight, or time. He used the digits of his hands as the rst counting devi
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: Introduction To Computing
Lecture Notes on 19 Sep 2011 Sum the following series to 10 terms 1 - 1/3 + 1/5 - 1/7 . double sum = 0.0; / First solution for (int i = 1; i <= 10; i+) cfw_ if (i % 2 = 1) cfw_ sum = sum + 1.0 / (2 * i - 1); else cfw_ sum = sum - 1.0 / (2 * i - 1); / S
School: University Of Texas
Course: Discrete Mathematics
Big Notation Define f(n) vaguely by dropping from f(n) smaller terms and constant factors if f(n) = 2n + 5000, replace it by f(n) = n if f(n) = 2n^2 + 500n + 5000, replace it by f(n) = n^2 if f(n) = 2^n + n^2, replace it by f(n) = 2^n let f(n) & g(n) b
School: University Of Texas
School: University Of Texas
School: University Of Texas
School: University Of Texas
History of Computing 2/11/14, 1:51 PM History of Computing 1. Earliest Traditions Man need to keep track of things - whether it was the number of things, the measure of distance, or weight, or time. He used the digits of his hands as the rst counting devi
School: University Of Texas
Algorithms 2/11/14, 1:51 PM Algorithms What is an algorithm? A program is a set of instructions that a computer executes to achieve a certain desired effect - perform a calculation, render a picture, or produce music. A program is written in a specic prog
School: University Of Texas
Course: CS 314
16:16 CS314MidtermReview Readthiscomment TableofContents ? BigO: NamesofBigOclasses Givenafunctionfortimevs.n,reduceittoBigO. RankingofBigO:whichisbetter BigOforcommonalgorithms EstimateBigOforsomegivencode log(n)growsslowly EstimateBigOfromaloglogplot,fr
School: University Of Texas
Course: Web Design
CS313E: Elements of Software Design Another ADT: Linked Lists Dr. Bill Young Department of Computer Sciences University of Texas at Austin Last updated: November 23, 2011 at 06:34 CS313E Slideset 7: 1 Linked Lists The List ADT A list is a nite sequence of
School: University Of Texas
Course: Web Design
CS313E: Elements of Software Design A Language Interpreter Dr. Bill Young Department of Computer Sciences University of Texas at Austin Last updated: November 21, 2011 at 06:44 CS313E Slideset 11: 1 A Language Interpreter An Extended Example The goals of
School: University Of Texas
Course: Web Design
Turtle Graphics Turtle graphics was rst developed as part of the childrens programming language Logo in the late 1960s. It exemplies OOP extremely well. There are various versions of Turtle Graphics dened for Python. The version were going to use is dened
School: University Of Texas
Course: Web Design
10 References Archer, John. (1988). The behavioural biology of Aggression. Cambridge: Cambridge University Press. Bailey, N.W., & Zuk, M. (2008). Acoustic experience shapes female mate choice in field crickets. Proceedings of the Royal Society London Bull
School: University Of Texas
Course: Web Design
REDOX REACTIONS In an acid/base reaction, protons are transferred: AH + B A+ BH+ We can make a table of individual acids and strengths. HCl H+ + ClpKa very low ImH+ H+ + Im pKa = 7 HAc H+ + AcpKa = 4 NH4+ H+ + NH3 pKa = 10 Agents at the top, like HCl, are
School: University Of Texas
Course: History Of The Religions Of Asia
Think Python How to Think Like a Computer Scientist Version 1.1.22 Think Python How to Think Like a Computer Scientist Version 1.1.22 Allen Downey Green Tea Press Needham, Massachusetts Copyright 2008 Allen Downey. Printing history: April 2002: First edit
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 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 Homework 1 Due Tuesday, January 23 Do the following problems from Chapter 32 of the book: 1, 2, 3a, 4, 5, 6, 7, 9, 11, 13, 14, 17, 20b, 23.
School: University Of Texas
Course: ALGORITHMS & DATA STRUCTURES
CS 315: Algorithms and Data Structures Gordon S. Novak Jr. Department of Computer Sciences University of Texas at Austin novak@cs.utexas.edu http:/www.cs.utexas.edu/users/novak When you tell women youre really good at algorithms, it doesnt do much. Aaron
School: University Of Texas
Course: Introduction To Programming
GEO 401 - Lab Exam 1 1 - Plate Tectonics List an area of the world where each of the following occurs today: 1. oceanic spreading ridge - Mid-Atlantic Ridge 2. continental rift - Midcontinent Rift System (U.S.) 3. ocean-ocean convergence - Philippine Plat
School: University Of Texas
Course: Computer Fluency
CS 302 notes Algorithms Stepbystepinstructionsthattella computingagenthowtosolvesome problemusingonlyfiniteresources Letsdiscusseachofthesepointsinturn stepbystepinstructions Sequentialoperations:simpledeclarative sentences,suchas: Chooseaquestiontoanswer
School: University Of Texas
Data Structure 2/11/14, 1:52 PM Tuple A tuple is like a list. It is an ordered sequence but unlike a list it is immutable. It is created by specifying the items in the tuple within parentheses and separated by commas. coord = (7.3, 2.9) employee_record =
School: University Of Texas
Course: Foundations Of Logical Thought
CS 313k - Midterm 1 Review 1. State the converse and contrapositive of the statement If it is sunny, then I will go swimming. Re-write the original statement in terms of propositions you dene, and then write the negation of the original statement in logic
School: University Of Texas
Summary and References Chapter 10 Languages and Machines Well I'm back at work again. I passed your class with a B. I was glad it was over. Thanks! But, today at work, I decided I was going to teach myself how to use a new performance monitoring tool. So
School: University Of Texas
Course: Computer Fluency
CS302 Notes 10 Timesharing complications: critical sections Consider a computer program for accessing and updating an airline reservation database. One step in the program is incrementing the number of passengers on a flight. Suppose the code for this s
School: University Of Texas
Course: Computer Fluency
The Purpose of an Operating System (OS) Interact with the user; activate programs requested by the user Control access to system resources (security) Allocate resources efficiently Were going to focus on the last two 4 An OS provides security, e.g. aga
School: University Of Texas
Course: Computer Fluency
CS302 notes 8 The binary search algorithm assuming that the entries in student are sorted in increasing order, 1. ask user to input studentNum to search for 2. set found to no 3. repeat until "done searching" or found = yes 4. set middle to the index coun
School: University Of Texas
Course: Computer Fluency
Algorithms vary in efficiency example: sum the numbers from 1 to n space requirement is constant (i.e. independent of n) time requirement is linear (i.e. grows linearly with n). This is written O(n) efficiency space= 3 memory cells time = t(step1) + t(s
School: University Of Texas
Course: Computer Fluency
CS302Notes6 Consideranemployeewhoworksfor$8/hrforthe first40hours,and$12/hrforeveryhourover40. 1.Writeanalgorithmthatisgiventhenumberof hourstheemployeeworksinaweek,andprintsthe totalpay. 2.Putthealgorithmintoablackbox 3.Usingtheblackbox,writeanalgorithmt
School: University Of Texas
Course: Computer Fluency
CS3025 WarmupExercises Consideranemployeewhoworksfor$8/hrforthe first40hours,and$12/hrforeveryhourover40. 1.Writeanalgorithmthatisgiventhenumberof hourstheemployeeworksinaweek,andprintsthe totalpay. 2.Putthealgorithmintoablackbox 3.Usingtheblackbox,writea
School: University Of Texas
Course: Computer Fluency
CS302 GivenvaluesforName,N1,N10andforT1,T10 Setito1andsetFoundtoNO RepeatuntileitherFound=YESori>10 IfName=Nithen PrintTi SetFoundtoYES Incrementi If(Found=NO)then PrintSorry,thenamesnotinthedirectory OverlySpecificSequentialSearch NameTelephoneNumber Pau
School: University Of Texas
Course: Computer Fluency
CSnotes3 SequentialSearch: ACommonlyusedAlgorithm Supposeyouwantadirectoryofmembers oftheracquetballclub. Itcontainsnamesandphonenumbers. Youwantacomputerapplicationfor searchingthedirectory:givenaname, returnthemembersphonenumber. Youwantmore,too,butthis
School: University Of Texas
Course: Computer Fluency
CSnotes2 PseudocodeExample FindLargestNumber Given:Alistofpositivenumbers Output:Thelargestnumberinthelist Procedure: 1.SetLargesttozero 2.SetCurrentNumbertothefirstinthelist 3.Whiletherearemorenumbersinthelist 3.1if(theCurrentNumber>Largest)then 3.1.1Set
School: University Of Texas
I. Lecture Notes The Three Hour Tour Through Automata Theory Read Supplementary Materials: The Three Hour Tour Through Automata Theory Read Supplementary Materials: Review of Mathematical Concepts Read K & S Chapter 1 Do Homework 1. Let's Look at So
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
Lecture 14 10/1/10 Announcements Come see me if you are not doing well in the class! Last Week (P&P 4-5) Von-Neumann Model LC-3 Computational & Memory Instructions This Week (P&P 5, 9.1-2) Test #1 LC-3 Control Instructions TRAP and JSR instructions
School: University Of Texas
Course: Computer Organization
CS310: Computer Organization & Programming Spring 2011 Haran Boral CS310 Spring 2011 - Boral Why Are You Taking This Class? Goals Acquire a basic knowledge of computing platforms Understand principal components of computer systems Learn to program at
School: University Of Texas
Course: Computer Organization
Lecture 2 1/21/11 Announcements Let me know if you have not received Blackboard email notification Last Lecture Grand tour of course Todays Lecture (P&P 1) Moores Law Digital vs. analog Realization Next lecture (P&P 3.1) Transistor basics CS310
School: University Of Texas
Course: Computer Organization
Lectures 3-5 1/24/11 1/28/11 Announcements Hwk 1 posted, due Thursday 2/3 in your discussion section Last Week (P&P 1) Some basic concepts in computer systems This Weeks Lectures (P&P 3.1-3) Boolean Logic The mighty transistor Circuits Next Weeks
School: University Of Texas
Course: Computer Organization
Lectures 6-8 1/31/11 2/4/11 Announcements Hwk 1 due Thursday beginning of discussion section Hwk 2 posted Make sure to check Blackboard for corrections to assignments Last Week Combinational logic circuits This Week (P&P 3.4-3.6) Storage Sequenti
School: University Of Texas
Course: Computer Organization
Lecture 9-11 2/7/11 2/11/11 Announcements Hwk 2 due Thursday; Hwk 3 posted tonight Test 1: Tuesday, Feb 22nd 5:45 -7PM through Lecture 11 Last Week (P&P 3.4-3.6) Storage Sequential Logic Clocks This Week (P&P 3.6-3.7; 2) Finite State Machines LC
School: University Of Texas
FORTRAN 95 PROGRAMMING Course : CS1073 CS1073 CHAPTER 1 Chapter 1 Intro. to Computers and the Fortran Language The Computer In summary, the major components of the computer are: CPU Main Memory Secondary Memory Input Devices (e.g. keyboard, tapes etc) Out
School: University Of Texas
Course: Introduction To Programming
Take 1: Java Programming ". a person does not really understand something until after teaching it to a computer, i.e., expressing it as an algorithm." - D. Knuth Computers are good at following instructions, but not at reading your mind." - D. Knuth Plan
School: University Of Texas
2/11/14, 1:52 PM Lecture Notes on 16 Sep 2013 Problem: Prompt the user to enter 3 numbers and print the numbers in ascending order. Write pseudo code for the algorithm # Read the numbers and store them in variables Read first number Set a to first number
School: University Of Texas
Course: Computer Organization
Lecture 17-19 2/28/11-3/4/11 Announcements Hwk 4 due Thursday Get your hands on the LC-3 Micro-architecture animator at: http:/sourceforge.net/projects/lc3uarch/files/lc3uarch/Version%200. 7/LC3uArch.jar/download Last Week LC-3 Instructions + Test T
School: University Of Texas
Course: Computer Organization
Lecture 15-16 2/23/11 2/25/11 Announcements Come see me if you are not doing well in the class! Hwk 4 posted tonight Last Week (P&P 4-5) Von-Neumann Model LC-3 Computational & Memory Instructions This Week (P&P 5, 9.1-2) Test #1 LC-3 Control Inst
School: University Of Texas
Lecture 15-17 10/4/10-10/8/10 Announcements Hwk 5 due Friday Last Week LC-3 Instructions + Test This Week (P&P 7.1 7.2) LC-3 programs LC-3 Program Execution Next Week (P&P 8, 9) LC-3 I/O LC-3 Subroutines CS310 Fall 2010 - Boral Assembly Language P
School: University Of Texas
Lecture 18-20 11/11/10-11/15/10 Announcements Hwk 6 due Friday Last Week LC-3 Program execution This Week (P&P 8, 9) I/O in the LC-3 Service Routines Subroutines Next Week (P&P 11-14) Assemblers & Linkers Introduction to C CS310 Fall 2010 - Boral
School: University Of Texas
Lecture 21-23 10/18/10-10/22/10 Announcements Test 2 Oct 27th see location on Blackboard Covers material in Lectures 11-23 In-class review on the 27th Hwk 7 due Friday Last week I/O in the LC-3 This week (P&P 7.3, Chap. 1, 4 & 10 http:/www.iecc.com
School: University Of Texas
Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Lecture 24-25 10/25/10, 10/29/10 Announcements Test 2 Oct 27th JGB 2.32
School: University Of Texas
Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Activation Record Bookkeeping Return value space for value returned by function allocated even if function does not return a value Return address save pointer to
School: University Of Texas
Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Lecture 26-28 11/1/10-11/5/10 Announcements Hwk 8 due Tuesday, Nov. 9th by midnight No class Wednesday, Nov. 27th Last Week Intro to C Test 2 This Week (P&P 8.
School: University Of Texas
C Data Structures Basic data types: int, char, float, double Arrays Of things (basic data types, structures, arrays) Structures Composite data types struct flightType cfw_ char flightNum[7]; int altitude; int longitude; int latitude; int heading; do
School: University Of Texas
Lecture 29-31 11/8/10 11/12/10 Announcements Hwk 9 (last programming assignment) posted tomorrow Hwk 8 due tomorrow night Heap Manager Implementation 1 Use a linked list data structure to track contents of heap struct mem_struct cfw_ int start_address
School: University Of Texas
Course: Computer Organization
Lecture 12-14 2/14/11 2/18/11 Announcements Hwk 3 due Thursday at Discussion; max 2 days late Test #1 Feb. 22nd UTC 4.102 & 4.104 5:45 -7PM through Lecture 11 Well use the class period on the 21st for review If you contact me ahead of time I can hold add
School: University Of Texas
2/11/14, 1:52 PM Lecture Notes on 23 Sep 2013 Recapitulate What We Have Done So Far: * We see the world in binary * Number conversions: decimal to binary, octal, hexadecimal and vice versa * Structure of a computer language * Algorithms and Pseudocode * P
School: University Of Texas
2/11/14, 1:52 PM Lecture Notes on 27 Sep 2013 * Test 1 on 2 Oct 2013 - in class and closed book No multiple choice questions Number conversions Write code or interpret code Study guide posted * Assignment 3 due today * Code Lab Tutorial exercises for Chap
School: University Of Texas
Course: Introduction To Computing
Computer Programs Aside: Computer Arithmetic A computer manipulates binary digits (bits). A bit can be either 0 or 1. A byte is 8 bits. 1 KiloByte is 1024 bytes. 1 MegaByte is 1024 KiloBytes. 1 GigaByte is 1024 MegaBytes. Decimal system Binary system Conv
School: University Of Texas
Course: Introduction To Computing
Basic Input / Output Strings A String is a sequence of characters. In Java String is a class from which you make String objects, like: String name = "Alan Turing"; String course = "CS 303E"; String ssn = "123456789"; A String has an associated length. To
School: University Of Texas
Course: Introduction To Computing
Java Language Introduction to Java Programs There are two types of Java programs - applications and applets. An application is a stand alone program whereas an applet is a program embedded in a web page that runs on the client machine. The Java compiler c
School: University Of Texas
Course: Introduction To Computing
Operators Increment and Decrement Operators Increment and decrement operators can be applied to all integers and floating point types. They can be used either prefix (-x, +x) or postfix (x-, x+) mode. Prefix Increment Operation int x = 2; int y = +x; / x
School: University Of Texas
Course: Introduction To Computing
Control Statements and Loops Expression / Statement An assignment or increment / decrement expression can be made into a statement by adding a semi-colon. An expression statement is executed by evaluating the expression. Empty Statement An empty statement
School: University Of Texas
Course: Logic, Sets, And Functions
Predicate Logic Example: All men are mortal. Socrates is a man. Socrates is mortal. Note: We need logic laws that work for statements involving quantities like some and all. In English, the predicate is the part of the sentence that tells you something a
School: University Of Texas
School: University Of Texas
Course: Introduction To Computing
Computer Organization What is a computer? A simple minded definition: a computer is a machine that computes. It has evolved from mechanical devices like the abacus and slide rule to the machine we know now that stores data (words, numbers, or pictures), i
School: University Of Texas
Course: Introduction To Computing
History of Computing 1. Earliest Traditions Man need to keep track of things - whether it was the number of things, the measure of distance, or weight, or time. He used the digits of his hands as the first counting device. From this was born our decimal n
School: University Of Texas
2/11/14, 1:53 PM Lecture Notes on 15 Nov 2013 # Outline of Word Search def check_columns (string_cols, word): # initialize row_num and col_num to zero # create rev_word that is the reverse of the word # iterate through the list string_cols # if word or re
School: University Of Texas
2/11/14, 1:53 PM Lecture Notes on 18 Nov 2013 def scalar_product (a, b): sum = 0 for i in range (len(a): sum += a[i] * b[i] return sum def seq_search (a, x): index = [] for i in range (len(a): if (x = a[i]): index.append (i) return index def merge (a, b):
School: University Of Texas
2/11/14, 1:52 PM Lecture Notes on 04 Oct 2013 def main(): # Sum numbers 1 through 10 sum = 0 counter = 1 while (counter <= 10): sum = sum + counter counter = counter + 1 print (sum) # Version 1: Determine prime or not # Prompt the user to enter a number n
School: University Of Texas
2/11/14, 1:53 PM Lecture Notes on 16 Oct 2013 def is_prime (n): limit = int (n * 0.5) + 1 for divisor in range (2, limit): if (n % divisor = 0): return False return True def sum_digits (n): sum = 0 while (n > 0): sum += n % 10 n = n / 10 return sum def re
School: University Of Texas
2/11/14, 1:53 PM Lecture Notes 11 Nov 2013 def find_max (b): max = b[0][0] for row in b: for col in row: if (col > max): max = col return max def find_min (b): min = b[0][0] for row in b: for col in row: if (col < min): min = col return min def sum_rows (
School: University Of Texas
2/11/14, 1:53 PM Lecture Notes on 13 Nov 2013 Solution to Test 2 Problems # Ques 1 def p (n): if (n = 0): return 0 else: return (2 + 3 * p (n - 1) def p_iter (n): sum = 0 for i in range (n): sum = 2 + 3 * sum return sum def p_closed (n): return (3 * n - 1
School: University Of Texas
2/11/14, 1:53 PM Lecture Notes for 01 Nov 2013 Some Sample Questions for Test 2 1. Write a function that sums the following series to the nth term S(n) = 1 / (1 * 2) + 1 / (2 * 3) + . + 1 / (n + 1) * (n + 2) for n >= 0. 2. Write a function that sums the f
School: University Of Texas
2/11/14, 1:53 PM Lecture Notes on 22 Nov 2013 # keeps only letters and removes everything else def filter_string (st): s = ' for ch in st: if (ch >= 'a') and (ch <= 'z'): s += ch else: s += ' ' return s def main(): # open book book = open ('hard_times.txt
School: University Of Texas
2/11/14, 1:53 PM Lecture Notes on 25 Nov 2013 # keeps only letters and removes everything else def filter_string (st): s = ' for ch in st: if (ch >= 'a') and (ch <= 'z'): s += ch else: s += ' ' return s def main(): # open book book = open ('hard_times.txt
School: University Of Texas
2/11/14, 1:52 PM Lecture Notes on 07 Oct 2013 # Outline of Assignment 5 def main(): # Prompt the user to enter a positive number n = int (input ('Enter a positive number: ') # Prompt again if the number is not positive while (n <= 0): print ('Negative num
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 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
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
Introduction to MPI Table of Contents 1. Program Structure 2. Communication Model Topology Messages 3. Basic Functions 4. Made-up Example Programs 5. Global Operations 6. LaPlace Equation Solver 7. Asynchronous Communication 8. Communication Groups
School: University Of Texas
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 takes value
School: University Of Texas
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 nonnegativ
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 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 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: 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
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
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
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: 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: 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: 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 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. 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. 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. 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: Theory In Programming Practice
CS 337 Test 3 Open book and notes. Do all questions from Part 3 for Test 3 (75 points). Bonus questions for Tests 1 and 2 appear on the last page. 5/10/07 Time = 105 min 1. (PART 3: Proofs of Recursive Programs; 15 points) Consider the following functions
School: University Of Texas
Course: Theory In Programming Practice
CS 337 Open book and notes. Max points = 75 Test 2 4/4/07 Time = 75 min Do all questions. 1. (Finite State Machine; 15 points) (a) A turnstile is either locked or unlocked. When the turnstile is locked, a customer can drop a coin into its slot. This cause
School: University Of Texas
Course: Theory In Programming Practice
CS 337 Open book and notes. Max points = 75 Test 1 2/21/07 Time = 75 min Do all questions. 1. (Compression; 28 points) (a) (6 points) Create a Human tree for symbols with the following frequencies: cfw_12, 8, 20, 6, 32, 4, 20, 24. (b) (16 points) A sender
School: University Of Texas
Course: Theory In Programming Practice
CS 337 Open book and notes. Max points = 50 Test 3 5/5/06 Time = 50 min Do all questions. 1. (Relational Algebra; 15 points) (a) (5 points) You are given relations CT and CR in Table 1 and Table 2 respectively. Compute their (natural) join, CT CR. (b) (5
School: University Of Texas
Course: Theory In Programming Practice
CS 337 Open book and notes. Max points = 50 Test 2 4/5/06 Time = 50 min Do all questions. 1. (Finite State Machine; 20 points) The nite state machine in Figure 1 compares the magnitudes of two binary strings of equal length. The machine is fed the bits al
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: 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: 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
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 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 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
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
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: Theory In Programming Practice
CS 337 Open book and notes. Max points = 50 Test 1 Time = 50 min 2/20/06 Do all questions. 1. (Compression; 14 points) (a) (6 points) Create a Human tree for symbols with the following frequencies: cfw_6, 4, 10, 3, 16, 2, 10, 12. (b) (8 points) A sender s
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: 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: 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 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 nal te
School: University Of Texas
Course: Principles Of Computer Systems
9 8 7 6 frequency 5 4 3 2 1 20-34 35-39 40-44 45-49 50-54 range 55-59 60-64 65-70 The University of Texas at Austin CS 372H Introduction to Operating Systems: Honors: Spring 2010 Midterm This exam is 75 minutes. Stop writing when "time" is announced at t
School: University Of Texas
Course: Principles Of Computer Systems
8 7 6 frequency 5 4 3 2 1 20-35 36-40 41-45 46-50 51-55 56-60 61-65 66-70 71-75 76-80 81-85 86-90 range The University of Texas at Austin CS 372H Introduction to Operating Systems: Honors: Spring 2011 Midterm Exam This exam is 75 minutes. Stop writing wh
School: University Of Texas
Course: Principles Of Computer Systems
The University of Texas at Austin CS 372H Introduction to Operating Systems: Honors: Spring 2012 Midterm Exam This exam is 80 minutes. Stop writing when time is called. You must turn in your exam; we will not collect it. Do not get up or pack up between
School: University Of Texas
Course: Principles Of Computer Systems
The University of Texas at Austin CS 439 Principles of Computer Systems: Spring 2013 Midterm Exam I This exam is 120 minutes. Stop writing when time is called. You must turn in your exam; we will not collect it. Do not get up or pack up between 110 and 1
School: University Of Texas
Course: Principles Of Computer Systems
The University of Texas at Austin CS 439 Principles of Computer Systems: Spring 2013 Midterm Exam I This exam is 120 minutes. Stop writing when time is called. You must turn in your exam; we will not collect it. Do not get up or pack up between 110 and 1
School: University Of Texas
Course: Principles Of Computer Systems
The University of Texas at Austin CS 439 Principles of Computer Systems: Spring 2013 Midterm Exam II This exam is 120 minutes. Stop writing when time is called. You must turn in your exam; we will not collect it. Do not get up or pack up between 110 and
School: University Of Texas
Course: Principles Of Computer Systems
The University of Texas at Austin CS 439 Principles of Computer Systems: Spring 2013 Midterm Exam II This exam is 120 minutes. Stop writing when time is called. You must turn in your exam; we will not collect it. Do not get up or pack up between 110 and
School: University Of Texas
Course: Principles Of Computer Systems
The University of Texas at Austin CS 372H Introduction to Operating Systems: Honors: Spring 2010 Midterm This exam is 75 minutes. Stop writing when time is announced at the end. You must turn in your exam; we will not collect them. Do not get up or pack
School: University Of Texas
Course: Principles Of Computer Systems
The University of Texas at Austin CS 372H Introduction to Operating Systems: Honors: Spring 2011 Midterm Exam This exam is 75 minutes. Stop writing when time is called. You must turn in your exam; we will not collect it. Do not get up or pack up between
School: University Of Texas
Course: Principles Of Computer Systems
The University of Texas at Austin CS 372H Introduction to Operating Systems: Honors: Spring 2012 Midterm Exam This exam is 80 minutes. Stop writing when "time" is called. You must turn in your exam; we will not collect it. Do not get up or pack up betwee
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: 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: 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
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: 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 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 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 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: 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
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 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: 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: Logic, Sets, And Functions
CS 301 - Homework #2 100 points possible Give clear, legible answers to all questions. 1. For the following statements, write each in logical notation and then indicate True or False. (a) 2 + 3 = 5 only if 8 is a prime number. R: 2 + 3 = 5, S: 8 is a prim
School: University Of Texas
Course: Theory In Programming Practice
CS 337 - Theory in Programming Practice Homework 1 Solutions 1. Consider symbol a b c the following probability .1 .7 .2 codes: code 1 0 1 10 code 2 code 3 10 1 0 01 11 00 Which of these codes are prex codes? And which are not? Justify your answers. Code
School: University Of Texas
Course: Theory In Programming Practice
CS 337 - Theory in Programming Practice Homework 2 Show all work. The logic you use to develop your solution is most important. 1. Exercise 4, #1 in textbook (p. 17) a complete binary tree 2. Exercise 4, #3 in textbook (p. 18) This is a lemma which is pro
School: University Of Texas
Course: Theory In Programming Practice
CS 337 - Theory in Programming Practice Homework 3 Show all work. The logic you use to develop your solution is most important. Use complete English sentences. A sequence of unconnected mathematical expressions does not constitute a proof. Clearly state y
School: University Of Texas
Course: Theory In Programming Practice
CS 337 - Theory in Programming Practice Homework 4 Show all work. The logic you use to develop your solution is most important. 1. Carry out encryption and decryption on message M = 5 using RSA, given p = 3, q = 11 and e = 7. So n = pq = 33, and (n) = 2(1
School: University Of Texas
Course: Theory In Programming Practice
CS 337 - Theory in Programming Practice Homework 5 Solutions 1. Construct DFAs for the following languages. (a) The set of all bit strings containing substring 00 and ending with 01. 1 0 1 1 0 0 2 3 1 4 0 0 1 5 1 (b) The set of all bit strings with 3 cons
School: University Of Texas
Course: Theory In Programming Practice
CS 337 - Theory in Programming Practice Homework 6 Show all work. The logic you use to develop your solution is most important. 1. Exercise 42, chapter 4 1. The rst two languages only contain . The last three languages are the empty language. 2. cfw_, , ,
School: University Of Texas
Course: Theory In Programming Practice
CS 337 - Theory in Programming Practice Homework 9 & Exam 3 Review Show all work. The logic you use to develop your solution is most important. 1. Compute the failure array for search pattern p = aabacabaab. 2. Carry out the KMP algorithm with p = aabacab
School: University Of Texas
Course: Discrete Mathematics
CS 336 Analysis of Programs - Fall 2012 Homework #2 Solutions o o CS 336 Analysis of Programs - Fall 2012 o cfw_x + | x 2 > 5 o cfw_ f : | a s.t. f ( a ) = a o cfw_ f : | x0 s.t. f ( x0 ) = x0 and x , x x0 f ( x) x o cfw_ S | x S , 2 o cfw_S R | x > 100
School: University Of Texas
Course: Discrete Mathematics
CS 336 Analysis of Programs - Spring 2012 Homework #3 Solutions Problem 1. This problem is similar to the version of the rock game, the difference being that the players have one more option, namely to remove two rocks from the same pile. Instead of const
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
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
Homework #13 April 11, 2012 Problem 1 C (n, k ) = n! k!(nk)! Problem 2 C (10, 8) = 10! 8!(108)! = 10! 8!2! = 910 2 = 9 5 = 45 Problem 3 cfw_x, y A, (x, y ) E Problem 4 S = cfw_A V |cfw_x, y A, (x, y ) E 1 Problem 5 X = cfw_x R|3 < x 5 or 9 < x Problem
School: University Of Texas
Course: Discrete Mathematics
Homework #9 March 24, 2012 Problem 1 (a) 22N , since X has cardinality 2N . (b) 22N 1 (c) 2N +1 1 Let M be the set of men and W be the set of women. We know that |M | = |W | = N , so the number of subsets that are entirely men is 2N . Similarly, the numbe
School: University Of Texas
Course: Discrete Mathematics
Homework #8 March 24, 2012 Problem 1 We will prove that a graph with maximum degree at most d can be properly vertex-colored using d + 1 colors by induction on the number of vertices in the graph. (We will hold d constant.) Basis Step. A graph with a sin
School: University Of Texas
Course: Discrete Mathematics
Homework #7 March 23, 2012 Problem 1 y B, x A s.t. f (x) = y x A s.t. f (x) = x x A, y B, f (x) = y <=> g (y ) = x S X, |S | = 1 S1 , S2 X, S1 S2 = S1 S2 S2 S1 Problem 2 Y Y Y Y = cfw_S X | |cfw_x S |x > 0| = |cfw_x S |x < 0| = cfw_S X | s S, s 0 = cfw_S
School: University Of Texas
Course: Discrete Mathematics
CS 336 Analysis of Programs - Fall 2012 Homework #5 Solutions Problem 32, page 330. We will prove that 3 | n 3 2n, n * by induction. Basis Step. For n=1, 3 | 3 13 2 1 . Inductive Step. Assume 3 | n 3 2n for some n * . We will prove that 3 | (n 1) 3 2(n 1)
School: University Of Texas
Course: Discrete Mathematics
CS 336 Analysis of Programs - Fall 2012 Homework #4 Solutions Problem 1. (a) Let A = [ a1 , a 2 ,., a m ] and B = [ b1 , b2 ,., bn ]. Let Ai [a1 , a 2 ,., ai ] (the array containing the first i elements of A) and B j [b1 , b2 ,., b j ] (the array containi
School: University Of Texas
Course: Computer Architecture
ALIAS: BANNER ID: STILT.K.K cpn574 speedup=fenh1 1 speedup =fenh2 2 speedup =fenh3 4 speedup=1/cfw_1- ( used
School: University Of Texas
Course: Introduction To Wireless Networking
Homework 5 Question 1 1) In homework 4, you evaluate a greedy sender using UDP traffic. In this problem, we changed the tcl script to use TCP traffic. Please copy hw5 files using cp r /v/filer4b/v27q001/cs356R/nsallinone-2.35/ns-2.35/hw5 ns-2.35/hw5. Repo
School: University Of Texas
Course: Discrete Mathematics
Lecture Notes for CS 311, Part 8 A Formula for Fibonacci Numbers We would like to nd an explicit formula for Fibonacci numbers. The following terminology will be useful. A generalized Fibonacci sequence is a sequence X0 , X1 , X2 . . . of real numbers suc
School: University Of Texas
Course: Discrete Mathematics
Lecture Notes for CS 311, Part 7 Recursive Denitions A recursive denition of a sequence of numbers expresses some members of that sequence in terms of its other members. For instance, here is a recursive denition of triangular numbers: T0 = 0, Tn+1 = Tn +
School: University Of Texas
Course: Discrete Mathematics
Lecture Notes for CS 311, Part 6 Proofs by Induction Induction is a useful proof method in mathematics and computer science. When we want to prove by induction that some statement containing a variable n is true for all nonnegative values of n, we do two
School: University Of Texas
Course: Discrete Mathematics
Lecture Notes for CS 311, Part 3 Free and Bound Variables When a formula begins with x or x, we say that the variable x is bound in it. If a quantier is followed by several variables then all of them are bound. When a variable is not bound then we say tha
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 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
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
Lecture Notes for CS 311, Part 10 Sets A set is a collection of objects. We write x A if object x is an element of set A, and x A otherwise. The set whose elements are x1 , . . . , xn is denoted by cfw_x1 , . . . , xn . The set cfw_ is called empty and d
School: University Of Texas
Course: Discrete Mathematics
Lecture Notes for CS 311, Part 9 Growth of Functions Let A1 , A2 , . . . and B1 , B2 , . . . be two increasing sequences of positive numbers. We can decide A which of them grows faster by looking at the limit of the ratio Bn as n goes to innity, if this l
School: University Of Texas
Course: Introduction To Wireless Networking
Homework 6 Question 1 Why do we use hexagon-shaped cells? Solution 1 Why do we use hexagon-shaped cells? For a given value of radius, a hexagonshaped shall provide maximum coverage area. Therefore, we can use the fewest number of cells to cover a given ge
School: University Of Texas
Course: Introduction To Wireless Networking
HW 4 modifications in mac-802_11.cc: Inside sendRTS() add the following: /greedily increase NAV by RTSNAVFactor rf->rf_duration = rf->rf_duration * macmib_.getRTSNAVFactor(); Inside sendDATA() add: /greedily increase NAV by DataNAVFactor dh->dh_duration =
School: University Of Texas
Course: Introduction To Wireless Networking
Homework 1 CS356R: Introduction to Wireless Networks (Spring 2014) Assigned: Jan. 16, 2014 Due: Jan. 23, 2014 Please show the intermediate steps, not just the final answers. 1. Convert 10 W (i) into dBm, and (ii) into dBW. (10 points each) 10W = 10^4 mW =
School: University Of Texas
Course: Logic, Sets, And Functions
CS 313k - homework 7 Staple the pages of your solution set together, and put your name and EID on the top of the rst page. Answer each question clearly. The logic you use to produce your answers is the most important thing. 1. For each of the following bi
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Summer 2013 Homework 3 1) Derive, from the recurrence equation of the Fibonacci numbers, a closed equation of these numbers. Sol: The recurrence equation of the Fibonacci numbers is defined as follows: R(0) = 0 (1) R(1) = 1
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Summer 2013 Homework 1 1) Let x and y be two parameters whose values are in the set D = cfw_a,b. Define two predicates P(x,y) and Q(x,y) such that (Exist x, y, P(x,y) and Q(x,y) != (Exist x, y, P(x,y) and (Exist x, y, Q(x,y)
School: University Of Texas
Course: Discrete Mathematics
Mohamed G. Gouda CS 313K Summer 2013 Homework 2 1) Let G=cfw_V,E be a graph where V=cfw_0,1,.,9 E=cfw_(0,1),(1,2),(2,3),(3,4),(4,0), (5,6),(6,7),(7,8),(8,9),(9,5), (0,5),(1,6),(2,7),(3,8),(4,9) Compute the chromatic number of this graph. Explain y
School: University Of Texas
Course: Discrete Mathematics
Lecture Notes for CS 311, Part 11 Equivalence Relations and Partitions An equivalence relation is a relation that is reexive, symmetric, and transitive. A partition of a set A is a collection P of non-empty subsets of A such that every element of A belong
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: 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: 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
-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
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
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
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
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
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: 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: 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