Weekly outline

  • The course instructor, Chintan Shah, is available in Room No. 4102
    for discussions and clarification of doubts on
    Tue : 4:15 - 5:30
    Thu : 10:00 - 11:30, 12:00 - 2:00, 4:15 - 5:30

  • 5 January - 11 January

    0) Mon : Free Class
    1) Tue : Introduction - Running time of algorithms, basic mathematics, Big - Oh
    notation, graphs
    Thu : Holiday (Muharram)

  • 12 January - 18 January

    2) Mon : Data Types - arrays
    3) Tue : Linked Lists
    4) Thu : Compound Data Structures - strings, buckets
    Graph Implementations - adjacency matrix, adjacency list representations

  • 19 January - 25 January

    5) Mon : Big - Oh notation
    Tue : Class rescheduled due to extra class in infocity
    6) Thu : Big - Oh notation(contd.), efficient/inefficient algorithms, NP-Complete problems - knapsack problem, ADT

  • 26 January - 1 February

    Mon : Holiday (Republic Day)
    7,8) Tue : Running times of array and linked list implementations
    Stack and its uses - postfix evaluation, function calls
    * Pop-up Quiz 1 - Implementation of 2 stacks using a single array
    9) Thu : Queue and its implementations using linked lists and arrays
    Stacks, Queues and Priority Queues as Generalized Queues

  • 2 February - 8 February

    10) Mon : Trees, binary trees, the logarithm function, Huffman Coding
    11) Tue : Binary Search Trees;
    Recursion - Factorial, Fibonacci Sequences, Binary Search
    12) Thu : Sorting Techniques - Selection Sort, Insertion Sort.

  • 9 February - 15 February

    13) Mon : Bubble sort, Analysis and comparision of the elementary sorting techniques under various scenarios
    14) Tue : Quicksort - worst, average case analysis
    15) Thu : Mergesort and its comparision with quicksort

  • 16 February - 22 February

    First in-sem examination

    16) Thu : Distrubution of answer sheets and solutions to questions

  • 23 February - 1 March

    Mon : Holiday (Mahashivratri), class rescheduled to Tuesday
    17) Tue : Solutions to questions asked in 1st in-sem examination
    18) Thu : Heapsort

  • 2 March - 8 March

    19) Mon : Radix Sort
    20) Tue : Balanced BST trees - AVL trees
    21) Thu : B-Trees

  • 9 March - 15 March

    SEMESTER BREAK

  • 16 March - 22 March

    22) Mon : Hashing - Chaining
    23) Tue : Open Address Hashing - Linear Probing
    24) Thu : Quadratic Probing, Double Hashing

  • 23 March - 29 March

    25) Mon : Review of some hashing techniques - Chaining, Linear Probing, Quadratic Probing
    26) Tue : Review of Double Hashing, Perfect Hashing

    Second in-sem examination

  • 30 March - 5 April

    27) Mon : Distribution of papers
    28) Tue : Perfect Hashing
    29) Thu : Graph representations, BFS

  • 6 April - 12 April

    30) Mon : DFS
    31) Tue : MST - Kruskal's Algorithm
    32) Thu : MST - Prim's Algorithm, Course Evaluation

  • 13 April - 19 April

    33) Mon : Dijkstra's Algorithm
    34) Tue : All Pairs Shortest Path Algorithm using Matrix Multiplication
    35) Thu : More all pairs shortest path algorithms

  • 20 April - 26 April

    36) Mon : Extended Lab Session in place of lecture.
    37) Tue : Concluding Lecture and distribution of marks.
    38) Thu : Free Class