How to apply algorithmic design & data structure techniques in developing structure programs?

-

How to apply algorithmic design & data structure techniques in developing structure programs?

An algorithm is a step-by-step procedure that defines instructions to be executed in a specific order to get the desired output. Algorithms are generally created independent of underlying languages; an algorithm can be implemented in more than one programming language. 

From the data structure point of view, the following are some important categories of algorithms: 

  • Search − Algorithm to search an item in a data structure. 
  • Sort − Algorithm to sort items in a particular order. 
  • Insert − Algorithm to insert an item in a data structure. 
  • Update − Algorithm to update an existing item in a data structure. 
  • Delete − Algorithm to delete an existing item from a data structure. 

Are some algorithms and data structure designs better than others?

Data structures are generally based on the ability of a computer to fetch and store data at any place in its memory, specified by a pointer, a bit string representing a memory address that can be stored in memory and manipulated by the program. Thus, the array and record data structures are based on computing the lectures of data items with arithmetic operations. In contrast, the linked data structures are based on storing addresses of data items within the system itself.

Implementing a data structure usually requires writing a set of procedures that create and manipulate instances of that structure. The efficiency of a data structure cannot be analyzed separately from those operations. This observation motivates the theoretical concept of an abstract data type, a data structure defined indirectly by its procedures and the mathematical properties of those operations, including their space and time cost.

Explain why one design would be used before another method would be used. 

A data structure requires a certain amount of space for each data item it stores, a certain amount of time to perform a single essential operation, and a certain amount of programming effort. Each problem has constraints on available space and time. Each solution to a problem uses the vital functions in some relative proportion, and the data structure selection process must account for this. Only after a careful analysis of your problem’s characteristics can you determine the best data structure for the task.

Each data structure has associated costs and benefits. In practice, it is hardly ever true that one data structure is better than another for use in all situations. If one data structure or algorithm is superior to another in all respects, the inferior one will usually have long been forgotten. 

How would you apply algorithmic design and data structure techniques in developing structure programs?

The data structure is a particular way of storing and organizing data to be used efficiently. Arrays, trees, linked lists, stacks, graphs, etc., are all data structures, and each of them allows us to perform different operations on data.

No matter which programming language you use, it is essential to learn algorithm design techniques in data structures to build scalable systems.

Selecting a proper design technique for algorithms is a complex but essential task. Following are some of the main algorithm design techniques: 

1. Brute-force or exhaustive search
2. Divide and Conquer
3. Greedy Algorithms
4. Dynamic Programming
5. Branch and Bound Algorithm
6. Randomized Algorithm
7. Backtracking

A given problem can be solved in various approaches, and some methods deliver much more efficient results than others. Algorithm analysis is a technique used to measure the effectiveness and performance of the algorithms. It helps to determine the quality of an algorithm based on several parameters such as user-friendliness, maintainability, security, space usage, and other resources.

References:

1.1. Data structures and algorithms — CS2 software design & data structures. (n.d.).
    OpenDSA. https://opendsa-server.cs.vt.edu/ODSA/Books/CS2/html/IntroDSA.html

Algorithm design techniques | How is algorithm design applied? | WLU. (2019, February 12). Laurier        Online | 100% Online. Flexible, career-ready degrees. https://online.wlu.ca/news/2019/02/12/how-        algorithm-design-applied 

Data structure. (2001, October 27). Wikipedia, the free encyclopedia. Retrieved September 26, 2024,         from https://en.wikipedia.org/wiki/Data_structure 

Data structures - Algorithms basics. (n.d.). Biggest Online Tutorials Library.                                                   https://www.tutorialspoint.com/data_structures_algorithms/algorithms_basics.htm

Comments

Post a Comment

Popular posts from this blog

Java

-
 Programming can seem overwhelming. There are lots of languages out there.  Here are some of the ones that are considered by IEEE Spectrum's interactive rankings to be some of the top languages to learn. They are Python, C++, Swift, JavaScript, and Java. The list goes on.  The purpose of this article is to focus on Java. Java is considered a multi-platform language, which means it can be used across many program platforms. It is an Object-Oriented program, and the main concepts are Abstraction, Encapsulation, Polymorphism, and Inheritance. It is considered a secure way to develop applications on the internet.  There are several open-source applications that can be used for installing the open-source applications used in compiling Java programs. They are NetBeans ( http://netbeans.org ) and Eclipse ( http://www.elicpse.org ), just to name a few. I prefer NetBeans. Installation is straightforward and simple.  Here is the resource I used when downloading NetBeans https://netbeans.apac
Read more

About Me

-
Image
My name is Melissa and I am from Alabama. I have 3 kids and 3 dogs.  I work as an IT Service Desk Trainer. I have been with this bank for over 5 years now. This is my 4th role within the company. I started out in IT Tier 2, moved my way to branch tech, then a quality analyst role, and now the Trainer role. When I was in Tier 2 at my current company, I was remoting into computers or working on them in person at the branches to get them up and running properly. I also helped with networking with the switches and such as well. I think I am a Senior at UAGC since I will finish all my classes in Sept of next year. If not, I am very close to becoming a senior. I am working on my Bachelor's in IT. I hope this helps me to be able to either move up in the company to make more money or when my son graduates high school, I will try and find a better-paying job somewhere else. I do like it at the bank with my current role because it taps into the training knowledge from a previous company, and
Read more
-
THE CRITICAL IMPORTANCE OF INFORMATION AND SYSTEM SECURITY In the digital era, the security of information and systems has become a paramount concern for individuals and organizations alike. As the world becomes increasingly interconnected through computer networks and information systems, it is vital to adopt a proactive stance in safeguarding data integrity, confidentiality, and system reliability. This blog post underscores the profound significance of information and system security and delves deeper into pivotal computer security incidents: vulnerabilities and computer viruses. Ping Commands and Potential Threats: Ping Flood Attack: The ping flood attack is characterized by the inundation of a target system with an excessive volume of ping requests. These requests, often initiated from a botnet, overwhelm the target's network infrastructure, and consume its available bandwidth. The consequences are manifest in network disruptions or significant slowdowns, thereby rendering ser
Read more