The Algorithms is one of the most popular assignments among students' documents. If you are stuck with writing or missing ideas, scroll down and find inspiration in the best samples. Algorithms is quite a rare and popular topic for writing an essay, but it certainly is in our database.

I’m looking for

I’m looking in

Enter your email to get essay samples on your topic

Choose the best solution for you

Go through the list of samples

SHOW SAMPLESOrder the paper

Writing ServiceFilters

Including such words:

Document Type:

Subject:

Pages:

Downloads:

Levels:

Genetic Algorithms

3 pages (750 words)

Nobody downloaded yet

... Genetic algorithms are used as a synthetic but extremely useful means of solving extremely complex problems. It is a particularly beneficial means of problem solving because it is an efficient way of managing large quantities of arbitrary information. The use of GA’s is not limited to genetics but rather is used in business and other professional fields. For argument’s sake, we will approach genetic algorithms in this paper, from a Biological approach. approach. The principles of the genetic algorithm rests on the principles of natural selection, evolution and Mendelian Genetics. (Jamshidi 2003). The preliminary step to a genetic algorithm is to identify a means of encoding any sort of...

Routing Algorithms

2 pages (500 words)

Nobody downloaded yet

... Algorithms I.D. of the Routing Algorithms In this paper, some widely used complex routing algorithms are discussed which can be used to manage complicated networks and build routing tables. Today, OSPF is most widely used while once popular RIP is undergoing extensive development. (Forouzan 2006)
Open Shortest Path First (OSPF)
OSPF is a complex routing algorithm that can analyze the link-state situation of the given network. It can maintain the routes for all possible destinations in a network continuously. The routing table built by OSPF is based on topology database, and selection of nodes is done along shortest paths. The shortest path has least number of nodes in it. Hence, the technique proac...

a paper

Win a special DISCOUNT!

Put in your e-mail and click the button with your lucky finger

Your email

YOUR PRIZE:

—

Genetic Algorithms

4 pages (1000 words)

Nobody downloaded yet

