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: 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: 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
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: 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 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
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 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: Data Structures
yxv S`9wu tFsFTi0TH'G$X6e!0dc'H%'a`YXVTG)S%0 I HRQ06 I r q p h 1 ) U & g f E b $ " ) $ $5 $ W U D E& $ $ P D E $ $ E D ) A $ 85 3 1 ) & $ " 4G)!'H#G)F4CB%6@976420('%#! ) ' % $ ! 0 (&#" ! " pw d g" h e) o0"j$ ! (r" Hj$ B0y w ) p gk d d j$ d g ) fy k ) o
School: University Of Illinois, Urbana Champaign
Course: Data Structures
us q i hfec vtrpQg9db $ T ` E V $ T 1 ) & 3" & ) 3 '%#@aYDXWUS0(%R!Q#PI D E $ $ E D ) A $ 85 3 1 ) & $ " 4G)!'H#G)F4CB%6@976420('%#! ) ' % $ ! 0 (&#" t m u ! $ m m t u ! ! t u $" u u $ u u t u g " G s" ) V" ` u h) V" t n ) t " x~$ t m t Pu tt (Pw t y$
School: University Of Illinois, Urbana Champaign
Course: Data Structures
hg e c aYXV iPfdb`9WU & D E 1 ) & Q T4G)!SF20R'P! I D E $ $ E D ) A $ 85 3 1 ) & $ " 4G)!'H#G)F4CB%6@976420('%#! ' & $ # ( %"! P 8 GG# I6 ! A@ ! R 4 ' B ' D 4 r! GD ! & T F 4 @ !& ` 4 # 6 @ R T 8 # 8 B # 4 h HB B 4 D # 4 ' B T zD ! D ! T HB D ! & A@4 4
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: Data Structures
Todays announcements: MP6 available, due 4/22, 11:59p. If (Find(A) != Find(B) Union(Find(A),Find(B); If (Find(D) != Find(E) Union(Find(D),Find(E); If (Find(A) != Find(C) Union(Find(A),Find(C); If (Find(C) != Find(B) Union(Find(C),Find(B); If (Find(B) != F
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: Final exam - 5/9, 1:30-4:30p, Locations TBA Exam review - 5/8, 1:30, DCL1320 How do we get from here to there? Need: 1. Common Vocabulary 2. Graph implementation 3. Traversal 4. Algorithms. Prims Algorithm (undirected graph with unco
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP7 available. Due 5/6, 11:59p. Code challenge tonight! 9p, Siebel 0224. How do we get from here to there? Need: 1. Common Vocabulary 2. Graph implementation 3. Traversal 4. Algorithms. BFS: Running time review. and subtle point. A B
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP7 available, due 5/6, 11:59p. Student Projects Expo - Siebel 0216, 5/4, 5p. Final exam: 5/9, 1:30-4:30p. How do we get from here to there? Need: 1. Common Vocabulary 2. Graph implementation 3. Traversal 4. Algorithms. Pause for an
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP7 available. Due 5/6, 11:59p. EC due 4/29, 11:59p. Code challenge #3, 4/30, 9p, Siebel 0224. (next week) How do we get from here to there? Need: 1. Common Vocabulary 2. Graph implementation 3. Traversal 4. Algorithms. Incident edge
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP7 available. Due 5/6, 11:59p. EC due 4/29, 11:59p. Code challenge #3, 4/30, 9p, Siebel 0224. (next week) Please check your grade: chara.cs.illinois.edu Final exam: 5/9, 1:30-4:30p, locations TBA email c-heeren@illinois.edu asap w c
School: University Of Illinois, Urbana Champaign
Spring 2012 CS 105 Midterm 1 Page 1 of 17 February 21st, 2012 1. Name: FORM A DO NOT open this packet UNTIL the proctor instructs you to. READ and complete the following: Bubble your Scantron only with a #2 pencil. On Scantron, bubble : 1. Your Name 2. Yo
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS105 Spring 2012 Midterm 2 Page 1 of 17 Tuesday, April 3rd 2012 1. Write your name here: 2. DO NOT OPEN THIS until you are instructed to. 3. Bubble in your Name & UIN on your scantron. 4. Bubble in form letter on your scantron: FORM C 5. READ the followi
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS105 Spring 2012 Midterm 2 Page 1 of 17 Tuesday, April 3rd 2012 1. Write your name here: 2. DO NOT OPEN THIS until you are instructed to. 3. Bubble in your Name & UIN on your scantron. 4. Bubble in form letter on your scantron: FORM D 5. READ the followi
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS105 Spring '12 Midterm 2 Answer Key 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 Form A D B A A B A A D B C A A D D B A D B D D C B C D A D Form B D B A A D C A D B A C C D A D A A C D C D B C D A D D C
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS105 Spring 2012 Midterm 2 Page 1 of 17 Tuesday, April 3rd 2012 1. Write your name here: 2. DO NOT OPEN THIS until you are instructed to. 3. Bubble in your Name & UIN on your scantron. 4. Bubble in form letter on your scantron: FORM B 5. READ the followi
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Spring 2012 CS 105 Midterm 1 Page 1 of 17 February 21st, 2012 1. Name: FORM D 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: 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: 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
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: 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
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: 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: 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
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 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 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: 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
CS 101 Lab 5 Answer Sheet This lab is to be worked individually. Name: _Siyuan Li_ Netid: _sli62_ Section: _AYI_ Part 1: A simple C program 1. Write the command(s) to navigate to your home directory from the root directory: _cd/home_ 2. Write the error me
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: 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: 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: 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
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: 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 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
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: 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: 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: Introduction To Data Mining
CS512 (Spring 2011) Advanced Data Mining: Midterm Exam I (Tuesday, March 1, 2011, 90 minutes, 100 marks brief answers directly written on the exam paper) Note: Closed book and notes but one reference sheet allowed, scratch paper not need to be returned. T
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 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: Introduction To Data Mining
Data Mining: Concepts and Techniques (3rd ed.) Chapter 1 Jiawei Han, Micheline Kamber, and Jian Pei University of Illinois at Urbana-Champaign & Simon Fraser University 2013 Han, Kamber & Pei. All rights reserved. 1 August 29, 2013 August 29, 2013 Data
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: 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: 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: Introduction To Data Mining
UIUC-CS412 An Introduction to Data Warehousing and Data Mining (Fall 2008) Midterm Exam (Monday, Oct. 22, 2009, 90 minutes, 100 marks, single sheet reference, brief answers) Name: NetID: Score: 1. [30] Data preprocessing. (a) [6] For data visualization, t
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: 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: 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: 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: 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: 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
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
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
CS 573 Homework 0 (due September 1, 2010) Fall 2010 CS 573: Graduate Algorithms, Fall 2010 Homework 0 Due Wednesday, September 1, 2010 in class This homework tests your familiarity with prerequisite material (http:/www.cs.uiuc.edu/class/ fa10/cs573/stuff
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Fundamental Algorithms, Spring 2011 HW 3 Homework is due by Monday, 23:59:59, February 14 Problem 1 is due by Sunday, 23:59:59, February 13 This homework contains four problems. Read the instructions for submitting homework on the course webpage.
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2009 Homework 5 Assigned: Nov/8 Due in class Dec/1 Total points: 32 for undergraduate students, 40 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions for p
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Algorithms, Fall 2008 HW 8 (Solution) 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 sheets of paper; th
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: 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
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: Cs473
CS 473: Fundamental Algorithms, Spring 2012 Homework 3 (due Tuesday, 23:55:00, February 14, 2012) Collaboration Policy & submission guidelines: See homework 1. Each student individually have to also do quiz 3 online. Version: 1.0 1. (30 pts.) Saving the w
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473 Homework 9 Solutions Spring 2010 1. Let k be an arbitrary xed integer. 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 bloc
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: Introduction To Data Mining
ASSIGNMENT 1 SOLUTION QUESTION 1. (5 PTS) This question is intended to give an opportunity to all students to know the recent issue in the data mining community. 1. BIG DATA DEFINITION (2 PTS) Big Data has bee
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: 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: Algorithms
Algorithms Copyright c 2006 S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani July 18, 2006 2 Algorithms Contents Preface 0 Prologue 0.1 Books and algorithms 0.2 Enter Fibonacci . . . 0.3 Big-O notation . . . . Exercises . . . . . . . . . . . . . . . .
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP6 available, due 4/22, 11:59p. If (Find(A) != Find(B) Union(Find(A),Find(B); If (Find(D) != Find(E) Union(Find(D),Find(E); If (Find(A) != Find(C) Union(Find(A),Find(C); If (Find(C) != Find(B) Union(Find(C),Find(B); If (Find(B) != F
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: Final exam - 5/9, 1:30-4:30p, Locations TBA Exam review - 5/8, 1:30, DCL1320 How do we get from here to there? Need: 1. Common Vocabulary 2. Graph implementation 3. Traversal 4. Algorithms. Prims Algorithm (undirected graph with unco
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP7 available. Due 5/6, 11:59p. Code challenge tonight! 9p, Siebel 0224. How do we get from here to there? Need: 1. Common Vocabulary 2. Graph implementation 3. Traversal 4. Algorithms. BFS: Running time review. and subtle point. A B
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP7 available, due 5/6, 11:59p. Student Projects Expo - Siebel 0216, 5/4, 5p. Final exam: 5/9, 1:30-4:30p. How do we get from here to there? Need: 1. Common Vocabulary 2. Graph implementation 3. Traversal 4. Algorithms. Pause for an
School: University Of Illinois, Urbana Champaign
Course: Data Structures
yxv S`9wu tFsFTi0TH'G$X6e!0dc'H%'a`YXVTG)S%0 I HRQ06 I r q p h 1 ) U & g f E b $ " ) $ $5 $ W U D E& $ $ P D E $ $ E D ) A $ 85 3 1 ) & $ " 4G)!'H#G)F4CB%6@976420('%#! ) ' % $ ! 0 (&#" ! " pw d g" h e) o0"j$ ! (r" Hj$ B0y w ) p gk d d j$ d g ) fy k ) o
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP7 available. Due 5/6, 11:59p. EC due 4/29, 11:59p. Code challenge #3, 4/30, 9p, Siebel 0224. (next week) How do we get from here to there? Need: 1. Common Vocabulary 2. Graph implementation 3. Traversal 4. Algorithms. Incident edge
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP7 available. Due 5/6, 11:59p. EC due 4/29, 11:59p. Code challenge #3, 4/30, 9p, Siebel 0224. (next week) Please check your grade: chara.cs.illinois.edu Final exam: 5/9, 1:30-4:30p, locations TBA email c-heeren@illinois.edu asap w c
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP3 available, due 2/28, 11:59p. Stack array based implementation: template<class SIT> template<class SIT> void Stack<SIT>:push(const SIT & e)cfw_ if (size >= capacity) cfw_ / grow array somehow items[size] = e; size +; class Stack cfw_ pu
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP6 available, due 4/22, 11:59p. Exam 2: returned in section this week. (min)Heap: buildHeap - 3 alternatives B 1. Sort the array: U I L A B U 2. D P N I H E O W L D H E A P N O W template <class T> void Heap<T>:buildHeap()cfw_ for (
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP7 available. Due 5/6, 11:59p. EC due 4/29, 11:59p. Graphs traversal Objective: Visit every vertex and every edge, in the graph, Purpose: We can search for interesting substructures in the graph, Contrast graph traversal to BST trav
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP6 available, due 11/19, 11:59p. EC due 11/12, 11:59p. Exam 2: returned in section this week. This image reminds us of a _, which is one way we can implement ADT _, whose functions include _ and _. (min)Heap: tell me as many details
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP6 available, due 4/22, 11:59p. Exam 2: returned in section this week. We will implement a data structure in support of Disjoint Sets: Maintains a collection S = cfw_s0, s1, sk of disjoint sets. Each set has a representative membe
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP6 available, due 4/22, 11:59p. EC due 4/15, 11:59p. Code challenge TONIGHT: 9p, Siebel 0224 (FaceBook) Collision handling - Separate Chaining: (an example of open hashing) S = cfw_16, 8, 4, 13, 29, 11, 22 |S| = n h(k) = k%7 Load fa
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP6 available, due 4/22, 11:59p. EC due 4/15, 11:59p. Research study on collaboration tools: 1hr, design a startup name, earn $10 and a chance at a gift card. email rzilouc2@illinois.edu The final word on hashing: Why do we talk abou
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP5 available, due 4/4, 11:59p. Exam 2: 4/8, 7-10p, in rooms TBA lectures cancelled 4/7 review sessions: 4/7, Siebel 1404 - 12p, 1p, Everitt 151 - 2p. format: 10 multiple choice, 10 running times, MP4ish, MP5ish, mystery Party planni
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP5 av, due 4/4, 11:59p. EC due 3/21, 11:59p. AVL trees: struct treeNode cfw_ T key; int height; treeNode * left; treeNode * right; ; Insert: insert at proper place check for imbalance rotate if necessary update height AVL tree insertions: t
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP5 available, due 4/4, 11:59p. Exam 2: 4/8, 7-10p, in rooms TBA Hashing - using hash tables to implement _ Suppose we have the following info Now suppose our keys are not so nicely described Locker Number Name 103 Jay Hathaway Cours
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP5 av, due 4/4, 11:59p. Lab dictionary due 3/31, 11:59p Exam 2: 4/8, 7-10p, in rooms TBA Pebble tutorial 4/1, Now where were we? B Tree 12 18 27 of order m 52 58 63 77 89 Goal: Minimize the number of reads from disk Build a tree that uses 1
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP5 av, due 4/4, 11:59p. EC due 3/21, 11:59p. AVL tree analysis: Putting an upper bound on the height for a tree of n nodes is the same as putting a lower bound on the number of nodes in a tree of height h. Define N(h): the least number of n
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: Data Structures
yxv S`9wu tFsFTi0TH'G$X6e!0dc'H%'a`YXVTG)S%0 I HRQ06 I r q p h 1 ) U & g f E b $ " ) $ $5 $ W U D E& $ $ P D E $ $ E D ) A $ 85 3 1 ) & $ " 4G)!'H#G)F4CB%6@976420('%#! ) ' % $ ! 0 (&#" ! " pw d g" h e) o0"j$ ! (r" Hj$ B0y w ) p gk d d j$ d g ) fy k ) o
School: University Of Illinois, Urbana Champaign
Course: Data Structures
us q i hfec vtrpQg9db $ T ` E V $ T 1 ) & 3" & ) 3 '%#@aYDXWUS0(%R!Q#PI D E $ $ E D ) A $ 85 3 1 ) & $ " 4G)!'H#G)F4CB%6@976420('%#! ) ' % $ ! 0 (&#" t m u ! $ m m t u ! ! t u $" u u $ u u t u g " G s" ) V" ` u h) V" t n ) t " x~$ t m t Pu tt (Pw t y$
School: University Of Illinois, Urbana Champaign
Course: Data Structures
hg e c aYXV iPfdb`9WU & D E 1 ) & Q T4G)!SF20R'P! I D E $ $ E D ) A $ 85 3 1 ) & $ " 4G)!'H#G)F4CB%6@976420('%#! ' & $ # ( %"! P 8 GG# I6 ! A@ ! R 4 ' B ' D 4 r! GD ! & T F 4 @ !& ` 4 # 6 @ R T 8 # 8 B # 4 h HB B 4 D # 4 ' B T zD ! D ! T HB D ! & A@4 4
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
Are there more integers than natural numbers? lA I= IBI iff there is a bijection from AJo B. f(t) o -:s ~ 0 o'><o /Zl:IN\ ~: ilj-'> 2 .fCi) -: ;_ if ) t' f'(j-)-:- ~J\) ' <. .X i; eve,-, _f If .X. I ; o ()- .),6 z. ~3 oY)~-+o-oV)~: x dx.ve": '('J." '> 0 .
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
- OJ OQ :J - Vl - n ~ OJ ., t"'- 3 "C ro OJ X ro ro "C - 3 (/) Transition functions and state diagrams V R s c G .D States: Village, Rock, Snake, Chasm, Gold, Desert Transitions: -7 Oesert cfw_Village, East) -7 Snake (Desert, South) -7 Village (Desert,
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
\,I~ Choose k elements from n unique types with full replacement. order matters . , nk combinations Examples How many different 3-colorings are there for a graph with ? r~')f"' rJ)~t / 15 no des. 0 0 t IS'l J">,Qc o.~\"'-~ (J "lf f) How many unique symb
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
Q " 0 G ~- - V" - Master theorem T(n) =a If f(n) = 8(nc) r(%) with c Example: T(n) = 4T (A-=lcfw_ T\") ~=l n" + f(n) < Iogb a, where a 2: 1, b > 1 then T(~) = 8(n10g ba) G) + @(n) (:-\ ~ 8(\'~"~) t- -1-i 8(n"J Example algorithm: multiplying large numbers
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
. "' ~, .I L . f\ 01 closestpair(1J1, . , Pn) : array of 2D points) 02 best1 = Pl G- \ 03 best2 = P2 04 bestdist = dist(p1 ,p2) 05 fori= 1 ton 06 for j = 1 ton 07 newdist = dist(pi,Pj) I I if (i =f j' and newdist bestdist) 08 ( I 0 1 09 / best 1 = Pi / d
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
. . N ~ X CTQ ~ 0 "'-' ~ /'. ~ CJ1 ~ ~ ~ ~ + ~ N ~ ~ -.J ~ \,._.,/ \,._.,/ ;s ~ ~ ~ a (/) - \,._.,/ ;s ~ CQ a. :J QJ \,._.,/ \,._.,/ ~ ~ CQ ~ a (/) - \,._.,/ ~ ~ CQ ~ ~ ~ \,._.,/ \,._.,/ ~ ~ CQ CD ~ (/) - \,._.,/ ~ ~ ~ a:> N~ '-"' ~ r-. ~ N .Q (I) + N ~'-
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
"., r. s;( -; z._I .I:= " U~LJI _/- / ' r formulas -~ n ' Lr k 1- rn+1 Izk= -k ' rm - rn+1 L r = - 1- r t _ 2. _ n1-1 _ ~J. 1 -"'2. n ~ I I zk = (-r -1 \ 1 r -1 .,., s( ~ r - t ~ k= n(n+ 1) k=O -' 2.-2nH I -"2_ ntl , (' V'\H - f zk+2 n ll z-2k = ~ (i')\ ~
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
Tree terminology Nodes: root, internal, leaf, level, tree height Relations: parent/chi ld/si bli ng, ancestorI descendant I h-=l leveho i ()"~(llO- ( \tvel ~ 1 ~I l ~\)tl -:1 "2. \ tvel = "1 lt!r.' (to.J 5 overhead 'o j 't'ICJ.fy /~ More terminology 6b'o
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
Last class: induction False induction proofs - All professors have the same color shoes. - Other good examples: http:/www.math.uiuc.edu/"'hildebr/347/induction3-sol.pdf 'B . H : i. f>-1'>/r r . ' :t ()<'~ .l f:o.r o "'1 I /o Jc-1 P"'.( f, Ci II 1-><.v f
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
i f e Is no't G\ c ~-~- ~else- I thr. e 0 )J y-+ 10 I "' c't ccfw_e k gQ S.t : ~ \J ppo) ~ ~ph G h~l O.ll~ () 0 ~. (0-:oJ. & COwl 6e ~o/ore) w'i~ t,.ir\. \)~ \ colors. cne co/or. is rflJv<Ynll: A~SUM~ oe-~ ~D (O.j\ to ~ +~+ \Sy o;J. 1h. 0.(7[ IS Dn Ct., d
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
Simple math example n . n(n+1) pos.;,"i? Cia 1m: Li=ll = for all _riatt:rrafintegers n. 2 1; " i : ( ltLH t 1\1 S"l-b . t t'\ ) f'(k) -'> plk.tt) ?! f() :T t'!\ . 1ndvVJO/)', ktl r :Jvppo5e [; j -: ( k(I<H f~l '2. . B~ jh. 6' ) : k. L; 1\J .J. k+1. =' ( J
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
- 3 -c m X DJ m 3 (f) - :r -c 0 ., 3 0 ( f) Terminology of walks walk: sequence of connected nodes/edges JJc>fo closed walk: start and end point are the same a, t, ~)~I & path: walk with no node used more than once 6 overhead Terminology of walks cycle: c
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
Basics of graphs Graph= (V, E) Terminology: vertex/node, edge, neighbor/adjacent, directed vs. undirected, simple graph, degree of a node c) d,ec;(t)?' Jh ) W ccfw_C?"J (w) -:-z ccfw_t'j Cc, I -: s- V: ( ~) ~) c)ws [ -:. ( \-\ (, l 1-1-C.l (, <; J <;. w'
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
One-to-one x is a preimage of y if f(x) = y. Formally,f:A-+ B,x E A,y E B,f(x) = y One-to-one: no two inputs map to the same output (no output has more than one pre image) f: A -+ B, x, yEA, (x y) -+ (f(x) f(y) contrapositive? f-.A ~f>, v7-,'1 ~A , ~f(,1
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
Examples of functions Concepts: type signature, mapping; bubbles, plots Functions: age, t-shirt color, x 2 fcco~l~ T.sh~r~ A<3e Co )1);-S t : ~ ~ R , fL/l -= -x-z<- .,. ~ >( overhead 6 What is not a function? Not a valid function if 1. No type signature 2
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
~ Relations with numbers C\ C0~ Q <b - -\ 000 "less than" Cif_ jD - - - - - - - - - - o-1<:, "divides" 0 "congruent mod ~ (y 0 0 0 <D!<t a._~ b (.,cJ 3) 2 3 C0 overhead \) ~ ~ G 7 ~ Symmetry Symmetric: \fx, y E A, xRy ~ yRx Antisymmetric: \fx, y E A with
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
0. ., :r CD ru < CD 0 ~ -.rV -~ cs-,. -" .s- ~ ,-. vJ w 1) 9vV .J o- ., 9 r.-. It :J> II ):. . (" a-., ~ v-1 ,.,._, \) c:J ,._ II J> ro (11 ,.-+ (11 c ,.-+ 0 c- OJ (1Q - :J A - :J :r -i Constructing sets Miscellaneous elements Constructors: multiples of 3
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
a ~b (~\)J. k) ~ k \ ("-b) (<A-6) :- h i - 1 c~J 9oo ~ 4~1 q a3 ~ ~ o '1 3) ("loJ. ~1)~ / c~j_ 1 )'? v k hr- ,h f 2 Modulus addition proof Claim: For any integers a, b, c, d, k with k > 0, if a c _ d (mod k) then (a+ c)= (b +d) (mod k) b (mod k) and LA.=.
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
\ -C. 1\ (;- Q "' I ~ U1 I 0') -.! . ~ +:- ~ ' V\ I ( () _[' 0 0') +:- 0 +:- 0') ~ N 0') 0 +:- I ~ ~ N N - -C \( .c. +:- - ~ r-r r\ r- I ~ ~ I ~ ~ (/'j ~ , tJ. N 1-\ +:- -v Vl c. 0 :J ro Vl ro :J 1"'1- . 0 :J n :J ~ CD ., co ro I"+ :l CD en en 0 3 ~ CD CD
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
1. Title: Iris Plants Database Updated Sept 21 by C.Blake - Added discrepency information 2. Sources: (a) Creator: R.A. Fisher (b) Donor: Michael Marshall (MARSHALL%PLU@io.arc.nasa.gov) (c) Date: July, 1988 3. Past Usage: - Publications: too many to
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
CS412 Mini-MP2: Preprocessing Data This mini-MP asks you to use Pentaho Kettle (Spoon) software. Download (~800MB): http:/community.pentaho.com/projects/data-integration/ Launch: http:/wiki.pentaho.com/display/EAI/02.+Spoon+Introd
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Algorithms Copyright c 2006 S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani July 18, 2006 2 Contents Preface 0 Prologue 0.1 Books and algorithms 0.2 Enter Fibonacci . . . 0.3 Big-O notation . . . . Exercises . . . . . . . . . . . . . . . . . . . . .
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Appendix I: Proof by Induction [Fa13] Algorithms Jeder Genieende meint, dem Baume habe es an der Frucht gelegen; aber ihm lag am Samen. [Everyone who enjoys thinks that the fundamental thing about trees is the fruit, but in fact it is the seed.] Friedric
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Lecture 21: Shortest Paths [Fa13] Algorithms Well, ya turn left by the re station in the village and take the old post road by the reservoir and. . . no, that wont do. Best to continue straight on by the tar road until you reach the schoolhouse and then t
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Algorithms Lecture 3: Dynamic Programming Those who cannot remember the past are doomed to repeat it. George Santayana, The Life of Reason, Book I: Introduction and Reason in Common Sense (1905) The 1950s were not good years for mathematical research. We
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Lecture 12: Hash Tables [Fa13] Algorithms Insanity is repeating the same mistakes and expecting different results. Narcotics Anonymous (1981) Calvin: There! I nished our secret code! Hobbes: Lets see. Calvin: I assigned each letter a totally random numbe
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Lecture 9: Randomized Algorithms [Fa13] Algorithms The rst nuts and bolts appeared in the middle 1400s. The bolts were just screws with straight sides and a blunt end. The nuts were hand-made, and very crude. When a match was found between a nut and a bol
School: University Of Illinois, Urbana Champaign
Course: Algorithms
Appendix II: Solving Recurrences [Fa13] Algorithms Change is certain. Peace is followed by disturbances; departure of evil men by their return. Such recurrences should not constitute occasions for sadness but realities for awareness, so that one may be ha
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: Algorithms
CS473 Spring 2014 Discussion 10 April 8/9, 2014 1. Let (G, s, t) be a ow network with integer capacities. An edge e is upper-binding if increasing the capacity on e increases the value of the maximum ow in G. Describe and analyze an algorithm that nds all
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS473 Spring 2014 Discussion 12 April 22/23, 2014 1. From Set Cover to Montone SAT Consider an instance of a CNF formula specied by clauses C1 , C2 , . . . , Ck over a set of boolean variables x1 , x2 , . . . , xn . We say is monotone if each term in each
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS473 Spring 2014 Discussion 4 February 11/12, 2014 1. Some recurrences: (a) t(0) = t(1) = 2 t(n) = t( n ) + t( n ) + 2n + 2 2 2 (b) t(0) = 2 t(1) = 3 t(n) = 5 + t( n ) 2 n 2 (c) t(n) = n t( 2 ) + 3 if n < 2112014 if n 2112014 2. Counting inversions: Let
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Headbanging 01 Jan. 21/22 Spring 2014 1. Consider the following statement. Prove that every tree with n nodes has n 1 edges. A student in Corneld University, learning induction from some badly-written template, sketch the following proof: When n =
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS473 Spring 2014 Discussion 3 February 4/5, 2014 1. Let G be a directed graph with non-negative edge lengths. Describe an algorithm that given G and a number > 0 decides whether G has a cycle of average length strictly less than . The average length of a
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Headbanging 02 Jan. 28/29 Spring 2014 1. Let G = (V, E) an undirected graph, with |V | = n and |E| = m. Consider the following questions: (a) Describe an algorithm that nds a cycle in G. (b) Describe an algorithm that nds 2 distinct cycles in G. Wh
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS473 Spring 2014 Discussion 5 February 18/19, 2014 1. A subsequence is anything obtained from a sequence by extracting a subset of elements, but keeping them in the same order; the elements of the subsequence need not be contiguous in the original sequen
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS473 Spring 2014 Discussion 7 March 4/5, 2014 1. Minimum Vertex Cover in Trees Let G be an unweighted graph. A vertex cover of G is a set S of vertices in G such that every edge in G is incident to at least one vertex in S (i.e., the vertices in S cover
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS473 Spring 2014 Discussion 7 March 11/12, 2014 1. Shortest Bottleneck Path Let G be an undirected graph with distinct nonnegative edge lengths. The bottleneck distance of a path in G is the length of the longest edge in the path. Prove that the minimum
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS473 Spring 2014 Discussion 9 April 1/2, 2014 1. Suppose you are given a directed graph G = (V, E), two vertices s and t, a capacity function c E R>0 , and a second function f E R. Describe an algorithm to determine whether f is a maximum (s, t)-ow in G.
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS473 Spring 2014 Discussion 8 March 18/19, 2014 1. Describe and analyze an algorithm to nd the second smallest spanning tree of a given graph G ; that is, the spanning tree of G with smallest total weight except for the minimum spanning tree. 2. Let S be
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
Mini-Projects CS 433 Fall 2012 Mini-Project Assignment You are to prepare a presentation on the following features of one current commercial processor (including GPUs and mobile processors) Processor core microarchitecture Memory hierarchy Multicore an
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer System Organization Spring 2006 Problems for Chapter 4 Due Date: None (Practice only) Problem 1 Consider a loop that implements the vector computation Y = aX + Y (commonly known as DAXPY). Here is the code: foo: L.D MULT.D L.D ADD.D S.D DA
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: Data Structures
Todays announcements: MP6 available, due 4/22, 11:59p. If (Find(A) != Find(B) Union(Find(A),Find(B); If (Find(D) != Find(E) Union(Find(D),Find(E); If (Find(A) != Find(C) Union(Find(A),Find(C); If (Find(C) != Find(B) Union(Find(C),Find(B); If (Find(B) != F
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: Final exam - 5/9, 1:30-4:30p, Locations TBA Exam review - 5/8, 1:30, DCL1320 How do we get from here to there? Need: 1. Common Vocabulary 2. Graph implementation 3. Traversal 4. Algorithms. Prims Algorithm (undirected graph with unco
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP7 available. Due 5/6, 11:59p. Code challenge tonight! 9p, Siebel 0224. How do we get from here to there? Need: 1. Common Vocabulary 2. Graph implementation 3. Traversal 4. Algorithms. BFS: Running time review. and subtle point. A B
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP7 available, due 5/6, 11:59p. Student Projects Expo - Siebel 0216, 5/4, 5p. Final exam: 5/9, 1:30-4:30p. How do we get from here to there? Need: 1. Common Vocabulary 2. Graph implementation 3. Traversal 4. Algorithms. Pause for an
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP7 available. Due 5/6, 11:59p. EC due 4/29, 11:59p. Code challenge #3, 4/30, 9p, Siebel 0224. (next week) How do we get from here to there? Need: 1. Common Vocabulary 2. Graph implementation 3. Traversal 4. Algorithms. Incident edge
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP7 available. Due 5/6, 11:59p. EC due 4/29, 11:59p. Code challenge #3, 4/30, 9p, Siebel 0224. (next week) Please check your grade: chara.cs.illinois.edu Final exam: 5/9, 1:30-4:30p, locations TBA email c-heeren@illinois.edu asap w c
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP3 available, due 2/28, 11:59p. Stack array based implementation: template<class SIT> template<class SIT> void Stack<SIT>:push(const SIT & e)cfw_ if (size >= capacity) cfw_ / grow array somehow items[size] = e; size +; class Stack cfw_ pu
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP6 available, due 4/22, 11:59p. Exam 2: returned in section this week. (min)Heap: buildHeap - 3 alternatives B 1. Sort the array: U I L A B U 2. D P N I H E O W L D H E A P N O W template <class T> void Heap<T>:buildHeap()cfw_ for (
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP7 available. Due 5/6, 11:59p. EC due 4/29, 11:59p. Graphs traversal Objective: Visit every vertex and every edge, in the graph, Purpose: We can search for interesting substructures in the graph, Contrast graph traversal to BST trav
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP6 available, due 11/19, 11:59p. EC due 11/12, 11:59p. Exam 2: returned in section this week. This image reminds us of a _, which is one way we can implement ADT _, whose functions include _ and _. (min)Heap: tell me as many details
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP6 available, due 4/22, 11:59p. Exam 2: returned in section this week. We will implement a data structure in support of Disjoint Sets: Maintains a collection S = cfw_s0, s1, sk of disjoint sets. Each set has a representative membe
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP6 available, due 4/22, 11:59p. EC due 4/15, 11:59p. Code challenge TONIGHT: 9p, Siebel 0224 (FaceBook) Collision handling - Separate Chaining: (an example of open hashing) S = cfw_16, 8, 4, 13, 29, 11, 22 |S| = n h(k) = k%7 Load fa
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP6 available, due 4/22, 11:59p. EC due 4/15, 11:59p. Research study on collaboration tools: 1hr, design a startup name, earn $10 and a chance at a gift card. email rzilouc2@illinois.edu The final word on hashing: Why do we talk abou
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP5 available, due 4/4, 11:59p. Exam 2: 4/8, 7-10p, in rooms TBA lectures cancelled 4/7 review sessions: 4/7, Siebel 1404 - 12p, 1p, Everitt 151 - 2p. format: 10 multiple choice, 10 running times, MP4ish, MP5ish, mystery Party planni
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP5 av, due 4/4, 11:59p. EC due 3/21, 11:59p. AVL trees: struct treeNode cfw_ T key; int height; treeNode * left; treeNode * right; ; Insert: insert at proper place check for imbalance rotate if necessary update height AVL tree insertions: t
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Todays announcements: MP5 available, due 4/4, 11:59p. Exam 2: 4/8, 7-10p, in rooms TBA Hashing - using hash tables to implement _ Suppose we have the following info Now suppose our keys are not so nicely described Locker Number Name 103 Jay Hathaway Cours
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP5 av, due 4/4, 11:59p. Lab dictionary due 3/31, 11:59p Exam 2: 4/8, 7-10p, in rooms TBA Pebble tutorial 4/1, Now where were we? B Tree 12 18 27 of order m 52 58 63 77 89 Goal: Minimize the number of reads from disk Build a tree that uses 1
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP5 av, due 4/4, 11:59p. EC due 3/21, 11:59p. AVL tree analysis: Putting an upper bound on the height for a tree of n nodes is the same as putting a lower bound on the number of nodes in a tree of height h. Define N(h): the least number of n
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP5 av, due 4/4, 11:59p. EC due 3/21, 11:59p. TODAY: balanced BST (http:/webdiis.unizar.es/asignaturas/EDA/AVLTree/avltree.html) The height balance of a tree T is: b = height(TR) - height(TL) A tree T is height balanced if: T = cfw_ OR T =
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP4 available, due 3/14, 11:59p. MP5 released immediately. TODAY: balanced BST (intro) (http:/webdiis.unizar.es/asignaturas/EDA/AVLTree/avltree.html) Running times: insert remove find traverse 1 Binary Search Tree - miscellaneous characteris
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP4 available, due 3/14, 11:59p. TODAY: ADT Dictionary BST 1 Traversals: something totally different template<class T> void binaryTree<T>:levelOrder(treeNode * croot)cfw_ Running time: ADT Dictionary: Suppose we have the following data ID #
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP4 available, due 3/14, 11:59p. EC due 3/7, 11:59p At each node, two choices for direction (left, right) After both subtrees of a node are complete, move back up tree Each node is visited 3 times in a traversal. Each of those visit time
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP4 available, due 3/14, 11:59p. Code challenge tonight! sponsored by Microsoft. 3/12, 9p, Siebel 0224 TODAY: BST removal void Dictionary<K,D>:insert(treeNode * cRoot, const K & key, const D & data)cfw_ if (cRoot = NULL) cRoot = new treeNode
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP3 available, due 2/28, 11:59p. EC due 2/21. Exam 1: 2/25, 7-10p MP3.1 will be on exam (lists) MP2 solution party - 2/22, 4p, Siebel 0216 lectures cancelled 2/24 review sessions 2/24: Siebel 1404 at 12p & 1p Everitt 151 at 2p Summary runnin
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP3 available, due 2/28, 11:59p. lots of magic: #include <list> #include <iostream> #include <string> using namespace std; struct animal cfw_ string name; string food; bool big; animal(string n="blob", string f="you, bool b=true):name(n),foo
School: University Of Illinois, Urbana Champaign
Course: Data Structures
struct listNode cfw_ LIT data; Announcements listNode * next; listNode(LIT . MP3 available, due 2/28, 11:59p. EC due 2/21. Exam 1: 2/25, 7-10p Example 2: 84263 void printReverse(listNode * Running time? curr) cfw_ ; Example 3: Find kth position (well nee
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP3 available, due 2/28, 11:59p. EC due 2/21. Exam 1: 2/25, 7-10p MP3.1 will be on exam (lists) MP2 solution party - 2/22, 4p, Siebel 0216 lectures cancelled 2/24 review sessions 2/24: Siebel 1404 at 12p & 1p Everitt 151 at 2p Code challenge
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP3 available, due 2/28, 11:59p. EC due 2/21. Exam 1: 2/25, 7-10p in rooms TBA template <class T, class U> T addEm(T a, U b) cfw_ return a + b; int main() cfw_ addEm<int,int>(3,4); addEm<double,int>(3.2,4); addEm<int,double>(4,3.2); addEm<s
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP2 available, due 2/11, 11:59p. class sphere cfw_ class ball:public sphere cfw_ public: public: sphere(); ball(); sphere(double r); ball(double r, string n); double getVolume(); string getName(); void setRadius(double r); void setName(strin
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP2 available, due 2/11, 11:59p. EC: 2/4, 11:59p. Linux/Vim tutorial TONIGHT, 9p, Siebel 0224 Memory leak: int *p, *q; p = new int; q = p; *q = 8; cout < *p; What is output?_ Deleting a null pointer: q = new int; *q = 9; p = NULL; Do you lik
School: University Of Illinois, Urbana Champaign
Course: Data Structures
Announcements MP1 grading run for late adders 2/6, 11:59p. MP2 available, 2/11, 11:59p. EC: 2/4, 11:59p. Pointers and objects: face a, b; / init b class face cfw_ a = b; public: a.setName(ann); void setName(string n); string s = b.getName(); string getNa
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS 105 Week 10 MP1-MP3 Resubmissions MP6 Lab7+1s Weekly Reading #8 Weekly Reading #8 Canceled Midterm Exam #2 Tuesday, April 15, 2014 7:00pm 8:30pm Conflict Signups start Wednesday Relative vs. Absolute Positions Sheets =MATCH() =MATCH(lookup_value, looku
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS 105 Week 11 Weekly Reading #9 Weekly Reading #9 Canceled Midterm Exam #2 Tuesday, April 15, 2014 7:00pm 8:30pm Conflict signups on course website Pivot Tables A pivot table is a data summarization tool Pivot Table Summarize: A pivot-table can automati
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS 105 Week 10, continued Live activity on spreadsheet
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS 105 Week 6 Midterm Exam #1 Tomorrow, March 4, 2014 7:00pm 8:30pm Based on your last name: A-Di, 1404 Siebel Center Do-J, 1320 DCL K-M, 100 MSEB N-S, 114 DKH T-Z, 314 Altgeld TA Review Session rd 3 Tonight, March 7:00pm 8:30pm Location: 180 Bevier Hall
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS 105 Week 7 MP4: Canceled Weekly Reading #6 MP1 MP3 Regrades Data All data is made up of 0s and 1s. File extensions tell us how to interpret the 0s and 1s. File Extensions The part of the file after the dot: File Extensions The part of the file after
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS 105 Week 8, continued
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS 105 Week 7, continued MP5 Weekly Reading #6 MP1 MP3 Regrades Microsoft Excel Microsoft Excel is a spreadsheet application. Spreadsheets Spreadsheets Provides users a two-dimensional layout of cells that are organized into rows and columns. Spreadsheet
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS 105 Week 8 MP1 MP3 Resubmissions MP5 Weekly Reading #7 Midterm Feedback =COUNT(value1, [value2], ) =COUNT(array) =SUM(number1, [number2], ) =SUM(range) =AVERAGE(number1, [number2], ) =AVERAGE(range) =COUNTIF(range, criteria) =SUMIF(range, criteria, sum
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS 105 Week 5 TA Small Group Tutoring 0228 Siebel Center MP3 Midterm Exam #1 Tuesday, March 4, 2013 7:00pm 8:30pm Grades Reading #5 var a = [ 0, 2, 0, 2, 4, 2, 4, 6, 4, 6, 6, 4, 6, 8, 8, 8, 10 ]; 0, 2, 2, 4, 8, 6 8, 8, 8, 10, var a = [ 0, 2, 0, 2, 4, 2, 4
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS 105 Week 5, continued Midterm Exam #1 Tuesday, March 4, 2013 7:00pm 8:30pm TA Review Session rd 3 Monday, March 7:00pm 8:30pm Location TBA Compass Review Quizzes 5 quizzes, 5 questions each +1 point to your grade /quiz Grades JavaScript JavaScript != J
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS 105 Week 4, continued MP2 MP3 Midterm Exam #1 Tuesday, March 4, 2013 7:00pm 8:30pm 25-35 multiple choice questions Similar to Weekly Reading #4 English Pseudo-code Pseudo-code JavaScript English JavaScript Many questions will be based off coding do
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS 105 Week 2, continued Extension MP1 Things We Know if ( temp < 0 ) cfw_ wearScarf(); if ( temp < 0 ) cfw_ wearScarf(); if ( temp < 10 ) cfw_ wearHat(); if ( temp < 0 ) cfw_ wearScarf(); if ( temp < 10 ) cfw_ wearHat(); if ( temp < 20 ) cfw_ wearGl
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS 105 Week 3, continued MP1 if ( isWall("Right") = false ) cfw_ move("Right"); else if ( isWall("Forward") = false ) cfw_ move("Forward"); else if ( isWall("Left") = false ) cfw_ move("Left"); else cfw_ move("Backward"); Strings "Hello" var s = "Hell
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS 105 Week 1 Statement Statement moveForward(10); Statement moveForward(10); Statement moveForward(10); All statements in JavaScript end with a semicolon. Conditional Conditional if ( _ ) cfw_ Boolean (aka bool) Boolean (aka bool) Anything that has an a
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS 105 Week 3 MP0 Lab Countdown Write a function that counts down from 10 to 0. count from 10 to 0 start count count count count count count count count count count at 10 down to down to down to down to down to down to down to down to down to down to 9 8
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS 105 Week 4 Exam Overview Variables Variables Operations: +, -, *, and / Variables Operations: +, -, *, and / Conditionals: ifelse ifelse Variables Operations: +, -, *, and / Conditionals: ifelse ifelse Loops: while, for Variables Operations: +, -
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS 105 Week 2 Office Hours Weekly Reading #2 MP0 Grades Lab function sumCookieTypes( cookie1, cookie2, cookie3, cookie4 ) cfw_ return cookie1 + cookie2 + cookie3 + cookie4; function sumCookieTypes( cookie1, cookie2, cookie3, cookie4 ) cfw_ var sum = cook
School: University Of Illinois, Urbana Champaign
Spring 2012 CS 105 Midterm 1 Page 1 of 17 February 21st, 2012 1. Name: FORM A DO NOT open this packet UNTIL the proctor instructs you to. READ and complete the following: Bubble your Scantron only with a #2 pencil. On Scantron, bubble : 1. Your Name 2. Yo
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS105 Spring 2012 Midterm 2 Page 1 of 17 Tuesday, April 3rd 2012 1. Write your name here: 2. DO NOT OPEN THIS until you are instructed to. 3. Bubble in your Name & UIN on your scantron. 4. Bubble in form letter on your scantron: FORM C 5. READ the followi
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS105 Spring 2012 Midterm 2 Page 1 of 17 Tuesday, April 3rd 2012 1. Write your name here: 2. DO NOT OPEN THIS until you are instructed to. 3. Bubble in your Name & UIN on your scantron. 4. Bubble in form letter on your scantron: FORM D 5. READ the followi
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS105 Spring '12 Midterm 2 Answer Key 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 Form A D B A A B A A D B C A A D D B A D B D D C B C D A D Form B D B A A D C A D B A C C D A D A A C D C D B C D A D D C
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS105 Spring 2012 Midterm 2 Page 1 of 17 Tuesday, April 3rd 2012 1. Write your name here: 2. DO NOT OPEN THIS until you are instructed to. 3. Bubble in your Name & UIN on your scantron. 4. Bubble in form letter on your scantron: FORM B 5. READ the followi
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Spring 2012 CS 105 Midterm 1 Page 1 of 17 February 21st, 2012 1. Name: FORM D DO NOT open this packet UNTIL the proctor instructs you to. READ and complete the following: Bubble your Scantron only with a #2 pencil. On Scantron, bubble : 1. Your Name 2. Yo
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Spring 2012 CS 105 Midterm 1 Page 1 of 17 February 21st, 2012 1. Name: FORM A DO NOT open this packet UNTIL the proctor instructs you to. READ and complete the following: Bubble your Scantron only with a #2 pencil. On Scantron, bubble : 1. Your Name 2. Yo
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Spring 2012 CS 105 Midterm 1 Page 1 of 17 February 21st, 2012 1. Name: FORM B DO NOT open this packet UNTIL the proctor instructs you to. READ and complete the following: Bubble your Scantron only with a #2 pencil. On Scantron, bubble : 1. Your Name 2. Yo
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Spring 2012 CS 105 Midterm 1 Page 1 of 17 February 21st, 2012 1. Name: FORM C DO NOT open this packet UNTIL the proctor instructs you to. READ and complete the following: Bubble your Scantron only with a #2 pencil. On Scantron, bubble : 1. Your Name 2. Yo
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS105 Spring 2012 Midterm 2 Page 1 of 17 Tuesday, April 3rd 2012 1. Write your name here: 2. DO NOT OPEN THIS until you are instructed to. 3. Bubble in your Name & UIN on your scantron. 4. Bubble in form letter on your scantron: FORM A 5. READ the followi
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
CS105 Spring 2012 Midterm 2 Page 1 of 17 Tuesday, April 3rd 2012 1. Write your name here: 2. DO NOT OPEN THIS until you are instructed to. 3. Bubble in your Name & UIN on your scantron. 4. Bubble in form letter on your scantron: FORM A 5. READ the followi
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
"Z" indicates skipped question 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 Form A B D C C C C D A A C B A Z Z Z B B B C D C C D A A B C A A B A A A D A B D D C C C Form B A A A D A B D
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
CS 173, Fall 2012 Midterm 2 Solutions Problem 1: Checkbox (14 points) Check the box that best characterizes each item. x Z, y Z, x y true I found 143 marbles in my saucepan last Saturday. 143 is the number of marbles that ts in my saucepan exactly Number
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
CS 173, Fall 2012 Midterm 2, 6 November 2012 NAME: NETID (e.g. hpotter23, not 123987654): DISCUSSION DAY: DISCUSSION TIME: You will lose a point if you dont accurately write the day and time of the discussion you are ocially registered for. You may look t
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Algorithms, Spring 2012 Final Exam: May 7, 2012 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 to
School: University Of Illinois, Urbana Champaign
Course: Algorithms
1. True/False: 8 pts For each of the questions below answer True, False, or I dont know. (a) Let G be an undirected edge-weighted graph. Suppose there is a unique maximum weight edge e in G. Then e cannot be in any minimum weight spanning tree (MST) of G.
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473: Algorithms, Spring 2012 Midterm 2: April 5, 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 that
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: Algorithms
1. Max k-Cut via Randomization: 16 points Let G = (V, E) be graph. Max k-Cut is the problem of partitioning the node set V into k mutually disjoint sets V1 , V2 , . . . , Vk to maximize the number of edges that are cut: an edge uv is cut if u and v are in
School: University Of Illinois, Urbana Champaign
Course: Algorithms
1. Recurrences: 12 points Give a tight asymptotic bound for the following recurrences. No justication necessary. A(n) = A(n 1) + log n for n 2 and A(1) = 1. Solution: A(n) = (n log n). B(n) = 8B(n/2) + n2 for n 2 and B(n) = 1 for 0 n < 2. Solution: B(n)
School: University Of Illinois, Urbana Champaign
Course: Algorithms
1. Flows: 16 points The gure below shows a ow network along with a ow. In the gure, the notation a/b for an edge means that the ow on the edge is a and the capacity of the edge is b. 4/4 a b 9/13 2/4 6/10 5/8 3/4 s 0/3 c 2/2 t 5/7 5/5 2/2 d e 7/7 (a) Show
School: University Of Illinois, Urbana Champaign
Course: Algorithms
1. Short Questions: 24 pts (8 pts) Give a tight asymptotic bound for each of the following recurrences. A(n) = A(n 2) + n3 for n > 2 and A(1) = A(2) = 1. A(n) = (n4 ). B(n) = 3B( n/2 ) + 4B( n/4 ) + n2 for n > 4 and B(n) = 1 for 1 n 4. B(n) = (n2 log n
School: University Of Illinois, Urbana Champaign
Course: Data Structures
University of Illinois at Urbana-Champaign Department of Computer Science Second Examination 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 closed notes e
School: University Of Illinois, Urbana Champaign
Course: Theory Of Computation
Quiz 8 1. Recall that regular languages are closed under union. Based on this observation which of the following is necessarily true? (A) If L1 and L2 are regular then L1 L2 is regular. (B) If L1 L2 is regular then L1 and L2 is regular. (C) L1 L2 is regul
School: University Of Illinois, Urbana Champaign
Course: Theory Of Computation
Quiz 7 1. Let R be a regular expression with n operators. Let NR be the NFA constructed by the inductive algorithm described in lecture 7, such that L(R) = L(NR ), and let m be the number of states in NR . Pick the best upper bound for m from the choices
School: University Of Illinois, Urbana Champaign
Course: Theory Of Computation
Quiz 3 1. Consider the sequence dened inductively as follows: a0 = 0, and an = a n/2 + a n/2 . We claim that an = n for all n. We prove this by induction. For the base case observe that a0 = 0 by denition. Assume that for all n < k, we have an = n. Now ak
School: University Of Illinois, Urbana Champaign
Course: Theory Of Computation
Quiz 6 1. Let L cfw_0, 1 . Which of the following statements is necessarily true about L ? (A) L is an innite set. (B) L is a nite set. (C) L is non-empty. (D) None of the above. Correct answer is (C). (A) Counterexample: L = . (B) Counterexample: L = cfw
School: University Of Illinois, Urbana Champaign
Course: Theory Of Computation
Quiz 4 0, 1 q0 0, 1 1 q1 0 q2 0 q3 Figure 1: NFA N for problem 1 1. Consider the NFA N shown in Figure ?. Which of the following strings is not accepted by N ? (A) 001 (B) 001100 (C) 10011001 (D) 1001 The correct answer is (A). Observe that any string acc
School: University Of Illinois, Urbana Champaign
Course: Theory Of Computation
Quiz 5 1. Which of the following statements is true? (A) There are languages that can be recognized by an NFA which cannot be recognized by a DFA. (B) Languages recognized by NFAs cannot be recognized by DFAs because they can have innitely many active thr
School: University Of Illinois, Urbana Champaign
Course: Theory Of Computation
Quiz 2 1. Let L = cfw_010, 101, 001, 011, and K = cfw_w | 0w L. Which of the following strings is a member of K? (A) 0101 (B) 01 (C) 011 (D) 0110 The correct answer is (B). K is the set of strings formed by removing the leading 0 from a string in L. Thus,
School: University Of Illinois, Urbana Champaign
Course: Theory Of Computation
Midterm 1 CS 373: Theory of Computation Date: Thursday, October 3, 2013. Instructions: This is a closed book exam. No notes, cheat sheets, textbook, or printed material allowed. You have 90 minutes to solve this exam. This exam has 4 problems. Problems
School: University Of Illinois, Urbana Champaign
Course: Theory Of Computation
Quiz 1 1. Let A = cfw_1, 2, 3 and B = cfw_, cfw_1, cfw_2, cfw_3, cfw_1, 2, 3. Which of the following statements is true? (A) A B (B) A B (C) A B = (D) A B = B Correct answer is (B). (A): A B since 1 B. (B): Obvious. (C): Their intersection is empty since
School: University Of Illinois, Urbana Champaign
Course: Theory Of Computation
Quiz 10 1. In the notes for lecture 10 posted on the website, it is shown that the language L0n1n = cfw_0n 1n | n 0 is not regular. Consider the homomorphism h : cfw_a cfw_0, 1 dened as: h(a) = 01. What can we conclude on the basis of the languages L0n1n
School: University Of Illinois, Urbana Champaign
Course: Theory Of Computation
Quiz 11 1. Let be an equivalence relation and let E be an equivalence class of . Which of the following is the strongest statement that is necessarily true about E? (A) There are a, b E such that a b. (B) For every a, b E, a b. (C) There are a, b E and c
School: University Of Illinois, Urbana Champaign
Course: Theory Of Computation
Quiz 12 1. Consider the grammar G = (V = cfw_S, A, C, X, Y , = cfw_a, b, c, R, S) where the set of rules R is as follows: S AX|Y C A aA| C cC| X bXc| Y aY b| Which of the following strings can be derived in one step from aaAbXc? (A) aaaAbbXcc (B) aaAbbXcc
School: University Of Illinois, Urbana Champaign
Course: Theory Of Computation
Quiz 9 1. Recall that regular languages are closed under homomorphisms, i.e., if L is regular and h is a homomorphism then h(L) is regular. Based on this observation, which of the following statements must be necessarily true? (A) If h(L) is regular then
School: University Of Illinois, Urbana Champaign
Course: Algorithms
1. Recurrences: 12 points Give a tight asymptotic bound for the following recurrences. No justication necessary. A(n) = 2A( n) + 1 for n > 9 and A(n) = 1 for 1 n 9. (log n) Recursion tree is a binary tree with depth log log n and work is 1 at each node s
School: University Of Illinois, Urbana Champaign
Course: Text Information Systems
University of Illinois at Urbana-Champaign Midterm Examination CS410 Text Information Systems Professor ChengXiang Zhai TA: Maryam Karimzadehgan Time: 2:003:15pm, Mar. 14, 2008 Place: Room 1105, Siebel Center Name: NetID: 1. [10 points] Evaluation (a) [5/
School: University Of Illinois, Urbana Champaign
Course: System Programming
CS241MidtermPracticeExamAnswers Pleaseaddbothanswersandexplanationsifpossible. Ifyouseewronganswers,pleasecorrectthem. Also,ifyouthinkadifferentstructurewouldworkbetterforthisdocument,feel freetochangeit. PSA:Ifyouansweraquestionsomeonehas,tryanddoitindi
School: University Of Illinois, Urbana Champaign
Course: System Programming
Static variable been allocated staticallywhose lifetime or "extent" extends across the entire run of the program. CS 241 Fall 2013 Midterm Exam Study Guide PLEASE USE DIFFERENT COLOR WHEN CONTRIBUTING :) Make sure to read MPs, they may ask to code. Sample
School: University Of Illinois, Urbana Champaign
Course: System Programming
CS 241 Final Exam Study Guide (Updated 11:23 am May 10, 2014) The final examination will be held in from 8:00am to 11:00am on Friday, May 16. Based on your last name, the room your will take the final exam in is: A - Le: 1404 SC Li - Z: 151 Loomis You may
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS 433 Midterm Exam May 4, 2012 Professor Sarita Adve Time: 3 Hours Please print your name and NetID and circle the appropriate category in the space provided below. Name NetID Undergraduate Graduate Category Instructions 1. You may only use class handout
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433 Midterm Prof Josep Torrellas October 17, 2013 Time: 1 hour + 15 minutes Name: Instructions: 1. This is a closed-book, closed-notes examination. 2. The Exam has 4 Questions. Please budget your time. 3. Calculators are allowed. 4. Please write your an
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433 Midterm Prof Josep Torrellas October 16, 2008 Time: 1 hour + 15 minutes Name: Alias: NetID: Instructions: 1. This is a closed-book, closed-notes examination. 2. The exam has 4 questions. Please budget your time. 3. Calculators are allowed. 4. Please
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS 433 Final Exam May 11, 2006 Professor Sarita Adve Time: 7:00-10:00pm, 3 hours Please clearly print your full name, NetID and circle the appropriate category in the space provided below. Failure to completely fill out this table will result in a ZERO gr
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS 433 Midterm Exam March 7, 2006 Professor Sarita Adve Time: 2 Hours Please clearly print your name and NetID and circle the appropriate category in the space provided below. Name NetID 3 Credit Hours 4 Credit Hours Category UG Grad (On-Campus) Grad (I2C
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS 433G Midterm Exam October 18, 2005 Professor Sarita Adve Time: 2 Hours Please clearly print your name and NetID and circle the appropriate category in the space provided below. Name Solutions NetID 3 Credit Hours 4 Credit Hours Category Instructions 1.
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS 433g Final Exam December 12, 2005 Professor Sarita Adve Time: 7:00-10:00pm, 3 hours Please clearly print your full name, NetID and circle the appropriate category in the space provided below. Failure to completely fill out this table will result in a Z
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
CS421 Summer 2013 Sample Midterm 2 The actual midterm will likely have no more than 6 questions. In addition to the kinds of questions asked below, you should expect to see questions similar to those on the MPs and HWs on the exam. Proof rules for operati
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
Sample Questions for Midterm 1 (CS 421 Summer 2013) On the actual midterm, you will have plenty of space to put your answers. The actual midterm will likely have no more than 8 questions. In addition to questions of the kind asked below, you should expect
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
CS421 Summer 2014 Midterm #2 Monday, July 21, 2014 Name: NetID: You have 75 minutes to complete this exam. This is a closed-book exam. You are allowed one page of notes (10pt font minimum, both sides may be used). All other materials and devices (e.g.,
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
CS421 Summer 2014 Midterm 1 Tuesday, July 1, 2014 Name: NetID: You have 75 minutes to complete this exam. This is a closed-book exam. You are allowed one page of notes (10pt font minimum, both sides may be used). All other materials and devices (e.g., c
School: University Of Illinois, Urbana Champaign
Course: Progrmg Languages & Compilers
CS421 Summer 2013 Sample Final The actual midterm will likely have no more than 8 questions. In addition to the kinds of questions asked below, you should expect to see questions similar to those on the MPs and HWs on the exam. Proof rules for type system
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
CS 173: Discrete Structures, Spring 2011 Quiz 3 Solutions 1. (8 points) Answer the questions about the graph on the left. (No need to justify.) What is its chromatic number? Solution: 3 j a What is its diameter? Solution: 4 c b h g Is it acyclic? Solution
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
CS 173: Discrete Structures, Fall 2010 Quiz 3 Solutions 1. (3 points) Check the appropriate box for each statement: There is a set A such that for every B Z, A B. Correct Incorrect Let A be the empty set. For any function f : Z Z, Correct Incorrect if f i
School: University Of Illinois, Urbana Champaign
Course: Discrete Structures
CS 173: Discrete Structures, Spring 2011 Quiz 4 Solutions 1. (10 points) Check the box that best characterizes each item. Maximum number of leaves in a binary tree of height k 2k : 2k 1: 2k + 1: 2k+1 1: integer: If f : Z P(Z), an individual output f (x) i
School: University Of Illinois, Urbana Champaign
Course: Numerical Methods
CS357 Summer 2014 Midterm Exam Thursday, July 10th READ and complete the following: Bubble your Scantron only with a No. 2 pencil. On your Scantron (shown in the gure below), bubble : 1. Your Name 2. Your NetID 3. Form letter A No electronic devices or
School: University Of Illinois, Urbana Champaign
Course: Numerical Methods
CS357 Summer 2013 Midterm Exam Wednesday, July 3rd READ and complete the following: Bubble your Scantron only with a No. 2 pencil. On your Scantron (shown in the gure below), bubble : 1. Your Name 2. Your NetID 3. Form letter A No electronic devices or
School: University Of Illinois, Urbana Champaign
Course: Numerical Methods
CS357 Spring 2012 Exam #2 A Thursday, April 12th READ and complete the following: Bubble your Scantron only with a No. 2 pencil. On your Scantron (shown in the gure below), bubble : 1. Your Name 2. Your NetID 3. Form letter A No electronic devices or b
School: University Of Illinois, Urbana Champaign
Course: Numerical Methods
CS357 Exam #2 A Spring 2011 Thursday, April 7th, 2011 This is a 60 minute exam. No electronic devices or books allowed. Choose just one answer. Choose the best answer. You may take with you a cheat sheet - a single sheet of size 8.5 x 11 or smaller. 1. Wh
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: 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
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: 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
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: 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: 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: 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 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: 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: 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: 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 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: 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: 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: 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
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
CS 573 Homework 0 (due September 1, 2010) Fall 2010 CS 573: Graduate Algorithms, Fall 2010 Homework 0 Due Wednesday, September 1, 2010 in class This homework tests your familiarity with prerequisite material (http:/www.cs.uiuc.edu/class/ fa10/cs573/stuff
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Fundamental Algorithms, Spring 2011 HW 3 Homework is due by Monday, 23:59:59, February 14 Problem 1 is due by Sunday, 23:59:59, February 13 This homework contains four problems. Read the instructions for submitting homework on the course webpage.
School: University Of Illinois, Urbana Champaign
Course: Computer System Organization
CS433: Computer Systems Organization Fall 2009 Homework 5 Assigned: Nov/8 Due in class Dec/1 Total points: 32 for undergraduate students, 40 for graduate students. Instructions: Please write your name, NetID and an alias on your homework submissions for p
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473: Algorithms, Fall 2008 HW 8 (Solution) 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 sheets of paper; th
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
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: Cs473
CS 473: Fundamental Algorithms, Spring 2012 Homework 3 (due Tuesday, 23:55:00, February 14, 2012) Collaboration Policy & submission guidelines: See homework 1. Each student individually have to also do quiz 3 online. Version: 1.0 1. (30 pts.) Saving the w
School: University Of Illinois, Urbana Champaign
Course: Fundamental Algorithm
CS 473 Homework 9 Solutions Spring 2010 1. Let k be an arbitrary xed integer. 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 bloc
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
ASSIGNMENT 1 SOLUTION QUESTION 1. (5 PTS) This question is intended to give an opportunity to all students to know the recent issue in the data mining community. 1. BIG DATA DEFINITION (2 PTS) Big Data has bee
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
WEEKLY 12 SOLUTIONS Q1. How many records are returned from the following query? SELECT * FROM Tests, Projects WHERE Tests.ID = Projects.ID 1. 6 2. 5 3. 4 4. 2 The SQL statement joins the tables Tests and Projects on the common column ID. Since there are 4
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Tables for question 1 through 4 are included at the end of the document. Question 1 Which query returns the first names of the students who got midterm points greater (>) than 90? Answer SELECT MidTermPoints FROM Students,TestScores WHERE MidTermPoints >
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Question 1: Multiple Answer Average Score 1.408 points What is the purpose of SPF (with regard to emails)? Correct Answers Percent Correct Provide long-lasting, broad-spectrum UVA & UVB protection. 97.832% Verify origin of email (from expected origin ser
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Question 1: Multiple Choice Assuming that intGrade is the same integer value prior to running both code segments, which of the following is true? Correct Percent Answered Code segments A and B produce the same message boxes for all values of intGrade Cod
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Question Answer Which of the following declares an array of 10 strings? Dim strArray(9) As String Dim strArray(10) As String Dim strArray As String(9) Dim strArray As String(10) Comment [G1]: The only one correct Comment [G2]: From 0 to 10 are 11 strings
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Q1) What is true about the two code snippets given below? Sub test() Sub test() Dim intA As Integer Dim intA As Integer Dim intLimit As Integer Dim intLimit As Integer intLimit = 1000 intLimit = 1000 For intA = 1 To intLimit For intA = 0 To intLimit step
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Weekly 9 Solutions 1. Given the sub-procedure shown below, what will be shown in the message-box if the sub-procedure is called in the following manner: AlertUser(4) There are none left! There is only 1 left! There are only 4 left! We have plenty left - W
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Weekly 5 Answers Question 1: Consider the following VBA code. If we execute proc1 and then proc2, what will get printed in the immediate window? 1. The immediate window will print 10 2. The immediate window will print 0 3. The immediate window will print
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Question 1: Multiple Choice After running the block of code below, what will be shown in the immediate window? Correct Percent Answered Average dinner 84.817% Cheap dinner 8.028% Fancy dinner 1.047% (Nothing will be printed) 5.934% Unanswered Commented [
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Weekly 4 Answers Question 1: Which Excel feature/function would you use to summarize data? 1. Vlookup 2. PivotTables 3. Evaluate Formula 4. randBetween Answer 1: The correct choice is option 2. Pivot tables are used to summarize data in Excel. Question 2:
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Question 1: Multiple Choice Average Score 1.34134 points What formula below correctly calculate monthly payments for this loan? (As shown in the figure, the rate is annual percentage rate and the period is in years.) Correct Percent Answered =PMT(B1,B2,B
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Question 1: Multiple Choice Use the attached screenshot for this question. If the following formula is typed into cell A4 then COPY and PASTED to cell C5, what is the value displayed in cell C5? =A1+B2*C1 Correct Percent Answered 0 2.385% 9 72.178% 15 2.
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Non-tech
Question 1: Multiple Choice Average Score 1.71602 points Columns H and I contain the minimum average exam grade required to earn the respective letter grade. Which formula can be typed in the cell F2, then filled down to F6, can calculate the average exam
School: University Of Illinois, Urbana Champaign
Computer Vision Assignment 4: Geometric Vision Shangquan Wu (swu55) Part 1: Fundamental Matrix Estimation and Triangulation In this part, we will see how we can recover the 3D shape of an object given its image
School: University Of Illinois, Urbana Champaign
Assignment 3: Image stitching - Report Shangquan Wu swu55 The goal of this assignment is to use feature-based homography estimation to stitch together panoramas consisting of multiple images. 1. Feature Detection: Harris corner detector Harris corner dete
School: University Of Illinois, Urbana Champaign
Spring 2014 CS543/ECE549 Assignment 2: Scale-space blob detection Due date: March 5, 11:59:59PM Note: for email questions about this assignment (especially from the online students), please contact Zhicheng Yan (zyan3 -atillinois.edu) The goal of the assi
School: University Of Illinois, Urbana Champaign
Spring 2014 CS543/ECE549 Assignment 1: Shape from Shading Due date: February 17, 11:59:59 PM Instructions The goal of this assignment is to implement shape from shading as described in Lecture 4 from January 30 (see also Section 2.2.4 of Forsyth & Ponce 2
School: University Of Illinois, Urbana Champaign
Course: Database Systems
Problem 2: Shangquan Wu (swu55) Part A: T2 T3 T1 Part B: It is not conflict-serializable. Due to there is a loop in the precedence Graph. Time
School: University Of Illinois, Urbana Champaign
Course: Database Systems
Problem1 Shangquan Wu (swu55) Part A: Node 13 Dis. 1 2 4 8 16 32 64 128 256 Node 46 46 46 46 46 42 92 156 280 Node 344 Dis. 1 2 4 8 16 32 64 128 256 Node 384 384 384 38
School: University Of Illinois, Urbana Champaign
Course: Database Systems
swu55_problem 4: 1. UID1,PID,content(post(PID, UID1, content, setting)Post) UID1,PID,content (post(PID, UID2, content, setting)(Post) Friends) UID1,PID,content (UID1!=UID3 and setting=Friends of friends (FriendsFriends(UID2, UID3) (Friends
School: University Of Illinois, Urbana Champaign
Course: Database Systems
swu55_problem 2: 1. Assumption: a. If a pharmaceutical company is deleted, the products of the company are also deleted. b. The price could vary from one pharmacy to another, so the relationship sells include attribute
School: University Of Illinois, Urbana Champaign
Course: Database Systems
swu55_problem 3: a) cfw_A+ = cfw_A, B, C, D, E, cfw_E+ = cfw_A, B, C, D, E, cfw_B, C+ = cfw_A, B, C, D, E, cfw_C, D+ = cfw_A, B, C, D, E So the keys of R are cfw_A, cfw_E, cfw_B, C, cfw_C, D b) 1. cfw
School: University Of Illinois, Urbana Champaign
Course: Database Systems
swu55_problem4: Assumption: Since the North, South, East and West are Boolean variables, so I assume 0 means there is no wall and 1 means there is a wall. S1 means the first step and the path start from a (0,0
School: University Of Illinois, Urbana Champaign
Course: Database Systems
swu55_problem3: a)SName(SID=StaffID(StaffType=SafeRide(AssignBus) b)BusNumber(From=IlliniUnionandTo=MarketPlaceandDistance=Range(BusRoutes) c)SID(StaffMAX(Salary)(Staff(StaffMAX(Salary)(Staff) d)R3.To(R1.From=IlliniUnionandR2.From=R1.ToandR3.From=R2.Toand
School: University Of Illinois, Urbana Champaign
Course: Database Systems
swu55_problem2: Part 1: a) S1.UIN(S1.Semester != S2.Semester and S1.UIN = S2.UIN and S1.CourseID = S2.CourseID(S1 (Registers) S1(Registers) b) StudentName(Grade != F (StudentRegister) Part 2: a) A2.PersonName(P2.ChildSSN=A1.SSN and P1.ParentSSN=A2.SSN (A2
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 9 Solutions Fall 2013 1. Youre organizing the First Annual UIUC Computer Science 72-Hour Dance Exchange, to be held all day Friday, Saturday, and Sunday. Several 30-minute sets of music will be played during the event, and a large number o
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 10 Solutions Fall 2013 Rubric (for all NP-hardness proofs): For a problem worth 10 points: 3 points for a correct reduction. Remember that a reduction is an algorithm; it must be described clearly and precisely (but not necessarily using
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 10 (due December 10, 2013) Fall 2013 1. For any integer k, the problem k-COLOR asks whether the vertices of a given graph G can be colored using at most k colors so that neighboring vertices does not have the same color. (a) Prove that k-C
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 9 (due November 19, 2013) Fall 2013 1. Youre organizing the First Annual UIUC Computer Science 72-Hour Dance Exchange, to be held all day Friday, Saturday, and Sunday. Several 30-minute sets of music will be played during the event, and a
School: University Of Illinois, Urbana Champaign
Course: Algorithms
CS 473 Homework 8 Solutions Fall 2013 1. Let G be a directed graph with (possibly negative!) edge weights, and let s be an arbitrary vertex of G . Suppose every vertex v = s stores a pointer pred(v) to another vertex in G . Describe and analyze an algorit
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
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 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 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: 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
CS 101 Lab 5 Answer Sheet This lab is to be worked individually. Name: _Siyuan Li_ Netid: _sli62_ Section: _AYI_ Part 1: A simple C program 1. Write the command(s) to navigate to your home directory from the root directory: _cd/home_ 2. Write the error me
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
Lab 6 Answer Sheet Name: _Siyuan Li_ Netid: _sli62_ Section: _AYI_ Simple C programs Part A. 1. The following program compiles and runs without errors. Write the ouput the following code produces. #include <stdio.h> num; void main(void) num = 9; (num%2)
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Part 1: Scope of variables Answer Questions #1 - #6 (below)on the answer sheet. Write the output when the following program executes. #include <stdio.h> int cool(int x) cfw_ x = 4*x; return x; void main(void) cfw_ int x = 3; x = cool(x); printf("%i \n",
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:_Xiangying Zhang_Netid:_xzhan104_Section:AYI_ Name:_Netid:_Section:_ Name:_Netid:_Section:_ Part 1: Using QuickSort 1. Fill in the blanks to call the qsort function to sort the array named nums
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 6 Answer Sheet Name: _Xiangying Zhang_ Netid: _xzhan104_ Section: _AYI Name: _ Netid: _ Section: _ Name: _ Netid: _ Section: _ Simple C programs Part A. 1. The following program compiles and runs without errors. Write the output the following code pro
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: Intro Computing Engrg & Sci
LabActivity5AnswerSheet Name:_NetID:_Section#:_ Part1:GlobalvariablesinMatlab 1. WritethevaluethatMatlabreturnswhenyoutypethefollowingatthecommandprompt: >x x= _5_ >y y= _1_ >result result= _Undefinedfunctionorvariable'result'_ 2. WritethevaluethatMatlabr
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
Lab 7 Answer Sheet Name: _Xiangying Zhang_ Netid: _xzhan104_ 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 t
School: University Of Illinois, Urbana Champaign
Course: Intro Computing Engrg & Sci
What does the Matlab function fplot do? How to use fzero to find find a root of an equation? What is a global variable? How the meshgrid, view and surf functions are used to create 3-D plots. Readings: Matlab by Pratap Chapter 4.2.2,4.3.3,5.6, 6.1,6.3 52
School: University Of Illinois, Urbana Champaign
School: University Of Illinois, Urbana Champaign
School: University Of Illinois, Urbana Champaign
School: University Of Illinois, Urbana Champaign
School: University Of Illinois, Urbana Champaign
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file htiterator.cpp * Implementation of an iterator class over HashTables. * * @author Chase Geigle * @date Summer 2012 */ using std:pair; template <class K, class V> HashTable<K,V>:iterator:iterator() : impl( NULL ) cfw_ /* nothing */ templ
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file hashtable.h * Definition of an abstract HashTable interface. * * @author Chase Geigle * @date Spring 2011 * @date Summer 2012 */ #ifndef _HASHTABLE_H_ #define _HASHTABLE_H_ #include <vector> #include <cstddef> #include <algorithm> #inclu
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file hashes.h * Definition of a namespace containing a templatized hash function. * * @author Chase Geigle * @date Summer 2012 */ #ifndef _HASH_H_ #define _HASH_H_ #include <string> /* * hashes namespace: a collection of templated hash functi
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file char_counter.h * Definition of the CharFreq class. * * @author Chase Geigle * @date Spring 2011 * @date Summer 2012 */ #ifndef _LETTER_COUNTER_H_ #define _LETTER_COUNTER_H_ #include "schashtable.h" #include "lphashtable.h" #include "text
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file charcount.cpp * CharFreq tester program. * * @author Chase Geigle * @date Spring 2011 * @date Summer 2012 */ #include "char_counter.h" #include <iostream> #include <sstream> #include <algorithm> using std:istringstream; using std:cout; u
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file anagram_finder.h * Definition of an AnagramFinder class for finding anagrams in a set of * strings or within a file. * * @author Chase Geigle * @date Spring 2011 * @date Summer 2012 */ #ifndef _ANAGRAM_FINDER_H_ #define _ANAGRAM_FINDER_
School: University Of Illinois, Urbana Champaign
Course: Data Structures
/* * @file anagramtest.cpp * Test for the anagram finder. * * @author Chase Geigle * @date Spring 2011 * @date Summer 2012 */ #include "anagram_finder.h" #include <iostream> #include <algorithm> using std:cout; using std:endl; using std:vector; usi
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
#ifndef _TRON_H #define _TRON_H class function cfw_ public: virtual double fun(double *w) = 0 ; virtual void grad(double *w, double *g) = 0 ; virtual void Hv(double *s, double *Hs) = 0 ; virtual int get_nr_variable(void) = 0 ; virtual ~function(void)
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
#include <math.h> #include <stdio.h> #include <string.h> #include <stdarg.h> #include "tron.h" #ifndef min template <class T> static inline T min(T x,T y) cfw_ return (x<y)?x:y; #endif #ifndef max template <class T> static inline T max(T x,T y) cfw_ retu
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
ELF#>#@#@#`#@#8#@# #@#@#@#@#@#@ #@#@#@# # #`#`# #@#@`#@`# #@#@#D#D#Ptd#@#@#l# #l#Qtd#/lib 64/ld-linux-x86-64.so.2#GNU#GNU# %F#14[THV63#1#"!#a1#8#=#a#6 #c$#2#D|f#A#6cm| #p#"4#"(#h#yIk# # # #
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
#include <stdio.h> #include <math.h> #include <stdlib.h> #include <string.h> #include <ctype.h> #include <errno.h> #include "linear.h" #define Malloc(type,n) (type *)malloc(n)*sizeof(type) #define INF HUGE_VAL void print_null(const char *s) cfw_ void exit
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
LIBLINEAR is a simple package for solving large-scale regularized linear classification and regression. It currently supports - L2-regularized logistic regression/L2-loss support vector classification/L1-loss support vector classification - L1-regulariz
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
#include <stdio.h> #include <ctype.h> #include <stdlib.h> #include <string.h> #include <errno.h> #include "linear.h" int print_null(const char *s,.) cfw_return 0; static int (*info)(const char *fmt,.) = &printf; struct feature_node *x; int max_nr_attr = 6
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
#You must ensure nmake.exe, cl.exe, link.exe are in system path. #VCVARS32.bat #Under dosbox prompt #nmake -f Makefile.win # CXX = cl.exe CFLAGS = -nologo -O2 -EHsc -I. -D _WIN32_ -D _CRT_SECURE_NO_DEPRECATE TARGET = windows all: $(TARGET)\train.exe $(TAR
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
CXX ?= g+ CC ?= gcc CFLAGS = -Wall -Wconversion -O3 -fPIC LIBS = blas/blas.a SHVER = 1 OS = $(shell uname) #LIBS = -lblas all: train predict lib: linear.o tron.o blas/blas.a if [ "$(OS)" = "Darwin" ]; then \ SHARED_LIB_FLAG="-dynamiclib -Wl,-install_nam
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
#include <math.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #include <stdarg.h> #include <locale.h> #include "linear.h" #include "tron.h" typedef signed char schar; template <class T> static inline void swap(T& x, T& y) cfw_ T t=x; x=y; y
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
#ifndef _LIBLINEAR_H #define _LIBLINEAR_H #ifdef _cplusplus extern "C" cfw_ #endif struct feature_node cfw_ int index; double value; ; struct problem cfw_ int l, n; double *y; struct feature_node *x; double bias; /* < 0 if no bias term */ ; enum cf
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
solver_type L2R_L2LOSS_SVC_DUAL nr_class 2 label 1 -1 nr_feature 13 bias -1 w 0.09435047425578699 0.2285415647938309 0.4265839247826416 0.2697220013945627 -0.00367541581502729 -0.1619822757462981 0.1234298617257452 -0.269227089689369 0.13107955004
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
LIBRARY liblinear EXPORTS train @1 cross_validation @2 save_model @3 load_model @4 get_nr_feature @5 get_nr_class @6 get_labels @7 predict_values @8 predict @9 predict_probability @10 free_and_destroy_model @11 free_model_content @12 destroy_
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
from liblinearutil import * from liblinear import * from data import * import numpy as np import sys import copy import math import random class DecisionTree: ' class of desicion tree' #construct func def _init_(self, forestTree = None): self.leftNode
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
#!/usr/bin/env python import os, sys sys.path = [os.path.dirname(os.path.abspath(_file_)] + sys.path from liblinear import * def svm_read_problem(data_file_name): " svm_read_problem(data_file_name) -> [y, x] Read LIBSVM-format data from data_file_name
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
from liblinearutil import * from liblinear import * from data import * import sys import copy import math class DecisionTree: ' class of desicion tree' #construct func def _init_(self, forestTree = None): self.leftNode = None; self.rightNode = None;
School: University Of Illinois, Urbana Champaign
Course: Introduction To Data Mining
from liblinearutil import * import sys import copy #print 'Number of arguments:', len(sys.argv), 'arguments.' #print 'Argument List:', str(sys.argv) # def parseData(data_file_name): # label_list = [] # data_instance = [] # label_list, data_instance = s
School: University Of Illinois, Urbana Champaign
Course: Data Structures
# run "source /software/intel-composer-2011u5-x86_64/bin/compilervars.sh intel64" to set up compiler variables LABNAME = lab_parallel OBJS = rgbapixel.o png.o image_tools.o COMPILER = icc -openmp #COMPILER = g+ -fopenmp COMPILER_OPTS = -c -g -O0 -Wall L
School: University Of Illinois, Urbana Champaign
Course: Data Structures
#ifndef ROOM_H #define ROOM_H #include <string> #include "letter.h" using namespace std; /* * Represents a testing room, which has a group of letters allocated to it * (where letters are first letters of last names) */ class Room cfw_ public: string
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: 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