Question

In: Computer Science

Thoroughly explain the impacts of data structures and algorithms in the development and implementation of computer...

Thoroughly explain the impacts of data structures and algorithms in the development and implementation of computer programs using modern computer technologies.

Solutions

Expert Solution

Short Answer :- They are important because, they are what you do after you've become a computer scientist. Without,data structures and algorithms, you will be only a monkey coder.

Long Answer :- As computer scientist, our job is to perform operations on data, we basically perform the following three steps :-

1) Take some input
2) Process it
3) Give back the output.

The input can be in any form, for eg while searching for directions on google maps, you give the starting point and the destination as input to google maps, while logging in to facebook, you give your email and password as input and so on.

Similarly, in the third step, the computer application gives us output in some form or the other.

To make this process efficient, we need to optimize all the three steps. As you can guess, the most we can optimize is the 2nd step, which is where we have Data structures and algorithms.

Data structures refers to the way we organize information on our computer. With a slight thinking , you can guess that the way we organize information can have a lot of impact on the performance. Take for example, a library. Suppose, you want to have a book on Set Theory from a public library, to do that you have to first go to the maths section, then to set theory section. If these books are not organized in this manner and just distributed randomly then it will be really a cumbersome process to find a book on set theory.

This is the way a librarian organizes his books(data) into a particular form (data structure) to efficiently perform a task(find a book on set theory).

In this manner we computer scientist process and look for the best way we can organize the data we have, so it can be better processed based on input provided.


Related Solutions

This question is in reference to BFS and DFS for data structures and algorithms Consider a...
This question is in reference to BFS and DFS for data structures and algorithms Consider a graph algorithm with a growth function on V and E: f(V, E). How would you convert f(V,E) to f'(V) such that f(V,E)=O(g(n))=f(V)? (That is, convert a growth function of two variables to be of one variable in such a way that the Big-Oh bound for the one variable function will hold for the two variable function.) Explain the steps in creating f', and explain...
What are the data structures and algorithms? Why are they important to software developers? Give an...
What are the data structures and algorithms? Why are they important to software developers? Give an example of using a data structure. Give an example of using algorithm. Use Google to search for your answers. Minimum 400 words and a maximum of 1000 words.
Data Structures and Algorithms Activity Requirement: Implement a queue using an array as its underline data...
Data Structures and Algorithms Activity Requirement: Implement a queue using an array as its underline data structure. Your queue should fully implemnted the following methods: first, push_back (enqueue), pop_front (dequeue), size, and isEmpty. Make sure to include a driver to test your newly implemented queue
completely and thoroughly explain how the concept of a Unit Load impacts the cost making of...
completely and thoroughly explain how the concept of a Unit Load impacts the cost making of any type of home appliance. discuss how the unit load changes from the time the parts are receieved at the dock to how it is processed in the manufacturing area into the finished product, and how the finished product is shipped to a retailer or customer.
This is a C++ based question that involves Data Structures and Algorithms. Q. Application: Linked List...
This is a C++ based question that involves Data Structures and Algorithms. Q. Application: Linked List of Bus Transit and Passengers You are to implement a C++ program for City Bus Transit using linked list data structure to maintain record of passengers. Specifically, you are to implement the following methods/functions: For Passenger: o A function which can create a new node of the linked list using new for each newpassenger o A function that prints the time of single passenger...
Implementation of Quick sort and heap sorting algorithms in C++
Implementation of Quick sort and heap sorting algorithms in C++
Individuals and organizations build various data structures and algorithms to solve real-life problems. Furthermore, many data...
Individuals and organizations build various data structures and algorithms to solve real-life problems. Furthermore, many data analysts tend to use Big-O notation for analyzing algorithms. In your own words, explain ways by which people can specify (i). data structures and (ii) algorithms, that they build and use.
Please thoroughly explain each answer. A manufacturer of computer chips has a computer hardware company as...
Please thoroughly explain each answer. A manufacturer of computer chips has a computer hardware company as its largest customer. The computer hardware company requires all of its chips to meet specifications of 1.2 cm. The vice-president of manufacturing, concerned about a possible loss of sales, assigns his production manager the task of ensuring that chips are produced to meet the specification of 1.2 cm. Based on the production run from last month, a 95% confidence interval was computed for the...
#data structures Assume you are given an implementation of the Stack class. Recall that it has...
#data structures Assume you are given an implementation of the Stack class. Recall that it has methods push(), pop(), top(), isEmpty() and isFull(). Write an Integer function with prototype: public static Integer popBottom(Stack<Integer> stk); Note that it has one parameter, a single stack object stk. The function should delete the item at the bottom of the stack and return this item as the value of the function. If the stack is empty return null. When the function returns the stk...
How would you show two linked lists are equal? (Java for Data Structures and Algorithms)
How would you show two linked lists are equal? (Java for Data Structures and Algorithms)
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT