Difference between revisions of "Data Structures and Algorithms (COMP 2140)"
(EDIT by JacobF: Edited second sentence to make it more fluid) |
(EDIT2 by JacobF: This will count as the same edit as my previous.) |
||
| Line 1: | Line 1: | ||
{{Template:1010Topic | {{Template:1010Topic | ||
| − | |Introduction=Data structures are imperative to Computer Science, and arrays are just the beginning. Data Structures and Algorithms teaches implementation of various [[Glossary#data_structure|data structures]] (such as trees or tables), which are ways of storing data in a computer and | + | |Introduction=Data structures are imperative to Computer Science, and arrays are just the beginning. Data Structures and Algorithms teaches implementation of various [[Glossary#data_structure|data structures]] (such as trees or tables), which are ways of storing data in a computer, and [[Glossary#algorithm|algorithms]] used for manipulating the data efficiently. This course will also discuss the performance characteristics for each data structure which will help to make good decisions on selecting an appropriate data structure for a particular application. |
<!-- JACOBF edit: Edited second sentence to make it more fluid. Original sentence: | <!-- JACOBF edit: Edited second sentence to make it more fluid. Original sentence: | ||
Data Structures and Algorithms teaches implementation of various [[Glossary#data_structure|data structures]] (such as trees or tables), which are ways of storing data in a computer and [[Glossary#algorithm|algorithms]] for manipulating the data efficiently | Data Structures and Algorithms teaches implementation of various [[Glossary#data_structure|data structures]] (such as trees or tables), which are ways of storing data in a computer and [[Glossary#algorithm|algorithms]] for manipulating the data efficiently | ||
Revision as of 17:47, 7 December 2010
COMP 1010 Home > Back to Chapter Topics
|
IntroductionData structures are imperative to Computer Science, and arrays are just the beginning. Data Structures and Algorithms teaches implementation of various data structures (such as trees or tables), which are ways of storing data in a computer, and algorithms used for manipulating the data efficiently. This course will also discuss the performance characteristics for each data structure which will help to make good decisions on selecting an appropriate data structure for a particular application. |
...By StudentsI simply love this course! Until taking this, I never would have imagined recursion and I could become such great friends. As the name suggests you basically deal with more realistic data, its storage, and efficient manipulation. |
|---|
Prerequisites
Introductory Computer Science 2 (COMP 1020)
