CS 241: Data Organization using C Computer Science Department University of New Mexico Fall 2008

Instructor:
Joel Castellanos
Department of Computer Science
e-mail: joel@unm.edu
phone: 505-277-7146

Office: Farris Engineering Center (FEC) 321
     Building #119 in section I-2 of the campus map.

Office hours (Spring 2009):
     Mon & Wed: 10:30-11:30 AM
     Tues & Thurs: 8:00-9:00 AM and by appointment

Syllabus

Course Description

Notes:

1. Hello World
2. HelloWorld++: small programs that help with project 1.
• echoArguments.c
• stringNamer.c
• strToInt.c
• binaryStrToInt.c
3. GVIM and Remote Linux Work Environment
4. e-mail and i-clicker
5. Postfix
6. Code Standard
7. Numerical Accuracy
8. Bits
9. Functions, Arguments, and Scope
10. C Standard Libraries
11. Input/Output
12. Linked Lists
13. Structures
14. Swap, Case Insensitive Search
15. Midterm Exam
16. How to Solve It
17. Maze Program and Recursion
18. Genetic Programming and the Traveling Salesperson

Programming Projects:

1. Project 1:Postfix Calculator




2. Project 1.5:Postfix Calculator
• postfixCalculator.c
3. Project 2:Cipher
• Project 2 Spoiler ***Spoiler Warning*** This link opens a document that provides detailed milestones, data structures, and algorithms for project 2. Do not open unless you are stuck and need a hint.
• cipherTest.txt This file contains all of the text cases for project 2. The script expects that you have named your executable "cipher" and that the file is in the same directory in which the script is running. After you have downloaded the script on a Linux machine, you need to make it an executable file: chmod u+x cipherTest.txt. I have tested it on shuttle.cs.unm.edu and uses the extended ASCII character set ISO-8859-1. This is the platform your turn-in will be graded on.
• cipherResults.txt This file contains the required output from cipherTest.txt. You can test your results by running the test file and redirecting the output to a file then run the diff program in your output file and the expected output
  cipherTest.txt > myOutput
  diff myOutput cipherResults.txt
• cipherExtraTest.txt This file contains all of the basic tests and also the extra credit tests for project 2.
• cipherExtraResults.txt This file contains the required output from cipherExtraTest.txt
• cipher.c Instructor's version





4. Project 3: Doubly Linked List
• LinkedList0.txt and the required output: LinkedList0.out
• LinkedList1.txt and the required output: LinkedList1.out
• LinkedList2.txt and the required output: LinkedList2.out : 7 quotes with removes
• LinkedList3.txt and the required output: LinkedList3.out : 19 quotes
• LinkedList4.txt and the required output: LinkedList4.out : 19 quotes with removes
• LinkedList5.txt and the required output: LinkedList5.out : 146 mostly sorted quotes with removes having a total of 16343 characters in data.
• LinkedList6.txt and the required output: LinkedList6.out : long qoutes
• LinkedListErrorScript.txt and the required output: LinkedListError.out : This is a script that creates files with errors and runs ./linkedList on each.
• LinkedList-ExtraCredit.txt and the required output: LinkedList-ExtraCredit.out . Note: It is not required to match the first 4 lines of this file's output. I included them to help you debug and follow what should be going on.
• linkedList.c Instructor's version (167 lines of code + 99 lines of comments).





5. Project 4: Linked List with Memory Reuse
• quoteDB-0.txt and the required output: quoteDB-0.out This is not a graded text. It is the test given in the specs.
• quoteDB_ErrorScript.txt and the required output: quoteDB_ErrorScript.out This test is a script that creates small input files and appends output to the file error.out.
• quoteDB-1.txt and the required output: quoteDB-1.out This test includes only author:quote, :print:quotelist, and :print:data:idx commands. Passing this test demonstrates that you successfully converted project 3 to use structures and made slight changes to the output format.
• quoteDB-2.txt and the required output: quoteDB-2.out This test includes author:quote, :print:quotelist, :print:data:idx, :query:author:author substring, and :query:quote:quotation substring commands.
• quoteDB-3.txt and the required output: quoteDB-3.out This test is similar to quoteDB-2.txt.
• quoteDB-Hamlet.txt and the required output: quoteDB-Hamlet.out This test includes the full text of Shakespeare’s play “The Tragedy of Hamlet, Prince of Denmark”. It includes the commands: :print:quotelist, and :query:quote:quotation substring.
• quoteDB-4.txt and the required output: quoteDB-4.out This test includes 3 :remove:idx commands, but is constructed such that all records added after the removes are too big to fit into any of the holes left by deleted records. Additionally, none of the removes are adjacent to existing heap blocks, thus no heap block merges occur. This test demonstrates that freed heap.data[] space is correctly represented and sorted in the heap structure. It also verifies that the list.rec[] reuses freed links.
• quoteDB-5.txt and the required output: quoteDB-5.out This test similar to quoteDB-4.txt
• quoteDB-6.txt and the required output: quoteDB-6.out This test includes the full set of commands. Some added records will fit into the holes left by previously deleted records; however, none of the deletes will create free heap blocks that can be merged with other blocks.
• quoteDB-7.txt and the required output: quoteDB-7.out This test similar to quoteDB-6.txt
• quoteDB-8.txt and the required output: quoteDB-8.out This test includes the full set of commands and exercise both freed memory reuse and freed block merging.
• quoteDB-9.txt and the required output: quoteDB-9.out This test similar to quoteDB-8.txt, but is a very large file.
• quoteDB.c: Instructor's Solution





6. Project 5: Maze Generator
• mazegen.h Header file defining functions that must be implemented.
• mazetest.c Test program that calls your implementation of the functions defined in mazegen.h.
• mazegen.c Instructor's Solution:





7. Project 6: Red-Black Tree
• redBlackTest1.txt, required output: redBlackTest1.out Worst case binary sort test file with only left rotations
• redBlackTest2.txt, required output: redBlackTest2.out Worst case binary sort test file with only right rotations
• redBlackTest3.txt, required output: redBlackTest3.out Random order test file with both left and right rotations





8. Final Exam: Genetic Salesperson **Updated May 10, 8:42PM** descoped the project grading and added some examples for representing a genome.

• gaussian.c Returns the next pseudorandom, Gaussian ("normally") distributed double value with mean 0.0 and standard deviation 1.0. This includes a test_main() which can be called to test the generator.
• gaussian.h Header file for gaussian.c
• geneticTest.h Header file defining structs that will need to be passed to checkGenome(), checkPopulation(), checkCrossover() and checkMutation()
• geneticTest.c Reads the Traveling Salesperson data file, builds the graph, and displays the graph. This is a good starting point.

  **Updated May 8, 11:28** added edgeCount to the node struct. Even though this can be found by counting the halfEdges to a NULL is reached, I found it useful to have at the ready when building random genomes.

  **Updated May 8, 11:48** moved struct definitions from here to geneticTest.h

  **Updated May 10, 5:16** Fixed bug that would list cities with a linefeed at the end as different from the same name city without the linefeed.

• TravelingSalesPerson_Test0.txt A small graph with 5 nodes, 6 edges, and single letter names. This is the data file used in CS-241-Final-GeneticTravelingSalesperson.pdf.
• TravelingSalesPerson_Test1.txt A round trip tour from Albuquerque visiting 20 cities. There are 48 edges: large enough to be complicated yet not too large to draw on paper. The edge weights given are actual US dollar amounts returned by http://www.travelocity.com on May 4th, 2009 for the cheapest direct flights for flexible departure dates with a two month lead (travel dates during the first week of July).