Discrete Structures and Programming I

Topics covered include: Java reviews (generics, inheritance, polymorphism, references, constructor chaining, exceptions, abstract classes, interfaces), recursions, big-Oh, big-Omega, and big-Theta notations, Pseudocode details, basic mathematical functions, algorithm analysis and design, stack, queue, deque, linked-list, vector, position, position-List, sequence, comparator, iterator, favorite-List, favorite- ListMTF, general tress, Java implementations of all data structures mentioned above, as well as applications in searching, deleting and sorting. Credit cannot be held for both this course and 62:206.