Computer Science (General)

Program Overview & Highlights

General 3-Year Program
BCS

It’s a digital world and with this degree, you will have the flexibility to chart your own career path in almost any industry. We offer hands-on learning opportunities and support as you learn computer languages, operation systems, and the mathematics behind computation. University degree holders from another subject area can fast track through this program. This excellent career prep has helped all of our grads find jobs in their chosen fields within two years. UWindsor Computer Science program is tied for first in Ontario university employment rates.

Gain experience in paid co-op positions and accelerate your career.

We host the ICPC programming competition and have a strong server infrastructure for students.

Many specializations – flexibility to diversify your skills in AI, software engineering and more!

Learn More About Our Program

What Lancers Are Saying

Taking Computer Science at University of Windsor has allowed me to explore so many different fields and topics that now I have a much better idea of what I want to achieve in my future. From data structures to website design classes, I've gained useful knowledge in various areas thanks to the amazing faculty and meaningful friendships. Additionally, I've had the unique experience of taking on a co-op position at the University, which has helped me gain valuable connections and real-world experience with modern web development techniques in a fast-paced team and environment. Overall, the program has certainly paved a bright pathway for my future by preparing me for the ever advancing computer science industry.

Ashad

Web & Digital Project Coordinator
Bachelor of Computer Science (Hons), Minor in Math & IT

Taking Computer Science at the University of Windsor has been one of the most life-changing experiences for me. I’ve had the chance to explore so many areas from AI and security to data analysis and UX design which helped me figure out what I want to focus on. I’m now specializing in AI, a decision inspired after speaking with Google employees during a workshop on campus. I also built strong connections with my professors, started researching in a lab in my second year, and am now working on publishing a paper on diagnosing diseases with AI.

Even though I’m not from Windsor, I met so many friendly students and staff who made the campus feel welcoming. I started working on campus in my very first semester and have continued to work on campus throughout all four years of my studies. The co-op program was also incredibly helpful, teaching me how to present myself professionally and allowing me to gain real-world experience in different technical roles. Overall, the program has given me valuable skills and a much clearer idea of the career I want after graduation.

Parmida

Student Ambassador
Bachelor of Computer Science (Hons) with Co-op, Specialization in AI and Minor in Math

Admission Requirements

High School Student from Canada

Course Requirements: Advanced Functions/MHF4U, English/ENG4U
Strongly Recommended: Calculus & Vectors/MCV4U
Minimum Average: 70% (70% average of math courses)
Minimum Average (Co-op): 75% (70% average in all attempted math courses)
Mean Average: 86%
Learn more about Course Equivalencies

High School Student from Outside Canada and the United States (International)

Course Requirements: Advanced Functions. Grade 12 English.
Strongly Recommended: Calculus & Vectors
Minimum Average: 70% (70% average of math courses)
Minimum Average (Co-op): 75% (Co-op Programs: 75% + 70% average in all attempted math courses, excluding Data Management)
Mean Average: 82%

Language Requirements

To review the most up-to-date information on Language Requirements: See language requirements.

Course Sequencing

First Year

Ten courses, including COMP-1000, COMP-1400, COMP-1410, MATH-1250 or MATH-1260, MATH-1720 (or MATH-1760).

Courses

The objectives of this course are to excite students’ interest in computer science and to give students a precise understanding of a number of difficult concepts that are fundamental to modern computer science. Topics may include: induction and recursion; algebraic characterization; syntax; semantics; formal logic; soundness, completeness, and decidability; specification, algorithm, and determinism; complexity. (Restricted to students registered in programs offered wholly or jointly by Computer Science or by Mathematics and Statistics, or with approval of Computer Science.) (3 lecture hours and 1.5 laboratory hours a week).

This course is the first of a two-course sequence designed to introduce students to algorithm design and programming in a high-level language such as C. The main objectives of the course are to develop the ability to identify, understand and design solutions to a wide variety of problems. Topics include: computer system overview, hardware and software, problem solving steps, concepts of variables, constants, data types, algorithmic structure, sequential logic, decisions, loops, modular programming, one-dimensional arrays, text files. If possible, problems like searching/sorting will be addressed. (3 lecture hours and 1.5 laboratory hours a week).

This course is the continuation of COMP-1400 that introduces students to more advanced algorithm design and programming in a high level language such as C. The main objectives of the course are to develop the ability to identify, understand, and design solutions to a wide variety of problems. Topics covered include: multi-dimensional arrays, pointers, strings, advanced modular programming, records, binary files, recursion, stacks, linked lists and introduction to algorithm analysis. (Prerequisite: COMP- 1000 (or MATH-1720) and COMP-1400.) (3 lecture and 1.5 laboratory hours a week).

