Apply suggestions from code review

Co-authored-by: Pulkit Krishna <contact@virtualhub.eu.org>

Author: Flomza

docs/computer-science/advanced-cs/electives/index.md

@@ -101,6 +101,3 @@ Courses | Duration | Effort | Prerequisites
 [Introduction to Formal Logic](https://forallx.openlogicproject.org/) | 10 weeks | 4-8 hours/week | [Set Theory](https://www.youtube.com/playlist?list=PL5KkMZvBpo5AH_5GpxMiryJT6Dkj32H6N)
 [Probability](https://stat110.hsites.harvard.edu/) | 15 weeks | 5-10 hours/week | [Differentiation and Integration](https://www.edx.org/course/calculus-1b-integration)
 
-import DocCardList from '@theme/DocCardList';
-
-<DocCardList />

docs/computer-science/advanced-cs/final-project/index.md

@@ -30,6 +30,3 @@ Courses | Duration | Effort | Prerequisites
 [Functional Programming in Scala (Specialization)](https://www.coursera.org/specializations/scala) | 29 weeks | 4-5 hours/week | One year programming experience
 [Game Design and Development with Unity 2020 (Specialization)](https://www.coursera.org/specializations/game-design-and-development) | 6 months | 5 hours/week | programming, interactive design
 
-import DocCardList from '@theme/DocCardList';
-
-<DocCardList />

docs/computer-science/math/discrete-math/index.md

@@ -9,10 +9,13 @@ Covers everything typically found in a Discrete Math course.
 - [Mathematics for Computer Science 2019](https://openlearninglibrary.mit.edu/courses/course-v1:OCW+6.042J+2T2019/about), 65 hrs
 - Alternative: [Mathematics for Computer Science 2010](https://ocw.mit.edu/courses/6-042j-mathematics-for-computer-science-fall-2010/)
 
-Many students choose to spend much more time on this subject by going through a textbook. Although this will take substantially longer and comes at a price, it is easier for most people than the MIT course & goes into greater detail, often saving time in later courses such as [Theory](/computer-science/theory/index.md).
+Many students choose to go with a paid textbook for easier introduction to this subject:
 - [Discrete Mathematics with Applications](https://www.amazon.com/Discrete-Mathematics-Applications-Susanna-Epp/dp/1337694193/), 1 year
 
-If you need help writing mathematical proofs but don't want to spend the money and time on Epps, check out the freely available [Book of Proof](https://richardhammack.github.io/BookOfProof/).
+This book covers some topics which are covered again in [theory courses](/computer-science/theory/index.md). The MIT course and the corresponding book covers more topics, which are not covered by this book.
+
+
+[Book of Proof](https://richardhammack.github.io/BookOfProof/) can be used as a quick introduction to writing proofs.
 
 Extra resources:
 - [2015/2019 Solutions](https://github.com/spamegg1/Math-for-CS-solutions)

docs/computer-science/theory/index.md

@@ -5,7 +5,7 @@ sidebar_position: 7
 # Theory
 *Timeline: 64 - 128 hours*
 
-Covers everything typically found on the theoretical side of a Data Structures & Algorithms course. The rest of DSA was covered throughout [Program Design](../program-design/).
+Covers everything typically found on the theoretical side of a Data Structures & Algorithms course. Introduction to DSA was covered throughout [Program Design](../program-design/).
 - [Algorithms 1](https://www.coursera.org/learn/algorithms-divide-conquer), 16-32 hrs
 - [Algorithms 2](https://www.coursera.org/learn/algorithms-graphs-data-structures), 16-32 hrs
 - [Algorithms 3](https://www.coursera.org/learn/algorithms-greedy), 16-32 hrs