Skip to Main Content

PT Lecturer Data Structures and Discrete Mathematics

Below you will find the details for the position including any supplementary documentation and questions you should review before applying for the opening.  To apply for the job, please click the Apply for this Job link.

Please Note: Internal Applicants (current benefits-eligible employees only) must login to the applicant portal before clicking “apply for this job” in order to access the internal application.

Northeastern University Employee Benefits

Northeastern University is an Equal Opportunity, Affirmative Action Educational Institution and Employer, Title IX University. All qualified applicants will receive consideration for employment without regard to race, color, religion, sex, national origin, disability status, protected veteran status, or any other characteristic protected by the law. Northeastern University is an E-Verify Employer.

Posting Details

Position Information

Position Title PT Lecturer Data Structures and Discrete Mathematics
Requisition Number PTFR000398
Division/College College of Computer and Information Science
Interdisciplinary Division/College
Location Silicon Valley
Full-Time/Part-Time Part Time
Benefits Eligible No
Posting Date 11/08/2017
Responsibilities

The College of Computer and Information Science invites applications for the position of Part-Time teaching faculty. Primary responsibilities will be teaching a lecture based course in the areas of data structures and discrete mathematics. We are looking for teaching during the spring 2018 semester. Salary is competitive and additional teaching opportunities are available. For more information about the program, please visit http://www.ccis.northeastern.edu/program/align-master-of-science-in-computer-science/

Qualifications

Candidates must have a MS degree in related field. PhD and teaching experience strongly preferred.

Additional Information

This introduces the mathematical structures and methods that form the foundation of computer science. The course studies structures such as sets, tuples, sequences, lists, trees, and graphs; Discusses functions, relations, ordering, and equivalence relations. Examines inductive and recursive definitions of structures and functions. Covers principles of proof such as truth tables, inductive proof, and basic logic and the counting techniques and arguments needed to estimate the size of sets, the growth of functions, and the space-time complexity of algorithms. Also, discusses data structures such as arrays, stacks, queues, lists, and the algorithms that manipulate them.

Documents Needed to Apply

Required Documents
  1. Curriculum Vitae
  2. Cover Letter
Optional Documents
  1. References
  2. Letter of Recommendation 1
  3. Letter of Recommendation 2
  4. Letter of Recommendation 3

Posting Specific Questions

Required fields are indicated with an asterisk (*).