facebook
Become a Tutor

Discover the Best Private Computer science Classes in Douala

For over a decade, our private Computer science tutors have been helping learners improve and fulfil their ambitions. With one-on-one lessons at home or in Douala, you’ll benefit from high-quality, personalised teaching that’s tailored to your goals, availability, and learning style.

search-teacher-icon

Find Your Perfect Teacher

Explore our selection of Computer science tutors & teachers in Douala and use the filters to find the class that best fits your needs.

chat-icon

Contact Teachers for Free

Share your goals and preferences with teachers and choose the Computer science class that suits you best.

calendar-icon

Book Your First Lesson

Arrange the time and place for your first class together. Once your teacher confirms the appointment, you can be confident you are ready to start!

Private lessonsComputer ScienceComputer Science in Douala

5 computer science teachers in Douala

0 teachers in my wish list
|
+–

5 computer science teachers in Douala

Meet even more great teachers. Try online lessons with the following real-time online teachers:
Léon - Douala, Cameroon18€
18€Home lessons in mathematics and computer science and physics
Trusted teacher: 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
Math · Physics · Computer science
Translate this text using Google Translate.
star icon
active star icon
(22 reviews)
Robert - Uccle, BelgiumRecently active39€
39€Excel lessons, at your place, at my place or remotely, at your best convenience!
Trusted teacher: As a Franco-Belgian management teacher, I give Excel lessons with passion! Whether remotely or face-to-face, I offer many examples and exercises to accompany you. I travel without problem throughout the region of Brussels and its surroundings, for lessons of at least 2 hours. For France, courses are only given remotely. Here are some key words that will be covered in my classes: Scenario analysis, Year, Rounding, Today, Bdnb, Bdnbval, Bdsum, Search, Column, Copy/paste in values, Copy/paste with transposition, Consolidation, Date, Datedif, Determat, Dollar, Right, Righterg, Equiv, Esterror, Estna, Frequency, Filter (simple and advanced), Format of cells, Left, Large.Value, Printing of documents, Index, Indirect, Inversemat, Day, Weekday, Line, Matrix, Max, Maxa, Max.Si, Min , Mina, Mina.If, Formatting of cells and ranges, Month, Average, Average.If, Nb, Nb.If, Nbval, Naming of cells and ranges, No, Small.value, Product, Productmat, Protection of cells, Lookup (Lookup), Lookupv (VLookup), Lookuph (HLookup), If (If), If.Not.Disp, If.Conditions, Iferror, Sum, Sumproduct, Sum.If, Sum.If.Set, Substitute , Pivot tables, Sorting, Cell locking Do not hesitate to contact me to organize your lessons according to your needs and availability. Together, we will develop your Excel skills in an efficient and personalized way.
Computer science
Translate this text using Google Translate.
star icon
active star icon
(1 review)
Vincent - La Celle-sous-Gouzon, FranceRecently active32€
32€Cambridge IGCSE / GCSE /A-Levels / O-Levels / Checkpoint in Computer Science & Information Technology (ICT)
Trusted teacher: With over seven years of experience in teaching Computer Science & Information Technology (ICT), I have developed a strong expertise in delivering high-quality education across multiple internationally recognized curricula, including Cambridge IGCSE, GCSE, A-Levels, O-Levels, and Checkpoint. My passion lies in equipping students with coding, cybersecurity, and digital literacy skills, ensuring they are well-prepared for the evolving demands of the digital world. Expertise & Teaching Areas: ✅ Programming & Software Development: Python, Java, C++ ✅ Cybersecurity: Ethical hacking, data protection, network security ✅ Digital Literacy: ICT applications, online safety, cloud computing ✅ Data Science & AI: Data analysis, machine learning fundamentals ✅ Web Development: HTML, CSS, JavaScript Curriculum & Pedagogical Experience: 🔹 Cambridge IGCSE & GCSE ICT & Computer Science – Teaching core and extended syllabi, focusing on programming logic, databases, and networking. 🔹 Cambridge A-Levels & O-Levels Computer Science – Preparing students for advanced computing concepts, problem-solving, and algorithm development. 🔹 Cambridge Checkpoint ICT – Building foundational skills in digital technology and computer applications. Professional Impact: 📌 Mentored students to achieve top grades in Cambridge ICT & Computer Science exams. 📌 Developed interactive lesson plans integrating real-world applications of technology. 📌 Conducted coding boot camps and cybersecurity workshops to enhance practical learning. 📌 Guided students in project-based learning, including app development and website design. With a strong commitment to student-centered learning and technological innovation, I am dedicated to shaping future tech leaders and empowering learners with skills relevant to careers in technology, data science, and software development.
Computer science · Information technology
star icon
active star icon
(3 reviews)
Izhar - Amsterdam, NetherlandsRecently active23€
23€HTML Classes for beginners and intermediates (You can even build your website on your own)
Trusted teacher: HTML is the standard markup language for Web pages. With HTML you can create your own Website. In simple words we can say, easiest and the best method to create a website. In the course duration, I'll be giving you live practical exposure so that you can actually experience and master over the concepts of HTML tags. Having years of work experience, I know how to start and build your concepts at a good pace. With the completion of this course, you'll be ready to build your own website. I am providing you a brief summary of our course which we generally follow but that doesn't mean that I am bound to just this much content. In case you have any doubt for any other specific topic related to the subject, you could always come up to me or you need any help in your assignments or projects, you are always welcome. Here is a brief overview of the topics we'll be covering : Introduction to HTML HTML Elements HTML Attributes HTML Headings HTML Paragraphs HTML Formatting HTML Fonts HTML Styles HTML Links HTML Images HTML Tables HTML Lists HTML Forms HTML Frames HTML Iframes HTML Colors HTML Colornames HTML Colorvalues HTML Quick List HTML Layout HTML Doctypes HTML Head HTML Meta HTML Scripts HTML Entities HTML URLs HTML URL Encode HTML Media HTML Audio HTML Object HTML Video HTML YouTube HTML GeoLocation HTML WebStorage HTML SSE HTML WebWorkers HTML Canvas HTML Plug-ins In case you have any query, please feel free to contact me. Give yourself a chance for a better future. All the best
Computer science · Computer programming · Computer engineering
star icon
active star icon
(1 review)
Imad - Tangier, MoroccoRecently active11€
11€Algorithm and programming 1 (The essential bases of programming: Algorithms)
Trusted teacher: Master pseudo-code algorithms in this hands-on course with dozens of different algorithms In this course, you will learn the basics of computer programming through the fundamental subject taught in all higher schools of computer science: algorithms. This is the initial stage of your learning to become a computer scientist (programming) First we will see a broad introduction to computer programming, and we will explain what algorithms are. Then, you will learn the language of computer scientists by studying "pseudo-code", and you will learn all the concepts of computer science through a multitude of practical exercises. The topics covered are very broad and comprehensive: Introduction - Algorithm Syntax - data type and Variables - The operators - The instructions - Conditions - The repetitive structure (loops) - The tables - Research techniques - Sorting algorithms - dichotomous search - Functions - The procedures - Recursion -complexity - Introduction to the C language - ... Your first programs... Finally, you will start programming by creating several algorithms in a specific programming language (here, C language). These algorithms are applicable in all programming languages. The goal... With more than 8 hours of e-courses, quizzes, and an assessment, you will have what you need to continue your learning of computer programming and advance towards your future profession. Who is this course for? Beginner in programming Retraining Computer science students or future students Thanks and see you soon ! IMAD
Computer programming · Algorithms · Computer science
Translate this text using Google Translate.
Zhane - Battersea, United KingdomRecently active40€
40€Cyber Security and IT Consultancy Development Class
### **Junior Level (Ages 11-14)** #### Module 1: Introduction to Cyber Security - **Week 1-2: Basics of Cyber Security** - What is cyber security? - Importance of cyber security in daily life - Common cyber threats (e.g., phishing, malware) - **Week 3-4: Safe Internet Practices** - How to create strong passwords - Recognizing suspicious online behavior - Safe use of social media #### Module 2: Introduction to Consultancy - **Week 5-6: Basics of Consultancy** - What does a consultant do? - Types of consultancy (e.g., IT consultancy, management consultancy) - Basic problem-solving techniques - **Week 7-8: Communication Skills** - Basics of effective communication - Listening skills and giving feedback - Role-playing exercises #### Module 3: Basic Cyber Security Tools and Techniques - **Week 9-10: Introduction to Encryption** - Basics of encryption and why it's important - Simple encryption activities - **Week 11-12: Cyber Security Software** - Overview of anti-virus and anti-malware software - Hands-on practice with basic cyber security tools #### Module 4: Cyber Security Projects - **Week 13-14: Group Projects** - Working on small cyber security projects - Presenting findings and solutions - **Week 15-16: Reflect and Review** - Reviewing key concepts learned - Feedback and assessment --- ### **Intermediate Level (Ages 15-17)** #### Module 1: Advanced Cyber Security Concepts - **Week 1-2: Understanding Cyber Attacks** - Types of cyber attacks (e.g., DDoS, ransomware) - Anatomy of a cyber attack - **Week 3-4: Network Security** - Basics of network security - Firewalls and intrusion detection systems #### Module 2: Consultancy Skills - **Week 5-6: Advanced Consultancy Techniques** - Consulting frameworks (e.g., SWOT analysis) - Case studies of cyber security consultancy - **Week 7-8: Client Interaction** - Understanding client needs - Role-playing client-consultant scenarios #### Module 3: Practical Cyber Security Skills - **Week 9-10: Ethical Hacking Basics** - What is ethical hacking? - Basic ethical hacking techniques and tools - **Week 11-12: Incident Response** - Responding to a cyber incident - Creating an incident response plan #### Module 4: Cyber Security Projects - **Week 13-14: Group Cyber Security Projects** - Working on intermediate cyber security challenges - Presenting solutions and findings - **Week 15-16: Reflection and Assessment** - Reviewing key concepts and projects - Feedback and improvement areas --- ### **Senior Level (Ages 18-21)** #### Module 1: Professional Cyber Security Practices - **Week 1-2: Advanced Threat Analysis** - Identifying and analyzing advanced threats - Case studies of significant cyber attacks - **Week 3-4: Cyber Security Policies and Governance** - Understanding cyber security policies - Developing and implementing cyber security policies #### Module 2: Advanced Consultancy Skills - **Week 5-6: Strategic Consulting** - Developing long-term strategies for clients - Advanced consulting methodologies - **Week 7-8: Business Development in Cyber Security** - Creating business models for cyber security services - Pitching cyber security solutions to clients #### Module 3: Specialized Cyber Security Skills - **Week 9-10: Advanced Ethical Hacking** - In-depth ethical hacking techniques - Conducting penetration testing - **Week 11-12: Cyber Forensics** - Basics of digital forensics - Tools and techniques for forensic analysis #### Module 4: Capstone Project and Professional Skills - **Week 13-14: Capstone Cyber Security Project** - Large-scale project addressing a real-world cyber security issue - Collaboration with local businesses or organizations - **Week 15-16: Professional Skills** - Advanced communication and presentation skills - Professional ethics in cyber security --- ### **Supplementary Activities** - **Workshops and Guest Lectures** - Regular workshops with industry professionals - Guest lectures from cyber security experts and consultants - **Competitions and Hackathons** - Participation in local and national cyber security competitions - Hosting cyber security challenges and hackathons --- This syllabus aims to provide a comprehensive education in both cyber security and consultancy, ensuring that students gain the necessary skills and knowledge to excel in these fields.
Computer science
star icon
active star icon
(24 reviews)
Adam - Paris, France26€
26€Basic concepts of algorithms and data structures in computer science
Trusted teacher: Online Course: Basic Concepts of Algorithms and Data Structures Duration : - 60 minutes: condensed format to introduce fundamental concepts with targeted exercises. - 90 minutes: extended format to explore concepts in depth, solve complex problems, and include an interactive question-and-answer session. --- General description This course is designed for students and professionals who are new to computer science, as well as those who want to solidify their foundation in algorithms and data structures. It provides a clear and practical introduction to the essential tools for solving problems effectively, by learning how to design and analyze algorithms. Whether you are preparing for an exam, a technical interview, or want to improve your programming skills, this course will guide you in understanding theoretical concepts and their practical application. --- Educational objectives At the end of the course, participants will be able to: 1. Understand the fundamental concepts of algorithms: sorting, searching, time complexity. 2. Master key data structures: arrays, lists, stacks, queues, trees, and graphs. 3. Solve problems by choosing appropriate data structures and algorithms. 4. Analyze and optimize the performance of algorithms. --- Course syllabus 1. Introduction (5-10 min) - Presentation of the objectives and concepts covered. - Importance of algorithms and data structures in computer science. 2. Fundamental concepts (20-30 min) - Definitions and roles of algorithms and data structures. - Temporal and spatial complexity: basic notions (Big O). - Basic data structures: arrays, lists, and dictionaries. 3. Practical application and examples (30-40 min) - Simple sorting implementation (insertion sort, bubble sort). - Search example (linear search, binary search). - Manipulation of stacks and queues through practical exercises. - Bonus for the 90 min format: Exploration of trees and graphs (simple example of a route). 4. Q&A and conclusion (5-10 min) - Review of the concepts covered. - Tips for continuing to practice and progress. - Suggestions for personal projects to apply the knowledge acquired. --- Teaching methodology - Interactive learning: a combination of theoretical explanations and practical applications. - Concrete examples: each concept is illustrated by practical cases and guided exercises. - Adaptation to needs: the courses are adjusted to the level and objectives of each participant, with a focus on the most relevant aspects. --- Target audience This course is aimed at: - Computer science students wishing to strengthen their mastery of the basics before exams or projects. - Programming beginners who want to understand the essential mechanisms behind problem solving. - Professionals preparing for technical interviews or seeking to improve their understanding of algorithms. --- Benefits of this online course - Personalized support from an experienced trainer. - Educational materials and practical exercises accessible after the session. - Flexible hours to fit your schedule. - Progressive approach to facilitate learning, even for beginners. Develop your skills in algorithms and data structures today to efficiently solve the complex problems of tomorrow! ---
Tutoring · Computer science · Algorithms
Translate this text using Google Translate.
Showing results 1 - 25 of 11991 - 25 of 1199
Next »»

