iamBhanuka/file-handling-web-server-using-c iamBhanuka/file-handling-web-server-using-c

  • Stars
    star
    2
  • Language
    C
  • Created almost 5 years ago
  • Updated almost 5 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
iamBhanuka/file-handling-web-server-using-c
github

iamBhanuka

Reviews

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

Repository Details

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

More Repositories

1

Easy_fix

Group Project
Dart
4
star
2

web-server-using-c

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

selmo-sales-and-marketing-platform

SALES AND MARKETING PLATFORM create in php and mysql this is a group project
PHP
3
star
4

goto-app

goto location and send notification to you are hear
Kotlin
2
star
5

Ucsc-Bhanuka

2
star
6

Algo

Searching algo
Java
2
star
7

Easy-fix-web

Web System
CSS
2
star
8

IS1104al

CSS
2
star
9

whereTo

Kotlin
2
star
10

IS1104-task1

First lesson
2
star
11

music-player

Dart
2
star
12

Easyfix-new

mobile app for mechanics
Java
2
star
13

IS1104al.

2
star
14

java-system

information system RAD project
Java
2
star
15

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.
Java
2
star
16

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
Java
2
star
17

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++
C++
2
star
18

login-and-signup-ui-adobe-xd

XD design login and signup
1
star
19

Bhanuka9519.github.io

JavaScript
1
star
20

mobileAppDev

Java
1
star
21

api-call-aplication

assingment
Java
1
star
22

bhanuka

My Personal Portfolio
CSS
1
star
23

Buyme-vehicle-mobile-app-ui

1
star
24

moodle-scorm-quiz-visualization-

Create a visualizer for moodle scorm quizes
PHP
1
star