Teaching Assistant (Computer Science)
Seattle, Wa, Us
Teaching Content: Fundamental algorithms and data structures for implementation. Techniques for solving problems by programming. Linked lists, stacks, queues, directed graphs. Trees: representations, traversals. Searching (hashing, binary search trees, multiway trees). Garbage collection, memory management. Internal and external sorting. Key computational abstraction levels below modern high-level languages; number representation, assembly language, introduction to C, memory management, the operating-system process model, high-level machine architecture including the memory hierarchy, and how high-level languages are implemented. Fundamentals of enumeration, discrete probability, and applications of randomness to computing which is the foundation of Machine Learning and Artificial Intelligence. Hold office hours, tutor 100 students, and grade homework and exams.