|
|
 |
 |
 |
 |
 |
 |
 |
 |
| Introduction to data
structures. Program specification and design. Abstract data types; stacks and queues.
Dynamic storage allocation. Sequential and linked implementation of stack and queues.
Topics of discrete mathematics. Selecting elements from a set, searching methods,
sequential and binary. Binary trees, binary search trees and general trees. Hashing.
Computational complexity. Sorting algorithms, comparison of sorting techniques and
analysis. Prerequisites:CS200 & MA106 |