CSE2011

User Tools

Site Tools

You are here: CSE 2011 - Fundamentals of Data Structures » Lecture Notes
Trace:
lecture_notes

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
lecture_notes [2013/05/25 15:28] – kargarlecture_notes [2013/07/31 22:38] (current) – kargar
Line 1: Line 1:
 ====== Lecture Notes  ====== ====== Lecture Notes  ======
  
-**Please note that the slides might be updated up to one week after the lecture.**//Italic Text//+//**Please note that the slides might be updated up to one week after the lecture.**//
  
 ===== May 8: Course Information  ===== ===== May 8: Course Information  =====
Line 27: Line 27:
 [[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/06QuickSort.pdf|PDF.Quick Sort]] [[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/06QuickSort.pdf|PDF.Quick Sort]]
  
 +===== May 29: Arrays and Linked Lists  =====
  
 +[[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/07ArraysLinkedLists.pdf|PDF.Arrays and Linked Lists]]
  
 +===== May 29: Stacks =====
 +
 +[[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/08Stacks.pdf|PDF.Stacks]]
 +
 +
 +===== June 5: Queues =====
 +
 +[[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/09Queues.pdf|PDF.Queues]]
 +
 +===== June 5: Double-Ended Queues/Extendable Arrays =====
 +
 +[[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/10Double-EndedQueues.pdf|PDF.Double-Ended Queues/Extendable Arrays]]
 +
 +===== June 12: Trees =====
 +
 +[[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/11Trees.pdf|PDF.Trees]]
 +
 +===== June 12: Binary Trees =====
 +
 +[[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/12BinaryTrees.pdf|PDF.Binary Trees]]
 +
 +===== June 19: Binary Search Trees =====
 +
 +[[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/13BinarySearchTrees.pdf|PDF.Binary Search Trees]]
 +
 +
 +===== June 19: AVL Trees =====
 +
 +[[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/14AVLTrees.pdf|PDF.AVL Trees]]
 +
 +===== June 26: Heaps =====
 +
 +[[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/15Heaps.pdf|PDF.Heaps]]
 +
 +
 +===== July 3: Heap Sort =====
 +
 +[[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/16HeapSort.pdf|PDF.Heap Sort]]
 +
 +
 +===== July 10: Hashing I =====
 +
 +[[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/17HashingI.pdf|PDF.Hashing I]]
 +
 +
 +===== July 10: Hashing II =====
 +
 +[[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/18HashingII.pdf|PDF.Hashing II]]
 +
 +
 +===== July 17: Graphs =====
 +
 +[[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/19Graphs.pdf|PDF.Graphs]]
 +
 +
 +===== July 17: Breadth First Search =====
 +
 +[[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/20BFS.pdf|PDF.BFS]]
 +
 +
 +===== July 24: Depth First Search =====
 +
 +[[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/21DFS.pdf|PDF.DFS]]
 +
 +
 +===== July 24: Applications of BFS and DFS =====
 +
 +[[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/22Apps.pdf|PDF.Applications of BFS and DFS]]
 +
 +===== July 31: Final Review =====
 +
 +[[https://wiki.cse.yorku.ca/course_archive/2012-13/S/2011/_media/23FinalReview.pdf|PDF.Final Review]]
lecture_notes.1369495703.txt.gz · Last modified: by kargar