Our students from Douala evaluate their Computer Science teacher.

To ensure the quality of our Computer Science teachers, we ask our students from Douala to review them.
Only reviews of students are published and they are guaranteed by Apprentus. Rated 4.8 out of 5 based on 83 reviews.

Python Step by step tutorial for beginners and intermediate (Amsterdam)
Izhar
rating star
rating green star
Izhar is an excellent tutor. He is very professional, knowledgeable, enlightening, insightful and adaptable/receptive to individual student needs. My tutoring session with him was really amazing and transformative for me and I highly recommend him. He keeps his lessons effective, engaging and fun. He customizes classes based upon your level of understanding. He conveys his knowledge of complex material in a manner which is easily understandable. If you want someone to work with you and ensure you progress like I have, go with Izhar.
Review by DANNY
Tutor for Math, Physics, and Mechanical/Material Engineering courses (The Hague)
Reza
rating star
rating green star
Extremely professional and knowledgeable with any problem that I have had. Reza is always polite, friendly and always shows great patience, which I believe is of the highest importance when learning difficult subjects. I highly recommend him as a teacher!
Review by EDEN
Math / Stat / Proba, Physics / Chemistry, and Bio, At Your Place, At My Place, or Remotely (Dilbeek)
Robert
rating star
rating green star
We are happy with Mr Robert , now we have him frequently for our kids
Review by EUNICE

You are here

Private lessons
Computer Science
Computer Science in Douala
map iconMap