FOUNDATIONAL LEVEL COURSE Mathematics for Data Science I

FOUNDATIONAL LEVEL COURSE Mathematics for Data Science I  


functions (straight lines, polynomials, exponentials and logarithms) and discrete mathematics (basics, graphs) with many examples. The students will be exposed to the idea of using abstract mathematical structures to represent concrete real life situations.

Reference Documents / Books

Sets & Functions (VOL 1)

DOWNLOAD

Calculus (VOL 2)

DOWNLOAD

GRAPH THEORY (VOL 3)

DOWNLOAD

Prescribed Books

The following are the suggested books for the course:

Introductory Algebra: a real-world approach (4th Edition) - by Ignacio Bello

What you’ll learnVIEW COURSE VIDEOS 

Recall the basics of sets, natural numbers, integers, rational numbers, and real numbers.
Learn to use the coordinate system, and plot straight lines.
Identify the properties and differences between linear, quadratic, polynomial, exponential, and logarithmic functions.
Find roots, maxima and minima of polynomials using algorithmic methods.
Learn to represent sets and relations between set elements as discrete graphs using nodes and edges.
Formulate some common real-life problems on graphs and solve them.

Comments

Post a Comment

Popular posts from this blog

Minimum Cost Spanning Tress: Prim's Algorithm

Prim's algorithm is another efficient greedy algorithm for finding a minimum spanning tree (MST) in a weighted undirected graph. It works by starting with an arbitrary vertex and iteratively adding the cheapest edge that connects the growing tree to an unvisited vertex, until all vertices are included. Here's how it works: Start with an empty MST and choose any vertex as the starting point. Identify all edges connected to the starting vertex. Add the cheapest edge that doesn't create a cycle to the MST. Consider the vertex at the other end of the added edge. Add all edges connected to this new vertex to the set of candidate edges. Repeat steps 2 and 3, always adding the cheapest edge that doesn't create a cycle to the MST and expanding the tree to include new vertices, until all vertices are included. Here are some key points about Prim's algorithm: It is a greedy algorithm, meaning it makes the locally optimal choice at each step (adding the cheapest edge) in the
Read more

week 12

Set theory ऑपरेशन ,  union intersection elements properties empty sets questions .... Cardinality  Relations  Binary relations  for ordered pair Transtive equivalence  3.Graphing of polynomials Functions 
Read more