Computer Science 3340A/B Lecture Notes - Lecture 1: Computational Biology, Computational Geometry, Propositional Function
10 Jan 2017
School
Department
Course
Professor
Document Summary
Algorithms precisely stated general problem-solving methods suitable for computer implementation. Data structures methods of organizing data involved in computation. Types of algorithms: sequential algorithms will be the main focus in this course. These algorithms are deterministic, meaning the next step is known after the current step completes: parallel algorithms many computers or processes working concurrently. Synchronously all computers work together to solve a problem. Asynchronously computers work independently: randomizing algorithms these are faster than sequential algorithms but are less accurate, approximation algorithms a good approximation is found in polynomial time. This will not produce the optimal solution but close to one. This is known as a suboptimal solution: computational geometry considered in 2d and 3d problems. Navigation of a robot along a desired path: computational biology algorithms solves molecular biology problems using computer science techniques. Human genome project: genetic algorithms uses biological techniques such as mutation, splicing, etc. along with computer.
