Course audit report

AI

Done Role: Ml / Data Engineer 1 Findings Artificial Intelligence — Broad Introductory Survey
Auditor Done Market Fit Done Topics Done
Run another role
1 findings · 1 medium
Incorrect Week 4-Informed Search Algorithms.pdf, Page 37 (Properties of A* Search)

What the slide says

Optimal? YES if used Admissible Heuristic

Primary source ✓ Source checked

inst.eecs.berkeley.edu ↗

An additional caveat of graph search is that it tends to ruin the optimality of A*, even under admissible heuristics. ... Hence, to maintain optimality under A* graph search, we need an even stronger property than admissibility, consistency.

What to learn instead

State the optimality claim conditional on the search variant: A* tree search is optimal with an admissible heuristic; A* graph search (which the course teaches in Week 3 with a closed/reached set to avoid revisiting states) is optimal only with a consistent (monotonic) heuristic h(n) <= c(n,n') + h(n'), because an admissible-but-inconsistent heuristic can cause a state to be locked into the reached set via a suboptimal path before the optimal path is discovered.

This curriculum delivers a faithful Russell & Norvig classical/symbolic-AI tour with an introductory ML chapter, but the ml_data job market it lists on its own job-description slides has moved on — most demanded skills (Python, pandas, scikit-learn, PyTorch, hugging face) sit outside this survey's depth bound, while the three legitimate, in-bound extensions are deepening statistics, and bridging the existing KR/IR material to RAG and vector-database concepts.

Gaps

Statistics — extending the partial DS treatment beyond named-only foundations and a handful of formulas to a conceptual tour of distributions, sampling, and inferential statistics (still survey-depth, no proofs)

The course names statistics as a DS foundation and operationally uses a few statistical objects — Z-score normalization (Week 12 p.12), MAE/MSE means (Week 12 p.59), median imputation (Week 12 p.12), and the assertion 'Data Scientists have a strong background in statistics' (Week 12 p.65) — but never introduces distributions, sampling, hypothesis testing, or inference even at a conceptual level. Market demand is 75% (9/12 ml_data postings). Extending the existing DS-foundations slide with a conceptual overview of descriptive vs inferential statistics fits the survey depth bound (no formal proofs, no Python tutorials).

Retrieval-Augmented Generation (RAG) — connecting the existing knowledge-representation and information-retrieval material to modern retrieval-augmented LLM pipelines at a conceptual level

The course teaches knowledge representation deeply (Week 7 FOL KB; Week 8 ontologies — 'An ontology = concepts+properties+axioms+values' p.39; WordNet/ConceptNet/CYC reusable KBs p.29) and separately names information retrieval and question-answering as NLP applications (Week 10 p.23: 'Index and search large texts ... Question answering; Knowledge acquisition'). These two partially-covered threads are the natural conceptual bridge to RAG and make it a fair in-scope extension. 5/12 ml_data postings demand RAG. Survey-depth conceptual coverage only — no LangChain code, no embedding-math derivations.

Vector databases / embedding-based knowledge representation — extending the symbolic-KR unit with a conceptual contrast between ontology/FOL representations and dense-vector representations used for semantic search

Week 8 teaches one specific paradigm of knowledge representation — ontologies and OWL ('Ontology is an explicit specification of conceptualization', p.3) — and Week 10 names information retrieval as an NLP application (p.23). The course's KR taxonomy (Week 7 p.3 contrasts Propositional / First-Order / Temporal / Probability / Fuzzy logics by 'what they commit to as primitives') is the obvious place to add a conceptual sibling: vector / embedding representations and how they enable semantic similarity search. 5/12 ml_data postings demand vector databases. This is a conceptual extension of two partially-covered topics, not a Pinecone tutorial — it stays inside the depth bound.

