Insertion sort is a simple sorting algorithm: a comparison sort in which the sorted array (or list) is built one entry at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. However, insertion sort provides several advantages:


              ex: repetition of insertion sort removes an element from the input data, inserting it into the correct position in the already-sorted list, until no input elements remain. The choice of which element to remove from the input is arbitrary, and can be made using almost any choice algorithm.




Shellsort- is one of the oldest sorting algorithms, named after its inventor D.L. Shell (1959) [She 59]. It is fast, easy to understand and easy to implement. However, its complexity analysis is a little more sophisticated.

Ex:

Let  3 7 9 0 5 1 6 8 4 2 0 6 1 5 7 3 4 9 8 2  be the data sequence to be sorted. First, it is arranged in an array with 7 columns (left), then the columns are sorted (right):

3 7 9 0 5 1 6 8 4 2 0 6 1 5 7 3 4 9 8 2

3 3 2 0 5 1 5 7 4 4 0 6 1 6 8 7 9 9 8 2

                                                                    case study 4
hash function and implementation algorithm are essential for good hash table performance, but may be difficult to achieve. A basic requirement is that the function should provide a uniform distribution of hash values
 1.) What is hash collision?Collision domains are found in a hub environment where each host segment connects to a hub that represents only one collision domain and only on broadcast domain.
2.)What really happens during a hash collision? Include an image.the functions are designed so as to maximize the probability of collision between distinct but similar data. Checksums on the other hand, are designed to minimize the probability of collisions between similar inputs, without regard for collisions between very different inputs.
3.)What are the ways and methods to resolve hash collision? Explain Eachis a situation that occurs when two distinct pieces of data have the same hash values, check sum, fingerfrint.
because the functions are designed so as to maximize the probability of collision between distinct but similar data.
                                                                      case study5

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.
1.)



2.)

From what IVe been reading the worm is a complicated one, the fact that it can open a door then get in and close it to prevent furhter access so i seems ike nothings been tampered is pretty damn smart, it leaves no trace. I dont think someone would do all this for an elaborate hoax  the hoax is prolly just covering what it will do.any like these they are usually random blabber  but these if u read them actually make sense and are a rather intereseting read, they all have the same premise,lets talk on skype so we can chat face to face and I need you to store some money for meshould make sure their systems are patched and running the latest security software. People should patch their systems to close the hole in Windows that Conficker exploits and should update their antivirus software. The major antivirus vendors all have free Conficker removal tools.

                                                                   case study2
Faur was also accused of hacking computers belonging to the US navy and the Department of Energy between November 2005 and September 2006, according to an official statement. He was also previously indicted by the US Attorneys Office for allegedly being the leader of a hackers group called the WhiteHat Team The group of hackers was famous for breaking into various computer systems precisely despite their reputation of being among the most secure in the world. It seems they weren t after all. if the IBM in the Czech Republic where the company established the intentions were not destructive as his actions only aimed at proving that several.& no longer Hackers around the world are known for breaking in some of the most secure computer networks.

                                                                   case study3
a.)i think  no because that is a accident  we dont no what is happen  just a compilicated & i know sequence of keystrokes represents one holistic idea, one complete task, but the operator is left without the kind of feedback which would confirm that the task has been completed. For example, there was a fairly complicated dialogue necessary to remove a widget from the acid bath. However, upon completion of this dialogue, the robot operator was led into a new, unrelated dialogue, without being informed that the widget removal dialogue had been completedrobot operator console This allowed me to investigate the robot's behavior without actually risking serious harm.