成人大片

Vue d'ensemble

Informatique (Sci) : Mathematical tools (binary numbers, induction, recurrence relations, asymptotic complexity, establishing correctness of programs), Data structures (arrays, stacks, queues, linked lists, trees, binary trees, binary search trees, heaps, hash tables), Recursive and non-recursive algorithms (searching and sorting, tree and graph traversal). Abstract data types, inheritance. Selected topics.

Terms: Automne 2017, Hiver 2018

Instructors: Langer, Michael (Fall) Gonzalez Oliver, Carlos; Waldispuhl, J茅r么me (Winter)

• 3 hours

• Prerequisites: Familiarity with a high level programming language and CEGEP level Math.

• Students with limited programming experience should take COMP 202 or equivalent before COMP 250. See COMP 202 Course Description for a list of topics.