Binghamton University 4 credits CS
Design and analysis of algorithms for solving computational problems. Topics include asymptotic analysis of algorithm time and space complexity, comparison of sorting and searching algorithms, and algorithms for processing strings, trees, graphs, and networks. Algorithm design paradigms include divide-and-conquer, dynamic programming, greedy methods, backtracking, and branch-and-bound. The course also introduces computational complexity and NP-completeness, emphasizing the limits of efficient computation. These techniques form the algorithmic foundations for modern applications including artificial intelligence, machine learning, and large-scale data processing. Coursework includes problem solving, algorithm analysis, and student presentations. Prerequisites: CS 310 and MATH 227 and either MATH 314 or MATH 330 (all three must be completed); and CS 301 (may be taken concurrently). All prerequisites must have a grade of C- or better. Offered every semester. 4 credits.
Our subject experts help with essays, research papers, case studies, discussion posts, and capstone projects for these programs β written from scratch to your course requirements.
Program and course information is reproduced from each university's published academic catalog for informational purposes and may change. Always confirm current requirements with your university. We are an independent academic support service and are not affiliated with or endorsed by the universities listed.
Expert guides on essay writing, citation styles, study skills, and academic success.
View All Articles
Learn how to write a good research question for a paper. Narrow your topic, identify a research problem, and create a focused question with practical examples.
Learn how to choose a research topic you can actually research. Discover how to narrow broad ideas, find reliable sources, and develop a focused research question.
Learn how to cite sources in a research paper using APA, MLA, and Chicago styles, with in-text citation examples and reference-list tips.