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
Course: Intro Computing Engrg & Sci
/* edit.c */ #include "mp2.h" #include "user.h" int editMenu( void )cfw_ int i; printf("Edit Menu\n1. Edit quantity\n2. Edit price\n3. Add albums\n4. Remove an album\n0. Return to the main menu\nPlease enter the choice: "); scanf("%i", &i); return i;
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
/* input.c */ #include "mp2.h" #include "user.h" int readAlbums(char *filename, Album albums[], int num_albums, int max_size)cfw_ int track, i; FILE * fileptr; fileptr = fopen(filename, "r"); if (fileptr = NULL) return -1; if ( num_albums >= max_
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
Recursion: Deni&on: Recursion: If you s(ll don't get it, see: "Recursion". 1 Todays lecture ! ! ! ! ASCII & NULL-terminated strings 2-dimensional arrays in C Recursion ! My turn (Example) ! Your turn Callee-saved Registers ! M
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: Intro Computing Engrg & Sci
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 b a d c d b c c b d d c a b c a b b d d c b a c d a
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: Algorithms
service_id,date,exception_type I2 UIMF,20150119,1 I2 UIMF,20150120,1 I2 UIMF,20150121,1 I2 UIMF,20150122,1 I2 UIMF,20150126,1 I2 UIMF,20150127,1 I2 UIMF,20150128,1 I2 UIMF,20150129,1 I2 UIMF,20150202,1 I2 UIMF,20150203,1 I2 UIMF,20150204,1 I2 UIMF,2015020
School: University Of Illinois, Urbana Champaign
Course: Algorithms
fare_id,route_id,origin_id,destination_id,contains_id NORMAL,1, NORMAL,BROWN ALT,2, ISTOP,TEAL WEEKEND,2, NORMAL,GREENHOPPER EVENING,2, NORMAL,5E GREEN EXPRESS ALT,2, ISTOP,GOLDHOPPER,2, NORMAL,GREY,2, NORMAL,BLUE,2, ISTOP,YELLOWHOPPER,2, ISTOP,SILVER LIM
School: University Of Illinois, Urbana Champaign
Course: Algorithms
fare_id,price,currency_type,payment_method,transfers,transfer_duration ISTOP,0.00,USD,0,0, NORMAL,1.00,USD,0,1,
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Algorithms, Fall 2014 Practice Midterm 2: November 4, 2014 Instructions: This is a closed book exam. No notes, books, calculators, etc. are allowed. Answer Problem 1 and any four of the remaining. If you answer all questions we will take the sco
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Algorithms, Spring 2012 Midterm 1: February 23, 2012 Instructions: This is a closed book exam. No notes, books, calculators, etc. are allowed. Answer all problems. You can write I Dont Know for a problem (or its sub-parts) to get 25% credit for
School: University Of Illinois, Urbana Champaign
Course: Artificial Intelligence
\documentclass[12pt,letterpaper]cfw_article \newenvironmentcfw_proofcfw_\noindentcfw_\bf Proof:cfw_\qed\bigskip \newtheoremcfw_theoremcfw_Theorem \newtheoremcfw_corollarycfw_Corollary \newtheoremcfw_lemmacfw_Lemma \newtheoremcfw_claimcfw_Claim \newtheorem
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: 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: Intro Computing Engrg & Sci
/* edit.c */ #include "mp2.h" #include "user.h" int editMenu( void )cfw_ int i; printf("Edit Menu\n1. Edit quantity\n2. Edit price\n3. Add albums\n4. Remove an album\n0. Return to the main menu\nPlease enter the choice: "); scanf("%i", &i); return i;
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: Intro Computing Engrg & Sci
/* input.c */ #include "mp2.h" #include "user.h" int readAlbums(char *filename, Album albums[], int num_albums, int max_size)cfw_ int track, i; FILE * fileptr; fileptr = fopen(filename, "r"); if (fileptr = NULL) return -1; if ( num_albums >= max_
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
Course: Intro Computing Engrg & Sci
/* edit.c */ #include "mp2.h" #include "user.h" int editMenu( void )cfw_ int i; printf("Edit Menu\n1. Edit quantity\n2. Edit price\n3. Add albums\n4. Remove an album\n0. Return to the main menu\nPlease enter the choice: "); scanf("%i", &i); return i;
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
/* input.c */ #include "mp2.h" #include "user.h" int readAlbums(char *filename, Album albums[], int num_albums, int max_size)cfw_ int track, i; FILE * fileptr; fileptr = fopen(filename, "r"); if (fileptr = NULL) return -1; if ( num_albums >= max_
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: Progrmg Languages & Compilers
State and Explicit References Gul Agha CS 421 Spring 2015 Computational Effects Real world computation involves effects: Effects enable sharing of data Can cause nonlocal effects Effects may be as a change in state 2/19/2015 Printing a result Airline rese
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
State and Implicit References Gul Agha CS 421 Spring 2015 Computational Model We assume that computations may have effects. Recall the concepts: 3/3/2015 Store assignable value locations memory R-value, L-value CS 421 Spring 2015 2 Implicit References Mos
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Objects and Types Gul Agha CS 421 Spring 2006 New Features Fields and methods specified with their types Abstract classes and methods Casting and instanceof test Subtype polymorphism 4/3/2006 CS 421 Objects and Types 2 Example Program: Abstract Class abst
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Typed Languages Gul Agha CS 421 Types Example untyped universes Bit strings in computer memory S-expressions in LISP -expressions in -calculus Sets in set theory 3/12/2015 cs 421 2 Uniform Behavior same set of operations Without types can do different
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Continuation-Passing Interpreters Gul Agha CS 421 Spring 2015 Contexts An environment provides the bindings representing the data context for computation. Continuations provide the control context for computation. We will now study the control context.
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Parameter Passing Revisited Gul Agha CS 421 Spring 2015 Parameter Passing We previously discussed when arguments (parameters) are evaluated in an application (procedure call): Now we have variables bound to locations 3/3/2015 Eager evaluation Lazy evaluat
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Continuations Gul Agha CS 421 Spring 2015 A Recursive Definition of Factorial (define fact (lambda (n) (if (zero? n) 1 (* n (fact (- n 1) 4/5/02 CS 421 Continuations 2 Sample Factorial Execution (fact 4) -> (* 4 (fact 3) *4 -> (* 4 (* 3 (fact 2) -> (* 4 (
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Exception Handling Gul Agha CS 421 Spring 2015 Exceptions Continuations allow us to alter the control context. An application: exception handling Well add language constructs for exception handling 4/8/15 CS 421 Imperative Interpreter 2 Try Catch Expre
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Imperative Interpreter Gul Agha CS 421 Spring 2015 Execution Sequence of a Procedure Call 1. Save the current control context 2. Extend the environment with new variable bindings for the arguments of the call, and 3. Transfer control to the beginning of t
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Continuations and Control Gul Agha CS 421 Imperative Version of fact-iter (define n-reg '*) (define a-reg '*) (define fact-iter (lambda (n) (set! n-reg n) (set! a-reg 1) (fact-iter-acc/reg) CS 421 Spring 2005 2 Imperative version (contd.) (define fact-ite
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Actor Programming Languages Gul Agha University of Illinois at Urbana-Champaign http:/osl.cs.uiuc.edu Actor Languages and Frameworks Erlang E Axum Stackless Python Theron (C+) RevActor (Ruby) Dart 4/14/2015 Scala Actors ActorFoundry SALSA Kilim Jetlang Ac
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Actor Programming Languages (Part II) Gul Agha University of Illinois at Urbana-Champaign http:/osl.cs.uiuc.edu Actor primitives create: creating an actor from a behavior description and a set of parameters, possibly including existing actors; send to: se
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Hoare Logic Minas Charalambides April 30, 2015 What are we trying to do? Prove that our program does what we want it to do. How are we going to do it? By following a series of logical deductions. From the anticedents (pre-conditions) to the succedents (wh
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Logic Programming and Prolog Logic Programming and Prolog Karl Palmskog palmskog@illinois.edu 05/05/15 Logic Programming and Prolog Introduction and History The von Neumann Machine Model Memory Arithmetic/Logic Control Input Output Logic Programming and P
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Recall Introduction to Scheme A language is described by specifying its syntax and semantics Syntax: The rules for writing programs. Gul Agha CS 421 Fall 2015 Semantics: What the programs mean. Context Free Grammars. Informally, using English Operationall
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
CS 421 Quiz 7: 3/5/2015 Solution 1. let makerec = proc (f) let d = proc (x) proc (z) (f (x x) z) in proc (n) (f (d d) n) in let maketimes4 = proc (f) proc (x) if zero?(x) then 0 else -(f -(x,1), -4) in let times4 = (makerec maketimes4) in (times4 3) What
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
CS 421 Quiz 8 Solution 1. Write down a rule for doing type inference for let expressions. ( exp1 ) = 1 ( [ = 1] ) ( ( exp1 ) ) = 2 2. Using your rule, derive types for the following expression or determine that no such type exists. Let p = proc (z) z in i
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
CS 421 Quiz 6: 2/19/2015 Solutions 1. const int b = 15; int foo() cfw_ int a = b + 5; return a; int bar() cfw_ int b = 2; return foo(); int main() cfw_ foo(); bar(); return 0; What do the procedures foo() and bar() return when using (a) Static Scoping
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
CS 421 Quiz 9 Solution : 4/8/2015 Consider a recursive procedure to multiply a list of numbers. letrec lp (lst) = if null?(lst) then 1 else *(car(lst), lp(cdr(lst) 1. Optimize this procedure using try-catch and raise so that if the procedure lp encounters
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
CS 421: Quiz 5 Solution 2/12/2015 1. Evaluate: let x = 20 in let y = 5 in let f = proc (x) -(x, y) in let y = let x = 50 in -(x, 10) in let g = proc (z) -(z, x) in let g = proc (z) -(g x), y) in -(f y), (g 1)> ; x = 20 ; x = 20 , y = 40 ; y = 40 (value-of
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
CS 421 Quiz 10 Solution : 4/28/2015 Consider a recursive procedure to append a list to another list. (define myappend (lambda (xs ys) (if (null? xs) ys (cons (car xs) (myappend (cdr xs) ys) Convert the procedure into cps form (ll in the blanks): (define m
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Universal Turing Machines & Church-Turing Thesis TM recap DFA with (innite) tape. One move: read, write, move, change state. Transi,on Func,on : Q x Q x x cfw_L, R, S current state symbo
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Nondeterminis+c TMs NTM deni*ons Same as determinis+c TM, but (q,a) is a nite set of possible next transi*ons E.g., (q,a) = cfw_ (q1,b1,D1), (q2,b2,D2), . (qr,br,Dr) cannot write b1, go in direc+on D2, etc.
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Computa(onal Complexity (a taste; take CS 579 for the meal) Complexity = resources (me space ink gates energy Complexity is a func6on Complexity = f (input size) Value depends on: problem encoding adj. list
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Decidability Decision Problems A yes/no ques3on over many instances Given grammar G, is G ambiguous? Given a TM M, does L(M) = cfw_0,1* ? Given DFAs M1 and M2, does L(M1) = L(M2) ? Given a graph G, is G c
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374: Algorithms & Models of Computation, Spring 2015 NP and Polynomial Time Reductions Lecture 22 April 16, 2015 Chandra & Lenny (UIUC) CS374 1 Spring 2015 1 / 62 Part I NP, Showing Problems to be in NP Chandra & Lenny (UIUC) CS374 2 Spring 2015 2 / 62
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
HW4 Midterm Review Todays class: quick run-through of the material weve covered so far The selection of slides in todays lecture doesnt mean that you dont need to look at the rest when prepping for the exam! Slides are from previous lectures Ill not go in
School: University Of Illinois, Urbana Champaign
Course: Ethical & Professional Issues
Review Four types of IP protec3on schemes Three philosophies of IP Fair use FSF vs. OSI? Crea3ve Commons Lessigs four modes of regula3on Lessigs Code is law medium vs. place Two types of censorship
School: University Of Illinois, Urbana Champaign
Course: Ethical & Professional Issues
Welcome to CS210: Ethics and Professional Issues CS210 Spring 2015 Week 1 Who am I? COURSE POLICIES Grading 30% 20% 20% 5% 20% 5% Final exam Midterm exam Weekly wriHen assignments Weekly peer review Wee
School: University Of Illinois, Urbana Champaign
Course: Ethical & Professional Issues
Implicit(Associa-on(Tes-ng( Project(Implicit( h8ps:/implicit.harvard.edu/implicit/( Le@(hand(side,(click(orange(Go!(bu8on.( Take(one(of(these(two(surveys:( GenderICareer(IAT( GenderIScience(IAT( The(Gender(Divide( DOES%IMPLICIT%BIAS%MATTER?% IS%IT%J
School: University Of Illinois, Urbana Champaign
Course: Ethical & Professional Issues
CS210: Regula.ng Commerce and Speech CS210 Spring 2015 Week 10 Four Modes of Regula.on 1. 2. 3. 4. Laws Norms Markets Architecture (Code) Regula.on by Code Code is law - Lessig Programs and devices sets the ter
School: University Of Illinois, Urbana Champaign
Course: Ethical & Professional Issues
Professional Ethics CS210 Spring 2015 Week 13 PROFESSIONALISM Professional Occupa=on where decisions and ac=ons have signicant social eects (e.g. doctors, lawyers) Roles and responsibili=es exceed those of non-professi
School: University Of Illinois, Urbana Champaign
Course: Ethical & Professional Issues
CS210: Ethical Theories CS210 Spring 2015 Week 3 Announcements Second wri@en assignment has been posted Name the le W2.PDF Due on Monday (11:59pm) NO LATE ASSIGNMENTS NO IDENTIFYING INFORMATION Announcements
School: University Of Illinois, Urbana Champaign
Course: Ethical & Professional Issues
Review Accessibility privacy Decisional privacy Informa7onal privacy Descrip7ve vs. norma7ve privacy Contextual integrity Instrumental vs. intrinsic value Norms of appropriateness vs. distribu7on Merging vs. matchin
School: University Of Illinois, Urbana Champaign
Course: Ethical & Professional Issues
CS210: Philosophical Ethics CS210 Spring 2015 Week 2 Announcements First wri?en assignment has been posted Due on Monday (11:59pm) NO LATE ASSIGNMENTS Submit via SVN MUST be PDF MUST not have idenQfying info
School: University Of Illinois, Urbana Champaign
Course: Ethical & Professional Issues
CS210: Intellectual property CS210 Spring 2015 Week 9 Property Law Establishing relationships between: 1. individuals 2. objects 3. the state What Is Property? When discussing property, we tend to think of tangible items. Originally, "prope
School: University Of Illinois, Urbana Champaign
Course: Ethical & Professional Issues
Review Non sequitur Appeal to novelty Fallacy fallacy Poisoning the well Tu quouqe Equivoca<on Argument from ignorance Complex ques<on Begging the ques<on Post hoc propter hoc Naturalis<c fallacy Special pleading
School: University Of Illinois, Urbana Champaign
Course: Ethical & Professional Issues
Review What is a valid argument? What is a sound argument? What is an induc6ve argument? What is a fallacious argument? Announcements Fourth wri:en assignment has been posted Peer reviews from last week have been
School: University Of Illinois, Urbana Champaign
Course: Ethical & Professional Issues
CS210: Logical Argumenta6on CS210 Spring 2015 Week 4 Announcements Third wriAen assignment has been posted Peer reviews from last week have been posted Review What is morality? What is ethics? What does morally
School: University Of Illinois, Urbana Champaign
Course: Artificial Intelligence
cs440_style.tex is the style file, do not edit this Write your homework in hw-template.tex after modifiying the required parameters such as homework number, name, etc.
School: University Of Illinois, Urbana Champaign
Course: Artificial Intelligence
index = 0; s = empty; for i= 1 to n do if(i.index is undefined) then strongconnect(i) end if if(-i.index is defined & -i.lowlink = i.lowlink) output True end if end for function strongconnect(v) v.index = index; v.lowlink = index; index += 1 S.p
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS440 Spring 2014 Midterm Exam Reference Answer 80 points in total [Page 2] 1. (9pts) Goal: For constrained convex optimization, we have to make sure that the domain forms a convex set. Reference: Lecture3.pdf p19 - p25 Note: a) b) are graded collectively
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Homework 1 Tutorial Long Pham CS411 Spring 2015 UIUC Agenda Some random stuff you should know [3] Walk through the ER question in CS411 midterm exam Fall 2013 [15] Referential constraint ~ Rounded arrow Multiplicity Weak entity set Multiway relationship s
School: University Of Illinois, Urbana Champaign
Course: Algorithms
The Entity-Relationship Model Continued T. M. Murali September 27, 2010 T. M. Murali September 27, 2010 CS 4604: E/R model Multiway Relationships I I I Relationships may connect more than two entity sets. Consider scenario two in the handout: 1 professor
School: University Of Illinois, Urbana Champaign
Course: Algorithms
The Entity-Relationship Model Continued T. M. Murali September 27, 2010 T. M. Murali September 27, 2010 CS 4604: E/R model Roles in Relationships Can the same entity set appear more than once in the same relationship? T. M. Murali September 27, 2010 CS 46
School: University Of Illinois, Urbana Champaign
Course: CS 231
CS233 = My MPs and labs from CS233 at UIUC, posted for anyone to look at. The university doesn't archive previous versions of the class site, so I can't find what exactly each MP is supposed to do. However, most of them are pretty self-explanatory. Why wo
School: University Of Illinois, Urbana Champaign
Course: Algorithms
route_id,service_id,trip_id,trip_headsign,direction_id,block_id,shape_id ILLINI EVENING,I6UISU,[@14.0.56288498@][1][1313598715922]/6_I6UISU,NORTH - NORTH LINCOLN,0,I6UISU,ILLINI EV 25 ILLINI EVENING,I6UISU,[@7.0.41950648@][1][1246908186625]/185_I6UISU,NOR
School: University Of Illinois, Urbana Champaign
Course: Algorithms
route_id,agency_id,route_short_name,route_long_name,route_desc,route_type,route_url,route_color,route_text_color BROWN ALT,CUMTD,9,Brown A Alternate,3,823822,ffffff TEAL WEEKEND,CUMTD,120,Teal Weekend,3,006991,ffffff GREENHOPPER EVENING,CUMTD,50,Greenhopp
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
Recursion: Deni&on: Recursion: If you s(ll don't get it, see: "Recursion". 1 Todays lecture ! ! ! ! ASCII & NULL-terminated strings 2-dimensional arrays in C Recursion ! My turn (Example) ! Your turn Callee-saved Registers ! M
School: University Of Illinois, Urbana Champaign
Registers and Register Files 1 Todays lecture ! ! Memory ! Addressable storage Register Files ! Registers ! Decoders 2 How can we store more than 1 bit? ! We build registers out of ip ops. ! Example 4-bit register made of four D ip o
School: University Of Illinois, Urbana Champaign
Number Systems (in Binary) 1 Todays lecture ! ! ! ! Represen:ng things with bits ! N bits gets you 2N representa0ons Unsigned binary number representa:on ! Conver0ng between binary and decimal ! Hexadecimal nota0on Binary Addi:on & Bit
School: University Of Illinois, Urbana Champaign
Finite State Machines 1 Todays lecture ! ! ! Goal: Build a sequen9al circuit from a state diagram ! Step 0: Problem specica3on ! Step 1: Build the state diagram ! Setp 2: Build the state table ! Step 3: Build the sequen3al ci
School: University Of Illinois, Urbana Champaign
Building an ALU (Part 2): 1 Todays lecture ! ! ! ! Well nish the 32-bit ALU today! ! 32-bit ALU specica1on Complete 1-bit ALU Assembling them to make 32-bit ALU Handling ags: ! zero, nega1ve, overow 3 Building 32-bit ALU overow zero ne
School: University Of Illinois, Urbana Champaign
X" 0" 0" 1" 1" 233: ALU 1 1 + 1 1 1 1 1 1 0 1 0 0 1 1 0 1 0 1 Carries Augend Addend Sum ! S = X Y Cin Cout = XY + (X Y)Cin X! 0! 0! 0! 0! 1! 1! 1! 1! Y! 0! 0! 1! 1! 0! 0! 1! 1! Y" 0" 1" 0" 1" Cin! 0! 1! 0! 1! 0! 1! 0! 1! C" " "
School: University Of Illinois, Urbana Champaign
A control B 3 module alu1(out, carryout, A, B, carryin, control);! output out, carryout;! carryin R0# Output# input A, B, carryin;! input [2:0] control;! 0# undefined# carryout 1# 2# 3# 4# 5# 6# 7# out 1-bit ALU slice A B out undefined# Xi#+#Yi# Xi#3#Yi#
School: University Of Illinois, Urbana Champaign
Assume the following register alloca3on: $13 = x, $20 = y, $15 = z Write MIPS code to compute the following expression? z = 4 + x*y z; R-type op rs rt rd shamt func 6 bits 5 bits 5 bits 5 bits 5 bits 6 bits add
School: University Of Illinois, Urbana Champaign
Threads and Cache Coherence in Hardware ! Previously, we introduced multi-cores. Today well look at issues related to multi-core memory systems: 1. Threads 2. Cache coherence Intel Core i7 5/4/15 2012 Craig Zilles 1 Remember we introduced the MIPS memory
School: University Of Illinois, Urbana Champaign
Atomic Operations in Hardware ! Previously, we introduced multi-core parallelism. Today well look at Instruction support for synchronization. And some pitfalls of parallelization. And solve a few mysteries. Intel Core i7 December 1, 2006 2006 Craig Zil
School: University Of Illinois, Urbana Champaign
Instant replay ! The semester was split into roughly four parts. The 1st quarter covered how a (very simple) computer worksfrom gates to the fetch-execute model. The 2nd quarter covered instruction set architecturesthe interface between software and har
School: University Of Illinois, Urbana Champaign
Whats Inside A Disk Drive? Arm Spindle Platters Actuator SCSI connector Electronics (including a processor and memory!) Image courtesy of Seagate Technology 1 Disk Geometry ! ! ! Disks consist of pla;ers, each with two surfaces. Each surface consists o
School: University Of Illinois, Urbana Champaign
Cache Writing & Performance ! Today well finish up with caches; well cover: Writing to caches: keeping memory consistent & write-allocation. Well try to quantify the benefits of different cache designs, and see how caches affect overall performance. We
School: University Of Illinois, Urbana Champaign
A Real Problem ! What if you wanted to run a program that needs more memory than you have? April 20, 2015 1 Virtual Memory (and Indirection) ! Finally, we get to Virtual Memory! Well talk about the motivations for virtual memory Well talk about how it i
School: University Of Illinois, Urbana Champaign
How will execution time grow with SIZE? int array[SIZE]; int A = 0; for (int i = 0 ; i < 200000 ; + i) cfw_ for (int j = 0 ; j < SIZE ; + j) cfw_ A += array[j]; TIME Plot a b e c April 16, 2003 d Cache introduction 1 SIZE Actual Data from remsun2.ews.ui
School: University Of Illinois, Urbana Champaign
How big is the cache? For a byte-addressable machine with 16-bit addresses with a cache with following characteristics: ! It is direct-mapped (as discussed last time) ! Each block holds one byte ! The cache index is the four least significant bits a) b) T
School: University Of Illinois, Urbana Champaign
Cache Performance: Analyzing Memory Access Pa2erns and Predic4ng the Number of Cache Misses Craig Zilles and Maria Gazaran 1 Todays lecture ! ! Review: Cache Size Rela<onships Predic<ng Cache Performance from Code ! Memory access
School: University Of Illinois, Urbana Champaign
Pipeline Architecture since 1985 ! Last time, we completed the 5-stage pipeline MIPS. Processors like this were first shipped around 1985 Still a fundamentally solid design ! Nevertheless, there have been advances in the past 30 years. Deeper Pipelines
School: University Of Illinois, Urbana Champaign
Instruc(on sets & RISC vs. CISC, Compilers, Assemblers, Linkers, & Loaders, malloc/new & Memory images, and who cares about assembly. 1 A few quick clicker ques(ons ! ! A) Im aGending lecture because I value learning B) Im not here, Im o drinking m
School: University Of Illinois, Urbana Champaign
MIPS control ow instruc1ons: Jumps, Branches, and Loops 1 Todays lecture ! ! ! Control Flow ! Programma(cally upda(ng the program counter (PC) Jumps ! Uncondi(onal control ow ! How is it implemented? Branches ! Loops ! If/then/els
School: University Of Illinois, Urbana Champaign
Functions in MIPS 1 Todays lecture: Implemen4ng Func4ons! The programs ow of control must be changed. The Jump and Link (jal) instruc7on (NEW!) Using Jump Register (jr) Arguments and return values are passed back &
School: University Of Illinois, Urbana Champaign
Boolean Algebra and Its Rela1on to Gates An Introduc+on to CS233 1 233 in one slide! ! The class consists roughly of 4 quarters: 1. 2. 3. 4. ! You will build a simple computer processor You will learn how high-level language code
School: University Of Illinois, Urbana Champaign
Building an ALU (Part 1): 1 Todays lecture ! ! ! ! We start building our computer! ! Well start with the arithme.c/logic unit (ALU) Adding single bits ! Half Adders and Full Adder MulA-bit ArithmeAc ! Hierarchical design ! Subtrac
School: University Of Illinois, Urbana Champaign
All Together: Instruc1on Memory + Arithme1c Machine 1 What do you get if you connect a register to an adder? out [3:0] A[3:0] Adder 0 0 0 1 B[3:0] D3 D2 D1 D0 Q3 Q2 Q1 Q0 reset enable 2 out [3:0] D3 D2 D1 D0 A[3:0] Adder 0 0 0 1 B[3:0] D[3:0] Q[3:0]
School: University Of Illinois, Urbana Champaign
Propaga'on Delay: NOT A (input) B (output) NOT NOT NOT 1 0 A B 1 1 0 0 1 1 0 0 t propogation Time Time A memory should have at least three proper6es. SR Latch 1. It should be able to hold a value. 2. You should be able
School: University Of Illinois, Urbana Champaign
D3 D2 D1 D0 Q3 Q2 Q1 Q0 reset enable D3 D2 D1 D0 Q3 Q2 Q1 Q0 reset enable clk 1 0 reset W_addr W_data W_en R_addrA R_dataA 0 1 0 1 1 0 1 0 0xa 0x1 0x5 0xf 0xe 1 0 1 0 1 0 R_addrB R_dataB 1 0 1 0 Time
School: University Of Illinois, Urbana Champaign
Exposing Thread-level Parallelism ! Previously, we looked at exposing parallelism at the instruction level SIMD: Single Instruction, Multiple Data ! Now, still parallelism, but at the thread-level. What are Multi-Core Processors? Why are they coming no
School: University Of Illinois, Urbana Champaign
The Design Process Key Idea: Iterative Refinement Understand Requirements 1. Build simplest possible implementation Implement 2. Does it meet criteria? If so, stop. Else, what can be improved? Evaluate/ Prioritize/ 3. Generate ideas on how to improve it A
School: University Of Illinois, Urbana Champaign
Pipelining the MIPS Datapath 1 Todays lecture ! Pipeline implementa:on ! Single-cycle Datapath ! Pipelining performance ! Pipelined datapath ! Example 2 Single-cycle implementation ! So far we have built a single-cycle implementation of a su
School: University Of Illinois, Urbana Champaign
Stalls and flushes ! Last time, we discussed data hazards that can occur in pipelined CPUs if some instructions depend upon others that are still executing. Many hazards can be resolved by forwarding data from the pipeline registers, instead of waiting f
School: University Of Illinois, Urbana Champaign
MIPS Load & Stores 1 Todays lecture ! MIPS Load & Stores ! Data Memory ! Load and Store Instruc3ons ! Encoding ! How are they implemented? 2 We need more space! ! Registers are fast and convenient, but we have only 32 of them, and each o
School: University Of Illinois, Urbana Champaign
What does this C code do? int foo(char *s) cfw_ int L = 0; while (*s+) cfw_ +L; return L; March 4, 2015 Machine Language and Pointers 1 Machine Language and Pointers ! Array Indexing vs. Pointers Pointer arithmetic, in particular March 4, 2015 Machine
School: University Of Illinois, Urbana Champaign
State: From Latches to Flip Flops 1 Todays lecture ! ! Storing State ! SR Latch Synchronous Design ! Clocks ! D Flip Flops 3 Propoga;on Delay ! ! Real gates dont switch instantaneously ! There is a latency between when the input c
School: University Of Illinois, Urbana Champaign
MIPS assembly programming: 1 Todays lecture ! ! Assembly programming ! Register names ! How is it implemented? Branches ! Loops ! If/then/else ! How implemented? 2 What you will need to learn for exam 2 ! ! You must become fluent in MI
School: University Of Illinois, Urbana Champaign
Combina(onal Logic Design 1 Todays lecture ! ! ! ! Combina(onal Logic ! Dierent Representa-ons of Boolean Func-ons (review) How to design any circuit ! Write a truth table ! Sum-of-Products implementa-on ! Example Other gates you
School: University Of Illinois, Urbana Champaign
Program Optimization Through Loop Vectorization Topics covered What are the microprocessor vector extensions or SIMD (Single Instruction Multiple Data Units) Overcoming limitations to SIMD-Vectorization Data Dependences Data Alignment Aliasing Non-unit
School: University Of Illinois, Urbana Champaign
Note how everything goes left to right, except 1 0 PCSrc IF/ID 4 ID/EX EX/MEM MEM/WB Add P C Add RegWrite Read register 1 Read Instruction address [31-0] Instruction memory Read register 2 Read data 1 Read data 2 Write register Write data Instr [15 - 0]
School: University Of Illinois, Urbana Champaign
A Timely Question. ! Most modern operating systems pre-emptively schedule programs. If you are simultaneously running two programs A and B, the O/S will periodically switch between them, as it sees fit. Specifically, the O/S will: Stop A from running
School: University Of Illinois, Urbana Champaign
How do we evaluate computer architectures? ! Think of 5 characteristics that differentiate computers? Can some processors compute things that others cant? March 16, 2015 How do we evaluate computer architectures? ! Think of 5 characteristics that differe
School: University Of Illinois, Urbana Champaign
Instruc(on Decoding 1 Todays lecture ! ! Instruc(on Encoding ! R-type & I-type encodings Instruc(on Decoding ! Operands ! Sign-extending the immediate ! Decoding the ALU opera<on 2 MIPS Instruction Review ! MIPS provides arithmetic an
School: University Of Illinois, Urbana Champaign
Number Systems II: 2s Complement, Arithme2c, Overow, & Wri2ng Bit-wise Logical & Shi@ing Code 1 Todays lecture ! ! ! Twos complement signed binary representa:on ! Nega2ng numbers in Twos complement ! Sign extension Bit-wise shi> o
School: University Of Illinois, Urbana Champaign
Building an Arithme0c Machine 1 Todays lecture ! The Arithme0c Machine ! Programmable hardware ! Instruc4on Set Architectures (ISA) ! Instruc4ons & Registers ! ! Assembly Language Machine Language 2 Building an arithme0c machine ! W
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Environment-Passing Interpreters Gul A. Agha CS 421 Spring 2015 Structure of Interpretation Front End Interpreter answer Program Text Syntax Tree 2/10/2015 CS 421 2 Real-World Computation is Interactive Real World Input-output Front End Program Text 2/10/
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Interpreters for a Language with Procedures Gul A. Agha CS 421 Spring 2015 Syntax for Procedures <expression> proc (<identifier>cfw_,<identifier>* ) proc-exp (ids body) let f = proc (y, z) +(y, -(z,5) in (f 2 28) 2/12/2015 CS 421 2 Procedures Expression
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Variables and Scoping Gul A. Agha CS 421 Spring 2015 Variables Reference to a variable: variable is used (its value or denotation is looked up) (f x y) Which variables are referenced above? Declaration: when a variable is introduced as a name (lambda (x
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Lambda-Calculus (revisited) Gul Agha CS 421 Spring 2015 Untyped -Calculus Only three kinds of expressions: Variables: x, y, z, w, Abstraction: x. e (Function creation) Application: e1 e2 1/30/06 - 2/1/06 CS 421 UIUC 2 Untyped -Calculus Grammar <expre
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
Why does it work? We have not addressed the question of why does this classifier performs well, given that the assumptions are unlikely to be satisfied. The linear form of the classifiers provides some hints. Bayesian Learning CS446 -FALL 14 Nave Bayes: T
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
Bayesian Classifier f:XV, finite set of values Instances xX can be described as a collection of features x = (x1, x2, xn) xi 2 cfw_0,1 Given an example, assign it the most probable value in V Bayes Rule: v argmax P(v | x) argmax P(v | x , x ,., x ) MAP v
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
Administration Final Exam: Next Tuesday, 12/9 12:30, in class. Material: Everything covered from the beginning of the semester Format: Similar to mid-term. Closed books HW 7: Due on Thursday, 8am; (no additional time) Final Projects: Due on Tuesday, 12/16
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
So far Bayesian Learning What does it mean to be Bayesian? Nave Bayes Independence assumptions EM Algorithm Learning with hidden variables Today: Representing arbitrary probability distributions Inference Exact inference; Approximate inference Learning Re
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
Semi-Supervised Learning Consider the problem of Prepositional Phrase Attachment. Buy car with money ; buy car with wheel There are several ways to generate features. Given the limited representation, we can assume that all possible conjunctions of the 4
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
(recap) Kernel Perceptron Examples : x cfw_0,1 n ; Nonlinear mapping : x t(x), t(x) R n' Hypothesis : w R ; Decision function : f(x) sgn(i1 w i t(x)i ) sgn(w t(x) n' n' If f(x (k) ) y(k) , w w r y (k)t (x (k) ) If n is large, we cannot represent w explici
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
Administration HW3 HW4 HW2 MultiClass CS446 Fall 14 Problems with Cheating Administration Mid-term on Thursday. Please come a few minutes early so that you can all start at 12:30 4 questions; covering all the material up to and including Boosting. Closed
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
Recap: Error Driven Learning Consider a distribution D over space XY X - the instance space; Y - set of labels. (e.g. +/-1) Can think about the data generation process as governed by D(x), and the labeling process as governed by D(y|x), such that D(x,y)=D
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
A Guide Learning Algorithms Search: (Stochastic) Gradient Descent with LMS Decision Trees & Rules Importance of hypothesis space (representation) How are we doing? Quantification in terms of cumulative # of mistakes More later Perceptron How to deal bette
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: Intro Computing Engrg & Sci
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 b a d c d b c c b d d c a b c a b b d d c b a c d a
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. B C B C C A B B C A D D A D C D D A C D C C B B A A
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. B B C C A D B D A B C A B D B A D C B C B D A A B D
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. A D C B D C C A B B A A B B C D D C D C A B A C D B D
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. c c d a d c b a c d c a b c a a c a b d c b d a c b
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
1. D 2. C 3. B 4. D 5. A 6. D 7. B 8. B 9. C 10. A 11. C 12. A 13. A 14. D 15. B 16. B 17. C 18. D 19. C 20. B 21. A 22. D 23. C 24. A 25. C 26. B
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
CS101 Fall 2014 Midterm II (120 minutes) Tuesday, December 2nd READ and complete the following: Bubble your Scantron only with a No. 2 pencil. On your Scantron (shown in the gure below), bubble : 1. 2. 3. 4. Your Name Your NetID Form letter "A" Bubble t
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. D C A B A D C A B C A D B A C C A D D B B C D C B C A
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
CS101 Spring 2014 Midterm I (60 minutes) Thursday, February 27th READ and complete the following: Bubble your Scantron only with a No. 2 pencil. On your Scantron (shown in the gure below), bubble : 1. 2. 3. 4. Your Name Your NetID Form letter "A" Bubble
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. B A D C D B D A C D C A B C A B D A D C B B D C B C
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. B D C A C D B B D A B A C A B A D D B C A C D B C B
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
CS101 Fall 2014 Midterm I (60 minutes) Thursday, October 2nd READ and complete the following: Bubble your Scantron only with a No. 2 pencil. On your Scantron (shown in the gure below), bubble : 1. 2. 3. 4. Your Name Your NetID Form letter "A" Bubble the
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
1. b 2. c 3. a 4. b 5. c 6. a 7. d 8. b 9. a 10. c 11. b 12. d 13. d 14. c 15. b 16. a 17. c 18. c 19. a 20. c 21. b 22. a 23. b 24. d 25. b 26. c
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
1. d 2. b 3. d 4. d 5. a 6. c 7. d 8. c 9. c 10. a 11. a 12. d 13. a 14. a 15. b 16. b 17. d 18. a 19. a 20. c 21. b 22. d 23. c 24. b 25. a 26. c
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
CS101 Summer 2014 Midterm Wednesday, July 9th READ and complete the following: Bubble your Scantron only with a No. 2 pencil. On your Scantron (shown in the gure below), bubble : 1. Your Name 2. Your NetID 3. Form letter "A" 4. Bubble the corresponding
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 B D C A A A C B B C C D A C B C B A D A C B C D D B
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
CS101 Summer 2012 Final (120 minute exam) Friday, August 3rd READ and complete the following: Bubble your Scantron only with a No. 2 pencil. On your Scantron (shown in the gure below), bubble : 1. Your Name 2. Your NetID 3. Form letter "A" 4. Bubble the
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. B A C C B C A C A D B A D B C D D B B A B C B D C C
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. D B B C D A D B B C B C C B C A A D A D A C B B C B
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. B C C A D B D C B B A B C A D D D C B D A B B A B A D
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. D D A A C B B C A D A B C C B C A C B C D B A C D B D
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
CS446: Machine Learning Fall 2014 Mid-term Exam Solutions October 23rd , 2014 This is a closed book exam. Everything you need in order to solve the problems is supplied in the body of this exam. This exam booklet contains four problems. You need to solv
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
CS446: Machine Learning Fall 2014 Mid-term Exam October 23rd , 2014 This is a closed book exam. Everything you need in order to solve the problems is supplied in the body of this exam. This exam booklet contains four problems. You need to solve all prob
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
CS446: Machine Learning Fall 2012 Mid-term Exam October 30th , 2012 This is a closed book exam. Everything you need in order to solve the problems is supplied in the body of this exam. Note that there is an appendix with possibly useful formulae and comp
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
CS446: Pattern Recognition and Machine Learning Spring 2005 Midterm Exam March 18, 2005 This is a closed book exam. Everything you need in order to solve the problems is supplied in the body of this exam. The exam ends at 1:45 pm. It contains 5 problems.
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
CS446: Pattern Recognition and Machine Learning Spring 2005 Midterm Exam March 18, 2005 This is a closed book exam. Everything you need in order to solve the problems is supplied in the body of this exam. The exam ends at 1:45 pm. It contains 5 problems.
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
CS446: Machine Learning Fall 2011 Mid-term Exam October 25th , 2011 This is a closed book exam. Everything you need in order to solve the problems is supplied in the body of this exam. Note that there is an appendix with possibly useful formulae and comp
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
CS446: Machine Learning Fall 2011 Mid-term Exam Solution October 25th , 2011 This is a closed book exam. Everything you need in order to solve the problems is supplied in the body of this exam. Note that there is an appendix with possibly useful formulae
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
CS446: Machine Learning Fall 2012 Mid-term Exam Solutions October 30th , 2012 This is a closed book exam. Everything you need in order to solve the problems is supplied in the body of this exam. Note that there is an appendix with possibly useful formula
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
CS446: Machine Learning Fall 2005 Midterm Exam Solutions : Addendum October 23, 2011 Problem 4. (d) [On-Line Learning and PAC Learning] Explain what is required in order to guarantee ( , ) behavior (recall (b). Solution: In order to guarantee ( , ) behav
School: University Of Illinois, Urbana Champaign
Course: Artificial Intelligence
Points were deducted for: a missing arc, which shows an additional conditional independence you assumed (1 point each, up to 2); too many missing arcs (3 points); any arrow going from a node to a previous node, any cycle in the graph, simply reversing the
School: University Of Illinois, Urbana Champaign
Course: Artificial Intelligence
(a) (6 points) Yes,No,Yes,Yes According to the BN construction algorithm (Lecture 11, page 20), parents are selected from the nodes already added. Arrows are added if the candidate parent inuences the current node when all the other previous nodes are kep
School: University Of Illinois, Urbana Champaign
Course: Algorithms
(a) (6 points) Yes,No,Yes,Yes According to the BN construction algorithm (Lecture 11, page 20), parents are selected from the nodes already added. Arrows are added if the candidate parent inuences the current node when all the other previous nodes are kep
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Algorithms, Spring 2014 Final Exam: May 9, 2014 Instructions: This is a closed book exam. No notes, books, calculators, etc. are allowed. Answer Problems 1, 2 and any four from 3, 4, 5, 6, 7. Read all questions before deciding which ones to answ
School: University Of Illinois, Urbana Champaign
1. ShortMultipleChoice dcccd,cdcca,bbbb 2. LamportTimestamps 1) 2 2) 2 3) 8 4) [2,5,2,2] 5) 0 3. Multicast 1) [1,2,1,1] 2) 1 3) [1,1,1,1] 4) 4 4. GlobalSnapshots 1) b,e,f 2) 2 3) 1 4) 0 5. P2PSystems Areallygoodsolution: a. Theithfingertableentryatnodenis
School: University Of Illinois, Urbana Champaign
1. ShortMultipleChoice ccabb,bbdcc,cdcd 2. LamportTimestamps 1) [2,5,2,2] 2) 0 3) 2 4) 2 5) 8 3. Multicast 1) [1,1,1,1] 2) 4 3) [1,2,1,1] 4) 1 4. GlobalSnapshots 1) 1 2) 0 3) b,e,f 4) 2 5. P2PSystems Areallygoodsolution: a. Theithfingertableentryatnodenis
School: University Of Illinois, Urbana Champaign
CS 425 Distributed Systems, Fall 2014, University of Illinois at Urbana-Champaign Midterm Review Problems Notes: The midterm will be closed book, closed note. It will last 75 minutes. The midterm paper will contain the following two types of questions - m
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: 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: Intro Computing Engrg & Sci
Lab Activity 4 - Answers Name: _Noctis K. Yamazaki-Triendl_ NetID: _ Section#: _AYD_ Part 1: Programming the find_xy function 1.Write down the five equations. Your equations should not use any of the di . I=1 I=2 I=3 I=4 I=5 K2*(h2-h1)- K1*h1 = W1-K1*HL K
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab Activity 5 - Answer Sheet Name: _ Part 1: Prelab 1. Using the built-in function fzero write the Matlab command(s) to find a root of the function y=x6- ln4(x) with an initial guess ofx= 3.(Don't write the root .5671 approx.) _x = fzero('x^6-(log(x)^4',
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
CS101 - Lab Activity 3 Name: _Noctis K. Yamazaki-Triendl Note for grader? _ _ Objectives In this lab, you will: Understand the difference between MATLAB functions and scripts. Learn to use function parameters and return values. Write a function to compute
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Name: _Noctis K. Yamazaki-Triendl_ Section # _AYD_ Note for grader? Solo Lab Activity #2 Answer Sheet Part 1 Matlab constants 1. > string = [ 'y = ' , num2str(number) , ' * cos(x)' ]; number _size:1x1 Bytes: 8 Class: double_ string _size:1x17 Bytes: 34 Cl
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 6 Answer Sheet Name: _Noctis K. Yamazaki-Triendl Simple C programs When copying/pasting code into the gedit editor make sure that copy the code directly from the html document. Do not first copy/paste the code into Open Office and then into gedit othe
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
CS101 Lab activity #1 Answer Sheet Name: _Noctis K. Yamazaki-Triendl_ Section: _AYD_ Getting Started Your first task is to log-in to a computer. Type your NetID in the box marked 'Login:' Type your Active Directory (AD) password in the box marked 'Passwor
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
CS 374 Lab 4 February 4 Spring 2015 This lab covers the subset construction to convert an NFA to a DFA that accepts the same language and also on how to use the power of NFAs to prove closure under some non-trivial operations. 1. Consider the NFA dened by
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Lab 15 March 20 Spring 2015 1. A party of n people have come to dine at a fancy restaurant and each person has ordered a different item from the menu. Let D1 , D2 , . . . , Dn be the items ordered by the diners. Since this is a fancy place, each it
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Lab 14 March 18 Spring 2015 1. Let X = x 1 , x 2 , . . . , x m and Y = y1 , y2 , . . . , yn be two sequences. A common supersequence of X and Y is another sequence to which X and Y are both subsequences. Suppose X = a, b, d, c and Y = b, a, b, e, d
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Lab 14 March 13 Spring 2015 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. Y
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Lab 13 March 11 Spring 2015 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 elem
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Lab 12 March 6 Fall 2015 A subsequence of a sequence (for example, an array, linked list, or 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 elements ar
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Lab 7 February 13 Spring 2015 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. (
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Lab 11 March 5 Spring 2015 1. Given a sequence a1 , a2 , . . . , an of n distinct numbers, an inversion is a pair i < j such that ai > a j . Note that a sequence has no inversions if and only if it is sorted in ascending order. The second and third
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Lab 10 February 27 Spring 2015 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 dis
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Lab 9 February 25 Spring 2015 1. Given a directed graph G = (V, E) with non-negative edge lengths (e), e E and a node s V , describe an algorithm to nd the length of a shortest cycle containing the node s. 2. Suppose we have a collection of cities
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Lab 8 February 20 Spring 2015 1. There are n light bulbs in a garden. These bulbs can be turned on manually by ipping on the switches at the light posts. Also, each light post can broadcast turn-on signals to some other pre-dened light posts in the
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 12 Answer Sheet This lab may be worked in groups. Name: Laura Mei Netid: lmei7 Section: AYG Part 1 Recursion Write the output the following program produces. #include <stdio.h> int power( int x, int n) cfw_ if ( n = 1) /* Voom! - means base case (or s
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 11 Answer Sheet This lab is to be worked individually. Name: Laura Mei Netid: lmei7 Section: AYG Part 1: Reading strings with blanks Complete the following C program to read in The Beatles; The Long and Winding Road; Let It Be. Naked; 214; 4 into 'art
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: Laura Mei Netid: lmei7 Section: AYG Part 1 Hangman Game 1. Copy/Paste your code from hang.c for the fragment described below. Do not copy all the code your wrote in hang.c, just the code you ty
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 9 Answer Sheet Name: Laura Mei Netid: lmei7 Section: AYG Part 1: Scope of variables Answer Questions #1 - #6 (below)on the answer sheet. 1. Write the output when the following program executes. #include <stdio.h> int cool(int x) cfw_ x = 2*x; return x
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 10 Answer Sheet This lab is to be worked in a group. Name: Laura Mei Netid: lmei7 Section: AYG Part 1: Using QuickSort 1. Fill in the blanks to call the qsort function to sort the array in ascending order. qsort( nums , 10, sizeof(int) , compAsc ); 2.
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 7 Answer Sheet Name: Laura Mei_ Netid: lmei7_ Section: AYG Part 1 1. Run your program and enter 100 as input. Write down the results your program displays. 32 32 54 12 52 2. Rewrite the program in the loop.c file using a do-while loop. Fill in the bla
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
CS101 Lab activity #1 Answer Sheet Name: Laura Mei_ Section: AYG_ Getting Started Your first task is to log-in to a computer. Type your NetID in the box marked 'Login:' Type your Active Directory (AD) password in the box marked 'Password:'. Your AD passwo
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
CS101 - Lab Activity 3 Name: Laura Mei NetID: lmei7 Section#: AYG Objectives In this lab, you will: Understand the difference between MATLAB functions and scripts. Learn to use function parameters and return values. Write a function to compute relativisti
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab Activity 4 - Answers Name: Laura Mei_ NetID: lmei7_ Section#: AYG_ Part 1: Programming the find_xy function 1. Write down the five equations. Your equations should not use any of the di . K2*(h2 h1) - K1*h1 = W1 - K1*HL K3*(h3 h2) + K2*(h1 - h2) = W2
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
CS 101 Lab 5 Answer Sheet This lab is to be worked individually. Name: Laura Mei_ Netid: lmei7_ Section: AYG_ Part 1: Navigating the filesystem with the command prompt 1. Write the commands to navigate to your home directory from the root directory: cd ~
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 6 Answer Sheet Name: Laura Mei_ Netid: lmei7_ Section: AYG_ Simple C programs Part A. 1. The following program compiles and runs without errors. Write the ouput the following code produces. #include <stdio.h> void main(void) cfw_ int num; num = 8; if
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Name: Laura Mei Section # AYG Lab Activity #2 Answer Sheet Part 1 Matlab constants 1. > string = [ 'y = ' , num2str(number) , ' * cos(x)' ]; number double string char Return to lab instructions on the web. Part 2 Matlab operators 2. 2 5 8 3. 6 4. 1 6 1 11
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
/* * Copyright 2011 University of Illinois at Urbana-Champaign * CS 225 Lab 04 C+ Object Oriented Programming * Authors: * Simon Krueger <skruege2@illinois.edu> * * Please see vector2.h for documentation of the Vector2 class */ #include "vector2.h"
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: Algorithms
service_id,date,exception_type I2 UIMF,20150119,1 I2 UIMF,20150120,1 I2 UIMF,20150121,1 I2 UIMF,20150122,1 I2 UIMF,20150126,1 I2 UIMF,20150127,1 I2 UIMF,20150128,1 I2 UIMF,20150129,1 I2 UIMF,20150202,1 I2 UIMF,20150203,1 I2 UIMF,20150204,1 I2 UIMF,2015020
School: University Of Illinois, Urbana Champaign
Course: Algorithms
fare_id,route_id,origin_id,destination_id,contains_id NORMAL,1, NORMAL,BROWN ALT,2, ISTOP,TEAL WEEKEND,2, NORMAL,GREENHOPPER EVENING,2, NORMAL,5E GREEN EXPRESS ALT,2, ISTOP,GOLDHOPPER,2, NORMAL,GREY,2, NORMAL,BLUE,2, ISTOP,YELLOWHOPPER,2, ISTOP,SILVER LIM
School: University Of Illinois, Urbana Champaign
Course: Algorithms
fare_id,price,currency_type,payment_method,transfers,transfer_duration ISTOP,0.00,USD,0,0, NORMAL,1.00,USD,0,1,
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Algorithms, Fall 2014 Practice Midterm 2: November 4, 2014 Instructions: This is a closed book exam. No notes, books, calculators, etc. are allowed. Answer Problem 1 and any four of the remaining. If you answer all questions we will take the sco
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Algorithms, Spring 2012 Midterm 1: February 23, 2012 Instructions: This is a closed book exam. No notes, books, calculators, etc. are allowed. Answer all problems. You can write I Dont Know for a problem (or its sub-parts) to get 25% credit for
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: Artificial Intelligence
\documentclass[12pt,letterpaper]cfw_article \newenvironmentcfw_proofcfw_\noindentcfw_\bf Proof:cfw_\qed\bigskip \newtheoremcfw_theoremcfw_Theorem \newtheoremcfw_corollarycfw_Corollary \newtheoremcfw_lemmacfw_Lemma \newtheoremcfw_claimcfw_Claim \newtheorem
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