CPSC331
Download as PDF
Data Structures, Algorithms, and Their Analysis
Computer Science
SC - Faculty of Science
Subject
CPSC - Computer Science
Description
Fundamental data structures, including arrays, lists, stacks, queues, trees, hash tables, and graphs. Algorithms for searching and sorting. Introduction to the correctness and analysis of algorithms. For computer science majors and those interested in algorithm design and analysis, information security, and other mathematically-intensive areas.
Prerequisite(s): 3 units from Computer Science 251, Mathematics 271 or 273; and 3 units from Computer Science 219, 233, 235, Computer Engineering 335, 339 or Software Engineering for Engineers 337.
Antirequisite(s): Credit for Computer Science 331 and 319 will not be allowed.
Prerequisite(s): 3 units from Computer Science 251, Mathematics 271 or 273; and 3 units from Computer Science 219, 233, 235, Computer Engineering 335, 339 or Software Engineering for Engineers 337.
Antirequisite(s): Credit for Computer Science 331 and 319 will not be allowed.
Course Attributes
Fee Rate Group(Domestic) - A, Fee Rate Group(International) -A, GFC Hours (3-2T)
Courses may consist of a Lecture, Lab, Tutorial, and/or Seminar. Students will be required to register in each component that is required for the course as indicated in the schedule of classes. Practicums, internships or other experiential learning modalities are typically indicated as a Lab component.
Component
LEC
Component
TUT
Units
3
Repeat for Credit
No
Subject code
CPSC