shravankumargulvadi Goto Github PK

alphabet_sorter

alphabet_sorter_ros

audio-activation-module-for-home-automation

The Project is split into 2 parts. Part I aims at developing a stand alone Audio Activation Module that can be used as plug in module in any application that requires audio activation like robots, task automation, toys etc. The Part II of the project focuses specifically on interfacing our module with the existing industry standard home automation hardware and making it work.

binary-search

In this problem, you will implement the binary search algorithm that allows searching very efficiently (even huge) lists, provided that the list is sorted.

cnn-code-debugging

EVA Assignment 2

collecting-signatures

You are responsible for collecting signatures from all tenants of a certain building. For each tenant, you know a period of time when he or she is at home. You would like to collect all signatures by visiting the building as few times as possible. The mathematical model for this problem is the following. You are given a set of segments on a line and your goal is to mark as few points on a line as possible so that each segment contains at least one marked point.

drone_acrobatics

Make crazyflie do multiple flips

dwell-period-implementation-in-one-cycle-lr

The inspiration for Dwell period implementation is taken from Mechanical Cams. The Idea is to introduce a time period within the Flexible One Cycle LR policy (See the customized one cycle LR repository) where the model 'Dwells' at the Max LR instead of immediate descent generally practiced. The Intuition is that this should facilitate early convergence.

dynamic-prog_edit-distance

The edit distance between two strings is the minimum number of operations (insertions, deletions, and substitutions of symbols) to transform one string into another. It is a measure of similarity of two strings. Edit distance has applications, for example, in computational biology, natural language processing, and spell checking. Your goal in this problem is to compute the edit distance between two strings.

dynamic-prog_knapsack_maximum-amount-of-gold

You are given a set of bars of gold and your goal is to take as much gold as possible into your bag. There is just one copy of each bar and for each bar you can either take it or not (hence you cannot take a fraction of a bar).

dynamic-prog_maximum-value-of-an-arithmetic-expression

In this problem, your goal is to add parentheses to a given arithmetic expression to maximize its value. max(5−8+7×4−8+9) =? Problem Description Task. Find the maximum value of an arithmetic expression by specifying the order of applying its arithmetic operations using additional parentheses.

dynamic-prog_money-change-again

As we already know, a natural greedy strategy for the change problem does not work correctly for any set of denominations. For example, if the available denominations are 1, 3, and 4, the greedy algorithm will change 6 cents using three coins (4 + 1 + 1) while it can be changed using just two coins (3 + 3). Your goal now is to apply dynamic programming for solving the Money Change Problem for denominations 1, 3, and 4.

emojify-sentiment-analysis

details in code

engineering-computation

eva-session-6

experiments-with-cnn-architechture

This repository is meant for the 4th assignment of the EVA course

face-detection

Face Detection and Face Verification

fibonacci-number-again

finding-tonys-glasses

This repository has the contents of EVA assignment 10

greatest-common-divisor

greedy-algos_car-fueling

You are going to travel to another city that is located 𝑑 miles away from your home city. Your car can travel at most 𝑚 miles on a full tank and you start with a full tank. Along your way, there are gas stations at distances stop1, stop2, . . . , stop𝑛 from your home city. What is the minimum number of refills needed?

greedy-algos_maximum-number-of-prizes

You are organizing a funny competition for children. As a prize fund you have 𝑛 candies. You would like to use these candies for top 𝑘 places in a competition with a natural restriction that a higher place gets a larger number of candies. To make as many children happy as possible, you are going to find the largest value of 𝑘 for which it is possible. Problem Description Task. The goal of this problem is to represent a given positive integer 𝑛 as a sum of as many pairwise distinct positive integers as possible. That is, to find the maximum 𝑘 such that 𝑛 can be written as 𝑎1 + 𝑎2 + · · · + 𝑎𝑘 where 𝑎1, . . . , 𝑎𝑘 are positive integers and 𝑎𝑖 ̸= 𝑎𝑗 for all 1 ≤ 𝑖 < 𝑗 ≤ 𝑘.

greedy-algos_maximum-salary

As the last question of a successful interview, your boss gives you a few pieces of paper with numbers on it and asks you to compose a largest number from these numbers. The resulting number is going to be your salary, so you are very much interested in maximizing this number. How can you do this?

greedy-algos_maximum-value-of-the-loot

A thief finds much more loot than his bag can fit. Help him to find the most valuable combination of items assuming that any fraction of a loot item can be put into his bag.

greedy-algos_money-change

In this problem, you will design and implement an elementary greedy algorithm used by cashiers all over the world millions of times per day.

improving-quick-sort

The goal in this problem is to redesign a given implementation of the randomized quick sort algorithm so that it works fast even on sequences containing many equal elements.

inception-net

This repository contains the contents of EVA Assignment 7

last-digit-of-a-large-fibonacci-number

last-digit-of-the-sum-of-fibonacci-numbers

last-digit-of-the-sum-of-fibonacci-numbers-again

Now, we would like to find the last digit of a partial sum of Fibonacci numbers: 𝐹𝑚 + 𝐹𝑚+1 + · · · + 𝐹𝑛.