Sort by
Refine Your Search
-
Listed
-
Category
-
Program
-
Field
-
communication skills in English Application Process: We invite interested candidates to submit an application via Workday. Please include a cover letter, CV, and names/contact information for 3 references
-
, Redshift, S3). Intermediate proficiency in managing application servers and web servers (e.g. Apache HTTP, Apache Tomcat, WebLogic). Strong understanding of Internet protocols (e.g. HTTP, SSL, WebDAV, SMTP
-
College is a friendly, welcoming and informal community that places a high priority on student support services and encourages diversity. For more information on New College, see http
-
programming. Students are required to have some programming experience in a compiled language (Fortran, C, C++). The course uses C++ as the programming language. Number of Positions: 1 Estimated course
-
University of Toronto | Downtown Toronto University of Toronto Harbord, Ontario | Canada | 2 months ago
. Course number and title: ITA315Y5Y Italian Theatre: 19th-20th Century Course description: (Offered in English, performances in Italian) A study of 19th- to 21st-century Italian plays and playwrights
-
. Further details regarding the required level of French language proficiency for Occupational Therapist in Quebec can be found here: https://www.oeq.org/ergotherapeutes/l-ordre-et-moi/mon-inscription-au
-
for more information and support, please visit UBC’s Centre for Workplace Accessibility website at https://hr.ubc.ca/health-and-wellbeing/workplace-accessibility/centre-workplace-accessibility or contact
-
successful applicant will teach in English in the undergraduate Landscape Architecture program. Courses to be taught may include: Landscape Construction, Grading and Drainage, Construction and Detailing, Green
-
successful applicants will teach in English in the undergraduate Landscape Architecture program. Subjects may include: Landscape Construction, Grading and Drainage, Construction and Detailing, Green
-
to Computer Science. Mathematical induction; correctness proofs for iterative and recursive algorithms; recurrence equations and their solutions; introduction to automata and formal languages. This course assumes