facebook
Search
Become a Tutor
favorite button
1/4
Esimo
verified badge
dot icon
Recently active
member since icon
Since September 2023
Instructor since September 2023
Computer Science & ICT Lessons for Secondary Students – Practical, Easy to Understand
course price icon
From 22 C$ /h
arrow icon
I am a Computer Science and ICT teacher with several years of teaching experience, helping secondary-school students understand technology in a simple, practical and engaging way.

My lessons are designed for students who want to improve their Computer Science and ICT knowledge, prepare for examinations, complete practical exercises, or build strong computer skills from the basics. I work with students at different levels and adapt each lesson to their current understanding and learning needs.

Topics can include computer fundamentals, hardware and software, operating systems, databases, networking, internet and web technologies, programming concepts, algorithms, cybersecurity basics, office applications, ICT theory and practical computer work.

My teaching approach focuses on explanation, demonstration and practice. Instead of simply memorizing notes, students are encouraged to understand how and why things work, ask questions, solve problems and practise what they learn.

I can also help students prepare for school examinations by reviewing difficult topics, working through exercises and past questions, identifying areas of weakness and developing better study and problem-solving techniques.

Whether you are a beginner, a secondary-school student, or someone who wants to strengthen their Computer Science and ICT skills, I will structure the lessons according to your goals and learning pace.
Extra information
Own a laptop
Location
green drop pin icon
|
Use Ctrl + wheel to zoom!
zoom in iconzoom out icon
location type icon
At teacher's location :
  • LinkedBrains Cameroon, Lycee Polyvalent de Bonaberi, Bonabéri, Cameroon
About Me
I am a Computer Science and ICT teacher with several years of teaching experience, helping secondary-school students understand technology in a simple, practical and engaging way.

My lessons are designed for students who want to improve their Computer Science and ICT knowledge, prepare for examinations, complete practical exercises, or build strong computer skills from the basics. I work with students at different levels and adapt each lesson to their current understanding and learning needs.

Topics can include computer fundamentals, hardware and software, operating systems, databases, networking, internet and web technologies, programming concepts, algorithms, cybersecurity basics, office applications, ICT theory and practical computer work.

My teaching approach focuses on explanation, demonstration and practice. Instead of simply memorizing notes, students are encouraged to understand how and why things work, ask questions, solve problems and practise what they learn.

I can also help students prepare for school examinations by reviewing difficult topics, working through exercises and past questions, identifying areas of weakness and developing better study and problem-solving techniques.

Whether you are a beginner, a secondary-school student, or someone who wants to strengthen their Computer Science and ICT skills, I will structure the lessons according to your goals and learning pace.
Education
My educational background includes Advanced Level studies, complemented by professional and practical training in IT and networking. I have developed additional skills through certifications and practical learning in areas such as Cisco networking (CCNA), Microsoft security and identity fundamentals, AWS/IAM concepts, computer systems and technical support.
Experience / Qualifications
I have taught Computer Science and ICT to secondary-school students across different levels, including both ordinary and advanced-level classes. My teaching experience includes explaining theoretical concepts, conducting practical computer exercises, preparing students for examinations, working through past questions, and helping students who have difficulties understanding technical topics.
Age
Children (7-12 years old)
Teenagers (13-17 years old)
Adults (18-64 years old)
Seniors (65+ years old)
Student level
Beginner
Intermediate
Advanced
Duration
60 minutes
The class is taught in
English
French
Skills
Availability of a typical week
(GMT -04:00)
New York
at teacher icon
At teacher's location
Mon
Tue
Wed
Thu
Fri
Sat
Sun
00-04
04-08
08-12
12-16
16-20
20-24
This course aims to give you the knowledge and tools necessary to better understand and master the computer. We provide support for all.
76 C$ /h
Hey! Are you looking for a young, approachable yet meticulous tutor in Computer Science? Then I believe I might be the tutor for you! I offer lessons in the aforementioned subjects (English only) for high-school and bachelor students at the start of their studies.

A little bit about me:
I am a CCNA NETWORK ADMINISTRATOR and a computer science teacher presently.Last year, I completed my bachelor's in Computer Science. I have been a computer science teacher for the past 2 years and have assisted student for some courses during my stay at the university. Additionally, I have given private lessons to a few high school and bachelor's students, so I believe I have accumulated enough experience with guiding and tutoring students across different disciplines. I have found out that I enjoy teaching a lot, so that is why I am here - to help you and myself!

My expertise:
During my high school years, I was the I.T assistance in my department.I've helped high-school and university peers with exam preparation, taught whole courses privately, prepared sample exams, and reviewed and graded real ones. Regarding the university courses I have experience in, I have taught:
Read more
Private lessons
arrow icon
Computer Science
arrow icon
Information Technology
arrow icon
Computer Programming
Similar classes
arrow icon previousarrow icon next
verified badge
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
verified badge
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.
verified badge
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.
verified badge
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.
verified badge
Ajua
Computer networking engineering is a vital field that underpins the modern world. It is the process of designing, building, and maintaining computer networks. Computer networking engineers apply their knowledge of computer science and engineering principles to create networks that are reliable, efficient, and secure.

You will learn how to design computer networks from scratch and how to program protocols, security categories, OSPF, RIP, LAN, VLAN etc.....
verified badge
Achua
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 .
verified badge
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.
verified badge
Njuh
Are you curious about how websites and apps are built but don't know where to start? This beginner-friendly course will take you from zero to building your first real project step by step.
What you'll learn:
How the web works
HTML & CSS → build and design web pages
Basic PHP → make your website dynamic
MySQL → store and manage data
How to think like a developer
Who this is for:
Complete beginners with zero coding experience
Students curious about tech and software
Anyone who wants to build websites or start a career in tech
What makes this different:
Your instructor is an active software developer currently building real world applications. You won't just learn theory — you'll build things from day one.
Format: Online or in person
Language: English
message icon
Contact Esimo
repeat students icon
1st lesson is backed
by our Good-fit Instructor Guarantee
Private lessons
arrow icon
Computer Science
arrow icon
Information Technology
arrow icon
Computer Programming
Similar classes
arrow icon previousarrow icon next
verified badge
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
verified badge
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.
verified badge
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.
verified badge
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.
verified badge
Ajua
Computer networking engineering is a vital field that underpins the modern world. It is the process of designing, building, and maintaining computer networks. Computer networking engineers apply their knowledge of computer science and engineering principles to create networks that are reliable, efficient, and secure.

You will learn how to design computer networks from scratch and how to program protocols, security categories, OSPF, RIP, LAN, VLAN etc.....
verified badge
Achua
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 .
verified badge
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.
verified badge
Njuh
Are you curious about how websites and apps are built but don't know where to start? This beginner-friendly course will take you from zero to building your first real project step by step.
What you'll learn:
How the web works
HTML & CSS → build and design web pages
Basic PHP → make your website dynamic
MySQL → store and manage data
How to think like a developer
Who this is for:
Complete beginners with zero coding experience
Students curious about tech and software
Anyone who wants to build websites or start a career in tech
What makes this different:
Your instructor is an active software developer currently building real world applications. You won't just learn theory — you'll build things from day one.
Format: Online or in person
Language: English
Good-fit Instructor Guarantee
favorite button
message icon
Contact Esimo