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 Illinois, Urbana Champaign
Course: Vision
Computer Vision CS 543 / ECE 549 Homework 1 Solutions 1. Lighting (20%) A. Answer the following regarding the above image. 1. Point 1 is darker than 2 because point 1 is in shadow. 2. Point 4 is darker than point 3 because point 3 has a darker albedo (ink
School: University Of Illinois, Urbana Champaign
Course: Numerical Analysis
CS 450: Homework #7 Numerical Analysis Spring 2012 Luke Olson : 9:00am - 9:50am MWF Due on May 2, 2011 A homework submission guideline is available on the course website at https:/wiki.engr.illinois.edu/display/cs450sp12/Information All submissions must c
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 8 Answer Sheet This lab is to be worked in a group. Name: _Siyuan Li _ Netid: _sli62_ Section: _AYI_ Part 1 Nested Loops 1. The following C program compiles without errors. Write the output produced by this program. #include <stdio.h> void main(void)
School: University Of Illinois, Urbana Champaign
Course: Vision
Computer Vision CS 543 / ECE 549 Homework 1 Due Feb 14, 2012 Answer the following questions and explain solutions. Numbers in parentheses give maximum credit value. You can discuss in small groups, but turn in individual solutions and indicate collaborato
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2009 Homework 3 Assigned: Oct/1 Due in class Oct/13 Total points: 54 for undergraduate students, 62 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions for
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2014 HW 1 solution (Version: 1.01) 1. (30 pts.) Cut vertices Given a connected undirected graph G = (V, E), vertex u is called a separating vertex , or cut-vertex , if removing u leaves the graph into two or more dis
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS473 Spring 2014 Discussion 11 April 15/16, 2014 1. Suppose we are given an array A[1.m][1.n] of non-negative real numbers such that each row and column sum is an integer. We want to round A to an integer matrix, replacing each entry x in A with either x
School: University Of Illinois, Urbana Champaign
CS 425 Distributed Systems, Fall 2013, University of Illinois at Urbana-Champaign Midterm Review Problems Notes: The midterm will be closed book, closed note. It will last 1 hour and 15 minutes. The midterm paper will contain two types of questions - mult
School: University Of Illinois, Urbana Champaign
MultipleChoiceQuestion 1)d 2)c 3)c 4)a 5)d 6)c 7)a 8)d 9)c 10)a LongAnswers 1)a)P0:1,2,3,4,5,7,13 P1:1,2,3,4,10,11 P2:1,2,3,4,5,6,7,8,9,10 P3:2,3,4,5,6,7,9,12 b)(P1,3)&(P3,3)areconcurrenteventswiththesametimestamp.(P1,4)&(P3,3)are concurrenteventswithdiff
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
More Data Representation 9/12/13 11:21 PM Get Help in as Samantha Siau (https:/learn.illinois.edu/user/profile.php?id=33585) (Logout (https:/learn.illinois.edu/login/logout.php? Status Page (http:/go.illinois.edu/moodlestatus) Like Our New Look? You are
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Conict to Midterm 2: April 9, 2013 Instructions: 1. This is a closed book exam. No notes, books, calculators, etc. are allowed. 2. Answer all problems. You can write I Dont Know for a problem (or its sub-parts)
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
CS125 : Introduction to Computer Science Lecture Notes #2 Architecture and Program Development c 2005, 2004, 2002, 2001 Jason Zych 1 Lecture 2 : Architecture and Program Development Data Encoding The idea of data encoding is to take information in one for
School: University Of Illinois, Urbana Champaign
" MedElite Point of Sale Software Requirements" Introduction! " The MedElite POS is a custom designed software for use in a busy medical practice. The software employs a simple uncomplicated touch screen user interface that is used by nurses who are gene
School: University Of Illinois, Urbana Champaign
Chukwa: A large-scale monitoring system Jerome Boulon jboulon@yahoo-inc.com Yahoo!, inc Andy Konwinski andyk@cs.berkeley.edu UC Berkeley Runping Qi runping@yahoo-inc.com Yahoo!, inc Ariel Rabkin asrabkin@cs.berkeley.edu UC Berkeley Eric Yang eyang@yahoo-i
School: University Of Illinois, Urbana Champaign
Comparing the performance of distributed hash tables under churn Jinyang Li, Jeremy Stribling, Thomer M. Gil, Robert Morris, M. Frans Kaashoek MIT Computer Science and Articial Intelligence Laboratory cfw_jinyang, strib, thomer, rtm, kaashoek@csail.mit.ed
School: University Of Illinois, Urbana Champaign
Megastore: Providing Scalable, Highly Available Storage for Interactive Services Jason Baker, Chris Bond, James C. Corbett, JJ Furman, Andrey Khorlin, James Larson, Jean-Michel Leon, Yawei Li, Alexander Lloyd, Vadim Yushprakh Google, Inc. cfw_jasonbaker,c
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Color John C. Hart CS 418 Intro to Computer Graphics Light Spectrum Cone Response 1.0 log human cone response 0.8 0.6 0.4 0.2 0 400 450 500 550 wavelength 600 650 700 Stockman, MacLeod & Johnson (1993) J. Optical Society of America A, 10, 2491-2521, via W
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Perspective CS418 Computer Graphics John C. Hart Graphics Pipeline ewing Model form Coords World Coords Homogeneous Divide Window to Viewport Still Clip Coords. Window Coordinates Viewing Coords Perspective Distortion Clip Clipping Coords. Viewport Coordi
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Viewing CS418 Computer Graphics John C. Hart Graphics Pipeline Viewing Model Xform Coords World Coords Homogeneous Divide Window to Viewport Still Clip Coords. Window Coordinates Viewing Coords Perspective Distortion Clip Clipping Coords. Viewport Coordin
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Texture Coordinates CS418 Computer Graphics John C. Hart Texture Mapping 1 .7 .6 v (.1,.7) (.1,. 6) 0 0 .1 .2 u 1 (.2,.6) TexGen GLfloat xplane[] = cfw_1,0,0,0; GLfloat yplane[] = cfw_0,1,0,0; glTexGenfv(GL_S,GL_OBJECT_PLANE, xplane); z glTexGenfv(GL_T,GL
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Lighting CS418 Computer Graphics John C. Hart Graphics Pipeline ewing Model form Coords World Coords Homogeneous Divide Window to Viewport Still Clip Coords. Window Coordinates Viewing Coords Perspective Distortion Clip Clipping Coords. Viewport Coordinat
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Hierarchical Modeling CS418 Computer Graphics John C. Hart Build a Robot glPushMatrix(); glPushMatrix(); glScalef(1.0,2.0,1.0); glutSolidCube(2.0); glPopMatrix(); glTranslatef(1.25,2,0.0); glRotatef(shoulder,0,0,1); glPushMatrix(); glTranslatef(0,-1,0.0);
School: University Of Illinois, Urbana Champaign
Fall 2011- Midterm 1 Computer Concepts and Logic 1. Which of the following is NOT a means of secondary storage? a. b. c. d. CD DVD Hard Drive RAM 2. What does the acronym GUI stand for? a. b. c. d. Graphical Unix Interface Graphical User Interface Gradebo
School: University Of Illinois, Urbana Champaign
Course: Distributed Systems
Name: _ CS 425/ECE 428/CSE 424 Fall 2013 Midterm October 15, 2013. 3.30 pm 4.45 pm. (75 minutes) NAME: _ NETID: _ Instructions: 1. Please write your name and netid legibly above, and sign below. Please write your name on the top-right corner of every page
School: University Of Illinois, Urbana Champaign
Course: Distributed Systems
CS 425 Midterm Su2014 NetID: Solution page 1 of 11 CS 425: Distributed Systems Midterm Exam (Summer 2014) Tuesday, July 1, 2014 Name: Solution NetID: You have 75 minutes (1 hour and 15 minutes) to complete this exam. This is a closed-book, closed-notes
School: University Of Illinois, Urbana Champaign
Spring 2012 CS 105 Midterm 1 Page 1 of 17 February 21st, 2012 1. Name: FORM A DO NOT open this packet UNTIL the proctor instructs you to. READ and complete the following: Bubble your Scantron only with a #2 pencil. On Scantron, bubble : 1. Your Name 2. Yo
School: University Of Illinois, Urbana Champaign
Course: Database Systems
CS411 Final Project Report 1. Briefly describe what the project accomplished. "Let us help you build up course schedule based on your own preferences. Smart Course sorts courses based on user's own preferences such as time availability, course level requi
School: University Of Illinois, Urbana Champaign
Course: Vision
Computer Vision CS 543 / ECE 549 Homework 1 Solutions 1. Lighting (20%) A. Answer the following regarding the above image. 1. Point 1 is darker than 2 because point 1 is in shadow. 2. Point 4 is darker than point 3 because point 3 has a darker albedo (ink
School: University Of Illinois, Urbana Champaign
Course: Numerical Analysis
CS 450: Homework #7 Numerical Analysis Spring 2012 Luke Olson : 9:00am - 9:50am MWF Due on May 2, 2011 A homework submission guideline is available on the course website at https:/wiki.engr.illinois.edu/display/cs450sp12/Information All submissions must c
School: University Of Illinois, Urbana Champaign
Course: Vision
Computer Vision CS 543 / ECE 549 Homework 1 Due Feb 14, 2012 Answer the following questions and explain solutions. Numbers in parentheses give maximum credit value. You can discuss in small groups, but turn in individual solutions and indicate collaborato
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2009 Homework 3 Assigned: Oct/1 Due in class Oct/13 Total points: 54 for undergraduate students, 62 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions for
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2014 HW 1 solution (Version: 1.01) 1. (30 pts.) Cut vertices Given a connected undirected graph G = (V, E), vertex u is called a separating vertex , or cut-vertex , if removing u leaves the graph into two or more dis
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 6 Solutions Fall 2013 1. Describe data structures that support Lookup in O(1) worst-case time and the other two operations in the following time bounds. (a) The worst-case time for both BLACKEN and NEXTWHITE is O(log n). Solution (balanced
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 8 Answer Sheet This lab is to be worked in a group. Name: _Siyuan Li _ Netid: _sli62_ Section: _AYI_ Part 1 Nested Loops 1. The following C program compiles without errors. Write the output produced by this program. #include <stdio.h> void main(void)
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 7 Answer Sheet Name: _Siyuan Li _ Netid: _sli62_ Section: _AYI_ Part 1: Doing Loops and Random Numbers 1. Run your program and enter 75 as input. Write down the results your program displays. _59_ _34_ _41_ _3_ _29_ 2. Rewrite the program in the loop
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Name: _Siyuan Li_NetID: _SLI62_ Section#: _AYI_ Part 1 Programming the function 'find_xy' . The first two steps involve writing out the math behind find_xy. 1. Write down the five equations. _ HF(yL - y1) /d1 + HF(y2 - y1)/d2=W1 _ _ HF(y1 - y2) /d2 + HF(y
School: University Of Illinois, Urbana Champaign
Course: Intro Computing : Engineering And Science
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab Activity 4 - Answers Name: _Ben Domash_ NetID: _bdomash2_ Section#: _AYL_ Part 1: Programming the find_h function 1. 1. Write down the five equations (by plugging in i from 1 to 5): For example your first equation (for i = 1) should look like this: _K
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab Activity 4 - Answers Name: _Ben Domash_ NetID: _bdomash2_ Section#: _AYL_ Part 1: Programming the find_h function 1. 1. Write down the five equations (by plugging in i from 1 to 5): For example your first equation (for i = 1) should look like this: _K
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS#105#!Fall$2013!Machine!Problem!4" 50#points" Submission!Deadline:!Monday,!October!28nd,!2013!6pm! 10%!deduction!of!earned!points!if!variables!do!not!follow!CS105!convention!or!if!Option! Explicit!is!not!present.!The!checker!you're!given!does!look!for!t
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
CS412 Mini MP 1 Knowing your data The MP borrows quite considerable amount of material from a certain source. We will publish the source after the submissions due date because it contains answers for a few questions. Dont try to find the existing answers
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
CS412 Mini MP 1 Knowing your data The MP borrows quite considerable amount of material from a certain source. We will publish the source after the submissions due date because it contains answers for a few questi
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Computer Science 105 (CS105) Fall 2013 Syllabus Instructors: Kai Zhao zhaok@illinois.edu talguy2@illinois.edu (Typo in printed version) guytal2@illinois.edu TAs: Megha Ailavajhala (ailavaj2@illinois.edu) Dhashrath Raguraman (raguram2@illinois.edu) Parimal
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
0 97 95 1 83 99 2 79 81 3 72 84 4 92 84 5 78 91 6 79 89 7 68 67 8 78 76 9 77 81 10 75 83 11 90 99 12 85 84 13 77 100 14 89 86 15 86 87 16 65 87 17 67 94 18 67 76 19 93 93 20 83 91 21 97 100 22 86 89 23 61 43 24 85 77 25 96 90 26 79 98 27 61 68 28 93 93 29
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
supermarket item_1 item_2 item_3 item_4 item_5 item_6 item_7 item_8 item_9 item_10 item_11 item_12 item_13 item_14 item_15 item_16 item_17 item_18 item_19 item_20 item_21 item_22 item_23 item_24 item_25 item_26 item_27 item_28 item_29 item_30 item_31 item
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Computer Science 105 (CS105) Fall 2012 Syllabus Instructors: Kai Zhao Aishwarya Stanley 2211 Siebel Center 2211 Siebel Center zhaok@illinois.edu astanle2@illinois.edu Email the instructor or TA for the section that you are enrolledyou may be penalized for
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Computer Science 105 (CS105) Fall 2013 Syllabus Instructors: Kai Zhao zhaok@illinois.edu Guy Tal guytal2@illinois.edu (Typo in printed version) talguy2@illinois.edu TAs: Megha Ailavajhala (ailavaj2@illinois.edu) Dhashrath Raguraman (raguram2@illinois.edu)
School: University Of Illinois, Urbana Champaign
Course: Data Structures
HCM UT HCM NU Faculty of Applied Science Department of Math Applied Ho Chi Minh City, 18 December 2008 Syllabus M ATH 385 INTRO DIFFERENTIAL EQUATIONS Credit Class Hours Overall Grade : 3 (2.1.5) Theory: 28 Exercises: 14 42 Consultation: 1 class hours per
School: University Of Illinois, Urbana Champaign
Course: Vision
Computer Vision CS 543 / ECE 549 Homework 1 Solutions 1. Lighting (20%) A. Answer the following regarding the above image. 1. Point 1 is darker than 2 because point 1 is in shadow. 2. Point 4 is darker than point 3 because point 3 has a darker albedo (ink
School: University Of Illinois, Urbana Champaign
Course: Numerical Analysis
CS 450: Homework #7 Numerical Analysis Spring 2012 Luke Olson : 9:00am - 9:50am MWF Due on May 2, 2011 A homework submission guideline is available on the course website at https:/wiki.engr.illinois.edu/display/cs450sp12/Information All submissions must c
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 8 Answer Sheet This lab is to be worked in a group. Name: _Siyuan Li _ Netid: _sli62_ Section: _AYI_ Part 1 Nested Loops 1. The following C program compiles without errors. Write the output produced by this program. #include <stdio.h> void main(void)
School: University Of Illinois, Urbana Champaign
Course: Vision
Computer Vision CS 543 / ECE 549 Homework 1 Due Feb 14, 2012 Answer the following questions and explain solutions. Numbers in parentheses give maximum credit value. You can discuss in small groups, but turn in individual solutions and indicate collaborato
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2009 Homework 3 Assigned: Oct/1 Due in class Oct/13 Total points: 54 for undergraduate students, 62 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions for
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2014 HW 1 solution (Version: 1.01) 1. (30 pts.) Cut vertices Given a connected undirected graph G = (V, E), vertex u is called a separating vertex , or cut-vertex , if removing u leaves the graph into two or more dis
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 7 Answer Sheet Name: _Siyuan Li _ Netid: _sli62_ Section: _AYI_ Part 1: Doing Loops and Random Numbers 1. Run your program and enter 75 as input. Write down the results your program displays. _59_ _34_ _41_ _3_ _29_ 2. Rewrite the program in the loop
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 6 Solutions Fall 2013 1. Describe data structures that support Lookup in O(1) worst-case time and the other two operations in the following time bounds. (a) The worst-case time for both BLACKEN and NEXTWHITE is O(log n). Solution (balanced
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Name: _Siyuan Li_NetID: _SLI62_ Section#: _AYI_ Part 1 Programming the function 'find_xy' . The first two steps involve writing out the math behind find_xy. 1. Write down the five equations. _ HF(yL - y1) /d1 + HF(y2 - y1)/d2=W1 _ _ HF(y1 - y2) /d2 + HF(y
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2013 Homework 3 Assigned: Oct/1 Due in class Oct/15 Total points: 52 for undergraduate students, 62 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions for
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
CS 173 Discrete Structures Fall 2013: Homework 1 Solutions 1. Direct Proof : An integer is said to be divisible by 3 if there is some integer m such that x = 3 m. Show that for any integers x, y, z such that x + y + z is divisible by 3, 100x + 10y + z is
School: University Of Illinois, Urbana Champaign
Course: Intro Computing : Engineering And Science
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Fundamental Algorithms, Spring 2011 HW 4 Homework is due by Monday, 23:59:59, February 21 Problem 1 is due by Sunday, 23:59:59, February 20 This homework contains four problems. Read the instructions for submitting homework on the course webpage.
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab Activity 4 - Answers Name: _Ben Domash_ NetID: _bdomash2_ Section#: _AYL_ Part 1: Programming the find_h function 1. 1. Write down the five equations (by plugging in i from 1 to 5): For example your first equation (for i = 1) should look like this: _K
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
CS 412 HW3 Yuwei Chen (chen202) 1. Brief (very brief) introduction of the methods in your general purpose classification framework I used Decision Tree (C4.5) as basic method, Random Forest as the ensemble version of the classification method.
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473 Homework 10 Solutions Spring 2010 1. Show that 2SAT is NP-hard, or describe a polynomial-time algorithm to solve it. Solution: We describe a polynomial-time algorithm to solve 2SAT. Given a 2CNF boolean formula , the implication graph G is dened as
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 4 (due March 2, 2010) Spring 2010 1. Suppose we want to write an efcient function SHUFFLE(n) that returns a permutation of the set cfw_1, 2, . . . , n chosen uniformly at random. (a) Prove that the following algorithm is not correct. [Hint
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2009 Homework 4 Assigned: Oct/23 Due in class Nov/3 Total points: 48 for undergraduate students, 58 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions for
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Algorithms, Fall 2010 HW 1 (due Tuesday, September 7th) This homework contains four problems. Read the instructions for submitting homework on the course webpage. In particular, make sure that you write the solutions for the problems on separate s
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 2 Solutions Spring 2014 1. Kris is a professional rock climber who is competing in the U.S. climbing nationals. The competition requires him to complete the following task: He is given a set of n holds that he might use to create a route w
School: University Of Illinois, Urbana Champaign
Course: Embedded Systems
CS 431 Homework #1 Spring 2014 Due: Tuesday, Feb 11, 2014 at 4:00pm. Handin at CS 431 dropbox in SC basement. Please type or neatly write your solutions. Anything that we cannot read or easily follow will receive no credit. Show your work to receive full
School: University Of Illinois, Urbana Champaign
CS 374 Homework 6 Solutions Fall 2014 1. Describe and analyze an algorithm to compute the maximum total reward that the organizers could be forced to pay, given the array M [1 . n, 1 . n] as input. Solution: Let MaxR(i, j) be the maximum possible reward i
School: University Of Illinois, Urbana Champaign
Course: Algorithms
\documentclass[11pt]cfw_article %\usepackagecfw_pstricks,pst-node \usepackagecfw_alltt,fullpage,graphics,color,epsfig,amsmath, amssymb \usepackagecfw_boxedminipage %\newcommandcfw_\edgee[1]cfw_\begincfw_math\stackrelcfw_#1cfw_\longrightarrow\endcfw_math \
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Algorithms, Fall 2010 HW 9 (due Tuesday, November 16) This homework contains four problems. Read the instructions for submitting homework on the course webpage. In particular, make sure that you write the solutions for the problems on separate she
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Algorithms, Fall 2010 HW 1 (due Tuesday, September 7th) This homework contains four problems. Read the instructions for submitting homework on the course webpage. In particular, make sure that you write the solutions for the problems on separate s
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2009 Homework 2 Assigned: Sept/15 Due in class Sept/29 Total points: 40 for undergraduate students, 44 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions f
School: University Of Illinois, Urbana Champaign
CS 573: Graduate Algorithms, Fall 2011 HW 1 (due Tuesday, September 13th) This homework contains ve problems. Read the instructions for submitting homework on the course webpage. In particular, make sure that you write the solutions for the problems on se
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab Activity 4 - Answers Name: _Ben Domash_ NetID: _bdomash2_ Section#: _AYL_ Part 1: Programming the find_h function 1. 1. Write down the five equations (by plugging in i from 1 to 5): For example your first equation (for i = 1) should look like this: _K
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file heap.cpp * Implementation of a heap class. */ #include <math.h> template <class T, class Compare> size_t heap<T, Compare>:root() const cfw_ / @todo Update to return the index you are choosing to be your root. return 1; template <class T,
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 2 Solutions Rubric (for all dynamic programming problems): For a problem worth 10 points: 6 points for a correct recurrence, described either using mathematical notation or as pseudocode for a recursive algorithm. 1 point for a clear Eng
School: University Of Illinois, Urbana Champaign
CS 573 Homework 5 (due November 19, 2010) Fall 2010 CS 573: Graduate Algorithms, Fall 2010 Homework 5 Due Friday, November 19, 2010 at 5pm (in the homework drop boxes in the basement of Siebel) 1. Suppose we are given a set of boxes, each specied by their
School: University Of Illinois, Urbana Champaign
Fall 2011- Midterm 1 Computer Concepts and Logic 1. Which of the following is NOT a means of secondary storage? a. b. c. d. CD DVD Hard Drive RAM 2. What does the acronym GUI stand for? a. b. c. d. Graphical Unix Interface Graphical User Interface Gradebo
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
CS412: Introduction to Data Mining Fall 2012 Assignment 4 Solution Handed Out: November 20th , 2012 Due: Dec 10th , 2012 1. [k-Nearest Neigbhor and Support Vector Machine - 14 points] Suppose we are given a training set as follows i x1 12 24 35 48 66 x2 l
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2013 Homework 3 Assigned: Oct/1 Due in class Oct/15 Total points: 52 for undergraduate students, 62 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions for
School: University Of Illinois, Urbana Champaign
Course: Vision
Solution to Homework 2 March 8, 2012 1 A feature tracker (50pt) 1.1 Keypoint Selection (15pt) Algorithm summary: Compute Harris keypoints Given the input image, compute gradient Ix and Iy Construct the second moment matrix, convoluted with Gaussian lter:
School: University Of Illinois, Urbana Champaign
CS 573: Graduate Algorithms, Fall 2011 HW 4 (due in class on Tuesday, November 1st) This homework contains ve problems. Read the instructions for submitting homework on the course web page. In particular, make sure that you write the solutions for the pro
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS473 Spring 2014 Discussion 11 April 15/16, 2014 1. Suppose we are given an array A[1.m][1.n] of non-negative real numbers such that each row and column sum is an integer. We want to round A to an integer matrix, replacing each entry x in A with either x
School: University Of Illinois, Urbana Champaign
Course: Numerical Methods
How to program functions. How do the built-in functions sqrt and diff work? What is the .^ operator? Can a function return more than one array ? Readings: Matlab by Gilat Chapter 6 (except 6.3) 3-2 1. Problem Definition Write a function named trunc that t
School: University Of Illinois, Urbana Champaign
Course: Algorithms
\documentclass[11pt]cfw_article %\usepackagecfw_pstricks,pst-node \usepackagecfw_alltt,fullpage,graphics,color,epsfig,amsmath, amssymb \usepackagecfw_boxedminipage %\newcommandcfw_\edgee[1]cfw_\begincfw_math\stackrelcfw_#1cfw_\longrightarrow\endcfw_math \
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS473 Spring 2014 Homework 9 Solutions and Rubric 1. Problem 7.17 from Kleinberg-Tardos book. We could type up the problem for you but Kleinberg-Tardos book has a very nice chapter on ows and also numerous interesting problems so take this opportunity to
School: University Of Illinois, Urbana Champaign
Course: Numerical Analysis
CS 450 / MATH 450 / CSE 401 / ECE 491 Fall 2013 Numerical Analysis Homework 1 Instructor: Luke Olson University of Illinois at Urbana-Champaign Due: 09/20/2013 5:00 PM Submission Notes: Each problem solution should be submitted in a separate PDF le. Eac
School: University Of Illinois, Urbana Champaign
Course: Vision
Computer Vision CS 543 / ECE 549 Homework 3 Due Mar 13, 2012 Answer the following questions and explain solutions. Numbers in parentheses give maximum credit value. You can discuss in small groups, but turn in individual solutions and indicate collaborato
School: University Of Illinois, Urbana Champaign
CS 473 Head-Banging 1 (January 27 and 28, 2009) Spring 2009 1. An inversion in an array A[1 . n] is a pair of indices (i , j ) such that i < j and A[i ] > A[ j ]. The n number of inversions in an n-element array is between 0 (if the array is sorted) and 2
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
CS412: An Introduction to Data Warehousing and Data Mining Fall 2013 Assignment 2 Yanglei Song Handed In: 10/08/2013 Question 1 Assume a base cuboid of 10 dimensions contains only two base cells: (1) (a1 , a2 , a3 , b4 , ., b9 , b10 ), and (2) (b1 , b2 ,
School: University Of Illinois, Urbana Champaign
Course: Algorithms
HW 7 (due Tuesday, at noon, April 1st, 2014) CS 473: Fundamental Algorithms, Spring 2014 Version: 1.0 1. (30 pts.) Bottleneck Spanning Tree. Let G = (V, E) an undirected edge-weighted graph. The bottleneck weight of a spanning tree T is the weight of the
School: University Of Illinois, Urbana Champaign
CS 425 Distributed Systems, Fall 2013, University of Illinois at Urbana-Champaign Midterm Review Problems Notes: The midterm will be closed book, closed note. It will last 1 hour and 15 minutes. The midterm paper will contain two types of questions - mult
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Algorithms, Fall 2010 HW 3 Solutions 1. (25 pts) Suppose we have a stack of n pancakes of different sizes. We want to sort the pancakes so that the uppose we have a staareof n pancakethe largernpancakes. want tonly toperation weocan perform is sma
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 4 November 29, 2011-11-29 ABE 224 Jialing Ye Runoff Measurement and Erosion Evaluation Objectives Measure runoff from bare soil and soil with erosion control blanket (ECB), and investigate soil loss and the effects of ECBs on soil erosion. Materials a
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 6 (due October 23, 2013) Fall 2013 1. Suppose we want to maintain an array X [1.n] of bits, which are all initially subject to the following operations. LOOKUP(i): Given an index i, return X [i]. BLACKEN(i): Given an index i < n, set X [
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Algorithms, Fall 2010 HBS 3 Problem 1. [Recurrences] Solve the following recurrences. T (n) = 5T (n/4) + n and T (n) = 1 for 1 n < 4. T (n) = 2T (n/2) + nlogn T (n) = 2T (n/2) + 3T (n/3) + n2 Problem 2. [Tree Traversal] Let T be a rooted binary tr
School: University Of Illinois, Urbana Champaign
Course: Discrete Math
CS 173: Discrete Structures Viraj Kumar Margaret Fleck Lucas Cook, Samer Fanek, Chen Li, Lance Pittman, Dan Schreiber Rick Barber, Efe Karakus, Adair Liu, Andrew Pikler 1 What is CS 173 about? Were going to learn: 1. Basic mathematical objects and techni
School: University Of Illinois, Urbana Champaign
Course: Data Structures
CS 225 Fall 2013 Homework 0 Due Sept 4, 2013 in lecture and SVN Instructions for submission into your class SVN repository are on the webpage. The purpose of this assignment is to give you a chance to refresh the math skills we expect you to have learned
School: University Of Illinois, Urbana Champaign
Course: Algorithms
HW 2 (due Tuesday, at noon, February 11, 2014) CS 473: Fundamental Algorithms, Spring 2014 This homework contains three problems. Read the instructions for submitting homework on the course webpage. In particular, make sure that you write the solutions fo
School: University Of Illinois, Urbana Champaign
Course: Distributed Systems
Name: _ CS 425/ECE 428/CSE 424 Fall 2013 Midterm October 15, 2013. 3.30 pm 4.45 pm. (75 minutes) NAME: _ NETID: _ Instructions: 1. Please write your name and netid legibly above, and sign below. Please write your name on the top-right corner of every page
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Fundamental Algorithms, Spring 2011 HW 2 Homework is due by Monday, 23:59:59, February 7 Problem 1 is due by Sunday, 23:59:59, February 6 This homework contains four problems. Read the instructions for submitting homework on the course webpage. Co
School: University Of Illinois, Urbana Champaign
Course: Distributed Systems
Replica Management Digital Signature: Authentic: Signer deliberately signed the document and has not Goals: Replication Transparency User/client need not know that multiple physical been altered by anyone; Unforgeable: No one else signed the document; Non
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
CS446: Machine Learning Fall 2013 Problem Set 1 Handed Out: September 5, 2013 Due: September 19, 2013 Feel free to talk to other members of the class in doing the homework. I am more concerned that you learn how to solve the problem than that you demonst
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS473 Spring 2014 Discussion 11 April 15/16, 2014 1. Suppose we are given an array A[1.m][1.n] of non-negative real numbers such that each row and column sum is an integer. We want to round A to an integer matrix, replacing each entry x in A with either x
School: University Of Illinois, Urbana Champaign
CS 425 Distributed Systems, Fall 2013, University of Illinois at Urbana-Champaign Midterm Review Problems Notes: The midterm will be closed book, closed note. It will last 1 hour and 15 minutes. The midterm paper will contain two types of questions - mult
School: University Of Illinois, Urbana Champaign
MultipleChoiceQuestion 1)d 2)c 3)c 4)a 5)d 6)c 7)a 8)d 9)c 10)a LongAnswers 1)a)P0:1,2,3,4,5,7,13 P1:1,2,3,4,10,11 P2:1,2,3,4,5,6,7,8,9,10 P3:2,3,4,5,6,7,9,12 b)(P1,3)&(P3,3)areconcurrenteventswiththesametimestamp.(P1,4)&(P3,3)are concurrenteventswithdiff
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
More Data Representation 9/12/13 11:21 PM Get Help in as Samantha Siau (https:/learn.illinois.edu/user/profile.php?id=33585) (Logout (https:/learn.illinois.edu/login/logout.php? Status Page (http:/go.illinois.edu/moodlestatus) Like Our New Look? You are
School: University Of Illinois, Urbana Champaign
Answers to textbook exercise questions: 2.2, 2.3, 2.4, 2.6, 3.3, 3.6, 3.8, 4.3, 4.4, 5.1, 5.4, 6.1 12 CHAPTER 2. GETTING TO KNOW YOUR DATA The measures of dispersion described here were obtained from: Statistical Methods in Research and Production, fourth
School: University Of Illinois, Urbana Champaign
Course: Database Systems
CS411 Database Systems 05: Relational Schema Design Ch. 3.1-3.5, except 3.4.2 - 3.4.3 and 3.5.3. 1 Motivation We have designed ER diagram, and translated it into a relational db schema R = set of R1, R2, . Now what? We can do the following implement R
School: University Of Illinois, Urbana Champaign
SPECTRUM MANAGEMENT AND WIRELESS HISTORY http:/en.wikipedia.org/wiki/Telecommunications_in_India http:/telecomtalk.info/history-of-indian-telecommunication/67789/ http:/www.cse.iitd.ac.in/~pkalra/OLD-COURSES/siv864-2010/session-08-12.pdf http:/www.kakani.
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Fractal Modeling CS 418 Intro to Computer Graphics John C. Hart Fractal Dimension Self-similarity dimension Make a D dimensional object out of N smaller copies scaled by s N = (1/s)D Can solve for dimension D s=1 s=1/2 s=1/3 N=1 N=1 N=1 N=1 N=2 N=3 N=1 N=
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Meshes CS418 Computer Graphics John C. Hart Simple Meshes Cylinder (x,y,z) = (cos , sin , z) Cone (x,y,z) = (|z| cos , |z| sin , z) Sphere (x,y,z) = (cos cos , cos sin , sin ) Torus (x,y,z) = (R + cos ) cos ,(R + cos ) sin , sin ) Good Meshes Manifold: 1
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Volume and Solid Modeling CS418 Computer Graphics John C. Hart Implicit Surfaces f=0 1 f<0 (0,0) Real function f (x,y,z) Classifies points in space Image synthesis (sometimes) inside f > 0 outside f < 0 on the surface f = 0 CAGD: inside f < 0, outside
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Quaternions John C. Hart CS 318 Interactive Computer Graphics Rigid Body Dynamics Rigid bodies Center of gravity Location in space Inflexible Orientation in space Rigid body dynamics Force applied to object relative to center of gravity Rotation in space
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Animation CS418 Computer Graphics John C. Hart Keyframe Animation Set target positions for vertices at key frames in animations Linearly interpolate vertex positions between targets at intervening frames Lots can go wrong (like the feet) Can be fixed by a
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Parametric Curves CS 318 Interactive Computer Graphics John C. Hart Linear Interpolation p1=(x1,y1) Need to get from point p0 to point p1 Define a parametric function p(t) p(0) = p0, p(1) = p1 y Separate into coordinate functions p(t) = (x(t), y(t) x(0
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Lynwood Dunn (1904-1998) Visual effects pioneer Acme-Dunn optical printer 25% transparent yellow The Over Operator How to indicate which parts of front picture are clear and which are opaque Use alpha channel to indicate opacity [Smith] Over operator [Por
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Parametric Surfaces CS 318 Intro to Computer Graphics John C. Hart Space Curves y Separate into three coordinate functions p(t) = (x(t), y(t), z(t) x(t) = (1-t)3 x0 + 3t(1-t)2 x1 + 3t2(1-t) x2 + t3 x3 z x y(t) = (1-t)3 y0 + 3t(1-t)2 y1 + 3t2(1-t) y2 + t3
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Blossoms CS 419 Advanced Topics in Computer Graphics John C. Hart Borrowed somewhat from Tom Sederbergs notes de Casteljau de Casteljau algorithm evaluates a point on a Bezier curve by scaffolding lerps Blossoming renames the control and intermediate po
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Skinning CS418 Computer Graphics John C. Hart Simple Inverse Kinematics Given target point (x,y) in position space, what are the parameters (q,f) in configuration space that place the hand on the target point? Use Law of Cosines to find q d2 = a2 + b2 2ab
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Final Exam: 7pm-10pm, May 3, 2013 David Kinley Hall, Room 114 Instructions: This is a closed book exam. No notes, books, calculators, cellphones, computers, mirrors, owers, etc. are allowed. You are allowed to
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Conict Final Exam: 7pm-10pm, May 6, 2013 English Building, Room 160 Instructions: This is a closed book exam. No notes, books, calculators, cellphones, computers, mirrors, owers, etc. are allowed. You are allo
School: University Of Illinois, Urbana Champaign
Course: Algorithms
! !" !#" ( *+$ # - /01$2 ! # / 45 7 $/ "% ) # , . ( # /) (" $&'$ ( 3 "6 )". $ " #$%&'()* 8( &
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Linearizability By Mila Oren 1 Outline Sequential and concurrent specifications. Define linearizability (intuition and formal model). Composability. Compare linearizability to other correctness condition. 2 Motivation An object in languages such as Jav
School: University Of Illinois, Urbana Champaign
Course: Algorithms
1 Shared memory Mutual Exclusion CSCE 668 Prof. Jennifer Welch Shared Memory Model 2 Processors communicate via a set of shared variables, instead of passing messages. Each shared variable has a type, defining a set of operations that can be performed ato
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Average Consensus Consider n nodes 1, 2, 3, , n, with xi denoting the input ofn node i. The goal for average x consensus is to compute the average of the inputs, namely, i=1 i . n It is assumed that the system is synchronous, and the links are reliable. T
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS410 TextInformationSystems (Spring2015) Instructor:ChengXiang(Cheng)Zhai FulltimeTAs:SeanMassung,NikitaSpirin,RongdaZhu ParttimeTAs:XueqingLiu,YinanZhang DepartmentofComputerScience UniversityofIllinois,UrbanaChampaign Goal&Design IntroduceTextInformati
School: University Of Illinois, Urbana Champaign
Course: Special Topics
ResearchProblems&Topics (WebDomain) (CS598CXZAdvancedTopicsinIRPresentation) Jan.25,2005 ChengXiangZhai Department of Computer Science UniversityofIllinois,UrbanaChampaign FacultyHomepage Classification/Finding Theproblemis,toclassifythefacultyhomepages f
School: University Of Illinois, Urbana Champaign
Course: Special Topics
OverviewofInformationRetrieval (CS598CXZAdvancedTopicsinIRPresentation) Jan.18,2005 ChengXiangZhai Department of Computer Science UniversityofIllinois,UrbanaChampaign WhatisInformationRetrieval(IR)? Narrowsense: IR=SearchEngineTechnologies(IR=Google,libr
School: University Of Illinois, Urbana Champaign
Course: Special Topics
ResearchProblems&Topics (LiteratureDomain) (CS598CXZAdvancedTopicsinIRPresentation) Feb1,2005 ChengXiangZhai Department of Computer Science UniversityofIllinois,UrbanaChampaign ResearchAreaMining Thereareallkindsofresearchbranchesforonedepartment,forexamp
School: University Of Illinois, Urbana Champaign
Course: Special Topics
ResearchProblems&Topics (EmailDomain) (CS598CXZAdvancedTopicsinIRPresentation) Jan.27,2005 ChengXiangZhai Department of Computer Science UniversityofIllinois,UrbanaChampaign AutomaticEmailReplying Ifthisproblemissolvedwell,informationserviceor technicalsu
School: University Of Illinois, Urbana Champaign
Course: Special Topics
RealWorldIRChallenges (CS598CXZAdvancedTopicsinIRPresentation) Jan.20,2005 ChengXiangZhai Department of Computer Science UniversityofIllinois,UrbanaChampaign Therearemanyresearchproblems toworkon. Itsmorebeneficialtothesocietyif weworkonproblemsthatreflec
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Understand how structure data types are implemented in C. Use . operator to access members of a structure. See how to declare pointers to structure variables. Use -> operator to access members of a structure when using pointers. Related Chapter: ABC 9.1
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Know how to declare pointer variables. Understand the & (address) and *(indirection) operators. Dynamic Memory Allocation Related Chapter: ABC 6.2 6.6, 6.8, 6.10, 6.11, 6.15 19&20-2 Pointer variables are variables that store memory addresses. Pointers va
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
What is the Matlab environment? How can you create vectors ? What does the colon : operator do? How does the use of the built-in linspace function differ from the use of the colon : operator? Readings: Matlab by Pratap Chapter 3 1-2 1) engineering visuali
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
What are relational operators and logical values? How to use the input and disp functions. Learn to use if, if-else and else-if conditional statements. What are logical operators? Using while to perform loops. Readings: Matlab by Pratap Chapters 3.2.2, 3.
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Tom Gambill 2209 Siebel Center 244-3541 gambill@illinois.edu All relevant class information is presented on the CS 101 web site. http:/courses.engr.illinois.edu/cs101/sp2015/ Check the web site at least once every three days for updates. 0-2 Teaching Assi
School: University Of Illinois, Urbana Champaign
CS 425/ECE 428: Distributed Systems Recommended Programming Assignment 0 (MP0) No due date. This MP0 will not be graded. No credit assigned to MP0. If you are not familiar with socket programing: This assignment is strongly recommended for stu
School: University Of Illinois, Urbana Champaign
Course: User Interface Design
Typography Brian Bailey Announcements Signup for demonstration of prototype link is on the main course web page I2CS should work with TA to: conduct remote demonstration, make executable available to run locally, or make a narrated video HW3 due Nov.
School: University Of Illinois, Urbana Champaign
Course: Text Information Systems
Information Extraction and Integration: an Overview William W. Cohen Carnegie Mellon University April 26, 2004 Example: The Problem Martin Baker, a person Genomics job Employers job posting form Example: A Solution Extracting Job Openings from the Web foo
School: University Of Illinois, Urbana Champaign
Course: Text Information Systems
User Interface & Visualization (Lecture for CS410 Text Info Systems) ChengXiang Zhai Department of Computer Science University of Illinois, Urbana-Champaign Conceptual Framework of Text Information Systems (TIS) Retrieval Applications Visualization Summar
School: University Of Illinois, Urbana Champaign
Course: Text Information Systems
Chapter11:OpinionMining Bing Liu Department of Computer Science University of Illinois at Chicago liub@cs.uic.edu Introductionfactsandopinions Two main types of textual information on the Web. Current search engines search for facts (assume they are true)
School: University Of Illinois, Urbana Champaign
Course: Text Information Systems
Note-2: Natural Language Processing and Text Information Systems Department of Computer Science University of Illinois at Urbana-Champaign czhai@illinois.edu ChengXiang Zhai 1. WHAT IS NATURAL LANGUAGE PROCESSING(NLP)? Natural language processing (NLP) is
School: University Of Illinois, Urbana Champaign
Course: Discrete Math
CS 173: Discrete Structures, Fall 2012 Exam 1 Review These problems are to help you review for the rst midterm. They should not be handed in. 1. Set Operations Suppose you were given the following sets: A B C D = = = = cfw_Piano, (Violin, Viola, Cello), G
School: University Of Illinois, Urbana Champaign
Course: Discrete Math
CS 173: Discrete Structures, Fall 2012 Final Review Problems These problems should not be turned in. They are to help you review for the nal. 1. Counting problems (a) Let M = cfw_a, b, c, d. How many dierent partitions of M are there? (b) In the game Tic-
School: University Of Illinois, Urbana Champaign
Course: Discrete Math
CS 173, Fall 2012 Midterm 2 Review Solutions 1. Set Inclusion Proofs Let f : X Y be any function, and let A and B be subsets of X. For any subset S of X dene its image f (S) by f (S) = cfw_f (s) Y | s S. (a) Prove that f (A B) f (A) f (B). You must use th
School: University Of Illinois, Urbana Champaign
Course: Discrete Math
CS 173 Fall 2012 Review problems for the second midterm 1. Set Inclusion Proofs Let f : X Y be any function, and let A and B be subsets of X. For any subset S of X dene its image f (S) by f (S) = cfw_f (s) Y | s S. (a) Prove that f (A B) f (A) f (B). You
School: University Of Illinois, Urbana Champaign
Course: Discrete Math
CS 173: Discrete Structures, Fall 2012 Exam 1 Review Solutions 1. Set Operations Suppose you were given the following sets: A B C D = = = = cfw_Piano, (Violin, Viola, Cello), Guitar cfw_(Flute, Piccolo), Cymbals cfw_Piano, Flute cfw_(Violin, Viola, Cello)
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
CS125Quiz1Review Lecture 1: An algorithm is a step-by-step procedure (with a finite number of steps) that, when followed from beginning to end, solves a particular problem Primitives these are the lowest-level data values and procedures provided by a prog
School: University Of Illinois, Urbana Champaign
Course: Cs 173
CS 173: Discrete Structures, Spring 2014 Final review solutions These problems should not be turned in. They are to help you review for the nal. 1. Counting problems (a) Let M = cfw_a, b, c, d. How many dierent partitions of M are there? Solution: There a
School: University Of Illinois, Urbana Champaign
Course: Cs 173
CS 173, Spring 2014 Midterm 2 Review Solutions 1. Counting (a) In our role-playing game, an evil character may be an elf or a troll, it may be red, green, brown, or black, and it may have scales or hair. A good character may be an elf or a human or a lion
School: University Of Illinois, Urbana Champaign
Chapter 5 Sets So far, weve been assuming only a basic understanding of sets. Its time to discuss sets systematically, including a useful range of constructions, operations, notation, and special cases. Well also see how to compute the sizes of sets and p
School: University Of Illinois, Urbana Champaign
Chapter 3 Proofs Many mathematical proofs use a small range of standard outlines: direct proof, examples/counter-examples, and proof by contrapositive. These notes explain these basic proof methods, as well as how to use denitions of new concepts in proof
School: University Of Illinois, Urbana Champaign
Chapter 4 Number Theory Weve now covered most of the basic techniques for writing proofs. So were going to start applying them to specic topics in mathematics, starting with number theory. Number theory is a branch of mathematics concerned with the behavi
School: University Of Illinois, Urbana Champaign
Chapter 2 Logic This chapter covers propositional logic and predicate logic at a basic level. Some deeper issues will be covered later. 2.1 A bit about style Writing mathematics requires two things. You need to get the logical ow of ideas correct. And you
School: University Of Illinois, Urbana Champaign
Chapter 1 Math review This book assumes that you understood precalculus when you took it. So you used to know how to do things like factoring polynomials, solving high school geometry problems, using trigonometric identities. However, you probably cant re
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Conict to Midterm 2: April 9, 2013 Instructions: 1. This is a closed book exam. No notes, books, calculators, etc. are allowed. 2. Answer all problems. You can write I Dont Know for a problem (or its sub-parts)
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
CS125 : Introduction to Computer Science Lecture Notes #2 Architecture and Program Development c 2005, 2004, 2002, 2001 Jason Zych 1 Lecture 2 : Architecture and Program Development Data Encoding The idea of data encoding is to take information in one for
School: University Of Illinois, Urbana Champaign
" MedElite Point of Sale Software Requirements" Introduction! " The MedElite POS is a custom designed software for use in a busy medical practice. The software employs a simple uncomplicated touch screen user interface that is used by nurses who are gene
School: University Of Illinois, Urbana Champaign
Chukwa: A large-scale monitoring system Jerome Boulon jboulon@yahoo-inc.com Yahoo!, inc Andy Konwinski andyk@cs.berkeley.edu UC Berkeley Runping Qi runping@yahoo-inc.com Yahoo!, inc Ariel Rabkin asrabkin@cs.berkeley.edu UC Berkeley Eric Yang eyang@yahoo-i
School: University Of Illinois, Urbana Champaign
Comparing the performance of distributed hash tables under churn Jinyang Li, Jeremy Stribling, Thomer M. Gil, Robert Morris, M. Frans Kaashoek MIT Computer Science and Articial Intelligence Laboratory cfw_jinyang, strib, thomer, rtm, kaashoek@csail.mit.ed
School: University Of Illinois, Urbana Champaign
Megastore: Providing Scalable, Highly Available Storage for Interactive Services Jason Baker, Chris Bond, James C. Corbett, JJ Furman, Andrey Khorlin, James Larson, Jean-Michel Leon, Yawei Li, Alexander Lloyd, Vadim Yushprakh Google, Inc. cfw_jasonbaker,c
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Color John C. Hart CS 418 Intro to Computer Graphics Light Spectrum Cone Response 1.0 log human cone response 0.8 0.6 0.4 0.2 0 400 450 500 550 wavelength 600 650 700 Stockman, MacLeod & Johnson (1993) J. Optical Society of America A, 10, 2491-2521, via W
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Perspective CS418 Computer Graphics John C. Hart Graphics Pipeline ewing Model form Coords World Coords Homogeneous Divide Window to Viewport Still Clip Coords. Window Coordinates Viewing Coords Perspective Distortion Clip Clipping Coords. Viewport Coordi
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Viewing CS418 Computer Graphics John C. Hart Graphics Pipeline Viewing Model Xform Coords World Coords Homogeneous Divide Window to Viewport Still Clip Coords. Window Coordinates Viewing Coords Perspective Distortion Clip Clipping Coords. Viewport Coordin
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Texture Coordinates CS418 Computer Graphics John C. Hart Texture Mapping 1 .7 .6 v (.1,.7) (.1,. 6) 0 0 .1 .2 u 1 (.2,.6) TexGen GLfloat xplane[] = cfw_1,0,0,0; GLfloat yplane[] = cfw_0,1,0,0; glTexGenfv(GL_S,GL_OBJECT_PLANE, xplane); z glTexGenfv(GL_T,GL
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Lighting CS418 Computer Graphics John C. Hart Graphics Pipeline ewing Model form Coords World Coords Homogeneous Divide Window to Viewport Still Clip Coords. Window Coordinates Viewing Coords Perspective Distortion Clip Clipping Coords. Viewport Coordinat
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Hierarchical Modeling CS418 Computer Graphics John C. Hart Build a Robot glPushMatrix(); glPushMatrix(); glScalef(1.0,2.0,1.0); glutSolidCube(2.0); glPopMatrix(); glTranslatef(1.25,2,0.0); glRotatef(shoulder,0,0,1); glPushMatrix(); glTranslatef(0,-1,0.0);
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Visible Surface Determination CS418 Computer Graphics John C. Hart Painters Algorithm Display polygons in back-to-front order Sort polygons by z-value Which vertex? O(n log n) Problems -z Quadtree Algorithm Sort polygons Subdivide screen until each
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Image Formation CS418 Computer Graphics John C. Hart Sun White Solar Radiation Eye 23% Sky 5% Rayleigh scattering bywavelength Yellow Sunlight Red ConeResponse Green Cone Response Blue ConeResponse Clorophyll Green Foliage Absorption by wavelength Solar R
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Shadows CS418 Computer Graphics John C. Hart Shadowing Shadows indicate light occlusion Fix object positions relative to each other Perspective Distortion screen y yview yclip 1 yclip = yview - zview zview 1 xview xview 1 y view yview = a zview +b a
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Clipping CS418 Computer Graphics John C. Hart Graphics Pipeline Model Model Coords Coords Model Model Xform Xform World World Coords Coords Homogeneous Homogeneous Divide Divide Viewing Viewing Xform Xform Still Still Clip Clip Coords. Coords. Window Wind
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Image Formation CS418 Computer Graphics John C. Hart Vector v. Raster Graphics Vector Graphics Plotters, laser displays Clip art, illustrations PostScript, PDF, SVG Low memory (display list) Easy to draw line Solid/gradient/texture fills Raster Graphics T
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Texture Mapping CS418 Computer Graphics John C. Hart Interpolation Rasterization will interpolate any vertex attribute across a polygons fragments Interpolating color yields Gouraud smooth shading Can also define texture coordinates (u,v) at vertices t
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
The Vertex Shader CS418 Computer Graphics John C. Hart Graphics Pipeline Model Model Coords Coords Model Model Xform Xform World World Coords Coords Homogeneous Homogeneous Divide Divide Viewing Viewing Xform Xform Still Still Clip Clip Coords. Coords. Wi
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Rasterization CS418 Computer Graphics John C. Hart Rasterization Converts lines and triangles with floating point vertices in viewport (screen) coordinates into pixels with integer coordinates in viewport (screen) coordinates pixels centered at grid verti
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
The Fragment Shader CS418 Computer Graphics John C. Hart Fragment Pipeline Model Model Coords Coords Vertex Vertex Shader Shader Pixels Pixels Clip Clip Coords Coords Clip & Clip & Divide Divide Depth Depth Test Test Window Window W2V Viewport Rasterizati
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
OpenGL CS418 Computer Graphics John C. Hart OpenGL Based on GL (graphics library) by Silicon Graphics Inc. (SGI) Advantages: Runs on everything, including cell phones (OpenGL/ES) Alternatives: Microsofts Direct3D limited to MSWindows Suns Java3D slower, i
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
3-D Transformational Geometry CS418 Computer Graphics John C. Hart Graphics Pipeline ewing Model form Coords World Coords Homogeneous Divide Window to Viewport Still Clip Coords. Window Coordinates Viewing Coords Perspective Distortion Clip Clipping Coord
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Transformational Geometry CS418 Computer Graphics John C. Hart Graphics Pipeline ewing Model form Coords World Coords Homogeneous Divide Window to Viewport Still Clip Coords. Window Coordinates Viewing Coords Perspective Distortion Clip Clipping Coords. V
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
GLSLBasics DiscussionLectureforCS418 Spring2015 TA:ZhichengYan,SushmaSKini,MaryPietrowicz GLSLShader ProgrammingTutorial(I) ShaderIntroduction Slides by : Wei-Wen Feng ShaderProgramming Programmableshaderbecomes importantforrealtimegraphics application(G
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Interactive Computer Graphics CS 418 Spring 2015 Shading & Exam 1 Agenda Shading (Phong lighting Q&A for midterm exam model) Lighting Lambertian (Diffuse) Lo = Li kd cos = Li kd nl Specular Reflection Lo = Li ks cosn = Li ks (vr) n r n s l s = (nl)n l
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Interactive Computer Graphics CS 418 Spring 2015 Mesh Rendering, Transformation, Camera Viewing and Projection in OpenGL Agenda Mesh format Drawing with OpenGL Matrix transformation How to Load Your Mesh Customized .obj 3D models with colors. Wont wo
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Interactive Computer Graphics CS 418 Spring 2015 Agenda for today Communication Channels & Resources Set up Programming Environment! We will be showing some code snippets in class so bring your laptop if you want to follow along Piazza Post questions
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Interactive Computer Graphics CS 418 MP1: Dancing I Agenda MP1 Submission A little more OpenGL Applications Structure Callback functions Double Buffering (required) Animation Techniques MP Q&A MP1 : Mesh Rendering Due on 12:30pm CST 10 Feb. 2015.
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Interactive Computer Graphics CS 418 Spring 2015 MP2 Flight Simulator Agenda About MP2 Flight Control Multiple Object Rendering MP2 : Flight Simulator Due on March 10th at 12:30PM Camera Control ( Flight Simulator ) Some Features: Multiple Object r
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 14 April 23, 2013 14.1. NP Completeness. Show that the following problems are NP-Complete. Max Degree Spanning Tree Instance: Graph G = (V, E) and integer k Question: Does G contains a spanning tree T
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 15 May 8, 2013 15.1. 15.2. 15.3. 15.4. Very very independent. The following is a version of the independent Set Problem. You are given a graph G = (V, E) and an integer k. For this problem, we will ca
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 12 April 9, 2013 12.1. Building 3CNF formulas. CNF formula (conjunctive normal form) is a boolean formula that is the and of clauses, where every clause is the or of literals, where every literal is e
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 13 April 16, 2013 13.1. Graph Isomorphism. Two graphs are said to be isomorphic if one can be transformed into the other by relabeling the vertices. For example, the graphs shown below are isomorphic;
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 13 April 16, 2013 13.1. Graph Isomorphism. Two graphs are said to be isomorphic if one can be transformed into the other by relabeling the vertices. For example, the graphs shown below are isomorphic;
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 14 April 23, 2013 14.1. NP Completeness. Show that the following problems are NP-Complete. Max Degree Spanning Tree Instance: Graph G = (V, E) and integer k Question: Does G contains a spanning tree T
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 11 April 17, 2013 11.1. Building 3CNF formulas. (A) Consider the following boolean function f and g dened by a truth table. Generate a 3CNF formulas that computes these two functions. x z f (x, y, z)
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 12 April 9, 2013 12.1. Building 3CNF formulas. CNF formula (conjunctive normal form) is a boolean formula that is the and of clauses, where every clause is the or of literals, where every literal is e
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 11 April 2, 2013 11.1. Dinner Scheduling. Consider a group of n people who are trying to gure out a dinner schedule over the next n nights where each person needs to cook exactly once. Everyone has sc
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 9 March 11, 2013 9.1. Matrix verification. You are given three matrices A, B, C of positive integer numbers. The matrices are each of size n n. The claim is that AB = C. To verify this, your algorithm
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 a Discussion 10 6/10 b 9/13 2/4 5/8 March 27, 2013 10.1. 4/4 Go With the Flow. The gure on the right shows a ow network along with a ow. In the gure, the notation / for an edge means that the ow on the edge is a
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 11 April 2, 2013 11.1. Dinner Scheduling. Consider a group of n people who are trying to gure out a dinner schedule over the next n nights where each person needs to cook exactly once. Everyone has sc
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 a Discussion 9 6/10 b 9/13 2/4 5/8 March 27, 2013 9.1. 4/4 Go With the Flow. The gure on the right shows a ow network along with a ow. In the gure, the notation / for an edge means that the ow on the edge is and
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 a Discussion 10 6/10 b 9/13 2/4 5/8 March 27, 2013 10.1. 4/4 Go With the Flow. The gure on the right shows a ow network along with a ow. In the gure, the notation / for an edge means that the ow on the edge is a
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 9 March 11, 2013 9.1. Matrix verification. You are given three matrices A, B, C of positive integer numbers. The matrices are each of size n n. The claim is that AB = C. To verify this, your algorithm
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 9 March 11, 2013 9.1. Matrix verification. You are given three matrices A, B, C of positive integer numbers. The matrices are each of size n n. The claim is that AB = C. To verify this, your algorithm
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 9 March 11, 2013 9.1. Matrix verification. You are given three matrices A, B, C of positive integer numbers. The matrices are each of size n n. The claim is that AB = C. To verify this, your algorithm
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 8 March 13, 2013 8.1. 8.2. Choosing balls. Given n balls and k special balls, consider a random permutation of the n balls. What is the probability that the rst ball in this permutation is one of the
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 6 February 18, 2013 Version: 1.11 6.1. Longest Common Subsequence. Let X[1.m] and Y [1.n] be two arbitrary arrays. A common subsequence of X and Y 196 Algorithms is another sequence that is a subseque
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 4 February 6, 2013 4.1. Recurrences Solve the following recurrences. (A) T (n) = 5T (n/4) + n and T (n) = 1 for 1 n < 4. (B) T (n) = 2T (n/2) + n log n (C) T (n) = 2T (n/2) + 3T (n/3) + n2 4.2. Tree T
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 7 March 6, 2013 7.1. Weighted Scheduling. We have n jobs J1 , J2 , . . . , Jn which we need to schedule on a machine. Each job Ji has a processing time ti and a weight wi . A schedule for the machine
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 5 February 12, 2013 5.1. Separators in trees. Divide and conquer is a basic strategy and when we wish to apply it to graphs we need some additional properties about how the pieces of the graph interac
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 3 January 29, 2013 3.1. 2SAT. You are given a boolean formula that is a 2CNF. That is, every clause is the or of two boolean variables, and the formula is the conjunction of the clauses. For an exampl
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 2 January 24, 2013 2.1. DFS example. Consider the following graph. g a b e f d h c 2.2. Draw the DFS tree rooted at d for the above graph. Use alphabetic ordering to break ties. Label the vertices of
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Discussion 1 January 15, 2013 1.1. Version: 1.1 Inductive proofs All horses are of the same color. Professor Kipod Metorlal1 had declared that if you have n horses in a room, then they must all be of the same co
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Data Abstraction Gul Agha CS 421 Data Abstraction Data should be specified via interfaces Interface What the data represents Implementation Specific representation of the data and code for operations using the data Abstract Data Types: the data type repre
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Programming Languages and Compilers (CS 421) Sihan Li https:/wiki.cites.illinois.edu/wiki/displ ay/cs421sp15/CS+421+Spring+2015 +Home/ Based in part on slides by Gul Agha, Mattox Beckman, as updated by Vikram Adve and Elsa Gunter Outline Parsing Programs
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Environments Gul Agha CS 421 Concrete Syntax: lambda-calculus 2/3/2006 Particular representation of an inductive data type <expression> <identifier> (lambda (<identifier>) <expression>) (<expression> <expression>) CS 421 Spring 2015 2 Free Variables re
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
1/27/2015 Inductive Sets of Data Sets can be defined by induction Inductive Specification and Recursion Example: Even Numbers S is the smallest set of natural numbers satisfying: S If x S then x + 2 S 1. 0 Gul Agha CS 4211/23/20061 2. Defines the set of
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
1/27/2015 Using Scheme Standard Useful Scheme Constructs Stick to Scheme Revision 6 (closer to Scheme 5.3.6 which is what the code will follow). Gul Agha CS 421 Spring 2015 #!r6rs (import (rnrs lists (6) (rnrs base (6) (rnrs io simple (6) 1/27/2015 Empty
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
More Scheme Procedures: Reduce and Zip Gul Agha CS 421 1/29/2015 CS 421 Spring 2015 1 Reduce Successive reductions by a binary operator Reduce Left 1/29/2015 Reduce Right CS 421 Spring 2015 2 Example (reduce-left '(1 2 3 4 5) -13 (reduce-right '(1 2 3 4
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
1/21/2015 Contact Information Gul Agha Programming Languages and Compilers (CS 421) Gul Agha Office: 2104 SC Office hours: Tuesdays 2pm to 3pm Also by appointment Email: agha@illinois.edu 2 1/20/2015 Lecture 0: Intro to CS 421 Software Contact Infromation
School: University Of Illinois, Urbana Champaign
CS 425/ECE 428 Distributed Systems (Spring 2015) Assigned February 3, 2015 Programming Assignment 1 (MP1) Due by 5:00 p.m. on March 15, 2015 You may use any of the following languages: C, C+, Java, Python Due by 5:00 p.m. on March 5, 2015, with additional
School: University Of Illinois, Urbana Champaign
1 Consensus (slides by Prof. Jennifer Welch, Texas A&M) 2 Processor Failures in Message Passing Crash: at some point the processor stops taking steps at the processor's final step, it might succeed in sending only a subset of the messages it is supposed t
School: University Of Illinois, Urbana Champaign
CS 425/ECE 428 Distributed Systems (Spring 2015) Consensus II Lewis Tseng (ltseng3@illinois.edu) Announcement g HW2 due 2/10 9am g MP1 announced on Piazza g2 Last Lecture g What is consensus? g Why is consensus important? g System models g Fault models g3
School: University Of Illinois, Urbana Champaign
Linearizability By Mila Oren 1 Outline Sequential and concurrent specifications. Define linearizability (intuition and formal model). Composability. Compare linearizability to other correctness condition. 2 Motivation An object in languages such as Jav
School: University Of Illinois, Urbana Champaign
Fall 2011- Midterm 1 Computer Concepts and Logic 1. Which of the following is NOT a means of secondary storage? a. b. c. d. CD DVD Hard Drive RAM 2. What does the acronym GUI stand for? a. b. c. d. Graphical Unix Interface Graphical User Interface Gradebo
School: University Of Illinois, Urbana Champaign
Course: Distributed Systems
Name: _ CS 425/ECE 428/CSE 424 Fall 2013 Midterm October 15, 2013. 3.30 pm 4.45 pm. (75 minutes) NAME: _ NETID: _ Instructions: 1. Please write your name and netid legibly above, and sign below. Please write your name on the top-right corner of every page
School: University Of Illinois, Urbana Champaign
Course: Distributed Systems
CS 425 Midterm Su2014 NetID: Solution page 1 of 11 CS 425: Distributed Systems Midterm Exam (Summer 2014) Tuesday, July 1, 2014 Name: Solution NetID: You have 75 minutes (1 hour and 15 minutes) to complete this exam. This is a closed-book, closed-notes
School: University Of Illinois, Urbana Champaign
Spring 2012 CS 105 Midterm 1 Page 1 of 17 February 21st, 2012 1. Name: FORM A DO NOT open this packet UNTIL the proctor instructs you to. READ and complete the following: Bubble your Scantron only with a #2 pencil. On Scantron, bubble : 1. Your Name 2. Yo
School: University Of Illinois, Urbana Champaign
Course: Database Systems
CS411 Final Project Report 1. Briefly describe what the project accomplished. "Let us help you build up course schedule based on your own preferences. Smart Course sorts courses based on user's own preferences such as time availability, course level requi
School: University Of Illinois, Urbana Champaign
Course: Database Systems
CS411 Final Project Report 1. Briefly describe what the project accomplished. "Let us help you build up course schedule based on your own preferences. Smart Course sorts courses based on user's own preferences such as time availability, course level requi
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
CS 173, Fall 2014, Examlet 1, Part A Solutions NAME: Discussion: Th 2 NETID: Th 3 Th 4 Th 5 Fr 9 Fr 10 Fr 11 Fr 12 Fr 1 Fr 2 State the negation and the contrapositive of the following claim, moving all negations (e.g. not) so that they are on individual p
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
CS 173, Fall 2014 Examlet 4, Part A NETID: FIRST: Discussion: LAST: Thursday 2 3 4 5 Friday 9 10 11 12 1 2 Let A = Z+ Z+ , i.e. pairs of positive integers. Consider the relation T on A dened by (a, b)T (p, q) if and only if ab | p Working directly from th
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
1 CS 173, Fall 2014 Examlet 7, Part A NETID: FIRST: LAST: Discussion: Thursday 2 3 4 5 Friday 9 10 11 12 1 2 Use (strong) induction to prove the following claim: n Claim: (p p!) = (n + 1)! 1, for all natural numbers n. p=0 Recall that 0! is dened to be 1.
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
CS 173, Fall 2014 Examlet 8, Part A NETID: FIRST: Discussion: LAST: Thursday 2 3 4 5 Friday 9 10 11 12 (20 points) Suppose that f : Z+ Z is dened by is dened by f (1) = 5 f (2) = 5 f (n) = 4f (n 2) 3f (n 1), for all n 3 Use induction to prove that f (n) =
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
CS 173, Fall 2014 Examlet 6, Part A NETID: FIRST: Discussion: LAST: Thursday 2 3 4 5 Friday 9 10 11 12 1 2 C B G F A D J H E K 1. (11 points) How many isomorphisms are there from G (above) to itself? Justify your answer and/or show your work clearly . Sol
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
1 CS 173, Fall 2014 Examlet 9 Part A NETID: FIRST: Discussion: LAST: Thursday 2 3 4 5 Friday 9 10 11 12 1 2 (18 points) D-trees are binary trees whose nodes are labelled with strings, such that Each leaf node has label left, right, or back If a node has
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
1 CS 173, Fall 2014 Examlet 10 Part A NETID: FIRST: Discussion: LAST: Thursday 2 3 4 5 Friday 9 10 11 12 1 2 (15 points) Use (strong) induction to prove the following claim: Claim: For all integers n 2, (2n)! > 2n n! Base Case(s): At n = 2, (2n)! = 4! = 2
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
CS 173, Fall 2014 Examlet 3, Part A NETID: FIRST: Discussion: LAST: Thursday 2 3 4 5 Friday 9 10 11 12 1 2 A = cfw_(a, b) : (a, b) R2 , a = 3 b2 B = cfw_(x, y) : (x, y) R2 , |x| 1 or |y| 1 Prove that A B. Hint: you may nd proof by cases helpful. Solution
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
1 CS 173, Fall 2014 Examlet 11 Part A NETID: FIRST: Discussion: LAST: Thursday 2 3 4 5 Friday 9 10 11 12 1 2 01 Magic(a1 , a2 , . . . an : list of real numbers) 02 if (n = 1) then return 0 03 else if (n = 2) then return |a1 a2 | 04 else if (n = 3) then re
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
1 CS 173, Fall 2014 Examlet 12 Part A NETID: FIRST: LAST: Discussion: Thursday 2 3 4 5 Friday 9 10 11 12 1 2 (a) (9 points) Use proof by contradiction to show that 7 1 + 2. Solution: Suppose not. That is, suppose that 7 < 1 + 2. Since the numbers are all
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
1 CS 173, Fall 2014 Examlet 5, Part A NETID: FIRST: Discussion: LAST: Thursday 2 3 4 5 Friday 9 10 11 12 1 2 1. (10 points) Suppose that f : Z Z is one-to-one. Lets dene g : Z2 Z2 by g(x, y) = (f (x) y, 5y + 3). Prove that g is one-to-one. You must work d
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
CS 173, Fall 2014 Examlet 2, Part A NETID: FIRST: LAST: Discussion: Thursday 2 3 4 5 Friday 9 10 11 12 1 2 Prove the following claim, using your best mathematical style and the following denition of congruence mod k: a b (mod k) if and only if a = b + nk
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Midterm 2 Solution 12:30-13:45 section in Noyes Laboratory 217 14:00-15:15 section in Mumford Hall 103 s 1. Flow, flow, flow. M M Consider the network ow on the right. Here M is a large positive integer, and = (
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Midterm 2 Solution 12:30-13:45 section in Noyes Laboratory 217 14:00-15:15 section in Mumford Hall 103 s 1. Flow, flow, flow. M M Consider the network ow on the right. Here M is a large positive integer, and = (
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Midterm 1: February 19, 2013 12:30-13:45 section in Everit Lab 151 14:00-15:15 section in Loomis 151 Instructions: (A) This is a closed book exam. No notes, books, calculators, cellphones, etc. are allowed. (B)
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Midterm 2: April 2, 2013 12:30-13:45 section in Noyes Laboratory 217 14:00-15:15 section in Mumford Hall 103 Instructions: (A) This is a closed book exam. No notes, books, calculators, cellphones, etc. are allow
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Final Exam: 7pm-10pm, May 3, 2013 David Kinley Hall, Room 114 1. Multiple choice. (8 pts.) For each of the questions below choose the most appropriate answer. No IDK credit for this question! (A) Given a graph G
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Algorithms, Fall 2010 Final Exam: December 14, 2010 Instructions: This is a closed book exam. No notes, books, calculators, etc. are allowed. Answer Problems 1,2,3 and any four of Problems 4,5,6,7,8. Read all questions before deciding which ones
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Conict Final Exam: 7pm-10pm, May 6, 2013 1. Multiple choice. (8 pts.) For each of the questions below choose the most appropriate answer. (A) Given a ow f on a network G with costs on the edges, there is a linea
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Midterm 1: Conict Exam Instructions: (A) This is a closed book exam. No notes, books, calculators, cellphones, etc. are allowed. (B) Graduate student: Answer all questions on the exam. (C) Undergraduate student:
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Conict to Midterm 2: April 9, 2013 Instructions: 1. This is a closed book exam. No notes, books, calculators, etc. are allowed. 2. Answer all problems. You can write I Dont Know for a problem (or its sub-parts)
School: University Of Illinois, Urbana Champaign
CS 473g: Algorithms, Fall 2007 Midterm October 4, 2007 Name: Net ID: Alias: This is a closed-book, closed-notes, open-brain exam. If you brought anything with you besides writing instruments and your handwritten 8 1 11 cheat sheet, please leave it at the
School: University Of Illinois, Urbana Champaign
CS 473g: Algorithms, Fall 2007 Final 1:30-4:30 PM, Tuesday, December 11, 2007 Name: Net ID: Alias: This is a closed-book, closed-notes, open-brain exam. If you brought anything with you besides writing instruments and your handwritten 8 1 11 cheat sheet,
School: University Of Illinois, Urbana Champaign
CS 573: Algorithms, Fall 2013 Midterm October 8, 2013 Solution 1. NP Completeness. (25 pts.) Prove that the following problem is NP-Complete: String Reconstruction Instance: (, F): : A set of n dierent characters F: A set of strings made out characters of
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Problem 1 (For T/R questions whose answer is False and correct, if no explanation is given, 1 point is deducted.) Part 1 min redundancy, avoid info loss, preserve dependency, ensure good query performance Part 2
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Midterm 2 Solutions Spring 2014 1. Clearly indicate the four indicated spanning trees of the same undirected edge-weighted graph. Solution: 5 5 s s 7 14 11 14 10 13 10 5 4 6 8 11 1 (c) The minimum spanning tree. (unique) 13 2 9 11 1 3 7 2 9 5 12 14
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 411 Database Systems: Homework #3 Fall 2014 Due on Oct 9, 2014 at 11:59pm Please submit a single pdf file of all your solutions (including all diagrams, if any) to compass 2g. Please make sure your diagrams and their labels are clear. Problem 1 Short a
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Homework 4 Due date: November 20 1. Purpose: Learn about articulation points, bridges, and biconnected components, and Euler tours. Please solve (8 points) Problem 22-2, and (4 points) Problem 22-3 on pages 558-9. Problem 22-2 a) Suppose that the root has
School: University Of Illinois, Urbana Champaign
Course: Algorithms
1 Distributed Shared Memory Slides by Prof. Jennifer Welch 2 Some of the slides by Prof. Welch are edited, and some new slides has been added Internet stack 3 Protocol layers Phy layer, Link layer (Ethernet, WiFi), Network layer (IP), Transport layer (TCP
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Midterm 1 Study Questions Fall 2014 This is a core dump of potential questions for Midterm 1. This should give you a good idea of the types of questions that we will ask on the examin particular, there will be a series of True/False questionsbut th
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 1. Final Exam Solutions (Version B) Fall 2014 (a) Which of the following statements is true for every language L cfw_0, 1 ? Yes X No L is non-empty. is a subset of cfw_0, 1 . X Yes No L is decidable or L is innite (or both). Every nite language is
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
University of Illinois at Urbana-Champaign Department of Computer Science Final Examination 3 hours CS 125 Introduction to Computer Science Last Name: First Name: NetID: _ _ _ _ _ _ _ _ @ illinois.edu (write legibly!) PLEASE READ THE FOLLOWING CAREFULLY
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
University of Illinois at Urbana-Champaign Department of Computer Science Spring 2008 CS 125 Final Examination SOLUTION 1. Guess my number 6 points. HAL and Arthur are playing a simple 'guess my number' game: HAL: "I'm thinking of a integer between 1 and
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
Write your NetId here:_ University of Illinois at Urbana-Champaign Department of Computer Science CS125 Fall 2008 Final Examination Solution 1. Type and Protection Analysis 10 points Consider the following code: public class Art cfw_ public Art(boolean b)
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
CS125 Final Examination Fall 2009 Write your NetID here:_ University of Illinois at Urbana-Champaign Department of Computer Science Final Examination (Solution) 1. Concepts 10 points (2 points each) 1. Carefully analyze the following mystery program. What
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
University of Illinois at Urbana-Champaign Department of Computer Science Final Examination CS 125 Introduction to Computer Science Spring 2008 3 Hours Name: Last, First NetID: _ _ _ _ _ _ _ _ @ uiuc.edu PLEASE READ THE FOLLOWING CAREFULLY This is a clos
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
University of Illinois at Urbana-Champaign Department of Computer Science Final Examination CS 125 Introduction to Computer Science Fall 2009 3 Hours Last Name: First Name: NetID: _ _ _ _ _ _ _ _ @ illinois.edu PLEASE READ THE FOLLOWING CAREFULLY You may
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
University of Illinois at Urbana-Champaign Department of Computer Science Final Examination CS 125 Introduction to Computer Science Fall 2008 3 Hours Last Name: First Name: NetID: _ _ _ _ _ _ _ _ @ illinois.edu PLEASE READ THE FOLLOWING CAREFULLY You may
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Midterm 2 Combined Solutions Fall 2014 1. (= conict problem 1) Clearly indicate the edges of the following spanning trees of the weighted graph pictured below. (a) A depth-rst spanning tree rooted at s Solution: There are many many different soluti
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Midterm 2 (Version B) Questions Fall 2014 Write your answers in the separate answer booklet. Please return this question sheet and your cheat sheet with your answers. 1. Clearly indicate the edges of the following spanning trees of the weighted gra
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 1. Midterm 1 (Version A) Solutions Fall 2014 (a) If 2 + 2 = 5, then Jeff is the Queen of England. True False I dont know Solution: The implication p q is logically equivalent to p q. The premise (2 + 2 = 5) is false, so the implication is true, whe
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Midterm 1 (Version A) Questions Fall 2014 Write your answers in the separate answer booklet. Please return this question sheet and your cheat sheet with your answers. 1. For each statement below, check True if the statement is always true and False
School: University Of Illinois, Urbana Champaign
Course: Data Structures
University of Illinois at Urbana-Champaign Department of Computer Science Second Examination Grading Rubric CS 225 Data Structures and Software Principles Fall 2010 7p-9p, Tuesday, November 2 Name: NetID: Lab Section (Day/Time): This is a closed book and
School: University Of Illinois, Urbana Champaign
Course: Data Structures
University of Illinois at Urbana-Champaign Department of Computer Science First Examination RUBRIC CS 225 Data Structures and Software Principles Spring 2012 7-9p, Tuesday, February 21 Name: NetID: Lab Section (Day/Time): Labs this week are ocially cance
School: University Of Illinois, Urbana Champaign
Course: Discrete Math
CS 173, Final Exam 11 May 2011 Fill in your name, netid, and discussion section time below. Also write your name or netid on the last page (which sometimes gets pulled o). NAME: NETID: DISCUSSION DAY/TIME: Problem Possible Score Problem Possible Score Tot
School: University Of Illinois, Urbana Champaign
Course: Discrete Math
CS 173, Final Exam 14 December 2010 Fill in your name, netid, and discussion section time below. Also write your name or netid on the last page (which sometimes gets pulled o). NAME: NETID: DISCUSSION DAY/TIME: Problem Possible Score Problem Possible Scor
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements: MP7 available. Due 12/11, 11:59p. EC due 12/4, 11:59p. Today: Disjoint Sets A Disjoint Sets example: Let R be an equivalence relation on the set of students in this room, where (s,t) R if s and t have the same favorite among cfw_AB, FN, DJ,
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements: MP7 available. Due 12/11, 11:59p. Code Challenge #5 tonight, 9p, in Siebel 0224 - Palantir Q: if this graph is simple and connected, how many edges does it have? A: at least _, at most _ Some functions well compare: Graphs: Adjacency List i
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements: MP7 available. Due 12/11, 11:59p. EC due 12/4, 11:59p. Today: Graph Implementations How do we get from here to there? Need: 1. Common Vocabulary 2. Graph implementation 3. Traversal 4. Algorithms. Graphs: theory that will help us in analysi
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements: Final exam 12/15, 7-10p. Locations on web. Email me w academic conflicts. Today: MST Prims algorithms (1957) is based on the Partition Property: Consider a partition of the vertices of G into subsets U and V. U e 4 9 5 2 8 3 8 7 Let e be an
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements: MP7 available. Due 12/11, 11:59p. Today: MST A Graphs: Traversal BFS B Visits every vertex and classifies each edge as either discovery or cross Algorithm BFS(G,v) Input: graph G and start vertex v C E D F Running time: Output: labeling of
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements: MP7 available. Due 12/11, 11:59p. Exam review: 12/9, 6p, Siebel 1404 Today: Traversal BFS and Algorithms MST DFS(G,v) explores all vertices Properties of DFS(G,v) DFS(G,v) can be modified to A B D C and edges of component containing verte
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP4 available, due 10/19, 11:59p. EC due 10/12, 11:59p. Code challenge #2: 10/10, 9p (sponsored by Cisco). Summary: Linked list based implementation of a stack: Constant time push and pop. Array based implementation of a stack: _ tim
School: University Of Illinois, Urbana Champaign
Course: Vision
Computer Vision CS 543 / ECE 549 Homework 1 Solutions 1. Lighting (20%) A. Answer the following regarding the above image. 1. Point 1 is darker than 2 because point 1 is in shadow. 2. Point 4 is darker than point 3 because point 3 has a darker albedo (ink
School: University Of Illinois, Urbana Champaign
Course: Numerical Analysis
CS 450: Homework #7 Numerical Analysis Spring 2012 Luke Olson : 9:00am - 9:50am MWF Due on May 2, 2011 A homework submission guideline is available on the course website at https:/wiki.engr.illinois.edu/display/cs450sp12/Information All submissions must c
School: University Of Illinois, Urbana Champaign
Course: Vision
Computer Vision CS 543 / ECE 549 Homework 1 Due Feb 14, 2012 Answer the following questions and explain solutions. Numbers in parentheses give maximum credit value. You can discuss in small groups, but turn in individual solutions and indicate collaborato
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2009 Homework 3 Assigned: Oct/1 Due in class Oct/13 Total points: 54 for undergraduate students, 62 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions for
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2014 HW 1 solution (Version: 1.01) 1. (30 pts.) Cut vertices Given a connected undirected graph G = (V, E), vertex u is called a separating vertex , or cut-vertex , if removing u leaves the graph into two or more dis
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 6 Solutions Fall 2013 1. Describe data structures that support Lookup in O(1) worst-case time and the other two operations in the following time bounds. (a) The worst-case time for both BLACKEN and NEXTWHITE is O(log n). Solution (balanced
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2013 Homework 3 Assigned: Oct/1 Due in class Oct/15 Total points: 52 for undergraduate students, 62 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions for
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
CS 173 Discrete Structures Fall 2013: Homework 1 Solutions 1. Direct Proof : An integer is said to be divisible by 3 if there is some integer m such that x = 3 m. Show that for any integers x, y, z such that x + y + z is divisible by 3, 100x + 10y + z is
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Fundamental Algorithms, Spring 2011 HW 4 Homework is due by Monday, 23:59:59, February 21 Problem 1 is due by Sunday, 23:59:59, February 20 This homework contains four problems. Read the instructions for submitting homework on the course webpage.
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
CS 412 HW3 Yuwei Chen (chen202) 1. Brief (very brief) introduction of the methods in your general purpose classification framework I used Decision Tree (C4.5) as basic method, Random Forest as the ensemble version of the classification method.
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473 Homework 10 Solutions Spring 2010 1. Show that 2SAT is NP-hard, or describe a polynomial-time algorithm to solve it. Solution: We describe a polynomial-time algorithm to solve 2SAT. Given a 2CNF boolean formula , the implication graph G is dened as
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 4 (due March 2, 2010) Spring 2010 1. Suppose we want to write an efcient function SHUFFLE(n) that returns a permutation of the set cfw_1, 2, . . . , n chosen uniformly at random. (a) Prove that the following algorithm is not correct. [Hint
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2009 Homework 4 Assigned: Oct/23 Due in class Nov/3 Total points: 48 for undergraduate students, 58 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions for
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Algorithms, Fall 2010 HW 1 (due Tuesday, September 7th) This homework contains four problems. Read the instructions for submitting homework on the course webpage. In particular, make sure that you write the solutions for the problems on separate s
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 2 Solutions Spring 2014 1. Kris is a professional rock climber who is competing in the U.S. climbing nationals. The competition requires him to complete the following task: He is given a set of n holds that he might use to create a route w
School: University Of Illinois, Urbana Champaign
Course: Embedded Systems
CS 431 Homework #1 Spring 2014 Due: Tuesday, Feb 11, 2014 at 4:00pm. Handin at CS 431 dropbox in SC basement. Please type or neatly write your solutions. Anything that we cannot read or easily follow will receive no credit. Show your work to receive full
School: University Of Illinois, Urbana Champaign
CS 374 Homework 6 Solutions Fall 2014 1. Describe and analyze an algorithm to compute the maximum total reward that the organizers could be forced to pay, given the array M [1 . n, 1 . n] as input. Solution: Let MaxR(i, j) be the maximum possible reward i
School: University Of Illinois, Urbana Champaign
Course: Algorithms
\documentclass[11pt]cfw_article %\usepackagecfw_pstricks,pst-node \usepackagecfw_alltt,fullpage,graphics,color,epsfig,amsmath, amssymb \usepackagecfw_boxedminipage %\newcommandcfw_\edgee[1]cfw_\begincfw_math\stackrelcfw_#1cfw_\longrightarrow\endcfw_math \
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Algorithms, Fall 2010 HW 9 (due Tuesday, November 16) This homework contains four problems. Read the instructions for submitting homework on the course webpage. In particular, make sure that you write the solutions for the problems on separate she
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Algorithms, Fall 2010 HW 1 (due Tuesday, September 7th) This homework contains four problems. Read the instructions for submitting homework on the course webpage. In particular, make sure that you write the solutions for the problems on separate s
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2009 Homework 2 Assigned: Sept/15 Due in class Sept/29 Total points: 40 for undergraduate students, 44 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions f
School: University Of Illinois, Urbana Champaign
CS 573: Graduate Algorithms, Fall 2011 HW 1 (due Tuesday, September 13th) This homework contains ve problems. Read the instructions for submitting homework on the course webpage. In particular, make sure that you write the solutions for the problems on se
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 2 Solutions Rubric (for all dynamic programming problems): For a problem worth 10 points: 6 points for a correct recurrence, described either using mathematical notation or as pseudocode for a recursive algorithm. 1 point for a clear Eng
School: University Of Illinois, Urbana Champaign
CS 573 Homework 5 (due November 19, 2010) Fall 2010 CS 573: Graduate Algorithms, Fall 2010 Homework 5 Due Friday, November 19, 2010 at 5pm (in the homework drop boxes in the basement of Siebel) 1. Suppose we are given a set of boxes, each specied by their
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
CS412: Introduction to Data Mining Fall 2012 Assignment 4 Solution Handed Out: November 20th , 2012 Due: Dec 10th , 2012 1. [k-Nearest Neigbhor and Support Vector Machine - 14 points] Suppose we are given a training set as follows i x1 12 24 35 48 66 x2 l
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2013 Homework 3 Assigned: Oct/1 Due in class Oct/15 Total points: 52 for undergraduate students, 62 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions for
School: University Of Illinois, Urbana Champaign
Course: Vision
Solution to Homework 2 March 8, 2012 1 A feature tracker (50pt) 1.1 Keypoint Selection (15pt) Algorithm summary: Compute Harris keypoints Given the input image, compute gradient Ix and Iy Construct the second moment matrix, convoluted with Gaussian lter:
School: University Of Illinois, Urbana Champaign
CS 573: Graduate Algorithms, Fall 2011 HW 4 (due in class on Tuesday, November 1st) This homework contains ve problems. Read the instructions for submitting homework on the course web page. In particular, make sure that you write the solutions for the pro
School: University Of Illinois, Urbana Champaign
Course: Algorithms
\documentclass[11pt]cfw_article %\usepackagecfw_pstricks,pst-node \usepackagecfw_alltt,fullpage,graphics,color,epsfig,amsmath, amssymb \usepackagecfw_boxedminipage %\newcommandcfw_\edgee[1]cfw_\begincfw_math\stackrelcfw_#1cfw_\longrightarrow\endcfw_math \
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS473 Spring 2014 Homework 9 Solutions and Rubric 1. Problem 7.17 from Kleinberg-Tardos book. We could type up the problem for you but Kleinberg-Tardos book has a very nice chapter on ows and also numerous interesting problems so take this opportunity to
School: University Of Illinois, Urbana Champaign
Course: Numerical Analysis
CS 450 / MATH 450 / CSE 401 / ECE 491 Fall 2013 Numerical Analysis Homework 1 Instructor: Luke Olson University of Illinois at Urbana-Champaign Due: 09/20/2013 5:00 PM Submission Notes: Each problem solution should be submitted in a separate PDF le. Eac
School: University Of Illinois, Urbana Champaign
Course: Vision
Computer Vision CS 543 / ECE 549 Homework 3 Due Mar 13, 2012 Answer the following questions and explain solutions. Numbers in parentheses give maximum credit value. You can discuss in small groups, but turn in individual solutions and indicate collaborato
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
CS412: An Introduction to Data Warehousing and Data Mining Fall 2013 Assignment 2 Yanglei Song Handed In: 10/08/2013 Question 1 Assume a base cuboid of 10 dimensions contains only two base cells: (1) (a1 , a2 , a3 , b4 , ., b9 , b10 ), and (2) (b1 , b2 ,
School: University Of Illinois, Urbana Champaign
Course: Algorithms
HW 7 (due Tuesday, at noon, April 1st, 2014) CS 473: Fundamental Algorithms, Spring 2014 Version: 1.0 1. (30 pts.) Bottleneck Spanning Tree. Let G = (V, E) an undirected edge-weighted graph. The bottleneck weight of a spanning tree T is the weight of the
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Algorithms, Fall 2010 HW 3 Solutions 1. (25 pts) Suppose we have a stack of n pancakes of different sizes. We want to sort the pancakes so that the uppose we have a staareof n pancakethe largernpancakes. want tonly toperation weocan perform is sma
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 6 (due October 23, 2013) Fall 2013 1. Suppose we want to maintain an array X [1.n] of bits, which are all initially subject to the following operations. LOOKUP(i): Given an index i, return X [i]. BLACKEN(i): Given an index i < n, set X [
School: University Of Illinois, Urbana Champaign
Course: Data Structures
CS 225 Fall 2013 Homework 0 Due Sept 4, 2013 in lecture and SVN Instructions for submission into your class SVN repository are on the webpage. The purpose of this assignment is to give you a chance to refresh the math skills we expect you to have learned
School: University Of Illinois, Urbana Champaign
Course: Algorithms
HW 2 (due Tuesday, at noon, February 11, 2014) CS 473: Fundamental Algorithms, Spring 2014 This homework contains three problems. Read the instructions for submitting homework on the course webpage. In particular, make sure that you write the solutions fo
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Fundamental Algorithms, Spring 2011 HW 2 Homework is due by Monday, 23:59:59, February 7 Problem 1 is due by Sunday, 23:59:59, February 6 This homework contains four problems. Read the instructions for submitting homework on the course webpage. Co
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
CS446: Machine Learning Fall 2013 Problem Set 1 Handed Out: September 5, 2013 Due: September 19, 2013 Feel free to talk to other members of the class in doing the homework. I am more concerned that you learn how to solve the problem than that you demonst
School: University Of Illinois, Urbana Champaign
CS 374 Homework 4 solutions Fall 2014 1. For this problem, a subtree of a binary tree means any connected subgraph. A binary tree is complete if every internal node has two children, and every leaf has exactly the same depth. Describe and analyze a recurs
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 7 Solutions Fall 2013 1. Describe and analyze an algorithm to nd the length of the longest palindrome that is the label of a path in a directed acyclic graph. Solution: Let G = (V, E) be in the input dag, and let label(v) denote the label
School: University Of Illinois, Urbana Champaign
Course: Algorithms
HW 7 (due Tuesday, at noon, April 1st, 2014) CS 473: Fundamental Algorithms, Spring 2014 Version: 1.0 Make sure that you write the solutions for the problems on separate sheets of paper. Write your name and netid on each sheet. Collaboration Policy: The h
School: University Of Illinois, Urbana Champaign
Course: Numerical Analysis
CS 450 / MATH 450 / CSE 401 / ECE 491 Fall 2013 Numerical Analysis Homework 1 Solution Instructor: Luke Olson University of Illinois at Urbana-Champaign Due: September 21, 2013 Problem 1 [6pt] The sine function is given by the innite series sin(x) = x x3
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Fundamental Algorithms, Spring 2011 HW 1 Homework is due by Monday, 23:59:59, January 31 Problem 1 is due by Sunday, 23:59:59, January 30 1. (30 pts.) Short questions to be answered on compass individually. 2. (10 pts.) Present an algorithm that t
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 3 (due February 16, 2010) Spring 2010 For this and all future homeworks, groups of up to three students can submit (or present) a single common solution. Please remember to write the names of all group members on every page. Students in C
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
CS412: Introduction to data mining - Assignment 5 Instructions 1. Assignment 5 is distributed on Nov. 14 2013, and the due day is Dec. 10 2013. 2. Assignment 5 covers Chapter 8 to Chapter 10. 3. Please write down your reasoning for each question. Youll ge
School: University Of Illinois, Urbana Champaign
Course: Cs473
CS 473: Fundamental Algorithms, Spring 2012 Homework 8 (due Tuesday, 23:55:00, April 3, 2012) Collaboration Policy & submission guidelines: See homework 1. Each student individually have to also do quiz 8 online. Version: 1.3 1. (35 pts.) Recomputing corr
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 1. Homework 1 Solutions Fall 2013 (a) Prove that CRUEL correctly sorts any input array. Solution: The only difference between CRUEL and MERGESORT is that CRUEL calls UNUSUAL instead of MERGE. So to prove that CRUEL correctly sorts, it sufces to pro
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 0 (due January 26, 2009) Spring 2010 CS 473: Undergraduate Algorithms, Spring 2010 Homework 0 Due Tuesday, January 26, 2009 in class This homework tests your familiarity with prerequisite materialbig-Oh notation, elementary algorithms and
School: University Of Illinois, Urbana Champaign
Course: Cs473
CS 473: Fundamental Algorithms, Spring 2012 Homework 2 (due Tuesday, 23:55:00, February 7, 2012) This homework contains three problems. Read the instructions for submitting the homework on the course webpage. Read the course policies before starting the h
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473 Homework 1 (due February 2, 2009) Spring 2010 1. (a) How many cells are there, as a function of n? Prove your answer is correct. Solution: A kd-tree is a binary tree, where each internal node corresponds to a cut through one of the points, and each
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 9 (due April 27, 2010) Spring 2010 1. We say that an array A[1 . n] is k-sorted if it can be divided into k blocks, each of size n/k, such that the elements in each block are larger than the elements in earlier blocks, and smaller than ele
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Fundamental Algorithms, Spring 2011 HW 7 Question 1 is due by Sunday, 23:59:59, March 27 Questions 2-4 are due by Monday, 23:59:59, March 28 This homework contains four problems. Read the instructions for submitting homework on the course webpage.
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473 Homework 3 Solutions Spring 2010 1. Below are four alternative greedy algorithms. For each algorithm, either prove that the algorithm constructs an optimal schedule, or give a concrete counterexample showing that the algorithm is suboptimal. (a) Ch
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
CS446: Pattern Recognition and Machine Learning Fall 2008 Problem Set 1 Handed Out: September 2, 2008 Due: September 11, 2008 Feel free to talk to other members of the class in doing the homework. I am more concerned that you learn how to solve the probl
School: University Of Illinois, Urbana Champaign
Course: Distributed Systems
CS425/CSE424/ECE428 Homework 1 Due: Sept. 27, 2 p.m. Problem 1 Ring heartbeating may not detect simultaneous multiple failures of processors. 1. What is the maximum number of simultaneous processor failures that can be detected by ring heartbeating protoc
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Algorithms, Fall 2010 HW 9 (due Tuesday, November 16th) This homework contains four problems. Read the instructions for submitting homework on the course webpage. In particular, make sure that you write the solutions for the problems on separate s
School: University Of Illinois, Urbana Champaign
Course: Cs473
CS 473: Fundamental Algorithms, Spring 2012 Homework 5 (due Tuesday, 23:55:00, March 6, 2012) Collaboration Policy & submission guidelines: See homework 1. Each student individually have to also do quiz 5 online. Version: 1.11 1. (45 pts.) Stock Picking.
School: University Of Illinois, Urbana Champaign
CS 473U: Undergraduate Algorithms, Fall 2006 Homework 0 Due Friday, September 1, 2006 at noon in 3229 Siebel Center Name: Net ID: Alias: I understand the Homework Instructions and FAQ. Neatly print your full name, your NetID, and an alias of your choice
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 8 Answer Sheet This lab is to be worked in a group. Name: _Siyuan Li _ Netid: _sli62_ Section: _AYI_ Part 1 Nested Loops 1. The following C program compiles without errors. Write the output produced by this program. #include <stdio.h> void main(void)
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 7 Answer Sheet Name: _Siyuan Li _ Netid: _sli62_ Section: _AYI_ Part 1: Doing Loops and Random Numbers 1. Run your program and enter 75 as input. Write down the results your program displays. _59_ _34_ _41_ _3_ _29_ 2. Rewrite the program in the loop
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Name: _Siyuan Li_NetID: _SLI62_ Section#: _AYI_ Part 1 Programming the function 'find_xy' . The first two steps involve writing out the math behind find_xy. 1. Write down the five equations. _ HF(yL - y1) /d1 + HF(y2 - y1)/d2=W1 _ _ HF(y1 - y2) /d2 + HF(y
School: University Of Illinois, Urbana Champaign
Course: Intro Computing : Engineering And Science
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab Activity 4 - Answers Name: _Ben Domash_ NetID: _bdomash2_ Section#: _AYL_ Part 1: Programming the find_h function 1. 1. Write down the five equations (by plugging in i from 1 to 5): For example your first equation (for i = 1) should look like this: _K
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab Activity 4 - Answers Name: _Ben Domash_ NetID: _bdomash2_ Section#: _AYL_ Part 1: Programming the find_h function 1. 1. Write down the five equations (by plugging in i from 1 to 5): For example your first equation (for i = 1) should look like this: _K
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file heap.cpp * Implementation of a heap class. */ #include <math.h> template <class T, class Compare> size_t heap<T, Compare>:root() const cfw_ / @todo Update to return the index you are choosing to be your root. return 1; template <class T,
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 4 November 29, 2011-11-29 ABE 224 Jialing Ye Runoff Measurement and Erosion Evaluation Objectives Measure runoff from bare soil and soil with erosion control blanket (ECB), and investigate soil loss and the effects of ECBs on soil erosion. Materials a
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file heap.h * Definitinon of a heap class. */ #ifndef _HEAP_H_ #define _HEAP_H_ #include <vector> / forward declare descriptor (used for printing, ignore) template <class Type, class Comp> class HeapNodeDescriptor; /* * heap: A priority queue im
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 8 Answer Sheet This lab is to be worked in a group. Name: _Yuting Zheng_ Netid: _yzheng27_ Section: _AYE_ Name: _ Netid: _ Section: _ Name: _ Netid: _ Section: _ Part 1 Nested Loops 1. The following C program compiles without errors. Write the output
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file heap.cpp * Implementation of a heap class. */ #include <math.h> template <class T, class Compare> size_t heap<T, Compare>:root() const cfw_ / @todo Update to return the index you are choosing to be your root. return 1; template <class T,
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 13 Answer Sheet Name: _Chuqian Huang_ Netid: _huang159_ Section: _ADY_ Part 1: Prelab Part A: Structures 1. Given the structures and variable declared above, complete the C code below by filling in the blanks to assign to the variable /mycd/ the follo
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 12 Answer Sheet This lab is to be worked individually. Name: _Jialing Ye_ Netid: _ye12_ Section: _AYJ_ Part 1: Prelab You should use the material found in Lecture 19&20 and 21 of the course notes. As with all prelabs/labs, if you are not sure of the a
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * Copyright 2011 University of Illinois at Urbana-Champaign * CS 225 Lab 04 C+ Object Oriented Programming * Authors: * Simon Krueger <skruege2@illinois.edu> * * Please see truck.h for documentation of the Truck class */ #include "truck.h" #incl
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * Copyright 2011 University of Illinois at Urbana-Champaign * CS 225 Lab 04 C+ Object Oriented Programming * Authors: * Simon Krueger <skruege2@illinois.edu> */ #include "flower.h" #include <cmath> #include <cstdio> #include "circle.h" #include "c
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file print_as_ascii.cpp * A simple command line program that prints a binary file (as created from * a BinaryFileWriter) as a sequence of ascii 0s and 1s. */ #include <iostream> #include <string> #include <vector> #include "binary_file_reader.h"
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file huffman_tree.cpp * Implementation of a Huffman Tree class. * * @author Chase Geigle * @date Summer 2012 */ #include <algorithm> #include <iostream> #include <queue> #include <utility> #include "huffman_tree.h" using namespace std; Huffman
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file encoder.cpp * Implementation of a namespace for encoding files using HuffmanTrees. * * @author Chase Geigle * @date Summer 2012 */ #include <fstream> #include <iostream> #include <string> #include <vector> #include <unordered_map> #includ
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file binary_file_writer.cpp * Implementation of a binary file class for output operations. * * @author Chase Geigle * @date Summer 2012 */ #include <iostream> #include "binary_file_writer.h" using namespace std; /* * Constructs a new BinaryFi
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file binary_file_reader.cpp * Implementation of a binary file class for input operations. * * @author Chase Geigle * @date Summer 2012 */ #include <iostream> #include "binary_file_reader.h" using namespace std; BinaryFileReader:BinaryFileReade
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file heap.cpp * Implementation of a heap class. */ template <class T, class Compare> size_t heap<T, Compare>:root() const cfw_ / @todo Update to return the index you are choosing to be your root. return 1; template <class T, class Compare> siz
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file graph.cpp * Graph Library Implementation * * Written for CS 225 Spring 2011 * @author Sean Massung */ #include "graph.h" /* * Constructor to create an empty graph. * @param isWeighted - specifies whether the graph is a weighted graph or
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file tests.cpp * Contains code to test the functions in GraphTools. * * Written for CS 225 Spring 2011 * @author Sean Massung * * Updated Spring 2012 */ #include <algorithm> #include <iostream> #include <sstream> #include <string> #include <
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file premade_graphs.cpp * * This file contains the implementation of the premade graphs. * Updated by Sean Massung for Spring 2012 * * @author Sean Massung * @date Spring 2011 */ #include "premade_graphs.h" /* * Returns a starting vertex fo
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file graph_tools.cpp * This is where you will implement several functions that operate on graphs. * Be sure to thoroughly read the comments above each function, as they give * hints and instructions on how to solve the problems. */ #include "gr
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file demo.cpp * * This file shows how the Graph class can be used. * Feel free to play around in this area! * * @author Sean Massung * @date Spring 2011 * * Updated by Sean Massung for Spring 2012 */ #include <iostream> #include <string>
School: University Of Illinois, Urbana Champaign
Course: Data Structures
#include "dsets.h" void DisjointSets:addelements(int num) cfw_ / dsets.clear(); / dsets.resize(num,-1); for(int i=0;i<num;i+) dsets.push_back(-1); int DisjointSets:find(int elem) cfw_ if(dsets[elem]<0) return elem; else return /*dsets[elem]=*/find(
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file main.cpp * Contains code to test your recursion, stack, and queue problems. */ #include <unistd.h> #include <iostream> #include <queue> #include <sstream> #include <stack> #include <string> #include "quackfun.h" #include "exercises.h" using
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file quackfun.cpp * This is where you will implement the required functions for the * stacks and queues portion of the lab. */ /* * Sums items in a stack. * @param s A stack holding values to sum. * @return The sum of all the elements in the
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file exercies.cpp * This file contains the recursion exercise code. */ #include "exercises.h" /* * Given a non-negative int n, return the sum of its digits recursively (no loops). * * @param n The number to sum the digits of * @return The sum
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file schashtable.cpp * Implementation of the SCHashTable class. * * @author Chase Geigle * @date Spring 2011 * @date Summer 2012 */ #include "schashtable.h" using hashes:hash; using std:list; using std:pair; template <class K, class V> SCHash
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file word_counter.cpp * Implementation of the WordFreq class. * * @author Chase Geigle * @date Spring 2011 * @date Spring 2012 */ using std:vector; using std:pair; using std:string; using std:ifstream; using std:istringstream; using std:cout;
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file logfile_parser.cpp * Implementation of the LogfileParser class. * * @author Chase Geigle * @date Spring 2011 * @date Summer 2012 */ #include "logfile_parser.h" #include <iostream> using std:string; using std:vector; using std:ifstream; u
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file lphashtable.cpp * Implementation of the LPHashTable class. * * @author Chase Geigle * @date Spring 2011 * @date Summer 2012 */ #include "lphashtable.h" using hashes:hash; using std:pair; template <class K, class V> LPHashTable<K,V>:LPHas
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Monad Autograder Testing lab_hash at 2013-04-15 00:44:00 "More than the act of testing, the act of designing tests is one of the best bug preventers known. The thinking that must be done to create a useful test can discover and eliminate bugs before they
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file charcount.cpp * CharFreq tester program. * * @author Chase Geigle * @date Spring 2011 * @date Summer 2012 */ #include "char_counter.h" #include <iostream> #include <sstream> #include <algorithm> using std:istringstream; using std:cout; u
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file anagramtest.cpp * Test for the anagram finder. * * @author Chase Geigle * @date Spring 2011 * @date Summer 2012 */ #include "anagram_finder.h" #include <iostream> #include <algorithm> using std:cout; using std:endl; using std:vector; usi
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file anagram_finder.cpp * Implementation of the AnagramFinder class. * * @author Chase Geigle * @date Spring 2011 * @date Summer 2012 */ #include "anagram_finder.h" using std:string; using std:vector; using std:ofstream; using std:endl; /* *
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 25 December 5 Fall 2014 Prove that the following languages are undecidable using Rices Theorem: Rices Theorem. Let be any nonempty proper subset of the set of acceptable languages. The language ACCEPTIN := M ACCEPT(M ) is undecidable. 1. ACCEP
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 24 December 3 Fall 2014 Proving that a language L is undecidable by reduction requires several steps: Choose a language L that you already know is undecidable. Typical choices for L include: Accept := M , w M accepts w Reject := M , w M reject
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 22 November 19 Fall 2014 Proving that a problem X is NP-hard requires several steps: Choose a problem Y that you already know is NP-hard. Describe an algorithm to solve Y , using an algorithm for X as a subroutine. Typically this algorithm ha
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 23 November 21 Fall 2014 Proving that a problem X is NP-hard requires several steps: Choose a problem Y that you already know is NP-hard. Describe an algorithm to solve Y , using an algorithm for X as a subroutine. Typically this algorithm ha
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 21 November 14 Fall 2014 1. Suppose you are given a magic black box that somehow answers the following decision problem in polynomial time: INPUT: A boolean circuit K with n inputs and one output . OUTPUT: TRUE if there are input values x 1 ,
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 14 October 15 Fall 2014 For each of the problems below, transform the input into a graph and apply a standard graph algorithm that youve seen in class. Whenever you use a standard graph algorithm, you must provide the following information. (I
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 20 November 12 Fall 2014 Describe algorithms for the following problems. The input for each problem is string M , w that encodes a standard (one-tape, one-track, one-head) Turing machine M whose tape alphabet is cfw_0, 1, and a string w cfw_0,
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 19 November 7 Fall 2014 Describe how to simulate an arbitrary Turing machine to make it error-tolerant. Specically, given an arbitrary Turing machine M , describe a new Turing machine M that accepts and rejects exactly the same strings as M , e
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 17 October 29 Fall 2014 1. A looped tree is a weighted, directed graph built from a binary tree by adding an edge from every leaf back to the root. Every edge has non-negative weight. 5 16 4 17 8 0 23 1 9 42 7 14 A looped tree. (a) How much tim
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 18 October 31 Fall 2014 Describe Turing machines that compute the following functions. In particular, specify the transition functions : Q Q cfw_1, +1 for each machine either by writing out a table or by drawing a graph. Recall that (p, $) = (q
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 16 October 24 Fall 2014 Suppose we are given both an undirected graph G with weighted edges and a minimum spanning tree T of G. 1. Describe an efcient algorithm to update the minimum spanning tree when the weight of one edge e T is decreased. 2
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 15 October 22 Fall 2014 For each of the problems below, transform the input into a graph and apply a standard graph algorithm that youve seen in class. Whenever you use a standard graph algorithm, you must provide the following information. (I
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 13 October 15 Fall 2014 Recall the class scheduling problem described in lecture on Tuesday. We are given two arrays S[1 . n] and F [1 . n], where S[i] < F [i] for each i, representing the start and nish times of n classes. Your goal is to nd t
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 12 October 10 Fall 2014 1. Suppose you are given a sequence of non-negative integers separated by + and signs; for example: 23+061+42 You can change the value of this expression by adding parentheses in different places. For example: 2 (3 + (0
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 11 October 8 Fall 2014 1. Its almost time to show off your ippin sweet dancing skills! Tomorrow is the big dance contest youve been training for your entire life, except for that summer you spent with your uncle in Alaska hunting wolverines. Yo
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 10 October 3 Fall 2014 A subsequence of a sequence (for example, an array, a linked list, or a string), obtained by removing zero or more elements and keeping the rest in the same sequence order. A subsequence is called a substring if its eleme
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 7 September 19 Fall 2014 Here are several problems that are easy to solve in O(n) time, essentially by brute force. Your task is to design algorithms for these problems that are signicantly faster. 1. (a) Suppose A[1 . n] is an array of n disti
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 5 September 12 Fall 2014 Prove that each of the following languages is not regular. 1. Binary palindromes: Strings over cfw_0, 1 that are equal to their reversals. For example: 00111100 and 0100010, but not 01100. [Hint: We did this in class.]
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 3 September 5 Fall 2014 Jeff showed the context-free grammars in class on Tuesday; in each example, the grammar itself is on the left; the explanation for each non-terminal is on the right. Properly nested strings of parentheses. S | S (S ) pr
School: University Of Illinois, Urbana Champaign
Course: Special Topics
CS 374 Lab 2 September 3 Fall 2014 Give regular expressions that describe each of the following languages over the alphabet cfw_0, 1. We wont get to all of these in section. 1. All strings containing at least three 0s. 2. All strings containing at least t
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS#105#!Fall$2013!Machine!Problem!4" 50#points" Submission!Deadline:!Monday,!October!28nd,!2013!6pm! 10%!deduction!of!earned!points!if!variables!do!not!follow!CS105!convention!or!if!Option! Explicit!is!not!present.!The!checker!you're!given!does!look!for!t
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
CS412 Mini MP 1 Knowing your data The MP borrows quite considerable amount of material from a certain source. We will publish the source after the submissions due date because it contains answers for a few questions. Dont try to find the existing answers
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
CS412 Mini MP 1 Knowing your data The MP borrows quite considerable amount of material from a certain source. We will publish the source after the submissions due date because it contains answers for a few questi
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Computer Science 105 (CS105) Fall 2013 Syllabus Instructors: Kai Zhao zhaok@illinois.edu talguy2@illinois.edu (Typo in printed version) guytal2@illinois.edu TAs: Megha Ailavajhala (ailavaj2@illinois.edu) Dhashrath Raguraman (raguram2@illinois.edu) Parimal
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
0 97 95 1 83 99 2 79 81 3 72 84 4 92 84 5 78 91 6 79 89 7 68 67 8 78 76 9 77 81 10 75 83 11 90 99 12 85 84 13 77 100 14 89 86 15 86 87 16 65 87 17 67 94 18 67 76 19 93 93 20 83 91 21 97 100 22 86 89 23 61 43 24 85 77 25 96 90 26 79 98 27 61 68 28 93 93 29
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
supermarket item_1 item_2 item_3 item_4 item_5 item_6 item_7 item_8 item_9 item_10 item_11 item_12 item_13 item_14 item_15 item_16 item_17 item_18 item_19 item_20 item_21 item_22 item_23 item_24 item_25 item_26 item_27 item_28 item_29 item_30 item_31 item
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Computer Science 105 (CS105) Fall 2012 Syllabus Instructors: Kai Zhao Aishwarya Stanley 2211 Siebel Center 2211 Siebel Center zhaok@illinois.edu astanle2@illinois.edu Email the instructor or TA for the section that you are enrolledyou may be penalized for
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Computer Science 105 (CS105) Fall 2013 Syllabus Instructors: Kai Zhao zhaok@illinois.edu Guy Tal guytal2@illinois.edu (Typo in printed version) talguy2@illinois.edu TAs: Megha Ailavajhala (ailavaj2@illinois.edu) Dhashrath Raguraman (raguram2@illinois.edu)
School: University Of Illinois, Urbana Champaign
Course: Data Structures
HCM UT HCM NU Faculty of Applied Science Department of Math Applied Ho Chi Minh City, 18 December 2008 Syllabus M ATH 385 INTRO DIFFERENTIAL EQUATIONS Credit Class Hours Overall Grade : 3 (2.1.5) Theory: 28 Exercises: 14 42 Consultation: 1 class hours per
School: University Of Illinois, Urbana Champaign
Course: Data Structures
HCMUT VNU Faculty of EEE HCMUT UIUC Joint Program in Power Engineering - Course Syllabus of Numerical Methods 1. Credits: 3 2. Level: year 3 3. Time distributtion - Attending lecture in class, including assignment solving: 21 h [7 sections] - Project cond
School: University Of Illinois, Urbana Champaign
Course: Distributed Systems
CS 425 Distributed Systems Lecture # 1 2 3 Date 6/1 6/2 6/4 Lecture Title Intoduction & Review Models of distributed systems Networking Comments Reading: Chapter 1 of the text book Reading: Chapter 2 of the text book Reading: Chapter 3 of the tex
School: University Of Illinois, Urbana Champaign
Course: Programing Languages
CS 421: Programming Languages and Compilers Class 1 2 3 4 5 6 7 8 9 10 11 12 13 Date June 1 June 2 June 4 June 8 June 9 June 11 June 15 June 16 June 18 June 22 June 23 June 25 June 29 June 30 July 2 14 15 16 17 18 19 20 21 22 23 24 25 July 6 July 7 J