Back to courses index

ITBP319: Data Structures

Description:Techniques for developing, testing and debugging moderate size programs; Arrays, strings and string processing; Linked structures; Exception handling; Knowledge, implementation, and use of files, lists, stacks, queues, trees, heaps and graphs; Strategies for choosing the right data structure; Recursion.
Credit Hours.:3
Text Book: Data Structures and Algorithms in Java by Robert Lafore, SAMS
Coordinator: Saad Harous
Topics Outline:
  1. Object composed of primitive and other types
  2. Exception handling
  3. Text files, and object files
  4. Recursive thinking and tracking
  5. Linked Lists
  6. Stacks and Queues.
  7. Introduction to trees, adding and traversing trees.
  8. Introduction to graphs
Outcomes:
  1. Apply recursion to solve problems.
  2. Use APIs for implementing moderate size programs with data structures.
  3. Design and implement linear data structures.
  4. Design and implement tree data structures.
  5. Explain the concept of graphs.
Mapping of Topics Outline to Outcomes
 1 2 3 4 5 6 7 8
1        
2      
3       
4        
5        
Pre-requisiteITBP219: Object-oriented Programming
ITBP202: Discrete Mathematics
Co-requisite ITBP221: Programming Lab 2
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
22% 8% 13% 0% 0% 0%0% 0% 0% 22% 11% 11% 11% 0%
Show Details