Avni Goel
Coding Made Simple | Programming, Projects, Problem Solving & Debugging | Experienced Coding Tutor | Python, Java, Web Dev & Interview Prep




Show all photos
Avni Goel
Bachelors degree
/ 55 min
About your coding tutor - Avni
I’m Avni Goel, a coding tutor and technical trainer with experience in programming, cloud technologies, and software development. I mainly teach coding subjects including Python, Java, C#, HTML, CSS, JavaScript, data structures, algorithms, OOPs, databases, and full-stack development. I also help students with assignments, projects, interview preparation, and coding practice. My teaching style is practical, interactive, and beginner-friendly. I explain concepts step by step with simple examples and hands-on coding sessions so students can understand the logic clearly instead of just memorizing syntax. I focus on problem-solving, debugging, and building confidence in coding through practice exercises and real-world examples. I adapt my teaching approach according to the student’s level and learning speed. Whether a student is a beginner starting coding for the first time or an advanced learner working on projects and interview preparation, I provide personalized guidance and support. My goal is to make coding easy to understand, engaging, and enjoyable while helping students improve their technical skills, logical thinking, and confidence in programming.
Coding tutor specialities
Project help
Upskilling
Assignment help
Paired coding
Code Optimization
Code Review
Homework help
AI modules
Summary
Podcast
Quiz
Learnings
Flashcard
Spotlight
Zero Risk Guaranteed
15-days refund
Free tutor swap
No cancel fee
1-yr validity
24/7 support
Learner types for coding classes
Coding for kids
Coding for advanced
Coding for adults
Coding for beginners
Coding for intermediate
Hands-on learning
Students gain confidence applying coding skills to real projects.
Debugging and problem-solving focus
85% of students improve debugging skills.
Interactive debugging sessions
Students debug and improve their own code in real-time.
Avni - Coding tutor also teaches
Coding for kids
CSS

Coding concepts taught by Avni
The Student and Tutor reviewed and practiced algorithms for managing data within queues. They discussed the Student's attempt to sort a queue using an array, then delved into the specifics of the Bubble Sort algorithm. The Tutor subsequently demonstrated and explained an approach to sort a queue using three auxiliary queues, covering the iterative process of finding and placing smallest elements. They also addressed simpler queue operations like removing specific or all elements, and debriefed on a code debugging task. The plan is to work on more queue-related problems together in the next class.
Queue Sorting: Using Helper Queues
Optimized Element Swapping (Space)
Removing a Specific Element from a Queue
Queue Sorting: Bubble Sort Approach (with Arrays)
The session centered on preparing for an Engineering exam, where the Student and Tutor worked through several VHDL design and digital logic problems from a practice paper. They covered topics including logic circuit design for multiplication, shift registers, and switch control using XOR gates, as well as the basic architecture of FPGAs and boolean expression implementation using lookup tables. The Tutor provided guidance on elaborating explanations and diagrams to meet exam marking criteria, and the Student will share more practice papers for future sessions.
FPGA Core Architecture and Components
Boolean Algebra & Logic Implementation with LUTs
VHDL Fundamentals: Entity
Architecture
and Data Types
Combinational Logic Design Principles
Sequential Logic Design Principles (Shift Registers)
The Student and Tutor reviewed stack-related homework, focusing on finding the Kth element in a stack and the importance of copying the stack to maintain data integrity. The session then introduced queues, discussing their First-In, First-Out (FIFO) principle, core operations, and the difference between using inbuilt C++ libraries versus implementing custom queue functionalities. They practiced finding the second highest element in a queue, with the Tutor demonstrating an optimized single-loop solution, and discussed assigned queue-related homework questions.
Stacks: Efficient Kᵗʰ Element Retrieval
Introduction to Queues (FIFO)
C++ `std::queue` vs. Custom Queue Implementation
Optimized Second Highest Element in a Queue
The Student and Tutor reviewed an IT assessment paper, discussing its structure and requirements, particularly for the first part. They collaboratively worked on defining and justifying recommendations for computer hardware, peripherals, operating systems, and key software for different user types within a digital learning hub scenario. The next step involves creating a network diagram for the second part of the assessment.
Assessment Task 1.1: IT Infrastructure Recommendations
Hardware & Peripherals Selection by User Role
Operating System & Core Software Deployment
Network Architecture & Security Components
Strategic Justification for IT Choices
Introduction to Network Diagramming
The session focused on C++ programming, specifically tackling problems involving data structures like stacks and arrays. The Student practiced reversing stack elements using an array and implemented a solution to remove duplicate elements from a stack, debugging challenges related to array manipulation and dynamic stack sizing. Homework was assigned on similar problems (6, 13, 14), and the Tutor explained the crucial role of Data Structures and Algorithms in software engineering interviews and career progression.
Dynamic Size of Stacks vs. Fixed Size of Arrays During Operations
Importance of Data Structures and Algorithms (DSA) for Career Growth
Removing Duplicates from a Stack using an Array (Marking Technique)
Reversing a Stack with an Auxiliary Array
`break` vs. `continue` in Loops
The student and Tutor reviewed recursion problems, specifically a 'sum of digits' challenge, and then delved into an optimized solution for the 'Next Greater Element' problem using stacks. They debugged the stack-based algorithm, focusing on time complexity, and the Student received new stack-related problems for homework.
Recursion for Sum of Digits
Algorithm Efficiency: Time Complexity
Optimizing NGE with a Monotonic Stack (O(N))
Next Greater Element (NGE) Problem
Stack Data Structure Fundamentals
Approach & tools used by coding tutor
NetBeans
Postman
Android Studio
PyCharm
Xcode
Jupyter Notebook

Programming tutors on Wiingy are vetted for quality
Every tutor is interviewed and selected for subject expertise and teaching skill.
