proxies ⋆ 100% Private Proxies - Fast, Anonymous, Quality, Unlimited USA Private Proxy!

Create a class student with public member variables

Create a class Student with public member variables: Student name, student number, contact number, ID number. The following specifications are required:

 Add init() method of the class that initializes string member variables to empty strings and numeric values to 0.

 Add the method populate() to the class. The method is used to assign values to the member variables of the class.

 Add the method display() to the class. The method is used to display the member variables of the class.

 Create an instance StudentObj of the class Student in a main program.

 The main program should prompt the user to enter values for five students. The attributes should be assigned to the instance of Student using its populate() method, and must be displayed using the display() method of the instance of Student.

How to lock IIS server files through a shell?

After uploading a shell to a .net site (.aspx extensions) and get it to work, is there any way to execute a command through that shell to increase the security of that site/server so that no one else can upload any other shell?

In other words, let’s say I have access to a shell. I can execute shell commands or windows commandline commands through it. How do I increase the security of that site/server through that shell?

Best practices for managing content change requests?

Hi all!

I'm trying to improve our content change request process. We have 1,000+ pieces of content and a small writing staff. We're having challenges keeping up with demand. Essentially, we've created a tool that allows users to request changes to an article, a ticket is created, and then routed to our writing team.

We receive a change request when:

there's a product update
if a user, either an internal CS agent or customer, leaves feedback
an image becomes outdated
a…

Best practices for managing content change requests?

Scrapebox Link Extractor problem socket error 10038

.png problem-socket-error-scrapebox-vps-10038.png (Size: 34.58 KB / Downloads: 1)
Hello,

I have 3 VPS with windows server 2012 from the same provider. I have one scrapebox on each.
It’s been month I’m using it. It was working great until 3 weeks ago.

Before I was doing link extractor with 500 threads no problem.
Now, when I do a link extractor I have a socket error 10038 on almost all urls. (see image).

It’s working only if I use 1 thread with 5 seconds delay (or more).

I have checked the windows parameters, there is no firewall and no virus software installed or enabled.

Is it possible that it’s the VPS provider that is limiting the connexion ?

Does someone had the same error previously ? Anyone

Thanks a lot

Why in BFPRT (median of medians) algorithm the partition of the array by $7$ blocks would work but with the $3$ fail?

I am working with the median-median algorithm or BFPRT algorithm and I seek to understand why would the partition of the array by $ 7$ blocks would work but with the $ 3$ fail?

If we divide into blocks of $ 7$ then we will get: Solving it by substitution I think the following manner: It is a recursive tree. In the worst case it takes $ T(10n/14)$ time. So in the worst case it goes down to the bottom by $ (10/14)^kn=1$ steps; $ k=log_{14/10}n$ . At each level of recursive tree the total cost is $ \le cn$ for some constant $ c$ . So by the simplified assumptions using substitution $ k < n$ $ T(n)\le dn \log(n)$

$ T(n) \le T(n / 7) + T(10n / 14) + O(n) \le d\frac{n}{7}lg(n/7)+d\frac{10n}{14}lg(10n/14)+cn \le d(\frac{n}{7}lgn – \frac{n}{7}lg7) + d(\frac{10n}{14}lgn – \frac{10n}{14}lg10/14) + cn = d\frac{12n}{14}lgn – d\frac{n}{7}lg7 – d\frac{10n}{14}lg\frac{10}{14} + cn=d\frac{12n}{14}lgn – d\frac{n}{7}lg7 – d\frac{10n}{14}lg10 – d\frac{10n}{14}lg14 + cn \le d\frac{12n}{14}lgn + cn$

So, $ T(n) = O(nlgn)$

The same way for blocks of size $ 3$ .

$ T(n) \le T(n / 3) + T(2n / 3) + O(n)$ we get $ T(n) = O(nlgn)$

Now, how to show that $ T(n)$ for 7 is also $ O(n)$ and for 3 it can not be $ O(n)$ . Also, in general how can I guess that the $ T(n)$ is also $ O(n)$ because here in both cases my thoughts are they both $ O(nlogn)$ ?

What data structure or algorithms to solve this problem

You have a unsorted array of process groups in a way (Name of process, Total threads the process wants to run), for example –

process_group = [(A, 40),(B,10), (C,20),(D,30),(E,100),(F,60)]

The system can run only 150 maximum threads, no limit on number of processes. Calculate the maximum number of threads which can be run to accommodate all process in system and utilize maximum thread limit.

The answer in this particular case is 30. How I approached, we have six groups, so the average of maximum allowed thread is 150/6 =25, so it can run maximum 25 threads if system has to accommodate all processes, but this is not efficient as we have less than 25 threads in few processes and system will be under utilized. To optimize it sort the array and subtract the average from each element and calculate new average and keep traversing until we hit a value larger than available average. So For this case, (B,10), (C,20), (D,30) will run on full, rest all will be able to run only maximum of 30 threads, making the total 150.

