# CS297-298 Project News Feed

## Oct 7

Develop the partial order algorithm to work for 100 best movies website and connect to database.

## Sep 23

Develop the webpages further and connect to database.

## Sep 16

Download Tomcat and MySQL and get them to work. Design a few webpages.

## Sep 9

Upload CS 298 Proposal. Make the blog up to date. Design the rough flow of web pages for 100 best movies website.

## Sep 2

Completed the CS 298 proposal. Finished paperwork for CS 298.

## Aug 26

Started working on CS 298 proposal.

## May 5

Upload Deliverable-3 and Deliverable-4. Work on CS297 report.

## Apr 28

Work on Deliverable-3. Analyze the algorithm. Write up the experiments performed so far.

## Apr 21

Include Javadoc requirements into the automated total order generation code. Upload deliverable 2. Look into fault tolerance for fixed values of k and m. Get results for the case where m = 2 and analyze the case.

## Apr 14

Automate the code for n, k, m values but with a condition k = n to x * n where x is any constant value. Read input from properties file. Analyze k x m values and try to minimize them. Look into fault tolerance for fixed values of k and m.

## Mar 31

Automate the code for n, k, m values but with a condition k <= n. Analyze k x m values and try to minimize them. Look into fault tolerance for fixed values of k and m.

## Mar 17

Automate the Partial Order Sorter for various n(total number of numbers to be sorted), m(partial order set size), k(number of people constructing partial orders) values. Plot graphs of the results. Construct an example of a planning problem using STRIPS approach.

## Mar 10

Code Partial Order Sorter. Read Chapters 1 and 2 from Intelligent Planning and prepare a presentation. Upload Del1.

## Mar 03

Finish reading the paper on Sorting networks with fault tolerance. Complete the Sorting Network code.

## Feb 25

Read the paper on Sorting networks with fault tolerance. Work on the Sorting Network code.

## Feb 18

Construct a network of size O(n log _{k} n) for k inputs. Suggest a network that would work in case where few comparisons are wrong with a fixed probability. Suggest a network that would defeat wrong comparisons given by k adversaries and still give a correctly sorted sequence. Code a Sorting network.

## Feb 11

Read up on Sorting networks and Partial ordering and Total ordering algorithms from Intelligent planning and prepare a presentation.