mirror of
https://github.com/ossu/computer-science.git
synced 2024-10-01 01:26:01 -04:00
Reformat to one sentence per line
This commit is contained in:
parent
a19cdaace2
commit
a68f107475
115
README.md
115
README.md
@ -39,7 +39,8 @@ The first one is a motivational video that shows a guy that went through the "MI
|
|||||||
|
|
||||||
- [MIT Challenge](https://www.scotthyoung.com/blog/myprojects/mit-challenge-2/)
|
- [MIT Challenge](https://www.scotthyoung.com/blog/myprojects/mit-challenge-2/)
|
||||||
|
|
||||||
The second link is a MOOC that will teach you learning techniques used by experts in art, music, literature, math, science, sports, and many other disciplines. These are **fundamental abilities** to succeed in our journey.
|
The second link is a MOOC that will teach you learning techniques used by experts in art, music, literature, math, science, sports, and many other disciplines.
|
||||||
|
These are **fundamental abilities** to succeed in our journey.
|
||||||
|
|
||||||
- [Learning How to Learn](https://www.coursera.org/learn/learning-how-to-learn)
|
- [Learning How to Learn](https://www.coursera.org/learn/learning-how-to-learn)
|
||||||
|
|
||||||
@ -62,22 +63,33 @@ The second link is a MOOC that will teach you learning techniques used by expert
|
|||||||
## Core CS
|
## Core CS
|
||||||
|
|
||||||
### Core programming
|
### Core programming
|
||||||
**Topics covered**: imperative programming; procedural programming; C; basic data structures and algorithms; Python; SQL; HTML, CSS, JavaScript; basic testing; functional program composition; object-oriented program design; static typing; dynamic typing; common design patterns; ML-family languages (via Standard ML); Lisp-family languages (via Racket); Ruby; and more.
|
**Topics covered**: imperative programming; procedural programming; C;
|
||||||
|
basic data structures and algorithms; Python; SQL; HTML, CSS, JavaScript;
|
||||||
|
basic testing; functional program composition; object-oriented program design;
|
||||||
|
static typing; dynamic typing; common design patterns;
|
||||||
|
ML-family languages (via Standard ML); Lisp-family languages (via Racket); Ruby;
|
||||||
|
and more.
|
||||||
|
|
||||||
Courses | Duration | Effort | Prerequisites
|
Courses | Duration | Effort | Prerequisites
|
||||||
:-- | :--: | :--: | :--:
|
:-- | :--: | :--: | :--:
|
||||||
[Introduction to Computer Science - CS50](https://www.edx.org/course/introduction-computer-science-harvardx-cs50x#!)| 12 weeks | 10-20 hours/week | none
|
[Introduction to Computer Science - CS50](https://www.edx.org/course/introduction-computer-science-harvardx-cs50x#!) | 12 weeks | 10-20 hours/week | none
|
||||||
[How to Code: Systematic Program Design (XSeries)](https://www.edx.org/xseries/how-code-systematic-program-design) | 15 weeks | 5 hours/week | none
|
[How to Code: Systematic Program Design (XSeries)](https://www.edx.org/xseries/how-code-systematic-program-design) | 15 weeks | 5 hours/week | none
|
||||||
[Object Oriented Programming in Java](https://www.coursera.org/learn/object-oriented-java) | 6 weeks | 4-6 hours/week | some programming
|
[Object Oriented Programming in Java](https://www.coursera.org/learn/object-oriented-java) | 6 weeks | 4-6 hours/week | some programming
|
||||||
[Programming Languages, Part A](https://www.coursera.org/learn/programming-languages) | 4 weeks | 8-16 hours/week | recommended: Java, C
|
[Programming Languages, Part A](https://www.coursera.org/learn/programming-languages) | 4 weeks | 8-16 hours/week | recommended: Java, C
|
||||||
[Programming Languages, Part B](https://www.coursera.org/learn/programming-languages-part-b) | 3 weeks | 8-16 hours/week | Programming Languages, Part A
|
[Programming Languages, Part B](https://www.coursera.org/learn/programming-languages-part-b) | 3 weeks | 8-16 hours/week | Programming Languages, Part A
|
||||||
[Programming Languages, Part C](https://www.coursera.org/learn/programming-languages-part-c) | 3 weeks | 8-16 hours/week | Programming Languages, Part B
|
[Programming Languages, Part C](https://www.coursera.org/learn/programming-languages-part-c) | 3 weeks | 8-16 hours/week | Programming Languages, Part B
|
||||||
|
|
||||||
Note: The Object-Oriented Programming in Java class is intended for students who have already taken a basic Java course, but it can still be completed by those who have only studied basic programming before in a different, Java-like language (e.g., C). The learning curve will be steep, however, so for those who find it too difficult, looking over the material in this course is recommended: [Introduction to Programming in Java](https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-092-introduction-to-programming-in-java-january-iap-2010/index.htm).
|
Note: The Object-Oriented Programming in Java class is intended for students who have already taken a basic Java course, but it can still be completed by those
|
||||||
|
who have only studied basic programming before in a different, Java-like language (e.g., C). The learning curve will be steep, however, so for those who
|
||||||
|
find it too difficult, looking over the material in this course is recommended:
|
||||||
|
[Introduction to Programming in Java](https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-092-introduction-to-programming-in-java-january-iap-2010/index.htm).
|
||||||
|
|
||||||
### Core math
|
### Core math
|
||||||
|
|
||||||
**Topics covered**: mathematical proofs; number theory; real analysis; differential calculus; integral calculus; sequences and series; probability theory; basic statistics; O-notation; graph theory; linear transformations; matrices; vectors; and more.
|
**Topics covered**: mathematical proofs; number theory; real analysis;
|
||||||
|
differential calculus; integral calculus; sequences and series;
|
||||||
|
probability theory; basic statistics; O-notation; graph theory;
|
||||||
|
linear transformations; matrices; vectors; and more.
|
||||||
|
|
||||||
Courses | Duration | Effort | Prerequisites
|
Courses | Duration | Effort | Prerequisites
|
||||||
:-- | :--: | :--: | :--:
|
:-- | :--: | :--: | :--:
|
||||||
@ -90,7 +102,10 @@ Courses | Duration | Effort | Prerequisites
|
|||||||
|
|
||||||
### Core systems
|
### Core systems
|
||||||
|
|
||||||
**Topics covered**: boolean algebra; gate logic; memory; machine language; computer architecture; assembly; machine language; virtual machines; high-level languages; compilers; operating systems; relational databases; transaction processing; data modeling; network protocols; and more.
|
**Topics covered**: boolean algebra; gate logic; memory; machine language;
|
||||||
|
computer architecture; assembly; machine language; virtual machines;
|
||||||
|
high-level languages; compilers; operating systems; relational databases;
|
||||||
|
transaction processing; data modeling; network protocols; and more.
|
||||||
|
|
||||||
Courses | Duration | Effort | Prerequisites
|
Courses | Duration | Effort | Prerequisites
|
||||||
:-- | :--: | :--: | :--:
|
:-- | :--: | :--: | :--:
|
||||||
@ -99,13 +114,21 @@ Courses | Duration | Effort | Prerequisites
|
|||||||
[Databases](https://lagunita.stanford.edu/courses/DB/2014/SelfPaced/about)| 12 weeks | 8-12 hours/week | some programming, basic CS
|
[Databases](https://lagunita.stanford.edu/courses/DB/2014/SelfPaced/about)| 12 weeks | 8-12 hours/week | some programming, basic CS
|
||||||
[Introduction to Computer Networking](https://lagunita.stanford.edu/courses/Engineering/Networking-SP/SelfPaced/about)| - | 4–12 hours/week | algebra, probability, basic CS
|
[Introduction to Computer Networking](https://lagunita.stanford.edu/courses/Engineering/Networking-SP/SelfPaced/about)| - | 4–12 hours/week | algebra, probability, basic CS
|
||||||
|
|
||||||
Note 1: The 'From Nand to Tetris' course, in part I, will have you create an entire computer architecture from scratch, but are missing key elements from computer architecture such as pipelining and memory hierarchy. A supplemental textbook is recommended for those interested in the subject: [Computer Organization and Design](https://smile.amazon.com/Computer-Organization-Design-Fifth-Architecture/dp/0124077269).
|
Note 1: The 'From Nand to Tetris' course, in part I, will have you create an entire computer architecture from scratch, but are missing key elements from computer architecture such as pipelining and memory hierarchy.
|
||||||
|
A supplemental textbook is recommended for those interested in the subject:
|
||||||
|
[Computer Organization and Design](https://smile.amazon.com/Computer-Organization-Design-Fifth-Architecture/dp/0124077269).
|
||||||
|
|
||||||
Note 2: Part II of the same course has you build the very lowest levels of an operating system on top of the computer architecture you built, however it does not go very deep into operating systems. For those interested in this subject, this free supplemental textbook is strongly recommended: [Operating Systems: Three Easy Pieces](http://pages.cs.wisc.edu/~remzi/OSTEP/).
|
Note 2: Part II of the same course has you build the very lowest levels of an operating system on top of the computer architecture you built, however it does
|
||||||
|
not go very deep into operating systems.
|
||||||
|
For those interested in this subject, this free supplemental textbook is strongly recommended:
|
||||||
|
[Operating Systems: Three Easy Pieces](http://pages.cs.wisc.edu/~remzi/OSTEP/).
|
||||||
|
|
||||||
### Core theory
|
### Core theory
|
||||||
|
|
||||||
**Topics covered**: divide and conquer; sorting and searching; randomized algorithms; graph search; shortest paths; data structures; greedy algorithms; minimum spanning trees; dynamic programming; NP-completeness; formal languages; Turing machines; computability; and more.
|
**Topics covered**: divide and conquer; sorting and searching;
|
||||||
|
randomized algorithms; graph search; shortest paths; data structures;
|
||||||
|
greedy algorithms; minimum spanning trees; dynamic programming; NP-completeness;
|
||||||
|
formal languages; Turing machines; computability; and more.
|
||||||
|
|
||||||
Courses | Duration | Effort | Prerequisites
|
Courses | Duration | Effort | Prerequisites
|
||||||
:-- | :--: | :--: | :--:
|
:-- | :--: | :--: | :--:
|
||||||
@ -117,7 +140,9 @@ Courses | Duration | Effort | Prerequisites
|
|||||||
|
|
||||||
### Core applications
|
### Core applications
|
||||||
|
|
||||||
**Topics covered**: neural networks; supervised learning; unsupervised learning; OpenGL; raytracing; block ciphers; authentication; public key encryption; and more.
|
**Topics covered**: neural networks; supervised learning; unsupervised learning;
|
||||||
|
OpenGL; raytracing; block ciphers; authentication; public key encryption;
|
||||||
|
and more.
|
||||||
|
|
||||||
Courses | Duration | Effort | Prerequisites
|
Courses | Duration | Effort | Prerequisites
|
||||||
:-- | :--: | :--: | :--:
|
:-- | :--: | :--: | :--:
|
||||||
@ -127,7 +152,10 @@ Courses | Duration | Effort | Prerequisites
|
|||||||
|
|
||||||
### Advanced programming
|
### Advanced programming
|
||||||
|
|
||||||
**Topics covered**: code coverage; random testing; debugging theory and practice; GPU programming; CUDA; parallel computing; object-oriented analysis and design; UML; large-scale software architecture and design; and more.
|
**Topics covered**: code coverage; random testing;
|
||||||
|
debugging theory and practice; GPU programming; CUDA; parallel computing;
|
||||||
|
object-oriented analysis and design; UML;
|
||||||
|
large-scale software architecture and design; and more.
|
||||||
|
|
||||||
Courses | Duration | Effort | Prerequisites
|
Courses | Duration | Effort | Prerequisites
|
||||||
:-- | :--: | :--: | :--:
|
:-- | :--: | :--: | :--:
|
||||||
@ -138,7 +166,10 @@ Courses | Duration | Effort | Prerequisites
|
|||||||
|
|
||||||
## Electives
|
## Electives
|
||||||
|
|
||||||
Some of these courses are offered less frequently, but you are encouraged to take them whenever they are available if you're interested. Compilers is recommended to any student who took a strong interest in the Programming Languages courses. Natural Language Processing is recommended to anyone who thinks they want to specialize in machine learning, artificial intelligence, etc. Cryptography is recommended to anyone who wants to learn more about zero knowledge systems and other advanced topics in cryptography.
|
Some of these courses are offered less frequently, but you are encouraged to take them whenever they are available if you're interested.
|
||||||
|
Compilers is recommended to any student who took a strong interest in the Programming Languages courses.
|
||||||
|
Natural Language Processing is recommended to anyone who thinks they want to specialize in machine learning, artificial intelligence, etc.
|
||||||
|
Cryptography is recommended to anyone who wants to learn more about zero knowledge systems and other advanced topics in cryptography.
|
||||||
|
|
||||||
Courses | Duration | Effort | Prerequisites
|
Courses | Duration | Effort | Prerequisites
|
||||||
:-- | :--: | :--: | :--:
|
:-- | :--: | :--: | :--:
|
||||||
@ -179,11 +210,14 @@ These aren't the only specializations you can choose. Check the following websit
|
|||||||
|
|
||||||
## Order of the classes
|
## Order of the classes
|
||||||
|
|
||||||
This guide was developed to be flexible. Ideally, it can be consumed in a linear approach, i.e. you complete one course at a time, but in reality different people have different preferences with regard to how many courses they wish to take at once, and different courses are available at different times and have wildly different time requirements.
|
This guide was developed to be flexible.
|
||||||
|
Ideally, it can be consumed in a linear approach, i.e. you complete one course at a time, but in reality different people have different preferences with regard to how many courses they wish to take at once.
|
||||||
|
Plus, different courses are available at different times and have wildly different time requirements.
|
||||||
|
|
||||||
Therefore, many students will take the courses in a non-linear order, based on availability and how much time they have to devote to each class.
|
Therefore, many students will take the courses in a non-linear order, based on availability and how much time they have to devote to each class.
|
||||||
|
|
||||||
Any course that is part of 'Core CS' section should be available either regularly, in self-paced format, or in archived form. Some of the electives are only available once in a while.
|
Any course that is part of 'Core CS' section should be available either regularly, in self-paced format, or in archived form.
|
||||||
|
Some of the electives are only available once in a while.
|
||||||
|
|
||||||
## How to track and show your progress
|
## How to track and show your progress
|
||||||
|
|
||||||
@ -192,48 +226,62 @@ Any course that is part of 'Core CS' section should be available either regularl
|
|||||||
|
|
||||||
Now that you have a copy of our official board, you just need to pass the cards to the `Doing` column or `Done` column as you progress in your study.
|
Now that you have a copy of our official board, you just need to pass the cards to the `Doing` column or `Done` column as you progress in your study.
|
||||||
|
|
||||||
We also have **labels** to help you have more control through the process. The meaning of each of these labels is:
|
We also have **labels** to help you have more control through the process.
|
||||||
|
The meaning of each of these labels is:
|
||||||
|
|
||||||
- `Main Curriculum`: cards with that label represent courses that are listed in our curriculum.
|
- `Main Curriculum`: cards with that label represent courses that are listed in our curriculum.
|
||||||
- `Extra Courses`: cards with that label represent courses that was added by the student.
|
- `Extra Courses`: cards with that label represent courses that was added by the student.
|
||||||
- `Doing`: cards with that label represent courses the student is current doing.
|
- `Doing`: cards with that label represent courses the student is current doing.
|
||||||
- `Done`: cards with that label represent courses finished by the student. Those cards should also have the link for at least one project/article built with the knowledge acquired in such course.
|
- `Done`: cards with that label represent courses finished by the student.
|
||||||
- `Section`: cards with that label represent the section that we have in our curriculum. Those cards with the `Section` label are only to help the organization of the Done column. You should put the *Course's cards* below its respective *Section's card*.
|
Those cards should also have the link for at least one project/article built with the knowledge acquired in such course.
|
||||||
|
- `Section`: cards with that label represent the section that we have in our curriculum.
|
||||||
|
Those cards with the `Section` label are only to help the organization of the Done column.
|
||||||
|
You should put the *Course's cards* below its respective *Section's card*.
|
||||||
- `Extra Sections`: cards with that label represent sections that was added by the student.
|
- `Extra Sections`: cards with that label represent sections that was added by the student.
|
||||||
|
|
||||||
The intention of this board is to provide our students a way to track their progress, and also the ability to show their progress through a public page for friends, family, employers, etc. You can change the status of your board to be **public** or **private**.
|
The intention of this board is to provide our students a way to track their progress, and also the ability to show their progress through a public page for friends, family, employers, etc.
|
||||||
|
You can change the status of your board to be **public** or **private**.
|
||||||
|
|
||||||
## Should I take all courses?
|
## Should I take all courses?
|
||||||
|
|
||||||
If you are serious about getting an online education comparable to a bachelor's degree in Computer Science, you should absolutely take **all** of the courses under the 'Core CS' section.
|
If you are serious about getting an online education comparable to a bachelor's degree in Computer Science, you should absolutely take **all** of the courses under the 'Core CS' section.
|
||||||
|
|
||||||
These courses are equivalent to about 3/4 of a full bachelor's degree in CS. So if you want to really complete your studies, then you should select one of the specializations to finish out your program, such as one in Artificial Intelligence or Big Data.
|
These courses are equivalent to about 3/4 of a full bachelor's degree in CS.
|
||||||
|
So if you want to really complete your studies, then you should select one of the specializations to finish out your program, such as one in Artificial Intelligence or Big Data.
|
||||||
|
|
||||||
## Duration of the project
|
## Duration of the project
|
||||||
|
|
||||||
If you are able to devote 18-20 hours per week to this curriculum, taking 1-3 clases at a time, you could hypothetically finish the Core CS section in under 2 years. A specialization would then take you a few more months.
|
If you are able to devote 18-20 hours per week to this curriculum, taking 1-3 clases at a time, you could hypothetically finish the Core CS section in under 2 years.
|
||||||
|
A specialization would then take you a few more months.
|
||||||
|
|
||||||
It will probably take longer if you go slower, but regardless, your **reward** will be proportional to your **effort**.
|
It will probably take longer if you go slower, but regardless, your **reward** will be proportional to your **effort**.
|
||||||
|
|
||||||
You must focus on your **habit**, and **forget** about goals. Try to invest 1 ~ 2 hours **every day** studying this curriculum. If you do this, **inevitably** you'll finish this curriculum.
|
You must focus on your **habit**, and **forget** about goals.
|
||||||
|
Try to invest 1 ~ 2 hours **every day** studying this curriculum.
|
||||||
|
If you do this, **inevitably** you'll finish this curriculum.
|
||||||
|
|
||||||
> See more about "Commit to a process, not a goal" [here](http://jamesclear.com/goals-systems).
|
> See more about "Commit to a process, not a goal" [here](http://jamesclear.com/goals-systems).
|
||||||
|
|
||||||
## Project-based
|
## Project-based
|
||||||
|
|
||||||
**OSS University** is **project-focused**. You are encouraged to do the assignments and exams for each course, but what really matters is whether you can *use* your knowledge to solve a real world problem.
|
**OSS University** is **project-focused**.
|
||||||
|
You are encouraged to do the assignments and exams for each course, but what really matters is whether you can *use* your knowledge to solve a real world problem.
|
||||||
|
|
||||||
In order to show everyone that you successfully finished a course, you should create a **real project**.
|
In order to show everyone that you successfully finished a course, you should create a **real project**.
|
||||||
|
|
||||||
> "What does it mean?"
|
> "What does it mean?"
|
||||||
|
|
||||||
After you finish a course, you should think about a problem that you can solve using the acquired knowledge in the course. It doesn't have to be a big project, but rather it should show the world that you are capable of creating something useful with the concepts that you learned.
|
After you finish a course, you should think about a problem that you can solve using the acquired knowledge in the course.
|
||||||
|
It doesn't have to be a big project, but rather it should show the world that you are capable of creating something useful with the concepts that you learned.
|
||||||
|
|
||||||
It won't make sense to do a project for *every* course, as some are purely theoretical (e.g. calculus). But anytime you gain practical skills (e.g., a new programming language), you should use it right away to **validate** and **consolidate** your knowledge.
|
It won't make sense to do a project for *every* course, as some have no immediate practical application.
|
||||||
|
But anytime you gain practical skills (e.g., a new programming language), you should use it right away to **validate** and **consolidate** your knowledge.
|
||||||
|
|
||||||
The projects of all students will be listed in [this](PROJECTS.md) file. **Submit your project's information in that file after you conclude it**.
|
The projects of all students will be listed in [this](PROJECTS.md) file.
|
||||||
|
**Submit your project's information in that file after you conclude it**.
|
||||||
|
|
||||||
Put the OSSU-CS badge in the README of your repository! [![Open Source Society University - Computer Science](https://img.shields.io/badge/OSSU-computer--science-blue.svg)](https://github.com/open-source-society/computer-science)
|
Put the OSSU-CS badge in the README of your repository!
|
||||||
|
[![Open Source Society University - Computer Science](https://img.shields.io/badge/OSSU-computer--science-blue.svg)](https://github.com/open-source-society/computer-science)
|
||||||
|
|
||||||
- Markdown: `[![Open Source Society University - Computer Science](https://img.shields.io/badge/OSSU-computer--science-blue.svg)](https://github.com/open-source-society/computer-science)`
|
- Markdown: `[![Open Source Society University - Computer Science](https://img.shields.io/badge/OSSU-computer--science-blue.svg)](https://github.com/open-source-society/computer-science)`
|
||||||
- HTML: `<a href="https://github.com/open-source-society/computer-science"><img alt="Open Source Society University - Computer Science" src="https://img.shields.io/badge/OSSU-computer--science-blue.svg"></a>`
|
- HTML: `<a href="https://github.com/open-source-society/computer-science"><img alt="Open Source Society University - Computer Science" src="https://img.shields.io/badge/OSSU-computer--science-blue.svg"></a>`
|
||||||
@ -264,17 +312,20 @@ Here are some tips about how you can do that:
|
|||||||
|
|
||||||
## Cooperative work
|
## Cooperative work
|
||||||
|
|
||||||
**We love cooperative work**! Use our [channels](#community) to communicate with other fellows to combine and create new projects!
|
**We love cooperative work**!
|
||||||
|
Use our [channels](#community) to communicate with other fellows to combine and create new projects!
|
||||||
|
|
||||||
## Which programming languages should I use?
|
## Which programming languages should I use?
|
||||||
|
|
||||||
My friend, here is the best part of liberty! You can use **any** language that you want to complete the project.
|
My friend, here is the best part of liberty!
|
||||||
|
You can use **any** language that you want to complete the project.
|
||||||
|
|
||||||
The important thing for each course is to **internalize** the core concepts and to be able to use them with whatever tool (programming language) that you wish.
|
The important thing for each course is to **internalize** the core concepts and to be able to use them with whatever tool (programming language) that you wish.
|
||||||
|
|
||||||
## Content Policy
|
## Content Policy
|
||||||
|
|
||||||
You must share **only** files that you are **allowed** to! **Do NOT disrespect the code of conduct** that you signed in the beginning of some courses.
|
You must share **only** files that you are **allowed** to!
|
||||||
|
**Do NOT disrespect the code of conduct** that you signed in the beginning of some courses.
|
||||||
|
|
||||||
[Be creative](#be-creative) in order to show your progress! :smile:
|
[Be creative](#be-creative) in order to show your progress! :smile:
|
||||||
|
|
||||||
@ -284,7 +335,8 @@ You must share **only** files that you are **allowed** to! **Do NOT disrespect t
|
|||||||
|
|
||||||
# Prerequisite
|
# Prerequisite
|
||||||
|
|
||||||
This curriculum assumes the student has already taken high school math, including algebra, geometry, and pre-calculus. Some high school students will have taken calculus, but this is usually only about 3/4 of a college calculus class, so the calculus courses listed above are still recommended.
|
This curriculum assumes the student has already taken high school math, including algebra, geometry, and pre-calculus.
|
||||||
|
Some high school students will have taken calculus, but this is usually only about 3/4 of a college calculus class, so the calculus courses listed above are still recommended.
|
||||||
|
|
||||||
Apart from those, the only things that you need to know are how to use **Git** and **GitHub**. Here are some resources to learn about them:
|
Apart from those, the only things that you need to know are how to use **Git** and **GitHub**. Here are some resources to learn about them:
|
||||||
|
|
||||||
@ -332,7 +384,8 @@ We also have a chat room! [![Join the chat at https://gitter.im/open-source-soci
|
|||||||
|
|
||||||
Add **Open Source Society University** to your [Facebook](https://www.facebook.com/ossuniversity) profile!
|
Add **Open Source Society University** to your [Facebook](https://www.facebook.com/ossuniversity) profile!
|
||||||
|
|
||||||
> **PS**: A forum is an ideal way to interact with other students as we do not lose important discussions, which usually occur in communication via chat apps. **Please use our subreddit/group for important discussions**.
|
> **PS**: A forum is an ideal way to interact with other students as we do not lose important discussions, which usually occur in communication via chat apps.
|
||||||
|
**Please use our subreddit/group for important discussions**.
|
||||||
|
|
||||||
# Team
|
# Team
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user