Search Constraints
Number of results to display per page
Results for:
Polyu oer sim
No
Remove constraint Polyu oer sim: No
1 - 5 of 5
Search Results
-
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
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
-
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
-
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