Scribd
Upload
41 views

Data Structures and Algorithm

This document contains a 15 question quiz about data structures and algorithms taken by Jules Rhenz Navarro. It covers topics like the definition of algorithms, how they are used in programming and applications, examples of different types of algorithms like sorting and machine learning, and how parallel processing can improve performance. All questions were answered correctly.

Uploaded by

navarrojules53
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
41 views

Data Structures and Algorithm

This document contains a 15 question quiz about data structures and algorithms taken by Jules Rhenz Navarro. It covers topics like the definition of algorithms, how they are used in programming and applications, examples of different types of algorithms like sorting and machine learning, and how parallel processing can improve performance. All questions were answered correctly.

Uploaded by

navarrojules53
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

DATA STRUCTURES AND ALGORITHM

FINAL QUIZ

NAME: __Navarro, Jules Rhenz_____

1. An algorithm is simply a set of steps used to complete a specific task. They're the building blocks

for programming.

Answer: a.

2. Algorithms are classified based on the concepts that they use to accomplish a task. As long as

coding and programming continue to be used; algorithms will be at the heart of these

technologies.

Answer: a.

3. Most of the computer applications and mobile apps are developed using a certain algorithm.

They are the fundamental components on making applications that is interfaced with clients.

Answer: a.

4. A sorting algorithm is an algorithm that puts elements of a list in a certain order. Sorting is often

an important first step in algorithms that solves more complex problems.

Answer: a.

5. Compare the first two elements in the list, and if the first is greater than the second, swap them.

This process is done in Linear sort.

Answer: c.

6. Algorithms can be expressed as natural languages, programming languages, pseudocode,

flowcharts and control tables. Natural language expressions are rare, as they are more

ambiguous.

Answer: a.

7. Algorithms use an initial input along with a set of instructions. The output is the initial data

needed to make decisions and can be represented in the form of numbers or words.

Answer: c.
8. The input data gets put through a set of instructions, or computations, which can include

arithmetic and decision-making processes. The input is the last step in an algorithm and is

normally expressed as more data.

Answer: c.

9. Machine learning uses supervised learning or unsupervised learning. Machine learning is a good

example of an algorithm.

Answer: a.

10. Machine learning used in artificial intelligence does not rely on algorithms. However, machine

learning-based systems may have inherent biases in the data that feeds the machine learning

algorithm.

Answer: b.

11. The easy availability of computers along with the growth of Internet has changed the way we

store and process data. We are living in a day and age where data is available in abundance.

Answer: a.

12. Concurrent processing is essential where the task involves processing a huge bulk of complex

data. This is where we require concurrent processing that can divide a complex task and process

its multiple systems to produce the output in quick time.

Answer: a.

13. Parallelism is the process of processing unique set of instructions simultaneously. It reduces

the total computational process.

Answer: b.

14. An algorithm is a sequence of instructions followed to solve a problem. While designing an

algorithm, we should consider the architecture of computer on which the algorithm will be

executed.

Answer: a.

15. It is not easy to divide a large problem into sub-problems. Sub-problems may have data

dependency among them.

Answer: a.

You might also like