hjs420.fall2011

hjs420.fall2011 - Data Structures CMSC 420 - Fall 2011...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Data Structures CMSC 420 - Fall 2011 COURSE DESCRIPTION I. Objectives. The main aim of the course is to familiarize the student with the fundamentals of data struc- tures and with well-known techniques for manipulating data structures. The student will learn to apply these methods to applications in data base management systems, artificial in- telligence, programming language implementation, operating systems, game programming, computer graphics, computational geometry, VLSI design, image processing, and computer vision. II. Topics to be Covered. • Basic Data Structures (2 review lectures) – Stacks, Queues, and Deques – Sequential Allocation – Linked Allocation and Topological Sorting – Circular Lists – Doubly-Linked Lists – Arrays • Trees (2 review lectures) – Terminology – Traversals – Binary Tree Representation of Trees – Other Representations of Trees – Processing Equivalences with UNION-FIND • Graphs (1 lecture) • Winged Edge Data Structure (1 lecture) • Sorting (2 lectures) – Review of methods – Heapsort – Quicksort – External Sorting • Searching (1 lecture) 1 – Sequential Searching – Binary Searching – Digital Searching • Balanced-Tree Searching (1 lecture) – AVL Trees – Splay Trees – Skip Lists • B-trees and Red-Black Trees (1 lecture) • Introduction to LISP (6 lectures) • Lists and Garbage Collection (1 lecture) • Dynamic Storage Allocation (1 lecture) • Point Methods (2 lectures) – Quadtrees – K-d Trees – Grid File – EXCELL • Hashing (2 lectures) – Hashing Functions – Chaining – Open Addressing – Brent’s Method – Comparison • Alternative Rectangle Representations (1 lecture) – Quadtree Approaches – R-trees • Priority Search Trees and Range Trees (1 lecture)...
View Full Document

This note was uploaded on 01/13/2012 for the course CMSC 420 taught by Professor Staff during the Fall '08 term at Maryland.

Page1 / 5

hjs420.fall2011 - Data Structures CMSC 420 - Fall 2011...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online