CS142 lab

Contents

• Assignment 1: Recursion and insertion sort
• Assignment 2: Evaluating expressions and optimising time complexity
• Assignment 3: Divide and Conquer Algorithm, Merge sort and Median finding
• Assignment 4: Implementation of Divide and conquer algorithms including binary search and merge sort
• Assignment 5: Finding subsets , n-queen problem as well as its modification to find the number of superqueens, Introduction to OOP
• Assignment 6: Sudoku solver
• Assignment 7: Linked lists (including palindrome check, insertion and merge sort)
• Assignment 8: Binary Trees (inorder & post-order traversal) and Binary Search Trees
• Assignment 9: Hashing and hash-tables