Pinned Repositories
Algo
Searching algo
Easy-fix-web
Web System
Easy_fix
Group Project
Easyfix-new
mobile app for mechanics
file-handling-web-server-using-c
Web server is running and gives the same page for all clients. Web server provides different and correct files for different client requests. Error handling. Handling multiple file typs and optimization..
goto-app
goto location and send notification to you are hear
hash-function
The file HashInt.txt (in a separate file) contains 100,000 integers all randomly chosen between 1 and 1,000,000 (there might be some repetitions). This is considered as an array of integers where the ith row of the file gives you the ith entry of the array. Given below are 9 "target sums", in increasing order: 231552, 234756, 596873, 648219, 726312, 981237, 988331, 1277361, 1283379. You are required to implement the hash table-based algorithm and determine, for each of the 9 target sums x, whether or not x can be formed as the sum of two entries in the given array.
selmo-sales-and-marketing-platform
SALES AND MARKETING PLATFORM create in php and mysql this is a group project
Ucsc_Amanda
web-server-using-c
Web server running and only gives the same page for all the client request
iamBhanuka's Repositories
iamBhanuka/Easy_fix
Group Project
iamBhanuka/selmo-sales-and-marketing-platform
SALES AND MARKETING PLATFORM create in php and mysql this is a group project
iamBhanuka/Ucsc_Amanda
iamBhanuka/web-server-using-c
Web server running and only gives the same page for all the client request
iamBhanuka/Algo
Searching algo
iamBhanuka/Easy-fix-web
Web System
iamBhanuka/Easyfix-new
mobile app for mechanics
iamBhanuka/file-handling-web-server-using-c
Web server is running and gives the same page for all clients. Web server provides different and correct files for different client requests. Error handling. Handling multiple file typs and optimization..
iamBhanuka/goto-app
goto location and send notification to you are hear
iamBhanuka/hash-function
The file HashInt.txt (in a separate file) contains 100,000 integers all randomly chosen between 1 and 1,000,000 (there might be some repetitions). This is considered as an array of integers where the ith row of the file gives you the ith entry of the array. Given below are 9 "target sums", in increasing order: 231552, 234756, 596873, 648219, 726312, 981237, 988331, 1277361, 1283379. You are required to implement the hash table-based algorithm and determine, for each of the 9 target sums x, whether or not x can be formed as the sum of two entries in the given array.
iamBhanuka/hashing-
The file HashInt.txt (in a separate file) contains 100,000 integers all randomly chosen between 1 and 1,000,000 (there might be some repetitions). This is considered as an array of integers where the ith row of the file gives you the ith entry of the array. Given below are 9 "target sums", in increasing order: 231552, 234756, 596873, 648219, 726312, 981237, 988331, 1277361, 1283379. You are required to implement the hash table-based algorithm and determine, for each of the 9 target sums x, whether or not x can be formed as the sum of two entries in the given array. Your answer should be in the form of a 9-bit string, with a 1 indicating "yes" for the corresponding target sum and 0 indicating "no". For example, if you discover that all of the target sums except for the 5th and the 7th one (i.e., except for 726312 and 988331) can be formed from pairs from the input file, then your answer should be "111101011" (without the quotes). The answer should be in the same order as the target sums listed above (i.e., in increasing order of the target). Create it in c++
iamBhanuka/IS1104-task1
First lesson
iamBhanuka/IS1104al
iamBhanuka/IS1104al.
iamBhanuka/java-system
information system RAD project
iamBhanuka/MAFT
Mobile Application For Tabulation
iamBhanuka/maximum-subarray-sum-naive-method
Suppose that you are given a one-dimensional array which contains both positive and negative integers. You are required to find the sum of contiguous subarray of elements which has the largest sum. For example, if the given array is {-10, -13, 23, -10, -11, 8, 13, -17}, then the maximum sub array sum is 23 with the highlighted elements. You are required to produce solutions using naive method a
iamBhanuka/music-player
iamBhanuka/Ucsc-Bhanuka
iamBhanuka/whereTo
iamBhanuka/api-call-aplication
assingment
iamBhanuka/bhanuka
My Personal Portfolio
iamBhanuka/Bhanuka9519.github.io
iamBhanuka/Buyme-vehicle-mobile-app-ui
iamBhanuka/login-and-signup-ui-adobe-xd
XD design login and signup
iamBhanuka/mobileAppDev
iamBhanuka/moodle-scorm-quiz-visualization-
Create a visualizer for moodle scorm quizes
iamBhanuka/Escar
This is mobile application to read the barcode state.
iamBhanuka/kiyawamu
This is a library management system developed for the middleware subject. I contributed to the api development.