iambhanuka Goto Github PK

algo

Searching algo

api-call-aplication

assingment

bhanuka

My Personal Portfolio

bhanuka9519.github.io

buyme-vehicle-mobile-app-ui

easy-fix-web

Web System

easy_fix

Group Project

easyfix-new

mobile app for mechanics

escar

This is mobile application to read the barcode state.

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.

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++

is1104-task1

First lesson

is1104al

is1104al.

java-system

information system RAD project

kiyawamu

This is a library management system developed for the middleware subject. I contributed to the api development.

login-and-signup-ui-adobe-xd

XD design login and signup

maft

Mobile Application For Tabulation

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

mobileappdev

moodle-scorm-quiz-visualization-

Create a visualizer for moodle scorm quizes

music-player

selmo-sales-and-marketing-platform

SALES AND MARKETING PLATFORM create in php and mysql this is a group project

ucsc-bhanuka

ucsc_amanda

web-server-using-c

Web server running and only gives the same page for all the client request

whereto