zubairfarahi
1) Bachelor of Computer Science (Politehnica University of Bucharest). 2) Master MSc (Politehnica University of Bucharest)
canada
Pinned Repositories
AnaGrams
Android-Image-Cropper
Image Cropping Library for Android, optimized for Camera / Gallery.
Assembly-Intel-x86
awesome
:sunglasses: Curated list of awesome lists
awesome-android-ui
A curated list of awesome Android UI/UX libraries
Data-Structures
Rabbits are hunted by evil wolves and the only escape is to get them into the lair. There are N bunnies and N bees, and you have the distances from each bunny to each lair. You need to help them and calculate which rabbit will go in that lair so that the sum of the distances traveled by each of them is minimal.
DataStructure-_-priority-_C
ok in this project i was given some funtion to do a particullar work on that , so the first function was openning the counter , but before when i was doing that first i did the two othere function which was calculating of the counter desk people and 2nd calculating all the desk member , so in that fucntion "calculeaza_numar_oameni_ghisee" i have creat loca variable intiliaz to 0 then i check first if my counter are not close or null then the loop will run and will check every person avilabilty and will print the number of peope on desk, and the 2nd is also quite simple like that but little wast then first there i use in loop the countghies static globel varibale which is store my counters number and it will count all the counters people, know back to first function at that i have creat and array of dubly linkedlist which will control of the deskcounters and will make open the counter for it if we had already the open counter then i have did the code to make divide every person to the respectivly counters, in the next fucntion was inserting the people to respectivly counter but in such case where the high priorites first if i found the two priorites same then i sorted by the name and also for this case i use some of the string builten functions also to make my work esay all the work i did in this fucntion loops+condations to make sort the prople in the lines. and so on the deletion function i did same what i have work and learn from the lab and curs not new methods on those function , and yeah that is all :)
Ip-conversion
Linux-Bash
implementation of Linux Bash
MiniCAD
CAD [1] (Computer-Aided Design or Computer-Aided Design and Drawing) is the use of technology to create designs (generally 2D) and replaces the manual drawing process of a piece with an automated one. One of the most popular such programs is AutoCAD. Such programs improve the designer's design quality and productivity.
zubairfarahi's Repositories
zubairfarahi/Networking
in this Repository you will find almost all of the protocols implemented in C or C++ of Networking of OSI Model , Plus some Applications.
zubairfarahi/Parallel-Merge-Sort-
Designing a program that can parallelize the merge sorting algorithm into multiple threads. Implemented using pthread, FPGA/OpenCL(on De1SoC board) and CUDA(on Amazon EC2).
zubairfarahi/java-design-patterns
Design patterns implemented in Java
zubairfarahi/design-algorithm-and-analysis
zubairfarahi/Cache-System-for-Linux-OS
a simple Cashe System for linux which used the LRU,FIFO,RLRU methods for making
zubairfarahi/MiniCAD
CAD [1] (Computer-Aided Design or Computer-Aided Design and Drawing) is the use of technology to create designs (generally 2D) and replaces the manual drawing process of a piece with an automated one. One of the most popular such programs is AutoCAD. Such programs improve the designer's design quality and productivity.
zubairfarahi/Matlab
this Repository includes different files such us : tic-tac-toe game(job.m), base.m,morse_decode.m,morse_encode.m etc.. done in Matlab
zubairfarahi/Multithreaded-Merge-Sort
An implementation of the merge sort algorithm using pthreads
zubairfarahi/Linux-Bash
implementation of Linux Bash
zubairfarahi/Ip-conversion
zubairfarahi/Data-Structures
Rabbits are hunted by evil wolves and the only escape is to get them into the lair. There are N bunnies and N bees, and you have the distances from each bunny to each lair. You need to help them and calculate which rabbit will go in that lair so that the sum of the distances traveled by each of them is minimal.
zubairfarahi/DataStructure-_-priority-_C
ok in this project i was given some funtion to do a particullar work on that , so the first function was openning the counter , but before when i was doing that first i did the two othere function which was calculating of the counter desk people and 2nd calculating all the desk member , so in that fucntion "calculeaza_numar_oameni_ghisee" i have creat loca variable intiliaz to 0 then i check first if my counter are not close or null then the loop will run and will check every person avilabilty and will print the number of peope on desk, and the 2nd is also quite simple like that but little wast then first there i use in loop the countghies static globel varibale which is store my counters number and it will count all the counters people, know back to first function at that i have creat and array of dubly linkedlist which will control of the deskcounters and will make open the counter for it if we had already the open counter then i have did the code to make divide every person to the respectivly counters, in the next fucntion was inserting the people to respectivly counter but in such case where the high priorites first if i found the two priorites same then i sorted by the name and also for this case i use some of the string builten functions also to make my work esay all the work i did in this fucntion loops+condations to make sort the prople in the lines. and so on the deletion function i did same what i have work and learn from the lab and curs not new methods on those function , and yeah that is all :)
zubairfarahi/pthread_merge_sort
Parallelized merge sort using C pthreads.
zubairfarahi/al-go-rithms
:musical_note: Algorithms written in different programming languages - https://zoranpandovski.github.io/al-go-rithms/
zubairfarahi/learn-react
:boom: Learn React.js for high performance Universal JavaScript Web & Mobile Applications.
zubairfarahi/parallel-programming-playground
Codes I wrote while learning Parallel Programming. (Pthreads, MPI. OpenMP)
zubairfarahi/learntosolveit
Learn How to Solve a problem using your favorite programming language.
zubairfarahi/c-algorithms
A library of common data structures and algorithms written in C.
zubairfarahi/Leetcode_java_solution
zubairfarahi/cs370-winter-2016
Parallel and Distributed Programming
zubairfarahi/MultithreadingJava
The code for the Java multithreading course by John Purcell from Cave of Programming http://www.caveofprogramming.com/library/index.html
zubairfarahi/parallel_quicksort
CS415 - Parallel Programming - HW1 - Parallel Quicksort Using Pthreads