View Code? Open in Web Editor
NEW
Solutions to questions from CS-2008 lab at KiiT
C 51.11%
Makefile 0.61%
Python 1.50%
C++ 5.83%
Assembly 40.58%
Objective-C 0.36%
cs-2008's Introduction
- Lab 1 : Time complexity analysis Insertion Sort
- Lab 2 : Time complexity analysis Selection Sort
- Lab 3 : Random Problems
- Lab 4
- Time complexity analysis Merge Sort
- Comparison b/w linear and dnc strategy for Max-Min Problem
- Lab 5
- Time complexity analysis Quick Sort
- Time complexity analysis Heap Sort
- Lab 6 : Implementation of Priority Queue using Binary Heap
- Lab 7 Dynamic Programming Approach
- Longest Common Subsequence Problem
- Optimal Parenthesization : Matrix Chain Multiplication Problem
- Lab 8 Greedy Algorithms
- Activity Selection
- Job Sequencing
- Magnetic Tape Storage
- Knapsack Problem (Also solved using dynamic approach)
- Huffman Code
- Lab 9 : Implementing a 2D map/maze
Group Assignment: Minimum Spanning Tree
We have some network nodes on a 2D cartesian plane.
- Connect all the network nodes to a network with the minimum possible packet exchange cost.
- For this purpose we construct a minimum spanning tree with the vertices being the network nodes and the edges being the network lines.
cs-2008's People
Watchers
cs-2008's Issues
Implement the optimal tape storage algorithm.
Implement the greedy knapsack algorithm for both the 0/1 knapsack and fractional knapsack.
Implement the job scheduling algorithm where the time duration of each slot is a parameter.
Given a text corpus generate the huffman code compressed representation for that text.
Implement the matrix_chain_order and the print_optimal_parens subroutines.
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent