Through these algorithms the student will be introduced to the ... and talks about some simple data structures such as first-in first out queues and last-in first out stack. Next, we introduce the ...

Studies data abstractions (e.g., stacks, queues, lists, trees) and their representation techniques (e.g., linking, arrays). Introduces concepts used in algorithm design and analysis including criteria ...