Freelancer logosu Nasıl Çalışırİşlere Göz Atın
Giriş Kaydolun
Bir Proje İlan Edin
Profil kapak fotoğrafı
Şu anda adlı kullanıcıyı takip ediyorsunuz
Kullanıcıyı takip etmede hata.
Bu kullanıcı kullanıcıların kendisini takip etmesine izin vermiyor.
Zaten bu kullanıcıyı takip ediyorsunuz.
Üyelik planınız sadece 0 takibe izin veriyor. Buradan yükseltme yapın.
başarılı bir şekilde takipten çıkarıldı
Kullanıcının takip edilmesinde hata.
adlı kullanıcıyı başarılı bir şekilde tavsiye ettiniz
Kullanıcıyı tavsiye etmede hata.
Bir şeyler yanlış gitti. Lütfen sayfayı yenileyin ve tekrar deneyin.
E-posta başarılı bir şekilde doğrulandı.
Kullanıcı Avatarı
$10 USD / hour
PAKISTAN bayrağı
pindi gheb, pakistan
$10 USD / hour
Şu anda burada saat 1:07 ÖS
Ağustos 25, 2018 tarihinde katıldı
0 Tavsiye

Ghulam S.

@shabbirali5252

 0,0 (0 değerlendirme)
0,0
0,0
0%
0%
$10 USD / hour
PAKISTAN bayrağı
pindi gheb, pakistan
$10 USD / hour
Mevcut değil
Tamamlanmış İş
Mevcut değil
Bütçe Dahilinde
Mevcut değil
Zamanında
Mevcut değil
Tekrar İşe Alınma Oranı

I can help you in computer science and mathematics

I completed my MPhil. in computer science and networking from virtual University, Pakistan. I also get a master's degree in Mathematics I can teach you online and help you with your mathematical problems. So far I have teaching experience of eight years both at the college and university level. I can help you with most of the topics in mathematics from basic to advanced. Also, I can help to manage the data of your organization working as a virtual assistant.
Freelancer Data Processing Executives Pakistan
Data Processing Executives freelancerlarından Pakistan içinden olanlarının tümünü görün.

Ghulam S. ile işiniz hakkında iletişime geçin

Detayları sohbet üzerinden tartışmak için giriş yapın.

Portföy

