Data structures Course Outlines

Last modified on March 18th, 2020 Download This Tutorial in PDF

Data structures syllabus

The syllabus is covering the following concepts

  1. Introduction
  2. Review of some C++ Concepts
  3. Object-oriented design
  4. Fundamental data structures
  5. Algorithm analysis
  6. Recursion
  7. Pointers
  8. Stacks, queues, and deques
  9. Link List
  10. Trees
  11. Priority queues
  12. Maps, hash tables and skip lists
  13. Search trees
  14. Sorting and selection
  15. Graph algorithms

Course Outcomes

By the end of this course, students should be able to do an analysis of algorithms complexity written in a
programming language.
By the end of this course, students should be able to write a program that implements several different
sorting algorithms, and create a report that compares their relative performance.

By the end of this course, students should be able to create a program that implements a linked list data
structure using well-structured object-oriented techniques in the Java programming language.
By the end of this course, students should be able to implement stack and queue data structures in the Java programming language.
By the end of this course, students should be able to implement a binary search tree data structure in the
Java programming language.
By the end of this course, students should be able to implement a balanced tree data structure (such as an AVL tree) in the Java programming language.
By the end of this course, students should be able to write a program in the Java language that implements a graph data structure with various kinds of graph traversals. By the end of this course, students should be able to implement a hash table with collision resolution in the
Java programming language.

Subscribe for Friendship

Latest posts by Prof. Fazal Rehman Shamil (see all)