DSAA204 Data Structure and Algorithms

Introduction: -

The principle of distinct types of coding has shifted the computer programming landscape. It has many benefits, including the ability to develop optimized code for completing a task and employ a variety of software applications to make it even more productive (He et al. 2018). A data model is a mathematical model that organizes data pieces, records how information is stored and accessed, automates how separate data pieces connect and quiet, and designs solutions for information system objectives. The full notion of the data model and algorithm is presented in this study.

Background: -

In this study, the major point of attention has been data structure and technique presented in 11 weeks. Every week, the material has been divided into three areas: theoretical debate, content analysis, and outcome. Finally, the whole systematic review report was created using information from the 11 weeks.

Discussion: -

Week 1: -

Introduction: -

The notion of program, which covers int definitions and importance, has been explored extensively in the first week. An algorithm is a well-defined finite series of desktop instructions used to meet those needs or conduct computation.

Definitions: -

The study methods discuss varieties of information, including creative thinking, professional programming, fun and wealth, and unlocking the secret of the cosmos and life (Patel and Dharwa 2017). The technique aids in the replacement of statistical equations with numerical simulations, which were previously utilized to solve a technological challenge in the twentieth century.

Analysis: -

This week has given me a better understanding of the fundamentals of methods and why they study them. For instance, if the student wants to add two numbers, they would write the formula (1st number+ 2nd number), but in the algorithm, they would express it in steps like this:

• Establish the parameters sum, n2, and n1.
• Identify the n2 and n1 values
• add the n2 and n1vaues
• allocate the outcome to the variable sum
  
  

Reflection: -

The essential aspect I acquired this week was a thorough understanding of the technique and how it alters the approach to addressing a mathematically based problem.

Outcome: -

This approach expands my knowledge of data layout (Santra and Bhowmick 2017). Data models specify how data is linked to one another and how it is handled and stored within the network. Flat data models, in which all of the data is retained almost the same plane, might be the first data structure.

Week 2: -

Stack and queues: -

The theory of array expansion has been addressed extensively in the second week, including its introduction, Queue and its API, array, and operation. When there is no place left in a stack with a standardized product pushing an array element, Array Pre-processing is used to build a whole new array of greater size and then copy the previous array's component.

Definitions: -

The difference between an array and a function is that an array collects elements stored in contiguous memory regions. However, a function is a sequence of statements that receive input from the user and produce output by executing specified functions (McArdle and Nesselroade 2019).

Analysis: -

A queue gathers numerous entities that are controlled progressively and can be changed by extracting objects at the end.

Reflection: -

This week helped me learn the notion of queuing by giving me an instance: imagine a single lane one-way lane with all vehicles entering first and exiting first (Fern and Morrison 2017). However, the most significant thing I learned was about arrays and functions, which helped me comprehend how information is stored in an array and then called for a specific function to be performed.

Outcome: -

Arrays are one of the most significant data structures, and practically every programme uses them. Much other data structures, such as lists and characters, are also implemented using them. They can take advantage of the device's addressing logic.

Week 3: -

Algorithm analysis: -

The major subjects that have been discussed in the third week are analysis of data, obstacles that a programme may provide, scientific methods that have been applied to technical analysis, and the brute force strategy. Filtering, analyzing, modelling, and changing data to uncover relevant information is known as data processing.

Definitions: -

A programme may present two issues: why the software is so slow and why it uses so much storage. Observation, investigation, prediction, validation, and approval are some of the scientific processes used in data gathering.

Analysis: -

Data Analysis is a technique for solving a problem that relies on the computer's raw processing capacity and exploring every possible solution rather than employing a more efficient strategy.

Reflection: -

The 4-digit PIN lockout is the most powerful component. The input numbers must range from 0 to 9, and the brute force process will try every possible permutation, such as 0007, 0008, 0009 until it finds the proper PIN.

Outcome: -

The brute force approach is the most significant aspect since it aids in learning about an approach that is used virtually every day.  The writer also studied the notion of data collection this week, and I completed it.

Week 4: -

Elementary sorts: -

The most useful word in the method, sorting and extraction, and the call-back method, have all been addressed in the fourth week. The Selection Sort is a methodology for rearranging a list or array to determine the subsequently revised order in a data model.

Definitions: -

The Insertion Algorithm is also used to put many data elements into the array index specified. It is utilized in any situation where data must be stored in a system to obtain the desired outcomes.

Analysis: -

Finally, the call-back function, often known as the "call-after" component, is a classification model supplied as a parameter to another code. The response would then be called back at a certain time by another code.

Reflection: -

Sorting and Insertion are both highly beneficial for developing an OOPs-based system in which data is added using the insertion method. The system generates a result using the sorting method. The algorithm frequently moves a component from the uncategorized sub-array to its proper location in the arranged sub-array.

Outcome: -

Essential ideas I have learnt are the numerous sorts of techniques I can use to perform different functions like theoretical structure and data sorting using different factors. This week, I was able to get a better knowledge of the two techniques.

Week 5: -

Sort demo merging: -

The theory of merge sort and its methodology were discussed in the fifth week as an important matter.

Definitions: -

Merge Sort is a sorting algorithm that follows the divide and rule principle. It divides the sample into two equal portions before joining them in a concise form.

Analysis: -

The steps of the algorithm are listed below to give you an understanding of how it works:

• Split the sample into two halves.
• Because the result is not atomic, the two strands separated again.
• The second step is maintained until the exact values are obtained.
• They will now go in the reverse direction and merge in a concise form.
• The fourth step will be performed until the full array is sorted.
  
  

Reflection: -

The most prime example I can use for merge sort is coin denomination. Firstly, we divided the coin according to its valuation, and then each denomination is added all together. This makes tallying the monetary amount a breeze.

Outcome: -

The notion of merge sort is the most significant topic presented, as it helps me grasp how to apply it and develop my skills with the merge sort technique. This week has provided me with a good understanding of the most critical technique, mergeSort.

Week 6: -

Quick Sort: -

The notion of quicksort and its technique has been discussed extensively in the sixth week. Quick Sort is a time-saving method that works by splitting tasks into groups arrays. It selects a scaling factor and separates the specified array around that pivot.

Definitions: -

Quick Sort comes in a variety of flavours, each of which uniquely selects pivot. The pivot values divide the list into two equal portions, and the pivot values for each sub-list are found iteratively until all of the lists have a single aspect.

Analysis: -

Step 1: Decide which index has the highest value.

Step 2: Create two factors that will point to the conservative and liberal of the list.

Step 3: Right will connect to the high indices, while the left will link to the low indices.

Step 4: Move to the left if the value on the left is lower, and vice versa.

Step 5: If steps 4 and 5 do not equal, switch right and left.

Step 6: If right=left, the viewing platform is changed.

Reflection: -

Quick Sort will be used for a variety of things and in a variety of places. For instance, I may use it to sort documents containing student names from A to Z, or sort the complete alphabet of student names.

Outcome: -

The application of merge sort in practice is the most key topic acquired. It enables me to share my skills to a variety of tasks that requires intensive processing.

Week 7: -

Heap Sorts: -

The notion of heap sort and its process was presented in the seventh week as a significant topic. Heap Sort is a form of comparison sorting method dependent on the binary heap's data model.

Definitions: -

It is the same as the selection sort, wherein the least is determined, and the lowest component is placed first (Tonietto et al. 2018). Heapsort is a sorting algorithm that uses the Binary Heap data structure to compare items.

Analysis: -

It is comparable to selection sorting, in which we identify the linked list first and place it at the top.

Reflection: -

The technique is repeated for the remaining items. Heap sorting is a very effective approach. While other classification algorithms may become progressively slower as the number of products grows, Heap sort takes a logarithmic amount of time. This means that heap sort is especially well suited to sorting a large number of things.

Outcome: -

The most useful and intriguing topic is heapsort. The heap sort technique, for example, is employed in a sim card store with multiple clients. The work that takes the least amount of time, such as consumer bill payment, will be completed first. Users will save energy and will not have to wait for the next person in line if they use this strategy.

Week 8: -

BST: -

The theory of the binary search tree and its functions have been discussed extensively throughout the seventh week.

Definitions: -

The Binary Search Tree (BST) is a binary data structure built on nodes with attributes such as a left node's substring having only the key that is less than the single node key.

Analysis: -

It is aright node's ways to solve problems having just the key that is higher than the node's key (Ahmadian et al. 2020). Search, insert, pre, in and post-order navigation are the five basic processes. A binary tree is a sort of database system for encrypting files in an orderly manner, such as numbers.

Reflection: -

Data structure trees are used to build dynamic sets and lookup tables and enable quick lookup, adding, and removals of data elements. BST can be utilized in a variety of ways. For example, let us say we are collecting orders online and need to keep track of the user information in RAM in a concise form or know how many things have been ordered at a given price.

Outcome: -

The binary search tree was the essential idea presented this week since it allowed me to comprehend what BST is and improved my training and expertise for applying it effectively.

Week 9: -

Balanced search tree: -

The principle of a balanced search tree and the conditions required for such a tree structure have been addressed extensively in the ninth week.

Definitions: -

Balanced Search Tree is a tree-based approach that automatically keeps the height of a series of removal or configurations modest.

Analysis: -

This type of structure provides an acceptable execution for abstract data structures like up to a number. It is also known as a height-balanced tree structure, in which the maximum difference between a node's right and left subtrees is less than one. For a height-balanced binary tree, several requirements must be present, such as:

• the disparity between the right and left subtrees for each node must be almost one;
• Moreover, the tree on the left must be balancing.
  
  

Reflection: -

The balanced search tree has a wide range of applications that can be seen in various systems that use an automatic inclusion and deletion procedure (Jin et al. 2018). For instance, customer files can be stored automatically by detecting a code in the proper locations.

