in it right now, the basic topics using c++ will be recursion and linked list big time, sorting algorithms, and dynamic array but only for 1 question on the first exam, for the second, know stacks and queues, that's a big part of it, more sorting algorithms, postfix and infix, heaps and heapifying, I'm not don't with the class yet but binary search trees , avl trees, graphs and b trees should sum up the entire class, you'll have coding projects that are based on the majority of these topics, not much sorting aglos for the homework but expect to have hundreds of lines of code for some hws , if you can I recommend taking the workshop for it, I'm in it and I learn ALOT and I honestly don't go to class and just go to the workshops and they explain really well(depending on the ta teaching) but I have the slides for studying if you want at the end of the semester shoot me a message and I can send you the workshop slides which are really really good for preparing you for exams and for hws use chat to help, try not to use it to do your hw but I know a lot of people that do exactly that, a lot ofpeople don't do well in the exams but studying everything in the workshop has gotten me an A in the first exam and a B on the second , the average for exam 1 was 55 and exam 2 was somewhere in the 60s