|
|
| Line 8: |
Line 8: |
| | |OurThoughts= A vital transition from 1020. This course is required for most higher level courses and deals mainly with data manipulation.<br>Students will learn to accept recursion as a dear friend, enjoy pointer assignment in linked lists and optimize some efficient<br>sorting algorithms like the quicksort. | | |OurThoughts= A vital transition from 1020. This course is required for most higher level courses and deals mainly with data manipulation.<br>Students will learn to accept recursion as a dear friend, enjoy pointer assignment in linked lists and optimize some efficient<br>sorting algorithms like the quicksort. |
| | }} | | }} |
| − |
| |
| − | ====Official Links====
| |
| − | For an official course description refer to this [http://aurora.umanitoba.ca/banprod/bwckctlg.p_disp_course_detail?cat_term_in=201150&subj_code_in=COMP&crse_numb_in=2140 link].
| |
| − |
| |
| − | ====Prerequisites====
| |
| − | COMP 1020 (Introductory computer science 2).
| |
| − |
| |
| − | ====Course Overview====
| |
| − | 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), ways of storing data in a computer and [[Glossary#algorithm|algorithms]] 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.
| |
Revision as of 11:48, 2 December 2010
Main_Page > Computer Science Courses > 2000-Level Courses
|
Overview
Data 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), ways of storing data in a computer and algorithms 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.
A vital transition from 1020. This course is required for most higher level courses and deals mainly with data manipulation.
Students will learn to accept recursion as a dear friend, enjoy pointer assignment in linked lists and optimize some efficient
sorting algorithms like the quicksort.
|
|
|
|
Further Information
For more information on this course please visit Aurora or look up this course here.
CAUTION:
Please make sure you have completed the required prerequisites (minimum grade of C):
COMP 1020 (Introductory computer science 2).
|
Template loop detected:
