haris-bit Goto Github PK

ai-image-generator-app

algorithms

Algorithms 🅰️

aliahns

This repository is under GDSC Aliah for their participants to get a good grasp of open source and how to work among others. In this repository there will be only beginner level contributions so as to get the participants started.

alphabetprojectapp

alphabetprojectappbetterapproach

amazing_space_website

In this project, I learned how to change the way a website appears on different screens with media queries and breakpoints.

androidcalculatorapp

A calculator which performs basic operations like, addition, subtraction, multiplication, and division.

androidramadantimer

A timer which displays the Sehri and Aftari timings for the 2022 Islamic Calendar.

animevault

aoife_conleavy_project

Aoife Conleavy is a novelist who has been writing about her travels for nearly two decades. Before the launch of her new novel Tide Blade, which features the stories of real-life characters in Morocco, the author wants to spruce up her professional website. You’ll modify the typography on her site, changing the size, style, and font families, to make the page easier to read.

appwrite

Secure Backend Server for Web, Mobile & Flutter Developers 🚀 AKA the 100% open-source Firebase alternative.

assembler.hack

:pager: 16-bit machine code assembler for the Hack Assembly Language (nand2tetris)

atm

A file that consists of an ATM class that simulates the working of a cash vending machine. Applied concepts like static variables and methods using the Java programming language.

basic_object-oriented_java

Learning the basics of object oriented programming using Java.

basta_fazoolin

Organizing things at Basta Fazoolin' with My Heart (imaginary family-style Italian restaurant) using OOP in Python. The key concepts in this project include: ⚪ Classes, Methods ⚪ List filtering and aggregation ⚪ Representing objects as strings

become_a_pokemon_master

This project uses Python Classes to create a game system similar to the popular game series Pokémon. If you’re unfamiliar with Pokémon, it is a game where creatures (Pokémon) battle against each other. Every Pokémon has statistics associated with it like health, level, type, and a name. This project includes several classes that interact with each other so you can create your own Pokémon battles!

bfs

The breadth-first traversal iterates through the graph in layers. It goes down one layer, which comprises the start vertex’s direct neighbors. Then it proceeds down to the next layer which consists of all the vertices that are neighbors of the vertices in the previous layer.

binarysearch

Learned how to implement an iterative binary search solution. The method returns the index of the target value from a sorted list. If the target value is not found, the method returns -1. The benefits of binary search are significant compared to linear search on a sorted array, because it does not need to check every element to determine whether a target value is in an array. However, this logic only works on a sorted list!

binarysearchtree

Successfully built a Binary Search Tree (BST) data structure in Java. - a BinarySearchTree class containing value, left and right child nodes and a depth value. - an .insert() method to place a node of that value at the correct location in the Binary Search Tree. The time efficiency of this operation is O(logN) – if there are N nodes in the BST, the max depth of an average tree is log(n), so this method makes at most log(n) value comparisons. In the worst case of an imbalanced tree (all values on one side), the performance would be O(N). - a .getNodeByValue() method to retrieve a node in the tree by its value. The time efficiency of this operation is also O(logN) – if there are N nodes in the BST, the max depth of the tree is log(n), so this method makes at most log(n) value comparisons. In the worst case of an imbalanced tree (all values on one side), the performance would be O(N). - a .depthFirstTraversal() method to print the inorder traversal of the Binary Search Tree. This visits every single node, so if there are N nodes, time efficiency for traversal is O(N).

birthdaygreetingapp

bleep

bleep.cpp is a program that bleeps anything that is passed in its function

blocky-bites

blocky-bites-testing

bookapp

bookprojectprac

broadway

In this project, properties such as display and position were used to improve the layout of the landing page for a fictional design firm, Broadway Design.

bubblesort

Implemented the Bubble Sort algorithm that takes an array of integers and sorts them from smallest to largest. In the bubbleSort() method, we have a while loop that runs the swapping logic until the array is fully sorted. Inside the while loop, we have a for loop that iterates through the array and checks whether adjacent elements are out of order. If so, we swap the first instance of two adjacent elements that are out of order. The swapping is done using a helper function. If we swapped, we signal to the while loop that we may need another look through the array, so the loop runs once again. The loop stops running after there are no two adjacent elements that are out of order.

buildyourowncheatsheet

carlys_clippers

You are the Data Analyst at Carly’s Clippers, the newest hair salon on the block. Your job is to go through the lists of data that have been collected in the past couple of weeks. You will be calculating some important metrics that Carly can use to plan out the operation of the business for the rest of the month.

cereal_data

Used the Pandas framework to analyze data from a .csv file containing various information about different kinds of cereal brands in the world.