notes14 - CS 251: Class 1 General information: Instructor's...

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

View Full Document Right Arrow Icon
CS 251: Class 1 General information: Instructor's e-mail: Send e-mail Website: www.cs.purdue.edu/homes/cs251 -Lectures (3 times a week) -PSO (lab): Projects explained there Add yourself to the mailing list. Follow the procedure: 1. Login to Lore. 2. mailer add me to cs251-pso# (replacing # with the PSO number). A program is: Datastructure + Algorithm. Content of the course: 1. Analysis tools: big-O notation O(f(x)) 2. Stack (LIFO) and Queues (FIFO) 3. Linked Lists (Simple and Doubly-Linked List) 4. Trees (Search and organizing) * a. Binary Tree b. AVL Tree c. Red-black Tree d. B-trees 5. Priority Queues 6. Hash tables 7. Tries 8. Sorting Algorithms a. Merge Sort b. Quicksort c. Radix Sort d. Bucket Sort 9. Text Processing / Word search 10. Graphs** *Balance tree = number between root and node is the same for all, or a difference of a constant number Example of a tree:
Background image of page 1

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

View Full DocumentRight Arrow Icon
**Graphs: Used to represent road map (nodes and edges), transportation network, wiring, events/ scheduling. Graph Algorithms (ie: Dijkstra Shortest Path CS 251: Class 2 C Review: General Information: UNIX was created at Bell Labs by Ken Thompson and Dennis Ritchie.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/02/2012 for the course CS 251 taught by Professor Staff during the Fall '08 term at Purdue University-West Lafayette.

Page1 / 10

notes14 - CS 251: Class 1 General information: Instructor's...

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