Teresa Leyk, Ph.D. - CS Course Webpages - Texas A&M University

Teresa Leyk, Ph.D.
Senior Lecturer
Department of Computer Science &
Engineering (CSE)
901E Richardson Bldg.
Texas A&M University
College Station, TX 77843-3112
Office phone: 979-845-4456
Email: teresa@cse.tamu.edu
URL: courses.cse.tamu.edu/teresa/
Education
• PhD in Mathematics, Australian National University, Canberra, Australia 1998
• MS in Computer Science, University of Warsaw, Department of Mathematics,
Computer Science & Mechanics, Warsaw, Poland 1979
Professional Qualifications
• Senior Lecturer at CSE Department, Texas A&M University,
College Station, TX
2003–present
Taught courses on: programming in C++; data structures and algorithms using C, C++
and Java; scientific computing.
Supervised the Peer Teacher program to help increase CSE students retention sponsored by
Texas Higher Education Coordinating Board Texas Technology Workforce Development
grant (2007–2008) and Computer Science Department (2008–present).
• Lecturer at CSE Department, Texas A&M University,
College Station, TX 1997–2003
Taught courses on: data structures and algorithms using C and Java; scientific computing.
• Research Assistant, Australian National University, Canberra, Australia 1993–1997
Did research and course work in mathematical modeling and simulation on parallel computers.
Wrote routines for the numerical library called Meschach (distributed as a freeware package).
Designed and coded in C a package of numerical routines for solving stiff ordinary differential
equations.
• Certified Teacher of Mathematics, Warsaw, Poland 1981–1989
Taught mathematics and introduction into computer programming.
Industry Work Experience
• Programmer in BUMAR Research Institute, Warsaw, Poland 1979–1983
Duties: developing, maintaining and implementing numerical software (primarily numerical
packages in Fortran for solving ordinary differential equations).
1

Grants & Awards
• Selected to the final phase of the Fall 2009 Student Led Award for Teaching Excellence
• Undergraduate Faculty Teaching Excellence Award, 2007
• PhD scholarship, Australian National University, 1994–1996
Publications
• “Solving linear and weakly nonlinear parabolic differential equations by Krylov approximation
method”, with D. Stewart, in Proceedings of CTAC93, ANU, Canberra, 1993, H. Gardner,
D. Singleton, and D. Stewart, eds., Singapore, 1994, World Scientific, pp. 329–337.
• “Error estimates for Krylov approximations of matrix exponentials”, with D. Stewart, J. Comput.
Appl. Math. 72 (1995), pp. 359–369.
• “Numerical solving of a free boundary phase field model using Krylov subspace method”, with
S. Roberts, in Proceedings of CTAC95, Melbourne, 1995, R. May and A. Easton, eds., Singapore,
1996, World Scientific, pp. 479–487.
Professional Membership and Services
• Member, CSE ABET Committee, responsible for Former Student Survey (2002–present)
• Member, CSE Undergraduate Curriculum Committee (2003–present)
• Member of CSE Undergraduate Curriculum: working on remodeling and updating undergraduate
courses (2005–2006).
• Member of Undergraduate Recruiting Committee:
(2005–2006).
responsible for Freshman Orientation
• Member of ACM and ASEE.
Courses Approved to Teach
• CPSC 210: “Data Structures”
Methods for organizing data; design of algorithms for efficient implementation and manipulation
of data structures
• CPSC 211: “Data Structures and Their Implementations”
Specification and implementation of basic data structures and abstract data types—linked
lists, stacks, queues, trees and tables; performance tradeoffs of different implementations;
asymptotic analysis of running time and memory usage; compares and contrast objectoriented
language (typically, Java) and non-object-oriented languages (typically, C); emphasis
on adherence to good software engineering principles.
• CPSC 311: “Analysis of Algorithms”
Design of computer algorithms for numeric and non-numeric problems; relation of data structures
to algorithms; analysis of time and space requirements of algorithms; complexity and
correctness of algorithms.
• CPSC 442: “Scientific Programming”
Introduction to numerical algorithms fundamental to scientific and engineering applications of
computers; elementary discussion of error; algorithms, efficiency; polynomial approximations,
quadrature and systems of algebraic and differential equations.
2

• CSCE 206: “Structured Programming in C”
Basic concepts, nomenclature and historical perspective of computers and computing; internal
representation of data; software design principles and practice; structured and object-oriented
programming in C; use of terminals, operation of editors and executions of student-written
programs.
• CSCE 113: “Intermediate Programming and Design”
Continuation of ENGR 112; programming and design with C++; topics include design and
implementation of functions, classes, and class hierarchies; software development strategies;
error handling and exceptions; testing and debugging; type safety; strings; templates and the
STL; graphics and GUIs; mathematical computation; and principles of object-oriented programming.
Prerequisites: Knowledge of C++ programming, class design, portable graphics,
and parameterized types and their implementations.
• CSCE 221: “Data Structures and Algorithms”
Specification and implementation of basic abstract data types and their associated algorithms:
stacks, queues, lists, sorting and selection, searching, graphs, and hashing; performance tradeoffs
of different implementations and asymptotic analysis of running time and memory usage;
includes the execution of student programs written in C++.
• ENGR 112: “Foundations of Engineering II ”
Continuation of ENGR 111. Topics include, depending on the major: emphasis on computer
applications and programming and solids modeling using CAD tools or other software;
fundamentals of engineering science; advanced graphic skills.
3