
Description:  This lab based course consists of a set of laboratory assignments and projects to design and implement different data structures such as: list, stacks, queues, trees and graphs. It provides handson experience in developing applications that use these linear and nonlinear data structures. Large applications are developed using different algorithm techniques. 
Credit Hours.:  1 
Coordinator:  Saad Harous 
Topics Outline:   Objects/Classes
 Exceptions and IO files
 Recursion
 Implementation of List and use it to solve problems
 Implementations of Stack ADT and use it to solve problems
 Implementations of Queue ADT and use it to solve problems
 Implementations of Binary Search Tree ADT and use it to solve problems
 Implementation of different search algorithms
 Implementation of different sorting algorithms

Outcomes:   Design, implement and test large programs
 Design and implement linear and nonlinear data structures
 Use APIs for implementing moderate size programs with data structures
 Use linear and nonlinear data structures to solve problems
 Apply recursion to solve problems

Mapping of Topics Outline to Outcomes   1 
2 
3 
4 
5 
6 
7 
8 
9 
1 
        
2 
        
3 
        
4 
        
5 
        

Prerequisite  
Corequisite  ITBP319: Data Structures