9014746
A proof by induction consists of two cases. The first, the base case (or basis), proves the statement for n = 0 without assuming any knowledge of other cases. The second case, the induction step, proves that if the statement holds for any given case n = k, then it must also hold for the next case n = k + 1. These two steps establish that the statement holds for every natural number n The base case does not necessarily begin with n = 0, but often with n = 1, and possibly with any fixed natural number n = N, establishing the truth of the statement for all natural numbers n ≥ N.
problems of mathematical inducution
A proof by induction consists of two cases. The first, the base case (or basis), proves the statement for n = 0 without assuming any knowledge of other cases. The second case, the induction step, proves that if the statement holds for any given case n = k, then it must also hold for the next case n = k + 1. These two steps establish that the statement holds for every natural number n The base case does not necessarily begin with n = 0, but often with n = 1, and possibly with any fixed natural number n = N, establishing the truth of the statement for all natural numbers n ≥ N.
problems of mathematical inducution
A proof by induction consists of two cases. The first, the base case (or basis), proves the statement for n = 0 without assuming any knowledge of other cases. The second case, the induction step, proves that if the statement holds for any given case n = k, then it must also hold for the next case n = k + 1. These two steps establish that the statement holds for every natural number n The base case does not necessarily begin with n = 0, but often with n = 1, and possibly with any fixed natural number n = N, establishing the truth of the statement for all natural numbers n ≥ N.
problems of mathematical inducution
9014730
these problems belong to complexity like big O theta and omega
solution of problems related to complexity
these problems belong to complexity like big O theta and omega
solution of problems related to complexity
these problems belong to complexity like big O theta and omega
solution of problems related to complexity
8752062
ALL SOLUTIONS WHICH I PROVIDED TO MY CLIENTS IN DIFFERENTS FIELDS
MY ALL PROVIDED SOLUTIONS TO CUSTOMERS
ALL SOLUTIONS WHICH I PROVIDED TO MY CLIENTS IN DIFFERENTS FIELDS
MY ALL PROVIDED SOLUTIONS TO CUSTOMERS
ALL SOLUTIONS WHICH I PROVIDED TO MY CLIENTS IN DIFFERENTS FIELDS
MY ALL PROVIDED SOLUTIONS TO CUSTOMERS
ALL SOLUTIONS WHICH I PROVIDED TO MY CLIENTS IN DIFFERENTS FIELDS
MY ALL PROVIDED SOLUTIONS TO CUSTOMERS
ALL SOLUTIONS WHICH I PROVIDED TO MY CLIENTS IN DIFFERENTS FIELDS
MY ALL PROVIDED SOLUTIONS TO CUSTOMERS
ALL SOLUTIONS WHICH I PROVIDED TO MY CLIENTS IN DIFFERENTS FIELDS
MY ALL PROVIDED SOLUTIONS TO CUSTOMERS
9014746
A proof by induction consists of two cases. The first, the base case (or basis), proves the statement for n = 0 without assuming any knowledge of other cases. The second case, the induction step, proves that if the statement holds for any given case n = k, then it must also hold for the next case n = k + 1. These two steps establish that the statement holds for every natural number n The base case does not necessarily begin with n = 0, but often with n = 1, and possibly with any fixed natural number n = N, establishing the truth of the statement for all natural numbers n ≥ N.
problems of mathematical inducution
A proof by induction consists of two cases. The first, the base case (or basis), proves the statement for n = 0 without assuming any knowledge of other cases. The second case, the induction step, proves that if the statement holds for any given case n = k, then it must also hold for the next case n = k + 1. These two steps establish that the statement holds for every natural number n The base case does not necessarily begin with n = 0, but often with n = 1, and possibly with any fixed natural number n = N, establishing the truth of the statement for all natural numbers n ≥ N.
problems of mathematical inducution
A proof by induction consists of two cases. The first, the base case (or basis), proves the statement for n = 0 without assuming any knowledge of other cases. The second case, the induction step, proves that if the statement holds for any given case n = k, then it must also hold for the next case n = k + 1. These two steps establish that the statement holds for every natural number n The base case does not necessarily begin with n = 0, but often with n = 1, and possibly with any fixed natural number n = N, establishing the truth of the statement for all natural numbers n ≥ N.
problems of mathematical inducution
9014730
these problems belong to complexity like big O theta and omega
solution of problems related to complexity
these problems belong to complexity like big O theta and omega
solution of problems related to complexity
these problems belong to complexity like big O theta and omega
solution of problems related to complexity
8752062
ALL SOLUTIONS WHICH I PROVIDED TO MY CLIENTS IN DIFFERENTS FIELDS
MY ALL PROVIDED SOLUTIONS TO CUSTOMERS
ALL SOLUTIONS WHICH I PROVIDED TO MY CLIENTS IN DIFFERENTS FIELDS
MY ALL PROVIDED SOLUTIONS TO CUSTOMERS
ALL SOLUTIONS WHICH I PROVIDED TO MY CLIENTS IN DIFFERENTS FIELDS
MY ALL PROVIDED SOLUTIONS TO CUSTOMERS
ALL SOLUTIONS WHICH I PROVIDED TO MY CLIENTS IN DIFFERENTS FIELDS
MY ALL PROVIDED SOLUTIONS TO CUSTOMERS
ALL SOLUTIONS WHICH I PROVIDED TO MY CLIENTS IN DIFFERENTS FIELDS
MY ALL PROVIDED SOLUTIONS TO CUSTOMERS
ALL SOLUTIONS WHICH I PROVIDED TO MY CLIENTS IN DIFFERENTS FIELDS
MY ALL PROVIDED SOLUTIONS TO CUSTOMERS

Değerlendirmeler

Değişiklikler kaydedildi
Burada görülecek hiç değerlendirme yok!

