Description:
Linear data structures, trees, and graphs and algorithms which operate on them. Fundamental algorithms for searching, sorting, string matching, graph problems, and their analysis.
Semester:
Fall of every year, Spring of every year
Credits:
Total Credits: 3 Lecture/Recitation/Discussion Hours: 3
Prerequisite:
CSE 232 and CSE 260
Restrictions:
Open only to students in the Department of Computer Science and Engineering or Computer Engineering majors or the LBS Computer Science coordinate major or the Computer Science disciplinary teaching minor.
Description:
Linear data structures, trees, graphs and algorithms which operate on them. Fundamental algorithms for searching, sorting, string matching, graph problems. Design and analysis of algorithms.
Semester:
Fall of every year, Spring of every year
Credits:
Total Credits: 3 Lecture/Recitation/Discussion Hours: 3
Prerequisite:
CSE 232 and CSE 260
Restrictions:
Open to students in the Department of Computer Science and Engineering or in the Computer Engineering Major or in the Lyman Briggs Computer Science Coordinate Major or in the Lyman Briggs Computer Science Major or in the Computer Science Disciplinary Teaching Minor.
Description:
Linear data structures, trees, graphs and algorithms which operate on them. Fundamental algorithms for searching, sorting, string matching, graph problems. Design and analysis of algorithms.
Semester:
Fall of every year, Spring of every year
Credits:
Total Credits: 3 Lecture/Recitation/Discussion Hours: 3
Prerequisite:
(CSE 232) and (CSE 260 or CMSE 202)
Restrictions:
Open to students in the Department of Computer Science and Engineering or in the Computer Engineering Major or in the Lyman Briggs Computer Science Coordinate Major or in the Lyman Briggs Computer Science Major and open to juniors or seniors in the College of Engineering.
Description:
Linear data structures, trees, graphs and algorithms which operate on them. Fundamental algorithms for searching, sorting, string matching, graph problems. Design and analysis of algorithms.
Semester:
Fall of every year, Spring of every year
Credits:
Total Credits: 3 Lecture/Recitation/Discussion Hours: 3
Prerequisite:
(CSE 232) and (CSE 260 or CMSE 202)
Restrictions:
Open to students in the Department of Computer Science and Engineering or in the Computer Engineering Major or in the Lyman Briggs Computer Science Coordinate Major or in the Lyman Briggs Computer Science Major or in the Data Science Major and open to juniors or seniors in the College of Engineering.
Description:
Design, analysis, and application of fundamental algorithms and data structures in computer science.