Hi, I'm Eli 👋

@elibelly

UI Developer

Get your Computer Science degree

in 10 minutes*

*Here are some CS concepts that you might want to know exist or maybe clarify

@elibelly

What is computer science?

@elibelly

The study of problem solving

Looking at a problem and working out a way a computer might be able to help you solve it.

@elibelly

The scientific and practical approach to computation and its applications.

The systematic study of the feasibility, structure, expression, and mechanization of the methodical procedures (or algorithms) that underlie the acquisition, representation, processing, storage, communication of, and access to information.

More formally...

@elibelly

we want to, like, get information or do stuff to it soo how do we science that and then make computers do all the work real fast

Which basically means...

@elibelly

Algorithms

@elibelly

What is an algorithm ?

An unambiguous set of steps to complete a task or computation

It is very much like a recipe for a computer

@elibelly

Algorithm: Find the max

Problem: Given a list of positive numbers, we need to return the largest number on the list.

Input: A list, "L", of positive numbers. This list must contain at least one number.

Output: A number, "n", which will be the largest number of the list.

Set "max" to 0.

For each number x in the list L, compare it to max. If x is larger, set max to x.

"max" is now set to the largest number in the list.

@elibelly

Algorithms & Computer Science

Does an algorithm actually exist to do a thing?

Are we totally sure that the algorithm works for all possible inputs?

How long does the algorithm take to run?

How much memory space does it require?

Once we know it’s possible to solve a problem with an algorithm, is the algorithm the best possible one. Can the problem be solved more quickly?

Answering some Qs

@elibelly

Time Complexity

The amount of time an algorithm takes to run in relation to the number of inputs

@elibelly

Big O Notation

A mathematical notation that describes a measure of the execution of a function as the inputs approach infinity