College Computer Science Tutor Needed

CS 330 Tutor Job Description

Tutor student in CS 330: Formal Methods and Models

Introduction to Formal Languages and Automata Theory, an introductory course on formal language theory and mathematical logic foundations underlying computer science.
• Course covers formal languages, grammars, automata, logic, computability, and proof methods relevant to compilers, databases, and software engineering.
• Explain key concepts such as propositional logic, predicate logic, induction, program verification, regular/context-free languages, finite automata, pushdown automata, and Turing machines.
• Assist student in understanding lectures, reading assignments, and solving logic and language definition problems.
• Support student in mastering formal mathematical proofs using deduction, induction; solving problems involving language grammar definitions, automata design, and proofs of language class properties.
• Hold office hours and provide personalized assistance based on student’s needs
• Assist student in completing programming assignments for CS 330 to reinforce understanding of formal language and automata theory concepts.
• Programming assignments provide practical experience with automata, grammar, and regular expression design.
• Explain assignment requirements and help student debug issues with their automata, grammar, expression, and machine designs.
• Ensure assignments meet specifications and fulfill course objectives.
• Maintain communication with student and instructor to provide progress updates and resolve any questions.
• Have expertise in programming and strong grasp of theoretical concepts covered in the course.

Course Title: CS 330: Formal Methods and Models
Course Description:
This course provides an introduction to formal methods and models in computer science, emphasizing on mathematical logic, discrete mathematics, and theoretical computer science. The course is designed to equip students with the necessary mathematical background for understanding and applying formal methods in various areas of computer science, including software engineering, programming languages, and algorithms.
Course Objectives:
1. Understand and apply mathematical logic and discrete structures.
2. Learn about formal languages, automata, and grammars.
3. Gain a basic understanding of complexity theory and computability.
4. Develop skills in formal reasoning and proof techniques.
5. Apply formal methods to solve problems in computer science.
Course Topics:
• Propositional and Predicate Logic
• Set Theory
• Relations and Functions
• Graph Theory
• Formal Languages and Automata
• Grammars and Parsing
• Turing Machines
• Complexity Theory and NP-Completeness

*Experience Tutoring Required.
*Experience assisting students with ADHD a plus.
*Include your contact email in your response