Scribd
Upload
11 views54 pages

Intro To Programming

The document provides an introduction to various computer programming concepts including bits and bytes, variables and data types, data structures like stacks and queues, conditionals and loops, paradigms like object-oriented programming and functional programming, and algorithms. Data structures are discussed in the context of storing oranges and notebooks. Common data structures like stacks, queues and trees are explained through examples.

Uploaded by

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

Intro To Programming

The document provides an introduction to various computer programming concepts including bits and bytes, variables and data types, data structures like stacks and queues, conditionals and loops, paradigms like object-oriented programming and functional programming, and algorithms. Data structures are discussed in the context of storing oranges and notebooks. Common data structures like stacks, queues and trees are explained through examples.

Uploaded by

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

Intro to Programming

Setemi Ojo
Introduction to
Computer Programming
& Languages
Programming
Bits & Bytes
Bits & Bytes
Bits & Bytes
Introduction to
Variables & Data Types
Programming
Circumference
of a circle
Introduction to
Data Structures
Programming
“A data structure is a storage that is used to store and
organize data. It is a way of arranging data on a computer
so that it can be accessed and updated efficiently.”

If I give you 20 oranges and 35 notebooks


for you to keep/store, will you store them
them same way?

How would you store them? What would


you consider in deciding how to store them
A Tree Data Structure
A Tree Data Structure Example ?
A Tree Data Structure
A Tree Data Structure
This was at the bottom of the dirty pile, but at
Though this particular plate got added last into
the end, it’s now at the top of washed plates
the pile by the person gathering dirty plates in
a wedding, by the time this pile gets to the
kitchen, this very plate will be the first to get
picked up, washed and leave the pile.

A stack is a last-in-first-out data structure


The entire payment process is a queue and people are attended to in the order / sequence in
which they entered the line. A queue is a first-in-first-out data structure

He’ll get to the pay point He got here first, so he’ll


last, so will be the last to be the first to pay and
pay and exit exit with his goodies
Introduction to
Conditionals, Loops &
Recursion
Programming
A Loop
Introduction to
Paradigm: OOP
Programming
?
Introduction to
Paradigm: FP
Programming
Introduction to
Algorithms
Programming
An algorithm is a procedure used for solving a
problem or performing a computation. Algorithms
act as an exact list of instructions that conduct
specified actions step by step in either hardware- or
software-based routines. Algorithms are widely used
throughout all areas of IT.

An algorithm is a set of well-defined steps or


instructions that a computer program follows in order
to solve a particular problem or perform a specific
task. Algorithms can be thought of as a recipe or a
blueprint that guides the computer program in
achieving its objective. They are often used in
computer programming to automate tasks, make
decisions, and solve problems efficiently.
https://www.linkedin.com/pulse/big-o-notation-simple-explanation-examples-pamela-lovett/
https://www.linkedin.com/pulse/big-o-notation-simple-explanation-examples-pamela-lovett/
Thank You!

You might also like