CS 223 - Spring 2017. 3/8

Welcome to CS 223!

Larry Wall Quote of the day

Yes, you can think of almost everything as a function, but this may upset your wife.

Logical problem of the day

#include <stdio.h>
#define BUFSIZE 2048 

int main(){
  int n = BUFSIZ;
  printf("n = %d\n", n);
What's up up there?

Lecture 15: HW5 + Data Structures: btrees


  • Office hours:
    The office hours are Sun/Tue/Thu 8-11 PM at Hillhouse 17 Rm 111.
  • My office hours this week are Wednesday 3-5pm.

  • Mid term exam
  • Many of you emailed me regarding hw3 grading issues. Subsequently, there has been related discussion on piazza. You should rely on those postings, which means that you should resubmit (by this Friday). If your issues are different, then contact cs223help@cs.yale.edu.
  • Assignment 4

  • There has been some discussion on piazza about the debug option showing the updated string values in the stack after the numeric value has changed, for example, @303 The TA's/ULA's have recommended that we modify the spec to do the right thing. They will post an update to piazza. The debug tests will be modified accordingly. BTW, my previous suggestion about implementing ftoa() has been superceded by the suggestion of using sprintf(). For those of you who have finished hw4, adding and testing this modification should not take more than 30 minutes or so.

    Assignment 5

    Problem set 5

  • Here is an example: Alice In Wonderland cloud
  • Here is an example: Alice In Wonderland cloud with threshold=10

    Lecture Starts Here

    Binary Trees