Announcements

Exam will be held on 13/08/2018 Monday at 12:30. Exam room NA02

Final exam Topics:

• Linked List (singly linked list)
  • various insert and delete algorithms
• Stack (implementation)
• Queue (implementation)
• Recursion
• Binary Trees (implementation)
  • Traversals (Inorder, postorder, preorder and level order traversal)
  • various recursive algorithms related with binary trees (search, sum nodes, number of leaf nodes, etc..)
• Binary Search Trees
  • Insert, delete, search (recursive and non recursive algorithms)
• Min-Heap, Max-Heap (implementation)
  • deleteMin or deleteMax
  • insert
• Binary Search on arrays
• Sort Algorithms
  • insertion sort
  • bubble sort
  • selection sort
  • quick sort
    • partition algorithm

• Change Detection,
• Watch That Page
• Track Engine

Visual Studio

• Using the Visual Studio IDE for C++ Desktop Development
• Deep Focus on Your Code with CodeLens
• Visual Studio Tip: The Difference Between Start Without Debugging and Start with Debugging

• Lecture 1(pdf) (Reading)
• File IO in C++(doc) (Reading)
• Formatted Input output in C(pdf) (Reading)
• Lecture 2(pdf)(ppt)(additional notes on strings)
• Lecture3(ppt)(notes): Structs (Reading)
• Lecture4(notes)Stack
  (additional ppt)(pdf)(c++ impl)
• Lecture5(ppt) : Queue (c++ templated array based impl)
• Lecture 6(ppt) Linked Lists
• Reading (pdf)(implementation)
• //Lecture7(notes)(impl): List
• Lecture8(pdf)(ppt) (Recursion and Binary Tree)
  RecursiveFunctions implemented uring lecture hour)
• Lecture 10 (Binary Search Tree)

Final exam will cover above subjects.