- #1
in the rye
- 83
- 6
Hey all,
This coming Spring semester (starts in 6 weeks), I will be taking C++ Data Structures and Algorithms at my University. I started programming at University, so my experience is very limited (I've taken 3 programming courses, 1 in Python, 2 in C++).
Topics we've covered in C++ were procedural programming, some OOP, pointers, inheritance, polymorphism, a small portion of the STL, exceptions, single non-circular linked lists, dynamic stacks, and queues.
The book we will be using Data Structures and Other Objects using C++ by Michael Main. I'm a little nervous because I registered for the most difficult Data Structures professor our University has because I want to be sure I learn the material well. However, this semester I didn't have a great C++ professor so I'm not sure how prepared I am, and I want to be sure I make up any inadequacies before next semester.
The course covers lists, stacks, queues, trees (binary, tree traversals, height balanced trees), graphs, hash tables, sorting, searching, hashing, recursion, dynamic versus array implementations, modular programming using data structures, data structure implementation using header files and implementation files.
I feel fairly confident with my discrete math abilities, its more-or-less deficiencies in C++, so I want to know what I should practice over Winter break.
Thanks.
This coming Spring semester (starts in 6 weeks), I will be taking C++ Data Structures and Algorithms at my University. I started programming at University, so my experience is very limited (I've taken 3 programming courses, 1 in Python, 2 in C++).
Topics we've covered in C++ were procedural programming, some OOP, pointers, inheritance, polymorphism, a small portion of the STL, exceptions, single non-circular linked lists, dynamic stacks, and queues.
The book we will be using Data Structures and Other Objects using C++ by Michael Main. I'm a little nervous because I registered for the most difficult Data Structures professor our University has because I want to be sure I learn the material well. However, this semester I didn't have a great C++ professor so I'm not sure how prepared I am, and I want to be sure I make up any inadequacies before next semester.
The course covers lists, stacks, queues, trees (binary, tree traversals, height balanced trees), graphs, hash tables, sorting, searching, hashing, recursion, dynamic versus array implementations, modular programming using data structures, data structure implementation using header files and implementation files.
I feel fairly confident with my discrete math abilities, its more-or-less deficiencies in C++, so I want to know what I should practice over Winter break.
Thanks.