{ "schemaVersion": 1, "checked": "2026-10-04", "scope": "Nine selected course/programme reviews across six institutions; not all global universities.", "reviews": [ { "id": "mit-decisions", "provider": "MIT", "title": "Data, Models, and Decisions — Fall 2014", "evidenceType": "Archived graduate syllabus", "sourceUrl": "https://ocw.mit.edu/courses/15-060-data-models-and-decisions-fall-2014/pages/syllabus/", "topics": [ "Uncertainty and decision models", "Simulation", "Historical data and limited information", "Resource allocation", "Spreadsheet modelling and managerial interpretation" ], "chapterIds": [ "probability", "statistics", "operations-research", "decision-science" ], "access": "OCW shares course materials openly. The required textbook is separately listed; its free availability was not established.", "boundary": "An archived offering, not verification of present MIT degree requirements.", "originalStudyTask": "Build a demand scenario table for a small retailer. Compare expected contribution with shortage risk. Write a decision memo explaining which assumptions could change the recommendation, then identify the data needed to test them." }, { "id": "mit-python", "provider": "MIT", "title": "Introduction to Computer Science and Programming in Python — Fall 2016", "evidenceType": "Archived undergraduate syllabus", "sourceUrl": "https://ocw.mit.edu/courses/6-0001-introduction-to-computer-science-and-programming-in-python-fall-2016/pages/syllabus/", "topics": [ "Problem solving through programming", "Small useful programs", "Python foundations" ], "chapterIds": [ "algorithms", "bca-python-programming", "data-structures" ], "access": "Lecture videos, slides/code and problem sets are linked. Quizzes and finger exercises are not available on OCW; textbook access is separate.", "boundary": "The offering used Python 3.5. Check contemporary documentation when running archived code.", "originalStudyTask": "Write a function that validates a transaction record before calculating its value. Test empty input, negative quantities and invalid numbers. Explain why a program that runs without crashing can still produce a wrong business result." }, { "id": "harvard-cs50", "provider": "Harvard", "title": "CS50x", "evidenceType": "Course syllabus", "sourceUrl": "https://cs50.harvard.edu/x/syllabus/", "topics": [ "Abstraction and algorithms", "Data structures", "Resource management and security", "Software engineering", "C, Python and SQL", "Web development", "Problem sets and a final project" ], "chapterIds": [ "algorithms", "data-structures", "relational-databases", "web-foundations" ], "access": "The course is free to take. A free CS50 certificate requires at least 70% on each problem set and the final project; see the separate certificate page.", "boundary": "A course certificate is not a degree. Separate verified-certificate arrangements are not evaluated here.", "originalStudyTask": "Develop a small order-recording application. Separate validation, storage and presentation. Record a threat model, test duplicate submissions, and show how a user can correct an error without silently destroying the original record." }, { "id": "openlearn-operations", "provider": "The Open University", "title": "Understanding operations management", "evidenceType": "Short-course outline", "sourceUrl": "https://www.open.edu/openlearn/money-business/leadership-management/understanding-operations-management/content-section-0", "topics": [ "Operations and the operations manager", "Transformation inputs, outputs and processes", "Feedback", "System boundaries and process perspectives" ], "chapterIds": [ "operations-flow", "quality-management", "department-interoperability" ], "access": "Free learning content; provider estimate: four hours, Level 3 Advanced. A free account enables progress, activities and a statement of participation.", "boundary": "Provider level and duration describe this short course, not a complete operations curriculum or degree credit.", "originalStudyTask": "Map an enquiry-to-delivery process. Mark information inputs, physical inputs, outputs and feedback. Identify one boundary where another department receives incomplete information. Propose a measurable handoff improvement and a way to detect unintended delay elsewhere." }, { "id": "wharton-mba", "provider": "University of Pennsylvania — Wharton", "title": "MBA curriculum", "evidenceType": "Public programme structure", "sourceUrl": "https://mba.wharton.upenn.edu/mba-curriculum/", "topics": [ "Leadership and teamwork", "Marketing and microeconomics", "Statistics and communication", "Operations and information decisions", "Accounting and corporate finance", "Management, law and ethics", "Core, majors and electives" ], "chapterIds": [ "management", "marketing-foundation", "statistics", "communication", "finance-value" ], "access": "The curriculum description is publicly readable. This is not a free MBA or a verified free course offering.", "boundary": "Selected programme structure was reviewed; individual elective syllabi and enrolment conditions were not.", "originalStudyTask": "Create a cross-functional expansion proposal: customer evidence, unit economics, staffing, operational capacity and ethical risks. Give each department a decision and an accountable owner. Explain why a favourable financial projection alone cannot establish that the expansion is feasible." }, { "id": "iitm-data", "provider": "IIT Madras", "title": "Data Science and Applications academics", "evidenceType": "Public programme structure", "sourceUrl": "https://study.iitm.ac.in/ds/academics.html", "topics": [ "Foundation mathematics and statistics", "Computational thinking and Python", "Database management and algorithms", "Application development and projects", "Business data management", "Machine learning and business analytics" ], "chapterIds": [ "discrete-mathematics", "statistics", "algorithms", "bca-dbms", "bca-python-programming", "bca-data-engineering" ], "access": "The academic outline is public. Registered courses have fees, and online coursework includes in-person invigilated assessments. Do not treat the programme as a free MOOC.", "boundary": "Foundation prerequisites and selected course tables were reviewed; this is not an audit of every module.", "originalStudyTask": "Design a staged data project: validate source records, model a database, calculate descriptive measures, and only then attempt prediction. Document what a manager can infer at each stage and which conclusions require stronger evidence." }, { "id": "mit-technology-strategy", "provider": "MIT", "title": "Technology Strategy — Fall 2008", "evidenceType": "Archived graduate syllabus and selected lecture material", "sourceUrl": "https://ocw.mit.edu/courses/15-912-technology-strategy-fall-2008/pages/syllabus/", "topics": [ "Technology and competitive strategy", "Organisational capabilities", "Technological and market change", "Network externalities", "Alliances and complementary assets" ], "chapterIds": [ "mba-competitive-strategy", "mba-digital-platforms" ], "access": "Public syllabus and selected lecture presentation accessible through OCW. Availability of every assigned external reading not established. No enrolment, assessment or credit included.", "boundary": "Historical graduate offering; not current MIT degree requirements or a free credential programme.", "originalStudyTask": "Compare a small marketplace with direct service provision. Map participants, capabilities, economics and recovery; explain uncertainty and excluded alternatives." }, { "id": "mit-algorithms-2020", "provider": "MIT", "title": "Introduction to Algorithms — Spring2020", "evidenceType": "Archived undergraduate syllabus", "sourceUrl": "https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-spring-2020/pages/syllabus/", "topics": [ "Data structures", "Sorting", "Graph searching", "Dynamic programming", "Performance analysis" ], "chapterIds": [ "global-brief-09" ], "access": "Public syllabus lists openly shared lecture notes, videos, problem sets and exams. Optional commercial reference is not verified free.", "boundary": "Historical offering; no current degree equivalence, enrolment or credit.", "originalStudyTask": "Define an order identity contract, compare duplicate detectors and explain correctness and modelled work." }, { "id": "cmu-databases-2025", "provider": "Carnegie Mellon University", "title": "Introduction to Database Systems — Fall2025", "evidenceType": "Archived course schedule and resource index", "sourceUrl": "https://15445.courses.cs.cmu.edu/fall2025/schedule.html", "topics": [ "Relational model and SQL", "Storage and memory", "Indexes", "Join algorithms", "Query execution" ], "chapterIds": [ "global-brief-10" ], "access": "Schedule is publicly readable and provides slide, note and video links. Every linked file, textbook chapter and project environment was not audited.", "boundary": "Selected schedule review, not whole programme verification or guaranteed free access to every assignment resource.", "originalStudyTask": "Create an original in-memory customer/order schema, reject unknown references and reconcile grouped totals." } ], "policies": [ { "provider": "SWAYAM", "sourceUrl": "https://swayam.gov.in/about", "access": "Learning is available free. Certification requires a paid proctored examination; eligibility and arrangements depend on the course.", "boundary": "Platform policy only; no individual NPTEL syllabus verified in this batch." } ], "pending": [ { "provider": "Stanford", "url": "https://www.cs.stanford.edu/bachelors/degree-requirements", "reason": "Readable syllabus or course content was insufficient in this retrieval; individual verification remains queued." }, { "provider": "Kaggle", "url": "https://www.kaggle.com/learn", "reason": "Readable syllabus or course content was insufficient in this retrieval; individual verification remains queued." }, { "provider": "NPTEL", "url": "https://onlinecourses.nptel.ac.in/noc26_cs04/preview", "reason": "Readable syllabus or course content was insufficient in this retrieval; individual verification remains queued." } ] }