Keywords: Searching
Loading...
Displaying 1-7 of 7 results.
Algorithms
| Rating: | |
| Type: | Course Related Materials |
Abstract: The design of algorithms is studied, according to methodology and application. Methodologies include: divide and conquer, dynamic programming, and greedy strategies. Applications involve: sorting, ordering and searching, graph algorithms, geometric algorithms, mathematical (number theory, algebra and ... More »
Introduction to Computers and Engineering Problem Solving, Fall 2002
| Rating: | |
| Type: | Course Related Materials |
Abstract: This course presents fundamental software development and computational methods for engineering and scientific applications. Object-oriented software design and development is the focus of the course. Weekly programming problems cover programming concepts, graphical user interfaces, numerical methods, ... More »
Introduction to Computers and Engineering Problem Solving, Fall 2005
| Rating: | |
| Type: | Course Related Materials |
Abstract: This course teaches fundamental software development and computational methods for engineering, scientific and managerial applications. Emphasis is focused on object-oriented software design and development. Assignments cover programming concepts, graphical user interfaces, numerical methods, data structures, ... More »
Introduction to Computers and Engineering Problem Solving, Spring 2005
| Rating: | |
| Type: | Course Related Materials |
Abstract: This course examines fundamental software development and computational methods for engineering, scientific and managerial applications. Emphasis is placed on object-oriented software design and development. Students engage in active learning using laptop computers (available on loan). Assignments cover ... More »
Nuclear Reaction: Searching for Safety
| Rating: | |
| Type: | Course Related Materials |
Abstract: This text excerpted from Beyond Engineering: How Society Shapes Technology by Robert Pool and reprinted on the FRONTLINE Web site looks at the impact of nuclear power.
Randomized Algorithms, Fall 2002
| Rating: | |
| Type: | Course Related Materials |
Abstract: Studies how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Models of randomized computation. Data structures: hash tables, and skip lists. Graph algorithms: minimum spanning trees, shortest ... More »
Searching for the Building Blocks of Matter
| Rating: | |
| Type: | Course Related Materials |
Abstract: looks at Fermilab's search for the smallest building blocks of matter. It also describes the accelerator and detectors needed for the discovery of these building blocks (quarks, leptons and bosons), spin-offs along the way, and continuing efforts to reveal the basic particles and forces of nature. Fermilab ... More »
