Back to courses index

ITBP221: Programming Lab 2

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 hands-on 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:
  1. Objects/Classes
  2. Exceptions and IO files
  3. Recursion
  4. Implementation of List and use it to solve problems
  5. Implementations of Stack ADT and use it to solve problems
  6. Implementations of Queue ADT and use it to solve problems
  7. Implementations of Binary Search Tree ADT and use it to solve problems
  8. Implementation of different search algorithms
  9. Implementation of different sorting algorithms
Outcomes:
  1. Design, implement and test large programs
  2. Design and implement linear and nonlinear data structures
  3. Use APIs for implementing moderate size programs with data structures
  4. Use linear and nonlinear data structures to solve problems
  5. 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     
Pre-requisite
Co-requisite ITBP319: Data Structures
Volume of the Course that Contributes to CIT Students Outcomes(SOs)
Move the mouse over the Students Outcome number to view the Students Outcome text
a b c d e f g h i j k l m n
24% 11% 20% 0% 0% 0%0% 0% 6% 24% 6% 4% 2% 0%
Show Details