Outcome: -

The balanced binary search tree is the most significant idea that has been presented since it helps me comprehend what BST is and enhances my knowledge and expertise for implementing it realistically.

Week 10: -

Hash Table: -

The idea of hashing, which covers hashing, decryption algorithm, and issues for which it can be employed, was explored in depth in the eleventh week. Hashing is the methodology of using a hash function to translate data types into a hash table.

Definitions: -

It is done so that the element can be accessed more quickly. Hash Tables are data structures used to keep records in an associative format in which the information is stored in the object database.

Analysis: -

The Hash Function is a function that takes input sets of arbitrary shape and stores them in a table with a fixed element size. This procedure is used for various purposes, including calculating the hash value, quality testing, and collision avoidance.

Reflection: -

The most crucial function for password security is the hash function. When a user gives their password details, for example, the certifications are hashed, and the results will be compared to a hashed values list saved on a specific server.

Outcome: -

The essential idea taught was using a hash function, which allows learners to comprehend how businesses employ these algorithms to defend their customers' sensitive data.

Week 11: -

String sorts: -

The major issue that has been discussed in the eleventh week is the concept of string, which covers its crucial essential generalization and data type. A string is a collection of characters that can be used as a constant or a literal constant.

Definitions: -

It allows the structural component to be transformed into something else and the duration of the component to be modified or fixed (Ma and Leung 2019).

Analysis: -

Program target, processing of information, telecommunications like email, and parallel model like Java programmes are all examples of significant underlying abstractions of a string. For example, the database system is "character," represented by "char," and may represent roughly 256 characters. It is commonly an integer of 8 bits that accepts 7-bit ASCII.

Reflection: -

Since it allows characters, the use of string is highly popular in programming. For instance, if the user needs to save information with a character, such as a name, location, position, gender, and so on, the strings data type "character" can be used.

Outcome: -

The essential idea addressed was using the strings in programming, which allows me to understand the data structure better and how many character and BIT types it supports. This aids in the development of my programming experience and abilities.

Conclusion: -

Algorithmic and data structures have been around for a long time. It simplifies the computing process by providing cognitive reasoning for each problem that must be solved subsequently with coding. As a result, the report writer considers that the claims mentioned above are correct and valuable for further research. Furthermore, they have greatly aided me in improving my training and expertise.

References: -

Ahmadian, A., Mohammadi-Ivatloo, B. and Elkamel, A., 2020. A review on plug-in electric vehicles: Introduction, current status, and load modeling techniques. Journal of Modern Power Systems and Clean Energy, 8(3), pp.412-425.

Fern, R.R. and Morrison, M.L., 2017. Mapping critical areas for migratory songbirds using a fusion of remote sensing and distributional modeling techniques. Ecological Informatics, 42, pp.55-60.

He, R., Ai, B., Molisch, A.F., Stuber, G.L., Li, Q., Zhong, Z. and Yu, J., 2018. Clustering enabled wireless channel modeling using big data algorithms. IEEE Communications Magazine, 56(5), pp.177-183.

Jin, B., Che, C., Liu, Z., Zhang, S., Yin, X. and Wei, X., 2018. Predicting the risk of heart failure with EHR sequential data modeling. Ieee Access, 6, pp.9256-9261.

Ma, Z. and Leung, J.Y., 2019. Integration of data-driven modeling techniques for lean zone and shale barrier characterization in SAGD reservoirs. Journal of Petroleum Science and Engineering, 176, pp.716-734.

McArdle, J.J. and Nesselroade, J.R., 2019. Using multivariate data to structure developmental change. In Life-span developmental psychology (pp. 223-267).

Patel, A. and Dharwa, J., 2017. Graph data: The next frontier in big data modeling for various domains. Indian Journal of Science and Technology, 10(21), pp.1-7.

Santra, A. and Bhowmick, S., 2017, December. Holistic analysis of multi-source, multi-feature data: Modeling and computation challenges. In International Conference on Big Data Analytics (pp. 59-68).

Tonietto, M., Rizzo, G., Veronese, M., Borgan, F., Bloomfield, P.S., Howes, O. and Bertoldo, A., 2018. A unified framework for plasma data modeling in dynamic positron emission tomography studies. IEEE Transactions on Biomedical Engineering, 66(5), pp.1447-1455.

Have you reached your limit trying to find dependable assignment help in London, Glasgow, Nottingham, Bristol, and Cardiff? Now, unlock top-quality dissertation help in the UK only on Myassignmenthelp.co.uk.

For over a decade, we have been resolving assignment problems for millions of students wondering, “Who can provide me with quality homework help?” Our priority is to maintain top-notch standards in every assignment we deliver.

As a result, when you look for law assignment help on our website, you can hire professional lawyers for a consultation. So, don't let your academic worries fester. Instead, hire our professional paper writers and increase your chances of securing an A+.