About the Role:
We are looking for a passionate and experienced Mathematics Teacher / Trainer who can teach the mathematical foundations Engineering students. The ideal teacher should be able to explain math concepts in a simple, practical, and beginner-friendly way so students can confidently understand topics like time complexity, recursion, graphs, trees, dynamic programming, probability, and algorithm analysis.
This role is suitable for someone who enjoys teaching, mentoring students, and connecting mathematics with real programming and problem-solving use cases.
Key Responsibilities:
· Teach mathematical foundations required for Computer Sciences.
· Explain concepts from basic level to advanced level in a student-friendly manner.
· Prepare lesson plans, assignments, quizzes, and practice worksheets.
· Help students understand problem-solving logic used in competitive programming and interviews.
· Conduct doubt-clearing sessions.
· Create structured learning material, notes, and examples.
· Evaluate student progress through tests and assignments.
· Coordinate with technical trainers if DSA/programming classes are conducted separately.
· Help students build confidence in mathematical thinking and logical reasoning.
Topics to Be Covered
· Basic Arithmetic and Number Sense
· Fractions, decimals, percentages
· Ratios and proportions
· Powers, roots, exponents
· Logarithms
· Modular arithmetic
· Divisibility rules
· Prime numbers
· GCD and LCM
Algebra
· Variables and expressions
· Linear equations
· Quadratic equations
· Inequalities
· Functions
· Sequences and series
· Arithmetic progression
· Geometric progression
Logarithms and Complexity Analysis
· Understanding logarithms
· Log base 2
· Growth rates
· Big-O, Big-Theta, Big-Omega basics
· Comparing O(1), O(log n), O(n), O(n log n), O(n^2), O(2^n), and O(n!)
Discrete Mathematics
· Sets
· Relations
· Functions
· Logic and truth tables
· Proof techniques
· Mathematical induction
· Recurrence relations
· Counting principles
Combinatorics
· Permutations
· Combinations
· Counting techniques
· Pigeonhole principle
· Inclusion-exclusion principle
· Applications in recursion, backtracking, and dynamic programming
Probability Basics
· Basic probability
· Conditional probability
· Independent events
· Expected value
· Applications in randomized algorithms and hashing
Graph Theory Basics
· Nodes and edges
· Directed and undirected graphs
· Weighted graphs
· Trees
· Paths and cycles
· Connected components
· Degree of a node
· Graph traversal concepts
· Real-world graph theory applications in DSA
Tree Mathematics
· Binary trees
· Height and depth
· Number of nodes in trees
· Balanced trees
· Complete and full binary trees
· Logarithmic behavior in trees
· Heap-related mathematical understanding
Recursion and Recurrence Relations
· Recursive thinking
· Base case and recursive case
· Recurrence equations
· Solving simple recurrences
· Recursion tree method
· Master theorem basics
Matrix and Geometry Basics
· Matrix basics
· Coordinate geometry
· Distance formula
· Slopes
· Grid-based problems
· Geometry used in coding problems
Required Qualifications
· B.Sc / M.Sc in Mathematics, Statistics, Computer Science, or a related field; or B.Tech / M.Tech with a strong mathematics background.
· Teaching experience in mathematics, aptitude, competitive exams, or computer science fundamentals.
· Experience teaching students preparing for coding interviews, GATE, GRE, CAT, engineering exams, or similar competitive exams is a plus.
Required Skills
· Strong understanding of mathematical fundamentals.
· Ability to teach concepts from scratch.
· Excellent communication skills in English.
· Telugu and Hindi communication skills are a plus.
· Ability to simplify difficult concepts.
· Good blackboard / whiteboard teaching skills.
· Ability to create worksheets, assignments, and tests.
· Patience to teach beginners.
· Interest in connecting math concepts with programming and DSA.
Preferred Skills
· Experience teaching engineering students or working professionals.
· Experience creating online course content.
· Ability to teach both offline and online.
Ideal Candidate Profile
We are looking for someone who can answer questions like:
· Why is binary search O(log n)?
· Why does merge sort take O(n log n)?
· How does recursion work mathematically?
· How many nodes can exist in a binary tree of height h?
· Why are graphs useful in real-world programming?
· How do permutations and combinations help in backtracking?
· How does probability help in hashing and randomized algorithms?
The ideal teacher should not just teach formulas, but should help students understand why the formula works.
Responsibilities in Course Development
· Math basics for absolute beginners.
· Logical reasoning and problem-solving.
· Discrete mathematics for DSA.
· Complexity analysis.
· Recursion mathematics.
· Graph and tree foundations.
· Probability and combinatorics for coding problems.
· Practice worksheets and assessments.
Work Location
Hyderabad, Telangana
Preferred areas: Hitech City, Madhapur, Kukatpally, Ameerpet, Gachibowli, Kondapur, Miyapur, Secunderabad. Online / hybrid options can also be considered.
Compensation
Compensation will be based on experience, teaching ability and mode of engagement. Possible engagement models include:
· Hourly payment
· Monthly salary
· Per-batch payment
· Weekend trainer model
· Course-content-development payment
· Revenue-sharing model for online/offline batches
How to Apply
Interested candidates can share:
· Updated resume
· Teaching experience details
· Subjects/topics taught previously
· Sample teaching video, if available
· Preferred mode: offline / online / hybrid
· Expected compensation
· Availability: weekdays / weekends / evenings
Contact Details:
Applogic Consulting.
8978886018 / 040-40066020
Email:[email protected]
Benefits:
Work Location: In person
