Git Product home page Git Product logo

Supreeth's Projects

heapdatastructure icon heapdatastructure

The following project implemented (a) Indexed priority queues (b) Prim1 (priority queue of edges; using Java's priority queues), (c) Prim2 (priority queue of vertices, using indexed heaps)

implementationofdatastructureoptionalproject7 icon implementationofdatastructureoptionalproject7

Implemented the following problems-> 1) Use Java's HashMap to find the most frequently appearing element in an array: public static<T> T mostFrequent(T[] arr) If there is a tie, among the elements that are most frequent, return the one that appears at the smallest index of the array. 2) Compare the performances of Trees, Lists, Skip lists, and Hashing on the operations add, contains, remove. For Tree, List, and Hashing,use the Java library

implementationofdatastructureoptionalprojects icon implementationofdatastructureoptionalprojects

OptionalProject-1 implemented the following-> 1) Suppose large numbers are stored in a list of integers. Write functions for adding and subtracting large numbers. 2) Merge sort algorithm that works on linked lists. 3) Merge Sort Implementation and compare its performance with o(nlgn) priority queue

interview icon interview

Contains code to some of the Frequently asked Interview questions

javatreeset_optionalproject5 icon javatreeset_optionalproject5

These are the problems as part of my Optional Project 5 for the course Implementation of Data-structures and algorithms.

machinelearning icon machinelearning

Implementation of Multinomial Naïve Bayes Algorithm for Text Classification and Implementation of Logistic Regression Algorithm.

openlegislation icon openlegislation

OpenLegislation is a web service that delivers legislative information from the New York State Senate and Assembly to the public in near-real time. It is used internally to serve up legislative data for nysenate.gov and the Bluebird-CRM.

skiplists icon skiplists

Implemented Skip-list data-structure.Time complexity of search, insert and delete can become O(Logn) in average case.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.