What the curriculum actually teaches (18 skills)
  • Russell & Norvig (AIMA) classical-AI framing · Artificial Intelligence (Week 1 — Intro to AI)
    Week 1 cover slide: 'Artificial Intelligence: A Modern Approach — Peter Norvig and Stuart J. Russell' (used as the textbook frame across all weeks).
  • Intelligent agents / PEAS (sensors, actuators, environments) · Artificial Intelligence (Week 2 — Intelligent Agents)
    Week 1 p.12: 'An agent can be anything that perceives the environment through sensors and act upon that environment through actuators.'
  • Uninformed search (BFS, DFS, IDS) and Informed search (Greedy best-first, A* with admissible heuristics) · Artificial Intelligence (Week 3 — Problem Solving Agents; Week 4 — Informed Search)
    Week 4 p.28: 'A* Search ... f(n) = g(n) + h(n)'; comparison table on p.38 lists BFS/DFS/IDS/Greedy/A*.
  • Propositional and First-Order/Predicate Logic with quantifiers (∀, ∃) · Artificial Intelligence (Week 6 — Logical Agents 2; Week 7 — Knowledge Representation)
    Week 7 p.7: 'Syntax of FOL: Constant, Variable, Predicate, Connectives ¬ ∧ ∨ ⇒ ⇔, Equality =, Functions, quantifier ∀ ∃'.
  • Knowledge representation via ontologies (OWL, Protégé, WordNet, ConceptNet, CYC), Open vs Closed World Assumption · Artificial Intelligence (Week 8 — Knowledge Representation: Ontology)
    Week 8 p.8: 'OWL (stands for Web Ontology Language) is a formal language used to create and define ontologies'; p.29 lists 'WordNet ... ConceptNet ... CYC' as reusable knowledge bases; p.12 contrasts CWA vs OWA.
  • Expert systems (rule-based reasoning) · Artificial Intelligence (Week 9 — Expert Systems)
    Week 1 p.11 goal of AI: 'To Create Expert Systems — The systems which exhibit intelligent behavior, learn, demonstrate, explain, and advice its users.'
  • Classical NLP pipeline (lexical/morphology, syntactic parsing, semantics, discourse, pragmatics) · Artificial Intelligence (Week 10 — Intro to NLP)
    Week 10 p.7–8: '1. Lexical Analysis (Morphological) ... 2. Syntactic Analysis (Parsing) ... 3. Semantic Analysis ... 4. Discourse Integration ... 5. Pragmatic Analysis'.
  • Phrase-structure grammars, parse trees, POS tagging · Artificial Intelligence (Week 10 — Intro to NLP)
    Week 10 p.41: 'Phrase Structure Rules ... S → NP VP ... NP → DET N ... VP → V NP'; p.29 'PoS tagging: Assign tags to each word from the lexicon'.
  • Information retrieval / question answering as an NLP application area (named only) · Artificial Intelligence (Week 10 — Intro to NLP)
    Week 10 p.23: 'NLP is used in many applications such: Classify text into categories; Index and search large texts; ... Information extraction ... Question answering; Knowledge acquisition'.
  • Type-1 fuzzy logic (degrees of truth) · Artificial Intelligence (Week 11 — Fuzzy Logic)
    Week 11: 'Fuzzy logic calculates the shades of gray between black/white' (Week 11 p. on fuzzy sets).
  • ML problem framing (Mitchell <P,T,E>) and the four ML paradigms: supervised, unsupervised, semi-supervised, reinforcement · Artificial Intelligence (Week 12 — Intro to DS and ML)
    Week 12 p.17: 'Machine Learning is the study of algorithms that: improve their performance P at some task T with experience E'; p.23 lists '1. Supervised ... 2. Unsupervised ... 3. Semi-supervised ... 4. Reinforcement learning'.
  • Named classical ML algorithms (linear/logistic regression, decision trees, random forest, naive Bayes, k-means, PCA) · Artificial Intelligence (Week 12 — Intro to DS and ML)
    Week 12 p.48: 'Example: Logistic Regression, Liner regression, Random forest, Decision trees and Naive Bayes ... Example: K-means clustering and Principal component analysis PCA'.
  • Classification metrics (confusion matrix, accuracy, precision, recall, F1) and regression metrics (MAE, MSE) · Artificial Intelligence (Week 12 — Intro to DS and ML)
    Week 12 p.53–60 walk through Confusion Matrix, Accuracy = (TP+TN)/(TP+TN+FP+FN), Precision, Recall, F1 = 2·P·R/(P+R), MAE, MSE.
  • Train/test split (70/30), model/training/prediction terminology · Artificial Intelligence (Week 12 — Intro to DS and ML)
    Week 12 p.51: 'Training set 70% ... Test Set 30% ... Features (X) ... Label / Target (Y)'.
  • Data preprocessing concepts (missing-value imputation, outlier handling, Min-Max / Z-score normalization, one-hot & label encoding, feature engineering, PCA dim-reduction) · Artificial Intelligence (Week 12 — Intro to DS and ML)
    Week 12 p.12: 'Normalize or scale features to bring them into a uniform range (e.g., Min-Max Scaling, Z-score). Encode categorical data (e.g., one-hot encoding, label encoding). Create new features (feature engineering) ... Reduce dimensionality using techniques like PCA'.
  • EDA visualizations (histograms, box plots, bar charts, scatter plots, heatmaps) · Artificial Intelligence (Week 12 — Intro to DS and ML)
    Week 12 p.13–15: 'Histograms ... Box Plots ... Bar Charts ... Scatter Plots ... Heatmaps'.
  • Statistics as a foundation of data science (named, plus thin operational use: mean, median, Z-score, MSE) · Artificial Intelligence (Week 12 — Intro to DS and ML)
    Week 12 p.7: 'Principles can be statistical, computational, algorithmic, visual ... Statistics and Mathematics'; p.65: 'Data Scientists have a strong background in statistics'.
  • Awareness of DS/ML job roles (data engineer, data analyst, data scientist, ML engineer) and that they use Python/SQL/R · Artificial Intelligence (Week 12 — Intro to DS and ML)
    Week 12 p.63–66 name 'SQL, Java, Scala, or Python', 'SQL, spreadsheets, Tableau, Power BI, or Looker', 'SQL, Python, and R'. (Listed in job-description slides only — never taught syntactically.)