I looked on Hackerrank and Leetcode but couldn’t find anything similar, not sure which DS/Algo this problem relates to or a variation of something.

Concatenate multiple integer arrays such that number of inversions in resulting array is minimal

Given N arrays of variable length.

Find a way to concatenate the arrays in such a way that the number of inversions is minimum

An inversion for an array Arr can be defined as,

a pair of indices (i,j) such that,

i != j  i < j  Arr[i]>Arr[j]

I tried to concatenate the arrays on the basis of sum, such that the one with minimal sum goes first and one with maximal sum goes last.

It didn’t work out though.

Example:-

[14, 18, 18, 20, 16, 6, 11] SUM:- 103  [2, 4, 11, 40, 20, 14, 19] SUM:- 110  [14, 18, 18, 20, 16, 6, 11, 2, 4, 11, 40, 20, 14, 19] Inversions:- 42  [2, 4, 11, 40, 20, 14, 19, 14, 18, 18, 20, 16, 6, 11] Inversions:- 40

How to prove statement $X=M$ using Isabelle/HOL?

Can anyone please help me to prove $ X=M$ using the following set of the equation(first-order logic)in Isabelle/HOL?

$ N>=M$

$ \forall n. 0\leq n<N \rightarrow n<M$

$ X=N$

where $ N, M, X$ are integers constant. $ n$ integer variable.

Get Hash from PKIsignature

I have a PKIsignature and a certificate attached to same file, How can I:

extract public key from certificate chain
use public key to get hash file from PKIsignature

DBNmqrbZ+cC9Y07ISjzSqROnic5Az8qEwXb04aRGTn57xf8uzOfuovoo+Lfoen1myezz06kLWsaR pL0HsJBFwj/qSHWKuLiQ5kOEeVGMlMlFjQ8bsss8uLHZWXnk7c56I9QI/B+pjGCAo2bowzYtWBEg 0Yib8TNAX26KuhNg3e8P76Jn0A3YeTd6zM4mtNo1LCa0KyQjs5fC18Tw4sjii49hXDd76aOdCyvf 4XW66EWlUECEP1C7MlpZIGOu8X9rQ9nR/vwm9LL+hlkWjblBfGMazQp9o8OVXszkdxxGkW7EKpGO Gk1cAf2AYz0jIGpVvB39wGvV8K+RlKp9Mdnidw==

