AM5801: Computational Lab

Moodle: Submit assignments here. Google group Venue: Join here. All code Slides Introduction + Logistics Complexity [Video lecture, password=CLab5801] Arrays [Video lecture] Lists [Video lecture] Trees [Video lecture one, two] Dictionaries Video lecture on BST Video lecture on AVL insertion Video lecture on AVL deletion Video lecture on Hash Tables Graphs Video lecture on Graph Representation Video lecture on Graph Primitives Video lecture on Graph Algorithms Heaps [Video Lecture]

Department: Applied Mechanics Slot: R (Wednesday 14:00 -- 16:40) TAs: Chanikya, Eldhose, Mihir, Nikhil, Ramita Course Faculty: Prof. Prasad Patnaik, Rupesh Nasre. Feedback: Course: 0.82 (institute mean: 0.79) Instructor: 0.86 (institute mean: 0.80) Teaching Staff: 0.86 (institute mean: 0.82) Full report

Lab Lectures

Topic	Code
Introduction	Basic C++ Other codes
Complexity	Binary Search Maximum Subsequence Sum O(n3) Maximum Subsequence Sum O(n2) Maximum Subsequence Sum O(n)
Lists	Linked lists Stack usage in C++ Stack implementation in C and in C++
Lists	Balanced Parentheses Postfix Evaluation Infix to Postfix
Lists	Queue usage in C++ Call Center Simulation (without waiting users), Sample input Call Center Simulation (supports waiting users, but has duplication), Sample input Final Simulation Queue implementation (without wrap-around) Queue implementation (with wrap-around)
Trees	Basic tree operations Directory listing (preorder) Subtree size (postorder) Iterative preorder
Trees	Expression tree (postorder and inorder) Postfix2Tree Binary Search Tree
Dictionaries	AVL Tree
Dictionaries	HashTable: Chaining HashTable: List header HashTable: List implementation HashTable: Linear Probing
Dictionaries	HashTable: Open Addressing HashTable: Open Addressing Header
Priority Queues	Heap: Header, Code, Main Heap: Makefile (compile by typing make on the command line) Kth Maximum using Heap Heapsort Huffman Coding
Arrays	Sorting (Bubble, Insertion, Selection, Shell, Quick, Merge, Heap, Bucket, Radix)
Graphs	Graph header, Graph implementation Breadth First Search (BFS) Depth First Search (DFS) DFS Recursive