click tracking

(24) Private Computer Tutors offering lessons, class and homework help in Maple Valley

Find the best Maple Valley Computer home tutoring providers with great ratings, reviews and qualifications!


Purushottam

Premedia Guru

Summary of Qualifications Presentation Skills Man Management Passion for Technology and Quality Train and Lead Teams Software Skills: MAC and PC ADOBE Creative Suite HTML 3DMax LCMS MSOffice Education Pittsburg State University, Pittsburg KS Master of Science in Technology with Academic Honors, Graphic Communication Management, Dec 2008,GPA 4.0 Published Research for Effective color gamut in Transpromo documents (EDSF funded) University of Pune, India. Bachelor of Engi... Read more


Vinni

Highly-Qualifed and Engaging: Writing, English, Biology and Chemistry

Welcome Prospective Students and Parents!! I have 3000+ hours of experience tutoring English, writing, and reading and a 3000+ hours tutoring general computers, biology, and chemistry. Overview: Over the course of the last few years, I have tutored grade, middle and high school students in writing, language, biology, chemistry and college board exam preparation (SAT, AP). I have also worked with corporate employees on improving their expository writing and speaking skills. Additionally, I h... Read more


Mary

AutoCAD Lessons

I graduated from the University of Washington in Seattle. I have over 27 years of experience in the healthcare architecture/design industry. I have over 35 years of experience using AutoCAD software (starting with Release 9 in 1982). I use AutoCAD on a daily basis in my A/E firm. I have served as CADD Director, as well as assisted other CAD Managers with AutoCAD and Revit setup for previous firms. I've used AutoCAD 2D/3D during design charettes for all projects, client presentations and desig... Read more


Shaojun

Worked on Machine Learning at Google, Facebook, Amazon, etc. PhD in AI

About me: ========= I teach (1) *Theory of Computation* (a) Automata Theory: DFA, NFA, regular language, pumping lemma for regular languages, prove some languages are not regular; CFL, CFG, Pushdown automata; (b) Computability Theory: Turing Machines, how Turing machines work, decidable and undecidable languages, the halting problem, the reducibility and mapping reducibility technique, prove some languages are undecidable; (c) Complexity Theory: problems in P, problems in NP, NP-complete pr... Read more


Other Locations

Can't find a tutor? Try another subject.