mirror of
https://github.com/freeCodeCamp/freeCodeCamp.git
synced 2026-03-14 04:00:42 -04:00
feat(client/curriculum): make python live (#52628)
This commit is contained in:
@@ -748,18 +748,46 @@
|
||||
}
|
||||
},
|
||||
"scientific-computing-with-python": {
|
||||
"title": "Scientific Computing with Python",
|
||||
"title": "Scientific Computing with Python (Beta)",
|
||||
"intro": [
|
||||
"Python is one of the most popular, flexible programming languages today. You can use it for everything from basic scripting to machine learning.",
|
||||
"In the Scientific Computing with Python Certification, you'll learn Python fundamentals like variables, loops, conditionals, and functions. Then you'll quickly ramp up to complex data structures, networking, relational databases, and data visualization."
|
||||
],
|
||||
"note": "",
|
||||
"blocks": {
|
||||
"python-for-everybody": {
|
||||
"title": "Python for Everybody",
|
||||
"learn-string-manipulation-by-building-a-cipher": {
|
||||
"title": "Learn String Manipulation by Building a Cipher",
|
||||
"intro": [
|
||||
"Python for everybody is a free video course series that teaches the basics of using Python 3.",
|
||||
"The courses were created by Dr. Charles Severance (also known as Dr. Chuck). He is a Clinical Professor at the University of Michigan School of Information, where he teaches various technology-oriented courses including programming, database design, and web development."
|
||||
"Python is a powerful and popular programming language widely used for data science, data visualization, web and game development, machine learning and much more.",
|
||||
"In this project, you'll learn fundamental programming concepts in Python, such as variables, functions, loop, conditional statements, and and how to work with them to build your first program."
|
||||
]
|
||||
},
|
||||
"learn-how-to-work-with-numbers-and-strings-by-implementing-the-luhn-algorithm": {
|
||||
"title": "Learn How to Work with Numbers and Strings by Implementing the Luhn Algorithm",
|
||||
"intro": [
|
||||
"The Luhn Algorithm is widely used for error-checking in various applications, including credit card numbers.",
|
||||
"Through this project, you'll gain valuable experience in working with numerical computations and string manipulation while implementing the Luhn Algorithm."
|
||||
]
|
||||
},
|
||||
"learn-recursion-by-solving-the-tower-of-hanoi-puzzle": {
|
||||
"title": "Learn Recursion by Solving the Tower of Hanoi Puzzle",
|
||||
"intro": [
|
||||
"Recursion allows you to write concise and elegant code to solve complex computational problems.",
|
||||
"In this project, you'll start with an iterative approach to solve the tower of Hanoi mathematical puzzle and then you'll learn how to implement a recursive solution."
|
||||
]
|
||||
},
|
||||
"learn-classes-and-objects-by-building-a-sudoku-solver": {
|
||||
"title": "Learn Classes and Objects by Building a Sudoku Solver",
|
||||
"intro": [
|
||||
"Classes and objects are an important programming concept and they enable developers to achieve code modularity, abstraction, readability, and promote reusability.",
|
||||
"In this Sudoku solver project, you'll learn how to use classes and objects to build a sudoku grid and to solve a sudoku puzzle."
|
||||
]
|
||||
},
|
||||
"learn-tree-traversal-by-building-a-binary-search-tree": {
|
||||
"title": "Learn Tree Traversal by Building a Binary Search Tree",
|
||||
"intro": [
|
||||
"A Binary Search Tree (BST) is an important data structure concept, where data is sorted in a hierarchical structure.",
|
||||
"In this project, you will learn how to construct a BST, perform an inorder traversal, and also cover key operations like insertion, search, and deletion."
|
||||
]
|
||||
},
|
||||
"scientific-computing-with-python-projects": {
|
||||
@@ -998,6 +1026,22 @@
|
||||
}
|
||||
}
|
||||
},
|
||||
"python-for-everybody": {
|
||||
"title": "Legacy Python for Everybody",
|
||||
"intro": [
|
||||
"Python is one of the most popular, flexible programming languages today. You can use it for everything from basic scripting to machine learning."
|
||||
],
|
||||
"note": "",
|
||||
"blocks": {
|
||||
"python-for-everybody": {
|
||||
"title": "Python for Everybody",
|
||||
"intro": [
|
||||
"Python for everybody is a free video course series that teaches the basics of using Python 3.",
|
||||
"The courses were created by Dr. Charles Severance (also known as Dr. Chuck). He is a Clinical Professor at the University of Michigan School of Information, where he teaches various technology-oriented courses including programming, database design, and web development."
|
||||
]
|
||||
}
|
||||
}
|
||||
},
|
||||
"coding-interview-prep": {
|
||||
"title": "Coding Interview Prep",
|
||||
"intro": [
|
||||
@@ -1182,38 +1226,6 @@
|
||||
"upcoming-python-project": {
|
||||
"title": "Upcoming Python Project",
|
||||
"intro": ["placeholder"]
|
||||
},
|
||||
"learn-tree-traversal-by-building-a-binary-search-tree": {
|
||||
"title": "Learn Tree Traversal by Building a Binary Search Tree",
|
||||
"intro": [
|
||||
"A Binary Search Tree (BST) is an important data structure concept, where data is sorted in a hierarchical structure.",
|
||||
"In this project, you will learn how to construct a BST, perform an inorder traversal, and also cover key operations like insertion, search, and deletion."
|
||||
]
|
||||
},
|
||||
"learn-how-to-work-with-numbers-and-strings-by-implementing-the-luhn-algorithm": {
|
||||
"title": "Learn How to Work with Numbers and Strings by Implementing the Luhn Algorithm",
|
||||
"intro": ["", ""]
|
||||
},
|
||||
"learn-classes-and-objects-by-building-a-sudoku-solver": {
|
||||
"title": "Learn Classes and Objects by Building a Sudoku Solver",
|
||||
"intro": [
|
||||
"Classes and objects are an important programming concept and they enable developers to achieve code modularity, abstraction, readability, and promote reusability.",
|
||||
"In this Sudoku solver project, you'll learn how to use classes and objects to build a sudoku grid and to solve a sudoku puzzle."
|
||||
]
|
||||
},
|
||||
"learn-recursion-by-solving-the-tower-of-hanoi-puzzle": {
|
||||
"title": "Learn Recursion by Solving the Tower of Hanoi Puzzle",
|
||||
"intro": [
|
||||
"Recursion allows you to write concise and elegant code to solve complex computational problems.",
|
||||
"In this project, you'll start with an iterative approach to solve the tower of Hanoi mathematical puzzle and then you'll learn how to implement a recursive solution."
|
||||
]
|
||||
},
|
||||
"learn-string-manipulation-by-building-a-cipher": {
|
||||
"title": "Learn String Manipulation by Building a Cipher",
|
||||
"intro": [
|
||||
"Python is a powerful and popular programming language widely used for data science, data visualization, web and game development, machine learning and much more.",
|
||||
"In this project, you'll learn fundamental programming concepts in Python, such as variables, functions, loop, conditional statements, and and how to work with them to build your first program."
|
||||
]
|
||||
}
|
||||
}
|
||||
},
|
||||
|
||||
@@ -124,6 +124,7 @@
|
||||
"learn-english-heading": "Learn English for Developers:",
|
||||
"professional-certs-heading": "Earn free professional certifications:",
|
||||
"interview-prep-heading": "Prepare for the developer interview job search:",
|
||||
"legacy-curriculum-heading": "Explore our Legacy Curriculum:",
|
||||
"upcoming-heading": "Upcoming curriculum:",
|
||||
"faq": "Frequently asked questions:",
|
||||
"faqs": [
|
||||
|
||||
@@ -41,7 +41,8 @@ const iconMap = {
|
||||
[SuperBlocks.ExampleCertification]: ResponsiveDesign,
|
||||
[SuperBlocks.UpcomingPython]: PythonIcon,
|
||||
[SuperBlocks.A2English]: A2EnglishIcon,
|
||||
[SuperBlocks.RosettaCode]: RosettaCodeIcon
|
||||
[SuperBlocks.RosettaCode]: RosettaCodeIcon,
|
||||
[SuperBlocks.PythonForEverybody]: PythonIcon
|
||||
};
|
||||
|
||||
type SuperBlockIconProps = {
|
||||
|
||||
@@ -127,6 +127,15 @@ function Map({ forLanding = false }: MapProps): React.ReactElement {
|
||||
<MapLi key={i} superBlock={superBlock} landing={forLanding} />
|
||||
))}
|
||||
</ul>
|
||||
<Spacer size='medium' />
|
||||
<h2 className={forLanding ? 'big-heading' : ''}>
|
||||
{t('landing.legacy-curriculum-heading')}
|
||||
</h2>
|
||||
<ul>
|
||||
{superBlockOrder[SuperBlockStages.Legacy].map((superBlock, i) => (
|
||||
<MapLi key={i} superBlock={superBlock} landing={forLanding} />
|
||||
))}
|
||||
</ul>
|
||||
{showUpcomingChanges && (
|
||||
<>
|
||||
<Spacer size='medium' />
|
||||
|
||||
9
client/src/pages/learn/python-for-everybody/index.md
Normal file
9
client/src/pages/learn/python-for-everybody/index.md
Normal file
@@ -0,0 +1,9 @@
|
||||
---
|
||||
title: Python for Everybody
|
||||
superBlock: python-for-everybody
|
||||
certification: python-for-everybody
|
||||
---
|
||||
|
||||
## Introduction to Python for Everybody
|
||||
|
||||
Learn the basics of Python.
|
||||
@@ -1,7 +1,7 @@
|
||||
---
|
||||
title: Introduction to Python for Everybody
|
||||
block: python-for-everybody
|
||||
superBlock: scientific-computing-with-python
|
||||
superBlock: python-for-everybody
|
||||
---
|
||||
|
||||
## Introduction to Python for Everybody
|
||||
@@ -20,7 +20,8 @@ export const ConditionalDonationAlert = ({
|
||||
superBlock === SuperBlocks.JsAlgoDataStructNew ||
|
||||
superBlock === SuperBlocks.A2English ||
|
||||
superBlock === SuperBlocks.TheOdinProject ||
|
||||
superBlock === SuperBlocks.UpcomingPython
|
||||
superBlock === SuperBlocks.UpcomingPython ||
|
||||
superBlock === SuperBlocks.SciCompPy
|
||||
)
|
||||
return (
|
||||
<Alert variant='info' className='annual-donation-alert'>
|
||||
|
||||
@@ -185,8 +185,9 @@ const SuperBlockIntroductionPage = (props: SuperBlockProp) => {
|
||||
SuperBlocks.CodingInterviewPrep,
|
||||
SuperBlocks.TheOdinProject,
|
||||
SuperBlocks.ProjectEuler,
|
||||
SuperBlocks.A2English,
|
||||
SuperBlocks.RosettaCode,
|
||||
SuperBlocks.A2English
|
||||
SuperBlocks.PythonForEverybody
|
||||
];
|
||||
|
||||
return (
|
||||
|
||||
@@ -13,7 +13,8 @@ const superBlocksWithoutLastWord = [
|
||||
SuperBlocks.RespWebDesign,
|
||||
SuperBlocks.CodingInterviewPrep,
|
||||
SuperBlocks.TheOdinProject,
|
||||
SuperBlocks.ProjectEuler
|
||||
SuperBlocks.ProjectEuler,
|
||||
SuperBlocks.PythonForEverybody
|
||||
];
|
||||
|
||||
export function getSuperBlockTitleForMap(superBlock: SuperBlocks): string {
|
||||
|
||||
@@ -1,15 +1,14 @@
|
||||
{
|
||||
"name": "Learn Classes and Objects by Building a Sudoku Solver",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"usesMultifileEditor": true,
|
||||
"hasEditableBoundaries": true,
|
||||
"dashedName": "learn-classes-and-objects-by-building-a-sudoku-solver",
|
||||
"order": 4,
|
||||
"order": 8,
|
||||
"time": "5 hours",
|
||||
"template": "",
|
||||
"required": [],
|
||||
"superBlock": "upcoming-python",
|
||||
"superOrder": 20,
|
||||
"superBlock": "scientific-computing-with-python",
|
||||
"isBeta": true,
|
||||
"challengeOrder": [
|
||||
{
|
||||
|
||||
@@ -1,15 +1,14 @@
|
||||
{
|
||||
"name": "Learn How to Work with Numbers and Strings by Implementing the Luhn Algorithm",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"usesMultifileEditor": true,
|
||||
"hasEditableBoundaries": true,
|
||||
"dashedName": "learn-how-to-work-with-numbers-and-strings-by-implementing-the-luhn-algorithm",
|
||||
"order": 5,
|
||||
"order": 1,
|
||||
"time": "5 hours",
|
||||
"template": "",
|
||||
"required": [],
|
||||
"superBlock": "upcoming-python",
|
||||
"superOrder": 20,
|
||||
"superBlock": "scientific-computing-with-python",
|
||||
"isBeta": true,
|
||||
"challengeOrder": [
|
||||
{
|
||||
|
||||
@@ -1,15 +1,14 @@
|
||||
{
|
||||
"name": "Learn Recursion by Solving the Tower of Hanoi Puzzle",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"usesMultifileEditor": true,
|
||||
"hasEditableBoundaries": true,
|
||||
"dashedName": "learn-recursion-by-solving-the-tower-of-hanoi-puzzle",
|
||||
"order": 3,
|
||||
"order": 6,
|
||||
"time": "5 hours",
|
||||
"template": "",
|
||||
"required": [],
|
||||
"superBlock": "upcoming-python",
|
||||
"superOrder": 20,
|
||||
"superBlock": "scientific-computing-with-python",
|
||||
"isBeta": true,
|
||||
"challengeOrder": [
|
||||
{
|
||||
|
||||
@@ -1,15 +1,14 @@
|
||||
{
|
||||
"name": "Learn String Manipulation by Building a Cipher",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"usesMultifileEditor": true,
|
||||
"hasEditableBoundaries": true,
|
||||
"dashedName": "learn-string-manipulation-by-building-a-cipher",
|
||||
"order": 2,
|
||||
"order": 0,
|
||||
"time": "5 hours",
|
||||
"template": "",
|
||||
"required": [],
|
||||
"superBlock": "upcoming-python",
|
||||
"superOrder": 20,
|
||||
"superBlock": "scientific-computing-with-python",
|
||||
"isBeta": true,
|
||||
"challengeOrder": [
|
||||
{
|
||||
|
||||
@@ -1,15 +1,14 @@
|
||||
{
|
||||
"name": "Learn Tree Traversal by Building a Binary Search Tree",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"usesMultifileEditor": true,
|
||||
"hasEditableBoundaries": true,
|
||||
"dashedName": "learn-tree-traversal-by-building-a-binary-search-tree",
|
||||
"order": 2,
|
||||
"order": 9,
|
||||
"time": "5 hours",
|
||||
"template": "",
|
||||
"required": [],
|
||||
"superBlock": "upcoming-python",
|
||||
"superOrder": 20,
|
||||
"superBlock": "scientific-computing-with-python",
|
||||
"isBeta": true,
|
||||
"challengeOrder": [
|
||||
{
|
||||
|
||||
@@ -5,7 +5,7 @@
|
||||
"helpCategory": "Python",
|
||||
"order": 0,
|
||||
"time": "15 hours",
|
||||
"superBlock": "scientific-computing-with-python",
|
||||
"superBlock": "python-for-everybody",
|
||||
"challengeOrder": [
|
||||
{
|
||||
"id": "5e6a54a558d3af90110a60a0",
|
||||
|
||||
@@ -3,7 +3,7 @@
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "scientific-computing-with-python-projects",
|
||||
"helpCategory": "Python",
|
||||
"order": 1,
|
||||
"order": 10,
|
||||
"time": "150 hours",
|
||||
"superBlock": "scientific-computing-with-python",
|
||||
"challengeOrder": [
|
||||
|
||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user