Brian's 101 class to take you higher in education.

From 79.95 C$ /h

Dedicated, resourceful and goal-driven professional educator with a solid commitment to the social and academic growth and development of every child.
An accommodating and versatile individual with the talent to develop inspiring hands-on lessons that will capture a child's imagination .

Extra information

Each student must have a laptop. Core i5.

An Android phone which will be used during online sessions.

Each student must pay before attending a class.

Dress properly during a zoom class and no obscene languages or hateful words.

Location

Use Ctrl + wheel to zoom!

At teacher's location :

Bonabéri, Cameroon

About Me

Am cooperative, humble, understanding, and easy to work with.
I love obedience from my students.
I value relationships.
Am out for the money, betterment of the student, and the school and society at large.
I love teamwork.

Education

HND: Currently taking my HND in software engineering at the university of Fomic polytechnic Douala, Cameroon.
I got my Advance level certification last year in

Experience / Qualifications

HND: 2 yrs
A/l: 2yrs
Been a private teacher for quite some time now.
I equally taught at FUGOPANS BAI KUKE , and am teaching no

Age

Teenagers (13-17 years old)

Adults (18-64 years old)

Student level

Beginner

Intermediate

Advanced

Duration

60 minutes

The class is taught in

English

Skills

Algorithms

Geography

Computer science

Availability of a typical week

(GMT -05:00)

New York

At teacher's location

Mon

Tue

Wed

Thu

Fri

Sat

Sun

00-04

04-08

08-12

12-16

16-20

20-24

TechBridge Learning: Code, Create, Innovate. Basics to pro

119.93 C$ /h

Learn Computer Science and Software Engineering at your own pace—whether you’re a high school student, university aspirant, or an adult eager to upskill! Our class makes tech simple, practical, and fun.
• Programming & Software Development: Start from the basics or dive deeper into coding, apps, and software projects.
• ICT & Computer Science Fundamentals: Understand computers, networks, databases, and algorithms with clear, step-by-step guidance.
• Career & Life Skills in Tech: Gain practical skills for jobs, freelancing, or personal projects, no matter your age.

Everyone is welcome—all you need is curiosity and the willingness to learn. Step into the world of technology and build the skills of tomorrow.

Léon

Digital suites courses

I - General
A numeric sequence is an application from N to R.
• Bounded sequence
A sequence (Un) is bounded if there exists a real A such that, for all n, Un ≤ A. We say that A is an upper bound of the series.
A sequence (Un) is reduced if there exists a real number B such that, for all n, B ≤ one. One says
that B is a lower bound of the sequence.
A sequence is said to be bounded if it is both increased and reduced, that is to say if it
exists M such that | Un | ≤ M for all n.

• Convergent suite

The sequence (Un) is convergent towards l ∈ R if:
∀ε> 0 ∃n0 ∈ N ∀n ≥ n0 | un − l | ≤ ε.
A sequence which is not convergent is said to be divergent.
When it exists, the limit of a sequence is unique.
The deletion of a finite number of terms does not modify the nature of the sequence, nor its possible limit.
Any convergent sequence is bounded. An unbounded sequence cannot therefore be convergent.

• Infinite limits

We say that the following (un) diverges

Towards + ∞ if: ∀A> 0 ∃n0∈N ∀n ≥ n0 Un≥A
Towards −∞ if: ∀A> 0 ∃n0∈N ∀n≤ n0 Un≤A.

• Known limitations

For k> 1, α> 0, β> 0

II Operations on suites

• Algebraic operations

If (un) and (vn) converge towards l and l ', then the sequences (un + vn), (λun) and (unvn) respectively converge towards l + l', ll and ll '.

If (un) tends to 0 and if (vn) is bounded, then the sequence (unvn) tends to 0.

• Order relation

If (un) and (vn) are convergent sequences such that we have a ≤ vn for n≥n0,
then we have:
Attention, no analogous theorem for strict inequalities.

• Framing theorem

If, from a certain rank, un ≤xn≤ vn and if (un) and (vn) converge towards the
same limit l, then the sequence (xn) is convergent towards l.

III monotonous suites

• Definitions

The sequence (un) is increasing if un + 1≥un for all n;
decreasing if un + 1≤un for all n;
stationary if un + 1 = one for all n.

• Convergence

Any sequence of increasing and increasing reals converges.
Any decreasing and underestimating sequence of reals converges.
If a sequence is increasing and not bounded, it diverges towards + ∞.

• Adjacent suites

The sequences (un) and (vn) are adjacent if:
(a) is increasing; (vn) is decreasing;

If two sequences are adjacent, they converge and have the same limit.

If (un) increasing, (vn) decreasing and un≤vn for all n, then they converge to
l1 and l2. It remains to show that l1 = l2 so that they are adjacent.

IV Extracted suites

• Definition and properties

- The sequence (vn) is said to be extracted from the sequence (un) if there exists a map φ of N
in N, strictly increasing, such that vn = uφ (n).
We also say that (vn) is a subsequence of (un).
- If (un) converges to l, any subsequence also converges to l.

If sequences extracted from (un) all converge to the same limit l, we can conclude that (un) converges to l if all un is a term of one of the extracted sequences studied.
For example, if (u2n) and (u2n + 1) converge to l, then (un) converges to l.

