Johns Hopkins University 3 credits Computer Science
This course will cover basic methods of randomization for efficient algorithms and relevant techniques of probabilistic analysis. The first part of the course will discuss classical randomized algorithms, including the randomized algorithm for the min-cut problem, hashing techniques, tail inequalities, and the probabilistic method. The second part will delve into advanced topics such as coreset methods for clustering algorithms, the Johnson-Lindenstrauss lemma, and the applications of streaming and sketching algorithms. Prerequisite(s): Students may receive credit for only one of the following: EN.601.434 OR EN.601.634.;(EN.601.433 OR EN.601.633) AND (EN.553.211 OR EN.553.310 OR EN.553.311 OR EN.553.420 OR EN.553.421)
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.