... Head: GENETIC ALGORITHMS GENETIC ALGORITHMS [The [The of the Genetic Algorithms Genetic Algorithms
The N-Queens problem is a traditional AI problem. Its name is resulting from the allowable moves for the ruler part in chess. Queens are allowable to move flat, vertically, or diagonally, toward the back and forward, with the merely restriction being that they can go in only one course at a time. A queen that can reach one more piece in one move capture it.
The N-Queens problem is based on the idea of trying to put N queens on an N x N grid, such that no ruler will be able to imprison any other queen. The N-queens problem is characteristic of a lot of combinatorial problems, in that it is easy to state ...

Discrete Mathematics(Mathematical Algorithms)

9 pages (2250 words)
, Download 1

... MATHEMATICS Mathematical Algorithms Table of Contents Introduction 3 Mathematical Algorithms Overview 3 Evolution 5 Relation of Computer Science and Mathematical Algorithms 6
Algorithm-Supported Mathematical Theory 7
Mathematical Algorithm Analysis 8
Impotence of Mathematical Algorithms 9
More Real-world Examples 10
Conclusion 10
Bibliography 11
Introduction
Discrete mathematics is a section or element of mathematics that is concerned with the objects which are capable of assuming just divided, distinctive values. The concept of discrete mathematics is thus applied in distinction with continuous mathematics, that is the subdivision of mathematics concerned with the objects which have the competence ...

Hashing Algorithms Information Technology Research Paper

8 pages (2000 words)

Nobody downloaded yet

... head: HASHING ALGORITHMS Hashing Algorithms Number Introduction Hashing algorithms are used for several purposes like encoding, decoding a particular text or a file, to provide key access to a database, to convert the specified value into another format. Hashing algorithms are generally categorized based on the type of data in which they are used. The most popular hashing algorithms include SHA algorithms which work on the basis of the bit length of the text. Another commonly used algorithm is MD5 and its basic function is to generate hash values to encode and decode the given information. Apart from these algorithms, Whirlpool, Bloom Filters and other algorithms are also widely used. Hashing...

Compression Algorithms

7 pages (1750 words)

Nobody downloaded yet

... Compression Algorithms: Introduction In information theory and computer technology, source coding, reduction in the bit rate or data compression involves encoding of information by the use of fewer bits compared to original representations. The compression can be lossless or lossy. Lossless compression lessens bits through identification and elimination of statistical redundancy. There is no information that is lost in the lossless compression. In contrary, lossy compression lessens bits through identification of marginally vital information and eliminates it. This process of size reduction of data is popularly known as compression of data, though it was formally known as source coding. Compression...

Data structures and algorithms for social media

7 pages (1750 words)
, Download 1

... Structures and Algorithm Applications in Social Media Data Structures and Algorithm Applications in Social Media Data structures are the registers and memories in a computer, whilst algorithms are the pieces of information stored in the structures (Wirth, 1984). Algorithms are very useful in selecting the most relevant information during a search. There are recommended algorithms that are able to guide selective searches. In social media, such algorithms are able to identify a certain element, like a fiend, and ignore others. The algorithms are able to identify a certain topic as “trending”, from millions of topics on a particular social media site. These can; hence, be defined as procedures that...

Breaker Failure Detection Algorithms

7 pages (1750 words)

Nobody downloaded yet

... Breaker Failure Detection Algorithms In a power system world, breaker failure protection became a critical element to provide a back up protection for circuit breakers (CBs). Practically, every apparatus is equipped with primary protection to interrupt the current flow whenever a fault occurs. Thus, the breaker failure relay opens adjacent breakers to isolate the problem. Fast and secure breaker failure detection algorithm would be a critical challenge facing a numerical BF relay. In the first part, it presents the need for breaker failure protection. The second part addresses issues worth consideration when applying Breaker Failure Protection and lastly, advances towards breaker Failure Protection. ...

Efficiency of Clustering Algorithms in Mining Biological databases

5 pages (1250 words)

Nobody downloaded yet

... EFFICIENCY OF CLUSTERING ALGORITHMS IN MINING BIOLOGICAL DATABASES (s) Efficiency of clustering algorithms in mining biological databases Introduction Clustering analysis is increasingly being used in the mining of databases such as gene and protein sequences. Clustering algorithms is generally a common technique of data mining where by the data sets being examined are assigned into clusters on the basis of their similarities. In most cases, clustering algorithms are categorized into various groups depending on how they form their clusters1. For example Hierarchical algorithms often work by either splitting or merging the groups being analyzed in order to develop a hierarchy of clusters that is...

Differentiate between the different types of cryptographic algorithms

1 pages (250 words)

Nobody downloaded yet

... algorithms Differentiation of different types of cryptographic algorithms Cryptographic algorithms are instruments used in the process of encryption of data. Encryption is the process of coding information inform of cipher text for protection of information. The cipher text requires a decoding key to read the text. In cryptography, a key refers to a sequence of bits which long and used in decryption or encryption algorithms. There are various forms of classifying Cryptographic algorithms. The dominant and common form is the classification on the basis of the number of keys employed in encryption and decryption. There are three types of cryptographic algorithms. These are secret key cryptography,...

Data Compression Algorithms.Use of Compression Algorithms in Forensics

4 pages (1000 words)

Nobody downloaded yet

... Compression Algorithms From the many years, numerous data compression algorithms have been developed to deal with specific data compression problem. From the developed data compression algorithms, there does not exist a single compression algorithm that compress all data types efficiently. Therefore, each algorithm has a number of strengths as well as weaknesses. The compression algorithms are also commonly used in forensics. These algorithms are used to reduce space amount required to store data on the computer hard disk. Usually, these algorithms are employed on the large files so that their size may be reduced. Mainly, there are two types of the compression algorithms include: lossless and lossy...

Efficiency of Clustering algorithms for mining large biological data bases

10 pages (2500 words)

Nobody downloaded yet

... EFFICIENCY OF CLUSTERING ALGORITHMS FOR MINING LARGE BIOLOGICAL DATA BASES By Presented to With the enormous amount, of gene sequences resulting from genome expression and uncontrolled data classification into functional families or classes, clustering of such large data sets has become a serious headache in functional and structural genomics. The accurate classification of sequences into classes is in recent times a necessity, and as a result, computer programs have been developed to help in automatic clustering. Various clustering algorithms-methods-have addressed the gene sequence clustering. They are categorized into portioning, hierarchical and graph-based techniques. The most widely used of...

Efficiency of Data Mining Algorithms in Identifying Outliers/Noise in a Large Biological Data Base

6 pages (1500 words)

Nobody downloaded yet

... Efficiency Of Data Mining Algorithms In Identifying Outliers/Noise In A Large Biological Data Base Efficiency Of Data Mining Algorithms In Identifying Outliers/Noise In A Large Biological Data Base Introduction The protein sequences numbers in bioinformatics are approximated to be over a half a million. This calls for the need of meaningful partitions of the protein sequences so as to be in a position to detect the role they play. Alignment methods were traditionally used in the grouping and comparing protein sequences. In a later stage, local alignment algorithms were introduced to replace the earlier methods and perform more complex functions. The local algorithms were used to find amino acid...

Design And Analysis Of Algorithms For Obtaining Super Resolution Satellite Images

18 pages (4500 words)

Nobody downloaded yet

... Chapter One Context and background The launching of satellites nowadays, experience transformations due to the increasing need for High Resolution images. History shows that once satellites are launched, updating of its captured images faces a challenge due to resolution problems. Some algorithms have been developed, which assist in transforming Low Resolution images to High Resolution images. High Resolution (HR) images have a wide range of usage in the various fields, for example, medical imaging, video surveillance, and satellite imaging. However, due to limitations of hardware, many Low Resolution (LR) images are obtained than High Resolution images. As a result, researchers have come up with...

Data Structures and Algorithms

4 pages (1000 words)

Nobody downloaded yet

... a) A Tree ADT comprises of the following es and sub es parent (n, T) 2. lmostchild (n, T) 3. rsibling (n, T) 4. root (T) 5. makenull (n, T)
6. height (n, T)
7. depth (n, T)
8. createi (v, T1, T2,..., Ti) creates the tree shown in Figure below.
The data structure should be in a position to support every one of the operations listed above. The common schemes that ADT is expected to include are: the arrays, list of children, Child-Sibling representation.
Task 2:
The source code is give below as a text file.
// Classes for performing Adaptive Huffman Coding (both FGK and modified Vitter algorithm).
// - AdaptiveHuffmanProvider: Static methods used to compress and decompress
// - AdaptiveHuffmanS...

Hashing Algorithm

10 pages (2500 words)

Nobody downloaded yet

... ALGORITHMS Hashing Algorithms Affiliation Introduction Hashing algorithms are used to translate the input of any size to a smaller output of fixed extent by making use of the hash function. In this scenario, this output value is known as the hash value. Basically, this hash value consists of a distinctive and very condensed mathematical illustration of a portion of data. This process of translation from input to output is a compressed mapping, to be precise, the space that is taken by the hash value is a great deal smaller than that of the input. In fact, any value or even a single letter is changed in the input; then the values of hash value will also be changed. Additionally, same hash value can...

Math and students

1 pages (250 words)

Nobody downloaded yet

... and Question one working in groups develop new skills and understanding of the problems henceare in a position to solve the problem competently. Therefore it is necessary to know the understanding level and the approaches applied by individual students, however where possible groups are good to deal so as to help the understanding of others.
Question Two
When the students carry out numerous tasks on algorithms they are in a position to handle different questions with different algorithms and still arrive at the same answer. This occurs in cases where there is the use of the traditional algorithms and the student made algorithms .The student made algorithm may be in a position to solve the problem c...

Mechanism of Locating the Client's DaTa in the Clouds

5 pages (1250 words)

Nobody downloaded yet

... (s) Mechanism of locating the Client’s data in the Clouds Introduction Cloud computing is a service technology that enables clients to remotely store their data on servers found on the internet. The data is generally stored in a different location by a third party service provider and therefore the clients do not own the data centers and infrastructures but they basically rent it. The Cloud not only help clients and users to store, retrieve, delete and update their date within the cloud data centers, but the users are also able to access their stored data anywhere anytime. Owing to the current rapid prevalence of Cloud computing many clients are increasingly using the clouds to store sensitive...

Variables, Expressions, and Data Types

1 pages (250 words)

Nobody downloaded yet

... Expressions and Data Types Programming and mathematics share the use of logic and development of algorithms to solve or complete a certain action or solve a problem. Applying mathematics in the program can be done through use of mathematical functions and algorithms like sorting, searching, use of induction in recursive algorithms and lambda calculus. Sorting algorithms are used in sorting arrays in an application or organizing names, and this makes searching for these values easier in a program. Mathematical sort algorithms are used to sort different data types, files or even URL.
Variables in applications are names that provide a program with a named storage that allows programs to manipulate them...

Mutual Exclusion in Multiprocessor Systems

6 pages (1500 words)

Nobody downloaded yet

... Exclusion in Multi Processing Systems The Problem In any processing environment that runs more than one program or task at the same time has the problem of restricting resource access by multiple processes at the same time. In the course of a normal execution of any two programs on the same processor (uniprocessor systems) there is always a possibility that the programs might request for the same resource. If the resource is employed by one program and if the other program should request for it, then either a queue gets built up if it could be queued. Such issues can happen with a multi processor systems as well on a larger scale.
This issue can be resolved by employing an appropriate mutual exclusio...

Truss Optimisation

10 pages (2500 words)

Nobody downloaded yet

... of Contents Table of Contents 1.Introduction 2 1. Background 2 2.Literature Review 3 3. Objective 4 2. Theory 4 2 Structural optimization 4 2.2. The GA Principle 6 2.3. Truss Structures 7 3. Structural Optimization Using Genetic Algorithms 8 4. An Example of 10 bar Truss 10 5. Conclusions 11 References 12 1. Introduction In the recent years, the employment of genetic algorithms (GA) to get the optimal design for the civil engineering structures has been studied (Leon, 1970; Bunday, 1984; Bell, 1974; Makowski, 1965; Collatz and Wetterling, 1975). Ghasemi et al. (1999) have revealed the appropriateness of the genetic algorithms to deal with the large trusses that have numerous indefinite variables....

Asymmetric Key/Symmetric Key

3 pages (750 words)

Nobody downloaded yet

... Full Paper Introduction Over the years, many cryptographic algorithms have been invented. These algorithms can be categorizedinto three types, i.e. encryption algorithms, hashing algorithms, and signature based algorithms. Encryption algorithms are utilized for encrypting data to ensure privacy and protection. Hashing algorithms are utilized to ensure data is not modified during transit – that is, to ensure data integrity. Lastly, signature based algorithms are used for authentication by providing a digital or electronic signature of the user. As an ABC institute of research has to protect highly sensitive information from its rivals, we will discuss symmetric and asymmetric encryption algorithms in ...

Data Mining for Auditing

8 pages (2000 words)

Nobody downloaded yet

... Mining for Auditing Contents of the Report Introduction Auditing: An Introduction to the Problem Domain The Solution to the Problem
Data Mining: An Introduction
Integration of Data Mining with Auditing
Introduction
The transition of the applied information technology from the primitive file processing systems to sophisticated database systems can be tracked to 1960s. The evolution of the relational database systems coupled with development of data modelling, indexing and organisational techniques have led to the massive utilisation of databases and data warehouses in virtually all business transactions. One such area where data plays a key role is auditing. Auditing is a crucial role carried out by...

Data Mining - Questions to answer

4 pages (1000 words)

Nobody downloaded yet

... Is a Neural Network with one or more hidden layers more powerful than a single layer perceptron Explain (Hint: in terms of learning can a neuralnetwork with one or more hidden layers learn functions more complex than the perceptron)
An artificial neural network contains networked neurons working together to solve complex problems. A typical single-layer perceptron consists of one or more artificial neuron parallely arranged and is not computationally complex. In single layer perceptron, as the number of input increases the proportion of function decreases drastically. The drawbacks of single layer perceptron are described already (Minsky and Papert, 1969). Back-Propagated Delta Rule Networks (BP) is ...

PARALLEL ALGORITHM FOR MULTI-DIMENSIONAL MATRIX MULTIPLICATION OPERATIONS REPRESENTATION USING KARNAUGH MAP

10 pages (2500 words)

Nobody downloaded yet

... PARALLEL ALGORITHM FOR MULTI-DIMENSIONAL MATRIX MULTIPLICATION OPERATIONS REPRESENTATION USING KARNAUGH MAP Multi-dimensional arraysare widely used in a lot of scientific studies but still some issues have been encountered regarding efficient operations of these multi-dimensional arrays. In this paper, the extended Karnaugh Map representation (EKMR) scheme has been proposed as an alternative to the traditional matrix representation (TMR) which caused the multi-dimensional array operation to be inefficient when extended to dimensions higher than two. EKMR scheme has managed to successfully optimize the performance of the multi-dimensional array operations to the nth dimension of the array. The basic...

Let us find you essays on topic Algorithms for **FREE!**

Copyright © 2014-2018 StudentShare.org

- About StudentShare
- Testimonials
- FAQ
- Blog
- Free Essays
- New Essays
- Essays
- The Newest Essay Topics
- Index samples by all dates

Join us: