notes98 - CS 251 Notes - First Week Basic Idea of the...

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

View Full Document Right Arrow Icon
CS 251 Notes - First Week Basic Idea of the Course Program = Data Structure + Algorithms Course Content Analysis Tools Math Review Big 'O' Notation (Asymptotic Notation) Doubly-Linked List Trees Priority Queues Dictionaries (an array indexed by a string instead of an integer number) Search Trees/Sorting Heapsort, Quicksort, Mergesort Sets, selections, text processing Graphs Helpful Library for Debugging C code (Assert) #include <assert.h> ... assert( i >= 0 j <= maxArray); // will abort program if condition in parentheses is false. a[i] = 1; //but asserts will be disabled if compiled with: cc - DNDEBUG prog.c Definitions / Analysis Tools Data Structure = representation of portion of the world inside a computer. Algorithm = modifies data structure, transforms input data into output data. When programming, choose the best data structure and minimize required algorithms that manipulate the structure. Math Review
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
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 / 4

notes98 - CS 251 Notes - First Week Basic Idea of the...

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

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