The three in-bound prescriptions all extend topics the course already names but stops short on: (1) lifting the existing 'statistics is foundational' slide into a conceptual descriptive-vs-inferential tour (75% of ml_data postings), (2) bridging Week 7/8 knowledge bases to Week 10's already-named IR/QA via a conceptual RAG slide (42%), and (3) adding vector/embedding representations as a sibling row to Week 7's KR-paradigm taxonomy (42%). Together they touch all 12 ml_data sample postings through the statistics+RAG+vector union.

These three prescriptions are the only legitimate in-bound extensions surfaced by Market-fit. They touch all 12 ml_data sample postings on at least one of the named conceptual axes (statistics, RAG, vector DBs), but they do NOT close the much larger hands-on gap — Python, pandas, scikit-learn, PyTorch, SQL, Git, Docker, AWS, dbt, Spark, Airflow, Kafka, etc. — because those are implementation/tooling skills outside this introductory survey's stated depth bound. Honest framing: the course can become a credible conceptual on-ramp to ml_data work, but a separate hands-on sequence is required before graduates are job-ready for these postings.

#1 ~4h to learn

Descriptive vs inferential statistics — conceptual tour of distributions, sampling, and hypothesis testing

The course already names statistics as the spine of data science — extend that one slide into a conceptual descriptive-vs-inferential tour so students leave with a vocabulary the 75% of ml_data postings demanding 'statistics' actually mean.

statisticsdistributionssamplinghypothesis testinginferencedescriptive statistics

Where it fits

