StudentShare
Contact Us
Sign In / Sign Up for FREE
Search
Go to advanced search...
Free

Algorithmic: the Spirit of Computing - Assignment Example

Cite this document
Summary
This assignment "Algorithmic: the Spirit of Computing" discusses Algorithmic as a branch of science but according to David Harel, it is “much more than that and is instead the core of computer sciences” (Harel, 1992)…
Download full paper File format: .doc, available for editing
GRAB THE BEST PAPER91.5% of users find it useful
Algorithmic: the Spirit of Computing
Read Text Preview

Extract of sample "Algorithmic: the Spirit of Computing"

The two principal types of algorithms that do such traversals are the depth-first search (DFS) and the breath-first search (BFS). They have also proved out to be useful in the investigation of various key properties of a graph. A depth-first search begins by visiting the graph’s vertices at an arbitrary vertex by marking it as already been visited. The algorithm then at each iteration proceeds to an unvisited vertex, which is adjacent to the current one. The process then prolongs until upon encountering a vertex that has no adjacent vertices, unvisited.

A breadth-first search begins in a concentric manner by initially visiting all the vertices adjacent to the initiating vertex followed by all unvisited vertices that are two edges apart and so on unless it visits all the vertices in the same connected component as the starting vertex. Their contrasting characteristics are, while DFS is a traversal for the brave, BFS is for the cautious. While DFS uses a discipline of the stack, the latter uses that of the queue, which means the former has a LIFO approach and the latter has the FIFO.

The number of vertex orderings for DFS are two whereas for BFS it's one. The edge types in undirected graphs for DFS are tree and back edges whereas for the BFS the types are tree and cross edges. Important basic applications for both include checking connectivity and acyclicity of graph, however, the former has a sophisticated application of finding articulation point of a graph whereas the latter is useful in finding a path with the fewest number of edges between two given vertices (Levitin, 2005).

Read More
Cite this document
  • APA
  • MLA
  • CHICAGO
(Algorithms Depth-First Search and the Breadth-First Search Example | Topics and Free Essays, n.d.)
Algorithms Depth-First Search and the Breadth-First Search Example | Topics and Free Essays. https://studentshare.org/information-technology/1894972-discussion-on-algorithms-depth-first-search-dfs-and-the-breadth-first-search-bfs-artificial
(Algorithms Depth-First Search and the Breadth-First Search Example | Topics and Free Essays)
Algorithms Depth-First Search and the Breadth-First Search Example | Topics and Free Essays. https://studentshare.org/information-technology/1894972-discussion-on-algorithms-depth-first-search-dfs-and-the-breadth-first-search-bfs-artificial.
“Algorithms Depth-First Search and the Breadth-First Search Example | Topics and Free Essays”. https://studentshare.org/information-technology/1894972-discussion-on-algorithms-depth-first-search-dfs-and-the-breadth-first-search-bfs-artificial.
  • Cited: 0 times

CHECK THESE SAMPLES OF Algorithmic: the Spirit of Computing

Scheduling: some description of the most important problems, models and solution methods

“ Scheduling, in the scenario of present day computing, has broadened and diversified effects.... The performance and requirement of scheduling can be observed in almost all areas pertaining to computing.... In spite of immense work being done in this regard, the performance issues, algorithmic complexities and limitations are few of the areas that are still open for researchers....
5 Pages (1250 words) Essay

Pollard Rho Algorithm

Professor Date Pollard's Rho algorithm Pollard's Rho algorithm is an algorithm which requires a computation driven solution which is well addressed beneath a multi-core architecture.... As the number of digits in number increases, more cores are needed to factorize the number.... hellip; The most significant application of this algorithm is with Discrete Logarithmic Problem (DLP)....
3 Pages (750 words) Essay

Mythical man-months

hellip; In the past decades, when the computing industry was on the rise, efficient management techniques of optimizing the effort and the schedule were deficient in achieving their objectives.... The deficiencies inherent in those strategies that once existed have been identified and it has now become important to use standard tools and techniques for all kinds of activities in the computing industry. One of the first problems that existed previously was that any activity was taken up with a sense of over-confident optimism with the belief that nothing could go wrong at all....
3 Pages (750 words) Essay

Mutual Exclusion in Multiprocessor Systems

The paper "Mutual Exclusion in Multiprocessor Systems" aims at studying the possible mutual exclusion algorithms that are employed in a uni-processor system and in a multi-processor system.... It is important for the programs to recognize the usage of any of the resources.... hellip; In any processing environment that runs more than one program at the same time has the problem of restricting resource access by multiple processes at the same time....
5 Pages (1250 words) Research Proposal

Different Methods of Software Optimization

In the study carried out by Cruz and Pelta (2009), the most basic ingredients of soft computing were used, i.... On the algorithmic approach, metaheuristics can be successfully applied to complex and difficult combinations of optimization programs.... In the current global environment, digital technology and the increase in volume of online transmissions requires the availability of considerable amounts of bandwidth, further exacerbated by the lack of availability of storage space on computers....
4 Pages (1000 words) Essay

Algorithm in Todays World

Oxford dictionary of computing.... algorithmic Language and Program Development.... This is a definition essay aimed at understanding the definition, origin and current use of the word 'algorithm'.... In simple words, an algorithm can be defined as a predefined procedure to be followed to arrive at a specific solution to a problem....
1 Pages (250 words) Research Paper

Take the Data out of Dating in the Internet System

This essay "Take the Data out of Dating in the Internet System" describes love challenging in Internet social sites.... nbsp;The author's main point is that online dating doesn't guarantee a person to get the perfect match.... People should be aware of the perversity that comes with algorithms.... This work outlines the importance to be more attentive to user information in the Internet....
7 Pages (1750 words) Essay
sponsored ads
We use cookies to create the best experience for you. Keep on browsing if you are OK with that, or find out how to manage cookies.
Contact Us