Computer Science 101: Master the Theory Behind Programming (Skillshare – Engsub)

Categories: IT
Wishlist Share
Share Course
Page Link
Share On Social Media

About Course

Views

Course Introduction: “Computer Science 101: Master the Theory Behind Programming”
Unlock the secrets to becoming a great programmer by mastering the
fundamentals of Computer Science theory
. This comprehensive course is designed for anyone eager to dive into the principles that shape effective programming, regardless of prior experience.
Why Learn Computer Science Theory?
Understanding the theory behind programming sets exceptional programmers apart. Unlike mastering a single programming language like Java or C++, Computer Science theory provides you with timeless skills and analytical tools that can be applied across any language or technology. Programming is more than just writing code—it’s about
problem-solving
, analyzing challenges, and designing efficient, sustainable solutions.
Designed for Everyone
You don’t need to be an “analytical mind” to succeed in this course. Using engaging, straightforward explanations and a variety of teaching methods, we make complex concepts easy to understand and apply. Whether you’re new to technology or looking to strengthen your programming foundation, this course equips you with the skills to succeed.
Start your journey into Computer Science and discover how to
think like a programmer
—where creativity meets logic, and potential becomes limitless.
What you’ll learn:
Binary Number System.
N Notation.
Big O Notation.
Arrays and their Advantages.
Nodes and their Importance.
v.v…

Link gốc:

https://skillshare.com/en/classes/computer-science-101-master-the-theory-behind-programming/944357725

Time Course:
6 hours 18 minutes (45 Lectures + Documents)

Instructor
: Kurt Anderson
Total Weight:
760.16 MB
** Note
:  

Chú ý:

Show More

Course Content

ROOT

  • 35 – 5-6-quick-sort-run-times.mkv
    10:31
  • 24 – 4-1-stacks.mkv
    09:41
  • 25 – 4-2-stack-example.mkv
    11:05
  • 26 – 4-3-queues.mkv
    08:48
  • 27 – 4-4-queue-examples.mkv
    09:42
  • 28 – 4-5-queue-and-stack-run-times.mkv
    06:03
  • 29 – 4-6-stack-and-queues-real-world-examples.mkv
    07:01
  • 30 – 5-1-sorting-algorithm-introdcution.mkv
    01:40
  • 31 – 5-2-bubble-sort.mkv
    10:12
  • 32 – 5-3-selection-sort.mkv
    09:49
  • 33 – 5-4-insertion-sort.mkv
    09:03
  • 34 – 5-5-quick-sort.mkv
    14:38
  • 23 – 3-7-linked-list-real-world-examples.mkv
    03:00
  • 36 – 5-7-merge-sort.mkv
    11:57
  • 37 – 5-8-merge-sort-run-times.mkv
    07:39
  • 38 – 5-9-stable-vs-nonstable.mkv
    06:34
  • 39 – 5-10-sorting-algorithm-real-world-examples.mkv
    04:01
  • 40 – 6-1-basics-of-trees.mkv
    07:37
  • 41 – 6-2-binary-search-tree.mkv
    08:34
  • 42 – 6-3-bst-run-times.mkv
    07:36
  • 43 – 6-4-tree-traversals.mkv
    13:04
  • 44 – 6-5-tree-real-world-examples.mkv
    04:29
  • 45 – timing-project-prep.mkv
    06:47
  • 12 – 2-4-binary-search-algorithm-fixed-array-sorted-search.mkv
    09:59
  • 02 – 1-1-time-complexity-introduction.mkv
    02:12
  • 03 – 1-2-math-refresher-logarithmic-functions.mkv
    11:07
  • 04 – 1-3-math-refresher-factorial-functions.mkv
    03:19
  • 05 – 1-4-math-refresher-algebraic-expressions.mkv
    02:47
  • 06 – 1-5-n-notation.mkv
    18:55
  • 07 – 1-6-big-o-notation.mkv
    12:58
  • 08 – 1-7-real-world-big-o-example.mkv
    09:51
  • 09 – 2-1-how-is-data-stored.mkv
    08:38
  • 10 – 2-2-fixed-array-introduction.mkv
    05:09
  • 11 – 2-3-fixed-array-run-times.mkv
    12:23
  • 01 – introduction.mkv
    04:48
  • 13 – 2-5-circular-arrays.mkv
    08:00
  • 14 – 2-6-dynamic-arrays.mkv
    15:51
  • 15 – 2-7-array-review.mkv
    07:57
  • 16 – 2-8-array-real-world-examples.mkv
    05:42
  • 17 – 3-1-nodes.mkv
    04:19
  • 18 – 3-2-linked-list.mkv
    13:36
  • 19 – 3-3-linked-list-run-times.mkv
    14:59
  • 20 – 3-4-doubly-linked-lists.mkv
    08:07
  • 21 – 3-5-tail-pointer.mkv
    05:14
  • 22 – 3-6-linked-list-review.mkv
    03:31

Student Ratings & Reviews

No Review Yet
No Review Yet