vasundhra verma
AP Computer Science Principles taught interactively




Show all photos
vasundhra verma
Bachelors degree
/ 55 min
vasundhra - About your AP tutor
I have 10 years of experience as software Developer. Possesses a bachelor of Engineering in Computer Science. I have worked with multiple US based multi-national companies. I have worked as an engineer and as a trainer for many years now and received lot of positive feedbacks from my trainees and management.
AP tutor test prep specialities
Study Plans
GCSE (UK)
College Credit
State-Specific Standards (USA)
Test prep
Concepts learning
Australian Curriculum (AU)
Practice Exams
A-Levels (UK)
Provincial-specific curriculum (CA)
Advanced Placement (AP) Program (USA)
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
Teaching methodology
offering tutoring sessions along with taking up assignments on .NET. C#, OOPS concepts tohigh school, university graduates and entry level developers. I am flexible to work in any timezone depending upon the urgency of the class or project.
Proven strategies for exam success
90% of students say strategies boosted their confidence.
Strong focus on exam readiness
95% of parents report their child is more exam-ready.
Flexible scheduling for exam prep
90% of students find scheduling sessions stress-free.
vasundhra - also teaches
AP Computer Science A
AP Computer Science Principles

AP concepts taught by vasundhra
The Student and Tutor worked through a Unix file management assignment, practicing directory creation using `mkdir` and file editing with the `vi` editor. They also resolved a Java programming error related to conditional statements for identifying even numbers. The plan is to continue with the remaining Unix assignment questions and further Java practice in the next session.
VI Editor Basics for Text Files
Unix Directory Structure & Management
Java Conditional Statements & Modulo Operator (`%`)
The Tutor and Student reviewed linked list operations, traversal algorithms, and insertion sort for linked lists. The Student then spent significant time implementing and debugging `push` and `pop` methods for a `PlaneQueue` class in Python, simulating an air traffic control queue. The next session will cover Java.
Doubly Linked List Insertion
Doubly Linked List Removal
Linked List Traversal
Insertion Sort for Doubly Linked Lists
Linked Lists vs. Arrays for Sorting Algorithms
Implementing a Queue (FIFO) with a Linked List
The session focused on Python programming, guiding the Student through solving a problem involving `for` loops and `if-elif-else` conditions with the modulus operator. The Student also learned the distinction between `print` and `return` statements in functions and practiced building `add`, `subtract`, and `divide` functions, incorporating conditional logic to handle number order. These functions will be utilized for a future calculator application, and additional homework on `if` conditions and `for` loops was assigned.
Building Robust Arithmetic Functions: Logic for Positive Results
Handling Function Return Values
`print` vs. `return` in Functions
`and` Operator for Multiple Conditions
Conditional Logic (`if/else`) and Modulo Operator
`for` Loops and `range()` for Iteration
Function Definition and Parameters
Student and Tutor engaged in an extensive practice session on fundamental data structure operations. They started with singly linked list removal and search algorithms, then moved to understanding and applying append and prepend operations on doubly linked lists. The session involved numerous exercises to track list changes and pointer updates, concluding with plans to continue in the next class.
Singly Linked List: Search Algorithm
Singly Linked List: Remove After Operation
Doubly Linked List Structure
Doubly Linked List: Append Operation
Doubly Linked List: Prepend Operation
Doubly Linked List: Pointer Management
The Student and Tutor practiced Java programming by solving problems related to integer input, incremental output, and array reversal. Subsequently, they moved on to Data Structures, learning about the List Abstract Data Type and the mechanics of Singly Linked Lists, including append, prepend, and insert after operations. The session concluded with plans to continue the discussion the following day.
Java Arrays: Declaration
Population
and Reverse Traversal
Java Basics: Input
Output
and Control Flow
Abstract Data Type (ADT) - List
Singly Linked List Fundamentals
Student and Tutor collaborated on an academic assignment researching job opportunities in cloud computing, specifically an AWS engineer role. They focused on refining the essay's content, discussing strategies for referencing and managing technical detail, and identifying official AWS websites as appropriate sources. The student needs to complete the essay for submission.
Strategic Content Generation for Page Requirements
Understanding Core Skills for an AWS Engineer Role (General)
Structuring an Essay on Career Choice and Skill Alignment
Selecting Appropriate References for Cloud Computing Topics
The Critical Role of Referencing in Academic Writing
Practical aids used by AP tutor
AP Assessments
AP Practice worksheets
Presentations
Study Planner
Quizzes
Effective AP classes
Note taking
Mobile joining
Open Q&A
Parent feedback
Record lessons

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