Artificial Intelligence (Week 12 — Intro to DS and ML) · Week 12 already names statistics as a DS foundation (p.7 'Principles can be statistical, computational, algorithmic, visual'; p.65 'Data Scientists have a strong background in statistics') and uses a few statistical objects operationally (Z-score normalization p.12, MAE/MSE p.59, median imputation p.12). The gap is that the slide naming statistics never opens into descriptive vs inferential framing. A conceptual one-section extension on the existing DS-foundations slide (what a distribution is, what sampling is, what inference is for) extends partial coverage without breaking survey depth.

Prerequisites

  • Mean / median / Z-score as operational tools · already covered in Artificial Intelligence (Week 12 — Intro to DS and ML)
  • MAE / MSE as average-error formulas · already covered in Artificial Intelligence (Week 12 — Intro to DS and ML)
  • Train/test split mindset (samples drawn from a population) · already covered in Artificial Intelligence (Week 12 — Intro to DS and ML)
  • Probability theory beyond point estimates not yet covered
#2 ~3h to learn

Retrieval-Augmented Generation (RAG) as the modern bridge between knowledge representation and NLP question answering

Week 10 already lists 'index large texts' and 'question answering' on the same slide and Weeks 7–8 already teach knowledge bases — a single conceptual slide on RAG ties those threads to what 5 of 12 ml_data postings now ask for.

ragretrieval-augmented generationinformation retrievalquestion answeringllmsknowledge bases

Where it fits

Artificial Intelligence (Week 10 — Intro to NLP) · Week 10 already names the exact ingredients of RAG without connecting them: p.23 lists 'Index and search large texts ... Information extraction ... Question answering; Knowledge acquisition' as NLP applications. Pair that with Week 7/8's deep treatment of knowledge bases (FOL KB, OWL ontologies, WordNet/ConceptNet/CYC reusable KBs at Week 8 p.29) and the conceptual story 'retrieve from a knowledge source, then have a generator answer' is a one-slide extension of an already-named application. Stays at survey depth — no LangChain code, no embedding math.

Prerequisites

  • Information retrieval / question answering named as NLP applications · already covered in Artificial Intelligence (Week 10 — Intro to NLP)
  • Knowledge bases and ontologies as retrievable knowledge sources · already covered in Artificial Intelligence (Week 8 — Knowledge Representation: Ontology)
  • FOL knowledge base (tell/ask) intuition · already covered in Artificial Intelligence (Week 6 — Logical Agents 2; Week 7 — Knowledge Representation)
  • Modern LLMs as generators (transformer-era NLP) not yet covered
#3 ~3h to learn

Vector / embedding-based knowledge representation as a sibling paradigm to symbolic KR

Week 7's KR taxonomy already invites the question 'what other ways can knowledge be represented?' — adding embeddings/vector stores as a conceptual sibling closes the gap to the 5 ml_data postings demanding vector databases without leaving the survey lane.

vector databasesembeddingssemantic searchdense representationsknowledge representation

Where it fits

Artificial Intelligence (Week 8 — Knowledge Representation: Ontology) · Week 7 p.3 already presents a taxonomy of representation paradigms ('what they commit to as primitives' — Propositional / First-Order / Temporal / Probability / Fuzzy) and Week 8 deepens one specific branch ('Ontology is an explicit specification of conceptualization', p.3). Adding a conceptual sibling row — dense-vector / embedding representations and the semantic-similarity-search retrieval they enable — is the natural extension of an existing taxonomy slide. It also gives the Week 10 IR/QA application slide a second concrete substrate beyond keyword indexing. No Pinecone tutorial, no math — just the conceptual contrast 'symbolic vs distributed'.

Prerequisites

  • KR paradigm taxonomy (logics compared by primitives) · already covered in Artificial Intelligence (Week 6 — Logical Agents 2; Week 7 — Knowledge Representation)
  • Ontologies as one concrete KR paradigm · already covered in Artificial Intelligence (Week 8 — Knowledge Representation: Ontology)
  • Information retrieval as an NLP application · already covered in Artificial Intelligence (Week 10 — Intro to NLP)
  • Linear-algebra intuition for high-dimensional vectors and cosine similarity not yet covered