Deneyim

WORKING AS IT Manager helpdesk support

PAKISTAN Oil limited
Ağu 2012 - Şu anda
Instruct and mentor individually applied technology and computer science majors as they work their way through each departments’ undergraduate programs Coordinate with faculty as well as outside personnel in discussing research opportunities, and represent department in requesting funding from the university finance department and private donors

working as mathematics teacher

SED PUNJAB
Ağu 2005 - Ağu 2012 (7 yıl)
Design teaching materials to sustain students’ interest in the subject. Prepare weekly lesson plans on time. Design appropriate teaching plans and schedules. Design coherent instruction methodology. Implement initiatives and teaching methodologies. Facilitate classroom procedures. Set culture standards for learning. Inculcate discipline in students. Monitor students’ progress in the subject. Design student assessment systems and methodologies.

Eğitim

MPHIL-COMPUTER SCIENCE

Virtual University of Pakistan , Pakistan 2016 - 2019
(3 yıl)

MASTER OF COMPUTER SCIENCE AND IT

Virtual University of Pakistan , Pakistan 2013 - 2015
(2 yıl)

B.Ed(Maths)

Allama Iqbal Open University, Pakistan 2012 - 2013
(1 yıl)

Nitelikler

E-COMMERCE MANAGEMENT

Ministry of Information Technology & Telecom PAKISTAN
2020
3 MONTH COURSE

DIGITAL LITRACY

Ministry of Information Technology & Telecom
2019
3 MONTH COURSE

FREELANCING

Ministry of Information Technology & Telecom PAKISTAN
2019
3 MONTH COURSE

Ghulam S. ile işiniz hakkında iletişime geçin

Detayları sohbet üzerinden tartışmak için giriş yapın.

Doğrulamalar

Tercih Edilen Freelancer
Kimlik Onaylı
Ödeme Onaylı
Telefon Onaylı
E-posta Onaylı
Facebook Bağlantılı

Önde Gelen Beceriler

Data Processing
Algorithm
Education & Tutoring
Machine Learning (ML)
Mathematics

Benzer Freelancerlara Göz Atın

Data Processing Executives in Pakistan
Data Processing Executives
Algorithm Experts
Education Tutors

Benzer Vitrinlere Göz Atın

Data Processing
Algorithm
Education & Tutoring
Machine Learning (ML)
Önceki Kullanıcı Sonraki Kullanıcı
Davet başarılı bir şekilde gönderildi!
Teşekkürler! Ücretsiz kredinizi talep etmeniz için size bir bağlantı gönderdik.
E-postanız gönderilirken bir şeyler yanlış gitti. Lütfen tekrar deneyin.
Freelancer logosu Turkey / Türkçe Yardım ve Destek FreeelancerKategorilerProjelerYarışmalarFreelancerlar Enterprise ÜyelikTercih Edilen Freelancer ProgramıProje YönetimiYerel İşlerPhoto AnywhereVitrinGeliştiriciler için APIOnaylanınDesktop App HakkındaHakkımızdaNasıl İşlerGüvenlikYatırımcıSite haritasıHikâyelerHaberlerTakımÖdüllerBasın BildirileriKariyer ŞartlarGizlilik PolitikasıŞartlar ve KoşullarTelif Hakkı Politikasıİş Etiği KurallarıÜcret ve BedellerPartnerlerEscrow.comLoadshiftWarrior Forum UygulamalarApple App Store logosu Google Play Logosu
Panoya kopyalama başarısız, lütfen izinlerinizi düzenledikten sonra tekrar deneyin.
Panoya kopyalandı.
Kayıtlı Kullanıcı İlan Edlien Toplam İş
Freelancer ® is a registered Trademark of Freelancer Technology Pty Limited (ACN 142 189 759)
Copyright © 2024 Freelancer Technology Pty Limited (ACN 142 189 759)
Ön izleme yükleniyor
Coğrafik konum için izin verildi.
Giriş oturumunuzun süresi doldu ve çıkış yaptınız. Lütfen tekrar giriş yapın.