nikita1212 Goto Github PK

card

careers

Want to work at Smyte? Email us: [email protected]

chrome-extension

coda-coding

coding-cracking

solution of coding cracking questions in python

cornholescore

Grow With Google Challenge Scholarship: Android Basics - Project 2 - Cornhole Score app

court-counter

The official repository for the third Android Development for Beginners App : CourtCounter

courtcounter

cpsc483

cracking-the-coding-interview

My Java solutions to the questions in Cracking the Coding Interview (5th Edition).

data-analysis-using-mapreduce

datastructure

decrypt-message

facebook-chatbot-python

A simple python chatbot for Facebook messenger

free-programming-books

:books: Freely available programming books

free-programming-tutorials

List of free online video courses to learn programming language

frontendtrivia

Flip through decks of trivia cards | frontendtrivia.com | quickly discover concepts for further study

google-maps-services-python

Python client library for Google Maps API Web Services

hackerrank_solutions

317 efficient solutions to HackerRank problems

helloandroid

html-essential-training

introduction_to_ml_with_python

Notebooks and code for the book "Introduction to Machine Learning with Python"

justjava

justjavafinal

lamport-logical-clock-it-s-varification

The Lamport Logical Clock problem Given a distributed system with N processes, each process goes through a finite number of events. The events could be internal or send or receive. We assume that broadcast is a send event with more than two receive events. In a correct execution of the (entire) distributed system: - each send event is followed by one or more receive events (no messages are lost) - a process has only one receive event associated with a send event executed at another process (there is no duplication of messages received) - there is no receive event without a send event that has happen at a different process earlier in the execution. We know that there is no global (shared) clock in a distributed system. Since a common physical clock is difficult to maintain and we are not interested in exact global real time but only in the ordering of these occurrences in time, we use the notion of logical clocks to have a partial order between events. As we learnt in the class, a logical clock C maps occurrences of events in a computation to partially ordered set such that 𝑎≺𝑏 ⇒ 𝐶(𝑎) < 𝐶(𝑏). Two examples of logical clocks are Lamport’s logical clock and the vector clock. In class we discussed and gave examples of how to calculate the Lamport logical clock values for events. Each process encounters a number of events and each event will have a Lamport Logical Clock value, simply LC-value, associated with it. In the next paragraph we will describe how to calculate these values. After that we will discuss if,, given values, how to detect whether a process has a correct or incorrect execution. Both aspects are important for the two algorithms that you have to design and implement. Let P be some process in the N-node distributed network. We need to calculate the LC-value for all the events that P encounters. We will reword the definition of the Lamport logical clock to make it more recursive. Let a be some event encountered by P. 1. If a is the first event and is an internal or send event, then LC(a) = 1. 2. If a is the first event and is a receive event, then LC(a) = k + 1 where k is the LC-value of the send event corresponding to a (that has occurred at a process other than P). 3. If a is not the first event and is an internal or send event, then LC(a) = k + 1 where k is the LC-value of the event just before a at process P. 4. If a is not the first event and is a receive event, let b be the send event corresponding to a (that has occurred at a process other than P) and k be the clock value of the event just before a at process P. Then LC(a) = max{ k, LC(b) } + 1

laz-ereader-chrome-extension

Developed Laz-eReader to give the user the ability to consume article-based media without needing to read. You can listen to the contents of any article on the web as our extension reads to you-- without the distraction of ads or suggested stories that fill the page, and without eye strain in long browsing sessions. Simply open the article you want to have read to you, click on the extension in the upper-right corner and click “READ” and both the title and the contents of the article will be read aloud. Our website (and extension) also have the functionality to read a text file that you provide in the same fashion.

laz-ereader-website

leetcode

:pencil: Python / C++ 11 Solutions of All LeetCode Questions

lintcode

:pencil2: C++ 11 Solutions of All 289 LintCode Problems

makeyourownneuralnetwork

Code for the Make Your Own Neural Network book