Colorado State University Global 3 credits CSC
Participants will delve into the fundamental principles of algorithm design, analyzing both time and space complexity to evaluate the efficiency of various algorithms. The course covers a spectrum of searching and sorting algorithms, including linear and binary search, bubble sort, quicksort, and mergesort, fostering proficiency in their implementation. Participants will also gain insights into graph algorithms, understanding how to find the shortest path using Dijkstra's and Bellman-Ford algorithms. The properties and applications of graphs and trees in computer science are explored, providing a holistic understanding of their significance. Concepts of recursion and backtracking in algorithm design are elucidated, and participants will develop essential skills in unit testing to ensure the correctness and reliability of their algorithms.
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.