Difference between revisions of "Analysis of Algorithms (COMP 2080)"

From CompSciWiki
Jump to: navigation, search
 
(18 intermediate revisions by 2 users not shown)
Line 1: Line 1:
{{Template:CSCourse
+
{{Template:1010Topic
|Overview='''COMP 1010''', or '''Introductory Computer Science 1''' is the introductory programming course offered at the University of ManitobaIt is a prerequisite for further studies in Computer Science, Engineering, and some fields of Mathematics.
+
|Chapter_TOC=[[Computer Science Courses]]
|OfficialDescription= http://aurora.umanitoba.ca/banprod/bwckctlg.p_disp_course_detail?cat_term_in=201150&subj_code_in=COMP&crse_numb_in=1010
+
|Introduction=Problem solving can be complicated.  This course is essential to gain the necessary problem solving skills for advanced Computer Science studyAnalysis of Algorithms introduces various approaches for analyzing and evaluating commonly used algorithms when solving computing problems.
|CourseHome= http://courses.cs.umanitoba.ca/index.aspx?sec=5040
+
|ByStudents= This is a tough one. You will become quite familiar with math terms such as induction. Highly recommended that students have a decent mathematical background prior to taking this course. If not, don't be alarmed because practice makes perfect and in the end you would at least be able to bump up your program's speed.
|Prerequisites= Any Grade 12 or 40S Mathematics or equivalent.
+
|Body=
|ParentPage= 1000-Level Courses
+
===Prerequisites===
|Overview = This is an introductory programming course. You will learn fundamental programming concepts such as: [[Glossary#control_statement|control statements]], [[Glossary#for_loop|for loops]] and [[Glossary#array|arrays]], how to write a program using Java, and how to set up a computer to run your program. The purpose of this course is to help students that do not have any programming experience to get started in writing computer programs. Hence, no computer programming knowledge is required prior taking this course.
+
[[Discrete Mathematics for Computer Science (COMP 2130)]]<br>
|OurThoughts= Textpad is the recommended tool for programming on a Windows machine.
+
[[Data Structures and Algorithms (COMP 2140)]]
 +
===Course Homepage===
 +
[http://www.cs.umanitoba.ca/~comp2080 cs homepage]
 +
===Official Description===
 +
[http://aurora.umanitoba.ca/banprod/bwckctlg.p_disp_course_detail?cat_term_in=201150&subj_code_in=COMP&crse_numb_in=2080 Aurora]
 
}}
 
}}
 
 
====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=2080 link].
 
 
====Prerequisites====
 
COMP 2130 (Discrete math), COMP 2140 (Data structures and Algorithms).
 
 
====Course Overview====
 
Problem solving can be complicated.  This course is essential to gain the necessary problem solving skills for advance Computer Science study.  Analysis of Algorithms introduces various approaches for analyzing and evaluating commonly used algorithms when solving computing problems.
 
Highly recommended that students have a decent mathematical background prior to taking this course.
 

Latest revision as of 08:24, 9 December 2010

COMP 1010 Home > Computer Science Courses


Introduction

Problem solving can be complicated. This course is essential to gain the necessary problem solving skills for advanced Computer Science study. Analysis of Algorithms introduces various approaches for analyzing and evaluating commonly used algorithms when solving computing problems.

...By Students

This is a tough one. You will become quite familiar with math terms such as induction. Highly recommended that students have a decent mathematical background prior to taking this course. If not, don't be alarmed because practice makes perfect and in the end you would at least be able to bump up your program's speed.

Prerequisites

Discrete Mathematics for Computer Science (COMP 2130)
Data Structures and Algorithms (COMP 2140)

Course Homepage

cs homepage

Official Description

Aurora