Pinned Repositories
Algorithms-
automatic-app-landing-page
A Jekyll theme for automatically generating and deploying landing page sites for mobile apps.
AvoToast
backtobackswe
Code Examples For Back To Back SWE Lessons
Baking_Website
Battleship
Battleship is a war-themed strategy game for two players, implemented in Java.
bootstrap-navbar-sidebar
Bootstrap navbars fixed to left or right
boxProject1
Project for java 101 class.
Connectmoji-Game
A 2-player connection game, implemented in JavaScript.
Teladoc-Intern-Project
iOS Engineering Internship - Summer 2019
ataraweinreb's Repositories
ataraweinreb/Computer-Systems-
ataraweinreb/README-template
Template for GitHub READMEs
ataraweinreb/bracketMatch
ataraweinreb/powerMethod
ataraweinreb/nQueens
The goal of this project is to find the solutions to the n number of queens on a nxn board. This project uses dynamic arrays and dynamic memory to accomplish its task. See Dynamic Memory for details.
ataraweinreb/sanFranciscoMoviesProject3
Revisits project2, this time using a BST as the parent class of MovieList.
ataraweinreb/sanFranciscoMoviesProject2
Revisits project1, this time using a LinkedList as the parent class of MovieList.
ataraweinreb/sanFranciscoMoviesProject1
This project contains a data set of movies, which are searchable through user queries. The program should run in a loop that allows the user to issue different queries. The two types of queries are: title KEYWORD and actor KEYWORD. In the first case, the program should display the list of all the movies in the data set whose title contains the given keyword (this search should be case insensitive). In the second case, the program should display the list of all the movies with actors whose names contain the given keyword (again, this search should be case insensitive). In both cases, the user may enter a multi-word KEYWORD. On each iteration, the user should be prompted to enter a new query (for which the program computes the results) or the word ’quit’ to indicate the termination of the program.
ataraweinreb/sumOfNumbers
ataraweinreb/converterClass
This class performs conversions between different number systems (binary, decimal, hexadecimal).
ataraweinreb/boxProject3
Project for java 101 class.
ataraweinreb/boxProject2
Project for java 101 class.
ataraweinreb/boxProject1
Project for java 101 class.
ataraweinreb/boxProject4
Project for java 101 class.
ataraweinreb/integration
The goal of this project is to find the area of a function between two points. The program uses typedef to create an alias for a function. By doing so, we can pass a function as a parameter for another function call.
ataraweinreb/kBishops
ataraweinreb/ratClass
The rat class represents a class for rational numbers.
ataraweinreb/shortestPath
The goal of this program is to find the shortest way to move throw a weighted 2D array.
ataraweinreb/stableMarrige
The goal of this project to match n men and n women with their preference rankings of each other and give a "stable" set of marriages. This project uses backtracking to find its solutions.
ataraweinreb/oneDimensionalArrayQueens
We revisit the 8 queens problem, this time using a 1D array to represent the chessboard. A 1D array is more efficient because you can find the queens more easily.
ataraweinreb/shiftEquivalentArrays
The equivalent function should return true if array a can be shifted (by any amount) such that it is equivalent to array b. If the shift went past the end of the array, it should loop back to the beginning.
ataraweinreb/towersOfHanoi
The goal is to move all of the disk from one tower to another tower, with the following 3 rules: move one disk at a time, only move from the top of the tower to the top of another tower, never place a larger disk on a smaller disk.
ataraweinreb/twoDimensionalArrayQueens
The purpose of this program is to solve the 8 Queens problem; place 8 Queens on a 8 x 8 Chessboard such that no two queens threathen each other. No two queens may be in the same row, column, or diagonal. This problem has 92 different configurations or solutions. This will be solved by implementing a backtracking algorithm.
ataraweinreb/eightNumbersInACross
The purpose of this program is to write 8 numbers in a cross such that no two adjacent squares contains consecutive numbers. There are 4 solutions to this problem. This program will utilize the backtracking algorithm.