# Textbook Notes for All Professors

- 26 Results
- About LSU

## Arrays And Linked Lists

0

Review: chapters 1 and 2 of goodrich et al represent a review of csc 1253 / 1350. Introduction to computer science i and csc 1254 / 1351 introduction t

View Document## Csc3102DPj

0

* this program compares the performance of the recursive. * and memoized (dp) versions of implementations of the fibonacci algorithm. * by measuring ru

View Document## Csc3102GraphIntro

0

Supplementary notes: understand and use basic graph terminology and concepts, de ne and discuss basic graph structures, graph adt primitive operations,

View Document## 3102 Hw2

0

Due october 7, 2014 (in class: (20 points) your friend, john (whoever he is! ), gives you an array b[1n] of numbers. He wants to obtain the smallest k

View Document## Heaps And Priority Queues

0

A priority queue is a queue where removal depends not upon order of insertion but upon importance. Keys must have a comparison operation that is reflex

View Document## Csc3102TopoSort

0

A dfs-based strategy: depth-first search-based topological sorting, out-degree-based topological sorting, reverse in-degree-based topological sorting.

View Document## Csc3102MST

0

Prim"s & kruskal"s algorithms: introduction, kruskal"s algorithm, prim"s algorithm. A spanning tree is an acyclic subgraph of a graph that contains all

View Document## Syllabus

0

5% (assigned every lecture and due next tuesday) 10% (start/end of a lecture, without notice, closed book/notes, very many) All homeworks should be com

View Document## 3102 10

0

Need angle, distance, direction, area and scale. Hillocks, hachures and contour lines (most accurate) Map projection- not possible to represent earth o

View Document