1. Binary TreesCS-2301, B-Term 20091 Programming Assignment #5 Binary Trees CS-2301, System Programming for Non-Majors (Slides include materials from The C Programming Language, 2 nd edition, by Kernighan and Ritchie and from C: How to Program, 5 th and 6 th editions, by Deitel and Deitel)

2. Binary TreesCS-2301, B-Term 20092 Assignment Read in a series of text files Keep track of the number of occurrences of each word In the set of files you read Print out a list of words (in alphabetical order) and the number of times each occurs Due Date:– Friday, December 4, 2009, 11:59 PM

3. Binary TreesCS-2301, B-Term 20093 Goals and Objectives Pull together a non-trivial program from resources and algorithms at your disposal Build up and use a massive data structure in the form of a binary tree One entry for each separate word encountered Each entry counts the number of instances of that word Create and write your output file

4. Binary TreesCS-2301, B-Term 20094 By the End of this Assignment… … you should start feeling confident that –You can write a non-trivial C program for any course assignment at WPI –You are capable of learning the things you don’t know on your own –You are beginning to think “computationally” with respect to collecting and organizing data

5. Binary TreesCS-2301, B-Term 20095 What is a Binary Tree? Previous lecture topic See also §6.5 of Kernighan & Ritchie

6. Binary TreesCS-2301, B-Term 20096 Your Program Multiple files as in previous programming assignments Of your own organization makefile to build it or Visual Studio Algorithms from K & R or any other resources Cite your resources! Even Wikipedia!Even your friends!

7. Binary TreesCS-2301, B-Term 20097 Command Line of Your Program./PA5 outputFile inputFile1 inputFile2...

8. Binary TreesCS-2301, B-Term 20098 Sample Output (written to outputFile ) 166a 25and 11as 3command 15each 2file 4files 109in 4input 98it 99of 3open 6program 18read 152the 41this 3under 30would ------------- 17Total number of different words

9. Binary TreesCS-2301, B-Term 20099 makefile or Visual Studio For building your program Note:– we don’t know what the file names of your program components are Only you (and your makefile ) know what needs to be built and how If you are feeling adventurous Build and debug in Visual Studio instead Use Visual Studio project files Clean your project before submitting Zip your files together for submission You will need to learn how to provide command line arguments to your program! Five points extra credit. To be introduced in Lab #6 on December 2.

10. Binary TreesCS-2301, B-Term 200910 Write-up Description of your program, the.c files,.h files, etc. Pre- and post-conditions of all recursive functions Loop invariants of critical loops Description of your data structure and the principal functions Citation of resources and algorithms

11. Binary TreesCS-2301, B-Term 200911 Submitting Your Project Use /cs/bin/turnin submit cs2301 PA5... Submit:– Write-up.c files,.h files, and makefile or Clean, zipped version of Visual Studio project directory Sample output

12. Binary TreesCS-2301, B-Term 200912 Questions?