The USA Computing Olympiad (USACO)

The USA Computing Olympiad (USACO) is the premier pre-college computing organization in the USA. Its goals include: Providing pre-college students with opportunities to sharpen their computer programming skills Enhancing the quality of pre-college computer education by providing both students and teachers with challenging problems, training materials, and competitions that emphasize algorithm development and problem-solving skills. Providing pre-college students with opportunities to sharpen their computer programming skills Recognizing excellent students with outstanding skills in computer science and encouraging them to pursue further opportunities in the profession. Providing educational, motivational, and competitive materials in the form of programming competitions and web-based training materials. http://train.usaco.org Register for the training pages and start working through the material to hone your competition computing skills. You'll automatically join a low-traffic mailing list (ten short messages per year) that will remind you of contest dates. http://ace.delos.com/contestgate Compete in the contests to work your way into the elite programmers invited to international level competitions.

Regards,

Manish

FS lab program corrections

You need to make these corrections in the programs (you might have taken the print outs):

1. First program is not satisfying the question. In case 2, take input from a file (and not stdin) and use getline for reading (and not >> operator).

2. In unpack method of RRN, variable length, primary index and secondary index programs, change the last statement from
p = strtok(NULL, "#"); strcpy(marks, p);
to
p = strtok(NULL, "\n"); strcpy(marks, p);

3. In the delete method in both the primary index and secondary index program, change the comment from
//we delete the record only in the index file
to
//we delete the record only in the record file

4. In the delete method in the linked list program, change the condition from
if(strcmp(first->usn, _usn) != 0) {
to
if(strcmp(first->usn, _usn) == 0) {

These are the updated programs except first one.

Let me know the corrections to make in my programs

Hi,

As most of you have followed my programs in file structures lab, I'm very happy. But there were some minor corrections in the programs as some of our friends reported.

As most of you have also taken the print outs of my programs, I will post the corrections so that you can just mark in your print outs and the program will remain the same. The first program was not satisfying the question and the correct program was posted by Hardik on my blog ourmanish.blogspot.com

I need some help from you. Please debug my programs for various inputs and let me know about the corrections. Reply before sunday so that I can post the corrections to all.

Regards,

Manish

FS Lab Program - 1

Hello Friends,

The updated Program -1 (Reversing the names) is available here.
Click to Download.

Regards,
Hardik Kotecha

Updated programs for FS lab

Hi friends,

Finally I have done the program for B-trees and B+ trees. There were some minor corrections to make in the earlier programs as well. So here is the link to download all the 12 programs fully updated.

File Structures Lab - updated

Kindly delete the programs which you had downloaded earlier. Before studying any program, make sure that you are getting output for it. My first program is not satisfying the question. You have to use two input files for the second case: one is the input file from which you read the names and the other is the output file into which you write the reversed names. I didn't take an input file. Sorry for the inconvenience.

Best,

Manish

FS Lab videos

Dear all,


I am very happy that my work on the video tutorials of FILE STRUCTURES LAB was greatly appreciated. Thanks to all.


But there are some corrections you need to make:
1. The sorting of the index files is mandatory and not optional as I have mentioned in the video. Even though the program will work well if the index file is not sorted, Divya madam told me that its mandatory.
2. There was a minor logical error in the "hashing" program, even though you are getting the output. I had skipped just one line in the retrieve case.
3. For the "linked list" program the file should not be opened in ios::app mode
You can download the updated programs by clicking here.
The old link to download will also link to the updated programs now.

Here are the the links to download the remaining video tutorials.


6. Index to secondary key
7. Co-sequential processing
8. K - way merge
11. Hashing
12. Reclaiming free space using linked list

I have also made a video of the making of these videos. If you are interested then here is the link to download the making
Making of FS videos


Please let me know your views and suggestions and errors if any.


Regards,
Manish kumar