DATA STRUCTURES ALGORITHM ANALYSIS (BCIS 3302)

Term: 2020-2021 WB February-May

Faculty

	Ashley GodboldShow MyInfo popup for Ashley Godbold
	Email address is hidden, click here to email

	Richard Andrew RiffeShow MyInfo popup for Richard Andrew Riffe
	Email address is hidden, click here to email

	Themba NgwenyaShow MyInfo popup for Themba Ngwenya
	Email address is hidden, click here to email

Schedule

Tue-Thu, 12:00 AM - 12:00 PM (2/1/2021 - 2/28/2021) Location: ONLN ONLN ONLN

Description

This course will continue from BCIS 3301 and apply concept of algorithms design. This includes greedy, divide-and-conquer, random and backtracking algorithms and dynamic programming, and specific algorithms including, for example, resizing arrays, balancing search trees, shortest path, and spanning trees.

Prerequisite(s): BCIS 2305 Computer Programming II (Lab) or Transfer credits

DATA STRUCTURES ALGORITHM ANALYSIS (BCIS 3302)

Term: 2020-2021 WB February-May

Faculty

	Ashley GodboldShow MyInfo popup for Ashley Godbold
	Email address is hidden, click here to email

	Richard Andrew RiffeShow MyInfo popup for Richard Andrew Riffe
	Email address is hidden, click here to email

	Themba NgwenyaShow MyInfo popup for Themba Ngwenya
	Email address is hidden, click here to email

Schedule

Tue-Thu, 12:00 AM - 12:00 PM (2/1/2021 - 2/28/2021) Location: ONLN ONLN ONLN

Description

This course will continue from BCIS 3301 and apply concept of algorithms design. This includes greedy, divide-and-conquer, random and backtracking algorithms and dynamic programming, and specific algorithms including, for example, resizing arrays, balancing search trees, shortest path, and spanning trees.

Prerequisite(s): BCIS 2305 Computer Programming II (Lab) or Transfer credits