windows – Can I create a policy to disable a computer or user at a certain time?

Windows domain.
We close at 5.
I’ve been asked to disable certain computers/users at 5:15.

I know how to restrict access to the file system on the hour, but
a] that doesn’t give enough grace time or too much, and
b] doesn’t restrict enough, it only cripples

algorithms – Filtering Messages – Computer Science Stack Exchange

I saw this question posted and can’t seem to find it for some reason, so I’m posting it again.

There’s a leetcode problem that’s asking for the number of possible strings that are alphabetically between 2 strings (A and B) of equal length such that string C is not a substring of any of the strings. How would you approach solving it?

I solved the trivial case where if C.length = A.length and C is lexographically not between A and B, the answer is just the number of possible strings between A and B. The problem is I don’t understand how to solve the normal case where we try to calculate the number of strings that contain C by “growing” C (ie. adding characters on either end).

problem statement problem statement continued

algorithms – Recurrence equation – Computer Science Stack Exchange

What is the recurrence equation of this function and how to calculate it

public static void recursif( ArrayList< Borne > V, ArrayList< Pair > resultat ) {
        if( 1 < V.size() ) {
            ArrayList< Borne > V1  = new ArrayList< Borne >();
            ArrayList< Borne > V2  = new ArrayList< Borne >();
            ArrayList< Borne > Sd1 = new ArrayList< Borne >();
            ArrayList< Borne > Sd2 = new ArrayList< Borne >();
            ArrayList< Borne > Sf1 = new ArrayList< Borne >();
            ArrayList< Borne > Sf2 = new ArrayList< Borne >();

            double minima = V.get( 0 ).valeur;
            double maxima = V.get( V.size() - 1 ).valeur;

            int i = 0;
            for( ; i < V.size() / 2; ++ i ) {
                Borne b = V.get( i );
                V1.add( b );
                if( Borne.Cote.FIN == b.cote ) {
                    Sf1.add( b );
                } else if( maxima <= b.parent.fin ) {
                    Sd1.add( b );
                }
            }
            for( ; i < V.size(); ++ i ) {
                Borne b = V.get( i );
                V2.add( b );
                if( Borne.Cote.DEBUT == b.cote ) {
                    Sd2.add( b );
                } else if( b.parent.debut <= minima ) {
                    Sf2.add( b );
                }
            }

            ajouterProduitCroise( Sd1, Sd2, resultat );
            ajouterProduitCroise( Sd1, Sf2, resultat );
            ajouterProduitCroise( Sf1, Sf2, resultat );

            recursif( V1, resultat );
            recursif( V2, resultat );
        }
    }
```

computer architecture – Is it possible to transmit bits digitally?

Thanks for contributing an answer to Computer Science Stack Exchange!

  • Please be sure to answer the question. Provide details and share your research!

But avoid

  • Asking for help, clarification, or responding to other answers.
  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.

To learn more, see our tips on writing great answers.

Synchronization in Distributed Systems – Computer Science Stack Exchange

If there is no global clock in Distributed systems , then what is the solution for synchronization in DS ? Also , no global clock in DS is a direct consequence of the fact that the only communication is by sending messages through a network. Can someone please explain how the communication via message passing has resulted in no global clock ?

algorithms – Filtering Messages – Computer Science Stack Exchange

I came across this problem on Leetcode (original, section 2; also attached below).

I thought it would be as simple as counting the lexicographic difference between 2 strings (as exemplified here) and then removing 26*(length(A) - length(C) + 1).

I’ve tried with a couple different strings and this doesn’t seem to give the correct answer. Any ideas on how to solve this?

problem statement problem statement continued

statistics – what is instrument validation in computer science?

I’m writing an assignment involving some statistics comparing different implementation methods for web applications. I’ll be using some downloaded software and web pages I create, on both virtualized environments (docker, VM, cloud) and bear metal. I intend to measure response times from the client side.

Do I need to have instrument validation and what would it look like?

vpn – How can I see ISAKMP packets via Wireshark on a client computer?

I am trying to learn more about the IPSec and VPN. I am using TunnelBear on Firefox. When I start VPN service, I only see TLS connections on Wireshark but not the ISAKMP or other IPSec related packets. I did another trial with the Cisco AnyConnect client and connected to my school. Still I see TLS connections but nothing about IPSec related messaging. In my test setup I am using my Windows PC and the required VPN software. The servers I am trying to connect should be VPN servers.

Do these programs use another method to connect to those servers? Why do I only see TLS connections? Thanks.

Object oriented programming – Computer Science Stack Exchange

Thanks for contributing an answer to Computer Science Stack Exchange!

  • Please be sure to answer the question. Provide details and share your research!

But avoid

  • Asking for help, clarification, or responding to other answers.
  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.

To learn more, see our tips on writing great answers.

computer architecture – Arithmetic on signed 12-bit octal number stored in sign magnitude form

What is 4365 − 3412 when these values represent signed 12-bit
octal numbers stored in sign-magnitude format? The result should be written in
octal. Show your work.

Octal to binary:

  • 4365: 100 011 110 101
  • 3412: 011 100 001 010

By recognising the role of the sign bit, we can
represent positive and negative 64-bit numbers in terms of the bit value times a
power of 2. The binary number x, where xi means the ith bit, represents the number:

(x11 * -2^11) + (x10 * 2^10) + (x9 * 2^9) + … + (x1 * 2^1) + (x0 * 2^0)

I have used the formula given above to convert the value of octal 4365 in decimal:

(1 * -2^11) + (1 * 2^7) + 2^6 + 2^5 + 2^4 + 2^2 + 2^0 = -2048 + 245 = -1803

Similarly, the value of octal 3412 in decimal is 1802.

Having obtained the two values in decimal, I subtract (-1803 – 1802), obtaining the result -3605.

Binary representation of 3605 is 111 000 010 101.

Converting it back to octal gives 7025.


This answer is wrong. It should be octal 7777 or decimal -3777.

The concept is not clear to me. Where am I going wrong?