amnd1188

amnd1188's Stars

• iamBhanuka/IS1104-task1

  First lesson

  2

• iamBhanuka/Ucsc_Amanda

  3

• iamBhanuka/Ucsc-Bhanuka

  21

• iamBhanuka/IS1104al

  Language:CSS2

• iamBhanuka/IS1104al.

  2

• iamBhanuka/MAFT

  Mobile Application For Tabulation

  2

• iamBhanuka/music-player

  Language:Dart2

• iamBhanuka/Algo

  Searching algo

  Language:Java2

• iamBhanuka/Easy-fix-web

  Web System

  Language:CSS2

• iamBhanuka/whereTo

  Language:Kotlin2

• iamBhanuka/goto-app

  goto location and send notification to you are hear

  Language:Kotlin2

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

  Language:Java2

• iamBhanuka/Easyfix-new

  mobile app for mechanics

  Language:Java2

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

  Language:C++21

• 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

  Language:Java2

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

  Language:C2

• iamBhanuka/web-server-using-c

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

  Language:C31

• iamBhanuka/selmo-sales-and-marketing-platform

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

  Language:PHP3

• iamBhanuka/java-system

  information system RAD project

  Language:Java2

• iamBhanuka/Easy_fix

  Group Project

  Language:Dart41