Mohammad K. Profile | Freelancer

Como Isso Funciona

Busque Trabalhos

Publicar um Projeto

5,0

(17 avaliações)

Foto de capa do perfil

Você está agora seguindo

Erro seguindo usuário.

Esse usuários não permite que o sigam.

Você já está seguindo esse usuário.

Seu plano permite apenas 0 seguidas. Aprimore-o aqui.

Deixou de seguir com sucesso

Ocorreu um erro ao deixar de seguir o usuário.

Você recomendou com sucesso

Ocorreu um erro ao recomendar o usuário.

Algo deu errado. Por favor, atualize a página e tente novamente.

E-mail verificado com sucesso

$55 USD / hora

Bandeira do(a) PALESTINIAN TERRITORY

ramallah,

palestinian territory

$55 USD / hora

Atualmente, está 7:37 AM aqui

Ingressou em março 16, 2012

1 Recomendação

Mohammad K.

@vw8150693vw

5,0

(17 avaliações)

3,9

3,9

92%

92%

$55 USD / hora

Bandeira do(a) PALESTINIAN TERRITORY

ramallah,

palestinian territory

$55 USD / hora

100%

Trabalhos Concluídos

100%

Dentro do Orçamento

100%

No Prazo

9%

Taxa de Recontratação

Software Engineer

I have Bachelor Degree in Computer Engineering, I have 10 years of experience in software development on Java, Spring boot ,hibernate , docker and kubernetes. here are my skills in summary: • Java • Spring • Hibernate • Docker • Kubernetes • C • Python • Linux • MySQL • Java script • HTML5 • CSS3 • JQuery • PHP • WordPress

Ver todos Java Developers em Palestinian Territory

Contate Mohammad K. sobre seu trabalho

Faça login para discutir quaisquer detalhes via chat.

Portfólio

The project aims to make a calculator using a stack to save the precedence of the operations "+, - ,* ,/ ,( , ) ....." . A link list is used to create the stack, The algorithm used to calculate the precedence is the RPN (reverse polish notation ). The program has nice GUI to help the user.

Calculator using stack (Java)

The binary search tree is very useful as it ease the search , log n time is the O(n) for the search.

The project is to read the file inside a path recursively (.txt files) and put each word in the file in a node in the BST. after reading all the files inside the path a report should be printed regarding the occurrence of these words, number of files this word occurred on , the name of these files. print the tree in Ascending orders and descending order. search for a word in the tree. remove a word from the tree.

Binary Search Tree (BST) (Java and C)

This system provides many information and services which help the user to get the data in an easy way and answers all the customers' quires, including:
1- when did they pay their bills?
2- how much was the bill ?
... and many other features to help the user to get the data easily.

The program is implemented using Java and the database using mysql , it has GUI and good search engine to find the customers on the system.

Billing system for water company

Description of problem :https://en.wikipedia.org/wiki/Producer%E2%80%93consumer_problem

I implemented this using :
1- Empty semaphore (to know how many items can the buffer hold)
2- Full semaphore (to know if the buffer is full)
3- mutex to prevent read and write on the same time

multi threading is used for the consumer and producer threads, the buffer is implemented as a circular queue.

Skills: C, Linux, Multi-threading

Producer Consumer problem

• Tarneeb card game consists of 4 players, each 2 play in team.
• The person with the highest card will win the round.
• The score will be increased for the winner team.
• The Application will use semaphores, so each player will wait others until they throw a card.
• The score will be increase for winner team.

The project includes using multi-processing by forking 4 players from the parent process, also using semaphores , mutex and shared memory for the player processes.

Environment: Linux, C code , multiprocessing, shared memory

Tarneeb Card Game

The project aims to make a calculator using a stack to save the precedence of the operations "+, - ,* ,/ ,( , ) ....." . A link list is used to create the stack, The algorithm used to calculate the precedence is the RPN (reverse polish notation ). The program has nice GUI to help the user.

