Online study resources available anywhere, at any time
High-quality Study Documents, expert Tutors and Flashcards
Everything you need to learn more effectively and succeed
We are not endorsed by this school |
We are sorry, there are no listings for the current search parameters.
School: University Of Illinois, Urbana Champaign
Course: Vision
Computer Vision CS 543 / ECE 549 Homework 1 Solutions 1. Lighting (20%) A. Answer the following regarding the above image. 1. Point 1 is darker than 2 because point 1 is in shadow. 2. Point 4 is darker than point 3 because point 3 has a darker albedo (ink
School: University Of Illinois, Urbana Champaign
Course: Numerical Analysis
CS 450: Homework #7 Numerical Analysis Spring 2012 Luke Olson : 9:00am - 9:50am MWF Due on May 2, 2011 A homework submission guideline is available on the course website at https:/wiki.engr.illinois.edu/display/cs450sp12/Information All submissions must c
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 8 Answer Sheet This lab is to be worked in a group. Name: _Siyuan Li _ Netid: _sli62_ Section: _AYI_ Part 1 Nested Loops 1. The following C program compiles without errors. Write the output produced by this program. #include <stdio.h> void main(void)
School: University Of Illinois, Urbana Champaign
Course: Vision
Computer Vision CS 543 / ECE 549 Homework 1 Due Feb 14, 2012 Answer the following questions and explain solutions. Numbers in parentheses give maximum credit value. You can discuss in small groups, but turn in individual solutions and indicate collaborato
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2009 Homework 3 Assigned: Oct/1 Due in class Oct/13 Total points: 54 for undergraduate students, 62 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions for
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2014 HW 1 solution (Version: 1.01) 1. (30 pts.) Cut vertices Given a connected undirected graph G = (V, E), vertex u is called a separating vertex , or cut-vertex , if removing u leaves the graph into two or more dis
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS473 Spring 2014 Discussion 11 April 15/16, 2014 1. Suppose we are given an array A[1.m][1.n] of non-negative real numbers such that each row and column sum is an integer. We want to round A to an integer matrix, replacing each entry x in A with either x
School: University Of Illinois, Urbana Champaign
CS 425 Distributed Systems, Fall 2013, University of Illinois at Urbana-Champaign Midterm Review Problems Notes: The midterm will be closed book, closed note. It will last 1 hour and 15 minutes. The midterm paper will contain two types of questions - mult
School: University Of Illinois, Urbana Champaign
MultipleChoiceQuestion 1)d 2)c 3)c 4)a 5)d 6)c 7)a 8)d 9)c 10)a LongAnswers 1)a)P0:1,2,3,4,5,7,13 P1:1,2,3,4,10,11 P2:1,2,3,4,5,6,7,8,9,10 P3:2,3,4,5,6,7,9,12 b)(P1,3)&(P3,3)areconcurrenteventswiththesametimestamp.(P1,4)&(P3,3)are concurrenteventswithdiff
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
More Data Representation 9/12/13 11:21 PM Get Help in as Samantha Siau (https:/learn.illinois.edu/user/profile.php?id=33585) (Logout (https:/learn.illinois.edu/login/logout.php? Status Page (http:/go.illinois.edu/moodlestatus) Like Our New Look? You are
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Conict to Midterm 2: April 9, 2013 Instructions: 1. This is a closed book exam. No notes, books, calculators, etc. are allowed. 2. Answer all problems. You can write I Dont Know for a problem (or its sub-parts)
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
CS125 : Introduction to Computer Science Lecture Notes #2 Architecture and Program Development c 2005, 2004, 2002, 2001 Jason Zych 1 Lecture 2 : Architecture and Program Development Data Encoding The idea of data encoding is to take information in one for
School: University Of Illinois, Urbana Champaign
" MedElite Point of Sale Software Requirements" Introduction! " The MedElite POS is a custom designed software for use in a busy medical practice. The software employs a simple uncomplicated touch screen user interface that is used by nurses who are gene
School: University Of Illinois, Urbana Champaign
Chukwa: A large-scale monitoring system Jerome Boulon jboulon@yahoo-inc.com Yahoo!, inc Andy Konwinski andyk@cs.berkeley.edu UC Berkeley Runping Qi runping@yahoo-inc.com Yahoo!, inc Ariel Rabkin asrabkin@cs.berkeley.edu UC Berkeley Eric Yang eyang@yahoo-i
School: University Of Illinois, Urbana Champaign
Comparing the performance of distributed hash tables under churn Jinyang Li, Jeremy Stribling, Thomer M. Gil, Robert Morris, M. Frans Kaashoek MIT Computer Science and Articial Intelligence Laboratory cfw_jinyang, strib, thomer, rtm, kaashoek@csail.mit.ed
School: University Of Illinois, Urbana Champaign
Megastore: Providing Scalable, Highly Available Storage for Interactive Services Jason Baker, Chris Bond, James C. Corbett, JJ Furman, Andrey Khorlin, James Larson, Jean-Michel Leon, Yawei Li, Alexander Lloyd, Vadim Yushprakh Google, Inc. cfw_jasonbaker,c
School: University Of Illinois, Urbana Champaign
Course: Special Topic
.text main: li $a0, 90 sw $a0, 0xffff0014($zero) li $t0, 0 sw $t0, 0xffff0018($zero) # say it is an absolute angle li $t0, 10 sw $t0, 0xffff0010($zero) # set velocity forever: j main
School: University Of Illinois, Urbana Champaign
Course: Special Topic
.text main: li $a0, 10 jal set_speed li $a0, 0 # face EAST jal set_orientation jal wait li $a0, 90 # face SOUTH jal set_orientation jal wait li $a0, 180 # face WEST jal set_orientation jal wait li $a0, 270 # face NORTH jal set_orientation ja
School: University Of Illinois, Urbana Champaign
Building Blocks for Theoretical Computer Science (Version 1.3) Margaret M. Fleck January 1, 2013 Contents Preface xi 1 Math review 1 1.1 Some sets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Pairs of reals . . . . . . . . . . . . . . .
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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-un
School: University Of Illinois, Urbana Champaign
Course: Special Topic
Debugging Some data from a previous semester Avg Time to do MP Students 40 35 30 25 20 15 10 MP[12] average 5 0 0-1 2-3 4-5 6-7 8-9 10-11 Time (hrs) March 6, 2013 1 What is responsible for distribution? Have you ever monitored the time you spent on doing
School: University Of Illinois, Urbana Champaign
Course: Special Topic
Outline Overcoming limitations to SIMD-Vectorization Data Dependences Data Alignment Aliasing Non-unit strides Conditional Statements Vectorization with intrinsics 54 Data Alignment Vector loads/stores load/store 128 consecutive bits to a vector regi
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: 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
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: Intro Computing Non-tech
Computer Science 105 (CS105) Fall 2013 Syllabus Instructors: Kai Zhao zhaok@illinois.edu talguy2@illinois.edu (Typo in printed version) guytal2@illinois.edu TAs: Megha Ailavajhala (ailavaj2@illinois.edu) Dhashrath Raguraman (raguram2@illinois.edu) Parimal
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
0 97 95 1 83 99 2 79 81 3 72 84 4 92 84 5 78 91 6 79 89 7 68 67 8 78 76 9 77 81 10 75 83 11 90 99 12 85 84 13 77 100 14 89 86 15 86 87 16 65 87 17 67 94 18 67 76 19 93 93 20 83 91 21 97 100 22 86 89 23 61 43 24 85 77 25 96 90 26 79 98 27 61 68 28 93 93 29
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
supermarket item_1 item_2 item_3 item_4 item_5 item_6 item_7 item_8 item_9 item_10 item_11 item_12 item_13 item_14 item_15 item_16 item_17 item_18 item_19 item_20 item_21 item_22 item_23 item_24 item_25 item_26 item_27 item_28 item_29 item_30 item_31 item
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Computer Science 105 (CS105) Fall 2012 Syllabus Instructors: Kai Zhao Aishwarya Stanley 2211 Siebel Center 2211 Siebel Center zhaok@illinois.edu astanle2@illinois.edu Email the instructor or TA for the section that you are enrolledyou may be penalized for
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Computer Science 105 (CS105) Fall 2013 Syllabus Instructors: Kai Zhao zhaok@illinois.edu Guy Tal guytal2@illinois.edu (Typo in printed version) talguy2@illinois.edu TAs: Megha Ailavajhala (ailavaj2@illinois.edu) Dhashrath Raguraman (raguram2@illinois.edu)
School: University Of Illinois, Urbana Champaign
Course: Data Structures
HCM UT HCM NU Faculty of Applied Science Department of Math Applied Ho Chi Minh City, 18 December 2008 Syllabus M ATH 385 INTRO DIFFERENTIAL EQUATIONS Credit Class Hours Overall Grade : 3 (2.1.5) Theory: 28 Exercises: 14 42 Consultation: 1 class hours per
School: University Of Illinois, Urbana Champaign
Course: Vision
Computer Vision CS 543 / ECE 549 Homework 1 Solutions 1. Lighting (20%) A. Answer the following regarding the above image. 1. Point 1 is darker than 2 because point 1 is in shadow. 2. Point 4 is darker than point 3 because point 3 has a darker albedo (ink
School: University Of Illinois, Urbana Champaign
Course: Numerical Analysis
CS 450: Homework #7 Numerical Analysis Spring 2012 Luke Olson : 9:00am - 9:50am MWF Due on May 2, 2011 A homework submission guideline is available on the course website at https:/wiki.engr.illinois.edu/display/cs450sp12/Information All submissions must c
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 8 Answer Sheet This lab is to be worked in a group. Name: _Siyuan Li _ Netid: _sli62_ Section: _AYI_ Part 1 Nested Loops 1. The following C program compiles without errors. Write the output produced by this program. #include <stdio.h> void main(void)
School: University Of Illinois, Urbana Champaign
Course: Vision
Computer Vision CS 543 / ECE 549 Homework 1 Due Feb 14, 2012 Answer the following questions and explain solutions. Numbers in parentheses give maximum credit value. You can discuss in small groups, but turn in individual solutions and indicate collaborato
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2009 Homework 3 Assigned: Oct/1 Due in class Oct/13 Total points: 54 for undergraduate students, 62 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions for
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2014 HW 1 solution (Version: 1.01) 1. (30 pts.) Cut vertices Given a connected undirected graph G = (V, E), vertex u is called a separating vertex , or cut-vertex , if removing u leaves the graph into two or more dis
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 7 Answer Sheet Name: _Siyuan Li _ Netid: _sli62_ Section: _AYI_ Part 1: Doing Loops and Random Numbers 1. Run your program and enter 75 as input. Write down the results your program displays. _59_ _34_ _41_ _3_ _29_ 2. Rewrite the program in the loop
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 6 Solutions Fall 2013 1. Describe data structures that support Lookup in O(1) worst-case time and the other two operations in the following time bounds. (a) The worst-case time for both BLACKEN and NEXTWHITE is O(log n). Solution (balanced
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Name: _Siyuan Li_NetID: _SLI62_ Section#: _AYI_ Part 1 Programming the function 'find_xy' . The first two steps involve writing out the math behind find_xy. 1. Write down the five equations. _ HF(yL - y1) /d1 + HF(y2 - y1)/d2=W1 _ _ HF(y1 - y2) /d2 + HF(y
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2013 Homework 3 Assigned: Oct/1 Due in class Oct/15 Total points: 52 for undergraduate students, 62 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions for
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
CS 173 Discrete Structures Fall 2013: Homework 1 Solutions 1. Direct Proof : An integer is said to be divisible by 3 if there is some integer m such that x = 3 m. Show that for any integers x, y, z such that x + y + z is divisible by 3, 100x + 10y + z is
School: University Of Illinois, Urbana Champaign
Course: Intro Computing : Engineering And Science
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Fundamental Algorithms, Spring 2011 HW 4 Homework is due by Monday, 23:59:59, February 21 Problem 1 is due by Sunday, 23:59:59, February 20 This homework contains four problems. Read the instructions for submitting homework on the course webpage.
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab Activity 4 - Answers Name: _Ben Domash_ NetID: _bdomash2_ Section#: _AYL_ Part 1: Programming the find_h function 1. 1. Write down the five equations (by plugging in i from 1 to 5): For example your first equation (for i = 1) should look like this: _K
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
CS 412 HW3 Yuwei Chen (chen202) 1. Brief (very brief) introduction of the methods in your general purpose classification framework I used Decision Tree (C4.5) as basic method, Random Forest as the ensemble version of the classification method.
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473 Homework 10 Solutions Spring 2010 1. Show that 2SAT is NP-hard, or describe a polynomial-time algorithm to solve it. Solution: We describe a polynomial-time algorithm to solve 2SAT. Given a 2CNF boolean formula , the implication graph G is dened as
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 4 (due March 2, 2010) Spring 2010 1. Suppose we want to write an efcient function SHUFFLE(n) that returns a permutation of the set cfw_1, 2, . . . , n chosen uniformly at random. (a) Prove that the following algorithm is not correct. [Hint
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2009 Homework 4 Assigned: Oct/23 Due in class Nov/3 Total points: 48 for undergraduate students, 58 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions for
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Algorithms, Fall 2010 HW 1 (due Tuesday, September 7th) This homework contains four problems. Read the instructions for submitting homework on the course webpage. In particular, make sure that you write the solutions for the problems on separate s
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 2 Solutions Spring 2014 1. Kris is a professional rock climber who is competing in the U.S. climbing nationals. The competition requires him to complete the following task: He is given a set of n holds that he might use to create a route w
School: University Of Illinois, Urbana Champaign
Course: Embedded Systems
CS 431 Homework #1 Spring 2014 Due: Tuesday, Feb 11, 2014 at 4:00pm. Handin at CS 431 dropbox in SC basement. Please type or neatly write your solutions. Anything that we cannot read or easily follow will receive no credit. Show your work to receive full
School: University Of Illinois, Urbana Champaign
CS 374 Homework 6 Solutions Fall 2014 1. Describe and analyze an algorithm to compute the maximum total reward that the organizers could be forced to pay, given the array M [1 . n, 1 . n] as input. Solution: Let MaxR(i, j) be the maximum possible reward i
School: University Of Illinois, Urbana Champaign
Course: Algorithms
\documentclass[11pt]cfw_article %\usepackagecfw_pstricks,pst-node \usepackagecfw_alltt,fullpage,graphics,color,epsfig,amsmath, amssymb \usepackagecfw_boxedminipage %\newcommandcfw_\edgee[1]cfw_\begincfw_math\stackrelcfw_#1cfw_\longrightarrow\endcfw_math \
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Algorithms, Fall 2010 HW 9 (due Tuesday, November 16) This homework contains four problems. Read the instructions for submitting homework on the course webpage. In particular, make sure that you write the solutions for the problems on separate she
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Algorithms, Fall 2010 HW 1 (due Tuesday, September 7th) This homework contains four problems. Read the instructions for submitting homework on the course webpage. In particular, make sure that you write the solutions for the problems on separate s
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2009 Homework 2 Assigned: Sept/15 Due in class Sept/29 Total points: 40 for undergraduate students, 44 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions f
School: University Of Illinois, Urbana Champaign
CS 573: Graduate Algorithms, Fall 2011 HW 1 (due Tuesday, September 13th) This homework contains ve problems. Read the instructions for submitting homework on the course webpage. In particular, make sure that you write the solutions for the problems on se
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab Activity 4 - Answers Name: _Ben Domash_ NetID: _bdomash2_ Section#: _AYL_ Part 1: Programming the find_h function 1. 1. Write down the five equations (by plugging in i from 1 to 5): For example your first equation (for i = 1) should look like this: _K
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file heap.cpp * Implementation of a heap class. */ #include <math.h> template <class T, class Compare> size_t heap<T, Compare>:root() const cfw_ / @todo Update to return the index you are choosing to be your root. return 1; template <class T,
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 2 Solutions Rubric (for all dynamic programming problems): For a problem worth 10 points: 6 points for a correct recurrence, described either using mathematical notation or as pseudocode for a recursive algorithm. 1 point for a clear Eng
School: University Of Illinois, Urbana Champaign
CS 573 Homework 5 (due November 19, 2010) Fall 2010 CS 573: Graduate Algorithms, Fall 2010 Homework 5 Due Friday, November 19, 2010 at 5pm (in the homework drop boxes in the basement of Siebel) 1. Suppose we are given a set of boxes, each specied by their
School: University Of Illinois, Urbana Champaign
Fall 2011- Midterm 1 Computer Concepts and Logic 1. Which of the following is NOT a means of secondary storage? a. b. c. d. CD DVD Hard Drive RAM 2. What does the acronym GUI stand for? a. b. c. d. Graphical Unix Interface Graphical User Interface Gradebo
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
CS412: Introduction to Data Mining Fall 2012 Assignment 4 Solution Handed Out: November 20th , 2012 Due: Dec 10th , 2012 1. [k-Nearest Neigbhor and Support Vector Machine - 14 points] Suppose we are given a training set as follows i x1 12 24 35 48 66 x2 l
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2013 Homework 3 Assigned: Oct/1 Due in class Oct/15 Total points: 52 for undergraduate students, 62 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions for
School: University Of Illinois, Urbana Champaign
Course: Vision
Solution to Homework 2 March 8, 2012 1 A feature tracker (50pt) 1.1 Keypoint Selection (15pt) Algorithm summary: Compute Harris keypoints Given the input image, compute gradient Ix and Iy Construct the second moment matrix, convoluted with Gaussian lter:
School: University Of Illinois, Urbana Champaign
CS 573: Graduate Algorithms, Fall 2011 HW 4 (due in class on Tuesday, November 1st) This homework contains ve problems. Read the instructions for submitting homework on the course web page. In particular, make sure that you write the solutions for the pro
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS473 Spring 2014 Discussion 11 April 15/16, 2014 1. Suppose we are given an array A[1.m][1.n] of non-negative real numbers such that each row and column sum is an integer. We want to round A to an integer matrix, replacing each entry x in A with either x
School: University Of Illinois, Urbana Champaign
Course: Numerical Methods
How to program functions. How do the built-in functions sqrt and diff work? What is the .^ operator? Can a function return more than one array ? Readings: Matlab by Gilat Chapter 6 (except 6.3) 3-2 1. Problem Definition Write a function named trunc that t
School: University Of Illinois, Urbana Champaign
Course: Algorithms
\documentclass[11pt]cfw_article %\usepackagecfw_pstricks,pst-node \usepackagecfw_alltt,fullpage,graphics,color,epsfig,amsmath, amssymb \usepackagecfw_boxedminipage %\newcommandcfw_\edgee[1]cfw_\begincfw_math\stackrelcfw_#1cfw_\longrightarrow\endcfw_math \
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS473 Spring 2014 Homework 9 Solutions and Rubric 1. Problem 7.17 from Kleinberg-Tardos book. We could type up the problem for you but Kleinberg-Tardos book has a very nice chapter on ows and also numerous interesting problems so take this opportunity to
School: University Of Illinois, Urbana Champaign
Course: Numerical Analysis
CS 450 / MATH 450 / CSE 401 / ECE 491 Fall 2013 Numerical Analysis Homework 1 Instructor: Luke Olson University of Illinois at Urbana-Champaign Due: 09/20/2013 5:00 PM Submission Notes: Each problem solution should be submitted in a separate PDF le. Eac
School: University Of Illinois, Urbana Champaign
Course: Vision
Computer Vision CS 543 / ECE 549 Homework 3 Due Mar 13, 2012 Answer the following questions and explain solutions. Numbers in parentheses give maximum credit value. You can discuss in small groups, but turn in individual solutions and indicate collaborato
School: University Of Illinois, Urbana Champaign
CS 473 Head-Banging 1 (January 27 and 28, 2009) Spring 2009 1. An inversion in an array A[1 . n] is a pair of indices (i , j ) such that i < j and A[i ] > A[ j ]. The n number of inversions in an n-element array is between 0 (if the array is sorted) and 2
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
CS412: An Introduction to Data Warehousing and Data Mining Fall 2013 Assignment 2 Yanglei Song Handed In: 10/08/2013 Question 1 Assume a base cuboid of 10 dimensions contains only two base cells: (1) (a1 , a2 , a3 , b4 , ., b9 , b10 ), and (2) (b1 , b2 ,
School: University Of Illinois, Urbana Champaign
Course: Algorithms
HW 7 (due Tuesday, at noon, April 1st, 2014) CS 473: Fundamental Algorithms, Spring 2014 Version: 1.0 1. (30 pts.) Bottleneck Spanning Tree. Let G = (V, E) an undirected edge-weighted graph. The bottleneck weight of a spanning tree T is the weight of the
School: University Of Illinois, Urbana Champaign
CS 425 Distributed Systems, Fall 2013, University of Illinois at Urbana-Champaign Midterm Review Problems Notes: The midterm will be closed book, closed note. It will last 1 hour and 15 minutes. The midterm paper will contain two types of questions - mult
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Algorithms, Fall 2010 HW 3 Solutions 1. (25 pts) Suppose we have a stack of n pancakes of different sizes. We want to sort the pancakes so that the uppose we have a staareof n pancakethe largernpancakes. want tonly toperation weocan perform is sma
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 4 November 29, 2011-11-29 ABE 224 Jialing Ye Runoff Measurement and Erosion Evaluation Objectives Measure runoff from bare soil and soil with erosion control blanket (ECB), and investigate soil loss and the effects of ECBs on soil erosion. Materials a
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 6 (due October 23, 2013) Fall 2013 1. Suppose we want to maintain an array X [1.n] of bits, which are all initially subject to the following operations. LOOKUP(i): Given an index i, return X [i]. BLACKEN(i): Given an index i < n, set X [
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Algorithms, Fall 2010 HBS 3 Problem 1. [Recurrences] Solve the following recurrences. T (n) = 5T (n/4) + n and T (n) = 1 for 1 n < 4. T (n) = 2T (n/2) + nlogn T (n) = 2T (n/2) + 3T (n/3) + n2 Problem 2. [Tree Traversal] Let T be a rooted binary tr
School: University Of Illinois, Urbana Champaign
Course: Discrete Math
CS 173: Discrete Structures Viraj Kumar Margaret Fleck Lucas Cook, Samer Fanek, Chen Li, Lance Pittman, Dan Schreiber Rick Barber, Efe Karakus, Adair Liu, Andrew Pikler 1 What is CS 173 about? Were going to learn: 1. Basic mathematical objects and techni
School: University Of Illinois, Urbana Champaign
Course: Data Structures
CS 225 Fall 2013 Homework 0 Due Sept 4, 2013 in lecture and SVN Instructions for submission into your class SVN repository are on the webpage. The purpose of this assignment is to give you a chance to refresh the math skills we expect you to have learned
School: University Of Illinois, Urbana Champaign
Course: Algorithms
HW 2 (due Tuesday, at noon, February 11, 2014) CS 473: Fundamental Algorithms, Spring 2014 This homework contains three problems. Read the instructions for submitting homework on the course webpage. In particular, make sure that you write the solutions fo
School: University Of Illinois, Urbana Champaign
Course: Distributed Systems
Name: _ CS 425/ECE 428/CSE 424 Fall 2013 Midterm October 15, 2013. 3.30 pm 4.45 pm. (75 minutes) NAME: _ NETID: _ Instructions: 1. Please write your name and netid legibly above, and sign below. Please write your name on the top-right corner of every page
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Fundamental Algorithms, Spring 2011 HW 2 Homework is due by Monday, 23:59:59, February 7 Problem 1 is due by Sunday, 23:59:59, February 6 This homework contains four problems. Read the instructions for submitting homework on the course webpage. Co
School: University Of Illinois, Urbana Champaign
Course: Distributed Systems
Replica Management Digital Signature: Authentic: Signer deliberately signed the document and has not Goals: Replication Transparency User/client need not know that multiple physical been altered by anyone; Unforgeable: No one else signed the document; Non
School: University Of Illinois, Urbana Champaign
Course: Machine Learning
CS446: Machine Learning Fall 2013 Problem Set 1 Handed Out: September 5, 2013 Due: September 19, 2013 Feel free to talk to other members of the class in doing the homework. I am more concerned that you learn how to solve the problem than that you demonst
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS473 Spring 2014 Discussion 11 April 15/16, 2014 1. Suppose we are given an array A[1.m][1.n] of non-negative real numbers such that each row and column sum is an integer. We want to round A to an integer matrix, replacing each entry x in A with either x
School: University Of Illinois, Urbana Champaign
CS 425 Distributed Systems, Fall 2013, University of Illinois at Urbana-Champaign Midterm Review Problems Notes: The midterm will be closed book, closed note. It will last 1 hour and 15 minutes. The midterm paper will contain two types of questions - mult
School: University Of Illinois, Urbana Champaign
MultipleChoiceQuestion 1)d 2)c 3)c 4)a 5)d 6)c 7)a 8)d 9)c 10)a LongAnswers 1)a)P0:1,2,3,4,5,7,13 P1:1,2,3,4,10,11 P2:1,2,3,4,5,6,7,8,9,10 P3:2,3,4,5,6,7,9,12 b)(P1,3)&(P3,3)areconcurrenteventswiththesametimestamp.(P1,4)&(P3,3)are concurrenteventswithdiff
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
More Data Representation 9/12/13 11:21 PM Get Help in as Samantha Siau (https:/learn.illinois.edu/user/profile.php?id=33585) (Logout (https:/learn.illinois.edu/login/logout.php? Status Page (http:/go.illinois.edu/moodlestatus) Like Our New Look? You are
School: University Of Illinois, Urbana Champaign
Answers to textbook exercise questions: 2.2, 2.3, 2.4, 2.6, 3.3, 3.6, 3.8, 4.3, 4.4, 5.1, 5.4, 6.1 12 CHAPTER 2. GETTING TO KNOW YOUR DATA The measures of dispersion described here were obtained from: Statistical Methods in Research and Production, fourth
School: University Of Illinois, Urbana Champaign
Course: 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
stop_id,stop_code,stop_name,stop_desc,stop_lat,stop_lon,zone_id,stop_url,location_type,parent_station KBYWSFLD:3,Kirby & Westfield (South Side),40.09824833,-88.29017333,1,http:/www.cumtd.com/maps-and-schedules/bus-stops/info/kbywsfld,0, DNCNCLKRD:2,Duncan
School: University Of Illinois, Urbana Champaign
Course: Algorithms
service_id,monday,tuesday,wednesday,thursday,friday,saturday,sunday,start_date,end_date I2 UIMF,0,0,0,0,0,0,0,20141221,20150516 GNX1 SHOW,0,0,0,0,0,0,0,20141221,20150516 SRE1,0,0,0,0,0,0,0,20141221,20150516 R4MF,0,0,0,0,0,0,0,20141221,20150516 SV1SA,0,0,0
School: University Of Illinois, Urbana Champaign
Course: Algorithms
agency_id,agency_name,agency_url,agency_timezone,agency_lang,agency_phone CUMTD,Champaign Urbana Mass Transit District,http:/www.cumtd.com,America/Chicago,en,217-384-8188
School: University Of Illinois, Urbana Champaign
Course: Special Topic
.data A: .byte 1 2 3 4 # char A[4] = cfw_1, 2, 3, 4; result: .word 0 # int result; .text main: # result = A[0] + A[1] + A[2] + A[3] la $t0, A lb $t1, 0($t0) # loads A[0] lb $t2, 1($t0) # loads A[1] lb $t3, 2($t0) # loads A[2] lb $t4, 3($t0) # l
School: University Of Illinois, Urbana Champaign
Appendix B Acknowledgements and Supplementary Readings Most of the basic ideas and examples in this book date back many years and their original source is almost impossible to trace. Ive consulted so many books and worked with so many helpful teachers, st
School: University Of Illinois, Urbana Champaign
Chapter 21 Planar Graphs This chapter covers special properties of planar graphs. 21.1 Planar graphs A planar graph is a graph which can be drawn in the plane without any edges crossing. Some pictures of a planar graph might have crossing edges, but its p
School: University Of Illinois, Urbana Champaign
Preface This book teaches two dierent sorts of things, woven together. It teaches you how to read and write mathematical proofs. It provides a survey of basic mathematical objects, notation, and techniques which will be useful in later computer science co
School: University Of Illinois, Urbana Champaign
Chapter 1 Math review This book assumes that you understood precalculus when you took it. So you used to know how to do things like factoring polynomials, solving high school geometry problems, using trigonometric identities. However, you probably cant re
School: University Of Illinois, Urbana Champaign
Chapter 2 Logic This chapter covers propositional logic and predicate logic at a basic level. Some deeper issues will be covered later. 2.1 A bit about style Writing mathematics requires two things. You need to get the logical ow of ideas correct. And you
School: University Of Illinois, Urbana Champaign
Appendix A Jargon Mathematicians write in a dialect of English that diers from everyday English and from formal scientic English. To read and write mathematics uently, you need to be aware of the dierences. A.1 Strange technical terms Many technical terms
School: University Of Illinois, Urbana Champaign
Chapter 9 Graphs Graphs are a very general class of object, used to formalize a wide variety of practical problems in computer science. In this chapter, well see the basics of (nite) undirected graphs, including graph isomorphism and connectivity. 9.1 Gra
School: University Of Illinois, Urbana Champaign
Chapter 10 2-way Bounding In high school and early college mathematics, we are often proving equalities and we often prove them by manipulating a sequence of equalities. For example 3x2 5x 2 (x 2)(3x + 1) = = 3x + 1 x2 x2 On more complex problems, its oft
School: University Of Illinois, Urbana Champaign
Course: Database Systems
CS411 Database Systems 05: Relational Schema Design Ch. 3.1-3.5, except 3.4.2 - 3.4.3 and 3.5.3. 1 Motivation We have designed ER diagram, and translated it into a relational db schema R = set of R1, R2, . Now what? We can do the following implement R
School: University Of Illinois, Urbana Champaign
SPECTRUM MANAGEMENT AND WIRELESS HISTORY http:/en.wikipedia.org/wiki/Telecommunications_in_India http:/telecomtalk.info/history-of-indian-telecommunication/67789/ http:/www.cse.iitd.ac.in/~pkalra/OLD-COURSES/siv864-2010/session-08-12.pdf http:/www.kakani.
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Fractal Modeling CS 418 Intro to Computer Graphics John C. Hart Fractal Dimension Self-similarity dimension Make a D dimensional object out of N smaller copies scaled by s N = (1/s)D Can solve for dimension D s=1 s=1/2 s=1/3 N=1 N=1 N=1 N=1 N=2 N=3 N=1 N=
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Meshes CS418 Computer Graphics John C. Hart Simple Meshes Cylinder (x,y,z) = (cos , sin , z) Cone (x,y,z) = (|z| cos , |z| sin , z) Sphere (x,y,z) = (cos cos , cos sin , sin ) Torus (x,y,z) = (R + cos ) cos ,(R + cos ) sin , sin ) Good Meshes Manifold: 1
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Volume and Solid Modeling CS418 Computer Graphics John C. Hart Implicit Surfaces f=0 1 f<0 (0,0) Real function f (x,y,z) Classifies points in space Image synthesis (sometimes) inside f > 0 outside f < 0 on the surface f = 0 CAGD: inside f < 0, outside
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Quaternions John C. Hart CS 318 Interactive Computer Graphics Rigid Body Dynamics Rigid bodies Center of gravity Location in space Inflexible Orientation in space Rigid body dynamics Force applied to object relative to center of gravity Rotation in space
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Animation CS418 Computer Graphics John C. Hart Keyframe Animation Set target positions for vertices at key frames in animations Linearly interpolate vertex positions between targets at intervening frames Lots can go wrong (like the feet) Can be fixed by a
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Parametric Curves CS 318 Interactive Computer Graphics John C. Hart Linear Interpolation p1=(x1,y1) Need to get from point p0 to point p1 Define a parametric function p(t) p(0) = p0, p(1) = p1 y Separate into coordinate functions p(t) = (x(t), y(t) x(0
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Lynwood Dunn (1904-1998) Visual effects pioneer Acme-Dunn optical printer 25% transparent yellow The Over Operator How to indicate which parts of front picture are clear and which are opaque Use alpha channel to indicate opacity [Smith] Over operator [Por
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Parametric Surfaces CS 318 Intro to Computer Graphics John C. Hart Space Curves y Separate into three coordinate functions p(t) = (x(t), y(t), z(t) x(t) = (1-t)3 x0 + 3t(1-t)2 x1 + 3t2(1-t) x2 + t3 x3 z x y(t) = (1-t)3 y0 + 3t(1-t)2 y1 + 3t2(1-t) y2 + t3
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Blossoms CS 419 Advanced Topics in Computer Graphics John C. Hart Borrowed somewhat from Tom Sederbergs notes de Casteljau de Casteljau algorithm evaluates a point on a Bezier curve by scaffolding lerps Blossoming renames the control and intermediate po
School: University Of Illinois, Urbana Champaign
Course: Interactive Computer Graphics
Skinning CS418 Computer Graphics John C. Hart Simple Inverse Kinematics Given target point (x,y) in position space, what are the parameters (q,f) in configuration space that place the hand on the target point? Use Law of Cosines to find q d2 = a2 + b2 2ab
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Final Exam: 7pm-10pm, May 3, 2013 David Kinley Hall, Room 114 Instructions: This is a closed book exam. No notes, books, calculators, cellphones, computers, mirrors, owers, etc. are allowed. You are allowed to
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Conict Final Exam: 7pm-10pm, May 6, 2013 English Building, Room 160 Instructions: This is a closed book exam. No notes, books, calculators, cellphones, computers, mirrors, owers, etc. are allowed. You are allo
School: University Of Illinois, Urbana Champaign
Course: Algorithms
! !" !#" ( *+$ # - /01$2 ! # / 45 7 $/ "% ) # , . ( # /) (" $&'$ ( 3 "6 )". $ " #$%&'()* 8( &
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Linearizability By Mila Oren 1 Outline Sequential and concurrent specifications. Define linearizability (intuition and formal model). Composability. Compare linearizability to other correctness condition. 2 Motivation An object in languages such as Jav
School: University Of Illinois, Urbana Champaign
Course: Algorithms
1 Shared memory Mutual Exclusion CSCE 668 Prof. Jennifer Welch Shared Memory Model 2 Processors communicate via a set of shared variables, instead of passing messages. Each shared variable has a type, defining a set of operations that can be performed ato
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Average Consensus Consider n nodes 1, 2, 3, , n, with xi denoting the input ofn node i. The goal for average x consensus is to compute the average of the inputs, namely, i=1 i . n It is assumed that the system is synchronous, and the links are reliable. T
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS410 TextInformationSystems (Spring2015) Instructor:ChengXiang(Cheng)Zhai FulltimeTAs:SeanMassung,NikitaSpirin,RongdaZhu ParttimeTAs:XueqingLiu,YinanZhang DepartmentofComputerScience UniversityofIllinois,UrbanaChampaign Goal&Design IntroduceTextInformati
School: University Of Illinois, Urbana Champaign
Course: Special Topics
ResearchProblems&Topics (WebDomain) (CS598CXZAdvancedTopicsinIRPresentation) Jan.25,2005 ChengXiangZhai Department of Computer Science UniversityofIllinois,UrbanaChampaign FacultyHomepage Classification/Finding Theproblemis,toclassifythefacultyhomepages f
School: University Of Illinois, Urbana Champaign
Course: Special Topics
OverviewofInformationRetrieval (CS598CXZAdvancedTopicsinIRPresentation) Jan.18,2005 ChengXiangZhai Department of Computer Science UniversityofIllinois,UrbanaChampaign WhatisInformationRetrieval(IR)? Narrowsense: IR=SearchEngineTechnologies(IR=Google,libr
School: University Of Illinois, Urbana Champaign
Course: Special Topics
ResearchProblems&Topics (LiteratureDomain) (CS598CXZAdvancedTopicsinIRPresentation) Feb1,2005 ChengXiangZhai Department of Computer Science UniversityofIllinois,UrbanaChampaign ResearchAreaMining Thereareallkindsofresearchbranchesforonedepartment,forexamp
School: University Of Illinois, Urbana Champaign
Course: Special Topics
ResearchProblems&Topics (EmailDomain) (CS598CXZAdvancedTopicsinIRPresentation) Jan.27,2005 ChengXiangZhai Department of Computer Science UniversityofIllinois,UrbanaChampaign AutomaticEmailReplying Ifthisproblemissolvedwell,informationserviceor technicalsu
School: University Of Illinois, Urbana Champaign
Course: Special Topics
RealWorldIRChallenges (CS598CXZAdvancedTopicsinIRPresentation) Jan.20,2005 ChengXiangZhai Department of Computer Science UniversityofIllinois,UrbanaChampaign Therearemanyresearchproblems toworkon. Itsmorebeneficialtothesocietyif weworkonproblemsthatreflec
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Understand how structure data types are implemented in C. Use . operator to access members of a structure. See how to declare pointers to structure variables. Use -> operator to access members of a structure when using pointers. Related Chapter: ABC 9.1
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Know how to declare pointer variables. Understand the & (address) and *(indirection) operators. Dynamic Memory Allocation Related Chapter: ABC 6.2 6.6, 6.8, 6.10, 6.11, 6.15 19&20-2 Pointer variables are variables that store memory addresses. Pointers va
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
What is the Matlab environment? How can you create vectors ? What does the colon : operator do? How does the use of the built-in linspace function differ from the use of the colon : operator? Readings: Matlab by Pratap Chapter 3 1-2 1) engineering visuali
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
What are relational operators and logical values? How to use the input and disp functions. Learn to use if, if-else and else-if conditional statements. What are logical operators? Using while to perform loops. Readings: Matlab by Pratap Chapters 3.2.2, 3.
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Tom Gambill 2209 Siebel Center 244-3541 gambill@illinois.edu All relevant class information is presented on the CS 101 web site. http:/courses.engr.illinois.edu/cs101/sp2015/ Check the web site at least once every three days for updates. 0-2 Teaching Assi
School: University Of Illinois, Urbana Champaign
CS 425/ECE 428: Distributed Systems Recommended Programming Assignment 0 (MP0) No due date. This MP0 will not be graded. No credit assigned to MP0. If you are not familiar with socket programing: This assignment is strongly recommended for stu
School: University Of Illinois, Urbana Champaign
Course: User Interface Design
Typography Brian Bailey Announcements Signup for demonstration of prototype link is on the main course web page I2CS should work with TA to: conduct remote demonstration, make executable available to run locally, or make a narrated video HW3 due Nov.
School: University Of Illinois, Urbana Champaign
Course: Text Information Systems
Information Extraction and Integration: an Overview William W. Cohen Carnegie Mellon University April 26, 2004 Example: The Problem Martin Baker, a person Genomics job Employers job posting form Example: A Solution Extracting Job Openings from the Web foo
School: University Of Illinois, Urbana Champaign
Course: Text Information Systems
User Interface & Visualization (Lecture for CS410 Text Info Systems) ChengXiang Zhai Department of Computer Science University of Illinois, Urbana-Champaign Conceptual Framework of Text Information Systems (TIS) Retrieval Applications Visualization Summar
School: University Of Illinois, Urbana Champaign
Course: Text Information Systems
Chapter11:OpinionMining Bing Liu Department of Computer Science University of Illinois at Chicago liub@cs.uic.edu Introductionfactsandopinions Two main types of textual information on the Web. Current search engines search for facts (assume they are true)
School: University Of Illinois, Urbana Champaign
Course: Text Information Systems
Note-2: Natural Language Processing and Text Information Systems Department of Computer Science University of Illinois at Urbana-Champaign czhai@illinois.edu ChengXiang Zhai 1. WHAT IS NATURAL LANGUAGE PROCESSING(NLP)? Natural language processing (NLP) is
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Conict to Midterm 2: April 9, 2013 Instructions: 1. This is a closed book exam. No notes, books, calculators, etc. are allowed. 2. Answer all problems. You can write I Dont Know for a problem (or its sub-parts)
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
CS125 : Introduction to Computer Science Lecture Notes #2 Architecture and Program Development c 2005, 2004, 2002, 2001 Jason Zych 1 Lecture 2 : Architecture and Program Development Data Encoding The idea of data encoding is to take information in one for
School: University Of Illinois, Urbana Champaign
" MedElite Point of Sale Software Requirements" Introduction! " The MedElite POS is a custom designed software for use in a busy medical practice. The software employs a simple uncomplicated touch screen user interface that is used by nurses who are gene
School: University Of Illinois, Urbana Champaign
Chukwa: A large-scale monitoring system Jerome Boulon jboulon@yahoo-inc.com Yahoo!, inc Andy Konwinski andyk@cs.berkeley.edu UC Berkeley Runping Qi runping@yahoo-inc.com Yahoo!, inc Ariel Rabkin asrabkin@cs.berkeley.edu UC Berkeley Eric Yang eyang@yahoo-i
School: University Of Illinois, Urbana Champaign
Comparing the performance of distributed hash tables under churn Jinyang Li, Jeremy Stribling, Thomer M. Gil, Robert Morris, M. Frans Kaashoek MIT Computer Science and Articial Intelligence Laboratory cfw_jinyang, strib, thomer, rtm, kaashoek@csail.mit.ed
School: University Of Illinois, Urbana Champaign
Megastore: Providing Scalable, Highly Available Storage for Interactive Services Jason Baker, Chris Bond, James C. Corbett, JJ Furman, Andrey Khorlin, James Larson, Jean-Michel Leon, Yawei Li, Alexander Lloyd, Vadim Yushprakh Google, Inc. cfw_jasonbaker,c
School: University Of Illinois, Urbana Champaign
Course: Special Topic
.text main: li $a0, 90 sw $a0, 0xffff0014($zero) li $t0, 0 sw $t0, 0xffff0018($zero) # say it is an absolute angle li $t0, 10 sw $t0, 0xffff0010($zero) # set velocity forever: j main
School: University Of Illinois, Urbana Champaign
Course: Special Topic
.text main: li $a0, 10 jal set_speed li $a0, 0 # face EAST jal set_orientation jal wait li $a0, 90 # face SOUTH jal set_orientation jal wait li $a0, 180 # face WEST jal set_orientation jal wait li $a0, 270 # face NORTH jal set_orientation ja
School: University Of Illinois, Urbana Champaign
Building Blocks for Theoretical Computer Science (Version 1.3) Margaret M. Fleck January 1, 2013 Contents Preface xi 1 Math review 1 1.1 Some sets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Pairs of reals . . . . . . . . . . . . . . .
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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-un
School: University Of Illinois, Urbana Champaign
Course: Special Topic
Debugging Some data from a previous semester Avg Time to do MP Students 40 35 30 25 20 15 10 MP[12] average 5 0 0-1 2-3 4-5 6-7 8-9 10-11 Time (hrs) March 6, 2013 1 What is responsible for distribution? Have you ever monitored the time you spent on doing
School: University Of Illinois, Urbana Champaign
Course: Special Topic
Outline Overcoming limitations to SIMD-Vectorization Data Dependences Data Alignment Aliasing Non-unit strides Conditional Statements Vectorization with intrinsics 54 Data Alignment Vector loads/stores load/store 128 consecutive bits to a vector regi
School: University Of Illinois, Urbana Champaign
Course: Special Topic
CS232: Lecture 4 (Functions in MIPS) In this lecture, we'll consider two functions: int t1 t2 t3 . . . main() . . . cfw_ ( 8 ) ; int int - fact fact (3) ; tl + t2; for (i = ni f = f * ii return f; fact(int if f i-) return 0; int . f so.L tl rnain() !to.
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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/1/13 2012 Craig Zilles 1 Process View Process = thread + code,
School: University Of Illinois, Urbana Champaign
Course: Special Topic
CS232 Lecture 6 Craig Zilles, some figures from Computer Organization & Design Compilers, Assemblers, and Linkers Now that we know what assembly language is all about, and we've looked at how code primitives (e.g., loops, if, functions) from a high-level
School: University Of Illinois, Urbana Champaign
Course: Special Topic
CS232: Lecture 4 (Functions in MIPS) int main() cfw_ . t1 = fact(8); t2 = fact(3); t3 = t1 + t2; . return 0; int fact(int n) cfw_ int i, f = 1; for (i = n; i > 1; i-) f = f * i; return f; int main() cfw_ . main: t1 = fact(8); t2 = fact(3); t3 = t1 + t2;
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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 Zill
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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 12/3/12 2012 Craig Zilles 1 Process View Process = thread + code,
School: University Of Illinois, Urbana Champaign
Course: Special Topic
Instant replay The semester was split into roughly four parts. The 1st quarter covered instruction set architecturesthe connection between software and hardware. In the 2nd quarter of the course we discussed processor design. We focused on pipelining,
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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 now?
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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 of conc
School: University Of Illinois, Urbana Champaign
Course: Special Topic
Exploiting Parallelism Of the computing problems for which performance is important, many have inherent parallelism. E.g., computer games: graphics, physics, sound, A.I. etc. can be done separately Furthermore, there is often parallelism within each o
School: University Of Illinois, Urbana Champaign
Course: Special Topic
Performance Optimization, cont. How do we fix performance problems? April 20, 2013 Single-Instruction Multiple Data (SIMD) 1 How do we improve performance? Imagine you want to build a house. How long would it take you? What could you do to build that hou
School: University Of Illinois, Urbana Champaign
Course: Special Topic
A Real Problem What if you wanted to run a program that needs more memory than you have? April 18, 2013 1 Virtual Memory (and Indirection) Finally, we get to Virtual Memory! Well talk about the motivations for virtual memory Well talk about how it is
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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. Wel
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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. Wel
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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
Course: Special Topic
How big is the cache? For a byte-addressable machine with 16-bit addresses with a cache with the following characteristics: It is direct-mapped (as discussed last time) Each block holds one byte The cache index is the four least significant bits Two qu
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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 Welcome to Part 3.5: Memory Sys
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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
Course: Special Topic
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 25 years. Deeper Pipelines
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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 fo
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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 subset of
School: University Of Illinois, Urbana Champaign
Course: Special Topic
MIPS assembly programming: 1 Todays lecture Exam Structure Review the Datapath Trace a couple of instruc0ons Assembly programming Register names Arrays Pseudo-instruc0ons (including pseudo-branches) If/else 2 Exam Structure 3
School: University Of Illinois, Urbana Champaign
Course: Special Topic
How do we evaluate computer architectures? Think of 5 characteristics that differentiate computers? Can some processors compute things that others cant? October 21, 2012 How do we evaluate computer architectures? Think of 5 characteristics that differe
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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 C
School: University Of Illinois, Urbana Champaign
Course: Special Topic
Instruc(on sets & RISC vs. CISC, Compilers, Assemblers, Linkers, & Loaders, malloc/new & Memory images, and who cares about assembly. 1 Todays lecture ISA review & history Compila(on process Types of memory & memory image Global, automa+c (sta
School: University Of Illinois, Urbana Champaign
Course: Special Topic
Instruc(on sets & RISC vs. CISC, Compilers, Assemblers, Linkers, & Loaders, malloc/new & Memory images, and who cares about assembly. 1 Todays lecture ISA review & history Compila(on process Types of memory & memory image Global, automa+c (sta
School: University Of Illinois, Urbana Champaign
Course: Special Topic
What does this C code do? int foo(char *s) cfw_! !int L = 0;! !while (*s+) cfw_! ! !+L;! !! !return L;! October 10, 2012 Machine Language and Pointers 1 Machine Language and Pointers Array Indexing vs. Pointers Pointer arithmetic, in particular October
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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 & forth. Register Co
School: University Of Illinois, Urbana Champaign
Course: Special Topic
Recursion: Deni&on: Recursion: If you s(ll don't get it, see: "Recursion". 1 Todays lecture Control ow review & If/Else Recursion My turn (Example) Your turn Callee-saved Registers My turn again 2 MIPS control instructio
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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/e
School: University Of Illinois, Urbana Champaign
Course: Special Topic
All Together: Instruc1on Memory + Arithme1c Unit 1 Todays lecture Instruc1ons Instruc)on Memory Program Counter (PC) Adder Pu<ng all together Arithme)c unit to work 2 Fridays lecture Register-to-register arithmetic instructions
School: University Of Illinois, Urbana Champaign
Course: Special Topic
Building an Arithme0c Machine 1 Todays lecture Register Files, review/cont. Registers The Arithme0c Machine Programmable hardware Instruc6on Set Architectures (ISA) Instruc6ons & Registers Assembly Language Machine Language 2
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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 and logical
School: University Of Illinois, Urbana Champaign
Course: Special Topic
Flip Flops, Registers, and Register Files 1 Todays lecture Storing State Finishing up the SR Latch Synchronous Design Clocks D Flip Flops MIPS ISA introduc=on Register Files Registers Decoders 2 Timing diagram of an SR Latch S
School: University Of Illinois, Urbana Champaign
Course: Special Topic
Propoga'on Delay and State 1 Todays lecture Propoga'on Delay Timing diagrams. Delay of ALU32 Storing State SR Latch Synchronous Design Clocks D Flip Flops 2 Propoga'on Delay Real gates dont switch instantaneously There is
School: University Of Illinois, Urbana Champaign
Course: Special Topic
Finite State Machine 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 circuit usin
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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 should know
School: University Of Illinois, Urbana Champaign
Course: Special Topic
Building an ALU (Part 2): 1 Why NOR is more general than NOT: Weve changed the ALU design to include NOR over NOT AND X OR x" NOT(x)" 0" 1" 1" 0" I0 I1 Y Y NOR XOR R0 R1 I2 I3 S0 S1 G " x" 0" 0" 1" 1" y" NOR(x,y)" 0" 1" 1" 0" 0" 0" 1" 0" " " We can
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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.on Buildi
School: University Of Illinois, Urbana Champaign
Course: Special Topic
Building an ALU (Part 2): 1 Why NOR is more general than NOT: Weve changed the ALU design to include NOR over NOT AND X OR x" NOT(x)" 0" 1" 1" 0" I0 I1 Y Y NOR XOR R0 R1 I2 I3 S0 S1 G " x" 0" 0" 1" 1" y" NOR(x,y)" 0" 1" 1" 0" 0" 0" 1" 0" " " We can
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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> opera:ons
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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.on Buildi
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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#executes#on#a#processo
School: University Of Illinois, Urbana Champaign
Course: Special Topic
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 & Bitwise Logica
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements Graphs lecture25: Graphs Sean Massung Largely based on slides by Cinda Heeren CS 225 UIUC 23rd July, 2013 Sean Massung Graphs Announcements Graphs Announcements mt3 tonight at 7pm mp7.1 extra credit due Friday night (7/26) at 11pm Sean Massu
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements Motivation Disjoint Sets lecture24: Disjoint Sets Sean Massung Largely based on slides by Cinda Heeren CS 225 UIUC 22nd July, 2013 Sean Massung Disjoint Sets Announcements Motivation Disjoint Sets Announcements mp6 due tonight mp7 out soon!
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MST Review Dijkstras A lecture29: Shortest Path Algorithms Sean Massung Largely based on slides by Cinda Heeren CS 225 UIUC 30th July, 2013 Sean Massung Graph Traversals Announcements MST Review Dijkstras A Outline 1 Announcements 2 MST Revi
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements Hello World to A After CS 225 lecture30: Beyond CS 225 Sean Massung CS 225 UIUC 31st July, 2013 Sean Massung Beyond CS 225 Announcements Hello World to A After CS 225 Announcements lab graphs due tomorrow, 8/1 at 11pm nal exam this Friday (8
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MSTs Kruskals Prims lecture28: Minimum Spanning Trees Sean Massung Largely based on slides by Cinda Heeren CS 225 UIUC 29th July, 2013 Sean Massung Graph Traversals Announcements MSTs Kruskals Prims Outline 1 Announcements 2 MSTs 3 Kruskals
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements lecture26: Graph Implementations Sean Massung Largely based on slides by Cinda Heeren CS 225 UIUC 24th July, 2013 Sean Massung Graph Implementations Announcements Announcements mp7.1 extra credit due Friday (7/26) at 11pm Code challenge Frid
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements BFS DFS lecture27: Graph Traversals Sean Massung Largely based on slides by Cinda Heeren CS 225 UIUC 25th July, 2013 Sean Massung Graph Traversals Announcements BFS DFS Announcements mp7.1 extra credit due tomorrow night (7/26) Code challeng
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements Motivation Hash Functions lecture22: Hashing Sean Massung Largely based on slides by Cinda Heeren CS 225 UIUC 17th July, 2013 Sean Massung Hashing Announcements Motivation Hash Functions Announcements lab avl due tomorrow (7/18) mp6.1 extra
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements Separate Chaining Linear Probing lecture23: Hash Tables Sean Massung Largely based on slides by Cinda Heeren CS 225 UIUC 18th July, 2013 Sean Massung Hash Tables Announcements Separate Chaining Linear Probing Announcements mp6.1 extra credit
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: 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: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Final Exam: 7pm-10pm, May 3, 2013 David Kinley Hall, Room 114 1. Multiple choice. (8 pts.) For each of the questions below choose the most appropriate answer. No IDK credit for this question! (A) Given a graph G
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Algorithms, Fall 2010 Final Exam: December 14, 2010 Instructions: This is a closed book exam. No notes, books, calculators, etc. are allowed. Answer Problems 1,2,3 and any four of Problems 4,5,6,7,8. Read all questions before deciding which ones
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Conict Final Exam: 7pm-10pm, May 6, 2013 1. Multiple choice. (8 pts.) For each of the questions below choose the most appropriate answer. (A) Given a ow f on a network G with costs on the edges, there is a linea
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Midterm 1: Conict Exam Instructions: (A) This is a closed book exam. No notes, books, calculators, cellphones, etc. are allowed. (B) Graduate student: Answer all questions on the exam. (C) Undergraduate student:
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Fundamental Algorithms, Spring 2013 Conict to Midterm 2: April 9, 2013 Instructions: 1. This is a closed book exam. No notes, books, calculators, etc. are allowed. 2. Answer all problems. You can write I Dont Know for a problem (or its sub-parts)
School: University Of Illinois, Urbana Champaign
CS 473g: Algorithms, Fall 2007 Midterm October 4, 2007 Name: Net ID: Alias: This is a closed-book, closed-notes, open-brain exam. If you brought anything with you besides writing instruments and your handwritten 8 1 11 cheat sheet, please leave it at the
School: University Of Illinois, Urbana Champaign
CS 473g: Algorithms, Fall 2007 Final 1:30-4:30 PM, Tuesday, December 11, 2007 Name: Net ID: Alias: This is a closed-book, closed-notes, open-brain exam. If you brought anything with you besides writing instruments and your handwritten 8 1 11 cheat sheet,
School: University Of Illinois, Urbana Champaign
CS 573: Algorithms, Fall 2013 Midterm October 8, 2013 Solution 1. NP Completeness. (25 pts.) Prove that the following problem is NP-Complete: String Reconstruction Instance: (, F): : A set of n dierent characters F: A set of strings made out characters of
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Problem 1 (For T/R questions whose answer is False and correct, if no explanation is given, 1 point is deducted.) Part 1 min redundancy, avoid info loss, preserve dependency, ensure good query performance Part 2
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Midterm 2 Solutions Spring 2014 1. Clearly indicate the four indicated spanning trees of the same undirected edge-weighted graph. Solution: 5 5 s s 7 14 11 14 10 13 10 5 4 6 8 11 1 (c) The minimum spanning tree. (unique) 13 2 9 11 1 3 7 2 9 5 12 14
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 411 Database Systems: Homework #3 Fall 2014 Due on Oct 9, 2014 at 11:59pm Please submit a single pdf file of all your solutions (including all diagrams, if any) to compass 2g. Please make sure your diagrams and their labels are clear. Problem 1 Short a
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Homework 4 Due date: November 20 1. Purpose: Learn about articulation points, bridges, and biconnected components, and Euler tours. Please solve (8 points) Problem 22-2, and (4 points) Problem 22-3 on pages 558-9. Problem 22-2 a) Suppose that the root has
School: University Of Illinois, Urbana Champaign
Course: Algorithms
1 Distributed Shared Memory Slides by Prof. Jennifer Welch 2 Some of the slides by Prof. Welch are edited, and some new slides has been added Internet stack 3 Protocol layers Phy layer, Link layer (Ethernet, WiFi), Network layer (IP), Transport layer (TCP
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Midterm 1 Study Questions Fall 2014 This is a core dump of potential questions for Midterm 1. This should give you a good idea of the types of questions that we will ask on the examin particular, there will be a series of True/False questionsbut th
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 1. Final Exam Solutions (Version B) Fall 2014 (a) Which of the following statements is true for every language L cfw_0, 1 ? Yes X No L is non-empty. is a subset of cfw_0, 1 . X Yes No L is decidable or L is innite (or both). Every nite language is
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
University of Illinois at Urbana-Champaign Department of Computer Science Final Examination 3 hours CS 125 Introduction to Computer Science Last Name: First Name: NetID: _ _ _ _ _ _ _ _ @ illinois.edu (write legibly!) PLEASE READ THE FOLLOWING CAREFULLY
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
University of Illinois at Urbana-Champaign Department of Computer Science Spring 2008 CS 125 Final Examination SOLUTION 1. Guess my number 6 points. HAL and Arthur are playing a simple 'guess my number' game: HAL: "I'm thinking of a integer between 1 and
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
Write your NetId here:_ University of Illinois at Urbana-Champaign Department of Computer Science CS125 Fall 2008 Final Examination Solution 1. Type and Protection Analysis 10 points Consider the following code: public class Art cfw_ public Art(boolean b)
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
CS125 Final Examination Fall 2009 Write your NetID here:_ University of Illinois at Urbana-Champaign Department of Computer Science Final Examination (Solution) 1. Concepts 10 points (2 points each) 1. Carefully analyze the following mystery program. What
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
University of Illinois at Urbana-Champaign Department of Computer Science Final Examination CS 125 Introduction to Computer Science Spring 2008 3 Hours Name: Last, First NetID: _ _ _ _ _ _ _ _ @ uiuc.edu PLEASE READ THE FOLLOWING CAREFULLY This is a clos
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
University of Illinois at Urbana-Champaign Department of Computer Science Final Examination CS 125 Introduction to Computer Science Fall 2009 3 Hours Last Name: First Name: NetID: _ _ _ _ _ _ _ _ @ illinois.edu PLEASE READ THE FOLLOWING CAREFULLY You may
School: University Of Illinois, Urbana Champaign
Course: Intro To Computer Science
University of Illinois at Urbana-Champaign Department of Computer Science Final Examination CS 125 Introduction to Computer Science Fall 2008 3 Hours Last Name: First Name: NetID: _ _ _ _ _ _ _ _ @ illinois.edu PLEASE READ THE FOLLOWING CAREFULLY You may
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Midterm 2 Combined Solutions Fall 2014 1. (= conict problem 1) Clearly indicate the edges of the following spanning trees of the weighted graph pictured below. (a) A depth-rst spanning tree rooted at s Solution: There are many many different soluti
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Midterm 2 (Version B) Questions Fall 2014 Write your answers in the separate answer booklet. Please return this question sheet and your cheat sheet with your answers. 1. Clearly indicate the edges of the following spanning trees of the weighted gra
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 1. Midterm 1 (Version A) Solutions Fall 2014 (a) If 2 + 2 = 5, then Jeff is the Queen of England. True False I dont know Solution: The implication p q is logically equivalent to p q. The premise (2 + 2 = 5) is false, so the implication is true, whe
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 374 Midterm 1 (Version A) Questions Fall 2014 Write your answers in the separate answer booklet. Please return this question sheet and your cheat sheet with your answers. 1. For each statement below, check True if the statement is always true and False
School: University Of Illinois, Urbana Champaign
Course: Data Structures
University of Illinois at Urbana-Champaign Department of Computer Science Second Examination Grading Rubric CS 225 Data Structures and Software Principles Fall 2010 7p-9p, Tuesday, November 2 Name: NetID: Lab Section (Day/Time): This is a closed book and
School: University Of Illinois, Urbana Champaign
Course: Data Structures
University of Illinois at Urbana-Champaign Department of Computer Science First Examination RUBRIC CS 225 Data Structures and Software Principles Spring 2012 7-9p, Tuesday, February 21 Name: NetID: Lab Section (Day/Time): Labs this week are ocially cance
School: University Of Illinois, Urbana Champaign
Course: Discrete Math
CS 173, Final Exam 11 May 2011 Fill in your name, netid, and discussion section time below. Also write your name or netid on the last page (which sometimes gets pulled o). NAME: NETID: DISCUSSION DAY/TIME: Problem Possible Score Problem Possible Score Tot
School: University Of Illinois, Urbana Champaign
Course: Discrete Math
CS 173, Final Exam 14 December 2010 Fill in your name, netid, and discussion section time below. Also write your name or netid on the last page (which sometimes gets pulled o). NAME: NETID: DISCUSSION DAY/TIME: Problem Possible Score Problem Possible Scor
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements: MP7 available. Due 12/11, 11:59p. EC due 12/4, 11:59p. Today: Disjoint Sets A Disjoint Sets example: Let R be an equivalence relation on the set of students in this room, where (s,t) R if s and t have the same favorite among cfw_AB, FN, DJ,
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements: MP7 available. Due 12/11, 11:59p. Code Challenge #5 tonight, 9p, in Siebel 0224 - Palantir Q: if this graph is simple and connected, how many edges does it have? A: at least _, at most _ Some functions well compare: Graphs: Adjacency List i
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements: MP7 available. Due 12/11, 11:59p. EC due 12/4, 11:59p. Today: Graph Implementations How do we get from here to there? Need: 1. Common Vocabulary 2. Graph implementation 3. Traversal 4. Algorithms. Graphs: theory that will help us in analysi
School: University Of Illinois, Urbana Champaign
Course: 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
/* * @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: 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