• Bolzano-Weierstrass theorem

From any bounded sequence of reals, we can extract a convergent subsequence.

V Suites de Cauchy

• Definition

A sequence (un) is Cauchy if, for any positive ε, there exists a natural integer n0 for which, whatever the integers p and q greater than or equal to n0, we have | up − uq | <ε.
Be careful, p and q are not related.

• Property

A sequence of real numbers, or of complexes, converges if, and only if, it is
Cauchy

SPECIAL SUITES

I Arithmetic and geometric sequences

• Arithmetic sequences

A sequence (un) is arithmetic of reason r if:

∀ n∈N un + 1 = un + r

General term: un = u0 + nr.

Sum of the first n terms:

• Geometric sequences

A sequence (un) is geometric of reason q ≠ 0 if:

∀ n∈N un + 1 = qun.

General term: un = u0qn

Sum of the first n terms:

II Recurring suites

• Linear recurrent sequences of order 2:

- Such a sequence is determined by a relation of the type:

(1) ∀ n∈N aUn + 2 + bUn + 1 + cUn = 0 with a ≠ 0 and c ≠ 0
and knowledge of the first two terms u0 and u1.
The set of real sequences which satisfy the relation (1) is a vector space
of dimension 2.
We seek a basis by solving the characteristic equation:

ar2 + br + c = 0 (E)
- Complex cases a, b, c
If ∆ ≠ 0, (E) has two distinct roots r1 and r2. Any sequence satisfying (1) is then
like :
where K1 and K2 are constants which we then express as a function of u0 and u1.

If ∆ = 0, (E) has a double root r0 = (- b) / 2a. Any sequence satisfying (1) is then
type:

- Case a, b, c real
If ∆> 0 or ∆ = 0, the form of the solutions is not modified.
If ∆ <0, (E) has two conjugate complex roots r1 = α + iβ and r2 = α − iβ
that we write in trigonometric form r1 = ρeiθ and r2 = ρe-iθ

Any sequence satisfying (1) is then of the type:

• Recurrent sequences un + 1 = f (un)

- To study such a sequence, we first determine an interval I containing all
the following values.
- Possible limit
If (un) converges to l and if f is continuous to l, then f (l) = l.
- Increasing case f
If f is increasing over I, then the sequence (un) is monotonic.
The comparison of u0 and u1 makes it possible to know if it is increasing or decreasing.
- Decreasing case f
If f is decreasing over I, then the sequences (u2n) and (u2n + 1) are monotonic and of
contrary

Made by LEON

Dimitri

Microsoft Excel is very powerful data analysis software. It is a practical solution in the short to medium and long term to automate your calculations, to have a global and detailed overview on your activities, and to analyze your data.

As an accountant, marketer, commercial agent, secretary, merchant, salesperson or company manager, a good mastery of this software will improve your efficiency, your competitiveness, and will save you a lot of time and money. Whatever your field of activity, this software is designed to help you.

During this training you will learn:
- best practices, functionalities and tools;
- functions and their use;
- handling of Dynamic Cross Tables, dynamic graphics,
- the design of dashboards,
- and you will acquire reflexes that will be useful for your entire career.

Duration of training: 1 month
Number of hours: 24 hours

I am expecting many of you because we have a lot to share.

Garba

I specialize in tutoring math, computer science and physics for ordinary level students and preparing them to obtain excellent result in GCE Ordinary Level exams. My goal is to keep students challenged, but not overwhelmed. I assign homework after every lesson and provide periodic progress reports. I also apply different methods of teaching.

Ronald

1. Introduction to Computer Science:
- Discovery of the computer: Hardware and Software
- Basic knowledge of computing and computer use
- Exploring the user interface: desktop, taskbar, icons, etc.

2. Learning Navigation Skills:
- How to browse the Internet safely
- Discovery of search engines and web browsers
- How to create and manage favorites

3. Introduction to programming:
- Understand the concept of programming
- Learn the basics of programming with simple languages
- Use visual programming blocks to create simple programs
- Understand programming variables, loops and conditions and their use

4. Discovery of software suites:
- Use of Microsoft Office suites and Google Apps to create documents, presentations and spreadsheets
- Introduction to graphic design software such as GIMP, Canva, etc.

5. Computer Security:
- Basic security rules to protect their digital environment
- How to avoid online scams and computer viruses

6. Conclusion:
- Training summary
- Professional opportunities in IT

This study program can be adapted to meet the individual needs of children, based on their skill level and interest.

Bomen

Is your coding class leaving you in the dust? You're not alone. Computer science concepts can be tricky, but they don't have to be.

I specialize in transforming confusion into clarity. With 5+ years of professional coding and 3+ years of dedicated teaching experience, I have a knack for breaking down complex topics into simple, understandable steps.

With me, you will:

· Demystify Tough Topics: Understand the "why" behind algorithms, object-oriented programming, and more.
· Learn at Your Pace: Get patient, one-on-one support tailored to your specific questions and learning style.
· Gain Unshakable Confidence: Turn your weakest subject into your greatest strength and ace your exams.

Don't let one confusing class hold you back. Let's unlock your potential together.