Search Constraints
Number of results to display per page
Results for:
« Previous |
1 - 10 of 12
|
Next »
Search Results
-
Others
Algorithm Visualizer is an interactive online platform that visualizes algorithms from code. Learning an algorithm gets much easier with visualizing it.
- Subjects:
- Computing
- Keywords:
- Algorithms Information visualization
- Resource Type:
- Others
-
e-book
An introductory coverage of algorithms and data structures with application to graphics and geometry.
- Subjects:
- Computing
- Keywords:
- Algorithms Data structures (Computer science) Textbooks
- Resource Type:
- e-book
-
Courseware
This course treats various methods to design and analyze datastructures and algorithms for a wide range of problems. The most important new datastructure treated is the graph, and the general methods introduced are: greedy algorithms, divide and conquer, dynamic programming and network flow algorithms. These general methods are explained by a number of concrete examples, such as simple scheduling algorithms, Dijkstra, Ford-Fulkerson, minimum spanning tree, closest-pair-of-points, knapsack, and Bellman-Ford. Throughout this course there is significant attention to proving the correctness of the discussed algorithms. All material for this course is in English. The recorded lectures, however, are in Dutch.
- Subjects:
- Computing
- Keywords:
- Algorithms Data structures (Computer science)
- Resource Type:
- Courseware
-
Courseware
This is an intermediate algorithms course with an emphasis on teaching techniques for the design and analysis of efficient algorithms, emphasizing methods of application. Topics include divide-and-conquer, randomization, dynamic programming, greedy algorithms, incremental improvement, complexity, and cryptography.
- Subjects:
- Computing
- Keywords:
- Algorithms
- Resource Type:
- Courseware
-
e-book
Evolutionary algorithms are successively applied to wide optimization problems in the engineering, marketing, operations research, and social science, such as include scheduling, genetics, material selection, structural design and so on. Apart from mathematical optimization problems, evolutionary algorithms have also been used as an experimental framework within biological evolution and natural selection in the field of artificial life.
- Subjects:
- Computing
- Keywords:
- Mathematical optimization Genetic algorithms Evolutionary programming (Computer science)
- Resource Type:
- e-book
-
Others
Symbol Table is an important data structure created and maintained by the compiler in order to keep track of semantics of variables i.e. it stores information about the scope and binding information about names, information about instances of various entities such as variable and function names, classes, objects, etc.
- Course related:
- COMP3438 System Programming
- Subjects:
- Computing
- Keywords:
- Compilers (Computer programs)
- Resource Type:
- Others
-
Others
A data structure is a particular way of organizing data in a computer so that it can be used effectively.For example, we can store a list of items having the same data-type using the array data structure. This page contains detailed tutorials on different data structures (DS) with topic-wise problems, including (1) Array, (2) Linked List, (3) Stack, (4) Queue, (5) Binary Tree, (6) Binary Search Tree, (7) Heap, (8) Hashing, (9) Graph, (10) Matrix, (11) Advanced Data Structure.
- Course related:
- COMP 2011 Data Structures
- Subjects:
- Computing
- Keywords:
- Data structures (Computer science)
- Resource Type:
- Others
-
Video
When two people join a dating website they are matched according to shared interests and how they answer a number of personal questions. But how do sites calculate the likelihood of a successful relationship? Christian Rudder one of the founders of popular dating site OKCupid details the algorithm behind 'hitting it off.'
- Subjects:
- Computing and Mathematics and Statistics
- Keywords:
- Dating services Computer algorithms Online dating
- Resource Type:
- Video
-
Courseware
In this card, we are going to help you understand the general concept of Binary Search.
Binary Search is one of the most fundamental and useful algorithms in Computer Science. It describes the process of searching for a specific value in an ordered collection.
Terminology used in Binary Search:
(1) Target - the value that you are searching for
(2) Index - the current location that you are searching
(3) Left, Right - the indicies from which we use to maintain our search Space
(4) Mid - the index that we use to apply a condition to determine if we should search left or right
- Course related:
- COMP3011 Design and Analysis of Algorithms
- Subjects:
- Computing
- Keywords:
- Computer algorithms
- Resource Type:
- Courseware
-
e-book
Offered as an introduction to the field of data structures and algorithms, Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs. Focusing on a mathematically rigorous approach that is fast, practical, and efficient, Morin clearly and briskly presents instruction along with source code. Analyzed and implemented in Java, the data structures presented in the book include stacks, queues, deques, and lists implemented as arrays and linked-lists; space-efficient implementations of lists; skip lists; hash tables and hash codes; binary search trees including treaps, scapegoat trees, and red-black trees; integer searching structures including binary tries, x-fast tries, and y-fast tries; heaps, including implicit binary heaps and randomized meldable heaps; graphs, including adjacency matrix and adjacency list representations; and B-trees. A modern treatment of an essential computer science topic, Open Data Structures is a measured balance between classical topics and state-of-the art structures that will serve the needs of all undergraduate students or self-directed learners.
- Subjects:
- Computing
- Keywords:
- Data structures (Computer science) Computer algorithms Textbooks
- Resource Type:
- e-book