Pinned Repositories
30-Days-LeetCode-Challenge
https://leetcode.com/explore/challenge/card/30-day-leetcoding-challenge/
Big-Two-GUI
This Graphical User Interface uses networking and object oriented programming in Java to help users play the card game: Big Two
Calculation-of-ticket-price
(1) Calculation of ticket price: page 1 in the instruction "Price of this ticket (a further 10% discount if customer buy through Joyful Travel)". all tickets bought through this system has 10% off" after every successful "buy" operation, calculate the total price (price for 1 ticket * number of tickets * 0.9), keep the result as integer (no need to round up) the total revenue will be the sum of all total price above. (2) mainDB.csv - maximum 500 records. treat this as a read only file. when program runs for the first time, read the content of this file into arrays, and start working. when program runs again, read the content of this file and intermediate file into arrays, and then start working. (3) airportcode.txt - maximum 200 records (4) when a promotion quota reaches zero, the corresponding array record needs to be made empty so to release space for a new record. (5) ordering of the user commands, user will enter
casestudy
diversity
Our repository for Diversity & Inclusion work at Mozilla
Game-House-Application-
Implementing a simple game house application using Python socket programming. A game house is an application in which multiple clients connect to a game server, get authorized, and then select a game room to enter and play a game with another player in the same room. The game house application consists of two parts: the server program and the client program. The server program should always be running and use a welcome socket to wait for connection requests from clients. The client programs establish TCP connections with the server program. After a connection is set up, the client needs to send its user name and password to the server, and can enter the game hall after successful authentication. An authenticated user is able to query the status of the game rooms, and then pick a room to enter. To start a game, there should be exactly two players in the same room. Therefore, if the entering player is the first one in the room, the player has to wait; otherwise, the game starts. After the game has started, the server generates a random boolean value and each player is invited to guess the boolean value; the player who guesses the same as the randomly generated value is the winner, and the game results in a tie if the two players’ guesses are the same. After notifying both players the game result, the game is over and both players return to the game hall. A user may leave the system when the user is in the game hall.
open-demographics
Open Demographics Initiative: An open standard for collecting identity/demographic data in open source communities.
PenetrationTestReport
Conducted a web penetration using OWASP and Security Shepherd. Please read the disclaimer and notice before proceeding.
Phishing-URL-Detector
With the integration of Machine Learning in detecting phishing attempts, the avenue of its applications is extremely widespread. Malicious emails are a form of phishing attack, which redirects the user to visit unexpected sites or cause computer viruses to be downloaded on the user’s system. The project’s aim is to mitigate the vulnerability of such emails by using an ML algorithm to detect these URLs and notify the user of the possible danger.
team-44-codeu
guptatrisha97's Repositories
guptatrisha97/Phishing-URL-Detector
With the integration of Machine Learning in detecting phishing attempts, the avenue of its applications is extremely widespread. Malicious emails are a form of phishing attack, which redirects the user to visit unexpected sites or cause computer viruses to be downloaded on the user’s system. The project’s aim is to mitigate the vulnerability of such emails by using an ML algorithm to detect these URLs and notify the user of the possible danger.
guptatrisha97/PenetrationTestReport
Conducted a web penetration using OWASP and Security Shepherd. Please read the disclaimer and notice before proceeding.
guptatrisha97/30-Days-LeetCode-Challenge
https://leetcode.com/explore/challenge/card/30-day-leetcoding-challenge/
guptatrisha97/Big-Two-GUI
This Graphical User Interface uses networking and object oriented programming in Java to help users play the card game: Big Two
guptatrisha97/Calculation-of-ticket-price
(1) Calculation of ticket price: page 1 in the instruction "Price of this ticket (a further 10% discount if customer buy through Joyful Travel)". all tickets bought through this system has 10% off" after every successful "buy" operation, calculate the total price (price for 1 ticket * number of tickets * 0.9), keep the result as integer (no need to round up) the total revenue will be the sum of all total price above. (2) mainDB.csv - maximum 500 records. treat this as a read only file. when program runs for the first time, read the content of this file into arrays, and start working. when program runs again, read the content of this file and intermediate file into arrays, and then start working. (3) airportcode.txt - maximum 200 records (4) when a promotion quota reaches zero, the corresponding array record needs to be made empty so to release space for a new record. (5) ordering of the user commands, user will enter
guptatrisha97/casestudy
guptatrisha97/diversity
Our repository for Diversity & Inclusion work at Mozilla
guptatrisha97/Game-House-Application-
Implementing a simple game house application using Python socket programming. A game house is an application in which multiple clients connect to a game server, get authorized, and then select a game room to enter and play a game with another player in the same room. The game house application consists of two parts: the server program and the client program. The server program should always be running and use a welcome socket to wait for connection requests from clients. The client programs establish TCP connections with the server program. After a connection is set up, the client needs to send its user name and password to the server, and can enter the game hall after successful authentication. An authenticated user is able to query the status of the game rooms, and then pick a room to enter. To start a game, there should be exactly two players in the same room. Therefore, if the entering player is the first one in the room, the player has to wait; otherwise, the game starts. After the game has started, the server generates a random boolean value and each player is invited to guess the boolean value; the player who guesses the same as the randomly generated value is the winner, and the game results in a tie if the two players’ guesses are the same. After notifying both players the game result, the game is over and both players return to the game hall. A user may leave the system when the user is in the game hall.
guptatrisha97/open-demographics
Open Demographics Initiative: An open standard for collecting identity/demographic data in open source communities.
guptatrisha97/Outreachy-Diversity
Visualization from Github Data #85
guptatrisha97/team-44-codeu
guptatrisha97/Resume-website
guptatrisha97/risk-check-service
guptatrisha97/Segment-Tree
guptatrisha97/taskcluster-client.py
A python implementation of the Taskcluster Client Library
guptatrisha97/taskcluster-lib-api
guptatrisha97/Ten-Pin-Bowling
guptatrisha97/The-square-laser-maze-
The square laser maze Consider a sample laser maze shown on the left below: In maze 1, the orange laser beam starts from coordinates (1,2) with laser going along the East direction. The laser first hits a single‐sided mirror at (2,2), and then travels North, hits a double‐sided mirror at (2,4), and then goes East, hits another double‐sized mirror at (5,4), and direction changes to South. Finally, arriving the destination at (5,3). The green laser beam starts from (0,3) with laser going along the East direction. If you follow the path of the laser beam, you will notice the laser hits a few mirrors and finally arriving the destination at (4,1). In maze 1, both laser beams arrive at a destination. On the other hand, all beams in maze 2 cannot reach a destination. The orange laser beam goes off the boundary, the green laser beam is blocked at (2,5) and cannot go further, and the red laser beam is blocked at (3,0) as well. A typical laser maze contains these items: At least 1 and at most 5 laser beam sources. Laser beam source will point to one of these directions: North, East, South, West. At least 1 and at most 5 destinations. Number of destinations can be different from the number of sources. Zero or more single‐sided mirrors. There are 4 kinds of single‐sided mirror, facing NW, SE, SW, or NE. Zero or more double‐sided mirrors. There are 2 kinds of double‐sided mirror. Zero or more laser blocks. This is the cross shown in maze 2 above. A laser block will stop any laser beam at the space that it is located. Note that in a laser maze, there will be at most 20 items, and no two items share the same coordinates. Smallest possible laser maze is 2x2.Converting the graphical maze into words Somehow the laser maze needs to be entered into the program. We will give each item in the laser maze a name. Below is the conversion table: Symbol What is it? single nw Single‐sided mirror facing the direction NW single se Single‐sided mirror facing the direction SE single sw Single‐sided mirror facing the direction SW single ne Single‐sided mirror facing the direction NE double nw Double‐sided mirror facing NW and SE double ne Double‐sided mirror facing NE and SW block Laser block source direction Laser beam source facing one of N, E, S, W (e.g. corresponds to source east) dest Destination Using this conversion table, together with the coordinates of each item, maze 1 and maze 2 can be represented non‐graphically, like this: single se 1,6 double ne 4,6 single nw 3,3 source east 1,2 single se 2,5 source east 0,3 double ne 5,4 dest 4,1 single sw 3,5 single ne 1,4 single nw 2,2 dest 5,3 double nw 2,4 single se 1,6 dest 4,1 single se 2,5 source east 0,3 double ne 2,6 single nw 3,3 source north 2,2 double ne 5,4 single sw 3,5 double ne 1,0 dest 6,2 block 3,0 source east 0,1 single ne 1,4 double nw 2,4 single sw 1,1 Maze 1 Maze 2 Source and destination are assumed to be labelled starting from 1. For example, in maze 1 above, there are two sources and two destinations, where the laser beam from source 1 will arrive at destination 2, and the beam from source 2 will hit destination 1. For maze 2, all three sources will not arrive at any destination.
guptatrisha97/Trisha