courses.json

[
    {
      "courseCode": "EECS 376",
      "courseName": "Foundations of Computer Science",
      "medianGrade": "A-",
      "workload": "4-6 hours/week",
      "description": "Introduction to theory of computation.  Models of computation: finite state machines, Turing machines.  Decidable and undecidable problems.  Polynomial time computability and paradigms of algorithm design.  computational complexity emphasizing NP-hardness.  Coping with intractability.  Exploiting intractability:  cryptography."
    },
    {
      "courseCode": "EECS 370",
      "courseName": "Introduction to Computer Organization",
      "medianGrade": "B+",
      "workload": "3-5 hours/week",
      "description": "Basic concepts of computer organization and hardware. Instructions executed by a processor and how to use these instructions in simple assembly-language programs. Stored-program concept. Datapath and control for multiple implementations of a processor. Performance evaluation, pipelining, caches, virtual memory, input/output."
    },
    {
      "courseCode": "EECS 492",
      "courseName": "Introduction to Artificial Intelligence",
      "medianGrade": "A-",
      "workload": "3-5 hours/week",
      "description": "Introduction to the core concepts of AI, organized around building computational agents. Emphasizes the application of AI techniques.  Topics include search, logic, knowledge representation, reasoning, planning, decision making under uncertainty, and machine learning"
    },
    {
      "courseCode": "EECS 281",
      "courseName": "Data Structures and Algorithms",
      "medianGrade": "B-",
      "workload": "3-5 hours/week",
      "description": "Introduction to algorithm analysis and O-notation; Fundamental data structures including lists, stacks, queues, priority queues, hash tables, binary trees, search trees, balanced trees and graphs; searching and sorting algorithms; recursive algorithms; basic graph algorithms; introduction to greedy algorithms and divide and conquer strategy. Several programming assignments."
    }
  ]