karthikakaran/Online-Library-Management-with-multiple-branches karthikakaran/Online-Library-Management-with-multiple-branches

  • Stars
    star
    3
  • Rank 3,963,521 (Top 79 %)
  • Language
    JavaScript
  • Created about 9 years ago
  • Updated about 9 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
karthikakaran/Online-Library-Management-with-multiple-branches
github

karthikakaran

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

Technologies used: AngularJS, NodeJS, HTML5, CSS, Bootstrap, MySQL

More Repositories

1

Spark-MLib-Kmeans-DT-Naive-Bayes-ALS-experiments-with-movie-data

Analysis of movie lens and glass quality datasets using Kmeans, Decision trees, Naive-Bayes using Spark MLib ALS recommendations is also performed on the Movies dataset.
Scala
3
star
2

Karatsubha-and-Shunting-yard-algorithm

Karatsubha for multiplication of big integers with all bases and Shunting yard algorithm for parsing braces
Java
2
star
3

Copy-URL-to-Clipboard-Chrome-Extension

Chrome Extension for Copy URL to Clipboard from any webpage
JavaScript
2
star
4

Information-Retrieval---Indexing-and-Compression

Indexing is performed followed by compression of posting list using Gamma code and Dictionary uising Delta code is done
Java
2
star
5

Memory-Efficient-Pharmaceutical-Database-File-and-Indexing-

The goal of this project is to implement a program that parses an ASCII text-based CSV data file and then transforms that same information to a memory-efficient binary format and writes it to a binary data file. The new binary data file also have multiple index files for efficient record retrieval of values from fields other than the primary key. The program should operate entirely from the command line (no GUI). Developed SQL style command based interface in JAVA for retrieving data using index files and binary database. This project parses user input which is ASCII text based pharmaceutical CSV data file and then transforms that same information to a memory-efficient format and writes it to binary data file. Created hash maps and tree maps for each index files which in turn improved data retrieval.
Java
2
star
6

Pert-Charts-Critical-Paths

Java
1
star
7

Diameter-of-a-tree-Strongly-connected-components

Diameter of a tree, Strongly connected components
Java
1
star