Editing CS 1332
From Georgia Tech Student Wiki
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 10: | Line 10: | ||
Exams test knowledge of the theory of the data structure (efficiency, inner workings) as well as usage and implementation through multiple choice, fill-in-the-blank, and code writing questions. |
Exams test knowledge of the theory of the data structure (efficiency, inner workings) as well as usage and implementation through multiple choice, fill-in-the-blank, and code writing questions. |
||
β | {{Collapsed| |
||
==Topics List== |
==Topics List== |
||
β | | |
||
The topics covered in the course are as follows: |
The topics covered in the course are as follows: |
||
#Arrays |
#Arrays |
||
Line 55: | Line 53: | ||
##Shortest Path Algorithm (Djikstra's) |
##Shortest Path Algorithm (Djikstra's) |
||
#A selection of more advanced algorithms and data structures (varies by semester) |
#A selection of more advanced algorithms and data structures (varies by semester) |
||
β | }} |
||
== Prerequisite Knowledge == |
== Prerequisite Knowledge == |