BCIS 3302 002 L - DATA STRUCTURES ALGORITHM ANALYSISMAY 2017 WD

Course Information

DATA STRUCTURES ALGORITHM ANALYSIS (BCIS 3302)

Term: 2016 - 2017 - April-July

Faculty

Roxanne KempShow MyInfo popup for Roxanne Kemp
Email address is hidden, click here to email
 
Richmond AdebiayeShow MyInfo popup for Richmond Adebiaye
Email address is hidden, click here to email
 

Schedule

Mon-Thu, 12:00 AM - 12:00 PM (5/1/2017 - 5/28/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

Go to Main Screen

Course Information (imported)

DATA STRUCTURES ALGORITHM ANALYSIS (BCIS 3302)

Term: 2016 - 2017 - April-July

Faculty

Roxanne KempShow MyInfo popup for Roxanne Kemp
Email address is hidden, click here to email
 
Richmond AdebiayeShow MyInfo popup for Richmond Adebiaye
Email address is hidden, click here to email
 

Schedule

Mon-Thu, 12:00 AM - 12:00 PM (5/1/2017 - 5/28/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

Go to Main Screen

Course Information (imported) (imported)

DATA STRUCTURES ALGORITHM ANALYSIS (BCIS 3302)

Term: 2016 - 2017 - April-July

Faculty

Roxanne KempShow MyInfo popup for Roxanne Kemp
Email address is hidden, click here to email
 
Richmond AdebiayeShow MyInfo popup for Richmond Adebiaye
Email address is hidden, click here to email
 

Schedule

Mon-Thu, 12:00 AM - 12:00 PM (5/1/2017 - 5/28/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

Go to Main Screen