CS2710 - Programming and Data Structures Lab

Meetings  

• Theme 1 : Lab Assignments - 16 meetings

  • Meeting 01 : Mon, Jul 30, 02:00 pm-04:45 pm

  Setting up hacker rank accounts. Recall C programming. <br><br> <b>Lab 0</b> : Write program for the digits problem. Write the same program in C++. Familiarizing with C++ input output statements.

  References
  Exercises
  Reading

  Setting up hacker rank accounts. Recall C programming.
  
  Lab 0 : Write program for the digits problem. Write the same program in C++. Familiarizing with C++ input output statements.
  

  References

  :

  None

  • Meeting 02 : Mon, Aug 06, 02:00 pm-04:45 pm

  Lecture : Introduction to Objects Oriented Programming. Classes, public and private members of a class. Constructor and destructor functions for a class.<br><br> <b>Lab 1</b> (shorter, 40 marks) : The "house class". Introduction to classes.

  References
  Exercises
  Reading

  Lecture : Introduction to Objects Oriented Programming. Classes, public and private members of a class. Constructor and destructor functions for a class.
  
  Lab 1 (shorter, 40 marks) : The "house class". Introduction to classes.
  

  References

  :

  None

  • Meeting 03 : Mon, Aug 13, 02:00 pm-04:45 pm

  <b>Lab 2</b> The "datecalculator" class. Use of overloaded constructor functions.

  References
  Exercises
  Reading

  Lab 2 The "datecalculator" class. Use of overloaded constructor functions.
  

  References

  :

  None

  • Meeting 04 : Mon, Aug 20, 02:00 pm-04:45 pm

  <b>Lab 3</b> Searching and Sorting.

  References
  Exercises
  Reading

  Lab 3 Searching and Sorting.
  

  References

  :

  None

  • Meeting 05 : Mon, Aug 27, 02:00 pm-04:45 pm

  <b>Lab 4</b> Sorting Algorithms: MergeSort and QuickSort

  References
  Exercises
  Reading

  Lab 4 Sorting Algorithms: MergeSort and QuickSort
  

  References

  :

  None

  • Meeting 06 : Mon, Sep 03, 02:00 pm-04:45 pm

  <b>Lab 5</b> Sorting Algorithms: MergeSort and QuickSort

  References
  Exercises
  Reading

  Lab 5 Sorting Algorithms: MergeSort and QuickSort
  

  References

  :

  None

  • Meeting 07 : Mon, Sep 10, 02:00 pm-04:45 pm

  <b>Lab 6</b> Dynamic Arrays : Vectors

  References
  Exercises
  Reading

  Lab 6 Dynamic Arrays : Vectors
  

  References

  :

  None

  • Meeting 08 : Mon, Sep 17, 02:00 pm-04:40 pm

  <b>Lab 7</b> List ADT using Doubly Linked Lists

  References
  Exercises
  Reading

  Lab 7 List ADT using Doubly Linked Lists
  

  References

  :

  None

  • Meeting 09 : Mon, Sep 24, 02:00 pm-04:45 pm

  <b>Lab mid-sem exam</b> : Implementing Linked Lists using an Array. <br><br> <b>Lab 8</b> Take Home Assignment : Implement Stack using Linked lists use it to convert infix expression to postfix expression.

  References
  Exercises
  Reading

  Lab mid-sem exam : Implementing Linked Lists using an Array.
  
  Lab 8 Take Home Assignment : Implement Stack using Linked lists use it to convert infix expression to postfix expression.
  

  References

  :

  None

  • Meeting 10 : Mon, Oct 01, 02:00 pm-04:45 pm

  <b>Lab 9</b> Tree Traversals - implementing pre-order traversal and recursive directory listing.

  References
  Exercises
  Reading

  Lab 9 Tree Traversals - implementing pre-order traversal and recursive directory listing.
  

  References

  :

  None

  • Meeting 11 : Mon, Oct 08, 02:00 pm-04:45 pm

  <b>Lab 10</b> Binary Search Tree with "Insert", "Delete" and "Search". Traversals on Binary trees.

  References
  Exercises
  Reading

  Lab 10 Binary Search Tree with "Insert", "Delete" and "Search". Traversals on Binary trees.
  

  References

  :

  None

  • Meeting 12 : Mon, Oct 15, 02:00 pm-04:45 pm

  <b>Lab 11</b> AVL Trees

  References
  Exercises
  Reading

  Lab 11 AVL Trees
  

  References

  :

  None

  • Meeting 13 : Mon, Oct 22, 02:00 pm-04:45 pm

  <b>Lab 12:</b><br> Priority queue & heap:  Implement  "extract_min" and "decrease_key"  in O(log n). <br> Heap sort : in O(n logn) worst case.Â

  References
  Exercises
  Reading

  Lab 12:
  Priority queue & heap:  Implement  "extract_min" and "decrease_key"  in O(log n). 
  Heap sort : in O(n logn) worst case. 
  

  References

  :

  None

  • Meeting 14 : Mon, Oct 29, 02:00 pm-04:45 pm

  <b>Lab 13</b> : Hashing, Chaining, Probing and implementing spell checker and learner with it.

  References
  Exercises
  Reading

  Lab 13 : Hashing, Chaining, Probing and implementing spell checker and learner with it.
  

  References

  :

  None

  • Meeting 15 : Mon, Nov 05, 02:00 pm-04:45 pm

  <b>Lab 14</b> : DFS and BFS.

  References
  Exercises
  Reading

  Lab 14 : DFS and BFS.
  

  References

  :

  None

  • Meeting 16 : Mon, Nov 12, 02:00 pm-04:00 pm

  <b>End-semester Lab Examination</b>

  References
  Exercises
  Reading

  End-semester Lab Examination
  

  References

  :

  None