COP 3502 Computer Science - I

Fall 2003

LECTURES

Alan Turing - founder of CS .

  • Software development and Algorithms design
  • Recursion - presentation
  • Recursion -I
  • Recursion -II
  • Binary Octal Hexadecimal number systems
  • computing algorithm complexity
  • Review problems for exam #I
  • Stacks
  • Queues
  • Application of stacks
  • Review: Pointers in Functions
  • Application of Queues
  • Linked Lists - I
  • Linked Lists - II
  • Linked Lists -Stacks,Queues,Polynomials
  • Reversing a Linked List
  • Code for linked list based stack/queue
  • Trees - 1(Traversals)
  • Trees - 2(BST searching,insertion)
  • Trees - 3 (Deletion in BST)
  • sorting - 1
  • Mergesort and Quicksort-