• Choose a category
• All
• Classic-Fiction

description of, Description of Doubly-Linked Lists

destroy, dlist_destroy

implementation and analysis of, Implementation and Analysis of Doubly Linked Lists

initialize, dlist_init

remove element, Return Value, dlist_remove

size of, Return Value

dynamic allocation, Storage Allocation, Storage Allocation

dynamic storage allocation, Related Topics

dynamic-programming solutions, Dynamic-programming solutions

E

ECB (Electronic Code Book), DES Example: Block Cipher Modes

edges, Graphs

efficiency (in algorithms), O-Notation, Computational Complexity

efficient pipelines, Graph Algorithms

electronic mail, Data Encryption

embedded applications, Data Compression

encapsulation, A Bit About Software Engineering

encryption, Data Encryption (see data encryption)

endpoints, Description of Testing Whether Line Segments Intersect

enqueue event, Queue Example: Event Handling

entropy, Data Compression, Entropy and Minimum Redundancy

equal sets, Return Value, set_is_equal

equations, solving, Description of the Solution of Equations

error approximation, Related Topics

Euclid's greatest common divisor algorithm, Related Topics

Euler's function, Computing Public and Private Keys

event handling, Stacks and Queues, Queue Example: Event Handling

event-driven applications, Queue Example: Event Handling

events, Queue Example: Event Handling

exchange heuristic, Related Topics

expansion permutation, Enciphering and Deciphering Data Blocks, des_encipher

exponential period, Computing Public and Private Keys

expression processing, Trees

expression trees, Binary Tree Example: Expression Processing

F

fact function, Basic Recursion

factorial, Basic Recursion, Basic Recursion, Tail Recursion

facttail function, Tail Recursion

farthest-pair problems, Geometric Algorithms

feedback, DES Example: Block Cipher Modes

Fibonacci heaps, Related Topics

FIFO (first-in, first-out), Description of Queues

file allocation, linked, Linked Lists

final permutation, Enciphering and Deciphering Data Blocks

finishing times, Questions and Answers

first-in, first-out (FIFO), Description of Queues

frame management, Linked List Example: Frame Management, Circular List Example: Second-Chance Page Replacement, Circular List Example: Second-Chance Page Replacement, Circular List Example: Second-Chance Page Replacement

free_frame function, Linked List Example: Frame Management, Linked List Example: Frame Management

function calls, Basic Recursion, Stacks and Queues, Stacks and Queues, Stacks and Queues

activation records, Stacks and Queues

C, Stacks and Queues

execution of, Basic Recursion, Stacks and Queues

function pointers, Pointer Manipulation, Function Pointers

function tables, Numerical Methods, Numerical Methods

functional relationship, Description of Least-Squares Estimation

G

garbage collection algorithms, Analysis of Algorithms

gateways, Shortest Paths Example: Routing Tables

generic pointers, Generic Pointers

geodist function, Arc Length Example: Approximating Distances on Earth

geometric algorithms, Geometric Algorithms, Geometric Algorithms, Geometric Algorithms, Geometric Algorithms, Geometric Algorithms, Description of Testing Whether Line Segments Intersect, Description of Convex Hulls, Jarvis's March, Implementation and Analysis of Convex Hulls, Description of Arc Length on Spherical Surfaces

applications of, Geometric Algorithms

arc length, Description of Arc Length on Spherical Surfaces

convex hulls, Description of Convex Hulls, Implementation and Analysis of Convex Hulls

Jarvis's march, Jarvis's March

testing line segment intersection, Description of Testing Whether Line Segments Intersect

get_parcel function, Priority Queue Example: Parcel Sorting

Graham's scan, Related Topics

graph algorithms, Depth-first search, Graph Example: Counting Network Hops, Graph Example: Topological Sorting, Questions and Answers, Graph Algorithms, Graph Algorithms, Description of Shortest Paths, Description of Shortest Paths, Description of Shortest Paths, Dijkstra's Algorithm, Description