Courses
CATALOG DESCRIPTIONS
Back to Previous Page
CS 540 Data Structures and Algorithms
Description:
Introduction to data structures. Program specification and design. Abstract data types, stacks and queues. Dynamic storage allocation. Sequential and linked implementation of stacks and queues. Searching methods, sequential and binary. Binary trees, binary search trees and general trees. Hashing. Computational complexity. Sorting algorithms: selection sort, insertion sort, heapsort, mergesort and quicksort. Comparison of sorting techniques and analysis.
Credits: 2 ½:0:0:3
Pre-Requisite: CS 530
Co-Requisite: none
Notes: none
|
