Algorithms for Searching, Sorting, and Indexing
half-circle
vector

Algorithms for Searching, Sorting, and Indexing

أبرز محتويات الدورة

This course covers basics of algorithm design and analysis, as well as algorithms for sorting arrays, data structures such as priority queues, hash functions, and applications such as Bloom filters. Algorithms for Searching, Sorting, and Indexing can be taken for academic credit as part of CU Boulder's Master of Science in Data Science (MS-DS) degree offered on the Coursera platform. The MS-DS is an interdisciplinary degree that brings together faculty from CU Boulder's departments of Applied Mathematics, Computer Science, Information Science, and others. With performance-based admissions and no application process, the MS-DS is ideal for individuals with a broad range of undergraduate education and/or professional experience in computer science, information science, mathematics, and statistics.

حول مقدم الدورة

Coursera provides access to more than 3000+ courses across a wide variety of subjects in parntership with different universities and organizations.

الطبع بواسطة

  • self
    التعلم الذاتي
  • dueration
    المدة 35 ساعات
  • domain
    الاختصاص تقنية المعلومات وعلوم الحاسب
  • subs
    Monthly Subscription
    Course is included in
    1. الباقة الإبتدائية @ AED 99 + VAT
    2. الباقة الاحترافية @ AED 149 + VAT
  • fee
    Buy Now AED 344.99 + VAT
  • language
    اللغة الإنكليزية