 |
|
|
|||||||||||||||||
|
|||||||||||||||||||
 |
|||||||||||||||||||
|
|
 |
|
|
|
|
|
|
|
 |
||||||
|
This course concentrates on algorithms, algorithm analysis, and advanced data structures. Algorithm approaches such as divide and-and-conquer, dynamic, greedy, and back-tracking are considered, Complexity analysis is used to compare algorithm efficiency. Students will learn further use of object-oriented programming to implement ADT’s such as graphs, sets, heaps, and hash tables This course will be taught using the C++ programming language |
||||||
|
Reading Assignment |
||||||
|
Internet: |
||||||
|
|
|
[Home] [About Me] [Office Hours] [CIS 098] [CIS 110] [CIS 114] [CIS 121] [CIS 123] [CIS 127] [CIS 170] [CIS 207] [CIS 226] [CIS 227] [CIS 230] [CIS 262] [COL 101] |