Mohamed Adel Hassan's repositories

FTP-server-in-java-

The File Transfer Protocol (FTP) is a standard network protocol used for the transfer of computer files between a client and server on a computer network. in java you can build your own ftp server to help your self for sending data to your server

Language:JavaLicense:MITStargazers:2Issues:0Issues:0

SMTP-Server-using-JavaMail-API

smtp server using java mail api with swing

Language:JavaLicense:MITStargazers:1Issues:1Issues:0
Language:ScalaLicense:Apache-2.0Stargazers:1Issues:0Issues:0
Language:ScalaStargazers:0Issues:0Issues:0
Language:JavaLicense:Apache-2.0Stargazers:0Issues:0Issues:0

Spark_TwitterAnalysis

Spark Streaming service will pull tweets and apply Sentiment Analysis on them using stanfordNlpCore lib

Language:ScalaStargazers:0Issues:0Issues:0
Language:ScalaLicense:MITStargazers:0Issues:0Issues:0
Language:ScalaStargazers:0Issues:0Issues:0

Asymptotic-Notations-using-Chart-at-.Net-

Asymptotic Notations are languages that allow us to analyze an algorithm’s running time by identifying its behavior as the input size for the algorithm increases. This is also known as an algorithm’s growth rate. Does the algorithm suddenly become incredibly slow when the input size grows? Does it mostly maintain its quick run time as the input size increases? In the first section of this doc we described how an Asymptotic Notation identifies the behavior of an algorithm as the input size changes. Let us imagine an algorithm as a function f, n as the input size, and f(n) being the running time. So for a given algorithm f, with input size n you get some resultant run time f(n). This results in a graph where the Y axis is the runtime, X axis is the input size, and plot points are the resultants of the amount of time for a given input size. You can label a function, or algorithm, with an Asymptotic Notation in many different ways. Some examples are, you can describe an algorithm by its best case, worse case, or equivalent case. The most common is to analyze an algorithm by its worst case. You typically don’t evaluate by best case because those conditions aren’t what you’re planning for. A very good example of this is sorting algorithms; specifically, adding elements to a tree structure. Best case for most algorithms could be as low as a single operation. However, in most cases, the element you’re adding will need to be sorted appropriately through the tree, which could mean examining an entire branch. This is the worst case, and this is what we plan for. And you know that we have six Types of Asymptotic Notation. I used data chart in c# language to show the Quadratic o(n^2) type for every runtime process by using Stopwatch api in C# language in namespace System.Diagnostics.

Language:C#License:GPL-3.0Stargazers:0Issues:0Issues:0

bigEssencial-YADEX

Big Data Essentials: HDFS, MapReduce and Spark RDD - COURSERA

Stargazers:0Issues:0Issues:0
Language:JavaStargazers:0Issues:0Issues:0

JAVA-Networking

getting NetworkInterfaces information on your device using java

Language:JavaStargazers:0Issues:0Issues:0
Language:JavaStargazers:0Issues:0Issues:0

Naive-Pattern-Algorithm

Native Pattern Algorithm

Language:JavaLicense:MITStargazers:0Issues:0Issues:0
Stargazers:0Issues:0Issues:0
Language:Jupyter NotebookStargazers:0Issues:0Issues:0
Stargazers:0Issues:0Issues:0
Language:PythonStargazers:0Issues:0Issues:0
Language:ScalaLicense:Apache-2.0Stargazers:0Issues:0Issues:0

Spark_Big-data

WordCount using spark

Language:ScalaLicense:Apache-2.0Stargazers:0Issues:0Issues:0

TestArray-in-Memory-using-C-Language

Test Array in Memory using C++ Language

Language:C++License:GPL-3.0Stargazers:0Issues:0Issues:0
Language:JavaStargazers:0Issues:0Issues:0
Language:JavaLicense:MITStargazers:0Issues:0Issues:0

WordCount-In-Java

WordCount example in java using hashmap data structure

Language:JavaStargazers:0Issues:0Issues:0