Data Structures & Algorithms - (code CZ12)
This 1 1/2 month(s) course is a sequel to 'Advanced C Programming' and aims at those developers that want to get more C expertise. The course contains theory and exercises. The focus of this course is on learning algorithmic paradigms and a variety of data structures that can be used together to design efficient algorithms. Will be able to solve problems sorting and searching different data structures.
Course contents
Review of Basic C 
  • Pointers 
  • Arrays 
  • Pointers and Arrays 
  • Structures 
  • Arrays of Structures 
  • Structures and Pointers 
  • Unions 
Simple Static Structures 
  • Bounded Stacks 
  • Bounded Queues 
Pointers and More Memory 
  • Pointers to Static Memory 
  • Pointers and Dynamic Memory 
  • Arrays of Pointers 
  • Pointers to Pointers 
  • Pointers to Functions 
  • Pointers in Structures 
Linking Lists 
  • What is a Linked List 
  • Singly Linked Lists 
  • Doubly Linked Lists 
  • Dynamic Stacks 
  • Dynamic Queues 
Searching and Lists 
  • Sequential Search 
  • Contiguous Lists 
  • Linked Lists 
  • Binary Search 
  • Forgetful Version 
  • Recognizing Equality 
Hashing 
  • Different Tables 
  • Sparse Tables 
  • Hashing Functions 
  • Open Addressing 
  • Chaining 
Sorting 
  • Insertion Sort 
  • Selection Sort 
  • Shell Sort 
  • Mergesort 
  • Quicksort 
Recursion 
  • Guidelines 
  • The Principles 
  • Tail Recursion 
Trees 
  • Binary Trees 
  • Treesearch 
  • Traversal of Binary Trees 
  • Treesort 

    • Balanced Trees (AVL) 
Course duration: 1+1/2 month(s)

 
Hosted by www.Geocities.ws

1