Calculator using stack (Java)

The binary search tree is very useful as it ease the search , log n time is the O(n) for the search.

The project is to read the file inside a path recursively (.txt files) and put each word in the file in a node in the BST. after reading all the files inside the path a report should be printed regarding the occurrence of these words, number of files this word occurred on , the name of these files. print the tree in Ascending orders and descending order. search for a word in the tree. remove a word from the tree.

Binary Search Tree (BST) (Java and C)

This system provides many information and services which help the user to get the data in an easy way and answers all the customers' quires, including:
1- when did they pay their bills?
2- how much was the bill ?
... and many other features to help the user to get the data easily.

The program is implemented using Java and the database using mysql , it has GUI and good search engine to find the customers on the system.

Billing system for water company

Description of problem :https://en.wikipedia.org/wiki/Producer%E2%80%93consumer_problem

I implemented this using :
1- Empty semaphore (to know how many items can the buffer hold)
2- Full semaphore (to know if the buffer is full)
3- mutex to prevent read and write on the same time

multi threading is used for the consumer and producer threads, the buffer is implemented as a circular queue.

Skills: C, Linux, Multi-threading

Producer Consumer problem

• Tarneeb card game consists of 4 players, each 2 play in team.
• The person with the highest card will win the round.
• The score will be increased for the winner team.
• The Application will use semaphores, so each player will wait others until they throw a card.
• The score will be increase for winner team.

The project includes using multi-processing by forking 4 players from the parent process, also using semaphores , mutex and shared memory for the player processes.

Environment: Linux, C code , multiprocessing, shared memory

Tarneeb Card Game

Avaliações

Mudanças salvas

Mostrando 1 - 5 de 17 avaliações

Filtrar avaliações por:

5,0

$45,00 USD

Project for vw8150693vw -- 4

This guy is very talented and if you see him on the offers, don't hesitate and hire :)

+1 mais

C

Ahmet A.

@coyoteee

•

há 7 anos

5,0

$70,00 USD

Project for vw8150693vw -- 3

He is a very talented and fast guy, definitely will hire him again.

+1 mais

C

Ahmet A.

@coyoteee

•

há 7 anos

5,0

$55,00 USD

Project for vw8150693vw -- 2

Very fast, talented and helpful freelancer. I will hire him again.

+1 mais

C

Ahmet A.

@coyoteee

•

há 7 anos

5,0

$47,00 USD

Project for vw8150693vw

Very helpful,talented and fast freelancer, i will hire again.

+1 mais

C

Ahmet A.

@coyoteee

•

há 7 anos

5,0

$10,00 USD

Project for vw8150693vw

Amazing guy, will for sure hire him again, good communication, good skills, excellent !!!

+1 mais

B

Closed User

@budourbedo

•

há 7 anos

Experiência

Cisco Systems

set. 2014 - Atual

Skills: Java, Javascript

Educação

Bachelor Degree in Computer Engineering

Palestinian Territory

2010 - 2015

(5 anos)

Contate Mohammad K. sobre seu trabalho

Faça login para discutir quaisquer detalhes via chat.

Verificações

Freelancer Preferencial

Identidade Verificada

Pagamento Verificado

Telefone Verificado

E-mail Verificado

Conectado ao Facebook

Certificações

US English 1

90%

Java 1

85%

Foundation vWorker Member

Principais Habilidades

12

11

7

6

6

Busque Freelancers Parecidos

Java Developers in Palestinian Territory

Java Developers

PostgreSQL Developers

Busque Mostruários Parecidos

Usuário Anterior

Usuário Seguinte

Convite enviado com sucesso!

Obrigado! Te enviamos um link por e-mail para que você possa reivindicar seu crédito gratuito.

Algo deu errado ao enviar seu e-mail. Por favor, tente novamente.

Carregando pré-visualização

Permissão concedida para Geolocalização.

Sua sessão expirou e você foi desconectado. Por favor, faça login novamente.