Built something? We create video reels & spotlights for GitHub projects.Promote your project →
Home / Developers / venkatesh5789
Developer Profile

venkatesh5789

Discovered public repositories for venkatesh5789 in the GitHub catalog.

↗

venkatesh5789/VanetPrivacy

Simulation of transition and timing attacks and a study of their effectiveness on Vehicular Ad-Hoc networks (VANETs).

↗

venkatesh5789/battleship

This is a different version of the classic two player battleship game. This game allows upto 5 players to play against each other. A user can also play multiple battleship games at the same time. Any user can shoot at any other user in the game. Last man standing wins!!

↗

venkatesh5789/bibtexcompiler

A compiler that compiles any BIBTEX database file into a C program which can be subsequently compiled into an executable and then run so as to answer any query about the entries in the BIBTEX database file. Converts the BIBTEX file into a relational database and one can then use sqlite queries on it to find out answers.

↗

venkatesh5789/cigarettesmokersproblem

Suppose a cigarette requires three ingredients, tobacco, paper and match. There are three chain smokers. Each of them has only one ingredient with infinite supply. There is an agent who has infinite supply of all three ingredients. To make a cigarette, the smoker has tobacco (resp., paper and match) must have the other two ingredients paper and match (resp., tobacco and match, and tobacco and paper). The agent and smokers share a table. The agent randomly generates two ingredients and notifies the smoker who needs these two ingredients. Once the ingredients are taken from the table, the agent supplies another two. On the other hand, each smoker waits for the agent's notification. Once it is notified, the smoker picks up the ingredients, makes a cigarette, smokes for a while, and goes back to the table waiting for his next ingredients.

↗

venkatesh5789/sleepingbarbers

A barbershop consists of a waiting room with N chairs and the barber room containing the barber chairs. If there are no customers to be served, the barber goes to sleep. If a customer enters the barbershop and all chairs are occupied, then the customer leaves the shop (without waiting for service). If the barber is busy but chairs are available, then the customer sits in one of the free chairs. If the barber is asleep, the customer wakes up the barber. Each customer and barber are different threads. Semaphores are used. Priority amongst customers is also incorporated. Let us say that there are two groups: staff and student. A waiting student customer has priority over the waiting staff customer (because the students are supposed to be busy !!!). Therefore, a barber attends to the waiting student customer after finishing the work on present customer. The program runs both with priority and without priority. In priority approach starvation is avoided by enforcing the condition of “each staff can allow maximum of 5 students to overtake”.

FOR MAINTAINERS

Built something? Put it in front of millions of developers.

We make a short reel about your project and post it across YouTube, Instagram, Threads, and X. Send a link, we do the rest.