DATA STRUCTURES ALGORITHM ANALYSIS (BCIS 3302)

Term: 2019-2020 WD - April-July

Faculty

Themba NgwenyaShow MyInfo popup for Themba Ngwenya
Email address is hidden, click here to email
 
Cynthia M CalongneShow MyInfo popup for Cynthia M Calongne
Email address is hidden, click here to email
 
Roxanne KempShow MyInfo popup for Roxanne Kemp
Email address is hidden, click here to email
 

Schedule

Tue-Thu, 12:00 AM - 12:00 PM (5/4/2020 - 5/31/2020) 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: 2019-2020 WD - April-July

Faculty

Themba NgwenyaShow MyInfo popup for Themba Ngwenya
Email address is hidden, click here to email
 
Cynthia M CalongneShow MyInfo popup for Cynthia M Calongne
Email address is hidden, click here to email
 
Roxanne KempShow MyInfo popup for Roxanne Kemp
Email address is hidden, click here to email
 

Schedule

Tue-Thu, 12:00 AM - 12:00 PM (5/4/2020 - 5/31/2020) 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