This course will cover linear systems, matrix algebra, determinants, n-dimensional vectors, dot product, cross product, orthogonalization, eigenvalues, eigenvectors, diagonalization and vector spaces. (Prerequisites: Both Ontario Grade 12 Advanced Functions (MHF4U) and Calculus and Vectors (MCV4U) or MATH-1280.) (Antirequisites: MATH-1260, MATH-1270.) (3 lecture hours, 2 tutorial hours per week.)

This course is for students without Ontario Grade 12 Calculus and Vectors (MCV4U). The course MATH- 1250 is for students with MCV4U. This course will cover vectors, three-dimensional geometry, linear systems, matrix algebra, determinants, n- dimensional vectors, dot product, cross product, orthogonalization, eigenvalues, eigenvectors, diagonalization and vector spaces. The course is equivalent to MATH-1250 for all prerequisite purposes. (Prerequisite: Ontario Grade 12 Advanced Functions (MHF4U).) (Antirequisites: MATH-1250, MATH-1270.) (4 lecture hours, 2 tutorial hours per week.)

This course will cover trigonometric functions and identities, inverse trigonometric functions, limits and continuity, derivatives and applications, mean value theorem, indeterminate forms and l’Hôpital’s rule, antiderivatives and an introduction to definite integrals. This course is for students who have taken both Ontario Grade 12 Advanced Functions (MHF4U) and Ontario Grade 12 Calculus and Vectors (MCV4U). Students who do not have credit for MCV4U should take MATH-1760. (Prerequisites: Ontario Grade 12 Advanced Functions (MHF4U) and Ontario Grade 12 Calculus and Vectors (MCV4U) or MATH-1780.) (Antirequisite: MATH-1760.) (3 lecture hours, 1 tutorial hour per week.)

This course will cover a review of functions, trigonometric functions and identities, transcendental functions, inverse trigonometric functions, introduction to limits, continuity, derivatives and applications, mean value theorem, indeterminate forms and l’Hôpital’s rule, antiderivatives and an introduction to definite integrals. This course is for students who have taken Ontario Grade 12 Advanced Functions (MHF4U), but have not taken Ontario Grade 12 Calculus and Vectors (MCV4U). Students who have credit for MCV4U should take MATH-1720. The course is equivalent to MATH-1720 for all prerequisite purposes. (Prerequisite: Ontario Grade 12Advanced Functions (MHF4U).) (Antirequisite: MATH-1720.) (4 lecture hours, 1 tutorial hour per week.)

Second Year

Ten courses, including COMP-2120, COMP-2540, COMP-2560, COMP-2650, COMP-2660, and STAT-2910.

Courses

Concepts of classes and objects, Java applications, frames, event handling, control structures, methods, arrays, string manipulations, object-based programming, object-oriented programming – inheritance, polymorphism, interface and abstract classes, anonymous classes, data structures in Java, exception handling, introduction to graphical user interface. (Prerequisite: COMP-1410 or COMP-2087.) (3 lecture hours and 1.5 laboratory hours a week)

An introduction to the programming and analysis of linear and non-linear internal (main store) data structures and associated algorithms. Topics include the formal notion of an algorithm, elementary time and space complexity; linear lists (such as stacks, queues, linked structures.); non-linear lists (trees, binary trees); recursion; sorting techniques (such as heap sort, quick sort, merge sort, shell sort.); searching techniques (such as binary search, binary search trees, red-black trees, hashing.); algorithm design paradigms (such as divide-and-conquer, dynamic programming, greedy algorithms); and applications. (Prerequisite: COMP-1000 and COMP-1410. Restricted to Computer Science students or permission of the School of Computer Science.) (3 lecture hours and 1.5 laboratory hours a week.)

This course introduces students to advanced software development techniques in system programming using the C language in the UNIX environment. Topics include introduction to modern operating systems, system calls, managing processes, the use of fork and exec, signals, file processing, filters, pipes, scripting languages, introduction to concurrency (e.g. synchronization), network programming (e.g. using sockets), client-server problems. (Prerequisite: COMP-1410 or COMP-2087)(3 lecture hours and 1.5 laboratory hours a week)

This course uses microprocessor programming to explore the structure of a CPU and related components. Topics include data representation, central processing unit, arithmetic logic unit, control unit, assembly language concepts, memory segmentation, programming a typical microprocessor (e.g. Intel processors), instruction set architecture-addressing modes and formats, register set, runtime stack, floating point processor. (Prerequisite: COMP-2650). (3 lecture hours and 1.5 laboratory hours a week)