<certificatechain> <prodcert> -----BEGIN CERTIFICATE----- MIIETzCCAzegAwIBAgIBATANBgkqhkiG9w0BAQUFADB3MQswCQYDVQQGEwJTRTEUMBIGA1UEChML RXJpY3Nzb24gQUIxFzAVBgNVBAsTDkxpY2Vuc2UgQ2VudGVyMTkwNwYDVQQDEzBQcm9kQ0EgZm9y IFNpZ25pbmcgbGljZW5zZSBmaWxlcyBDQVggMTA2IDAwODQvMzAwIhgPMjAxMDA4MTgwMDAwMDBa GA8yMDM3MDEyOTAwMDAwMFoweTELMAkGA1UEBhMCU0UxFDASBgNVBAoTC0VyaWNzc29uIEFCMRcw FQYDVQQLEw5MaWNlbnNlIENlbnRlcjE7MDkGA1UEAxMyUHJvZENlcnQgZm9yIFNpZ25pbmcgbGlj ZW5zZSBmaWxlcyBDQVggMTA2IDAwODQvMzAwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIB AQDJGSjP1jKZ2iU/dvPXNnbnnAJzlD7IJCUK52Z05mqkhhKkq3y3yk7csgccVau0bdh1vxcGMaCA sWD/AObajxVCnBWRa/UqssBNPT/iUv3XuRyZjfZX3N+2LukAIBHwo1lyHzcbfRp23iOEz1Ukld3M K6lZdNYfG4LX4TG7NP84G0mup4IWG2zLMaDmuuu62gNKMyCGTLkZnlit7EYTvaaeKy87tzml3+LV XsZg44wdpzKPVjhDLv7MsEvUcMoCPxwEaIhxnmBtDIzOFWLkH7IE/GMCKCIKMEnM72EqAbvDZlAN sFzodJrc6dGmkOrh64UMkqqRV2dwGvjTSiib4u1bAgMBAAGjgd8wgdwwHQYDVR0OBBYEFKbrXFxx +q8fMddvJ+/64doCfCclMIGfBgNVHSMEgZcwgZSAFEScAtYIv8bwxTwbljdHEf5/zOWuoXmkdzB1 MQswCQYDVQQGEwJTRTEUMBIGA1UEChMLRXJpY3Nzb24gQUIxFzAVBgNVBAsTDkxpY2Vuc2UgQ2Vu dGVyMTcwNQYDVQQDEy5Sb290IGZvciBTaWduaW5nIGxpY2Vuc2UgZmlsZXMgQ0FYIDEwNiAwMDg0 LzMwggEEMAwGA1UdEwEB/wQCMAAwCwYDVR0PBAQDAgeAMA0GCSqGSIb3DQEBBQUAA4IBAQCf4nlk WsylZf038+RMM2x++mdxqlYD9SKhbJOwNzZIkscLL9HWNaBsuRD1xEYz3IAlurybSJA0wnIkkzr6 K6roDoU4fteUj/cYL2rUNT48Sql4X7hgQBuqjCX9g8UFpwKD+DkLXEyyf/w8bjD3Jwq1mvjM38Od RRot74KBOA2noWsahpXOGWiqDFHyo8NU7I57dGbof29mlk3lJT5bBa7XiKfdOrZkKHDCNmcrX0Ih xTOEyfj7cD4jfnoPq7N8aAMTIsM3wfKjdMI+ImGQ9NZZs9tdAGI3kTgmUtd6Q9Zjx/NJrq6Eg35k G5ox6BgWdhkZrCLdW5deZjxDuFZFrvN4 -----END CERTIFICATE-----</prodcert>  <cacert>-----BEGIN CERTIFICATE----- MIIEYTCCA0mgAwIBAgIBBDANBgkqhkiG9w0BAQUFADB1MQswCQYDVQQGEwJTRTEUMBIGA1UEChML RXJpY3Nzb24gQUIxFzAVBgNVBAsTDkxpY2Vuc2UgQ2VudGVyMTcwNQYDVQQDEy5Sb290IGZvciBT aWduaW5nIGxpY2Vuc2UgZmlsZXMgQ0FYIDEwNiAwMDg0LzMwMCIYDzIwMTAwODE4MDAwMDAwWhgP MjAzNzAxMzAwMDAwMDBaMHcxCzAJBgNVBAYTAlNFMRQwEgYDVQQKEwtFcmljc3NvbiBBQjEXMBUG A1UECxMOTGljZW5zZSBDZW50ZXIxOTA3BgNVBAMTMFByb2RDQSBmb3IgU2lnbmluZyBsaWNlbnNl IGZpbGVzIENBWCAxMDYgMDA4NC8zMDCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAKQT U+028VeuilkrN4gENoz8zgbwdbsKpmggjPHkOR08qn+homYCIuyZBNnZmB9NQ+8/EUwRYO0vKmSD fQkKFEKJUejpuqWb6isUZYNg+TiRIRCtR3qA9bf9r6+opJgXeLoKypIl5Uav1TndcUPupUeXv6gr XHkTbJjggwjZnZaV5qZcjLUHkE2VqqK7LsBCZA2eD+tqSM8Mdcy2bXvfwL2RhR1FgoVxdtdp7g9V yuVZsjDilTM4yNRRpT2h/YjHlg47oqcgQjlunJnHdwrqpfO29FaRocVwhEQi5R9EcbGMRJoBZbFR jzn3JNdvjnZehU4AaxotBosiAMOsIjTFBSsCAwEAAaOB9TCB8jAdBgNVHQ4EFgQURJwC1gi/xvDF PBuWN0cR/n/M5a4wga8GA1UdIwSBpzCBpIAUMlQWj9gJVHqZdyc0TFqgoFk0RLihgYikgYUwgYIx CzAJBgNVBAYTAlNFMQswCQYDVQQHEwJMSTEUMBIGA1UEChMLRXJpY3Nzb24gQUIxFzAVBgNVBAsT DkxpY2Vuc2UgQ2VudGVyMTcwNQYDVQQDEy5Sb290IGZvciBTaWduaW5nIGxpY2Vuc2UgZmlsZXMg Q0FYIDEwNiAwMDg0LzMwggEBMBIGA1UdEwEB/wQIMAYBAf8CAQAwCwYDVR0PBAQDAgEGMA0GCSqG SIb3DQEBBQUAA4IBAQApQbEktThX3XFQCu1KXgzoWzYgXf0lkes3fMeGMQq9MMqMlm0LudG9HHx+ Hue8gGduChXBXfI04P08yznlHNkF+6FVvOPeu93K704mnr5fU4U3Myzewl6PreSSxBp7uS/11tgk 12yfkF00JFuxGbG+ERl9Gv3lpC7IVPCTLN4TqHuz+0vFrKC4sTsVhMdGj81h0wz389eZtZBDOZb4 sgT1UZiZb8/32TQQndtZJaDxr9Z/pvF8seVjNMvrhfqBGyxT6+QAquJK5RLwuOuqXYTjSmJQe5qq DILKWj87/NCOe/YQTswqfhnHM+Bz0NZCuXZ4HzLAaQsbqcyTOvR8C4cw -----END CERTIFICATE----- </cacert> </certificatechain>