Monday, March 12, 2012
Monday, February 27, 2012
HCSD Data Structures Case Study 7
Determine the advantages and disadvantages of each sorting algorithm once it will be applied in a program or an application:
- Bubble Sort
- Selection Sort
- Insertion Sort
- Shell Sort
- Bucket Sort
- Merge Sort
- Quicksort
Monday, February 20, 2012
Bubble sort, Selection Sort and Insertion Sort Slides
Bubble Sort:
http://projectarchive.comuf.com/upload/371.pptx
Selection Sort:
http://projectarchive.comuf.com/upload/372.pptx
Insertion Sort:
http://projectarchive.comuf.com/upload/373.pptx
Sunday, February 12, 2012
HCSD Data Structures Case Study 6
Research an application or scenario that the following sorting algorithms can be applied (include a description and an image):
- Bubble Sort
- Selection Sort
- Insertion Sort
- Shell Sort
- Bucket Sort
- Merge Sort
- Quicksort
Monday, January 30, 2012
Friday, January 27, 2012
Tuesday, January 17, 2012
E-commerce Case Study 3 and 4
Monday, January 16, 2012
HCSD Data Structure Case Study 5
Give at least three scenarios in the real world wherein HASH COLLISION can happen. Include an image.
Give at least three specific software/program/application wherein HASHING and HASH COLLISION might occur. Include the name of the software/program/application, description and a screenshot.
HCSD Data Structure Case Study 4
We already discuss hash functions..
But what will happen if it will result to a collision of hash keys?
Answer the following questions:
1. What is hash collision?
2. What really happens during a hash collision? Include an image
3. What are the ways and methods to resolve hash collision? Explain Each
Instructions:
- Post your answer in your blog.
Monday, January 9, 2012
Brokenshire SAD documents outline
Brokenshire SAD documents outline
Download the SAD Project outline here:
http://projectarchive.comuf.com/upload/363.doc
Download the Frontpage template here:
http://projectarchive.comuf.com/upload/364.doc









