>>8269803

>>8269825

This Persons list is clearly biased. This is my schools program

Computer Science:

Prereqs:

Calc 1/2/3 same courses math majors take

Discrete math course, which surveys complexity, graph theory, combinatorics, set theory. Class was proof based, and around 30% dropped/failed.

CE takes two circuits classes that aren't typically aren't seen as hard

Programming in C, class is very time consuming and about 20% drop class in two weeks. This course is required/recommended by most natsci/eng majors

General requirements:

Algorithms/data structures, this our weed out course, it's takes ~40 hours For each project which are given every 10 days, C++ (optional CE)

Computer arch course

Complexity course. This is a proof based math course. Around 20% of the students are math majors, CS majors get destroyed by this course, but I think thy changed it slightly last year. CE doesn't take this one

Stats/Prob course, you get three choices here, they vary in difficulty and scope, so you get what you want

CE chooses 2 from algorithms/data structures, signals, more circuits, or microprocessor design

Linear algebra isn't required but if you don't take it, you are severely limited for course selection, as about half the upper level courses require it.

There are 7 upper lever courses both CS/CE majors get to choose from a pool of electives, around 70% are common to both. What you take is based on what other courses you've taken. There's a range of electives, these include

software focused courses like web , Os, and, Advanced OOP.

theoretical math courses like algorithmic theory, cyptography, formal verification. Architecture

CE stuff, microprocessor design, architecture, Vsli

AI/ML: robotics, machine learning, computer vision

It's worth noting that there are easy and difficult courses in each area, I.e our cryptography course is easy, while the oop course is considered the hardest course offered by the university.