classesList.js

export const classesList = [
  {
    title: "CIS 3200: Introduction to Algorithms",
    description:
      "This course gives a comprehensive introduction to design and analysis of algorithms. You will learn about problem-solving; advanced data structures such as universal hashing and red-black trees; advanced design and analysis techniques such as dynamic programming and amortized analysis; graph algorithms such as minimum spanning trees and network flows; NP-completeness theory; and approximation algorithms.",
    skills: ["CS Theory", "Algorithms"],
    grade: "A+",
  },
  {
    title: "CIS 2400: Introduction to Computer Systems",
    description:
      "This bottom-up course begins with transistors and simple computer hardware structures, continues with low-level programming using primitive machine instructions, and finishes with an introduction to the C programming language.",
    skills: ["C", "Assembly"],
    grade: "A+",
  },
  {
    title: "ESE 3600: TinyML - Tiny Machine Learning for Embedded Systems",
    description:
      "This is an introductory course at the intersection of Machine Learning (ML) and Embedded Internet of Things (IoT) Devices which covers machine learning applications and algorithms using embedded hardware, sensors, actuators and software.",
    skills: ["Python", "TensorFlow", "Embedded Systems"],
    grade: "A",
  },
  {
    title: "CIS 5450: Big Data Analytics",
    description:
      "Topics of this course include collecting, wrangling, and structuring data; programming models for performing computation scalably across many compute nodes; approaches to converting algorithms to such programming models; toolkits for data analysis; and popular distributed frameworks for analytics tasks.",
    skills: [
      "Python",
      "Pandas",
      "Polars",
      "Database Design",
      "Scikit-Learn",
      "SQL",
    ],
    grade: "A",
  },
  {
    title: "CIS 1210: Data Structures and Algorithms",
    description:
      "This is a course about Algorithms and Data Structures using the Java programming language. We introduce the basic concepts about complexity of an algorithm and methods on how to compute the running time of algorithms. Then, we describe data structures like stacks, queues, maps, trees, and graphs, and we construct efficient algorithms based on these representations.",
    skills: [
      "CS Theory",
      "Java",
      "Data Structures",
      "Algorithms",
      "Asymptotic Analysis",
    ],
    grade: "A",
  },
  {
    title: "STAT 4300: Probability",
    description:
      "Understanding discrete and continuous sample spaces and probability; random variables, distributions, independence; expectation and generating functions; Markov chains and recurrence theory.",
    skills: [],
    grade: "A+",
  },
  {
    title: "CIS 2620: Automata, Computability and Complexity",
    description:
      "A course that explores questions fundamental to computer science such as which problems cannot be solved by computers, can we formalize computing as a mathematical concept without relying upon the specifics of programming languages and computing platforms, and which problems can be solved efficiently.",
    skills: [],
    grade: "A",
  },
  {
    title: "CIS 1600: Mathematical Foundations of Computer Science",
    description:
      "A introduction to math concepts that form the backbone of the majority of computer science. Topics covered include sets, functions, permutations and combinations, discrete probability, expectation, mathematical Induction and graph theory.",
    skills: ["CS Theory", "Probability"],
    grade: "A-",
  },
  {
    title: "CIS 1200: Programming Languages & Techniques",
    description:
      "A fast-paced introduction to the fundamental concepts of programming and software design.",
    skills: ["Java", "OCaml", "OOP"],
    grade: "A",
  },
];