Trusted teacher

1Students

Do you want to captivate your audience with powerful, clear, and modern presentations? This course is for you! Objective: To teach you how to master PowerPoint (Microsoft 365) from A to Z to create professional, visual and dynamic presentations, to bring your classes, pitches, conferences, etc. to life. Whether you are: - Beginners who have never used PowerPoint, - Students, teachers, trainers, - Professionals wishing to improve their presentations, - or simply wanting to present your ideas effectively with visual aids, THIS COURSE IS FOR YOU! What will you learn? - Getting started with the PowerPoint interface and its key tools - Creation and formatting of slides (texts, images, graphics, videos) - Use of themes, templates, slide masters - Animations, transitions, timing and scripting of a presentation - Integration of multimedia content to boost your message - Design tips for a clear, elegant and professional look - Preparation for the oral presentation and presentation of an impactful slide show Teaching method: 100% practical course, based on real-life cases, guided exercises, and the gradual creation of a comprehensive presentation. Personalized support tailored to your level and goals. ⏱️ Duration: Adapted to your needs (intensive or spread out training) Join this course and turn your ideas into impactful presentations!

Trusted teacher

Preparation course for the official Probatory Baccalaureate and BEPC exam also intermediate class on all scientific subjects and in computer bonus. Knowledge in outdoor classes is a plus but otherwise a brief summary of the course will be made before starting the lesson

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

Trusted teacher

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.....

Trusted teacher

23Students

I'm a working MEP engineer, currently building Python automation for Revit workflows daily - plan checks, model coordination, and repetitive drafting tasks. I teach other engineers, architects, and BIM professionals how to do the same, using pyRevit and real project workflows, not toy examples. Topics include: pyRevit fundamentals and setup Automating repetitive Revit tasks (model checks, plan generation, data extraction) Writing custom scripts for your firm's specific workflows Applying Python automation to real MEP/BIM projects

Trusted teacher

6Students

Are you looking for efficiency, creativity and productivity in your daily tasks? Do not look any further. Microsoft Office is there to meet all your expectations. Why choose Microsoft Office? Create with Power: Word, Excel, PowerPoint and many other applications give you powerful tools to bring your ideas to life, whether it's for a professional document, a financial dashboard or a stunning presentation. Collaborate with ease: OneDrive and Teams allow you to collaborate with your colleagues or friends, no matter where you are. Work together in real time, share files and communicate easily. Save Time with Automation: Excel simplifies complex tasks with smart formulas, while Outlook organizes your emails and calendar so you can focus on what matters. Advanced Security: Protect your data and privacy with advanced security features, such as two-step verification and access management. Advanced Programming: As a specialist, I master programming in VBA (Visual Basic for Applications) to automate your tasks and personalize your Office applications. Additionally, in the latest version of Microsoft Office you also have the option to program in Python, a language that I also master. Available Everywhere: Whether you're in the office, on the road, or at home, Microsoft Office is accessible on all your devices, allowing you to work wherever and whenever you want. Join the Microsoft Office Revolution! Don't let everyday challenges slow you down. Invest in the power of Microsoft Office and unlock your potential. Transform the way you work, create with ease, and reach new heights with Microsoft Office.

Trusted teacher

11Students

You will learn Systematic Reasoning & Logical Thinking which is a requirement for entering Computer Science program in many universities. The book “Delftse Foundations of Computation” especially its second chapter will be the main source of our lesson, but other more in-depth books will be also covered if you want to improve even further on logical thinking. The topics in our lesson include: • Propositional Logic: Logical operators; Precedence rules; Logical equivalence; Implications in English; Exclusive or; Universal operators; Classifying propositions • Boolean Algebra: Substitution laws • Logic Circuits: Logic gates; Combining gates to create circuits; From circuits to propositions; Disjunctive Normal Form; Binary addition. • Predicate Logic: Predicates; Quantifiers; Tarski’s world and formal structures; • Deduction: Valid arguments and proofs; Proofs in predicate logic If you have any additional questions before starting a class, please feel free to ask me. I am here to assist! :)

Trusted teacher

5Students

Do you aspire to maximum efficiency, limitless creativity and unparalleled productivity in the Gulf region? Let us guide you to excellence with Microsoft Office. Why Choose Microsoft Office? Harness Your Creativity: With Word, Excel, PowerPoint and more, you'll have powerful tools to bring your projects to life, whether creating corporate documents, developing cutting-edge financial tables or delivering presentations breathtaking. Save Time with Automation: Excel simplifies complex tasks with its smart formulas, pivot tables and many other innovative features. Accessible Anywhere: Whether you're in the office, on the road, or at home, Microsoft Office is available on all your devices, allowing you to work wherever and whenever you want. Join the Microsoft Office Revolution! Do not accept compromises in your daily professional life. Invest in the power of Microsoft Office and unlock your full potential. Transform the way you work, create with ease, and reach new heights with Microsoft Office. Register now to master Microsoft Excel, Microsoft Word and Microsoft PowerPoint at all levels and drive your business to excellence in the Gulf region.

Trusted teacher

3Students

I lead individual and group lessons. Why is chess for you? Chess is a game played by prominent statesmen, military leaders and IT specialists. Chess is an intellectual exercise in an interesting game form with a proven positive impact on the quality of life. Chess is the only sport that has grown globally during the quarantine. Technique: evoke positive emotions through chess, motivate Materials: The author uses known information, namely the games of the best chess players in the world, including Ukraine. I have candidacy points (victory over KMS in the tournament) in the semifinals of Ukrainian classical chess under 14 and 16 years old. My international FIDE rating: std 1814, rapid 1821, blitz 1759 My national rating according to Chess Federation of Ukraine: 1949 Helped a 5 year old student complete 4th grade (grade D). I teach in English, Ukrainian and Russian