DATA STRUCTURES ALGORITHM ANALYSIS (BCIS 3302)

Term: 2017 - 2018 FB October-January

Faculty

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

Schedule

Mon-Thu, 12:00 AM - 12:00 PM (9/25/2017 - 10/22/2017) Location: 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: 2017 - 2018 FB October-January

Faculty

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

Schedule

Mon-Thu, 12:00 AM - 12:00 PM (9/25/2017 - 10/22/2017) Location: 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: 2017 - 2018 FB October-January

Faculty

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

Schedule

Mon-Thu, 12:00 AM - 12:00 PM (9/25/2017 - 10/22/2017) Location: 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: 2017 - 2018 FB October-January

Faculty

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

Schedule

Mon-Thu, 12:00 AM - 12:00 PM (9/25/2017 - 10/22/2017) Location: 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