Apcsp

What is an algorithm?

An algorithm is a set of instructions that computers follow to solve problems.

What is the efficiency focus when sorting a million numbers?

It is important to know how long the sorting process takes and how much memory it uses.

What is the difference between Sequential and Binary Search?

Sequential search checks each item one by one, while binary search splits the list in half and is much faster, but only works on sorted lists.

What does Sequential (Linear) Search involve?

It involves checking each item one by one until the desired item is found.

How does Binary Search work?

Binary search involves splitting a sorted list in half repeatedly until the target item is found.

What is Selection Sort?

Selection sort involves finding the smallest number and placing it in the first position, repeating this for the next smallest numbers.

Can you describe Insertion Sort?

Insertion sort is like organizing cards; you start with one card and insert subsequent cards in the correct position.

What is Bubble Sort?

Bubble sort compares two items at a time and swaps them if they are out of order, effectively moving the largest items to the top.

Explain Merge Sort.

Merge sort splits the list into smaller chunks, sorts each chunk, and merges them back together in order.

What are Undecidable Problems?

Undecidable problems are questions that cannot be answered by any algorithm, such as the Halting Problem.

What are Intractable Problems?

Intractable problems can be solved theoretically, but it takes impractically long to solve; an example is the Traveling Salesman Problem.

What is Parallel Computing?

Parallel computing involves dividing a task among multiple processors or computers to speed up the process.

Describe Distributed Computing.

Distributed computing uses many smaller computers connected over a network to solve massive problems.

What is Procedural Abstraction?

Procedural abstraction simplifies code by using procedures with flexible inputs rather than repeated fixed commands.

Why is it important to understand algorithm limits?

Knowing some problems are unsolvable helps set realistic expectations for what can be achieved with algorithms.

How has the web evolved from Web 1.0 to Web 2.0?

The web has shifted from static pages to a dynamic exchange of ideas, with search engines providing instant access to information.

What role do search engines play on the web?

Search engines connect users to content without creating it themselves, influencing how information is accessed and perceived.

How do search engines gather and use data?

They gather data, index it, and match user queries to relevant content while prioritizing relevance through complex algorithms.

What challenges do search engines face in providing results?

Search results can be biased, either through sponsored links or through algorithmic design that influences visibility.

What are some legal and ethical issues surrounding search engines?

Issues include the persistence of cached pages after deletion and debates over digital privacy and intellectual property.

How can we visualize the internet's structure?

Imagine the internet as a giant messy library where search engines act as librarians to help users find information quickly.