This course will cover descriptive statistics, probability, discrete and continuous distributions, point and interval estimation, hypothesis testing, goodness-of-fit and contingency tables. (Prerequisite: Grade 12 “U” Advanced Level Mathematics (MHF4U, MCV4U, MDM4U) or Grade 11 Functions and Applications (MCF3M) or Grade 11 Functions (MCR3U).) (Course equivalencies and antirequisites as stated in the University of Windsor Senate Policy on Introductory Statistics Courses.) (May not be taken for credit after taking STAT-2920 or STAT-2950.) (3 lecture hours, 1 tutorial hour per week.)

Third Year

Ten courses, including COMP-3150, COMP-3220, COMP-3300, and COMP-3340 (or COMP- 3670).

Courses

This course will acquaint students with the Basic concepts of Database Systems. The topics covered will include 3-level architecture, introduction to file structures: B-trees, B+ Trees and Hashed files, relational model, relational algebra and calculus, SQL, and database design with Normalization Theory. (Prerequisite: COMP-2540 and COMP-2560 or COMP-2650.) (3 lecture hours a week)

This course builds on the knowledge of object-oriented programming, data structures, systems programming. Students are introduced to object-oriented software analysis and design concepts (such as cohesion and coupling), and design practices currently used in industry , (such as design patterns and refactoring). These concepts and practices will be discussed through case studies and programming exercises. (Prerequisite: COMP-2120 and COMP-2540)(3 lecture hours a week)

Operating system services, introduction to primary components of multi-programming operating systems, CPU scheduling, concurrent processes, process synchronization and interprocess communication, deadlocks, memory management, file systems, virtual memory, disk scheduling. (Prerequisite: COMP-2120, COMP-2540, COMP-2560, and COMP-2650 or COMP-2660.)(3 lecture hours a week)

This course is designed for people who want to make their data available to others over the Internet. Topics will include WWW authoring, WWW site planning, executable programs that create dynamic documents, the client-server model, multi-tier WWW software architecture, and security aspects. (Prerequisite: COMP-2120 and COMP-2540.) (3 lecture hours a week)

This course is an introduction to computer networks and their protocols. Topics include: network architectures, transport, routing, and data link protocols, addressing, local area networks, flow and congestion control, and network security. Examples will be drawn primarily from the Internet (e.g. TCP, UDP, IP) protocol suite. (Prerequisite: COMP-2120, COMP-2540 or COMP-2547, COMP-2560 and COMP- 2650. Recommended corequisite: COMP-3300.)

Degree Requirements

Total courses: thirty.

COMP-1000, COMP-1400, COMP-1410, COMP-2120, COMP-2540, COMP-2560, COMP-2650, COMP- 2660, COMP-3150, COMP-3220, COMP-3300, COMP-3340 (or COMP-3670), plus two additional Computer Science courses (excluding COMP-XXX7).
MATH-1250 (or MATH-1260), MATH-1720 (or MATH-1760), and STAT-2910;
one course from Arts/Languages, and one from Social Sciences;
eleven other courses from any area of study, including Computer Science.

The major average will be calculated on the basis of the grades obtained in COMP-1000, COMP-1400, COMP-1410, COMP-2120, COMP-2540, COMP-2560, COMP-2650, COMP-2660, COMP-3150, COMP-3220,

COMP-3300, and either COMP-3340 or COMP-3670 or both.

Note: Students who plan to complete an Honours Computer Science degree at a later date should restrict the number of Computer Science courses they take as options, in order to transfer seamlessly into a Computer Science Honours program. These students should consult a program advisor.

Important Note: Course sequencing is for illustrative purposes only. The University of Windsor Academic Calendar is your source for official information about academic programs and regulations of the University of Windsor.

Academic Calendars

The University of Windsor Academic Calendar is your source for official information about academic programs and regulations of the University of Windsor.

Career Tracks

Web Developer
Software Developer
Computer Programmer
IT Manager
Video Game Developer
Graduate Studies

Related Programs

Computer Science, Computer Information Systems

Electrical Engineering

Computer Science (Honours)

Contact A Recruiter

Do you have questions about this or one of our many other programs? Send us a message and we’ll answer any questions you have!

Connect With Computer Science (General)

First Name

Last Name

Phone

I am currently:

Computer Science (General)

Program Overview & Highlights

Learn More About Our Program

What Lancers Are Saying

Admission Requirements

High School Student from Canada

High School Student from Outside Canada and the United States (International)

Language Requirements

Course Sequencing

First Year

Courses

COMP 1000: Key Concepts in Computer Science Winter

COMP 1400: Introduction to Algorithms and Programming I

COMP 1410: Introduction to Algorithms and Programming II Winter

MATH 1250: Linear Algebra I Winter

MATH 1260: Vectors and Linear Algebra

MATH 1720: Differential Calculus Winter

MATH 1760: Functions and Differential Calculus Winter

Academic Calendars

Career Tracks

Related Programs

Contact A Recruiter

Connect With Computer Science (General)

Future Lancers, register now for our online event!

Fall Virtual Open Day 2025