iamBhanuka/Bhanuka9519.github.io

Stars
1
Language
JavaScript
Created over 4 years ago
Updated over 4 years ago

iamBhanuka/Bhanuka9519.github.io

iamBhanuka

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Easy_fix

web-server-using-c

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

selmo-sales-and-marketing-platform

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

goto-app

goto location and send notification to you are hear

Ucsc-Bhanuka

Algo

Easy-fix-web

IS1104al

whereTo

IS1104-task1

music-player

Easyfix-new

mobile app for mechanics

IS1104al.

java-system

information system RAD project

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

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.

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

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

login-and-signup-ui-adobe-xd

XD design login and signup

mobileAppDev

api-call-aplication

bhanuka

My Personal Portfolio

Buyme-vehicle-mobile-app-ui

moodle-scorm-quiz-visualization-

Create a visualizer for moodle scorm quizes