Difference between revisions of "Data Structures and Algorithms (COMP 2140)"

From CompSciWiki
Jump to: navigation, search
Line 1: Line 1:
 +
{{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), 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.
 +
|ByStudents= I simply love this course! until taking this, I never would have possibly imagined that recursion and I could become such great friends. As the name suggests you basically deal with real more realistic data and how to go about storing them.
 +
 +
|Body=
 +
===Prerequisites===
 +
[[Introductory Computer Science 2 (COMP 1020)]]
 +
===Course Homepage===
 +
[http://www.cs.umanitoba.ca/~durocher/teaching/comp2140-2010/ COMP 2140]
 +
===Official Description===
 +
[http://aurora.umanitoba.ca/banprod/bwckctlg.p_disp_course_detail?cat_term_in=201150&subj_code_in=COMP&crse_numb_in=2140 Aurora]
 +
}}
 +
 +
 +
 
{{Template:CSCourse
 
{{Template:CSCourse
 
|OfficialDescription= http://aurora.umanitoba.ca/banprod/bwckctlg.p_disp_course_detail?cat_term_in=201150&subj_code_in=COMP&crse_numb_in=2140
 
|OfficialDescription= http://aurora.umanitoba.ca/banprod/bwckctlg.p_disp_course_detail?cat_term_in=201150&subj_code_in=COMP&crse_numb_in=2140
Line 8: Line 23:
 
|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.
 
}}
 
}}
 +
 +
I simply love this course! until taking this, I never would have possibly imagined that recursion and I could become great friends. As the name suggests you basically deal with real more realistic data and how to go about storing them.

Revision as of 20:02, 2 December 2010

COMP 1010 Home > Back to Chapter Topics


Introduction

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.

...By Students

I simply love this course! until taking this, I never would have possibly imagined that recursion and I could become such great friends. As the name suggests you basically deal with real more realistic data and how to go about storing them.

Prerequisites

Introductory Computer Science 2 (COMP 1020)

Course Homepage

COMP 2140

Official Description

Aurora

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:

I simply love this course! until taking this, I never would have possibly imagined that recursion and I could become great friends. As the name suggests you basically deal with real more realistic data and how to go about storing them.

Retrieved from "https://hci.cs.umanitoba.ca/mediawiki/index.php?title=Data_Structures_and_Algorithms_(COMP_2140)&oldid=14072"