Don't like banners? Log in and we will make sure you see no banners. For free.
No cover art

[FreeCourseNet cc] Udemy - Computer Science 101 Master the Theory Behind Programming

Size
1.4 GB
Seeders
0
Leechers
1
Files
98
Category
Added
at 9:38am GMT+1
Infohash
36dfe1ea409033456bda4459d232d6835528d9ba
Don't like banners? Log in and we will make sure you see no banners. For free.

Description
Computer Science 101: Learn Computer Science to become a better Programmer and Software Engineer.


What you’ll learn



Understand the Fundamental Theories of Algorithm Analysis
Be able to Compare Various Algorithms

Understand When to use Different Data Structures and Algorithms

Understand the Fundamentals of Computer Science theory
Understand the Core Sorting Algorithms
Requirements
A Willingness to Learn New Topics!
No Prior Experience or Knowledge is Needed!
Description
Master the Theory to Becoming a Good Programmer!

If you’re looking to learn the theory that makes great programmers, you’ve come to the right place! This course is perfect for anyone interested in learning the fundamentals to Computer Science Theory.



No Previous Experience Necessary!

Computer science and technology are often thought of as things only for “analytical minds”. I believe however that technology and it’s theory are for everyone. So I designed this course to teach each topic in a variety of easy to digest ways. Through these multiple reinforcing steps, I believe anyone can follow along and succeed!



Why is the Theory of Programming Important?

Understanding Computer Science theory is what sets apart Great programmers from average ones. Programming theory is something that transcends a single programming language. It gives you skills and techniques you can apply to any programming language you touch. Learning the theory behind programming is just as important, if not more important than learning a singular programming language like Java or C++.

Programming is all about problem solving. Analyzing a problem, and being able to figure out a way that a computer can help with that problem. Computer Science is the practice of this analysis process. It goes over the techniques and knowledge necessary to design efficient and sustainable code.



So if you want to begin setting yourself apart from the average programmers, this is the course for you!

Enroll Now and you’ll Learn:

Binary Number System
N Notation
Big O Notation
How to Analyze a Program
Arrays and their Advantages
Nodes and their Importance
Linked Lists and their Advantages and Implementations
Stacks implemented with Arrays and Linked Lists
Queues Implemented with Arrays and Linked Lists
Various Sorting Algorithms and Their Comparisions
Trees and Binary Search Trees
And Much Much More!
My Guarantee



I am so confident you will enjoy this course, I offer a 100% 30-day money-back guarantee through Udemy. If you are not happy with your purchase, I have no problem with giving your money back!

Are You Ready to Get Started?

I will be waiting for you inside the course!



Remember, this is an online course, so you can take it at your own pace. Are you busy right now? That’s okay. Enroll today, and take the course at your own pace.

Thanks so much for your interest in this Computer Science 101 Course!



See you inside!

Kurt



Who this course is for:
Anyone who wants to become a Good Programmer
Anyone interested in the Computer Science Discipline
Anyone who wants to learn how to problem solve like a Computer Scientist
Created by Kurt Anderson
Last updated 5/2019
English
English [Auto-generated]

Size: 1.43 GB

For more visit -FreeCourseNet

==Team FreeCourseNet.cc

File list
  • [FreeCourseNet cc] Udemy - Computer Science 101 Master the Theory Behind Programming
  • 1. Introduction/1. Introduction.vtt 1.9 KB
  • 1. Introduction/2. Binary Number Introduction.vtt 16 KB
  • 1. Introduction/3. Binary Deca Number Conversion.vtt 10.5 KB
  • 1. Introduction/4. Binary Number System Notes.html 6.4 KB
  • 1. Introduction/5. Binary Number System Quiz.html 160 B
  • 10. Conclusion/1. Thank You!.vtt 1.7 KB
  • 11. Bonus/1. Binary to Hex and Back.vtt 14.2 KB
  • 11. Bonus/2. Decimal to Hex and Back.vtt 13.9 KB
  • 11. Bonus/3. Bonus Lecture.html 1.2 KB
  • 2. Analyzing Algorithms/1. All Notes.html 142 B
  • 2. Analyzing Algorithms/1.1 All Notes.pdf.pdf 1.9 MB
  • 2. Analyzing Algorithms/10. Big O Notation.vtt 16.9 KB
  • 2. Analyzing Algorithms/11. n-Notation Notes.html 7.8 KB
  • 2. Analyzing Algorithms/12. Big O Notation Quiz.html 160 B
  • 2. Analyzing Algorithms/13. Big O Real-World Example.vtt 13 KB
  • 2. Analyzing Algorithms/2. Introduction to Time-Complexity.mp4 3.6 MB
  • 2. Analyzing Algorithms/2. Introduction to Time-Complexity.vtt 2.9 KB
  • 2. Analyzing Algorithms/3. Math Refresher Logarithmic Functions.vtt 15.3 KB
  • 2. Analyzing Algorithms/4. Math Refresher Factorial Functions.vtt 4.1 KB
  • 2. Analyzing Algorithms/5. Math Refresher Algebraic Expressions.vtt 3.5 KB
  • 2. Analyzing Algorithms/6. Math Refresher Notes.html 4.5 KB
  • 2. Analyzing Algorithms/7. n-notation Introduction.vtt 13.1 KB
  • 2. Analyzing Algorithms/8. n-notation Scaling.vtt 16.2 KB
  • 2. Analyzing Algorithms/9. n-notation Example.vtt 5.7 KB
  • 3. Arrays/1. How is Data Stored.vtt 10.8 KB
  • 3. Arrays/10. Array Review.vtt 9.9 KB
  • 3. Arrays/11. Array Real World Examples.vtt 8.2 KB
  • 3. Arrays/12. Array Quiz.html 160 B
  • 3. Arrays/2. Fixed Array Introduction.vtt 7.2 KB
  • 3. Arrays/3. Fixed Array Run Times.vtt 17 KB
  • 3. Arrays/4. Binary Search Algorithm (Fixed Array Sorted Search).vtt 13.2 KB
  • 3. Arrays/5. Fixed Array Notes.html 3.3 KB
  • 3. Arrays/6. Circular Arrays.vtt 11.1 KB
  • 3. Arrays/7. Dynamic Arrays.vtt 20.3 KB
  • 3. Arrays/8. O(1) Approximation.vtt 14.6 KB
  • 3. Arrays/9. Circular and Dynamic Array Notes.html 5.4 KB
  • 4. Linked Lists/1. Nodes.mp4 7 MB
  • 4. Linked Lists/1. Nodes.vtt 5.5 KB
  • 4. Linked Lists/10. Linked Lists.html 160 B
  • 4. Linked Lists/3. Linked List Run Times.vtt 19 KB
  • 4. Linked Lists/4. Singly-Linked List Notes.html 4 KB
  • 4. Linked Lists/5. Doubly Linked Lists.vtt 10.3 KB
  • 4. Linked Lists/6. Tail Pointers.vtt 7.1 KB
  • 4. Linked Lists/7. Doubly-Linked List and Tail Pointer Notes.html 4.8 KB
  • 4. Linked Lists/8. Linked List Real World Examples.mp4 4.5 MB
  • 4. Linked Lists/8. Linked List Real World Examples.vtt 4.5 KB
  • 4. Linked Lists/9. Linked List Review.mp4 6.3 MB
  • 4. Linked Lists/9. Linked List Review.vtt 4.9 KB
  • 5. Stacks and Queues/1. Stacks.vtt 12.6 KB
  • 5. Stacks and Queues/10. Stacks and Queues Quiz Explanation.mp4 8.4 MB
  • 5. Stacks and Queues/10. Stacks and Queues Quiz Explanation.vtt 7.9 KB
  • 5. Stacks and Queues/2. Stack Examples.vtt 13.9 KB
  • 5. Stacks and Queues/3. Stack Notes.html 3.5 KB
  • 5. Stacks and Queues/4. Queues.vtt 11.9 KB
  • 5. Stacks and Queues/5. Queue Examples.vtt 12 KB
  • 5. Stacks and Queues/6. Queue Notes.html 3.4 KB
  • 5. Stacks and Queues/7. Queue and Stack Run Times.vtt 7.4 KB
  • 5. Stacks and Queues/8. Stack and Queue Real World Examples.vtt 10.4 KB
  • 5. Stacks and Queues/9. Stacks and Queues Quiz.html 161 B
  • 6. Sorting Algorithms/1. Introduction to Sorting Algorithms.mp4 2.8 MB
  • 6. Sorting Algorithms/1. Introduction to Sorting Algorithms.vtt 1.9 KB
  • 6. Sorting Algorithms/10. Quick Sort Run Time.vtt 13.8 KB
  • 6. Sorting Algorithms/11. Quick Sort Notes.html 3.5 KB
  • 6. Sorting Algorithms/12. Insertion Sort and Quick Sort Quiz.html 161 B
  • 6. Sorting Algorithms/13. Merge Sort.vtt 15.8 KB
  • 6. Sorting Algorithms/14. Merge Sort Run Times.vtt 9.5 KB
  • 6. Sorting Algorithms/15. Merge Sort Notes.html 2.7 KB
  • 6. Sorting Algorithms/16. Stable vs NonStable.vtt 7.6 KB
  • 6. Sorting Algorithms/17. Stable Vs NonStable Notes.html 4.3 KB
  • 6. Sorting Algorithms/18. Merge Sort and Stability Quiz.html 161 B
  • 6. Sorting Algorithms/19. Sorting Algorithm Real World Examples.vtt 5.7 KB
  • 6. Sorting Algorithms/2. Bubble Sort.vtt 13.2 KB
  • 6. Sorting Algorithms/3. Bubble Sort Notes.html 3.2 KB
  • 6. Sorting Algorithms/4. Selection Sort.vtt 13.4 KB
  • 6. Sorting Algorithms/5. Selection Sort Notes.html 3.7 KB
  • 6. Sorting Algorithms/6. Bubble Sort and Selection Sort Quiz.html 161 B
  • 6. Sorting Algorithms/7. Insertion Sort.vtt 11.8 KB
  • 6. Sorting Algorithms/8. Insertion Sort Notes.html 3.3 KB
  • 6. Sorting Algorithms/9. Quick Sort.vtt 19.1 KB
  • 7. Trees/1. Trees.vtt 9.6 KB
  • 7. Trees/2. Binary Search Trees.vtt 10.8 KB
  • 7. Trees/3. Binary Search Tree Run Times.vtt 9.8 KB
  • 7. Trees/4. Tree Notes.html 5.1 KB
  • 7. Trees/5. Tree Quiz.html 161 B
  • 7. Trees/6. Tree Traversals.vtt 16.3 KB
  • 7. Trees/7. Tree Real World Examples.vtt 6.4 KB
  • 8. Heaps/1. Heaps Introduction.vtt 5.5 KB
  • 8. Heaps/2. Heap Analysis.vtt 15.8 KB
  • 8. Heaps/3. Heaps Real World Examples.vtt 9.9 KB
  • 8. Heaps/4. Heap Notes.html 3.2 KB
  • 9. Graphs/1. Introduction to Graphs.vtt 4.4 KB
  • 9. Graphs/2. Basic Types of Graphs.vtt 12.5 KB
  • 9. Graphs/3. Graph Terminology.vtt 15.5 KB
  • 9. Graphs/4. Graph Terminology Summary.html 1.6 KB
  • 9. Graphs/5. Depth First Search.vtt 8.7 KB
  • 9. Graphs/6. Breadth First Search.vtt 8.1 KB
  • 9. Graphs/7. BFS and DFS Run Times.vtt 4 KB
  • Read Me.txt 499 B

Rating
Not rated yet
Log in to rate

Comments

No comments yet.