• 3 Pages hw9sol
    Hw9sol

    School: Washington University In St. Louis

    CS514 Fundamentals of Computer Science, Spring 2001 Solutions Homework Assignment 9 Problem 1 (40 points total) (a) (20 points) CLR, p. 333, Exercise 17.1-1. Solution: This finds the length of the optimal schedule over a set of jobs S; let S(k) rep

  • 1 Page hw3
    Hw3

    School: Washington University In St. Louis

    CSE 514A: Data Mining Fall Semester, 2006 Homework Assignment 3 Nov. 13, 2004 Due Date: Nov. 20 Follow the Collaboration Policy closely! If you forgot, check it out at the course webpage by following the link at www.cse.wustl.edu/zhang/teaching. Y

  • 1 Page readme
    Readme

    School: Washington University In St. Louis

    this is the readme.txt in http:/www.cs.wustl.edu/~zhang/teaching/cs514/fall06/projectdata.zip this package contains information of gene expression for a cold treatment on a model plant called Arabidopsis thaliana (Arabidopsis). the data were collect

  • 2 Pages hw1
    Hw1

    School: Washington University In St. Louis

    CSE 514 Datamining Fall 2008 Homework #1 (association rules and classification) Due on Nov. 3, before the class 1. (10 points) problem 5.1 (a)(b) in the textbook by Han and Kamber 2. (10 points) problem 5.3 in the textbook by Han and Kamber 3. (5

  • 2 Pages hw5sol
    Hw5sol

    School: Washington University In St. Louis

    CS514 Fundamentals of Computer Science, Fall 2001 Solutions Homework Assignment 5 CLRS, Chapter 2, pp. 37-38, Problem 2-1 (all parts), or CLR, Chapter 1, p. 17-18, Problem 1-2 (all parts). (30 points) Solutions: (a) Assume each input to insertion

  • 2 Pages hw6
    Hw6

    School: Washington University In St. Louis

    CS514 Fundamentals of Computer Science, Fall 2001 Homework Assignment 6 Assigned: November 14 Due: November 28 Administrivia: All homework assignments are due at the start of class on the due date. After that, they will not be accepted for credit. H

  • 2 Pages project
    Project

    School: Washington University In St. Louis

    CS 514A (Data Mining) Fall 2006, Project Description You should start soon. Never wait until the last few days. I expect this project requires several days of work. Due dates: November 13 (before class) and 12pm on December 13, 2006. Finding feature

  • 6 Pages hw5sol
    Hw5sol

    School: Washington University In St. Louis

    CS514 Fundamentals of Computer Science, Fall 2000 Solutions - Homework Assignment 5 Problem 1 (30 points total) (a) (15 points) Simulate the unsigned multiplication algorithm described in class on the numbers 45 and 20. Assume that you have eight bi

  • 4 Pages propcalc
    Propcalc

    School: Washington University In St. Louis

    CS514: Reductions and the Propositional Calculus September 11, 2000 In the last lecture, I described the propositional calculus in gory detail. In this handout, I want to baseline what I expect each of you to know about what I covered in the last lec

  • 2 Pages hw3
    Hw3

    School: Washington University In St. Louis

    CS514 Fundamentals of Computer Science, Fall 2000 Homework Assignment 3 Assigned: September 18 Due: September 25 Administrivia: All homework assignments are due at the start of class on the due date. After that, they will not be accepted for credit.

  • 14 Pages lecture
    Lecture

    School: Washington University In St. Louis

    Boolean Algebra and Logic Circuits Reading: Rosen 9.1 - 9.3, and 9.4 (Karnaugh map section only) Boolean Algebra The rules of Boolean algebra provide a bridge from logic to mathematics Boolean algebra is an isomorphism of formal logic - the two are

  • 17 Pages lecture
    Lecture

    School: Washington University In St. Louis

    Theoretical Algorithm Analysis TODAY: Sort Problems Case Study Helpful Reading: CLR 1.1 - 1.3, 2.1 Sorting Problems A very common problem is to sort an array of items Imagine Excel or Access without sorting! Many algorithms exist to sort In gen

  • 1 Page quiz2sol
    Quiz2sol

    School: Washington University In St. Louis

    CS514 Fundamentals of Computer Science, Fall 2001 Solutions Quiz 2 Problem 1 (30 points) In the DLX pipeline described in class, assuming that memory operations stall the pipeline until they are completed, explain briefly why WAW and WAR hazards do

  • 3 Pages hw2
    Hw2

    School: Washington University In St. Louis

    CS514 Fundamentals of Computer Science, Fall 2000 Homework Assignment 2 Assigned: September 11 Due: September 18 WARNING: START THIS HOMEWORK EARLY! Administrivia: All homework assignments are due at the start of class on the due date. After that, t

  • 2 Pages hw2
    Hw2

    School: Washington University In St. Louis

    CS 514A: Data Mining Spring Semester, 2005 Homework Assignment 2 Feb. 28, 2005 Due Date: March 16 Follow the Collaboration Policy closely! If you forgot, check it out at the course webpage by following the link at www.cse.wustl.edu/zhang/teaching.

Back to course listings