Université de Hearst
Université de Hearst
Se connecter S'inscrire

Compiler and Algorithm Design

ESOF3251
Fermé
Contact principal
Lakehead University
Lakehead University
Thunder Bay, Ontario, Canada
Ayman Diyab
Ayman Diyab
Assistant Professor
(4)
4
Chronologie
  • octobre 25, 2022
    Début de expérience
  • novembre 19, 2022
    Project Scope Meeting
  • décembre 7, 2022
    Fin de expérience
Expérience
1 projets souhaités
Dates fixées par le expérience
Entreprises privilégiées
Thunder Bay, Ontario, Canada
Any
N'importe qu'elle industrie

Portée de Expérience

Catégories
Développement de logiciels Bases Matériel
Compétences
algorithms parsing automata theory regular expressions search algorithms algorithm design online communication sorting algorithm dynamic programming np hard
Objectifs et capacités de apprenant.es

Looking to elevate your organization, and bring it to the next level? Bring on students from Lakehead University to be your student-consultants, in a project-based experience. Students will work on one main project over the course of the semester, connecting with you as needed with virtual communication tools.

Students in this program focus on major concepts of compiler and algorithm design. Topics include: regular expressions, automata theory, syntactical analyzers, context free grammars and parsers, algorithms complexity, asymptotic analysis, summations, recurrences, intractability and NP-hard problems, sorting algorithms, searching algorithms, dynamic programming and greedy algorithms.

Apprenant.es

Apprenant.es
Premier cycle universitaire
Tout niveau
15 apprenant.es dans le programme
Projet
40 heures par apprenant.e
Les apprenant.es s'auto-attribuent
Équipes de 2
Résultats et livrables attendus

Deliverables are negotiable, and will seek to align the needs of the students and the organization.

Some final project deliverables might include:

  1. A 10-15 minute presentation on key findings and recommendations
  2. A detailed report including their research, analysis, insights and recommendations
Chronologie du projet
  • octobre 25, 2022
    Début de expérience
  • novembre 19, 2022
    Project Scope Meeting
  • décembre 7, 2022
    Fin de expérience

Exemples de projets

Students in groups of 3-5 will work with your company to identify your needs and provide actionable recommendations, based on their in-depth research and analysis.

Project activities that students can complete may include, but are not limited to:

  • Demonstrate a good understanding of the fundamental of parsing theory (regular expressions, deterministic finite automata, grammars, and grammar transformation techniques).
  • Algorithm complexity theory and the ability to carry out simple asymptotic analysis of algorithms, Polynomial/Non-Polynomial time/space complexity, tractable/intractable algorithms
  • Discuss the design of a compiler including its phases and components.
  • Design, implement and test a simple compiler (scanner, parser and code generator).
  • The use of front-end and back-end CASE tools.
  • The use of software development platforms.
  • Ability to develop and present a technical presentation with good use of audio-visual aids and clear logical language.
  • Ability to keeps the audience engaged throughout the presentation and to answer questions with confidence.

Critères supplé mentaires pour entreprise

Les entreprises doivent répondre aux questions suivantes pour soumettre une demande de jumelage pour cette expérience:

  • Q1 - Case à cocher
    A representative of the company will be available to answer questions from students in a timely manner for the duration of the project.
  • Q2 - Case à cocher
    A representative of the company will be available for a pre-selection discussion with the administrator of the course to review the project scope.