Mohammad K. Profile | Freelancer

Iniciar sesión

Publica un proyecto

5,0

(17 comentarios)

Foto de portada de perfil

Ahora estás siguiendo a

Error al seguir a usuario.

Este usuario no permite que los usuarios lo sigan.

Ya estás siguiendo a este usuario.

Tu plan de membresía solo permite 0 seguimientos. Mejora tu membresía aquí.

Dejaste de seguir correctamente a

Error al dejar de seguir al usuario.

Has recomendado exitosamente a

Error al recomendar al usuario.

Algo salió mal. Por favor, actualiza la página e intenta de nuevo.

Email verificado correctamente.

$55 USD / hora

Bandera de PALESTINIAN TERRITORY

ramallah,

palestinian territory

$55 USD / hora

Aquí son las 4:23 p. m.

Se unió el marzo 16, 2012

1 Recomendación

Mohammad K.

@vw8150693vw

5,0

(17 comentarios)

3,9

3,9

92%

92%

$55 USD / hora

Bandera de PALESTINIAN TERRITORY

ramallah,

palestinian territory

$55 USD / hora

100 %

Trabajos finalizados

100 %

Dentro del presupuesto

100 %

A tiempo

9 %

Tasa de recontratación

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 todo Java Developers en Palestinian Territory

Contacta Mohammad K. sobre tu trabajo

Inicia sesión para comentar cualquier detalle por chat.

Portafolio

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

Comentarios

Cambios guardados

Mostrando 1 - 5 de 17 reseñas

Filtrar reseñas 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 más

C

Ahmet A.

@coyoteee

•

hace 7 años

5,0

$70,00 USD

Project for vw8150693vw -- 3

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

+1 más

C

Ahmet A.

@coyoteee

•

hace 7 años

5,0

$55,00 USD

Project for vw8150693vw -- 2

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

+1 más

C

Ahmet A.

@coyoteee

•

hace 7 años

5,0

$47,00 USD

Project for vw8150693vw

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

+1 más

C

Ahmet A.

@coyoteee

•

hace 7 años

5,0

$10,00 USD

Project for vw8150693vw

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

+1 más

B

Closed User

@budourbedo

•

hace 7 años

Experiencia

Cisco Systems

sept 2014 - Presente

Skills: Java, Javascript

Educación

Bachelor Degree in Computer Engineering

Palestinian Territory

2010 - 2015

(5 años)

Contacta Mohammad K. sobre tu trabajo

Inicia sesión para comentar cualquier detalle por chat.

Verificaciones

Freelancer preferente

Identidad verificada

Pago verificado

Teléfono verificado

Email verificado

Facebook conectado

Certificaciones

US English 1

90%

Java 1

85%

Foundation vWorker Member

Principales habilidades

12

11

7

6

6

Explorar freelancers similares

Java Developers in Palestinian Territory

Java Developers

PostgreSQL Developers

Explorar galerías similares

Usuario anterior

Usuario siguiente

¡Invitación enviada correctamente!

¡Gracias! Te hemos enviado un enlace para reclamar tu crédito gratuito.

Algo salió mal al enviar tu correo electrónico. Por favor, intenta de nuevo.

Cargando visualización previa

Permiso concedido para Geolocalización.

Tu sesión de acceso ha expirado y has sido desconectado. Por favor, inica sesión nuevamente.