100% Plagiarism-Free
+1-727-416-5453

Sign In

Access your dashboard and order activity.

Forgot password?

Create Account

Register to place orders and track every step.

CS-GY 6033G

Design and Analysis of Algorithms I

New York University 3 credits Computer Science

Course Description

This course reviews basic data structures and mathematical tools. Topics: Data structures, priority queues, binary search trees, balanced search trees. Btrees. Algorithm design and analysis techniques illustrated in searching and sorting: heapsort, quicksort, sorting in linear time, medians and order statistics. Design and analysis techniques: dynamic programming, greedy algorithms. Graph algorithms: elementary graph algorithms (breadth first search, depth first search, topological sort, connected components, strongly connected components), minimum spanning tree, shortest path. String algorithms. Geometric algorithms. Linear programming. Brief introduction to NP completeness. | Knowledge of Discrete Math equivalent to CS-GY 6003, and knowledge of Fundamental Data Structures. Prerequisites: Graduate Standing Prerequisites: Graduate Standing.

Code
CS-GY 6033G
Credits
3
Subject
Computer Science

Get expert help with CS-GY 6033G Design and Analysis of Algorithms I

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.

Get Help Now

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.

Academic Resources

Latest from the Blog

Expert guides on essay writing, citation styles, study skills, and academic success.

View All Articles